{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:C6I2HTRLTJAAN4EHH4ZJX7YDEP","short_pith_number":"pith:C6I2HTRL","schema_version":"1.0","canonical_sha256":"1791a3ce2b9a4006f0873f329bff0323f136d240205f5263d89be8956037c443","source":{"kind":"arxiv","id":"1108.3556","version":2},"attestation_state":"computed","paper":{"title":"SparseAssembler2: Sparse k-mer Graph for Memory Efficient Genome Assembly","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-08-17T19:24:45Z","abstract_excerpt":"The formal version of our work has been published in BMC Bioinformatics and can be found here: http://www.biomedcentral.com/1471-2105/13/S6/S1 Motivation: To tackle the problem of huge memory usage associated with de Bruijn graph-based algorithms, upon which some of the most widely used de novo genome assemblers have been built, we released SparseAssembler1. SparseAssembler1 can save as much as 90% memory consumption in comparison with the state-of-art assemblers, but it requires rounds of denoising to accurately assemble genomes. In this paper, we introduce a new general model for genome asse"},"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":"1108.3556","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-17T19:24:45Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"0a884769f19bf5b2c7ce38df3b3b897ea3e7da77ca02790ab31f5f9f28e6a3fc","abstract_canon_sha256":"b6daf5adf558e0136c9968a978f015d1b049f7a19ed55800d08bcd5cf183d677"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:56.802602Z","signature_b64":"744QwELTcmtjHnupogjvJcalqFCve0w0bAlRx0p545BvLMeDyM/ZqhY0EOXZ0aYzR8VNarIBrKKTjw3ynaqrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1791a3ce2b9a4006f0873f329bff0323f136d240205f5263d89be8956037c443","last_reissued_at":"2026-05-18T03:36:56.802124Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:56.802124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SparseAssembler2: Sparse k-mer Graph for Memory Efficient Genome Assembly","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-08-17T19:24:45Z","abstract_excerpt":"The formal version of our work has been published in BMC Bioinformatics and can be found here: http://www.biomedcentral.com/1471-2105/13/S6/S1 Motivation: To tackle the problem of huge memory usage associated with de Bruijn graph-based algorithms, upon which some of the most widely used de novo genome assemblers have been built, we released SparseAssembler1. SparseAssembler1 can save as much as 90% memory consumption in comparison with the state-of-art assemblers, but it requires rounds of denoising to accurately assemble genomes. In this paper, we introduce a new general model for genome asse"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3556","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":"1108.3556","created_at":"2026-05-18T03:36:56.802211+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.3556v2","created_at":"2026-05-18T03:36:56.802211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3556","created_at":"2026-05-18T03:36:56.802211+00:00"},{"alias_kind":"pith_short_12","alias_value":"C6I2HTRLTJAA","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"C6I2HTRLTJAAN4EH","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"C6I2HTRL","created_at":"2026-05-18T12:26:24.575870+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/C6I2HTRLTJAAN4EHH4ZJX7YDEP","json":"https://pith.science/pith/C6I2HTRLTJAAN4EHH4ZJX7YDEP.json","graph_json":"https://pith.science/api/pith-number/C6I2HTRLTJAAN4EHH4ZJX7YDEP/graph.json","events_json":"https://pith.science/api/pith-number/C6I2HTRLTJAAN4EHH4ZJX7YDEP/events.json","paper":"https://pith.science/paper/C6I2HTRL"},"agent_actions":{"view_html":"https://pith.science/pith/C6I2HTRLTJAAN4EHH4ZJX7YDEP","download_json":"https://pith.science/pith/C6I2HTRLTJAAN4EHH4ZJX7YDEP.json","view_paper":"https://pith.science/paper/C6I2HTRL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.3556&json=true","fetch_graph":"https://pith.science/api/pith-number/C6I2HTRLTJAAN4EHH4ZJX7YDEP/graph.json","fetch_events":"https://pith.science/api/pith-number/C6I2HTRLTJAAN4EHH4ZJX7YDEP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C6I2HTRLTJAAN4EHH4ZJX7YDEP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C6I2HTRLTJAAN4EHH4ZJX7YDEP/action/storage_attestation","attest_author":"https://pith.science/pith/C6I2HTRLTJAAN4EHH4ZJX7YDEP/action/author_attestation","sign_citation":"https://pith.science/pith/C6I2HTRLTJAAN4EHH4ZJX7YDEP/action/citation_signature","submit_replication":"https://pith.science/pith/C6I2HTRLTJAAN4EHH4ZJX7YDEP/action/replication_record"}},"created_at":"2026-05-18T03:36:56.802211+00:00","updated_at":"2026-05-18T03:36:56.802211+00:00"}