{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EWA2FCYH55SH236N36YPLAKJKC","short_pith_number":"pith:EWA2FCYH","schema_version":"1.0","canonical_sha256":"2581a28b07ef647d6fcddfb0f5814950b5373c4be978c01c86c62460ebfc1895","source":{"kind":"arxiv","id":"1304.7055","version":1},"attestation_state":"computed","paper":{"title":"An LP-based 3/2-approximation algorithm for the graphic s-t path TSP","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Zhihan Gao","submitted_at":"2013-04-26T02:28:22Z","abstract_excerpt":"We design a new LP-based algorithm for the graphic $s$-$t$ path Traveling Salesman Problem (TSP), which achieves the best approximation factor of 1.5. The algorithm is based on the idea of narrow cuts due to An, Kleinberg, and Shmoys. It partly answers an open question of Seb\\H{o}."},"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":"1304.7055","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2013-04-26T02:28:22Z","cross_cats_sorted":[],"title_canon_sha256":"b99cd45c5f073621238e17f576708f82670513350843c52284abdca9f0ba5f49","abstract_canon_sha256":"64599255d4c3627ecf2572a9fac93f0fd3a923e5d32153995568ca44be7f77fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:02.681252Z","signature_b64":"jEpL5wB+cuJ9WLsDhG+EOOuHsNCwHipiOJQ3HB/dXKGQ8Cn8fkkstY28/nzRF5OlPsQ33SMOxglunrKxYX2dBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2581a28b07ef647d6fcddfb0f5814950b5373c4be978c01c86c62460ebfc1895","last_reissued_at":"2026-05-18T03:27:02.680342Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:02.680342Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An LP-based 3/2-approximation algorithm for the graphic s-t path TSP","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Zhihan Gao","submitted_at":"2013-04-26T02:28:22Z","abstract_excerpt":"We design a new LP-based algorithm for the graphic $s$-$t$ path Traveling Salesman Problem (TSP), which achieves the best approximation factor of 1.5. The algorithm is based on the idea of narrow cuts due to An, Kleinberg, and Shmoys. It partly answers an open question of Seb\\H{o}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7055","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":"1304.7055","created_at":"2026-05-18T03:27:02.680453+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7055v1","created_at":"2026-05-18T03:27:02.680453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7055","created_at":"2026-05-18T03:27:02.680453+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWA2FCYH55SH","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWA2FCYH55SH236N","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWA2FCYH","created_at":"2026-05-18T12:27:43.054852+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/EWA2FCYH55SH236N36YPLAKJKC","json":"https://pith.science/pith/EWA2FCYH55SH236N36YPLAKJKC.json","graph_json":"https://pith.science/api/pith-number/EWA2FCYH55SH236N36YPLAKJKC/graph.json","events_json":"https://pith.science/api/pith-number/EWA2FCYH55SH236N36YPLAKJKC/events.json","paper":"https://pith.science/paper/EWA2FCYH"},"agent_actions":{"view_html":"https://pith.science/pith/EWA2FCYH55SH236N36YPLAKJKC","download_json":"https://pith.science/pith/EWA2FCYH55SH236N36YPLAKJKC.json","view_paper":"https://pith.science/paper/EWA2FCYH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7055&json=true","fetch_graph":"https://pith.science/api/pith-number/EWA2FCYH55SH236N36YPLAKJKC/graph.json","fetch_events":"https://pith.science/api/pith-number/EWA2FCYH55SH236N36YPLAKJKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWA2FCYH55SH236N36YPLAKJKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWA2FCYH55SH236N36YPLAKJKC/action/storage_attestation","attest_author":"https://pith.science/pith/EWA2FCYH55SH236N36YPLAKJKC/action/author_attestation","sign_citation":"https://pith.science/pith/EWA2FCYH55SH236N36YPLAKJKC/action/citation_signature","submit_replication":"https://pith.science/pith/EWA2FCYH55SH236N36YPLAKJKC/action/replication_record"}},"created_at":"2026-05-18T03:27:02.680453+00:00","updated_at":"2026-05-18T03:27:02.680453+00:00"}