{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OYJZRGHTBPWATRPFQUI5ALNTD7","short_pith_number":"pith:OYJZRGHT","schema_version":"1.0","canonical_sha256":"76139898f30bec09c5e58511d02db31ff11e8bdc2b80649d40f795270c0d5435","source":{"kind":"arxiv","id":"1411.2718","version":2},"attestation_state":"computed","paper":{"title":"Variable-Order de Bruijn Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN","q-bio.QM"],"primary_cat":"cs.DS","authors_text":"Alex Bowe, Christina Boucher, Kunihiko Sadakane, Simon J. Puglisi, Travis Gagie","submitted_at":"2014-11-11T07:52:23Z","abstract_excerpt":"The de Bruijn graph $G_K$ of a set of strings $S$ is a key data structure in genome assembly that represents overlaps between all the $K$-length substrings of $S$. Construction and navigation of the graph is a space and time bottleneck in practice and the main hurdle for assembling large, eukaryote genomes. This problem is compounded by the fact that state-of-the-art assemblers do not build the de Bruijn graph for a single order (value of $K$) but for multiple values of $K$. More precisely, they build $d$ de Bruijn graphs, each with a specific order, i.e., $G_{K_1}, G_{K_2}, ..., G_{K_d}$. Alt"},"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":"1411.2718","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-11T07:52:23Z","cross_cats_sorted":["q-bio.GN","q-bio.QM"],"title_canon_sha256":"4b6ed4072d006709b5c120359a58d5b21cb765a166d35a5ccf2704ca913f5a1d","abstract_canon_sha256":"bb99b8c80d248b3aff0926ffecca618018fcd539bdc1970bd439658b24b920e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:35:46.732832Z","signature_b64":"WHdc7mg4Ckh17chlWJzSeHihVWUqjLwURL1zqpCxqvkYG57HUypdev1skHrlfCH9AETkwIdpdZ8LBpW34HHKBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76139898f30bec09c5e58511d02db31ff11e8bdc2b80649d40f795270c0d5435","last_reissued_at":"2026-05-18T02:35:46.732388Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:35:46.732388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variable-Order de Bruijn Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN","q-bio.QM"],"primary_cat":"cs.DS","authors_text":"Alex Bowe, Christina Boucher, Kunihiko Sadakane, Simon J. Puglisi, Travis Gagie","submitted_at":"2014-11-11T07:52:23Z","abstract_excerpt":"The de Bruijn graph $G_K$ of a set of strings $S$ is a key data structure in genome assembly that represents overlaps between all the $K$-length substrings of $S$. Construction and navigation of the graph is a space and time bottleneck in practice and the main hurdle for assembling large, eukaryote genomes. This problem is compounded by the fact that state-of-the-art assemblers do not build the de Bruijn graph for a single order (value of $K$) but for multiple values of $K$. More precisely, they build $d$ de Bruijn graphs, each with a specific order, i.e., $G_{K_1}, G_{K_2}, ..., G_{K_d}$. Alt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.2718","kind":"arxiv","version":2},"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":"1411.2718","created_at":"2026-05-18T02:35:46.732445+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.2718v2","created_at":"2026-05-18T02:35:46.732445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.2718","created_at":"2026-05-18T02:35:46.732445+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYJZRGHTBPWA","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYJZRGHTBPWATRPF","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYJZRGHT","created_at":"2026-05-18T12:28:43.426989+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/OYJZRGHTBPWATRPFQUI5ALNTD7","json":"https://pith.science/pith/OYJZRGHTBPWATRPFQUI5ALNTD7.json","graph_json":"https://pith.science/api/pith-number/OYJZRGHTBPWATRPFQUI5ALNTD7/graph.json","events_json":"https://pith.science/api/pith-number/OYJZRGHTBPWATRPFQUI5ALNTD7/events.json","paper":"https://pith.science/paper/OYJZRGHT"},"agent_actions":{"view_html":"https://pith.science/pith/OYJZRGHTBPWATRPFQUI5ALNTD7","download_json":"https://pith.science/pith/OYJZRGHTBPWATRPFQUI5ALNTD7.json","view_paper":"https://pith.science/paper/OYJZRGHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.2718&json=true","fetch_graph":"https://pith.science/api/pith-number/OYJZRGHTBPWATRPFQUI5ALNTD7/graph.json","fetch_events":"https://pith.science/api/pith-number/OYJZRGHTBPWATRPFQUI5ALNTD7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYJZRGHTBPWATRPFQUI5ALNTD7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYJZRGHTBPWATRPFQUI5ALNTD7/action/storage_attestation","attest_author":"https://pith.science/pith/OYJZRGHTBPWATRPFQUI5ALNTD7/action/author_attestation","sign_citation":"https://pith.science/pith/OYJZRGHTBPWATRPFQUI5ALNTD7/action/citation_signature","submit_replication":"https://pith.science/pith/OYJZRGHTBPWATRPFQUI5ALNTD7/action/replication_record"}},"created_at":"2026-05-18T02:35:46.732445+00:00","updated_at":"2026-05-18T02:35:46.732445+00:00"}