{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:6TSIXDFQWAM4OK4CHQ5UBXDN3M","short_pith_number":"pith:6TSIXDFQ","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"},"canonical_sha256":"f4e48b8cb0b019c72b823c3b40dc6ddb0f8c67b50fea0f1e5ebf8ed58662d1e9","source":{"kind":"arxiv","id":"2409.09852","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.09852","created_at":"2026-07-05T09:25:46Z"},{"alias_kind":"arxiv_version","alias_value":"2409.09852v3","created_at":"2026-07-05T09:25:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.09852","created_at":"2026-07-05T09:25:46Z"},{"alias_kind":"pith_short_12","alias_value":"6TSIXDFQWAM4","created_at":"2026-07-05T09:25:46Z"},{"alias_kind":"pith_short_16","alias_value":"6TSIXDFQWAM4OK4C","created_at":"2026-07-05T09:25:46Z"},{"alias_kind":"pith_short_8","alias_value":"6TSIXDFQ","created_at":"2026-07-05T09:25:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:6TSIXDFQWAM4OK4CHQ5UBXDN3M","target":"record","payload":{"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"},"canonical_sha256":"f4e48b8cb0b019c72b823c3b40dc6ddb0f8c67b50fea0f1e5ebf8ed58662d1e9","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"},"source_kind":"arxiv","source_id":"2409.09852","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:25:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FeGbkmQPDRiDXJHqJMY5kJlo8cmUPbr7jPPiA5KzEBLL6gMlucYoGK+aFBxT5Hw4K/vvUU0pSh+nvprXoK7RDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:22:31.223266Z"},"content_sha256":"d7c1fc61ec228fba074784b488f18a72c57e8a2c441b2aba0601be57817865cb","schema_version":"1.0","event_id":"sha256:d7c1fc61ec228fba074784b488f18a72c57e8a2c441b2aba0601be57817865cb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:6TSIXDFQWAM4OK4CHQ5UBXDN3M","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:25:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fp/lNYBZc85moNibqtzisWhszqbZldYO54qtLaNPDfjHOpdysA+Whc0AdWh7NwCPmyDUGHAu0i8PUg/KuNJ7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T20:22:31.223653Z"},"content_sha256":"227d3b4310a7fbcd538a23a1e565477805146a9f66efe4d2d157a1f6ec6f5ff5","schema_version":"1.0","event_id":"sha256:227d3b4310a7fbcd538a23a1e565477805146a9f66efe4d2d157a1f6ec6f5ff5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6TSIXDFQWAM4OK4CHQ5UBXDN3M/bundle.json","state_url":"https://pith.science/pith/6TSIXDFQWAM4OK4CHQ5UBXDN3M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6TSIXDFQWAM4OK4CHQ5UBXDN3M/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-06T20:22:31Z","links":{"resolver":"https://pith.science/pith/6TSIXDFQWAM4OK4CHQ5UBXDN3M","bundle":"https://pith.science/pith/6TSIXDFQWAM4OK4CHQ5UBXDN3M/bundle.json","state":"https://pith.science/pith/6TSIXDFQWAM4OK4CHQ5UBXDN3M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6TSIXDFQWAM4OK4CHQ5UBXDN3M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:6TSIXDFQWAM4OK4CHQ5UBXDN3M","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":"24a5c8a167dbfd691abd94c4b7c60e3725398c110ae25ddec2dab4fd6682127b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-09-15T20:06:58Z","title_canon_sha256":"a817bf000b8fcb599c4192d163b37a2ddc53bd53693d7512093fe6fcda0f1ed9"},"schema_version":"1.0","source":{"id":"2409.09852","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.09852","created_at":"2026-07-05T09:25:46Z"},{"alias_kind":"arxiv_version","alias_value":"2409.09852v3","created_at":"2026-07-05T09:25:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.09852","created_at":"2026-07-05T09:25:46Z"},{"alias_kind":"pith_short_12","alias_value":"6TSIXDFQWAM4","created_at":"2026-07-05T09:25:46Z"},{"alias_kind":"pith_short_16","alias_value":"6TSIXDFQWAM4OK4C","created_at":"2026-07-05T09:25:46Z"},{"alias_kind":"pith_short_8","alias_value":"6TSIXDFQ","created_at":"2026-07-05T09:25:46Z"}],"graph_snapshots":[{"event_id":"sha256:227d3b4310a7fbcd538a23a1e565477805146a9f66efe4d2d157a1f6ec6f5ff5","target":"graph","created_at":"2026-07-05T09:25:46Z","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/2409.09852/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Anoop Bhat, Bhaskar Vundurthy, Geordan Gutow, Howie Choset, Sivakumar Rathinam, Zhongqiang Ren","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-09-15T20:06:58Z","title":"A Complete Algorithm for a Moving Target Traveling Salesman Problem with Obstacles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.09852","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:d7c1fc61ec228fba074784b488f18a72c57e8a2c441b2aba0601be57817865cb","target":"record","created_at":"2026-07-05T09:25:46Z","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":"24a5c8a167dbfd691abd94c4b7c60e3725398c110ae25ddec2dab4fd6682127b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-09-15T20:06:58Z","title_canon_sha256":"a817bf000b8fcb599c4192d163b37a2ddc53bd53693d7512093fe6fcda0f1ed9"},"schema_version":"1.0","source":{"id":"2409.09852","kind":"arxiv","version":3}},"canonical_sha256":"f4e48b8cb0b019c72b823c3b40dc6ddb0f8c67b50fea0f1e5ebf8ed58662d1e9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4e48b8cb0b019c72b823c3b40dc6ddb0f8c67b50fea0f1e5ebf8ed58662d1e9","first_computed_at":"2026-07-05T09:25:46.987725Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:25:46.987725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"moOxAgKAjRFWNmPcCvMdGt1gHlhH1ZJLC1mw/kEi4gVGTkisSqgk9ZafYoOGVuuYfuoETFN/CkvNf/fXnt1UCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:25:46.988324Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.09852","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d7c1fc61ec228fba074784b488f18a72c57e8a2c441b2aba0601be57817865cb","sha256:227d3b4310a7fbcd538a23a1e565477805146a9f66efe4d2d157a1f6ec6f5ff5"],"state_sha256":"929270cf11661c5a03c6b13c2a709ff3297a1da5c7253a9ffa36fe2a493e6f57"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ws/lTiYLj1ag4rJyXzaHDT1hO+xu0Nl5Zpu3G6rMrl0HX9OOL/1lByu4gz1ftlx0Jx8iKbuUR/ZKRylfdlWMDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T20:22:31.225558Z","bundle_sha256":"72cff1f7b5a94510e9b365dbaec494254e1fa0cc8895c9108786a1b387dd912e"}}