Skip to content

Commit

Permalink
Merge pull request #6346 from openjournals/joss.06124
Browse files Browse the repository at this point in the history 
Merging automatically
  • Loading branch information
@editorialbot
editorialbot authored Jan 18, 2025
2 parents 7db5bb9 + 9724b01 commit 1467807
Show file tree
Hide file tree
Showing 4 changed files with 986 additions and 0 deletions.
283 changes: 283 additions & 0 deletions joss.06124/10.21105.joss.06124.crossref.xml
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,283 @@
<?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>20250118124929-a15b628f2358aafe735b78f7eb3e43933ccafcea</doi_batch_id>
<timestamp>20250118124929</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>mmh3: A Python extension for MurmurHash3</title>
</titles>
<contributors>
<person_name sequence="first" contributor_role="author">
<given_name>Hajime</given_name>
<surname>Senuma</surname>
<affiliations>
<institution><institution_name>National Institute of Informatics, Japan</institution_name></institution>
</affiliations>
<ORCID>https://orcid.org/0000-0001-8542-1768</ORCID>
</person_name>
</contributors>
<publication_date>
<month>01</month>
<day>18</day>
<year>2025</year>
</publication_date>
<pages>
<first_page>6124</first_page>
</pages>
<publisher_item>
<identifier id_type="doi">10.21105/joss.06124</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.5281/zenodo.14609826</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/6124</rel:inter_work_relation>
</rel:related_item>
</rel:program>
<doi_data>
<doi>10.21105/joss.06124</doi>
<resource>https://joss.theoj.org/papers/10.21105/joss.06124</resource>
<collection property="text-mining">
<item>
<resource mime_type="application/pdf">https://joss.theoj.org/papers/10.21105/joss.06124.pdf</resource>
</item>
</collection>
</doi_data>
<citation_list>
<citation key="adja_blockchain-based_2021">
<article_title>A blockchain-based certificate revocation management and status verification system</article_title>
<author>Adja</author>
<journal_title>Computers &amp; Security</journal_title>
<volume>104</volume>
<doi>10.1016/j.cose.2021.102209</doi>
<issn>0167-4048</issn>
<cYear>2021</cYear>
<unstructured_citation>Adja, Y. C. E., Hammi, B., Serhrouchni, A., &amp; Zeadally, S. (2021). A blockchain-based certificate revocation management and status verification system. Computers &amp; Security, 104, 102209. https://doi.org/10.1016/j.cose.2021.102209</unstructured_citation>
</citation>
<citation key="appleby_murmurhash3_2011">
<article_title>MurmurHash3 and SMHasher</article_title>
<author>Appleby</author>
<cYear>2011</cYear>
<unstructured_citation>Appleby, A. (2011). MurmurHash3 and SMHasher. https://github.com/aappleby/smhasher</unstructured_citation>
</citation>
<citation key="Bernhardt2023">
<article_title>On pinning and isolating CPU cores</article_title>
<author>Bernhardt</author>
<cYear>2023</cYear>
<unstructured_citation>Bernhardt, M. (2023). On pinning and isolating CPU cores. https://manuel.bernhardt.io/posts/2023-11-16-core-pinning/</unstructured_citation>
</citation>
<citation key="Bloom1970">
<article_title>Space/time trade-offs in hash coding with allowable errors</article_title>
<author>Bloom</author>
<journal_title>Commun. ACM</journal_title>
<issue>7</issue>
<volume>13</volume>
<doi>10.1145/362686.362692</doi>
<issn>0001-0782</issn>
<cYear>1970</cYear>
<unstructured_citation>Bloom, B. H. (1970). Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13(7), 422–426. https://doi.org/10.1145/362686.362692</unstructured_citation>
</citation>
<citation key="Broder1997a">
<article_title>On the resemblance and containment of documents</article_title>
<author>Broder</author>
<journal_title>Proceedings. Compression and complexity of SEQUENCES 1997</journal_title>
<doi>10.1109/SEQUEN.1997.666900</doi>
<isbn>0-8186-8132-2</isbn>
<cYear>1997</cYear>
<unstructured_citation>Broder, A. Z. (1997). On the resemblance and containment of documents. Proceedings. Compression and Complexity of SEQUENCES 1997, 21–29. https://doi.org/10.1109/SEQUEN.1997.666900</unstructured_citation>
</citation>
<citation key="collet_xxhash_2014">
<article_title>xxHash</article_title>
<author>Collet</author>
<cYear>2014</cYear>
<unstructured_citation>Collet, Y. (2014). xxHash. https://github.com/Cyan4973/xxHash</unstructured_citation>
</citation>
<citation key="collet_xxhash_comparison_2020">
<article_title>xxHash: Performance comparison (2020)</article_title>
<author>Collet</author>
<cYear>2020</cYear>
<unstructured_citation>Collet, Y. (2020). xxHash: Performance comparison (2020). https://github.com/Cyan4973/xxHash/wiki/Performance-comparison</unstructured_citation>
</citation>
<citation key="du_xxhash_2014">
<article_title>xxhash</article_title>
<author>Du</author>
<cYear>2014</cYear>
<unstructured_citation>Du, Y. (2014). xxhash. https://github.com/ifduyue/python-xxhash</unstructured_citation>
</citation>
<citation key="faraday_security_understanding_2022">
<article_title>Understanding Spring4Shell</article_title>
<author>Faraday Security</author>
<cYear>2022</cYear>
<unstructured_citation>Faraday Security. (2022). Understanding Spring4Shell. https://faradaysec.com/understanding-spring4shell/</unstructured_citation>
</citation>
<citation key="gorelick_high_2020">
<volume_title>High performance Python: Practical performant programming for humans</volume_title>
<author>Gorelick</author>
<isbn>978-1-4920-5502-0</isbn>
<cYear>2020</cYear>
<unstructured_citation>Gorelick, M., &amp; Ozsvald, I. (2020). High performance Python: Practical performant programming for humans (2nd edition). O’Reilly Media. ISBN: 978-1-4920-5502-0</unstructured_citation>
</citation>
<citation key="hugo_van_kemenade_2024_13624792">
<article_title>Hugovk/top-pypi-packages: Release 2024.09</article_title>
<author>Van Kemenade</author>
<doi>10.5281/zenodo.13624792</doi>
<cYear>2024</cYear>
<unstructured_citation>Van Kemenade, H., Si, R., &amp; Dollenstein, Z. (2024). Hugovk/top-pypi-packages: Release 2024.09 (Version 2024.09). Zenodo. https://doi.org/10.5281/zenodo.13624792</unstructured_citation>
</citation>
<citation key="kakwani_indicnlpsuite_2020">
<article_title>IndicNLPSuite: Monolingual corpora, evaluation benchmarks and pre-trained multilingual language models for Indian languages</article_title>
<author>Kakwani</author>
<journal_title>Findings of the Association for Computational Linguistics: EMNLP 2020</journal_title>
<doi>10.18653/v1/2020.findings-emnlp.445</doi>
<cYear>2020</cYear>
<unstructured_citation>Kakwani, D., Kunchukuttan, A., Golla, S., N. C., G., Bhattacharyya, A., Khapra, M. M., &amp; Kumar, P. (2020). IndicNLPSuite: Monolingual corpora, evaluation benchmarks and pre-trained multilingual language models for Indian languages. Findings of the Association for Computational Linguistics: EMNLP 2020, 4948–4961. https://doi.org/10.18653/v1/2020.findings-emnlp.445</unstructured_citation>
</citation>
<citation key="kihlander_pymmh3_2013">
<article_title>PYMMH3</article_title>
<author>Kihlander</author>
<cYear>2013</cYear>
<unstructured_citation>Kihlander, F., &amp; Gusani, S. (2013). PYMMH3. https://github.com/wc-duck/pymmh3</unstructured_citation>
</citation>
<citation key="kopriva_hunting_2021">
<article_title>Hunting phishing websites with favicon hashes</article_title>
<author>Kopriva</author>
<cYear>2021</cYear>
<unstructured_citation>Kopriva, J. (2021). Hunting phishing websites with favicon hashes. SANS Internet Storm Center. https://isc.sans.edu/diary/27326</unstructured_citation>
</citation>
<citation key="kumar_probabilistic_2021">
<volume_title>Probabilistic data structures for blockchain-based Internet of Things applications</volume_title>
<author>Kumar</author>
<doi>10.1201/9781003080046</doi>
<isbn>978-0-367-52990-1</isbn>
<cYear>2021</cYear>
<unstructured_citation>Kumar, N., &amp; Miglani, A. (2021). Probabilistic data structures for blockchain-based Internet of Things applications. CRC Press. https://doi.org/10.1201/9781003080046</unstructured_citation>
</citation>
<citation key="medjedovic_algorithms_2022">
<volume_title>Algorithms and data structures for massive datasets</volume_title>
<author>Medjedovic</author>
<isbn>978-1-61729-803-5</isbn>
<cYear>2022</cYear>
<unstructured_citation>Medjedovic, D., Tahirovic, E., &amp; Dedovic, I. (2022). Algorithms and data structures for massive datasets. Manning. ISBN: 978-1-61729-803-5</unstructured_citation>
</citation>
<citation key="Matherly2017">
<article_title>Complete guide to shodan: Collect. Analyze. Visualize. Make internet intelligence work for you.</article_title>
<author>Matherly</author>
<cYear>2017</cYear>
<unstructured_citation>Matherly, J. (2017). Complete guide to shodan: Collect. Analyze. Visualize. Make internet intelligence work for you. (Version 2017-08-23). Shodan.</unstructured_citation>
</citation>
<citation key="Matherly2024">
<article_title>Deep dive: http.favicon</article_title>
<author>Matherly</author>
<cYear>2024</cYear>
<unstructured_citation>Matherly, J. (2024). Deep dive: http.favicon. Shodan. https://blog.shodan.io/deep-dive-http-favicon/</unstructured_citation>
</citation>
<citation key="Peters2002">
<article_title>Algorithms: introduction</article_title>
<author>Peters</author>
<journal_title>Python cookbook</journal_title>
<cYear>2002</cYear>
<unstructured_citation>Peters, T. (2002). Algorithms: introduction. In A. Martelli &amp; D. Ascher (Eds.), Python cookbook (1st edition). O’Reilly Media.</unstructured_citation>
</citation>
<citation key="RodriguezGuerra2021">
<article_title>Is GitHub actions suitable for running benchmarks?</article_title>
<author>Rodríguez-Guerra</author>
<cYear>2021</cYear>
<unstructured_citation>Rodríguez-Guerra, J. (2021). Is GitHub actions suitable for running benchmarks? Quansight Labs. https://labs.quansight.org/blog/2021/08/github-actions-benchmarks</unstructured_citation>
</citation>
<citation key="Senuma2011">
<article_title>K-means clustering with feature hashing</article_title>
<author>Senuma</author>
<journal_title>Proceedings of the 49th annual meeting of the Association for Computational Linguistics: Student session</journal_title>
<cYear>2011</cYear>
<unstructured_citation>Senuma, H. (2011). K-means clustering with feature hashing. Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Student Session, 122–126.</unstructured_citation>
</citation>
<citation key="Senuma2016">
<article_title>Learning succinct models: Pipelined compression with L1-regularization, hashing, Elias–Fano indices, and quantization</article_title>
<author>Senuma</author>
<journal_title>Proceedings of COLING 2016, the 26th international conference on computational linguistics: Technical papers</journal_title>
<cYear>2016</cYear>
<unstructured_citation>Senuma, H., &amp; Aizawa, A. (2016). Learning succinct models: Pipelined compression with L1-regularization, hashing, Elias–Fano indices, and quantization. Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers, 2774–2784.</unstructured_citation>
</citation>
<citation key="Shi2009">
<article_title>Hash kernels for structured data</article_title>
<author>Shi</author>
<journal_title>Journal of Machine Learning Research</journal_title>
<volume>10</volume>
<cYear>2009</cYear>
<unstructured_citation>Shi, Q., Petterson, J., Dror, G., Langford, J., Smola, A., &amp; Vishwanathan, S. V. N. (2009). Hash kernels for structured data. Journal of Machine Learning Research, 10, 2615–2637.</unstructured_citation>
</citation>
<citation key="shodan_its_2021">
<article_title>It’s the MMH3 hash of the http.html property. See: PyPI mmh3</article_title>
<author>Shodan</author>
<journal_title>Twitter</journal_title>
<cYear>2021</cYear>
<unstructured_citation>Shodan. (2021). It’s the MMH3 hash of the http.html property. See: PyPI mmh3. In Twitter. https://twitter.com/shodanhq/status/1395501365456261122</unstructured_citation>
</citation>
<citation key="Stinner2016">
<article_title>My journey to stable benchmark</article_title>
<author>Stinner</author>
<cYear>2016</cYear>
<unstructured_citation>Stinner, V. (2016). My journey to stable benchmark. https://vstinner.github.io/journey-to-stable-benchmark-system.html</unstructured_citation>
</citation>
<citation key="Tang2024">
<article_title>Data splitting based double layer encryption for secure ciphertext deduplication in cloud storage</article_title>
<author>Tang</author>
<journal_title>2024 IEEE 17th International Conference on Cloud Computing (CLOUD)</journal_title>
<doi>10.1109/CLOUD62652.2024.00027</doi>
<cYear>2024</cYear>
<unstructured_citation>Tang, X., &amp; Jin, L. (2024). Data splitting based double layer encryption for secure ciphertext deduplication in cloud storage. 2024 IEEE 17th International Conference on Cloud Computing (CLOUD), 153–163. https://doi.org/10.1109/CLOUD62652.2024.00027</unstructured_citation>
</citation>
<citation key="Weinberger2009">
<article_title>Feature hashing for large scale multitask learning</article_title>
<author>Weinberger</author>
<journal_title>Proceedings of the 26th international conference on machine learning</journal_title>
<doi>10.1145/1553374.1553516</doi>
<cYear>2009</cYear>
<unstructured_citation>Weinberger, K., Dasgupta, A., Langford, J., Smola, A., &amp; Attenberg, J. (2009). Feature hashing for large scale multitask learning. Proceedings of the 26th International Conference on Machine Learning. https://doi.org/10.1145/1553374.1553516</unstructured_citation>
</citation>
</citation_list>
</journal_article>
</journal>
</body>
</doi_batch>
Binary file added joss.06124/10.21105.joss.06124.pdf
View file
Binary file not shown.
Loading

0 comments on commit 1467807

Please sign in to comment.