{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4K74UN5AHVWF4D2YKYGVCCTZJB","short_pith_number":"pith:4K74UN5A","schema_version":"1.0","canonical_sha256":"e2bfca37a03d6c5e0f58560d510a794840cc963da7d5ebdd7c6e13fc6f079471","source":{"kind":"arxiv","id":"1312.0378","version":2},"attestation_state":"computed","paper":{"title":"The guillotine approach for TSP with neighborhoods revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sophie Spirkl","submitted_at":"2013-12-02T09:06:32Z","abstract_excerpt":"The Euclidean TSP with neighborhoods (TSPN) is the following problem: Given a set R of k regions, find a shortest tour that visits at least one point from each region. We study the special cases of disjoint, connected, alpha-fat regions (i.e., every region P contains a disk of diameter diam(P)/alpha) and disjoint unit disks.\n  For the latter, Dumitrescu and Mitchell proposed an algorithm based on Mitchell's guillotine subdivision approach for the Euclidean TSP and claimed it to be a PTAS. However, their proof contains a severe gap, which we will close in the following. Bodlaender et al. remark"},"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":"1312.0378","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-12-02T09:06:32Z","cross_cats_sorted":[],"title_canon_sha256":"d6de4d507be5e433ef553a560ed502ef94ef2df4ec45e3318ac285fe48eb600b","abstract_canon_sha256":"03ea68628c538dc0b0cb2c9e113a6f66f7ba110557029a1553cf71e5a91c9b4b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:46.699089Z","signature_b64":"QpO5CW98V0UkPdzu0ZxODVcWKvIZ0yjJ2v9nBmdFFwyV3aTKeV/ly3y9SB6rh4Sl/6jj192UuqIsPO8BrlNGAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2bfca37a03d6c5e0f58560d510a794840cc963da7d5ebdd7c6e13fc6f079471","last_reissued_at":"2026-05-18T02:54:46.698681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:46.698681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The guillotine approach for TSP with neighborhoods revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Sophie Spirkl","submitted_at":"2013-12-02T09:06:32Z","abstract_excerpt":"The Euclidean TSP with neighborhoods (TSPN) is the following problem: Given a set R of k regions, find a shortest tour that visits at least one point from each region. We study the special cases of disjoint, connected, alpha-fat regions (i.e., every region P contains a disk of diameter diam(P)/alpha) and disjoint unit disks.\n  For the latter, Dumitrescu and Mitchell proposed an algorithm based on Mitchell's guillotine subdivision approach for the Euclidean TSP and claimed it to be a PTAS. However, their proof contains a severe gap, which we will close in the following. Bodlaender et al. remark"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0378","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":"1312.0378","created_at":"2026-05-18T02:54:46.698743+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0378v2","created_at":"2026-05-18T02:54:46.698743+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0378","created_at":"2026-05-18T02:54:46.698743+00:00"},{"alias_kind":"pith_short_12","alias_value":"4K74UN5AHVWF","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4K74UN5AHVWF4D2Y","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4K74UN5A","created_at":"2026-05-18T12:27:34.582898+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/4K74UN5AHVWF4D2YKYGVCCTZJB","json":"https://pith.science/pith/4K74UN5AHVWF4D2YKYGVCCTZJB.json","graph_json":"https://pith.science/api/pith-number/4K74UN5AHVWF4D2YKYGVCCTZJB/graph.json","events_json":"https://pith.science/api/pith-number/4K74UN5AHVWF4D2YKYGVCCTZJB/events.json","paper":"https://pith.science/paper/4K74UN5A"},"agent_actions":{"view_html":"https://pith.science/pith/4K74UN5AHVWF4D2YKYGVCCTZJB","download_json":"https://pith.science/pith/4K74UN5AHVWF4D2YKYGVCCTZJB.json","view_paper":"https://pith.science/paper/4K74UN5A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0378&json=true","fetch_graph":"https://pith.science/api/pith-number/4K74UN5AHVWF4D2YKYGVCCTZJB/graph.json","fetch_events":"https://pith.science/api/pith-number/4K74UN5AHVWF4D2YKYGVCCTZJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4K74UN5AHVWF4D2YKYGVCCTZJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4K74UN5AHVWF4D2YKYGVCCTZJB/action/storage_attestation","attest_author":"https://pith.science/pith/4K74UN5AHVWF4D2YKYGVCCTZJB/action/author_attestation","sign_citation":"https://pith.science/pith/4K74UN5AHVWF4D2YKYGVCCTZJB/action/citation_signature","submit_replication":"https://pith.science/pith/4K74UN5AHVWF4D2YKYGVCCTZJB/action/replication_record"}},"created_at":"2026-05-18T02:54:46.698743+00:00","updated_at":"2026-05-18T02:54:46.698743+00:00"}