{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3Z7BUTAFV7XZJFXDWK2HPVXKID","short_pith_number":"pith:3Z7BUTAF","schema_version":"1.0","canonical_sha256":"de7e1a4c05afef9496e3b2b477d6ea40ca1d54bb95b5ca8f18dd6fb906bcfd09","source":{"kind":"arxiv","id":"2606.18730","version":1},"attestation_state":"computed","paper":{"title":"Two-Phase Bilevel Search for the Moving-Target Traveling Salesman Problem with Moving Obstacles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.CO","math.OC"],"primary_cat":"cs.RO","authors_text":"Allen George Philip, Anoop Bhat, Howie Choset, Sivakumar Rathinam","submitted_at":"2026-06-17T06:17:12Z","abstract_excerpt":"The Moving-Target Traveling Salesman Problem (MT-TSP) seeks a minimum cost trajectory for an agent that departs from a static depot, visits a set of moving targets, each within one of their assigned time windows, and returns to the depot. In this article, we study the Moving-Target Traveling Salesman Problem with Moving Obstacles (MT-TSP-MO), a generalization of the MT-TSP where the agent trajectory must avoid moving obstacles. We present a Mixed-Integer Conic Programming (MICP) formulation that can be solved using off-the-shelf solvers, as well as a fast and scalable Two-Phase Bilevel Search "},"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":"2606.18730","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-06-17T06:17:12Z","cross_cats_sorted":["cs.AI","math.CO","math.OC"],"title_canon_sha256":"4c694ebd78b7be7a1b2f76ee7df345f3418f29de1d1ab14b5c315814cb195990","abstract_canon_sha256":"8428733bc26b09dcb8a2c7cfcde24645b273b6a3c62f37fd97a47524dbdd0a02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:11:45.864788Z","signature_b64":"4Qf7znwJ3BsADK3aHAzXXOyG0noA5JakzJPb2mgrJcH1QsQSXzrpafLE7cyG6HFTALWQJI6+K5uh/c5LIpSIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de7e1a4c05afef9496e3b2b477d6ea40ca1d54bb95b5ca8f18dd6fb906bcfd09","last_reissued_at":"2026-06-19T16:11:45.864433Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:11:45.864433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Phase Bilevel Search for the Moving-Target Traveling Salesman Problem with Moving Obstacles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","math.CO","math.OC"],"primary_cat":"cs.RO","authors_text":"Allen George Philip, Anoop Bhat, Howie Choset, Sivakumar Rathinam","submitted_at":"2026-06-17T06:17:12Z","abstract_excerpt":"The Moving-Target Traveling Salesman Problem (MT-TSP) seeks a minimum cost trajectory for an agent that departs from a static depot, visits a set of moving targets, each within one of their assigned time windows, and returns to the depot. In this article, we study the Moving-Target Traveling Salesman Problem with Moving Obstacles (MT-TSP-MO), a generalization of the MT-TSP where the agent trajectory must avoid moving obstacles. We present a Mixed-Integer Conic Programming (MICP) formulation that can be solved using off-the-shelf solvers, as well as a fast and scalable Two-Phase Bilevel Search "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18730","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.18730/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":"2606.18730","created_at":"2026-06-19T16:11:45.864491+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.18730v1","created_at":"2026-06-19T16:11:45.864491+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18730","created_at":"2026-06-19T16:11:45.864491+00:00"},{"alias_kind":"pith_short_12","alias_value":"3Z7BUTAFV7XZ","created_at":"2026-06-19T16:11:45.864491+00:00"},{"alias_kind":"pith_short_16","alias_value":"3Z7BUTAFV7XZJFXD","created_at":"2026-06-19T16:11:45.864491+00:00"},{"alias_kind":"pith_short_8","alias_value":"3Z7BUTAF","created_at":"2026-06-19T16:11:45.864491+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/3Z7BUTAFV7XZJFXDWK2HPVXKID","json":"https://pith.science/pith/3Z7BUTAFV7XZJFXDWK2HPVXKID.json","graph_json":"https://pith.science/api/pith-number/3Z7BUTAFV7XZJFXDWK2HPVXKID/graph.json","events_json":"https://pith.science/api/pith-number/3Z7BUTAFV7XZJFXDWK2HPVXKID/events.json","paper":"https://pith.science/paper/3Z7BUTAF"},"agent_actions":{"view_html":"https://pith.science/pith/3Z7BUTAFV7XZJFXDWK2HPVXKID","download_json":"https://pith.science/pith/3Z7BUTAFV7XZJFXDWK2HPVXKID.json","view_paper":"https://pith.science/paper/3Z7BUTAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.18730&json=true","fetch_graph":"https://pith.science/api/pith-number/3Z7BUTAFV7XZJFXDWK2HPVXKID/graph.json","fetch_events":"https://pith.science/api/pith-number/3Z7BUTAFV7XZJFXDWK2HPVXKID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3Z7BUTAFV7XZJFXDWK2HPVXKID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3Z7BUTAFV7XZJFXDWK2HPVXKID/action/storage_attestation","attest_author":"https://pith.science/pith/3Z7BUTAFV7XZJFXDWK2HPVXKID/action/author_attestation","sign_citation":"https://pith.science/pith/3Z7BUTAFV7XZJFXDWK2HPVXKID/action/citation_signature","submit_replication":"https://pith.science/pith/3Z7BUTAFV7XZJFXDWK2HPVXKID/action/replication_record"}},"created_at":"2026-06-19T16:11:45.864491+00:00","updated_at":"2026-06-19T16:11:45.864491+00:00"}