{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:K5LR6B3INLKO2BHC5RUZRHVWBU","short_pith_number":"pith:K5LR6B3I","canonical_record":{"source":{"id":"1602.05856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-18T16:11:50Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"93ffa842cabbaa505f79fb3c9737442ecac5ee11128a685675eec84a764d9540","abstract_canon_sha256":"1e55a3958ccf2d6df1eddba9868a370e244f15af0f855840654b2f012dc22a86"},"schema_version":"1.0"},"canonical_sha256":"57571f07686ad4ed04e2ec69989eb60d015a1c602c25fe42d64c5da4a66075e2","source":{"kind":"arxiv","id":"1602.05856","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05856","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05856v1","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05856","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"K5LR6B3INLKO","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K5LR6B3INLKO2BHC","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K5LR6B3I","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:K5LR6B3INLKO2BHC5RUZRHVWBU","target":"record","payload":{"canonical_record":{"source":{"id":"1602.05856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-18T16:11:50Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"93ffa842cabbaa505f79fb3c9737442ecac5ee11128a685675eec84a764d9540","abstract_canon_sha256":"1e55a3958ccf2d6df1eddba9868a370e244f15af0f855840654b2f012dc22a86"},"schema_version":"1.0"},"canonical_sha256":"57571f07686ad4ed04e2ec69989eb60d015a1c602c25fe42d64c5da4a66075e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:23.041679Z","signature_b64":"jLXVBT14ukv1s5b4HMjOn4yYS3ec60tkMM+A7oq0e9Lirm00eDE0yuipbWDulE2osz8Pk4x6drf2wdqXZjXICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57571f07686ad4ed04e2ec69989eb60d015a1c602c25fe42d64c5da4a66075e2","last_reissued_at":"2026-05-18T01:20:23.041036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:23.041036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.05856","source_version":1,"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:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/kdL7ngK5CaNgS8AUVjT4HaKTXmPSrkmGLH8uke7yx7NWzWDz7VLT8enxBocL+V+AQdur2rQ1v1i/02sJqLQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T08:44:02.663894Z"},"content_sha256":"0c09768d459d7bb212f6160b1f6f685c9e1c846887c0208fd8db993b3a99eddd","schema_version":"1.0","event_id":"sha256:0c09768d459d7bb212f6160b1f6f685c9e1c846887c0208fd8db993b3a99eddd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:K5LR6B3INLKO2BHC5RUZRHVWBU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TwoPaCo: An efficient algorithm to build the compacted de Bruijn graph from many complete genomes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"cs.DS","authors_text":"Ilia Minkin, Paul Medvedev, Son Pham","submitted_at":"2016-02-18T16:11:50Z","abstract_excerpt":"Motivation: De Bruijn graphs have been proposed as a data structure to facilitate the analysis of related whole genome sequences, in both a population and comparative genomic settings. However, current approaches do not scale well to many genomes of large size (such as mammalian genomes). Results: In this paper, we present TwoPaCo, a simple and scalable low memory algorithm for the direct construction of the compacted de Bruijn graph from a set of complete genomes. We demonstrate that it can construct the graph for 100 simulated human genomes in less then a day and eight real primates in less "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05856","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"},"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:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uFtI80nx+4T5GYBAUXPMGhYVIuEhSM1w8i1eQMy2rh8ioL4T2Kg78C8Pily2UkSB/wQSHXbe4rzHnY4DXIyCDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T08:44:02.664530Z"},"content_sha256":"770dc89c4a948a5c0687460724b6bcedaf5f29adb0c22a16f7676cc73f7740a8","schema_version":"1.0","event_id":"sha256:770dc89c4a948a5c0687460724b6bcedaf5f29adb0c22a16f7676cc73f7740a8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K5LR6B3INLKO2BHC5RUZRHVWBU/bundle.json","state_url":"https://pith.science/pith/K5LR6B3INLKO2BHC5RUZRHVWBU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K5LR6B3INLKO2BHC5RUZRHVWBU/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-06-10T08:44:02Z","links":{"resolver":"https://pith.science/pith/K5LR6B3INLKO2BHC5RUZRHVWBU","bundle":"https://pith.science/pith/K5LR6B3INLKO2BHC5RUZRHVWBU/bundle.json","state":"https://pith.science/pith/K5LR6B3INLKO2BHC5RUZRHVWBU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K5LR6B3INLKO2BHC5RUZRHVWBU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:K5LR6B3INLKO2BHC5RUZRHVWBU","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":"1e55a3958ccf2d6df1eddba9868a370e244f15af0f855840654b2f012dc22a86","cross_cats_sorted":["q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-18T16:11:50Z","title_canon_sha256":"93ffa842cabbaa505f79fb3c9737442ecac5ee11128a685675eec84a764d9540"},"schema_version":"1.0","source":{"id":"1602.05856","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05856","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05856v1","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05856","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"K5LR6B3INLKO","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"K5LR6B3INLKO2BHC","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"K5LR6B3I","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:770dc89c4a948a5c0687460724b6bcedaf5f29adb0c22a16f7676cc73f7740a8","target":"graph","created_at":"2026-05-18T01:20:23Z","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":"Motivation: De Bruijn graphs have been proposed as a data structure to facilitate the analysis of related whole genome sequences, in both a population and comparative genomic settings. However, current approaches do not scale well to many genomes of large size (such as mammalian genomes). Results: In this paper, we present TwoPaCo, a simple and scalable low memory algorithm for the direct construction of the compacted de Bruijn graph from a set of complete genomes. We demonstrate that it can construct the graph for 100 simulated human genomes in less then a day and eight real primates in less ","authors_text":"Ilia Minkin, Paul Medvedev, Son Pham","cross_cats":["q-bio.GN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-18T16:11:50Z","title":"TwoPaCo: An efficient algorithm to build the compacted de Bruijn graph from many complete genomes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05856","kind":"arxiv","version":1},"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:0c09768d459d7bb212f6160b1f6f685c9e1c846887c0208fd8db993b3a99eddd","target":"record","created_at":"2026-05-18T01:20:23Z","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":"1e55a3958ccf2d6df1eddba9868a370e244f15af0f855840654b2f012dc22a86","cross_cats_sorted":["q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-18T16:11:50Z","title_canon_sha256":"93ffa842cabbaa505f79fb3c9737442ecac5ee11128a685675eec84a764d9540"},"schema_version":"1.0","source":{"id":"1602.05856","kind":"arxiv","version":1}},"canonical_sha256":"57571f07686ad4ed04e2ec69989eb60d015a1c602c25fe42d64c5da4a66075e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"57571f07686ad4ed04e2ec69989eb60d015a1c602c25fe42d64c5da4a66075e2","first_computed_at":"2026-05-18T01:20:23.041036Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:23.041036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jLXVBT14ukv1s5b4HMjOn4yYS3ec60tkMM+A7oq0e9Lirm00eDE0yuipbWDulE2osz8Pk4x6drf2wdqXZjXICg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:23.041679Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05856","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c09768d459d7bb212f6160b1f6f685c9e1c846887c0208fd8db993b3a99eddd","sha256:770dc89c4a948a5c0687460724b6bcedaf5f29adb0c22a16f7676cc73f7740a8"],"state_sha256":"ec1455a4bfb7b72405870f9403f54669081d1042bf91bf95872afee66513806d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VPpWa8PeyK1nGdRRN1jpubk+G5SZAxHGq7NHQNrJaI2fSjA1Vni84OZV0gpRvUyK4gIcUpY0CkGArPsWo7EZAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T08:44:02.667499Z","bundle_sha256":"2cec2059cac952910dc5814683adc739d548e1b9ec254a53f45fc09d2f7f227b"}}