{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:DFZJPPB72BDDIBQHRJZ5NTBSTG","short_pith_number":"pith:DFZJPPB7","schema_version":"1.0","canonical_sha256":"197297bc3fd0463406078a73d6cc3299b319733eafe8cbeec3d98d6b484f9055","source":{"kind":"arxiv","id":"2204.00697","version":2},"attestation_state":"computed","paper":{"title":"Assisted Shortest Path Planning for a Convoy through a Repairable Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.RO","authors_text":"Abhay Singh Bhadoriya, Christopher Montez, David W. Casbeer, Satyanarayana G. Manyam, Sivakumar Rathinam, Swaroop Darbha","submitted_at":"2022-04-01T21:10:34Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2204.00697","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-04-01T21:10:34Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2808dd6f120ec72e9cce1956d158f99b43794cf377a80a9f3b1113e43f951e1c","abstract_canon_sha256":"03e821a94c57aa5b5e89eeedcee7b6fec5877e288d5871e9f607f36639aad683"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:29:08.508211Z","signature_b64":"fPqUnELZMRcmp1hFEohGSZtpXtvz2p5SLNLwNf9UCU+E1Xf64gvcP3MVIQMMLoSyz6ogi+/7k5bXk+VU3KKeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"197297bc3fd0463406078a73d6cc3299b319733eafe8cbeec3d98d6b484f9055","last_reissued_at":"2026-07-05T07:29:08.507763Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:29:08.507763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Assisted Shortest Path Planning for a Convoy through a Repairable Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.RO","authors_text":"Abhay Singh Bhadoriya, Christopher Montez, David W. Casbeer, Satyanarayana G. Manyam, Sivakumar Rathinam, Swaroop Darbha","submitted_at":"2022-04-01T21:10:34Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.00697","kind":"arxiv","version":2},"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/2204.00697/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2204.00697","created_at":"2026-07-05T07:29:08.507822+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.00697v2","created_at":"2026-07-05T07:29:08.507822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.00697","created_at":"2026-07-05T07:29:08.507822+00:00"},{"alias_kind":"pith_short_12","alias_value":"DFZJPPB72BDD","created_at":"2026-07-05T07:29:08.507822+00:00"},{"alias_kind":"pith_short_16","alias_value":"DFZJPPB72BDDIBQH","created_at":"2026-07-05T07:29:08.507822+00:00"},{"alias_kind":"pith_short_8","alias_value":"DFZJPPB7","created_at":"2026-07-05T07:29:08.507822+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DFZJPPB72BDDIBQHRJZ5NTBSTG","json":"https://pith.science/pith/DFZJPPB72BDDIBQHRJZ5NTBSTG.json","graph_json":"https://pith.science/api/pith-number/DFZJPPB72BDDIBQHRJZ5NTBSTG/graph.json","events_json":"https://pith.science/api/pith-number/DFZJPPB72BDDIBQHRJZ5NTBSTG/events.json","paper":"https://pith.science/paper/DFZJPPB7"},"agent_actions":{"view_html":"https://pith.science/pith/DFZJPPB72BDDIBQHRJZ5NTBSTG","download_json":"https://pith.science/pith/DFZJPPB72BDDIBQHRJZ5NTBSTG.json","view_paper":"https://pith.science/paper/DFZJPPB7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.00697&json=true","fetch_graph":"https://pith.science/api/pith-number/DFZJPPB72BDDIBQHRJZ5NTBSTG/graph.json","fetch_events":"https://pith.science/api/pith-number/DFZJPPB72BDDIBQHRJZ5NTBSTG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DFZJPPB72BDDIBQHRJZ5NTBSTG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DFZJPPB72BDDIBQHRJZ5NTBSTG/action/storage_attestation","attest_author":"https://pith.science/pith/DFZJPPB72BDDIBQHRJZ5NTBSTG/action/author_attestation","sign_citation":"https://pith.science/pith/DFZJPPB72BDDIBQHRJZ5NTBSTG/action/citation_signature","submit_replication":"https://pith.science/pith/DFZJPPB72BDDIBQHRJZ5NTBSTG/action/replication_record"}},"created_at":"2026-07-05T07:29:08.507822+00:00","updated_at":"2026-07-05T07:29:08.507822+00:00"}