{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DI6VRHYLKJ4KWDWLWBJAVZZ2AD","short_pith_number":"pith:DI6VRHYL","schema_version":"1.0","canonical_sha256":"1a3d589f0b5278ab0ecbb0520ae73a00d1400335ed899f53f6bf5e2185e278fd","source":{"kind":"arxiv","id":"1305.1861","version":1},"attestation_state":"computed","paper":{"title":"Turtle: Identifying frequent k-mers with cache-efficient algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"q-bio.GN","authors_text":"Alexander Schliep, Debashish Bhattacharya, Rajat Shuvro Roy","submitted_at":"2013-05-08T15:49:39Z","abstract_excerpt":"Counting the frequencies of k-mers in read libraries is often a first step in the analysis of high-throughput sequencing experiments. Infrequent k-mers are assumed to be a result of sequencing errors. The frequent k-mers constitute a reduced but error-free representation of the experiment, which can inform read error correction or serve as the input to de novo assembly methods. Ideally, the memory requirement for counting should be linear in the number of frequent k-mers and not in the, typically much larger, total number of k-mers in the read library.\n  We present a novel method that balances"},"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":"1305.1861","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2013-05-08T15:49:39Z","cross_cats_sorted":["cs.CE"],"title_canon_sha256":"60d3b332c23ba862412615eb835aec02bd0c975d83018e448d76ce64e937d76c","abstract_canon_sha256":"feb58996f1b29c8337eba4111e1c5a36317d687d9c87c0017a9427c59d05f0fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:11.060714Z","signature_b64":"LeuNbawnuEwD4BkGGYuM7NLq+kgM4BnZ/JaT+uxmDWhLWeJLwGdcYgClqBFCuauJbjG6OEzkbe3YpMvWgToqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a3d589f0b5278ab0ecbb0520ae73a00d1400335ed899f53f6bf5e2185e278fd","last_reissued_at":"2026-05-18T03:26:11.059799Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:11.059799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Turtle: Identifying frequent k-mers with cache-efficient algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE"],"primary_cat":"q-bio.GN","authors_text":"Alexander Schliep, Debashish Bhattacharya, Rajat Shuvro Roy","submitted_at":"2013-05-08T15:49:39Z","abstract_excerpt":"Counting the frequencies of k-mers in read libraries is often a first step in the analysis of high-throughput sequencing experiments. Infrequent k-mers are assumed to be a result of sequencing errors. The frequent k-mers constitute a reduced but error-free representation of the experiment, which can inform read error correction or serve as the input to de novo assembly methods. Ideally, the memory requirement for counting should be linear in the number of frequent k-mers and not in the, typically much larger, total number of k-mers in the read library.\n  We present a novel method that balances"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1861","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":"1305.1861","created_at":"2026-05-18T03:26:11.059939+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.1861v1","created_at":"2026-05-18T03:26:11.059939+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1861","created_at":"2026-05-18T03:26:11.059939+00:00"},{"alias_kind":"pith_short_12","alias_value":"DI6VRHYLKJ4K","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DI6VRHYLKJ4KWDWL","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DI6VRHYL","created_at":"2026-05-18T12:27:43.054852+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/DI6VRHYLKJ4KWDWLWBJAVZZ2AD","json":"https://pith.science/pith/DI6VRHYLKJ4KWDWLWBJAVZZ2AD.json","graph_json":"https://pith.science/api/pith-number/DI6VRHYLKJ4KWDWLWBJAVZZ2AD/graph.json","events_json":"https://pith.science/api/pith-number/DI6VRHYLKJ4KWDWLWBJAVZZ2AD/events.json","paper":"https://pith.science/paper/DI6VRHYL"},"agent_actions":{"view_html":"https://pith.science/pith/DI6VRHYLKJ4KWDWLWBJAVZZ2AD","download_json":"https://pith.science/pith/DI6VRHYLKJ4KWDWLWBJAVZZ2AD.json","view_paper":"https://pith.science/paper/DI6VRHYL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.1861&json=true","fetch_graph":"https://pith.science/api/pith-number/DI6VRHYLKJ4KWDWLWBJAVZZ2AD/graph.json","fetch_events":"https://pith.science/api/pith-number/DI6VRHYLKJ4KWDWLWBJAVZZ2AD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DI6VRHYLKJ4KWDWLWBJAVZZ2AD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DI6VRHYLKJ4KWDWLWBJAVZZ2AD/action/storage_attestation","attest_author":"https://pith.science/pith/DI6VRHYLKJ4KWDWLWBJAVZZ2AD/action/author_attestation","sign_citation":"https://pith.science/pith/DI6VRHYLKJ4KWDWLWBJAVZZ2AD/action/citation_signature","submit_replication":"https://pith.science/pith/DI6VRHYLKJ4KWDWLWBJAVZZ2AD/action/replication_record"}},"created_at":"2026-05-18T03:26:11.059939+00:00","updated_at":"2026-05-18T03:26:11.059939+00:00"}