{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:M3A6G7KKR7TLYY7UFDQFOZHTFO","short_pith_number":"pith:M3A6G7KK","schema_version":"1.0","canonical_sha256":"66c1e37d4a8fe6bc63f428e05764f32ba61f5b993091557746e6e079cda0d3e1","source":{"kind":"arxiv","id":"1705.06180","version":1},"attestation_state":"computed","paper":{"title":"TSP With Locational Uncertainty: The Adversarial Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Gui Citovsky, Joseph S. B. Mitchell, Tyler Mayer","submitted_at":"2017-05-17T14:36:34Z","abstract_excerpt":"In this paper we study a natural special case of the Traveling Salesman Problem (TSP) with point-locational-uncertainty which we will call the {\\em adversarial TSP} problem (ATSP). Given a metric space $(X, d)$ and a set of subsets $R = \\{R_1, R_2, ... , R_n\\} : R_i \\subseteq X$, the goal is to devise an ordering of the regions, $\\sigma_R$, that the tour will visit such that when a single point is chosen from each region, the induced tour over those points in the ordering prescribed by $\\sigma_R$ is as short as possible. Unlike the classical locational-uncertainty-TSP problem, which focuses on"},"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":"1705.06180","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-05-17T14:36:34Z","cross_cats_sorted":[],"title_canon_sha256":"fdce37623f48f67ffad731413dd897efd1f2bfbb79c31c41b3d6f146373c2c79","abstract_canon_sha256":"f5ae9b769729178dd1a91c11e507e3c0fd4c38b9fa2175ab2bc9ac0f956ff5ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:18.476848Z","signature_b64":"F+g2kux/MHPAnPcSl3yrxWDj8hYCOaDAaBr4Iqeh9AA6Nr9djmtDwMYWR4/9x3wAHq6rz0lStV5JcZR+ksMDDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"66c1e37d4a8fe6bc63f428e05764f32ba61f5b993091557746e6e079cda0d3e1","last_reissued_at":"2026-05-18T00:44:18.476237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:18.476237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"TSP With Locational Uncertainty: The Adversarial Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Gui Citovsky, Joseph S. B. Mitchell, Tyler Mayer","submitted_at":"2017-05-17T14:36:34Z","abstract_excerpt":"In this paper we study a natural special case of the Traveling Salesman Problem (TSP) with point-locational-uncertainty which we will call the {\\em adversarial TSP} problem (ATSP). Given a metric space $(X, d)$ and a set of subsets $R = \\{R_1, R_2, ... , R_n\\} : R_i \\subseteq X$, the goal is to devise an ordering of the regions, $\\sigma_R$, that the tour will visit such that when a single point is chosen from each region, the induced tour over those points in the ordering prescribed by $\\sigma_R$ is as short as possible. Unlike the classical locational-uncertainty-TSP problem, which focuses on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06180","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":"1705.06180","created_at":"2026-05-18T00:44:18.476310+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06180v1","created_at":"2026-05-18T00:44:18.476310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06180","created_at":"2026-05-18T00:44:18.476310+00:00"},{"alias_kind":"pith_short_12","alias_value":"M3A6G7KKR7TL","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"M3A6G7KKR7TLYY7U","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"M3A6G7KK","created_at":"2026-05-18T12:31:28.150371+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/M3A6G7KKR7TLYY7UFDQFOZHTFO","json":"https://pith.science/pith/M3A6G7KKR7TLYY7UFDQFOZHTFO.json","graph_json":"https://pith.science/api/pith-number/M3A6G7KKR7TLYY7UFDQFOZHTFO/graph.json","events_json":"https://pith.science/api/pith-number/M3A6G7KKR7TLYY7UFDQFOZHTFO/events.json","paper":"https://pith.science/paper/M3A6G7KK"},"agent_actions":{"view_html":"https://pith.science/pith/M3A6G7KKR7TLYY7UFDQFOZHTFO","download_json":"https://pith.science/pith/M3A6G7KKR7TLYY7UFDQFOZHTFO.json","view_paper":"https://pith.science/paper/M3A6G7KK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06180&json=true","fetch_graph":"https://pith.science/api/pith-number/M3A6G7KKR7TLYY7UFDQFOZHTFO/graph.json","fetch_events":"https://pith.science/api/pith-number/M3A6G7KKR7TLYY7UFDQFOZHTFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M3A6G7KKR7TLYY7UFDQFOZHTFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M3A6G7KKR7TLYY7UFDQFOZHTFO/action/storage_attestation","attest_author":"https://pith.science/pith/M3A6G7KKR7TLYY7UFDQFOZHTFO/action/author_attestation","sign_citation":"https://pith.science/pith/M3A6G7KKR7TLYY7UFDQFOZHTFO/action/citation_signature","submit_replication":"https://pith.science/pith/M3A6G7KKR7TLYY7UFDQFOZHTFO/action/replication_record"}},"created_at":"2026-05-18T00:44:18.476310+00:00","updated_at":"2026-05-18T00:44:18.476310+00:00"}