{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:ICWFCWNDLBC75WFA23JFRTGC6V","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":"f5561418c033f49f0777e6bad3180712fe47ca1ce75c0ac029d4d8efade5d3ab","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2022-02-08T07:26:45Z","title_canon_sha256":"20bbb75c69576e870bd4f5bbf18d8511fe6018ecdead49784a5c658f95a2a6f2"},"schema_version":"1.0","source":{"id":"2202.10449","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.10449","created_at":"2026-07-05T03:59:04Z"},{"alias_kind":"arxiv_version","alias_value":"2202.10449v1","created_at":"2026-07-05T03:59:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.10449","created_at":"2026-07-05T03:59:04Z"},{"alias_kind":"pith_short_12","alias_value":"ICWFCWNDLBC7","created_at":"2026-07-05T03:59:04Z"},{"alias_kind":"pith_short_16","alias_value":"ICWFCWNDLBC75WFA","created_at":"2026-07-05T03:59:04Z"},{"alias_kind":"pith_short_8","alias_value":"ICWFCWND","created_at":"2026-07-05T03:59:04Z"}],"graph_snapshots":[{"event_id":"sha256:349ec05ec87a8bd91388b12e5ca9bea193bd7e89608d268cbdefd7f229881168","target":"graph","created_at":"2026-07-05T03:59:04Z","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/2202.10449/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-Agent Path Finding (MAPF) is the problem of finding collision-free paths for multiple agents from their start locations to end locations. We consider an extension to this problem, Precedence Constrained Multi-Agent Path Finding (PC-MAPF), wherein agents are assigned a sequence of planning tasks that contain precedence constraints between them. PC-MAPF has various applications, for example in multi-agent pickup and delivery problems where some objects might require multiple agents to collaboratively pickup and move them in unison. Precedence constraints also arise in warehouse assembly pr","authors_text":"Aritra Hazra, Kushal Kedia, Partha Pratim Chakrabarti, Rajat Kumar Jenamani","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2022-02-08T07:26:45Z","title":"Optimal Multi-Agent Path Finding for Precedence Constrained Planning Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.10449","kind":"arxiv","version":1},"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:7b20e26d7250a38093a13809ba3f79fc5f58bc89d43fb98ee13f454606c69d3d","target":"record","created_at":"2026-07-05T03:59:04Z","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":"f5561418c033f49f0777e6bad3180712fe47ca1ce75c0ac029d4d8efade5d3ab","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.MA","submitted_at":"2022-02-08T07:26:45Z","title_canon_sha256":"20bbb75c69576e870bd4f5bbf18d8511fe6018ecdead49784a5c658f95a2a6f2"},"schema_version":"1.0","source":{"id":"2202.10449","kind":"arxiv","version":1}},"canonical_sha256":"40ac5159a35845fed8a0d6d258ccc2f55df5927057af876c18f223d57d47501d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40ac5159a35845fed8a0d6d258ccc2f55df5927057af876c18f223d57d47501d","first_computed_at":"2026-07-05T03:59:04.550400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:59:04.550400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6vmlh1vTk1ZCuacir/VCDliUJE45Z+cHkvmY1bD0tbdr/YXsKcazVwpn82ljld2LyzA18UD9+AksEU8nNuPXAw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:59:04.550953Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.10449","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b20e26d7250a38093a13809ba3f79fc5f58bc89d43fb98ee13f454606c69d3d","sha256:349ec05ec87a8bd91388b12e5ca9bea193bd7e89608d268cbdefd7f229881168"],"state_sha256":"fd19dd609109124c59e93520f91c988bd3cc9fdcf92e67dece068fda682391b8"}