{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:DFZJPPB72BDDIBQHRJZ5NTBSTG","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":"03e821a94c57aa5b5e89eeedcee7b6fec5877e288d5871e9f607f36639aad683","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-04-01T21:10:34Z","title_canon_sha256":"2808dd6f120ec72e9cce1956d158f99b43794cf377a80a9f3b1113e43f951e1c"},"schema_version":"1.0","source":{"id":"2204.00697","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.00697","created_at":"2026-07-05T07:29:08Z"},{"alias_kind":"arxiv_version","alias_value":"2204.00697v2","created_at":"2026-07-05T07:29:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.00697","created_at":"2026-07-05T07:29:08Z"},{"alias_kind":"pith_short_12","alias_value":"DFZJPPB72BDD","created_at":"2026-07-05T07:29:08Z"},{"alias_kind":"pith_short_16","alias_value":"DFZJPPB72BDDIBQH","created_at":"2026-07-05T07:29:08Z"},{"alias_kind":"pith_short_8","alias_value":"DFZJPPB7","created_at":"2026-07-05T07:29:08Z"}],"graph_snapshots":[{"event_id":"sha256:9e6cea2a43681b0c94dde9534d7598f6a50625d26e03efd11d774872a41789bc","target":"graph","created_at":"2026-07-05T07:29:08Z","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/2204.00697/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this article, we consider a multi-agent path planning problem in a partially impeded environment. The impeded environment is represented by a graph with select road segments (edges) in disrepair impeding vehicular movement in the road network. A convoy wishes to travel from a starting location to a destination while minimizing some accumulated cost. The convoy may traverse an impeded edge for an additional cost (associated with repairing the edge) than if it were unimpeded. A second vehicle, referred to as a service vehicle, is simultaneously deployed with the convoy. The service vehicle as","authors_text":"Abhay Singh Bhadoriya, Christopher Montez, David W. Casbeer, Satyanarayana G. Manyam, Sivakumar Rathinam, Swaroop Darbha","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-04-01T21:10:34Z","title":"Assisted Shortest Path Planning for a Convoy through a Repairable Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.00697","kind":"arxiv","version":2},"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:97af11f1d423885e369deb613d7f50da0112cb0fb0dcb46845ac29b443f1d5e1","target":"record","created_at":"2026-07-05T07:29:08Z","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":"03e821a94c57aa5b5e89eeedcee7b6fec5877e288d5871e9f607f36639aad683","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-04-01T21:10:34Z","title_canon_sha256":"2808dd6f120ec72e9cce1956d158f99b43794cf377a80a9f3b1113e43f951e1c"},"schema_version":"1.0","source":{"id":"2204.00697","kind":"arxiv","version":2}},"canonical_sha256":"197297bc3fd0463406078a73d6cc3299b319733eafe8cbeec3d98d6b484f9055","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"197297bc3fd0463406078a73d6cc3299b319733eafe8cbeec3d98d6b484f9055","first_computed_at":"2026-07-05T07:29:08.507763Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:29:08.507763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fPqUnELZMRcmp1hFEohGSZtpXtvz2p5SLNLwNf9UCU+E1Xf64gvcP3MVIQMMLoSyz6ogi+/7k5bXk+VU3KKeBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:29:08.508211Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.00697","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97af11f1d423885e369deb613d7f50da0112cb0fb0dcb46845ac29b443f1d5e1","sha256:9e6cea2a43681b0c94dde9534d7598f6a50625d26e03efd11d774872a41789bc"],"state_sha256":"0de0d0e2a357ae6867a415b2913c1c6c5c882a5b0ba09e3c9522e0ef862d6e88"}