{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YLVHLP2CMFGJPDJRLEI2JSBA4Q","short_pith_number":"pith:YLVHLP2C","schema_version":"1.0","canonical_sha256":"c2ea75bf42614c978d315911a4c820e406af2c4c33790010dae6aad41b43b6bb","source":{"kind":"arxiv","id":"1302.3145","version":2},"attestation_state":"computed","paper":{"title":"An Improved Integrality Gap for Asymmetric TSP Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Mohit Singh, Zachary Friggstad","submitted_at":"2013-02-13T15:49:23Z","abstract_excerpt":"The Asymmetric Traveling Salesperson Path Problem (ATSPP) is one where, given an asymmetric metric space $(V,d)$ with specified vertices s and t, the goal is to find an s-t path of minimum length that passes through all the vertices in V.\n  This problem is closely related to the Asymmetric TSP (ATSP), which seeks to find a tour (instead of an $s-t$ path) visiting all the nodes: for ATSP, a $\\rho$-approximation guarantee implies an $O(\\rho)$-approximation for ATSPP. However, no such connection is known for the integrality gaps of the linear programming relaxations for these problems: the curren"},"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":"1302.3145","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-02-13T15:49:23Z","cross_cats_sorted":[],"title_canon_sha256":"433fd3dc80f9282438440f7554bcaed200ab74adab65f473727ab8f28215da45","abstract_canon_sha256":"b9e994925ea813ac337377c6f3cc0d60ceb7f10224d48418285354c18048ee3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:01.359930Z","signature_b64":"SNl92alAZiqFWDaAAhRo9lNq7B4tFKJhdhbZ63hHu1gUnY1bMZ2rx/tKuCTmXFQVmdGHptwFVU1A+cZByizSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2ea75bf42614c978d315911a4c820e406af2c4c33790010dae6aad41b43b6bb","last_reissued_at":"2026-05-18T02:30:01.359385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:01.359385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Integrality Gap for Asymmetric TSP Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Mohit Singh, Zachary Friggstad","submitted_at":"2013-02-13T15:49:23Z","abstract_excerpt":"The Asymmetric Traveling Salesperson Path Problem (ATSPP) is one where, given an asymmetric metric space $(V,d)$ with specified vertices s and t, the goal is to find an s-t path of minimum length that passes through all the vertices in V.\n  This problem is closely related to the Asymmetric TSP (ATSP), which seeks to find a tour (instead of an $s-t$ path) visiting all the nodes: for ATSP, a $\\rho$-approximation guarantee implies an $O(\\rho)$-approximation for ATSPP. However, no such connection is known for the integrality gaps of the linear programming relaxations for these problems: the curren"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3145","kind":"arxiv","version":2},"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":"1302.3145","created_at":"2026-05-18T02:30:01.359466+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3145v2","created_at":"2026-05-18T02:30:01.359466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3145","created_at":"2026-05-18T02:30:01.359466+00:00"},{"alias_kind":"pith_short_12","alias_value":"YLVHLP2CMFGJ","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"YLVHLP2CMFGJPDJR","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"YLVHLP2C","created_at":"2026-05-18T12:28:06.772260+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/YLVHLP2CMFGJPDJRLEI2JSBA4Q","json":"https://pith.science/pith/YLVHLP2CMFGJPDJRLEI2JSBA4Q.json","graph_json":"https://pith.science/api/pith-number/YLVHLP2CMFGJPDJRLEI2JSBA4Q/graph.json","events_json":"https://pith.science/api/pith-number/YLVHLP2CMFGJPDJRLEI2JSBA4Q/events.json","paper":"https://pith.science/paper/YLVHLP2C"},"agent_actions":{"view_html":"https://pith.science/pith/YLVHLP2CMFGJPDJRLEI2JSBA4Q","download_json":"https://pith.science/pith/YLVHLP2CMFGJPDJRLEI2JSBA4Q.json","view_paper":"https://pith.science/paper/YLVHLP2C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3145&json=true","fetch_graph":"https://pith.science/api/pith-number/YLVHLP2CMFGJPDJRLEI2JSBA4Q/graph.json","fetch_events":"https://pith.science/api/pith-number/YLVHLP2CMFGJPDJRLEI2JSBA4Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YLVHLP2CMFGJPDJRLEI2JSBA4Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YLVHLP2CMFGJPDJRLEI2JSBA4Q/action/storage_attestation","attest_author":"https://pith.science/pith/YLVHLP2CMFGJPDJRLEI2JSBA4Q/action/author_attestation","sign_citation":"https://pith.science/pith/YLVHLP2CMFGJPDJRLEI2JSBA4Q/action/citation_signature","submit_replication":"https://pith.science/pith/YLVHLP2CMFGJPDJRLEI2JSBA4Q/action/replication_record"}},"created_at":"2026-05-18T02:30:01.359466+00:00","updated_at":"2026-05-18T02:30:01.359466+00:00"}