Skip to content

Creating pull request for 10.21105.joss.06233 #6313

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
editorialbot wants to merge 3 commits into from
Closed

Creating pull request for 10.21105.joss.06233 #6313

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
2846f76
Creating 10.21105.joss.06233.pdf
editorialbot Jan 9, 2025
7b656c3
Creating 10.21105.joss.06233.crossref.xml
editorialbot Jan 9, 2025
6ba98ca
Creating 10.21105.joss.06233.jats
editorialbot Jan 9, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
179 changes: 179 additions & 0 deletions joss.06233/10.21105.joss.06233.crossref.xml
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,179 @@
<?xml version="1.0" encoding="UTF-8"?>
<doi_batch xmlns="http://www.crossref.org/schema/5.3.1"
xmlns:ai="http://www.crossref.org/AccessIndicators.xsd"
xmlns:rel="http://www.crossref.org/relations.xsd"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
version="5.3.1"
xsi:schemaLocation="http://www.crossref.org/schema/5.3.1 http://www.crossref.org/schemas/crossref5.3.1.xsd">
<head>
<doi_batch_id>20250109041321-170fdee0296b1261d5b613d520dd2d07fcd6e2c5</doi_batch_id>
<timestamp>20250109041321</timestamp>
<depositor>
<depositor_name>JOSS Admin</depositor_name>
<email_address>[email protected]</email_address>
</depositor>
<registrant>The Open Journal</registrant>
</head>
<body>
<journal>
<journal_metadata>
<full_title>Journal of Open Source Software</full_title>
<abbrev_title>JOSS</abbrev_title>
<issn media_type="electronic">2475-9066</issn>
<doi_data>
<doi>10.21105/joss</doi>
<resource>https://joss.theoj.org</resource>
</doi_data>
</journal_metadata>
<journal_issue>
<publication_date media_type="online">
<month>01</month>
<year>2025</year>
</publication_date>
<journal_volume>
<volume>10</volume>
</journal_volume>
<issue>105</issue>
</journal_issue>
<journal_article publication_type="full_text">
<titles>
<title>Aerobus: a C++ template library for polynomials algebra over discrete Euclidean domains</title>
</titles>
<contributors>
<person_name sequence="first" contributor_role="author">
<given_name>Regis</given_name>
<surname>Portalez</surname>
<affiliations>
<institution><institution_name>COMUA, France</institution_name></institution>
</affiliations>
<ORCID>https://orcid.org/0000-0002-6291-3345</ORCID>
</person_name>
</contributors>
<publication_date>
<month>01</month>
<day>09</day>
<year>2025</year>
</publication_date>
<pages>
<first_page>6233</first_page>
</pages>
<publisher_item>
<identifier id_type="doi">10.21105/joss.06233</identifier>
</publisher_item>
<ai:program name="AccessIndicators">
<ai:license_ref applies_to="vor">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
<ai:license_ref applies_to="am">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
<ai:license_ref applies_to="tdm">http://creativecommons.org/licenses/by/4.0/</ai:license_ref>
</ai:program>
<rel:program>
<rel:related_item>
<rel:description>Software archive</rel:description>
<rel:inter_work_relation relationship-type="references" identifier-type="doi">10.6084/m9.figshare.28143233.v1</rel:inter_work_relation>
</rel:related_item>
<rel:related_item>
<rel:description>GitHub review issue</rel:description>
<rel:inter_work_relation relationship-type="hasReview" identifier-type="uri">https://github.com/openjournals/joss-reviews/issues/6233</rel:inter_work_relation>
</rel:related_item>
</rel:program>
<doi_data>
<doi>10.21105/joss.06233</doi>
<resource>https://joss.theoj.org/papers/10.21105/joss.06233</resource>
<collection property="text-mining">
<item>
<resource mime_type="application/pdf">https://joss.theoj.org/papers/10.21105/joss.06233.pdf</resource>
</item>
</collection>
</doi_data>
<citation_list>
<citation key="wang2014intel">
<article_title>Intel math kernel library</article_title>
<author>Wang</author>
<journal_title>High-performance computing on the intel xeon phi: How to fully exploit MIC architectures</journal_title>
<doi>10.1007/978-3-319-06486-4_7</doi>
<isbn>978-3-319-06486-4</isbn>
<cYear>2014</cYear>
<unstructured_citation>Wang, E., Zhang, Q., Shen, B., Zhang, G., Lu, X., Wu, Q., &amp; Wang, Y. (2014). Intel math kernel library. In High-performance computing on the intel xeon phi: How to fully exploit MIC architectures (pp. 167–188). Springer International Publishing. https://doi.org/10.1007/978-3-319-06486-4_7</unstructured_citation>
</citation>
<citation key="OEIS">
<article_title>On-line encyclopedia of integer sequences</article_title>
<unstructured_citation>On-line encyclopedia of integer sequences. (n.d.). https://oeis.org/.</unstructured_citation>
</citation>
<citation key="lang2012algebra">
<volume_title>Algebra</volume_title>
<author>Lang</author>
<volume>211</volume>
<doi>10.1007/978-1-4613-0041-0</doi>
<cYear>2012</cYear>
<unstructured_citation>Lang, S. (2012). Algebra (Vol. 211). Springer Science &amp; Business Media. https://doi.org/10.1007/978-1-4613-0041-0</unstructured_citation>
</citation>
<citation key="bourbaki2013algebra">
<volume_title>Algebra II: Chapters 4-7</volume_title>
<author>Bourbaki</author>
<doi>10.1007/978-3-642-61698-3</doi>
<cYear>2013</cYear>
<unstructured_citation>Bourbaki, N. (2013). Algebra II: Chapters 4-7. Springer Science &amp; Business Media. https://doi.org/10.1007/978-3-642-61698-3</unstructured_citation>
</citation>
<citation key="evariste1846memoire">
<article_title>Mémoire sur les conditions de résolubilité des équations par radicaux</article_title>
<author>Évariste</author>
<journal_title>Journal de mathématiques pures et appliquées, Ser</journal_title>
<issue>111846</issue>
<volume>1</volume>
<cYear>1846</cYear>
<unstructured_citation>Évariste, G. (1846). Mémoire sur les conditions de résolubilité des équations par radicaux. Journal de Mathématiques Pures Et Appliquées, Ser, 1(111846), 417–433.</unstructured_citation>
</citation>
<citation key="holt2005handbook">
<volume_title>Handbook of computational group theory</volume_title>
<author>Holt</author>
<doi>10.1201/9781420035216</doi>
<cYear>2005</cYear>
<unstructured_citation>Holt, D. F., Eick, B., &amp; O’Brien, E. A. (2005). Handbook of computational group theory. CRC Press. https://doi.org/10.1201/9781420035216</unstructured_citation>
</citation>
<citation key="heath1956thirteen">
<volume_title>The thirteen books of euclid’s elements</volume_title>
<author>Heath</author>
<cYear>1956</cYear>
<unstructured_citation>Heath, T. L., &amp; others. (1956). The thirteen books of euclid’s elements. Courier Corporation.</unstructured_citation>
</citation>
<citation key="horner1815new">
<article_title>A new method of solving numerical equations of all orders, by continuous approximation.</article_title>
<author>Horner</author>
<journal_title>Abstracts of the papers printed in the philosophical transactions of the royal society of london</journal_title>
<volume>2</volume>
<cYear>1815</cYear>
<unstructured_citation>Horner, W. (1815). A new method of solving numerical equations of all orders, by continuous approximation. Abstracts of the Papers Printed in the Philosophical Transactions of the Royal Society of London, 2, 117–117.</unstructured_citation>
</citation>
<citation key="knuth2014art">
<volume_title>Art of computer programming, volume 2: Seminumerical algorithms</volume_title>
<author>Knuth</author>
<doi>10.1137/1012065</doi>
<cYear>2014</cYear>
<unstructured_citation>Knuth, D. E. (2014). Art of computer programming, volume 2: Seminumerical algorithms. Addison-Wesley Professional. https://doi.org/10.1137/1012065</unstructured_citation>
</citation>
<citation key="karney2013algorithms">
<article_title>Algorithms for geodesics</article_title>
<author>Karney</author>
<journal_title>Journal of Geodesy</journal_title>
<volume>87</volume>
<doi>10.1007/s00190-012-0578-z</doi>
<cYear>2013</cYear>
<unstructured_citation>Karney, C. F. (2013). Algorithms for geodesics. Journal of Geodesy, 87, 43–55. https://doi.org/10.1007/s00190-012-0578-z</unstructured_citation>
</citation>
<citation key="graillat2006compensated">
<article_title>Compensated horner scheme</article_title>
<author>Graillat</author>
<journal_title>Algebraic and Numerical Algorithms and</journal_title>
<cYear>2006</cYear>
<unstructured_citation>Graillat, S., Langlois, P., &amp; Louvet, N. (2006). Compensated horner scheme. Algebraic and Numerical Algorithms and.</unstructured_citation>
</citation>
<citation key="aerobus_benchmarks_2023">
<article_title>Aerobus benchmarks</article_title>
<author>Comua</author>
<cYear>2024</cYear>
<unstructured_citation>Comua. (2024). Aerobus benchmarks (Version v1). Figshare. https://figshare.com/articles/dataset/Aerobus_benchmarks/27222777?file=49774845</unstructured_citation>
</citation>
</citation_list>
</journal_article>
</journal>
</body>
</doi_batch>
Binary file added joss.06233/10.21105.joss.06233.pdf
View file
Open in desktop
Binary file not shown.
Loading