{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6TSIXDFQWAM4OK4CHQ5UBXDN3M","short_pith_number":"pith:6TSIXDFQ","schema_version":"1.0","canonical_sha256":"f4e48b8cb0b019c72b823c3b40dc6ddb0f8c67b50fea0f1e5ebf8ed58662d1e9","source":{"kind":"arxiv","id":"2409.09852","version":3},"attestation_state":"computed","paper":{"title":"A Complete Algorithm for a Moving Target Traveling Salesman Problem with Obstacles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Anoop Bhat, Bhaskar Vundurthy, Geordan Gutow, Howie Choset, Sivakumar Rathinam, Zhongqiang Ren","submitted_at":"2024-09-15T20:06:58Z","abstract_excerpt":"The moving target traveling salesman problem with obstacles (MT-TSP-O) is a generalization of the traveling salesman problem (TSP) where, as its name suggests, the targets are moving. A solution to the MT-TSP-O is a trajectory that visits each moving target during a certain time window(s), and this trajectory avoids stationary obstacles. We assume each target moves at a constant velocity during each of its time windows. The agent has a speed limit, and this speed limit is no smaller than any target's speed. This paper presents the first complete algorithm for finding feasible solutions to the "},"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":"2409.09852","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-09-15T20:06:58Z","cross_cats_sorted":[],"title_canon_sha256":"a817bf000b8fcb599c4192d163b37a2ddc53bd53693d7512093fe6fcda0f1ed9","abstract_canon_sha256":"24a5c8a167dbfd691abd94c4b7c60e3725398c110ae25ddec2dab4fd6682127b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:25:46.988324Z","signature_b64":"moOxAgKAjRFWNmPcCvMdGt1gHlhH1ZJLC1mw/kEi4gVGTkisSqgk9ZafYoOGVuuYfuoETFN/CkvNf/fXnt1UCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4e48b8cb0b019c72b823c3b40dc6ddb0f8c67b50fea0f1e5ebf8ed58662d1e9","last_reissued_at":"2026-07-05T09:25:46.987725Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:25:46.987725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Complete Algorithm for a Moving Target Traveling Salesman Problem with Obstacles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Anoop Bhat, Bhaskar Vundurthy, Geordan Gutow, Howie Choset, Sivakumar Rathinam, Zhongqiang Ren","submitted_at":"2024-09-15T20:06:58Z","abstract_excerpt":"The moving target traveling salesman problem with obstacles (MT-TSP-O) is a generalization of the traveling salesman problem (TSP) where, as its name suggests, the targets are moving. A solution to the MT-TSP-O is a trajectory that visits each moving target during a certain time window(s), and this trajectory avoids stationary obstacles. We assume each target moves at a constant velocity during each of its time windows. The agent has a speed limit, and this speed limit is no smaller than any target's speed. This paper presents the first complete algorithm for finding feasible solutions to the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.09852","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.09852/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2409.09852","created_at":"2026-07-05T09:25:46.987833+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.09852v3","created_at":"2026-07-05T09:25:46.987833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.09852","created_at":"2026-07-05T09:25:46.987833+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TSIXDFQWAM4","created_at":"2026-07-05T09:25:46.987833+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TSIXDFQWAM4OK4C","created_at":"2026-07-05T09:25:46.987833+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TSIXDFQ","created_at":"2026-07-05T09:25:46.987833+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18730","citing_title":"Two-Phase Bilevel Search for the Moving-Target Traveling Salesman Problem with Moving Obstacles","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6TSIXDFQWAM4OK4CHQ5UBXDN3M","json":"https://pith.science/pith/6TSIXDFQWAM4OK4CHQ5UBXDN3M.json","graph_json":"https://pith.science/api/pith-number/6TSIXDFQWAM4OK4CHQ5UBXDN3M/graph.json","events_json":"https://pith.science/api/pith-number/6TSIXDFQWAM4OK4CHQ5UBXDN3M/events.json","paper":"https://pith.science/paper/6TSIXDFQ"},"agent_actions":{"view_html":"https://pith.science/pith/6TSIXDFQWAM4OK4CHQ5UBXDN3M","download_json":"https://pith.science/pith/6TSIXDFQWAM4OK4CHQ5UBXDN3M.json","view_paper":"https://pith.science/paper/6TSIXDFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.09852&json=true","fetch_graph":"https://pith.science/api/pith-number/6TSIXDFQWAM4OK4CHQ5UBXDN3M/graph.json","fetch_events":"https://pith.science/api/pith-number/6TSIXDFQWAM4OK4CHQ5UBXDN3M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TSIXDFQWAM4OK4CHQ5UBXDN3M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TSIXDFQWAM4OK4CHQ5UBXDN3M/action/storage_attestation","attest_author":"https://pith.science/pith/6TSIXDFQWAM4OK4CHQ5UBXDN3M/action/author_attestation","sign_citation":"https://pith.science/pith/6TSIXDFQWAM4OK4CHQ5UBXDN3M/action/citation_signature","submit_replication":"https://pith.science/pith/6TSIXDFQWAM4OK4CHQ5UBXDN3M/action/replication_record"}},"created_at":"2026-07-05T09:25:46.987833+00:00","updated_at":"2026-07-05T09:25:46.987833+00:00"}