{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YR76L7E4FETHLVK7KPCEC3XXVK","short_pith_number":"pith:YR76L7E4","schema_version":"1.0","canonical_sha256":"c47fe5fc9c292675d55f53c4416ef7aa8edca5a214ee0471b68d310117e02e15","source":{"kind":"arxiv","id":"2607.00156","version":1},"attestation_state":"computed","paper":{"title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Gioele Zardini, Jiarui Li, Meshal Alharbi, Willem van Osselaer","submitted_at":"2026-06-30T20:31:23Z","abstract_excerpt":"Conflict-Based Search (CBS) is a leading exact algorithm for Multi-Agent Path Finding (MAPF), but its high-level node-selection rule is usually treated as a fixed implementation detail. Standard best-first selection is strong for minimizing expanded nodes and closing the optimality certificate, yet it can maintain a large frontier, interrupt parent-child expansion sequences, and provide no feasible incumbent until termination. This paper studies node selection as a first-class design choice for exact CBS. We introduce Dual-Informed Vertical Expansion (DIVE), a policy that is best-bound between"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.00156","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2026-06-30T20:31:23Z","cross_cats_sorted":[],"title_canon_sha256":"91c5296c6747a12d9fa4ed51817a3d2e093f2af002c9af33f655569a9b70dce5","abstract_canon_sha256":"8337203fdc4c0a4009351dadc94d4d8feaf664237732dd4b035c7b4ab74e3031"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-02T00:18:36.940777Z","signature_b64":"leG/PWgZtOlpXthKuY+2Sy9f23n0ra06EZhONb+3q74b/HR54t2Qf+rGScEjeZfxYaNZ74muZjdDKwISOT9MAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c47fe5fc9c292675d55f53c4416ef7aa8edca5a214ee0471b68d310117e02e15","last_reissued_at":"2026-07-02T00:18:36.940269Z","signature_status":"signed_v1","first_computed_at":"2026-07-02T00:18:36.940269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Gioele Zardini, Jiarui Li, Meshal Alharbi, Willem van Osselaer","submitted_at":"2026-06-30T20:31:23Z","abstract_excerpt":"Conflict-Based Search (CBS) is a leading exact algorithm for Multi-Agent Path Finding (MAPF), but its high-level node-selection rule is usually treated as a fixed implementation detail. Standard best-first selection is strong for minimizing expanded nodes and closing the optimality certificate, yet it can maintain a large frontier, interrupt parent-child expansion sequences, and provide no feasible incumbent until termination. This paper studies node selection as a first-class design choice for exact CBS. We introduce Dual-Informed Vertical Expansion (DIVE), a policy that is best-bound between"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.00156","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/2607.00156/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.00156","created_at":"2026-07-02T00:18:36.940353+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.00156v1","created_at":"2026-07-02T00:18:36.940353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.00156","created_at":"2026-07-02T00:18:36.940353+00:00"},{"alias_kind":"pith_short_12","alias_value":"YR76L7E4FETH","created_at":"2026-07-02T00:18:36.940353+00:00"},{"alias_kind":"pith_short_16","alias_value":"YR76L7E4FETHLVK7","created_at":"2026-07-02T00:18:36.940353+00:00"},{"alias_kind":"pith_short_8","alias_value":"YR76L7E4","created_at":"2026-07-02T00:18:36.940353+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YR76L7E4FETHLVK7KPCEC3XXVK","json":"https://pith.science/pith/YR76L7E4FETHLVK7KPCEC3XXVK.json","graph_json":"https://pith.science/api/pith-number/YR76L7E4FETHLVK7KPCEC3XXVK/graph.json","events_json":"https://pith.science/api/pith-number/YR76L7E4FETHLVK7KPCEC3XXVK/events.json","paper":"https://pith.science/paper/YR76L7E4"},"agent_actions":{"view_html":"https://pith.science/pith/YR76L7E4FETHLVK7KPCEC3XXVK","download_json":"https://pith.science/pith/YR76L7E4FETHLVK7KPCEC3XXVK.json","view_paper":"https://pith.science/paper/YR76L7E4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.00156&json=true","fetch_graph":"https://pith.science/api/pith-number/YR76L7E4FETHLVK7KPCEC3XXVK/graph.json","fetch_events":"https://pith.science/api/pith-number/YR76L7E4FETHLVK7KPCEC3XXVK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YR76L7E4FETHLVK7KPCEC3XXVK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YR76L7E4FETHLVK7KPCEC3XXVK/action/storage_attestation","attest_author":"https://pith.science/pith/YR76L7E4FETHLVK7KPCEC3XXVK/action/author_attestation","sign_citation":"https://pith.science/pith/YR76L7E4FETHLVK7KPCEC3XXVK/action/citation_signature","submit_replication":"https://pith.science/pith/YR76L7E4FETHLVK7KPCEC3XXVK/action/replication_record"}},"created_at":"2026-07-02T00:18:36.940353+00:00","updated_at":"2026-07-02T00:18:36.940353+00:00"}