{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:GF47VN2MKTTYRFGSFT2QA2FDYR","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":"3fa707fc8373f5935dea0572b34b39850403f326bd942e5923be3d25cfb8c0a2","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-03-07T22:03:36Z","title_canon_sha256":"305d1d4d8f0452b30d68954693cf431c38c62ef0f5ed0149154a7c9482e9bd02"},"schema_version":"1.0","source":{"id":"2403.04917","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.04917","created_at":"2026-07-05T10:00:35Z"},{"alias_kind":"arxiv_version","alias_value":"2403.04917v3","created_at":"2026-07-05T10:00:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.04917","created_at":"2026-07-05T10:00:35Z"},{"alias_kind":"pith_short_12","alias_value":"GF47VN2MKTTY","created_at":"2026-07-05T10:00:35Z"},{"alias_kind":"pith_short_16","alias_value":"GF47VN2MKTTYRFGS","created_at":"2026-07-05T10:00:35Z"},{"alias_kind":"pith_short_8","alias_value":"GF47VN2M","created_at":"2026-07-05T10:00:35Z"}],"graph_snapshots":[{"event_id":"sha256:01dfffe665ef2b0fd96af9d9e222a97f3563041813ac6d10796f835b1f74252e","target":"graph","created_at":"2026-07-05T10:00:35Z","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/2403.04917/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper introduces a new formulation that finds the optimum for the Moving-Target Traveling Salesman Problem (MT-TSP), which seeks to find a shortest path for an agent, that starts at a depot, visits a set of moving targets exactly once within their assigned time-windows, and returns to the depot. The formulation relies on the key idea that when the targets move along lines, their trajectories become convex sets within the space-time coordinate system. The problem then reduces to finding the shortest path within a graph of convex sets, subject to some speed constraints. We compare our formu","authors_text":"Allen George Philip, Howie Choset, Sivakumar Rathinam, Zhongqiang Ren","cross_cats":["cs.AI","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-03-07T22:03:36Z","title":"A Mixed-Integer Conic Program for the Moving-Target Traveling Salesman Problem based on a Graph of Convex Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.04917","kind":"arxiv","version":3},"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:fd278f7aa38c0aaa74bda95024d641f662e59bb23a0cb03517fdf1a052a75232","target":"record","created_at":"2026-07-05T10:00:35Z","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":"3fa707fc8373f5935dea0572b34b39850403f326bd942e5923be3d25cfb8c0a2","cross_cats_sorted":["cs.AI","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-03-07T22:03:36Z","title_canon_sha256":"305d1d4d8f0452b30d68954693cf431c38c62ef0f5ed0149154a7c9482e9bd02"},"schema_version":"1.0","source":{"id":"2403.04917","kind":"arxiv","version":3}},"canonical_sha256":"3179fab74c54e78894d22cf50068a3c448fa081e3854fbeaa49e3c207c2f3e4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3179fab74c54e78894d22cf50068a3c448fa081e3854fbeaa49e3c207c2f3e4d","first_computed_at":"2026-07-05T10:00:35.175484Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:00:35.175484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iLScEA4qPNKKpFBznfxImAv0gxFZLzGnMtkyBXUQKBOjy00E1XkVYJ8tK2KWGzT47xcMWwz6ltYhV4+HLFfABA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:00:35.175869Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.04917","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fd278f7aa38c0aaa74bda95024d641f662e59bb23a0cb03517fdf1a052a75232","sha256:01dfffe665ef2b0fd96af9d9e222a97f3563041813ac6d10796f835b1f74252e"],"state_sha256":"c6f5ad1fa169c34aa51f601f1a4cd4aaa53e39d70c641bb66f3cbc47a598a485"}