{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3Z7BUTAFV7XZJFXDWK2HPVXKID","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"8428733bc26b09dcb8a2c7cfcde24645b273b6a3c62f37fd97a47524dbdd0a02","cross_cats_sorted":["cs.AI","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-06-17T06:17:12Z","title_canon_sha256":"4c694ebd78b7be7a1b2f76ee7df345f3418f29de1d1ab14b5c315814cb195990"},"schema_version":"1.0","source":{"id":"2606.18730","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.18730","created_at":"2026-06-19T16:11:45Z"},{"alias_kind":"arxiv_version","alias_value":"2606.18730v1","created_at":"2026-06-19T16:11:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18730","created_at":"2026-06-19T16:11:45Z"},{"alias_kind":"pith_short_12","alias_value":"3Z7BUTAFV7XZ","created_at":"2026-06-19T16:11:45Z"},{"alias_kind":"pith_short_16","alias_value":"3Z7BUTAFV7XZJFXD","created_at":"2026-06-19T16:11:45Z"},{"alias_kind":"pith_short_8","alias_value":"3Z7BUTAF","created_at":"2026-06-19T16:11:45Z"}],"graph_snapshots":[{"event_id":"sha256:790b0a73cf888903ec5e89a7f8ff77d78bbcbc1036f2af828a798f6f0983a1e5","target":"graph","created_at":"2026-06-19T16:11:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.18730/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Allen George Philip, Anoop Bhat, Howie Choset, Sivakumar Rathinam","cross_cats":["cs.AI","math.CO","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-06-17T06:17:12Z","title":"Two-Phase Bilevel Search for the Moving-Target Traveling Salesman Problem with Moving Obstacles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18730","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:705476fb549ea06f75c8a593d9758563f95b365a4497e00a68e4d1302a25b35d","target":"record","created_at":"2026-06-19T16:11:45Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"8428733bc26b09dcb8a2c7cfcde24645b273b6a3c62f37fd97a47524dbdd0a02","cross_cats_sorted":["cs.AI","math.CO","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-06-17T06:17:12Z","title_canon_sha256":"4c694ebd78b7be7a1b2f76ee7df345f3418f29de1d1ab14b5c315814cb195990"},"schema_version":"1.0","source":{"id":"2606.18730","kind":"arxiv","version":1}},"canonical_sha256":"de7e1a4c05afef9496e3b2b477d6ea40ca1d54bb95b5ca8f18dd6fb906bcfd09","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de7e1a4c05afef9496e3b2b477d6ea40ca1d54bb95b5ca8f18dd6fb906bcfd09","first_computed_at":"2026-06-19T16:11:45.864433Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:11:45.864433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4Qf7znwJ3BsADK3aHAzXXOyG0noA5JakzJPb2mgrJcH1QsQSXzrpafLE7cyG6HFTALWQJI6+K5uh/c5LIpSIBw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:11:45.864788Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.18730","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:705476fb549ea06f75c8a593d9758563f95b365a4497e00a68e4d1302a25b35d","sha256:790b0a73cf888903ec5e89a7f8ff77d78bbcbc1036f2af828a798f6f0983a1e5"],"state_sha256":"f396eeef9968ff5c030cdd67d466fa6a3100ab70460da9e8b26813c54130ea69"}