{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WHPUZUDZ6JWWSFN3EKV6DNNIKH","short_pith_number":"pith:WHPUZUDZ","canonical_record":{"source":{"id":"1301.0068","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2013-01-01T08:52:44Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT","q-bio.QM"],"title_canon_sha256":"fd8178e369e5af4b67325d7b0335f93e112ed1dfa65c58870412bd33a1d7569f","abstract_canon_sha256":"73fbc42d0e85705637f1b5111218cd492fcf6322d2d8ee0b20400716916fdfae"},"schema_version":"1.0"},"canonical_sha256":"b1df4cd079f26d6915bb22abe1b5a851c338564cc260e088d065a1aa726ff628","source":{"kind":"arxiv","id":"1301.0068","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0068","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0068v3","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0068","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"pith_short_12","alias_value":"WHPUZUDZ6JWW","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WHPUZUDZ6JWWSFN3","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WHPUZUDZ","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WHPUZUDZ6JWWSFN3EKV6DNNIKH","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0068","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2013-01-01T08:52:44Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT","q-bio.QM"],"title_canon_sha256":"fd8178e369e5af4b67325d7b0335f93e112ed1dfa65c58870412bd33a1d7569f","abstract_canon_sha256":"73fbc42d0e85705637f1b5111218cd492fcf6322d2d8ee0b20400716916fdfae"},"schema_version":"1.0"},"canonical_sha256":"b1df4cd079f26d6915bb22abe1b5a851c338564cc260e088d065a1aa726ff628","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:13.507915Z","signature_b64":"jJFntY/RLgo0KeFKJ8JVCaxlGsWIYPGRT4zdAllJpadldFVVhsmwFRVZM1SIhE4RszFcI0vkwxBVd+fDbgdeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1df4cd079f26d6915bb22abe1b5a851c338564cc260e088d065a1aa726ff628","last_reissued_at":"2026-05-18T03:33:13.506938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:13.506938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0068","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:33:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YzGw2ZhXFYG+866wEeoIjmA8gTKA5Ut+54Sti+17kIM3aEyVLPp7jmBchGp/03qM/QfiHv27xBKpMk9lz34bCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:59:10.136886Z"},"content_sha256":"a87c28080cc71979a34740b961e5240126f1813756bbe5e1ed5928cecb3a94ce","schema_version":"1.0","event_id":"sha256:a87c28080cc71979a34740b961e5240126f1813756bbe5e1ed5928cecb3a94ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WHPUZUDZ6JWWSFN3EKV6DNNIKH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Assembly for High Throughput Shotgun Sequencing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT","q-bio.QM"],"primary_cat":"q-bio.GN","authors_text":"David Tse, Guy Bresler, Ma'ayan Bresler","submitted_at":"2013-01-01T08:52:44Z","abstract_excerpt":"We present a framework for the design of optimal assembly algorithms for shotgun sequencing under the criterion of complete reconstruction. We derive a lower bound on the read length and the coverage depth required for reconstruction in terms of the repeat statistics of the genome. Building on earlier works, we design a de Brujin graph based assembly algorithm which can achieve very close to the lower bound for repeat statistics of a wide range of sequenced genomes, including the GAGE datasets. The results are based on a set of necessary and sufficient conditions on the DNA sequence and the re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0068","kind":"arxiv","version":3},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:33:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vQXYJfBVCEipEAAGuIATV9ciEpHb4rFf8K4R/Ea9N2LebJQUEmtvOkAGQpHv1HUccX+bO5ksjEHV/zOkNum/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:59:10.137239Z"},"content_sha256":"af1cad40df4851a1f9b3f0a52bad3d317482c8119275d378f5ca5be2df634024","schema_version":"1.0","event_id":"sha256:af1cad40df4851a1f9b3f0a52bad3d317482c8119275d378f5ca5be2df634024"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WHPUZUDZ6JWWSFN3EKV6DNNIKH/bundle.json","state_url":"https://pith.science/pith/WHPUZUDZ6JWWSFN3EKV6DNNIKH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WHPUZUDZ6JWWSFN3EKV6DNNIKH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T07:59:10Z","links":{"resolver":"https://pith.science/pith/WHPUZUDZ6JWWSFN3EKV6DNNIKH","bundle":"https://pith.science/pith/WHPUZUDZ6JWWSFN3EKV6DNNIKH/bundle.json","state":"https://pith.science/pith/WHPUZUDZ6JWWSFN3EKV6DNNIKH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WHPUZUDZ6JWWSFN3EKV6DNNIKH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WHPUZUDZ6JWWSFN3EKV6DNNIKH","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":"73fbc42d0e85705637f1b5111218cd492fcf6322d2d8ee0b20400716916fdfae","cross_cats_sorted":["cs.DS","cs.IT","math.IT","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2013-01-01T08:52:44Z","title_canon_sha256":"fd8178e369e5af4b67325d7b0335f93e112ed1dfa65c58870412bd33a1d7569f"},"schema_version":"1.0","source":{"id":"1301.0068","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0068","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0068v3","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0068","created_at":"2026-05-18T03:33:13Z"},{"alias_kind":"pith_short_12","alias_value":"WHPUZUDZ6JWW","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WHPUZUDZ6JWWSFN3","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WHPUZUDZ","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:af1cad40df4851a1f9b3f0a52bad3d317482c8119275d378f5ca5be2df634024","target":"graph","created_at":"2026-05-18T03:33:13Z","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":"We present a framework for the design of optimal assembly algorithms for shotgun sequencing under the criterion of complete reconstruction. We derive a lower bound on the read length and the coverage depth required for reconstruction in terms of the repeat statistics of the genome. Building on earlier works, we design a de Brujin graph based assembly algorithm which can achieve very close to the lower bound for repeat statistics of a wide range of sequenced genomes, including the GAGE datasets. The results are based on a set of necessary and sufficient conditions on the DNA sequence and the re","authors_text":"David Tse, Guy Bresler, Ma'ayan Bresler","cross_cats":["cs.DS","cs.IT","math.IT","q-bio.QM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2013-01-01T08:52:44Z","title":"Optimal Assembly for High Throughput Shotgun Sequencing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0068","kind":"arxiv","version":3},"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:a87c28080cc71979a34740b961e5240126f1813756bbe5e1ed5928cecb3a94ce","target":"record","created_at":"2026-05-18T03:33:13Z","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":"73fbc42d0e85705637f1b5111218cd492fcf6322d2d8ee0b20400716916fdfae","cross_cats_sorted":["cs.DS","cs.IT","math.IT","q-bio.QM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.GN","submitted_at":"2013-01-01T08:52:44Z","title_canon_sha256":"fd8178e369e5af4b67325d7b0335f93e112ed1dfa65c58870412bd33a1d7569f"},"schema_version":"1.0","source":{"id":"1301.0068","kind":"arxiv","version":3}},"canonical_sha256":"b1df4cd079f26d6915bb22abe1b5a851c338564cc260e088d065a1aa726ff628","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b1df4cd079f26d6915bb22abe1b5a851c338564cc260e088d065a1aa726ff628","first_computed_at":"2026-05-18T03:33:13.506938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:13.506938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jJFntY/RLgo0KeFKJ8JVCaxlGsWIYPGRT4zdAllJpadldFVVhsmwFRVZM1SIhE4RszFcI0vkwxBVd+fDbgdeDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:13.507915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0068","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a87c28080cc71979a34740b961e5240126f1813756bbe5e1ed5928cecb3a94ce","sha256:af1cad40df4851a1f9b3f0a52bad3d317482c8119275d378f5ca5be2df634024"],"state_sha256":"e0e7be2b8f823fed7e466e343337924530b157801757de712acf3a7039d70d6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HvKTQe2UY+7DzgXjJz+pKxL6qU7WGYpeLMPyFpwv/f88fnp40YbeGBKWsK85ZAPkaPN+86PZRWug3pLxsT07DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:59:10.139276Z","bundle_sha256":"2a1b67f28c63bf9d2a90b562061f136206221b7afa03ca7afa768a840a1b6f2e"}}