{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:234LCOM4DMGXZEROTVBC6SB42Y","short_pith_number":"pith:234LCOM4","canonical_record":{"source":{"id":"1602.03333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-10T11:41:06Z","cross_cats_sorted":[],"title_canon_sha256":"738f86f19e080507263f86429f39f7b9eff8b4d26c6b6ac733d57b2f4e9ef0f9","abstract_canon_sha256":"9081cac8e9132eb76273b634e5c74b541f52d10074b80f0fb2b4caf364ae32c0"},"schema_version":"1.0"},"canonical_sha256":"d6f8b1399c1b0d7c922e9d422f483cd60f2e248d27afeb6d7f6c093f00f9e4a6","source":{"kind":"arxiv","id":"1602.03333","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03333","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03333v1","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03333","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"234LCOM4DMGX","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"234LCOM4DMGXZERO","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"234LCOM4","created_at":"2026-05-18T12:29:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:234LCOM4DMGXZEROTVBC6SB42Y","target":"record","payload":{"canonical_record":{"source":{"id":"1602.03333","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-10T11:41:06Z","cross_cats_sorted":[],"title_canon_sha256":"738f86f19e080507263f86429f39f7b9eff8b4d26c6b6ac733d57b2f4e9ef0f9","abstract_canon_sha256":"9081cac8e9132eb76273b634e5c74b541f52d10074b80f0fb2b4caf364ae32c0"},"schema_version":"1.0"},"canonical_sha256":"d6f8b1399c1b0d7c922e9d422f483cd60f2e248d27afeb6d7f6c093f00f9e4a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:00.255236Z","signature_b64":"cw90/o1G8qP0tJ1iDT+uCd/KYjfo+h/2myTFMyIdMyvgyVkGbRXw7RqRur++6i7sxEvtI0h758nIv2P+vKVKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6f8b1399c1b0d7c922e9d422f483cd60f2e248d27afeb6d7f6c093f00f9e4a6","last_reissued_at":"2026-05-18T01:21:00.254814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:00.254814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.03333","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:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wqW7S/XoN8ugbz241Bj11NjQzOmUi7Se/xiEbfKzxyaKN02iVuQ0dTNMQmEJT7rECMRkf7nK+fM3imZi5RHPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:37:42.558251Z"},"content_sha256":"6bc30a15b46044c305e7d76645d8d97f59adb3e63c3c73787aebc7058951b71a","schema_version":"1.0","event_id":"sha256:6bc30a15b46044c305e7d76645d8d97f59adb3e63c3c73787aebc7058951b71a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:234LCOM4DMGXZEROTVBC6SB42Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A representation of a compressed de Bruijn graph for pan-genome analysis that enables search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Enno Ohlebusch, Timo Beller","submitted_at":"2016-02-10T11:41:06Z","abstract_excerpt":"Recently, Marcus et al. (Bioinformatics 2014) proposed to use a compressed de Bruijn graph to describe the relationship between the genomes of many individuals/strains of the same or closely related species. They devised an $O(n \\log g)$ time algorithm called splitMEM that constructs this graph directly (i.e., without using the uncompressed de Bruijn graph) based on a suffix tree, where $n$ is the total length of the genomes and $g$ is the length of the longest genome. In this paper, we present a construction algorithm that outperforms their algorithm in theory and in practice. Moreover, we pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03333","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:21:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FrXuCKxhrG4CQhMixO1WPg70MiL+dUwczIaFcr63STKAzWRXe6XmPoirH7CYz/BiT/eIaCkrU2yGtkhqcXmfDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:37:42.558949Z"},"content_sha256":"804854c0be76c765c691cecc3b43022c70991aa25e4c5ab3910797ff8b45d433","schema_version":"1.0","event_id":"sha256:804854c0be76c765c691cecc3b43022c70991aa25e4c5ab3910797ff8b45d433"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/234LCOM4DMGXZEROTVBC6SB42Y/bundle.json","state_url":"https://pith.science/pith/234LCOM4DMGXZEROTVBC6SB42Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/234LCOM4DMGXZEROTVBC6SB42Y/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-10T23:37:42Z","links":{"resolver":"https://pith.science/pith/234LCOM4DMGXZEROTVBC6SB42Y","bundle":"https://pith.science/pith/234LCOM4DMGXZEROTVBC6SB42Y/bundle.json","state":"https://pith.science/pith/234LCOM4DMGXZEROTVBC6SB42Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/234LCOM4DMGXZEROTVBC6SB42Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:234LCOM4DMGXZEROTVBC6SB42Y","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":"9081cac8e9132eb76273b634e5c74b541f52d10074b80f0fb2b4caf364ae32c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-10T11:41:06Z","title_canon_sha256":"738f86f19e080507263f86429f39f7b9eff8b4d26c6b6ac733d57b2f4e9ef0f9"},"schema_version":"1.0","source":{"id":"1602.03333","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.03333","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"arxiv_version","alias_value":"1602.03333v1","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.03333","created_at":"2026-05-18T01:21:00Z"},{"alias_kind":"pith_short_12","alias_value":"234LCOM4DMGX","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_16","alias_value":"234LCOM4DMGXZERO","created_at":"2026-05-18T12:29:52Z"},{"alias_kind":"pith_short_8","alias_value":"234LCOM4","created_at":"2026-05-18T12:29:52Z"}],"graph_snapshots":[{"event_id":"sha256:804854c0be76c765c691cecc3b43022c70991aa25e4c5ab3910797ff8b45d433","target":"graph","created_at":"2026-05-18T01:21:00Z","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":"Recently, Marcus et al. (Bioinformatics 2014) proposed to use a compressed de Bruijn graph to describe the relationship between the genomes of many individuals/strains of the same or closely related species. They devised an $O(n \\log g)$ time algorithm called splitMEM that constructs this graph directly (i.e., without using the uncompressed de Bruijn graph) based on a suffix tree, where $n$ is the total length of the genomes and $g$ is the length of the longest genome. In this paper, we present a construction algorithm that outperforms their algorithm in theory and in practice. Moreover, we pr","authors_text":"Enno Ohlebusch, Timo Beller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-10T11:41:06Z","title":"A representation of a compressed de Bruijn graph for pan-genome analysis that enables search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.03333","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:6bc30a15b46044c305e7d76645d8d97f59adb3e63c3c73787aebc7058951b71a","target":"record","created_at":"2026-05-18T01:21:00Z","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":"9081cac8e9132eb76273b634e5c74b541f52d10074b80f0fb2b4caf364ae32c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-02-10T11:41:06Z","title_canon_sha256":"738f86f19e080507263f86429f39f7b9eff8b4d26c6b6ac733d57b2f4e9ef0f9"},"schema_version":"1.0","source":{"id":"1602.03333","kind":"arxiv","version":1}},"canonical_sha256":"d6f8b1399c1b0d7c922e9d422f483cd60f2e248d27afeb6d7f6c093f00f9e4a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d6f8b1399c1b0d7c922e9d422f483cd60f2e248d27afeb6d7f6c093f00f9e4a6","first_computed_at":"2026-05-18T01:21:00.254814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:00.254814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cw90/o1G8qP0tJ1iDT+uCd/KYjfo+h/2myTFMyIdMyvgyVkGbRXw7RqRur++6i7sxEvtI0h758nIv2P+vKVKAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:00.255236Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.03333","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bc30a15b46044c305e7d76645d8d97f59adb3e63c3c73787aebc7058951b71a","sha256:804854c0be76c765c691cecc3b43022c70991aa25e4c5ab3910797ff8b45d433"],"state_sha256":"795b2d96247b49c99b75565aae6cece4614318a7cf783336284ce584413a1ec9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LbMmLky6Zx0ZjzL5huvQ+RAwOsYYeTvzGhloQswB97BpClQfeSepMCrpV0BJmXTQako4PYU2THgkJnmYph12DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:37:42.563205Z","bundle_sha256":"8e0d783b0ef19a57af69fd27c807be0568787769c32770fb23fba3bdddbdf720"}}