{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VNNV6CDREO3AKLU3EHX25PJQFX","short_pith_number":"pith:VNNV6CDR","canonical_record":{"source":{"id":"2603.21880","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-03-23T12:10:12Z","cross_cats_sorted":[],"title_canon_sha256":"73758bc476db282b25ee212f38b1400660186bc9b69bac21fef4209e976c67e4","abstract_canon_sha256":"748c9d028b917e40c122bd23c5680758c509fc1a84d07b6acf5715ac24fc17d2"},"schema_version":"1.0"},"canonical_sha256":"ab5b5f087123b6052e9b21efaebd302dd9329163c6d6c9e5a3c0be62e0d5f1d6","source":{"kind":"arxiv","id":"2603.21880","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.21880","created_at":"2026-05-25T02:02:14Z"},{"alias_kind":"arxiv_version","alias_value":"2603.21880v4","created_at":"2026-05-25T02:02:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.21880","created_at":"2026-05-25T02:02:14Z"},{"alias_kind":"pith_short_12","alias_value":"VNNV6CDREO3A","created_at":"2026-05-25T02:02:14Z"},{"alias_kind":"pith_short_16","alias_value":"VNNV6CDREO3AKLU3","created_at":"2026-05-25T02:02:14Z"},{"alias_kind":"pith_short_8","alias_value":"VNNV6CDR","created_at":"2026-05-25T02:02:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VNNV6CDREO3AKLU3EHX25PJQFX","target":"record","payload":{"canonical_record":{"source":{"id":"2603.21880","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-03-23T12:10:12Z","cross_cats_sorted":[],"title_canon_sha256":"73758bc476db282b25ee212f38b1400660186bc9b69bac21fef4209e976c67e4","abstract_canon_sha256":"748c9d028b917e40c122bd23c5680758c509fc1a84d07b6acf5715ac24fc17d2"},"schema_version":"1.0"},"canonical_sha256":"ab5b5f087123b6052e9b21efaebd302dd9329163c6d6c9e5a3c0be62e0d5f1d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:02:14.571637Z","signature_b64":"jLrv8B332tsfLzgCKA+zvRNWdYRNpjiTqS63QR+tk0npFxFtkhL4pwolO2VTH5QOyA8O9SMjYB5h9coBdOsCAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ab5b5f087123b6052e9b21efaebd302dd9329163c6d6c9e5a3c0be62e0d5f1d6","last_reissued_at":"2026-05-25T02:02:14.571043Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:02:14.571043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2603.21880","source_version":4,"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-05-25T02:02:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JeFgD/sgOHvmaIHdJiQsGcJy5vdn8LoXh4vxuIEuxKv53nUM5svemqsSCWku1oXoVizd8n05SeVC9WT9plpiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T09:53:23.594087Z"},"content_sha256":"0e4c358eca127aa87d08ff9cae5b23cfa96f0ac885ffc4a5c08438b5ed2918ad","schema_version":"1.0","event_id":"sha256:0e4c358eca127aa87d08ff9cae5b23cfa96f0ac885ffc4a5c08438b5ed2918ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VNNV6CDREO3AKLU3EHX25PJQFX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Solutions for the Moving Target Vehicle Routing Problem with Obstacles via Lazy Branch and Price","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Lazy Branch-and-Price with Relaxed Continuity finds optimal routes for agents to intercept moving targets while avoiding obstacles.","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Anoop Bhat, Geordan Gutow, Howie Choset, Sivakumar Rathinam, Surya Singh, Zhongqiang Ren","submitted_at":"2026-03-23T12:10:12Z","abstract_excerpt":"The Moving Target Vehicle Routing Problem with Obstacles (MT-VRP-O) seeks trajectories for several agents that collectively intercept a set of moving targets. Each target has one or more time windows where it must be visited, and the agents must avoid static obstacles and satisfy speed and capacity constraints. We introduce Lazy Branch-and-Price with Relaxed Continuity (Lazy BPRC), which finds optimal solutions for the MT-VRP-O. Lazy BPRC applies the branch-and-price framework for VRPs, which alternates between a restricted master problem (RMP) and a pricing problem. The RMP aims to select a s"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Lazy BPRC finds optimal solutions for the MT-VRP-O and runs up to an order of magnitude faster than two ablations by deferring true cost computations via lower bounds from relaxed continuity constraints solved on a Graph of Convex Sets.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The lower bounds obtained from motion planning with relaxed continuity constraints are sufficiently tight that the branch-and-price procedure still finds the true optimum without prematurely discarding optimal tours.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Lazy BPRC finds optimal solutions for the Moving Target Vehicle Routing Problem with Obstacles up to an order of magnitude faster than ablations by using lower bounds from relaxed-continuity motion planning.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Lazy Branch-and-Price with Relaxed Continuity finds optimal routes for agents to intercept moving targets while avoiding obstacles.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"fcefa1b751f6a7053bc0624b4a303744d2ad03b9f8be3823ace84e519578dbdf"},"source":{"id":"2603.21880","kind":"arxiv","version":4},"verdict":{"id":"5227763f-63a3-4f60-99c7-5d65a986443d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:03:20.446219Z","strongest_claim":"Lazy BPRC finds optimal solutions for the MT-VRP-O and runs up to an order of magnitude faster than two ablations by deferring true cost computations via lower bounds from relaxed continuity constraints solved on a Graph of Convex Sets.","one_line_summary":"Lazy BPRC finds optimal solutions for the Moving Target Vehicle Routing Problem with Obstacles up to an order of magnitude faster than ablations by using lower bounds from relaxed-continuity motion planning.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The lower bounds obtained from motion planning with relaxed continuity constraints are sufficiently tight that the branch-and-price procedure still finds the true optimum without prematurely discarding optimal tours.","pith_extraction_headline":"Lazy Branch-and-Price with Relaxed Continuity finds optimal routes for agents to intercept moving targets while avoiding obstacles."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.21880/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":"5227763f-63a3-4f60-99c7-5d65a986443d"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T02:02:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"irDPTrw2jCAUPp+0UBx0zqBklPIRmhLH5U9IB6Z65CTd9nB3ADIEYMoHzORKILoCqLpJPHDlmjrScPE1akTfBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T09:53:23.594983Z"},"content_sha256":"33d97509fff6dbe6900482a6f39580e6daa3f713d27daeb80b4714646863ef8b","schema_version":"1.0","event_id":"sha256:33d97509fff6dbe6900482a6f39580e6daa3f713d27daeb80b4714646863ef8b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VNNV6CDREO3AKLU3EHX25PJQFX/bundle.json","state_url":"https://pith.science/pith/VNNV6CDREO3AKLU3EHX25PJQFX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VNNV6CDREO3AKLU3EHX25PJQFX/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-06-10T09:53:23Z","links":{"resolver":"https://pith.science/pith/VNNV6CDREO3AKLU3EHX25PJQFX","bundle":"https://pith.science/pith/VNNV6CDREO3AKLU3EHX25PJQFX/bundle.json","state":"https://pith.science/pith/VNNV6CDREO3AKLU3EHX25PJQFX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VNNV6CDREO3AKLU3EHX25PJQFX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VNNV6CDREO3AKLU3EHX25PJQFX","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":"748c9d028b917e40c122bd23c5680758c509fc1a84d07b6acf5715ac24fc17d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-03-23T12:10:12Z","title_canon_sha256":"73758bc476db282b25ee212f38b1400660186bc9b69bac21fef4209e976c67e4"},"schema_version":"1.0","source":{"id":"2603.21880","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.21880","created_at":"2026-05-25T02:02:14Z"},{"alias_kind":"arxiv_version","alias_value":"2603.21880v4","created_at":"2026-05-25T02:02:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.21880","created_at":"2026-05-25T02:02:14Z"},{"alias_kind":"pith_short_12","alias_value":"VNNV6CDREO3A","created_at":"2026-05-25T02:02:14Z"},{"alias_kind":"pith_short_16","alias_value":"VNNV6CDREO3AKLU3","created_at":"2026-05-25T02:02:14Z"},{"alias_kind":"pith_short_8","alias_value":"VNNV6CDR","created_at":"2026-05-25T02:02:14Z"}],"graph_snapshots":[{"event_id":"sha256:33d97509fff6dbe6900482a6f39580e6daa3f713d27daeb80b4714646863ef8b","target":"graph","created_at":"2026-05-25T02:02:14Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Lazy BPRC finds optimal solutions for the MT-VRP-O and runs up to an order of magnitude faster than two ablations by deferring true cost computations via lower bounds from relaxed continuity constraints solved on a Graph of Convex Sets."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The lower bounds obtained from motion planning with relaxed continuity constraints are sufficiently tight that the branch-and-price procedure still finds the true optimum without prematurely discarding optimal tours."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Lazy BPRC finds optimal solutions for the Moving Target Vehicle Routing Problem with Obstacles up to an order of magnitude faster than ablations by using lower bounds from relaxed-continuity motion planning."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Lazy Branch-and-Price with Relaxed Continuity finds optimal routes for agents to intercept moving targets while avoiding obstacles."}],"snapshot_sha256":"fcefa1b751f6a7053bc0624b4a303744d2ad03b9f8be3823ace84e519578dbdf"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.21880/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Moving Target Vehicle Routing Problem with Obstacles (MT-VRP-O) seeks trajectories for several agents that collectively intercept a set of moving targets. Each target has one or more time windows where it must be visited, and the agents must avoid static obstacles and satisfy speed and capacity constraints. We introduce Lazy Branch-and-Price with Relaxed Continuity (Lazy BPRC), which finds optimal solutions for the MT-VRP-O. Lazy BPRC applies the branch-and-price framework for VRPs, which alternates between a restricted master problem (RMP) and a pricing problem. The RMP aims to select a s","authors_text":"Anoop Bhat, Geordan Gutow, Howie Choset, Sivakumar Rathinam, Surya Singh, Zhongqiang Ren","cross_cats":[],"headline":"Lazy Branch-and-Price with Relaxed Continuity finds optimal routes for agents to intercept moving targets while avoiding obstacles.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-03-23T12:10:12Z","title":"Optimal Solutions for the Moving Target Vehicle Routing Problem with Obstacles via Lazy Branch and Price"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.21880","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-15T01:03:20.446219Z","id":"5227763f-63a3-4f60-99c7-5d65a986443d","model_set":{"reader":"grok-4.3"},"one_line_summary":"Lazy BPRC finds optimal solutions for the Moving Target Vehicle Routing Problem with Obstacles up to an order of magnitude faster than ablations by using lower bounds from relaxed-continuity motion planning.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Lazy Branch-and-Price with Relaxed Continuity finds optimal routes for agents to intercept moving targets while avoiding obstacles.","strongest_claim":"Lazy BPRC finds optimal solutions for the MT-VRP-O and runs up to an order of magnitude faster than two ablations by deferring true cost computations via lower bounds from relaxed continuity constraints solved on a Graph of Convex Sets.","weakest_assumption":"The lower bounds obtained from motion planning with relaxed continuity constraints are sufficiently tight that the branch-and-price procedure still finds the true optimum without prematurely discarding optimal tours."}},"verdict_id":"5227763f-63a3-4f60-99c7-5d65a986443d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0e4c358eca127aa87d08ff9cae5b23cfa96f0ac885ffc4a5c08438b5ed2918ad","target":"record","created_at":"2026-05-25T02:02:14Z","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":"748c9d028b917e40c122bd23c5680758c509fc1a84d07b6acf5715ac24fc17d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-03-23T12:10:12Z","title_canon_sha256":"73758bc476db282b25ee212f38b1400660186bc9b69bac21fef4209e976c67e4"},"schema_version":"1.0","source":{"id":"2603.21880","kind":"arxiv","version":4}},"canonical_sha256":"ab5b5f087123b6052e9b21efaebd302dd9329163c6d6c9e5a3c0be62e0d5f1d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ab5b5f087123b6052e9b21efaebd302dd9329163c6d6c9e5a3c0be62e0d5f1d6","first_computed_at":"2026-05-25T02:02:14.571043Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:02:14.571043Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jLrv8B332tsfLzgCKA+zvRNWdYRNpjiTqS63QR+tk0npFxFtkhL4pwolO2VTH5QOyA8O9SMjYB5h9coBdOsCAg==","signature_status":"signed_v1","signed_at":"2026-05-25T02:02:14.571637Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.21880","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e4c358eca127aa87d08ff9cae5b23cfa96f0ac885ffc4a5c08438b5ed2918ad","sha256:33d97509fff6dbe6900482a6f39580e6daa3f713d27daeb80b4714646863ef8b"],"state_sha256":"74e20c5d54e6f3a0bdcd48ca7971f0567e9be6231a62308aea64b49493bf0c1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"togC4xXtBIsTf4iCLNtFps/NPNczpzeiLi3Vu3OTBmUv7w1A4DWMLJkxe08RPP/w+ACDbsC8b0Y0kneUQrHFAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T09:53:23.600534Z","bundle_sha256":"c22714fa22c88377db0279e962ce55b36063c9f8e9dcc683290f02f99acc51a0"}}