{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2NHYOPE73ZBIEE4XKNGDVFBWJC","short_pith_number":"pith:2NHYOPE7","schema_version":"1.0","canonical_sha256":"d34f873c9fde42821397534c3a9436488165815e8fb74cbb597afd825532a53e","source":{"kind":"arxiv","id":"1607.06618","version":1},"attestation_state":"computed","paper":{"title":"Gerbil: A Fast and Memory-Efficient $k$-mer Counter with GPU-Support","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"cs.DS","authors_text":"Marius Erbert, Matthias M\\\"uller-Hannemann, Steffen Rechner","submitted_at":"2016-07-22T09:48:53Z","abstract_excerpt":"A basic task in bioinformatics is the counting of $k$-mers in genome strings. The $k$-mer counting problem is to build a histogram of all substrings of length $k$ in a given genome sequence. We present the open source $k$-mer counting software Gerbil that has been designed for the efficient counting of $k$-mers for $k\\geq32$. Given the technology trend towards long reads of next-generation sequencers, support for large $k$ becomes increasingly important. While existing $k$-mer counting tools suffer from excessive memory resource consumption or degrading performance for large $k$, Gerbil is abl"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1607.06618","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-22T09:48:53Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"638e12f3aef4f0b975e14c83ef45ee0975c5d3bfb152c7fec39e98bb3b3ace37","abstract_canon_sha256":"9fed2a8bc248afdd098adb20d1758fc16be564bae93ce0673696634a5f1cf1c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:39.443007Z","signature_b64":"4V61BDWuni+qMd4yTLaSNg+Cl2IhIO3SiA0zJi34kLxNFXZ/ggSuZKbhpAQxNV7rMdL8aMVIewhVk6bI4cMjAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d34f873c9fde42821397534c3a9436488165815e8fb74cbb597afd825532a53e","last_reissued_at":"2026-05-18T01:10:39.442498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:39.442498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gerbil: A Fast and Memory-Efficient $k$-mer Counter with GPU-Support","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"cs.DS","authors_text":"Marius Erbert, Matthias M\\\"uller-Hannemann, Steffen Rechner","submitted_at":"2016-07-22T09:48:53Z","abstract_excerpt":"A basic task in bioinformatics is the counting of $k$-mers in genome strings. The $k$-mer counting problem is to build a histogram of all substrings of length $k$ in a given genome sequence. We present the open source $k$-mer counting software Gerbil that has been designed for the efficient counting of $k$-mers for $k\\geq32$. Given the technology trend towards long reads of next-generation sequencers, support for large $k$ becomes increasingly important. While existing $k$-mer counting tools suffer from excessive memory resource consumption or degrading performance for large $k$, Gerbil is abl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06618","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.06618","created_at":"2026-05-18T01:10:39.442580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.06618v1","created_at":"2026-05-18T01:10:39.442580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06618","created_at":"2026-05-18T01:10:39.442580+00:00"},{"alias_kind":"pith_short_12","alias_value":"2NHYOPE73ZBI","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2NHYOPE73ZBIEE4X","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2NHYOPE7","created_at":"2026-05-18T12:29:55.572404+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2NHYOPE73ZBIEE4XKNGDVFBWJC","json":"https://pith.science/pith/2NHYOPE73ZBIEE4XKNGDVFBWJC.json","graph_json":"https://pith.science/api/pith-number/2NHYOPE73ZBIEE4XKNGDVFBWJC/graph.json","events_json":"https://pith.science/api/pith-number/2NHYOPE73ZBIEE4XKNGDVFBWJC/events.json","paper":"https://pith.science/paper/2NHYOPE7"},"agent_actions":{"view_html":"https://pith.science/pith/2NHYOPE73ZBIEE4XKNGDVFBWJC","download_json":"https://pith.science/pith/2NHYOPE73ZBIEE4XKNGDVFBWJC.json","view_paper":"https://pith.science/paper/2NHYOPE7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.06618&json=true","fetch_graph":"https://pith.science/api/pith-number/2NHYOPE73ZBIEE4XKNGDVFBWJC/graph.json","fetch_events":"https://pith.science/api/pith-number/2NHYOPE73ZBIEE4XKNGDVFBWJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2NHYOPE73ZBIEE4XKNGDVFBWJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2NHYOPE73ZBIEE4XKNGDVFBWJC/action/storage_attestation","attest_author":"https://pith.science/pith/2NHYOPE73ZBIEE4XKNGDVFBWJC/action/author_attestation","sign_citation":"https://pith.science/pith/2NHYOPE73ZBIEE4XKNGDVFBWJC/action/citation_signature","submit_replication":"https://pith.science/pith/2NHYOPE73ZBIEE4XKNGDVFBWJC/action/replication_record"}},"created_at":"2026-05-18T01:10:39.442580+00:00","updated_at":"2026-05-18T01:10:39.442580+00:00"}