{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:G4OBYZ4MI2I5FSIWDDCA7SFQC3","short_pith_number":"pith:G4OBYZ4M","schema_version":"1.0","canonical_sha256":"371c1c678c4691d2c91618c40fc8b016e7fa7fc6aaebdbb4f34764bbbcd5500c","source":{"kind":"arxiv","id":"1506.07903","version":4},"attestation_state":"computed","paper":{"title":"Constant-Factor Approximation for TSP with Disks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Adrian Dumitrescu, Csaba D. T\\'oth","submitted_at":"2015-06-25T21:37:03Z","abstract_excerpt":"We revisit the traveling salesman problem with neighborhoods (TSPN) and present the first constant-ratio approximation for disks in the plane: Given a set of $n$ disks in the plane, a TSP tour whose length is at most $O(1)$ times the optimal can be computed in time that is polynomial in $n$. Our result is the first constant-ratio approximation for a class of planar convex bodies of arbitrary size and arbitrary intersections. In order to achieve a $O(1)$-approximation, we reduce the traveling salesman problem with disks, up to constant factors, to a minimum weight hitting set problem in a geome"},"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":"1506.07903","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-06-25T21:37:03Z","cross_cats_sorted":[],"title_canon_sha256":"963a54a031858f361fd0a3c482410241e24050377b7507e2ae43e56d66533f19","abstract_canon_sha256":"124bc9fe9c52bf06cf1f788dabebb7c4ba465fca2df327f558ecc9aba08ce691"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:36.659813Z","signature_b64":"NlrbwKjNp4VCDEuyKMsvzEPfrS7C69JjSx3NQCqyDZP5xbk0zMdVNr5hrfHVibOZ4tAnDgOp0IIas990N90pCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"371c1c678c4691d2c91618c40fc8b016e7fa7fc6aaebdbb4f34764bbbcd5500c","last_reissued_at":"2026-05-18T01:09:36.659418Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:36.659418Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant-Factor Approximation for TSP with Disks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Adrian Dumitrescu, Csaba D. T\\'oth","submitted_at":"2015-06-25T21:37:03Z","abstract_excerpt":"We revisit the traveling salesman problem with neighborhoods (TSPN) and present the first constant-ratio approximation for disks in the plane: Given a set of $n$ disks in the plane, a TSP tour whose length is at most $O(1)$ times the optimal can be computed in time that is polynomial in $n$. Our result is the first constant-ratio approximation for a class of planar convex bodies of arbitrary size and arbitrary intersections. In order to achieve a $O(1)$-approximation, we reduce the traveling salesman problem with disks, up to constant factors, to a minimum weight hitting set problem in a geome"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07903","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":"1506.07903","created_at":"2026-05-18T01:09:36.659478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.07903v4","created_at":"2026-05-18T01:09:36.659478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07903","created_at":"2026-05-18T01:09:36.659478+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4OBYZ4MI2I5","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4OBYZ4MI2I5FSIW","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4OBYZ4M","created_at":"2026-05-18T12:29:22.688609+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/G4OBYZ4MI2I5FSIWDDCA7SFQC3","json":"https://pith.science/pith/G4OBYZ4MI2I5FSIWDDCA7SFQC3.json","graph_json":"https://pith.science/api/pith-number/G4OBYZ4MI2I5FSIWDDCA7SFQC3/graph.json","events_json":"https://pith.science/api/pith-number/G4OBYZ4MI2I5FSIWDDCA7SFQC3/events.json","paper":"https://pith.science/paper/G4OBYZ4M"},"agent_actions":{"view_html":"https://pith.science/pith/G4OBYZ4MI2I5FSIWDDCA7SFQC3","download_json":"https://pith.science/pith/G4OBYZ4MI2I5FSIWDDCA7SFQC3.json","view_paper":"https://pith.science/paper/G4OBYZ4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.07903&json=true","fetch_graph":"https://pith.science/api/pith-number/G4OBYZ4MI2I5FSIWDDCA7SFQC3/graph.json","fetch_events":"https://pith.science/api/pith-number/G4OBYZ4MI2I5FSIWDDCA7SFQC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4OBYZ4MI2I5FSIWDDCA7SFQC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4OBYZ4MI2I5FSIWDDCA7SFQC3/action/storage_attestation","attest_author":"https://pith.science/pith/G4OBYZ4MI2I5FSIWDDCA7SFQC3/action/author_attestation","sign_citation":"https://pith.science/pith/G4OBYZ4MI2I5FSIWDDCA7SFQC3/action/citation_signature","submit_replication":"https://pith.science/pith/G4OBYZ4MI2I5FSIWDDCA7SFQC3/action/replication_record"}},"created_at":"2026-05-18T01:09:36.659478+00:00","updated_at":"2026-05-18T01:09:36.659478+00:00"}