{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JJ3EOBPXKKBEJPBLJESLDDC6RR","short_pith_number":"pith:JJ3EOBPX","schema_version":"1.0","canonical_sha256":"4a764705f7528244bc2b4924b18c5e8c6afe32e00b1d1aaff645cc932a7f4c05","source":{"kind":"arxiv","id":"1106.2603","version":1},"attestation_state":"computed","paper":{"title":"SparseAssembler: de novo Assembly with the Sparse de Bruijn Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"cs.DS","authors_text":"Charles H. Cannon, Chengxi Ye, Douglas W. Yu, Mihai Pop, Zhanshan Sam Ma","submitted_at":"2011-06-14T04:06:06Z","abstract_excerpt":"de Bruijn graph-based algorithms are one of the two most widely used approaches for de novo genome assembly. A major limitation of this approach is the large computational memory space requirement to construct the de Bruijn graph, which scales with k-mer length and total diversity (N) of unique k-mers in the genome expressed in base pairs or roughly (2k+8)N bits. This limitation is particularly important with large-scale genome analysis and for sequencing centers that simultaneously process multiple genomes. We present a sparse de Bruijn graph structure, based on which we developed SparseAssem"},"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":"1106.2603","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-06-14T04:06:06Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"bc88c2a7562b406fd6e5115961acef6b817c7c43394f329fe6346c168cf771df","abstract_canon_sha256":"0b0230144c1244327078198679ad0317f7432bb3fa3c313f6ab54ec2107d48c6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:35.600797Z","signature_b64":"r/Mh1Cw2H59o7EgAdqXe5wDdV4MEoJks2kLr5blWex0Bz7Qomgs9mIY/v3nbJ5t9t9Ll0Cxmy2C3DborKPHRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a764705f7528244bc2b4924b18c5e8c6afe32e00b1d1aaff645cc932a7f4c05","last_reissued_at":"2026-05-18T04:18:35.600297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:35.600297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SparseAssembler: de novo Assembly with the Sparse de Bruijn Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"cs.DS","authors_text":"Charles H. Cannon, Chengxi Ye, Douglas W. Yu, Mihai Pop, Zhanshan Sam Ma","submitted_at":"2011-06-14T04:06:06Z","abstract_excerpt":"de Bruijn graph-based algorithms are one of the two most widely used approaches for de novo genome assembly. A major limitation of this approach is the large computational memory space requirement to construct the de Bruijn graph, which scales with k-mer length and total diversity (N) of unique k-mers in the genome expressed in base pairs or roughly (2k+8)N bits. This limitation is particularly important with large-scale genome analysis and for sequencing centers that simultaneously process multiple genomes. We present a sparse de Bruijn graph structure, based on which we developed SparseAssem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2603","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":"1106.2603","created_at":"2026-05-18T04:18:35.600373+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.2603v1","created_at":"2026-05-18T04:18:35.600373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2603","created_at":"2026-05-18T04:18:35.600373+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJ3EOBPXKKBE","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJ3EOBPXKKBEJPBL","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJ3EOBPX","created_at":"2026-05-18T12:26:32.869790+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/JJ3EOBPXKKBEJPBLJESLDDC6RR","json":"https://pith.science/pith/JJ3EOBPXKKBEJPBLJESLDDC6RR.json","graph_json":"https://pith.science/api/pith-number/JJ3EOBPXKKBEJPBLJESLDDC6RR/graph.json","events_json":"https://pith.science/api/pith-number/JJ3EOBPXKKBEJPBLJESLDDC6RR/events.json","paper":"https://pith.science/paper/JJ3EOBPX"},"agent_actions":{"view_html":"https://pith.science/pith/JJ3EOBPXKKBEJPBLJESLDDC6RR","download_json":"https://pith.science/pith/JJ3EOBPXKKBEJPBLJESLDDC6RR.json","view_paper":"https://pith.science/paper/JJ3EOBPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.2603&json=true","fetch_graph":"https://pith.science/api/pith-number/JJ3EOBPXKKBEJPBLJESLDDC6RR/graph.json","fetch_events":"https://pith.science/api/pith-number/JJ3EOBPXKKBEJPBLJESLDDC6RR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJ3EOBPXKKBEJPBLJESLDDC6RR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJ3EOBPXKKBEJPBLJESLDDC6RR/action/storage_attestation","attest_author":"https://pith.science/pith/JJ3EOBPXKKBEJPBLJESLDDC6RR/action/author_attestation","sign_citation":"https://pith.science/pith/JJ3EOBPXKKBEJPBLJESLDDC6RR/action/citation_signature","submit_replication":"https://pith.science/pith/JJ3EOBPXKKBEJPBLJESLDDC6RR/action/replication_record"}},"created_at":"2026-05-18T04:18:35.600373+00:00","updated_at":"2026-05-18T04:18:35.600373+00:00"}