{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:JBUWLXVRHZNZ23GMX3IRUX6PA5","short_pith_number":"pith:JBUWLXVR","canonical_record":{"source":{"id":"2408.02960","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-08-06T05:15:35Z","cross_cats_sorted":[],"title_canon_sha256":"8fd5e867f6b379765524523852093e48947925fc6eeab3c4246482550b56499d","abstract_canon_sha256":"61c5d6649c98d410a81a3e53fef2b5ebd3f850ab06c9550585af7aa67f5e7ab0"},"schema_version":"1.0"},"canonical_sha256":"486965deb13e5b9d6cccbed11a5fcf076812b6f8ed981b865f31cf7e39ee71ee","source":{"kind":"arxiv","id":"2408.02960","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.02960","created_at":"2026-07-05T09:50:32Z"},{"alias_kind":"arxiv_version","alias_value":"2408.02960v2","created_at":"2026-07-05T09:50:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.02960","created_at":"2026-07-05T09:50:32Z"},{"alias_kind":"pith_short_12","alias_value":"JBUWLXVRHZNZ","created_at":"2026-07-05T09:50:32Z"},{"alias_kind":"pith_short_16","alias_value":"JBUWLXVRHZNZ23GM","created_at":"2026-07-05T09:50:32Z"},{"alias_kind":"pith_short_8","alias_value":"JBUWLXVR","created_at":"2026-07-05T09:50:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:JBUWLXVRHZNZ23GMX3IRUX6PA5","target":"record","payload":{"canonical_record":{"source":{"id":"2408.02960","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-08-06T05:15:35Z","cross_cats_sorted":[],"title_canon_sha256":"8fd5e867f6b379765524523852093e48947925fc6eeab3c4246482550b56499d","abstract_canon_sha256":"61c5d6649c98d410a81a3e53fef2b5ebd3f850ab06c9550585af7aa67f5e7ab0"},"schema_version":"1.0"},"canonical_sha256":"486965deb13e5b9d6cccbed11a5fcf076812b6f8ed981b865f31cf7e39ee71ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:32.393954Z","signature_b64":"yDdkrIA4nNvGp54/kFwMJZ6cup9SQ1XKWq+09Qs4SxnAdvof0gqtUobXjjfrAjQsrGPU82ldVlmXHt/Sce9RBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"486965deb13e5b9d6cccbed11a5fcf076812b6f8ed981b865f31cf7e39ee71ee","last_reissued_at":"2026-07-05T09:50:32.393448Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:32.393448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.02960","source_version":2,"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-05T09:50:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sfp/jYn6SYIKRqsz3HuNHhC/rJGvFpfmqkue0Znx1RORCBhVLvJgXj8qGDALJLZq5Q01pJGompsp8MIjnGeNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:51:50.532415Z"},"content_sha256":"d1eeaf623e06ab117f08715dd862f8dae5cc3c605d2a4fc94226bfca6fc94dde","schema_version":"1.0","event_id":"sha256:d1eeaf623e06ab117f08715dd862f8dae5cc3c605d2a4fc94226bfca6fc94dde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:JBUWLXVRHZNZ23GMX3IRUX6PA5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Benran Zhang, Shao-Hung Chan, Sven Koenig, Thomy Phan","submitted_at":"2024-08-06T05:15:35Z","abstract_excerpt":"Anytime multi-agent path finding (MAPF) is a promising approach to scalable path optimization in multi-agent systems. MAPF-LNS, based on Large Neighborhood Search (LNS), is the current state-of-the-art approach where a fast initial solution is iteratively optimized by destroying and repairing selected paths of the solution. Current MAPF-LNS variants commonly use an adaptive selection mechanism to choose among multiple destroy heuristics. However, to determine promising destroy heuristics, MAPF-LNS requires a considerable amount of exploration time. As common destroy heuristics are non-adaptive"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.02960","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/2408.02960/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-05T09:50:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oj/rtezVM7Hpy55ztKZIEbvQ9dDi5X5Y6VmMOnwTZaZDs6bWDn8cmAmOzHbMG92PrMSTdZhB2LGLi9Xb0UugDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:51:50.532913Z"},"content_sha256":"367f76630a276d57100fa167c9d1d36adbb230e1de1da4dbc638e7ffea5459fe","schema_version":"1.0","event_id":"sha256:367f76630a276d57100fa167c9d1d36adbb230e1de1da4dbc638e7ffea5459fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JBUWLXVRHZNZ23GMX3IRUX6PA5/bundle.json","state_url":"https://pith.science/pith/JBUWLXVRHZNZ23GMX3IRUX6PA5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JBUWLXVRHZNZ23GMX3IRUX6PA5/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-03T17:51:50Z","links":{"resolver":"https://pith.science/pith/JBUWLXVRHZNZ23GMX3IRUX6PA5","bundle":"https://pith.science/pith/JBUWLXVRHZNZ23GMX3IRUX6PA5/bundle.json","state":"https://pith.science/pith/JBUWLXVRHZNZ23GMX3IRUX6PA5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JBUWLXVRHZNZ23GMX3IRUX6PA5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:JBUWLXVRHZNZ23GMX3IRUX6PA5","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":"61c5d6649c98d410a81a3e53fef2b5ebd3f850ab06c9550585af7aa67f5e7ab0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-08-06T05:15:35Z","title_canon_sha256":"8fd5e867f6b379765524523852093e48947925fc6eeab3c4246482550b56499d"},"schema_version":"1.0","source":{"id":"2408.02960","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.02960","created_at":"2026-07-05T09:50:32Z"},{"alias_kind":"arxiv_version","alias_value":"2408.02960v2","created_at":"2026-07-05T09:50:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.02960","created_at":"2026-07-05T09:50:32Z"},{"alias_kind":"pith_short_12","alias_value":"JBUWLXVRHZNZ","created_at":"2026-07-05T09:50:32Z"},{"alias_kind":"pith_short_16","alias_value":"JBUWLXVRHZNZ23GM","created_at":"2026-07-05T09:50:32Z"},{"alias_kind":"pith_short_8","alias_value":"JBUWLXVR","created_at":"2026-07-05T09:50:32Z"}],"graph_snapshots":[{"event_id":"sha256:367f76630a276d57100fa167c9d1d36adbb230e1de1da4dbc638e7ffea5459fe","target":"graph","created_at":"2026-07-05T09:50:32Z","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/2408.02960/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Anytime multi-agent path finding (MAPF) is a promising approach to scalable path optimization in multi-agent systems. MAPF-LNS, based on Large Neighborhood Search (LNS), is the current state-of-the-art approach where a fast initial solution is iteratively optimized by destroying and repairing selected paths of the solution. Current MAPF-LNS variants commonly use an adaptive selection mechanism to choose among multiple destroy heuristics. However, to determine promising destroy heuristics, MAPF-LNS requires a considerable amount of exploration time. As common destroy heuristics are non-adaptive","authors_text":"Benran Zhang, Shao-Hung Chan, Sven Koenig, Thomy Phan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-08-06T05:15:35Z","title":"Anytime Multi-Agent Path Finding with an Adaptive Delay-Based Heuristic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.02960","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:d1eeaf623e06ab117f08715dd862f8dae5cc3c605d2a4fc94226bfca6fc94dde","target":"record","created_at":"2026-07-05T09:50:32Z","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":"61c5d6649c98d410a81a3e53fef2b5ebd3f850ab06c9550585af7aa67f5e7ab0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-08-06T05:15:35Z","title_canon_sha256":"8fd5e867f6b379765524523852093e48947925fc6eeab3c4246482550b56499d"},"schema_version":"1.0","source":{"id":"2408.02960","kind":"arxiv","version":2}},"canonical_sha256":"486965deb13e5b9d6cccbed11a5fcf076812b6f8ed981b865f31cf7e39ee71ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"486965deb13e5b9d6cccbed11a5fcf076812b6f8ed981b865f31cf7e39ee71ee","first_computed_at":"2026-07-05T09:50:32.393448Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:50:32.393448Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yDdkrIA4nNvGp54/kFwMJZ6cup9SQ1XKWq+09Qs4SxnAdvof0gqtUobXjjfrAjQsrGPU82ldVlmXHt/Sce9RBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:50:32.393954Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.02960","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d1eeaf623e06ab117f08715dd862f8dae5cc3c605d2a4fc94226bfca6fc94dde","sha256:367f76630a276d57100fa167c9d1d36adbb230e1de1da4dbc638e7ffea5459fe"],"state_sha256":"1eaa1112213520f5937695b5f6d4853b22cce1322ce9ac9fcdbb5a748544681e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0QxMKgH87yVMSmnFoe5ifEWVPF1SEwzoBq16mzVFTeOyZDawoAeqqDto7OCZ1sCfHeXJwWhAmRfCoi0XgE7pCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:51:50.536927Z","bundle_sha256":"d0939e9095528291e883ef2cd9811f4b83fdbe7e9c7db41bc3764b370997357c"}}