{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:GTKB4LDN53KG76ZB6LO2D4YLOH","short_pith_number":"pith:GTKB4LDN","schema_version":"1.0","canonical_sha256":"34d41e2c6deed46ffb21f2dda1f30b71e7ab57548a41861d108a894a7d798ccf","source":{"kind":"arxiv","id":"0909.2849","version":4},"attestation_state":"computed","paper":{"title":"The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Amin Saberi, Shayan Oveis Gharan","submitted_at":"2009-09-15T18:39:03Z","abstract_excerpt":"We give a constant factor approximation algorithm for the asymmetric traveling salesman problem when the support graph of the solution of the Held-Karp linear programming relaxation has bounded orientable genus."},"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":"0909.2849","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-09-15T18:39:03Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2909f6099a37d394e7bfe14a7444689355422384a7530aae66ccc0ba3b480bf0","abstract_canon_sha256":"c7a5d9451b1470feede3155a94bbf679cae3e0349f6f11edee3794fc9181ca8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:41.530548Z","signature_b64":"eudb1WV3vnK1RzZm1wUfWd9HluafPwFY6jtzjTwdZSI0EshoVgiPA2JBi684M1ngHmwSQ/bekxby7Dw5TQI1Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34d41e2c6deed46ffb21f2dda1f30b71e7ab57548a41861d108a894a7d798ccf","last_reissued_at":"2026-05-18T04:31:41.529989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:41.529989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Amin Saberi, Shayan Oveis Gharan","submitted_at":"2009-09-15T18:39:03Z","abstract_excerpt":"We give a constant factor approximation algorithm for the asymmetric traveling salesman problem when the support graph of the solution of the Held-Karp linear programming relaxation has bounded orientable genus."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0909.2849","kind":"arxiv","version":4},"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":"0909.2849","created_at":"2026-05-18T04:31:41.530082+00:00"},{"alias_kind":"arxiv_version","alias_value":"0909.2849v4","created_at":"2026-05-18T04:31:41.530082+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0909.2849","created_at":"2026-05-18T04:31:41.530082+00:00"},{"alias_kind":"pith_short_12","alias_value":"GTKB4LDN53KG","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"GTKB4LDN53KG76ZB","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"GTKB4LDN","created_at":"2026-05-18T12:25:59.703012+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/GTKB4LDN53KG76ZB6LO2D4YLOH","json":"https://pith.science/pith/GTKB4LDN53KG76ZB6LO2D4YLOH.json","graph_json":"https://pith.science/api/pith-number/GTKB4LDN53KG76ZB6LO2D4YLOH/graph.json","events_json":"https://pith.science/api/pith-number/GTKB4LDN53KG76ZB6LO2D4YLOH/events.json","paper":"https://pith.science/paper/GTKB4LDN"},"agent_actions":{"view_html":"https://pith.science/pith/GTKB4LDN53KG76ZB6LO2D4YLOH","download_json":"https://pith.science/pith/GTKB4LDN53KG76ZB6LO2D4YLOH.json","view_paper":"https://pith.science/paper/GTKB4LDN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0909.2849&json=true","fetch_graph":"https://pith.science/api/pith-number/GTKB4LDN53KG76ZB6LO2D4YLOH/graph.json","fetch_events":"https://pith.science/api/pith-number/GTKB4LDN53KG76ZB6LO2D4YLOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GTKB4LDN53KG76ZB6LO2D4YLOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GTKB4LDN53KG76ZB6LO2D4YLOH/action/storage_attestation","attest_author":"https://pith.science/pith/GTKB4LDN53KG76ZB6LO2D4YLOH/action/author_attestation","sign_citation":"https://pith.science/pith/GTKB4LDN53KG76ZB6LO2D4YLOH/action/citation_signature","submit_replication":"https://pith.science/pith/GTKB4LDN53KG76ZB6LO2D4YLOH/action/replication_record"}},"created_at":"2026-05-18T04:31:41.530082+00:00","updated_at":"2026-05-18T04:31:41.530082+00:00"}