{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:C5AVPCTID2IGXMQKKC63MC7PPV","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":"176aa57d0a43484bc5c8eebca01566cbd770c4f55eaebcff08fe1dd1512c05fe","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-08T12:30:36Z","title_canon_sha256":"064b123d5f5f9633ecdd293f2245f44ac216da0efeedac2170d331a94f1f5940"},"schema_version":"1.0","source":{"id":"2601.04884","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.04884","created_at":"2026-06-11T01:09:26Z"},{"alias_kind":"arxiv_version","alias_value":"2601.04884v3","created_at":"2026-06-11T01:09:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.04884","created_at":"2026-06-11T01:09:26Z"},{"alias_kind":"pith_short_12","alias_value":"C5AVPCTID2IG","created_at":"2026-06-11T01:09:26Z"},{"alias_kind":"pith_short_16","alias_value":"C5AVPCTID2IGXMQK","created_at":"2026-06-11T01:09:26Z"},{"alias_kind":"pith_short_8","alias_value":"C5AVPCTI","created_at":"2026-06-11T01:09:26Z"}],"graph_snapshots":[{"event_id":"sha256:fb0e5b480a6562c5849fed0f06d86294b4c5c1081b74560ec543a9393fe35ebd","target":"graph","created_at":"2026-06-11T01:09:26Z","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":"Our algorithm, FlexSIPP, precomputes all possible plans for the delayed agent and returns the changes to the other agents for any single-agent delay within the given scenario."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That precomputing flexibility for all possible single delays is computationally feasible and that single-agent delays do not require simultaneous multi-agent adjustments in the target domains."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"FlexSIPP precomputes all possible plans for a delayed agent and returns minimal changes to others using temporal flexibility to handle single delays efficiently."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Precomputing temporal flexibility allows efficient replanning of multi-agent paths after single-agent delays without cascades."}],"snapshot_sha256":"4bd7158c6f44a11498cc92722b5241bd7544a1747164c10a5024ebb83fdfc327"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"7e6eba95d5578256d07aaeb5e26334ec884b6fc589d183b7665bad0f985c7b94"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2601.04884/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Executing a multi-agent plan can be challenging when an agent is delayed, because this typically creates conflicts with other agents. So, we need to quickly find a new safe plan. Replanning only the delayed agent often does not yield an efficient plan, and sometimes cannot even yield a feasible one. On the other hand, replanning other agents may lead to a cascade of changes and delays, and it is computationally expensive. We show how to efficiently replan a single delayed agent by tracking and using the temporal flexibility of other agents while avoiding cascading delays. This flexibility is t","authors_text":"Devin Wild Thomas, Eric Kemmeren, Issa Hanou, Mathijs de Weerdt","cross_cats":[],"headline":"Precomputing temporal flexibility allows efficient replanning of multi-agent paths after single-agent delays without cascades.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-08T12:30:36Z","title":"Precomputing Multi-Agent Path Replanning Using Temporal Flexibility"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.04884","kind":"arxiv","version":3},"verdict":{"created_at":"2026-05-16T16:15:30.941103Z","id":"14a6214f-0791-4c2e-81f7-e1c4f3392737","model_set":{"reader":"grok-4.3"},"one_line_summary":"FlexSIPP precomputes all possible plans for a delayed agent and returns minimal changes to others using temporal flexibility to handle single delays efficiently.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Precomputing temporal flexibility allows efficient replanning of multi-agent paths after single-agent delays without cascades.","strongest_claim":"Our algorithm, FlexSIPP, precomputes all possible plans for the delayed agent and returns the changes to the other agents for any single-agent delay within the given scenario.","weakest_assumption":"That precomputing flexibility for all possible single delays is computationally feasible and that single-agent delays do not require simultaneous multi-agent adjustments in the target domains."}},"verdict_id":"14a6214f-0791-4c2e-81f7-e1c4f3392737"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:76daab73f6bbb6d91873462fbbb2062ea966a34116093f33f7fc0fbccbc8e9ac","target":"record","created_at":"2026-06-11T01:09:26Z","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":"176aa57d0a43484bc5c8eebca01566cbd770c4f55eaebcff08fe1dd1512c05fe","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-01-08T12:30:36Z","title_canon_sha256":"064b123d5f5f9633ecdd293f2245f44ac216da0efeedac2170d331a94f1f5940"},"schema_version":"1.0","source":{"id":"2601.04884","kind":"arxiv","version":3}},"canonical_sha256":"1741578a681e906bb20a50bdb60bef7d7a321c7d4b1757a89842f7044e52a713","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1741578a681e906bb20a50bdb60bef7d7a321c7d4b1757a89842f7044e52a713","first_computed_at":"2026-06-11T01:09:26.172055Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T01:09:26.172055Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F5jPllQbTYhGMPdrXlN5FuOV71tH9Ll2yQiHKTDEuUclKJ8SUNJBPs2yVQiysovyncX5LhEa8VJLIxXcOWMyAA==","signature_status":"signed_v1","signed_at":"2026-06-11T01:09:26.172991Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.04884","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:76daab73f6bbb6d91873462fbbb2062ea966a34116093f33f7fc0fbccbc8e9ac","sha256:fb0e5b480a6562c5849fed0f06d86294b4c5c1081b74560ec543a9393fe35ebd"],"state_sha256":"252f5daca21f6dbb0a551b5744d6cd50122fdfc20065d053e1c71f6e4075f8a8"}