{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:R36MQUXDEYUR7WBKCPRVOEDE5U","short_pith_number":"pith:R36MQUXD","canonical_record":{"source":{"id":"1006.4828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-24T16:35:47Z","cross_cats_sorted":[],"title_canon_sha256":"8bc76327f451bf6524b06946d8eda30bc468962db81c243f6952ab259ac1d23b","abstract_canon_sha256":"87badcd41853833ded89d224427e8b5a466de659ff377f75aaf27f5af3a09c3f"},"schema_version":"1.0"},"canonical_sha256":"8efcc852e326291fd82a13e3571064ed084bee784689236630137a471d6cc0a0","source":{"kind":"arxiv","id":"1006.4828","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.4828","created_at":"2026-05-18T02:06:42Z"},{"alias_kind":"arxiv_version","alias_value":"1006.4828v1","created_at":"2026-05-18T02:06:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.4828","created_at":"2026-05-18T02:06:42Z"},{"alias_kind":"pith_short_12","alias_value":"R36MQUXDEYUR","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"R36MQUXDEYUR7WBK","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"R36MQUXD","created_at":"2026-05-18T12:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:R36MQUXDEYUR7WBKCPRVOEDE5U","target":"record","payload":{"canonical_record":{"source":{"id":"1006.4828","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-24T16:35:47Z","cross_cats_sorted":[],"title_canon_sha256":"8bc76327f451bf6524b06946d8eda30bc468962db81c243f6952ab259ac1d23b","abstract_canon_sha256":"87badcd41853833ded89d224427e8b5a466de659ff377f75aaf27f5af3a09c3f"},"schema_version":"1.0"},"canonical_sha256":"8efcc852e326291fd82a13e3571064ed084bee784689236630137a471d6cc0a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:06:42.686124Z","signature_b64":"ILZsAQ9Sf06FlkITnBDkH8qK1TcvqEA0qSlkqn8k0QoUwoemmQ5GZ3njs1n/BAPqp4VTlXtWiuqZz2TnjVriAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8efcc852e326291fd82a13e3571064ed084bee784689236630137a471d6cc0a0","last_reissued_at":"2026-05-18T02:06:42.685567Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:06:42.685567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.4828","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-18T02:06:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1EhpLJopqk+IQerbaSjhqOLKiL88M6XB23dJtGOcCZZdPKfXm5//a1LEqnKYOQIdB12kFY2eOjcM0Lh36ToKCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:22:02.403488Z"},"content_sha256":"bee7f4fc6c1499ba4d5de6549ce8670a82ae64ed10ac771269de5712f42a3526","schema_version":"1.0","event_id":"sha256:bee7f4fc6c1499ba4d5de6549ce8670a82ae64ed10ac771269de5712f42a3526"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:R36MQUXDEYUR7WBKCPRVOEDE5U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Efficient Algorithm For Chinese Postman Walk on Bi-directed de Bruijn Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hieu Dinh, Sanguthevar Rajasekaran, Vamsi Kundeti","submitted_at":"2010-06-24T16:35:47Z","abstract_excerpt":"Sequence assembly from short reads is an important problem in biology. It is known that solving the sequence assembly problem exactly on a bi-directed de Bruijn graph or a string graph is intractable. However finding a Shortest Double stranded DNA string (SDDNA) containing all the k-long words in the reads seems to be a good heuristic to get close to the original genome. This problem is equivalent to finding a cyclic Chinese Postman (CP) walk on the underlying un-weighted bi-directed de Bruijn graph built from the reads. The Chinese Postman walk Problem (CPP) is solved by reducing it to a gene"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.4828","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-18T02:06:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xpfOVhnEBlAcaG10Q8Uh7QMH3UGnAhXdzoV2ORSSeGe1sNmHu/cMl5XrcKcjREVnLvDxp1cKGHWOySdgQbZYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T01:22:02.403839Z"},"content_sha256":"0704b3b42739ec61dc51685f12391521b950d014cb5c04873a083a1d356d060e","schema_version":"1.0","event_id":"sha256:0704b3b42739ec61dc51685f12391521b950d014cb5c04873a083a1d356d060e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R36MQUXDEYUR7WBKCPRVOEDE5U/bundle.json","state_url":"https://pith.science/pith/R36MQUXDEYUR7WBKCPRVOEDE5U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R36MQUXDEYUR7WBKCPRVOEDE5U/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-26T01:22:02Z","links":{"resolver":"https://pith.science/pith/R36MQUXDEYUR7WBKCPRVOEDE5U","bundle":"https://pith.science/pith/R36MQUXDEYUR7WBKCPRVOEDE5U/bundle.json","state":"https://pith.science/pith/R36MQUXDEYUR7WBKCPRVOEDE5U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R36MQUXDEYUR7WBKCPRVOEDE5U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:R36MQUXDEYUR7WBKCPRVOEDE5U","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":"87badcd41853833ded89d224427e8b5a466de659ff377f75aaf27f5af3a09c3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-24T16:35:47Z","title_canon_sha256":"8bc76327f451bf6524b06946d8eda30bc468962db81c243f6952ab259ac1d23b"},"schema_version":"1.0","source":{"id":"1006.4828","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.4828","created_at":"2026-05-18T02:06:42Z"},{"alias_kind":"arxiv_version","alias_value":"1006.4828v1","created_at":"2026-05-18T02:06:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.4828","created_at":"2026-05-18T02:06:42Z"},{"alias_kind":"pith_short_12","alias_value":"R36MQUXDEYUR","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"R36MQUXDEYUR7WBK","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"R36MQUXD","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:0704b3b42739ec61dc51685f12391521b950d014cb5c04873a083a1d356d060e","target":"graph","created_at":"2026-05-18T02:06:42Z","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":"Sequence assembly from short reads is an important problem in biology. It is known that solving the sequence assembly problem exactly on a bi-directed de Bruijn graph or a string graph is intractable. However finding a Shortest Double stranded DNA string (SDDNA) containing all the k-long words in the reads seems to be a good heuristic to get close to the original genome. This problem is equivalent to finding a cyclic Chinese Postman (CP) walk on the underlying un-weighted bi-directed de Bruijn graph built from the reads. The Chinese Postman walk Problem (CPP) is solved by reducing it to a gene","authors_text":"Hieu Dinh, Sanguthevar Rajasekaran, Vamsi Kundeti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-24T16:35:47Z","title":"An Efficient Algorithm For Chinese Postman Walk on Bi-directed de Bruijn Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.4828","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:bee7f4fc6c1499ba4d5de6549ce8670a82ae64ed10ac771269de5712f42a3526","target":"record","created_at":"2026-05-18T02:06:42Z","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":"87badcd41853833ded89d224427e8b5a466de659ff377f75aaf27f5af3a09c3f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-06-24T16:35:47Z","title_canon_sha256":"8bc76327f451bf6524b06946d8eda30bc468962db81c243f6952ab259ac1d23b"},"schema_version":"1.0","source":{"id":"1006.4828","kind":"arxiv","version":1}},"canonical_sha256":"8efcc852e326291fd82a13e3571064ed084bee784689236630137a471d6cc0a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8efcc852e326291fd82a13e3571064ed084bee784689236630137a471d6cc0a0","first_computed_at":"2026-05-18T02:06:42.685567Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:06:42.685567Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ILZsAQ9Sf06FlkITnBDkH8qK1TcvqEA0qSlkqn8k0QoUwoemmQ5GZ3njs1n/BAPqp4VTlXtWiuqZz2TnjVriAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:06:42.686124Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.4828","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bee7f4fc6c1499ba4d5de6549ce8670a82ae64ed10ac771269de5712f42a3526","sha256:0704b3b42739ec61dc51685f12391521b950d014cb5c04873a083a1d356d060e"],"state_sha256":"415c7c578ddbdd82de1a08fb77de3c4bbb87babc2ba751cd3af8f69ae2a73fcf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NxOwdzvMyGnJiAlkgWLt/rnjoKssc0ycl1KVEr9/uHwZeVTWusJYhA4D9j6sq6YOZhW4RpfqG4Ayp3rQHxXtBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T01:22:02.405941Z","bundle_sha256":"d5497cb56ef8d742ab5b20e509ab70718ba2330996afa6363f0dd52366269931"}}