{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:IVHE4VHNVDKF7FQFG6T3JQQUJL","short_pith_number":"pith:IVHE4VHN","canonical_record":{"source":{"id":"1911.00044","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-10-31T18:19:55Z","cross_cats_sorted":[],"title_canon_sha256":"d0516274adfc79c7bacee6a96381c80caede839d3d6d992461a2973848911b7b","abstract_canon_sha256":"ccdbe788b8fc1eb78ff36ebdb3c497773ccbf18ea0f0037b4301eedbacaae7c4"},"schema_version":"1.0"},"canonical_sha256":"454e4e54eda8d45f960537a7b4c2144ada12f79cc1401d804aae92fdb5f441bb","source":{"kind":"arxiv","id":"1911.00044","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.00044","created_at":"2026-07-05T00:34:04Z"},{"alias_kind":"arxiv_version","alias_value":"1911.00044v3","created_at":"2026-07-05T00:34:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.00044","created_at":"2026-07-05T00:34:04Z"},{"alias_kind":"pith_short_12","alias_value":"IVHE4VHNVDKF","created_at":"2026-07-05T00:34:04Z"},{"alias_kind":"pith_short_16","alias_value":"IVHE4VHNVDKF7FQF","created_at":"2026-07-05T00:34:04Z"},{"alias_kind":"pith_short_8","alias_value":"IVHE4VHN","created_at":"2026-07-05T00:34:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:IVHE4VHNVDKF7FQFG6T3JQQUJL","target":"record","payload":{"canonical_record":{"source":{"id":"1911.00044","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-10-31T18:19:55Z","cross_cats_sorted":[],"title_canon_sha256":"d0516274adfc79c7bacee6a96381c80caede839d3d6d992461a2973848911b7b","abstract_canon_sha256":"ccdbe788b8fc1eb78ff36ebdb3c497773ccbf18ea0f0037b4301eedbacaae7c4"},"schema_version":"1.0"},"canonical_sha256":"454e4e54eda8d45f960537a7b4c2144ada12f79cc1401d804aae92fdb5f441bb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:34:04.408715Z","signature_b64":"LilT6lwGJl8Gy4km6Iq8nGtPrcXcLVAzuBvEP5F2yXktPRqdWg8uJh7DYXcyH7p2VeW8+/fn/oo6Ja6LcsDrAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"454e4e54eda8d45f960537a7b4c2144ada12f79cc1401d804aae92fdb5f441bb","last_reissued_at":"2026-07-05T00:34:04.408251Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:34:04.408251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.00044","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-07-05T00:34:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oLCnu61cptehPsr+cHhkvE+qK0OViqjggctu1GNf95+uOBtYIoLWdVCdH7OrR+zxqU5kjTARcBs+xvv5XvVXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:40:43.804298Z"},"content_sha256":"8129ad3bc90f02de9d3d794d9d9a6b35cf4cf011e8c47d2071c88f96ad82dd19","schema_version":"1.0","event_id":"sha256:8129ad3bc90f02de9d3d794d9d9a6b35cf4cf011e8c47d2071c88f96ad82dd19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:IVHE4VHNVDKF7FQFG6T3JQQUJL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Edge minimization in de Bruijn graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Enno Ohlebusch, Pascal Weber, Thomas B\\\"uchler, Uwe Baier","submitted_at":"2019-10-31T18:19:55Z","abstract_excerpt":"This paper introduces the de Bruijn graph edge minimization problem, which is related to the compression of de Bruijn graphs: find the order-k de Bruijn graph with minimum edge count among all orders. We describe an efficient algorithm that solves this problem. Since the edge minimization problem is connected to the BWT compression technique called \"tunneling\", the paper also describes a way to minimize the length of a tunneled BWT in such a way that useful properties for sequence analysis are preserved. Although being a restriction, this is significant progress towards a solution to the open "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.00044","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.00044/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:34:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iath7RFXMZU17N+7BNEkJdUplG2bw7/rTtAFEeVjFX1T23wz7dljB+k5193MnSv2bS6+gQe+Sp/Zysi39fQ2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:40:43.804845Z"},"content_sha256":"64ca11319f346f9ca9520ef1afea4d3ab8d6a1687902e35f5730d3dc9157a413","schema_version":"1.0","event_id":"sha256:64ca11319f346f9ca9520ef1afea4d3ab8d6a1687902e35f5730d3dc9157a413"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IVHE4VHNVDKF7FQFG6T3JQQUJL/bundle.json","state_url":"https://pith.science/pith/IVHE4VHNVDKF7FQFG6T3JQQUJL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IVHE4VHNVDKF7FQFG6T3JQQUJL/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-08-16T06:40:43Z","links":{"resolver":"https://pith.science/pith/IVHE4VHNVDKF7FQFG6T3JQQUJL","bundle":"https://pith.science/pith/IVHE4VHNVDKF7FQFG6T3JQQUJL/bundle.json","state":"https://pith.science/pith/IVHE4VHNVDKF7FQFG6T3JQQUJL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IVHE4VHNVDKF7FQFG6T3JQQUJL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:IVHE4VHNVDKF7FQFG6T3JQQUJL","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":"ccdbe788b8fc1eb78ff36ebdb3c497773ccbf18ea0f0037b4301eedbacaae7c4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-10-31T18:19:55Z","title_canon_sha256":"d0516274adfc79c7bacee6a96381c80caede839d3d6d992461a2973848911b7b"},"schema_version":"1.0","source":{"id":"1911.00044","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.00044","created_at":"2026-07-05T00:34:04Z"},{"alias_kind":"arxiv_version","alias_value":"1911.00044v3","created_at":"2026-07-05T00:34:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.00044","created_at":"2026-07-05T00:34:04Z"},{"alias_kind":"pith_short_12","alias_value":"IVHE4VHNVDKF","created_at":"2026-07-05T00:34:04Z"},{"alias_kind":"pith_short_16","alias_value":"IVHE4VHNVDKF7FQF","created_at":"2026-07-05T00:34:04Z"},{"alias_kind":"pith_short_8","alias_value":"IVHE4VHN","created_at":"2026-07-05T00:34:04Z"}],"graph_snapshots":[{"event_id":"sha256:64ca11319f346f9ca9520ef1afea4d3ab8d6a1687902e35f5730d3dc9157a413","target":"graph","created_at":"2026-07-05T00:34:04Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.00044/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper introduces the de Bruijn graph edge minimization problem, which is related to the compression of de Bruijn graphs: find the order-k de Bruijn graph with minimum edge count among all orders. We describe an efficient algorithm that solves this problem. Since the edge minimization problem is connected to the BWT compression technique called \"tunneling\", the paper also describes a way to minimize the length of a tunneled BWT in such a way that useful properties for sequence analysis are preserved. Although being a restriction, this is significant progress towards a solution to the open ","authors_text":"Enno Ohlebusch, Pascal Weber, Thomas B\\\"uchler, Uwe Baier","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-10-31T18:19:55Z","title":"Edge minimization in de Bruijn graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.00044","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:8129ad3bc90f02de9d3d794d9d9a6b35cf4cf011e8c47d2071c88f96ad82dd19","target":"record","created_at":"2026-07-05T00:34:04Z","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":"ccdbe788b8fc1eb78ff36ebdb3c497773ccbf18ea0f0037b4301eedbacaae7c4","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2019-10-31T18:19:55Z","title_canon_sha256":"d0516274adfc79c7bacee6a96381c80caede839d3d6d992461a2973848911b7b"},"schema_version":"1.0","source":{"id":"1911.00044","kind":"arxiv","version":3}},"canonical_sha256":"454e4e54eda8d45f960537a7b4c2144ada12f79cc1401d804aae92fdb5f441bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"454e4e54eda8d45f960537a7b4c2144ada12f79cc1401d804aae92fdb5f441bb","first_computed_at":"2026-07-05T00:34:04.408251Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:34:04.408251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LilT6lwGJl8Gy4km6Iq8nGtPrcXcLVAzuBvEP5F2yXktPRqdWg8uJh7DYXcyH7p2VeW8+/fn/oo6Ja6LcsDrAA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:34:04.408715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.00044","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8129ad3bc90f02de9d3d794d9d9a6b35cf4cf011e8c47d2071c88f96ad82dd19","sha256:64ca11319f346f9ca9520ef1afea4d3ab8d6a1687902e35f5730d3dc9157a413"],"state_sha256":"697765872996ec303535a4fb4d3d07b35b7896ff90aab24e6d19c94e2ac05ad5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gugFmtaoiqkQcsy8nuCPO0DxzHlg+cGJpZ/bvabY8VfiCI8UIDCkiXUumMyewhvZL/JAqN66Z0z8/eIBsOMiAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T06:40:43.807987Z","bundle_sha256":"8995d10c9eb67e68039fb7a3fc26b5c9fafdf603497a4e4a7c0480d8b7365ea0"}}