{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:4YCQLC47BGBJPCDL7KXPIZDMIW","short_pith_number":"pith:4YCQLC47","canonical_record":{"source":{"id":"2308.11234","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2023-08-22T07:17:39Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"1599ff314e3b1f7f769801a16f356b5904026bab41d668009af82a468929737d","abstract_canon_sha256":"c8784408e9fc191f92c29004d9777e99cccf581b26fa8742fefd846e3db2ac56"},"schema_version":"1.0"},"canonical_sha256":"e605058b9f098297886bfaaef4646c45a7cc8e7e50f4dceb26c98c1f638cc223","source":{"kind":"arxiv","id":"2308.11234","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.11234","created_at":"2026-07-05T07:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"2308.11234v5","created_at":"2026-07-05T07:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.11234","created_at":"2026-07-05T07:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"4YCQLC47BGBJ","created_at":"2026-07-05T07:39:29Z"},{"alias_kind":"pith_short_16","alias_value":"4YCQLC47BGBJPCDL","created_at":"2026-07-05T07:39:29Z"},{"alias_kind":"pith_short_8","alias_value":"4YCQLC47","created_at":"2026-07-05T07:39:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:4YCQLC47BGBJPCDL7KXPIZDMIW","target":"record","payload":{"canonical_record":{"source":{"id":"2308.11234","kind":"arxiv","version":5},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2023-08-22T07:17:39Z","cross_cats_sorted":["cs.MA","cs.RO"],"title_canon_sha256":"1599ff314e3b1f7f769801a16f356b5904026bab41d668009af82a468929737d","abstract_canon_sha256":"c8784408e9fc191f92c29004d9777e99cccf581b26fa8742fefd846e3db2ac56"},"schema_version":"1.0"},"canonical_sha256":"e605058b9f098297886bfaaef4646c45a7cc8e7e50f4dceb26c98c1f638cc223","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:39:29.526761Z","signature_b64":"ZVR/tp1FhGMXO88yPg975DxYvrcybSLzLFnAmOZf4fppjjseokQRAIQob96tXC3hxCM3eKTdFfFwFCD6ZlbvBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e605058b9f098297886bfaaef4646c45a7cc8e7e50f4dceb26c98c1f638cc223","last_reissued_at":"2026-07-05T07:39:29.526301Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:39:29.526301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.11234","source_version":5,"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-07-05T07:39:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A8avgdyN5Kpk2a4GZhC9kas+4Wz9XHeDIehmhS3hlV7ZRNh3s0AAmmi1GdcRBSzA4wPjiWURsO6uhGo9zCQtAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T10:30:45.219338Z"},"content_sha256":"055ee9d3875616fd0a16fc8a3af938553c361fffd953b5238c9c4927e13fe17e","schema_version":"1.0","event_id":"sha256:055ee9d3875616fd0a16fc8a3af938553c361fffd953b5238c9c4927e13fe17e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:4YCQLC47BGBJPCDL7KXPIZDMIW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.MA","cs.RO"],"primary_cat":"cs.AI","authors_text":"Daniel Harabor, Jiaoyang Li, Peter J. Stuckey, Zhe Chen","submitted_at":"2023-08-22T07:17:39Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics that asks us to compute collision-free paths for a team of agents, all moving across a shared map. Although many works appear on this topic, all current algorithms struggle as the number of agents grows. The principal reason is that existing approaches typically plan free-flow optimal paths, which creates congestion. To tackle this issue, we propose a new approach for MAPF where agents are guided to their destination by following congestion-avoiding paths. We evaluate the idea in two large-scale settings: one-shot MAPF, where"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.11234","kind":"arxiv","version":5},"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/2308.11234/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":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:39:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kRWCeruunWR24hfDBGiA0I3SKsSZbK1+KAZbk8t2/JkJtbh9VYZsnFXjXmi/QoBiJx+iBpwNll/v+xysvz0wAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T10:30:45.219849Z"},"content_sha256":"380729f8b6ed2b17d5cf07e4965d695ba2f8c062420d259010047547e8d46309","schema_version":"1.0","event_id":"sha256:380729f8b6ed2b17d5cf07e4965d695ba2f8c062420d259010047547e8d46309"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4YCQLC47BGBJPCDL7KXPIZDMIW/bundle.json","state_url":"https://pith.science/pith/4YCQLC47BGBJPCDL7KXPIZDMIW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4YCQLC47BGBJPCDL7KXPIZDMIW/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-08-06T10:30:45Z","links":{"resolver":"https://pith.science/pith/4YCQLC47BGBJPCDL7KXPIZDMIW","bundle":"https://pith.science/pith/4YCQLC47BGBJPCDL7KXPIZDMIW/bundle.json","state":"https://pith.science/pith/4YCQLC47BGBJPCDL7KXPIZDMIW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4YCQLC47BGBJPCDL7KXPIZDMIW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:4YCQLC47BGBJPCDL7KXPIZDMIW","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":"c8784408e9fc191f92c29004d9777e99cccf581b26fa8742fefd846e3db2ac56","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2023-08-22T07:17:39Z","title_canon_sha256":"1599ff314e3b1f7f769801a16f356b5904026bab41d668009af82a468929737d"},"schema_version":"1.0","source":{"id":"2308.11234","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.11234","created_at":"2026-07-05T07:39:29Z"},{"alias_kind":"arxiv_version","alias_value":"2308.11234v5","created_at":"2026-07-05T07:39:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.11234","created_at":"2026-07-05T07:39:29Z"},{"alias_kind":"pith_short_12","alias_value":"4YCQLC47BGBJ","created_at":"2026-07-05T07:39:29Z"},{"alias_kind":"pith_short_16","alias_value":"4YCQLC47BGBJPCDL","created_at":"2026-07-05T07:39:29Z"},{"alias_kind":"pith_short_8","alias_value":"4YCQLC47","created_at":"2026-07-05T07:39:29Z"}],"graph_snapshots":[{"event_id":"sha256:380729f8b6ed2b17d5cf07e4965d695ba2f8c062420d259010047547e8d46309","target":"graph","created_at":"2026-07-05T07:39:29Z","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/2308.11234/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics that asks us to compute collision-free paths for a team of agents, all moving across a shared map. Although many works appear on this topic, all current algorithms struggle as the number of agents grows. The principal reason is that existing approaches typically plan free-flow optimal paths, which creates congestion. To tackle this issue, we propose a new approach for MAPF where agents are guided to their destination by following congestion-avoiding paths. We evaluate the idea in two large-scale settings: one-shot MAPF, where","authors_text":"Daniel Harabor, Jiaoyang Li, Peter J. Stuckey, Zhe Chen","cross_cats":["cs.MA","cs.RO"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2023-08-22T07:17:39Z","title":"Traffic Flow Optimisation for Lifelong Multi-Agent Path Finding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.11234","kind":"arxiv","version":5},"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:055ee9d3875616fd0a16fc8a3af938553c361fffd953b5238c9c4927e13fe17e","target":"record","created_at":"2026-07-05T07:39:29Z","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":"c8784408e9fc191f92c29004d9777e99cccf581b26fa8742fefd846e3db2ac56","cross_cats_sorted":["cs.MA","cs.RO"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2023-08-22T07:17:39Z","title_canon_sha256":"1599ff314e3b1f7f769801a16f356b5904026bab41d668009af82a468929737d"},"schema_version":"1.0","source":{"id":"2308.11234","kind":"arxiv","version":5}},"canonical_sha256":"e605058b9f098297886bfaaef4646c45a7cc8e7e50f4dceb26c98c1f638cc223","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e605058b9f098297886bfaaef4646c45a7cc8e7e50f4dceb26c98c1f638cc223","first_computed_at":"2026-07-05T07:39:29.526301Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:39:29.526301Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZVR/tp1FhGMXO88yPg975DxYvrcybSLzLFnAmOZf4fppjjseokQRAIQob96tXC3hxCM3eKTdFfFwFCD6ZlbvBw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:39:29.526761Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.11234","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:055ee9d3875616fd0a16fc8a3af938553c361fffd953b5238c9c4927e13fe17e","sha256:380729f8b6ed2b17d5cf07e4965d695ba2f8c062420d259010047547e8d46309"],"state_sha256":"4a66ed7a2dd4be3a6a59fc4f2abd5e4ddfa6faa23d5a0951c4c5d62e5f3c98d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eDFAui0u8COc3lqP1YzKm54hR41s8VCkcGZ4avUsGFxeO92Mo4NWGZPQjhOVQi56ZUU9N8qR/JkAxNMRVDj8Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T10:30:45.225005Z","bundle_sha256":"ce0be4309b2759ee10c9a3d51a2fe5fb649cea61c9b703ff43c92b8e144f93cf"}}