{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:GTAWVK5VLFYLGDZ6D2PNL3NNA6","short_pith_number":"pith:GTAWVK5V","canonical_record":{"source":{"id":"2404.03554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2024-04-04T16:06:39Z","cross_cats_sorted":[],"title_canon_sha256":"d9dfac1f61bb1187ffd5ea77f9f7109658ea6ab4a20bf73db00a94d1906b4b9f","abstract_canon_sha256":"2ed03779a14dd296ec2cbd7c32007146e96a0675664cefde8ca44b2aacd13a68"},"schema_version":"1.0"},"canonical_sha256":"34c16aabb55970b30f3e1e9ed5edad07835753ef6bdd570aa57fc54525acfb3e","source":{"kind":"arxiv","id":"2404.03554","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.03554","created_at":"2026-07-05T08:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"2404.03554v1","created_at":"2026-07-05T08:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.03554","created_at":"2026-07-05T08:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"GTAWVK5VLFYL","created_at":"2026-07-05T08:04:27Z"},{"alias_kind":"pith_short_16","alias_value":"GTAWVK5VLFYLGDZ6","created_at":"2026-07-05T08:04:27Z"},{"alias_kind":"pith_short_8","alias_value":"GTAWVK5V","created_at":"2026-07-05T08:04:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:GTAWVK5VLFYLGDZ6D2PNL3NNA6","target":"record","payload":{"canonical_record":{"source":{"id":"2404.03554","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2024-04-04T16:06:39Z","cross_cats_sorted":[],"title_canon_sha256":"d9dfac1f61bb1187ffd5ea77f9f7109658ea6ab4a20bf73db00a94d1906b4b9f","abstract_canon_sha256":"2ed03779a14dd296ec2cbd7c32007146e96a0675664cefde8ca44b2aacd13a68"},"schema_version":"1.0"},"canonical_sha256":"34c16aabb55970b30f3e1e9ed5edad07835753ef6bdd570aa57fc54525acfb3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:04:27.408853Z","signature_b64":"qWs6CBHeAy0AxGL/FxywyhgPpjjXmR+7ct0BJFabEL4xabkPFSPS9jLxN4vVIxJF8CDEx0Co1VXHkCt+jD5VDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34c16aabb55970b30f3e1e9ed5edad07835753ef6bdd570aa57fc54525acfb3e","last_reissued_at":"2026-07-05T08:04:27.408459Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:04:27.408459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.03554","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-05T08:04:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bJtpnNgPFf4xsnxn2xXpKoyHl5ifTHROsGnozs5kCJusmfjB1+YzpQRynqrTKadBEG+DEAqlI53z61czPtLbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T08:05:23.863960Z"},"content_sha256":"bba133f10d1f6fbb4357b29aaade44c5b2737df4613ca30cab0ad05df4b9f471","schema_version":"1.0","event_id":"sha256:bba133f10d1f6fbb4357b29aaade44c5b2737df4613ca30cab0ad05df4b9f471"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:GTAWVK5VLFYLGDZ6D2PNL3NNA6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"No Panacea in Planning: Algorithm Selection for Suboptimal Multi-Agent Path Finding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.MA","authors_text":"Bistra Dilkina, Jiaoyang Li, Sven Koenig, Weizhe Chen, Zhihan Wang","submitted_at":"2024-04-04T16:06:39Z","abstract_excerpt":"Since more and more algorithms are proposed for multi-agent path finding (MAPF) and each of them has its strengths, choosing the correct one for a specific scenario that fulfills some specified requirements is an important task. Previous research in algorithm selection for MAPF built a standard workflow and showed that machine learning can help. In this paper, we study general solvers for MAPF, which further include suboptimal algorithms. We propose different groups of optimization objectives and learning tasks to handle the new tradeoff between runtime and solution quality. We conduct extensi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.03554","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/2404.03554/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-05T08:04:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fr1TandUii6awIN/V3aJ0CvEqi2m4rO9ri3+xEOXzEDm0bdAjw5+ScawCa/DhGH3NshaS4h3chU06VIkeko5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T08:05:23.864850Z"},"content_sha256":"4c7528765c41922b9cb5a2234573d5c4624d5becae61e4ec10b7e2f4e8d4e44f","schema_version":"1.0","event_id":"sha256:4c7528765c41922b9cb5a2234573d5c4624d5becae61e4ec10b7e2f4e8d4e44f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTAWVK5VLFYLGDZ6D2PNL3NNA6/bundle.json","state_url":"https://pith.science/pith/GTAWVK5VLFYLGDZ6D2PNL3NNA6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTAWVK5VLFYLGDZ6D2PNL3NNA6/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-10T08:05:23Z","links":{"resolver":"https://pith.science/pith/GTAWVK5VLFYLGDZ6D2PNL3NNA6","bundle":"https://pith.science/pith/GTAWVK5VLFYLGDZ6D2PNL3NNA6/bundle.json","state":"https://pith.science/pith/GTAWVK5VLFYLGDZ6D2PNL3NNA6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTAWVK5VLFYLGDZ6D2PNL3NNA6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:GTAWVK5VLFYLGDZ6D2PNL3NNA6","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":"2ed03779a14dd296ec2cbd7c32007146e96a0675664cefde8ca44b2aacd13a68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2024-04-04T16:06:39Z","title_canon_sha256":"d9dfac1f61bb1187ffd5ea77f9f7109658ea6ab4a20bf73db00a94d1906b4b9f"},"schema_version":"1.0","source":{"id":"2404.03554","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.03554","created_at":"2026-07-05T08:04:27Z"},{"alias_kind":"arxiv_version","alias_value":"2404.03554v1","created_at":"2026-07-05T08:04:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.03554","created_at":"2026-07-05T08:04:27Z"},{"alias_kind":"pith_short_12","alias_value":"GTAWVK5VLFYL","created_at":"2026-07-05T08:04:27Z"},{"alias_kind":"pith_short_16","alias_value":"GTAWVK5VLFYLGDZ6","created_at":"2026-07-05T08:04:27Z"},{"alias_kind":"pith_short_8","alias_value":"GTAWVK5V","created_at":"2026-07-05T08:04:27Z"}],"graph_snapshots":[{"event_id":"sha256:4c7528765c41922b9cb5a2234573d5c4624d5becae61e4ec10b7e2f4e8d4e44f","target":"graph","created_at":"2026-07-05T08:04:27Z","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/2404.03554/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Since more and more algorithms are proposed for multi-agent path finding (MAPF) and each of them has its strengths, choosing the correct one for a specific scenario that fulfills some specified requirements is an important task. Previous research in algorithm selection for MAPF built a standard workflow and showed that machine learning can help. In this paper, we study general solvers for MAPF, which further include suboptimal algorithms. We propose different groups of optimization objectives and learning tasks to handle the new tradeoff between runtime and solution quality. We conduct extensi","authors_text":"Bistra Dilkina, Jiaoyang Li, Sven Koenig, Weizhe Chen, Zhihan Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2024-04-04T16:06:39Z","title":"No Panacea in Planning: Algorithm Selection for Suboptimal Multi-Agent Path Finding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.03554","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:bba133f10d1f6fbb4357b29aaade44c5b2737df4613ca30cab0ad05df4b9f471","target":"record","created_at":"2026-07-05T08:04:27Z","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":"2ed03779a14dd296ec2cbd7c32007146e96a0675664cefde8ca44b2aacd13a68","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2024-04-04T16:06:39Z","title_canon_sha256":"d9dfac1f61bb1187ffd5ea77f9f7109658ea6ab4a20bf73db00a94d1906b4b9f"},"schema_version":"1.0","source":{"id":"2404.03554","kind":"arxiv","version":1}},"canonical_sha256":"34c16aabb55970b30f3e1e9ed5edad07835753ef6bdd570aa57fc54525acfb3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34c16aabb55970b30f3e1e9ed5edad07835753ef6bdd570aa57fc54525acfb3e","first_computed_at":"2026-07-05T08:04:27.408459Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:04:27.408459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qWs6CBHeAy0AxGL/FxywyhgPpjjXmR+7ct0BJFabEL4xabkPFSPS9jLxN4vVIxJF8CDEx0Co1VXHkCt+jD5VDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:04:27.408853Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.03554","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bba133f10d1f6fbb4357b29aaade44c5b2737df4613ca30cab0ad05df4b9f471","sha256:4c7528765c41922b9cb5a2234573d5c4624d5becae61e4ec10b7e2f4e8d4e44f"],"state_sha256":"4ab3d10a87921a35cee2a8abf16136173e3781e0cb4e7035bfc9f13d4757b020"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l/0450dzMRkssNGTywKto57RNg3hio4KIVS609HbB5xWc2IFBlXV2KHas8wW1HRq8e/CyqM3lsn0q1gDJPgPDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T08:05:23.882775Z","bundle_sha256":"71412a3c7ae359b9ccdcf230733d7950f26dfac4ad44aaf7956e5fd0367c50b5"}}