{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:R36MQUXDEYUR7WBKCPRVOEDE5U","short_pith_number":"pith:R36MQUXD","schema_version":"1.0","canonical_sha256":"8efcc852e326291fd82a13e3571064ed084bee784689236630137a471d6cc0a0","source":{"kind":"arxiv","id":"1006.4828","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1006.4828","created_at":"2026-05-18T02:06:42.685659+00:00"},{"alias_kind":"arxiv_version","alias_value":"1006.4828v1","created_at":"2026-05-18T02:06:42.685659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.4828","created_at":"2026-05-18T02:06:42.685659+00:00"},{"alias_kind":"pith_short_12","alias_value":"R36MQUXDEYUR","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"R36MQUXDEYUR7WBK","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"R36MQUXD","created_at":"2026-05-18T12:26:13.927090+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/R36MQUXDEYUR7WBKCPRVOEDE5U","json":"https://pith.science/pith/R36MQUXDEYUR7WBKCPRVOEDE5U.json","graph_json":"https://pith.science/api/pith-number/R36MQUXDEYUR7WBKCPRVOEDE5U/graph.json","events_json":"https://pith.science/api/pith-number/R36MQUXDEYUR7WBKCPRVOEDE5U/events.json","paper":"https://pith.science/paper/R36MQUXD"},"agent_actions":{"view_html":"https://pith.science/pith/R36MQUXDEYUR7WBKCPRVOEDE5U","download_json":"https://pith.science/pith/R36MQUXDEYUR7WBKCPRVOEDE5U.json","view_paper":"https://pith.science/paper/R36MQUXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1006.4828&json=true","fetch_graph":"https://pith.science/api/pith-number/R36MQUXDEYUR7WBKCPRVOEDE5U/graph.json","fetch_events":"https://pith.science/api/pith-number/R36MQUXDEYUR7WBKCPRVOEDE5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R36MQUXDEYUR7WBKCPRVOEDE5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R36MQUXDEYUR7WBKCPRVOEDE5U/action/storage_attestation","attest_author":"https://pith.science/pith/R36MQUXDEYUR7WBKCPRVOEDE5U/action/author_attestation","sign_citation":"https://pith.science/pith/R36MQUXDEYUR7WBKCPRVOEDE5U/action/citation_signature","submit_replication":"https://pith.science/pith/R36MQUXDEYUR7WBKCPRVOEDE5U/action/replication_record"}},"created_at":"2026-05-18T02:06:42.685659+00:00","updated_at":"2026-05-18T02:06:42.685659+00:00"}