{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HAXK3ONADY2L63AIDDTXBMPNU2","short_pith_number":"pith:HAXK3ONA","canonical_record":{"source":{"id":"1601.02932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2016-01-12T16:02:04Z","cross_cats_sorted":["cs.DM","cs.DS","q-bio.GN"],"title_canon_sha256":"205beb887855124206207dcc4d0931729c92f0c3ead954109cb6e636f566a798","abstract_canon_sha256":"874707ac5bcf3fa3ea63954b22e775c9f8d8cf386d4e7db46c304bb61bdef465"},"schema_version":"1.0"},"canonical_sha256":"382eadb9a01e34bf6c0818e770b1eda6a57ff2ce178c74d7c1c55c0ff8955b06","source":{"kind":"arxiv","id":"1601.02932","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02932","created_at":"2026-05-18T01:08:35Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02932v2","created_at":"2026-05-18T01:08:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02932","created_at":"2026-05-18T01:08:35Z"},{"alias_kind":"pith_short_12","alias_value":"HAXK3ONADY2L","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HAXK3ONADY2L63AI","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HAXK3ONA","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HAXK3ONADY2L63AIDDTXBMPNU2","target":"record","payload":{"canonical_record":{"source":{"id":"1601.02932","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2016-01-12T16:02:04Z","cross_cats_sorted":["cs.DM","cs.DS","q-bio.GN"],"title_canon_sha256":"205beb887855124206207dcc4d0931729c92f0c3ead954109cb6e636f566a798","abstract_canon_sha256":"874707ac5bcf3fa3ea63954b22e775c9f8d8cf386d4e7db46c304bb61bdef465"},"schema_version":"1.0"},"canonical_sha256":"382eadb9a01e34bf6c0818e770b1eda6a57ff2ce178c74d7c1c55c0ff8955b06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:35.587049Z","signature_b64":"mNRabd3dVcvdKKF1jrRWWB6873T7ON9WGc8SKxacPxxU/IpOBBtxy10P+W9KynTd1dZNwuGhtuOZZC8+YmjWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"382eadb9a01e34bf6c0818e770b1eda6a57ff2ce178c74d7c1c55c0ff8955b06","last_reissued_at":"2026-05-18T01:08:35.586492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:35.586492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.02932","source_version":2,"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-18T01:08:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YrXg8TbajtdMZlLEsqn0zoDCIqND2/yROxk7tfi+Wg5YbvDjmLcpiO2KKLVfW+xGPffWMvFfx5bgMSmis8m8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:24:02.239980Z"},"content_sha256":"2ef43a85873dcbf51dc9afdf703e68be9d8599e030e2e8be961302796e43d574","schema_version":"1.0","event_id":"sha256:2ef43a85873dcbf51dc9afdf703e68be9d8599e030e2e8be961302796e43d574"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HAXK3ONADY2L63AIDDTXBMPNU2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Safe and complete contig assembly via omnitigs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","q-bio.GN"],"primary_cat":"q-bio.QM","authors_text":"Alexandru I. Tomescu, Paul Medvedev","submitted_at":"2016-01-12T16:02:04Z","abstract_excerpt":"Contig assembly is the first stage that most assemblers solve when reconstructing a genome from a set of reads. Its output consists of contigs -- a set of strings that are promised to appear in any genome that could have generated the reads. From the introduction of contigs 20 years ago, assemblers have tried to obtain longer and longer contigs, but the following question was never solved: given a genome graph $G$ (e.g. a de Bruijn, or a string graph), what are all the strings that can be safely reported from $G$ as contigs? In this paper we finally answer this question, and also give a polyno"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02932","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"},"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-18T01:08:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DxkHByVUM+1KXxBaqsWO7s8DDY409R9DP4KyBYHrAjoCTT7mee4leFgP5X2/PYs+jWoKsFouwE0e27FxPCnbAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T19:24:02.240731Z"},"content_sha256":"9c130e3fccd36bddb169e6aacd36714c742e93412b99ed72270293c51ebc83e8","schema_version":"1.0","event_id":"sha256:9c130e3fccd36bddb169e6aacd36714c742e93412b99ed72270293c51ebc83e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HAXK3ONADY2L63AIDDTXBMPNU2/bundle.json","state_url":"https://pith.science/pith/HAXK3ONADY2L63AIDDTXBMPNU2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HAXK3ONADY2L63AIDDTXBMPNU2/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-31T19:24:02Z","links":{"resolver":"https://pith.science/pith/HAXK3ONADY2L63AIDDTXBMPNU2","bundle":"https://pith.science/pith/HAXK3ONADY2L63AIDDTXBMPNU2/bundle.json","state":"https://pith.science/pith/HAXK3ONADY2L63AIDDTXBMPNU2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HAXK3ONADY2L63AIDDTXBMPNU2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HAXK3ONADY2L63AIDDTXBMPNU2","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":"874707ac5bcf3fa3ea63954b22e775c9f8d8cf386d4e7db46c304bb61bdef465","cross_cats_sorted":["cs.DM","cs.DS","q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2016-01-12T16:02:04Z","title_canon_sha256":"205beb887855124206207dcc4d0931729c92f0c3ead954109cb6e636f566a798"},"schema_version":"1.0","source":{"id":"1601.02932","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02932","created_at":"2026-05-18T01:08:35Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02932v2","created_at":"2026-05-18T01:08:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02932","created_at":"2026-05-18T01:08:35Z"},{"alias_kind":"pith_short_12","alias_value":"HAXK3ONADY2L","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HAXK3ONADY2L63AI","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HAXK3ONA","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:9c130e3fccd36bddb169e6aacd36714c742e93412b99ed72270293c51ebc83e8","target":"graph","created_at":"2026-05-18T01:08:35Z","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":"Contig assembly is the first stage that most assemblers solve when reconstructing a genome from a set of reads. Its output consists of contigs -- a set of strings that are promised to appear in any genome that could have generated the reads. From the introduction of contigs 20 years ago, assemblers have tried to obtain longer and longer contigs, but the following question was never solved: given a genome graph $G$ (e.g. a de Bruijn, or a string graph), what are all the strings that can be safely reported from $G$ as contigs? In this paper we finally answer this question, and also give a polyno","authors_text":"Alexandru I. Tomescu, Paul Medvedev","cross_cats":["cs.DM","cs.DS","q-bio.GN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2016-01-12T16:02:04Z","title":"Safe and complete contig assembly via omnitigs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02932","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:2ef43a85873dcbf51dc9afdf703e68be9d8599e030e2e8be961302796e43d574","target":"record","created_at":"2026-05-18T01:08:35Z","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":"874707ac5bcf3fa3ea63954b22e775c9f8d8cf386d4e7db46c304bb61bdef465","cross_cats_sorted":["cs.DM","cs.DS","q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"q-bio.QM","submitted_at":"2016-01-12T16:02:04Z","title_canon_sha256":"205beb887855124206207dcc4d0931729c92f0c3ead954109cb6e636f566a798"},"schema_version":"1.0","source":{"id":"1601.02932","kind":"arxiv","version":2}},"canonical_sha256":"382eadb9a01e34bf6c0818e770b1eda6a57ff2ce178c74d7c1c55c0ff8955b06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"382eadb9a01e34bf6c0818e770b1eda6a57ff2ce178c74d7c1c55c0ff8955b06","first_computed_at":"2026-05-18T01:08:35.586492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:35.586492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mNRabd3dVcvdKKF1jrRWWB6873T7ON9WGc8SKxacPxxU/IpOBBtxy10P+W9KynTd1dZNwuGhtuOZZC8+YmjWDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:35.587049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.02932","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ef43a85873dcbf51dc9afdf703e68be9d8599e030e2e8be961302796e43d574","sha256:9c130e3fccd36bddb169e6aacd36714c742e93412b99ed72270293c51ebc83e8"],"state_sha256":"9b3e8c46a35d82289b868916613eea6193bbeb2fcabc300116337e2befa0ef44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nmQo/6XQ7QnjqUJYj44Q6Nzw0H9vzXbTTY/+zc1lzEAPlOMTCVUc/5n0ox358eKTVk8Cnw0T5XmCWkEvrF3nDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T19:24:02.245251Z","bundle_sha256":"eefa83097fda44f89d79bb76fc94f66c192d8c184c68f1221f62cc710582d715"}}