{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:REVGLUQOCADQY7MYAK2UGOQF6D","short_pith_number":"pith:REVGLUQO","canonical_record":{"source":{"id":"2402.01961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2024-02-02T23:59:02Z","cross_cats_sorted":[],"title_canon_sha256":"f8886748c2b332e82daf2abb798f0f26ce7361d4687b5c6fca107a060003b775","abstract_canon_sha256":"be1d0adb39a3650c501a7efdbfabb0e33ec128d6d348bb13d2d6fc28cdfd0816"},"schema_version":"1.0"},"canonical_sha256":"892a65d20e10070c7d9802b5433a05f0c001e40d174dcba10bf9c54c570f9fb1","source":{"kind":"arxiv","id":"2402.01961","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.01961","created_at":"2026-07-05T07:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"2402.01961v1","created_at":"2026-07-05T07:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.01961","created_at":"2026-07-05T07:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"REVGLUQOCADQ","created_at":"2026-07-05T07:41:08Z"},{"alias_kind":"pith_short_16","alias_value":"REVGLUQOCADQY7MY","created_at":"2026-07-05T07:41:08Z"},{"alias_kind":"pith_short_8","alias_value":"REVGLUQO","created_at":"2026-07-05T07:41:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:REVGLUQOCADQY7MYAK2UGOQF6D","target":"record","payload":{"canonical_record":{"source":{"id":"2402.01961","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2024-02-02T23:59:02Z","cross_cats_sorted":[],"title_canon_sha256":"f8886748c2b332e82daf2abb798f0f26ce7361d4687b5c6fca107a060003b775","abstract_canon_sha256":"be1d0adb39a3650c501a7efdbfabb0e33ec128d6d348bb13d2d6fc28cdfd0816"},"schema_version":"1.0"},"canonical_sha256":"892a65d20e10070c7d9802b5433a05f0c001e40d174dcba10bf9c54c570f9fb1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:41:08.857232Z","signature_b64":"F6ez1UaktphTwIcaMMmUjoWbaf5J6/g7qYIo6o+4/s6003IlX0dedbSo5iMO6VF7QeuSWyy3elyksfQKbr0DCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"892a65d20e10070c7d9802b5433a05f0c001e40d174dcba10bf9c54c570f9fb1","last_reissued_at":"2026-07-05T07:41:08.856657Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:41:08.856657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2402.01961","source_version":1,"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:41:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5XPL/ES8Tf02RvM3eyanrNScWDXGt1mfysEzd0d5WG7/igN/08MXwgsk2Nqp13IXpBkaUZq0SvDTpIFczLpJAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:55:39.781805Z"},"content_sha256":"d27180efe43bf24835a19bdddc470946ac1895e493327ca36cc108df490302c8","schema_version":"1.0","event_id":"sha256:d27180efe43bf24835a19bdddc470946ac1895e493327ca36cc108df490302c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:REVGLUQOCADQY7MYAK2UGOQF6D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Daniel Harabor, Dian-Lun Lin, Shao-Hung Chan, Sven Koenig, Thomy Phan, Tsung-Wei Huang, Yue Zhang, Zhe Chen","submitted_at":"2024-02-02T23:59:02Z","abstract_excerpt":"Multi-Agent Path Finding (MAPF) is the problem of finding a set of collision-free paths for multiple agents in a shared environment while minimizing the sum of travel time. Since solving the MAPF problem optimally is NP-hard, anytime algorithms based on Large Neighborhood Search (LNS) are promising to find good-quality solutions in a scalable way by iteratively destroying and repairing the paths. We propose Destroy-Repair Operation Parallelism for LNS (DROP-LNS), a parallel framework that performs multiple destroy and repair operations concurrently to explore more regions of the search space w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.01961","kind":"arxiv","version":1},"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/2402.01961/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:41:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tGFEm7hGfl7tr8hiLALrsExeIGVykJW5hfsbtRy2EJFLIHIGQLdqHiln4umMxD7GS2DPzQ51Tnl17PNAifTMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T17:55:39.782487Z"},"content_sha256":"9e0617b6d54b1d9729e820661fcfe527fedf325118fb17385726ae132440762d","schema_version":"1.0","event_id":"sha256:9e0617b6d54b1d9729e820661fcfe527fedf325118fb17385726ae132440762d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/REVGLUQOCADQY7MYAK2UGOQF6D/bundle.json","state_url":"https://pith.science/pith/REVGLUQOCADQY7MYAK2UGOQF6D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/REVGLUQOCADQY7MYAK2UGOQF6D/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:55:39Z","links":{"resolver":"https://pith.science/pith/REVGLUQOCADQY7MYAK2UGOQF6D","bundle":"https://pith.science/pith/REVGLUQOCADQY7MYAK2UGOQF6D/bundle.json","state":"https://pith.science/pith/REVGLUQOCADQY7MYAK2UGOQF6D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/REVGLUQOCADQY7MYAK2UGOQF6D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:REVGLUQOCADQY7MYAK2UGOQF6D","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":"be1d0adb39a3650c501a7efdbfabb0e33ec128d6d348bb13d2d6fc28cdfd0816","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2024-02-02T23:59:02Z","title_canon_sha256":"f8886748c2b332e82daf2abb798f0f26ce7361d4687b5c6fca107a060003b775"},"schema_version":"1.0","source":{"id":"2402.01961","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2402.01961","created_at":"2026-07-05T07:41:08Z"},{"alias_kind":"arxiv_version","alias_value":"2402.01961v1","created_at":"2026-07-05T07:41:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.01961","created_at":"2026-07-05T07:41:08Z"},{"alias_kind":"pith_short_12","alias_value":"REVGLUQOCADQ","created_at":"2026-07-05T07:41:08Z"},{"alias_kind":"pith_short_16","alias_value":"REVGLUQOCADQY7MY","created_at":"2026-07-05T07:41:08Z"},{"alias_kind":"pith_short_8","alias_value":"REVGLUQO","created_at":"2026-07-05T07:41:08Z"}],"graph_snapshots":[{"event_id":"sha256:9e0617b6d54b1d9729e820661fcfe527fedf325118fb17385726ae132440762d","target":"graph","created_at":"2026-07-05T07:41:08Z","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/2402.01961/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 a set of collision-free paths for multiple agents in a shared environment while minimizing the sum of travel time. Since solving the MAPF problem optimally is NP-hard, anytime algorithms based on Large Neighborhood Search (LNS) are promising to find good-quality solutions in a scalable way by iteratively destroying and repairing the paths. We propose Destroy-Repair Operation Parallelism for LNS (DROP-LNS), a parallel framework that performs multiple destroy and repair operations concurrently to explore more regions of the search space w","authors_text":"Daniel Harabor, Dian-Lun Lin, Shao-Hung Chan, Sven Koenig, Thomy Phan, Tsung-Wei Huang, Yue Zhang, Zhe Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2024-02-02T23:59:02Z","title":"Anytime Multi-Agent Path Finding using Operation Parallelism in Large Neighborhood Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.01961","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:d27180efe43bf24835a19bdddc470946ac1895e493327ca36cc108df490302c8","target":"record","created_at":"2026-07-05T07:41:08Z","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":"be1d0adb39a3650c501a7efdbfabb0e33ec128d6d348bb13d2d6fc28cdfd0816","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2024-02-02T23:59:02Z","title_canon_sha256":"f8886748c2b332e82daf2abb798f0f26ce7361d4687b5c6fca107a060003b775"},"schema_version":"1.0","source":{"id":"2402.01961","kind":"arxiv","version":1}},"canonical_sha256":"892a65d20e10070c7d9802b5433a05f0c001e40d174dcba10bf9c54c570f9fb1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"892a65d20e10070c7d9802b5433a05f0c001e40d174dcba10bf9c54c570f9fb1","first_computed_at":"2026-07-05T07:41:08.856657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:41:08.856657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F6ez1UaktphTwIcaMMmUjoWbaf5J6/g7qYIo6o+4/s6003IlX0dedbSo5iMO6VF7QeuSWyy3elyksfQKbr0DCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:41:08.857232Z","signed_message":"canonical_sha256_bytes"},"source_id":"2402.01961","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d27180efe43bf24835a19bdddc470946ac1895e493327ca36cc108df490302c8","sha256:9e0617b6d54b1d9729e820661fcfe527fedf325118fb17385726ae132440762d"],"state_sha256":"f059bb3d59f8e77f0ed959e8c86253b94886b44da7542a92a6698e09fcba521f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9rlPItHu6uLa34lQsgP7m1jJgD07mg3F2FAiWh0O8p/bCCJghEwlHGwWsv3mq5jT8WMmp05eh3lhMtjfQAR+AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T17:55:39.787518Z","bundle_sha256":"032d819dc95841f95706027d4cf12844f295453af09165dabd3e9f7e231db4c3"}}