{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:C6I2HTRLTJAAN4EHH4ZJX7YDEP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b6daf5adf558e0136c9968a978f015d1b049f7a19ed55800d08bcd5cf183d677","cross_cats_sorted":["q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-17T19:24:45Z","title_canon_sha256":"0a884769f19bf5b2c7ce38df3b3b897ea3e7da77ca02790ab31f5f9f28e6a3fc"},"schema_version":"1.0","source":{"id":"1108.3556","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3556","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3556v2","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3556","created_at":"2026-05-18T03:36:56Z"},{"alias_kind":"pith_short_12","alias_value":"C6I2HTRLTJAA","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"C6I2HTRLTJAAN4EH","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"C6I2HTRL","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:811ca6543507f5bf2db6a6e2bd38625867d8b1a6ec951f8ed41b3a19586803aa","target":"graph","created_at":"2026-05-18T03:36:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Charles H. Cannon, Chengxi Ye, Douglas W. Yu, Mihai Pop, Zhanshan Sam Ma","cross_cats":["q-bio.GN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-17T19:24:45Z","title":"SparseAssembler2: Sparse k-mer Graph for Memory Efficient Genome Assembly"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3556","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b3a98ffa813346006dafc0691d7723ff5249241ee666517ed3e5580700c6e1cb","target":"record","created_at":"2026-05-18T03:36:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b6daf5adf558e0136c9968a978f015d1b049f7a19ed55800d08bcd5cf183d677","cross_cats_sorted":["q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-17T19:24:45Z","title_canon_sha256":"0a884769f19bf5b2c7ce38df3b3b897ea3e7da77ca02790ab31f5f9f28e6a3fc"},"schema_version":"1.0","source":{"id":"1108.3556","kind":"arxiv","version":2}},"canonical_sha256":"1791a3ce2b9a4006f0873f329bff0323f136d240205f5263d89be8956037c443","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1791a3ce2b9a4006f0873f329bff0323f136d240205f5263d89be8956037c443","first_computed_at":"2026-05-18T03:36:56.802124Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:56.802124Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"744QwELTcmtjHnupogjvJcalqFCve0w0bAlRx0p545BvLMeDyM/ZqhY0EOXZ0aYzR8VNarIBrKKTjw3ynaqrAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:56.802602Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.3556","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3a98ffa813346006dafc0691d7723ff5249241ee666517ed3e5580700c6e1cb","sha256:811ca6543507f5bf2db6a6e2bd38625867d8b1a6ec951f8ed41b3a19586803aa"],"state_sha256":"077bc13789e83c83eb8196095cdf53bb1ddad7d005b6115ec268f062b09f2e66"}