{"as_of":"2026-08-09T19:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bdaa43eb6ba71bed16690b20088c82baada0101c316f9b39dd26131b3c9ba491","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-02T18:46:43.417975Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.00156/citation-record","integrity":"/paper/2607.00156/integrity","json":"/paper/2607.00156/citation-record.json","paper":"/paper/2607.00156"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.171582Z","title":"Multi-agent pathfinding: Definitions, variants, and benchmarks,","venue":null,"work_id":"2affa911-ff03-4c6a-91b0-411b4abae6e4","year":2019},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:fbe4822b1bb4002be172de176e5431fc02be148d141927de240d89de911b346b","observation_id":"a4289d2c-4b57-4368-affa-5dd61da40afc","resolution":{"observed_at":"2026-07-05T21:41:30.176018Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.166551Z","title":"Planning, scheduling and monitoring for airport surface operations,","venue":null,"work_id":"0c1a121a-6096-492c-acde-2bc65c2704e5","year":2016},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:debbc982cd7e25efc7e069f2132279fcbdbe19f12bc0e091cf50903f1020bd05","observation_id":"7085dbe5-7eeb-4684-897d-e101d2902321","resolution":{"observed_at":"2026-07-05T21:41:30.169036Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.193256Z","title":"Structure and intractability of optimal multi- robot path planning on graphs,","venue":null,"work_id":"98468c00-cac5-4a2b-a5af-c8ceb093199a","year":2013},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:9c41d3e839683475324b0897828274b12783d0a36a73b7520c0596aac84b8473","observation_id":"87eb5ded-8945-43cb-817d-49f650fe274e","resolution":{"observed_at":"2026-07-05T21:41:30.194423Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T13:16:15.978919Z","title":"Conflict-based search for optimal multi-agent pathfinding","venue":null,"work_id":"cd08fe21-42bb-42b0-8e31-adb3565ba418","year":2015},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:9eeb172dfdfe08cacdff4bd3397bbd97273e01c716243f2b354b820f581a9235","observation_id":"4e89e00f-6b61-49fb-b711-730ea1db6482","resolution":{"observed_at":"2026-07-05T21:41:30.171028Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.179031Z","title":"Iterative-deepening conflict-based search,","venue":null,"work_id":"28276292-718f-4aa1-b6ee-65e5c1d00f73","year":2020},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:18b2238b6a0ef9d5f0f09584c4d86e51f42d9b137e57be3e6bc3e5752273837e","observation_id":"c3ab7eea-8be5-42a9-a62f-7472fa11bb72","resolution":{"observed_at":"2026-07-05T21:41:30.180288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.201731Z","title":"Adding heuristics to conflict-based search for multi- agent path finding,","venue":null,"work_id":"405614da-30ed-486b-a5b4-1c83dbe41e75","year":2018},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:f07bb992470d4c6afe23b5547e0651ca277d153356cc44452b4f050cbbeb4a57","observation_id":"522d2150-29c4-45af-b255-d36750501d31","resolution":{"observed_at":"2026-07-05T21:41:30.202938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.204411Z","title":"Improved heuristics for multi-agent path finding with conflict-based search,","venue":null,"work_id":"85577156-925e-4a04-8ce0-487f9aa12d58","year":2019},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:8aac191bb3af14d9e0214be84dee724201b83863822a6b45795be0209e6a8689","observation_id":"c363a1f6-0517-4391-9bd5-6ee1888c7e0f","resolution":{"observed_at":"2026-07-05T21:41:30.205887Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.206482Z","title":"Optimal sequential task assignment and path finding for multi-agent robotic assembly planning,","venue":null,"work_id":"9fcbc3fe-bc68-4033-8289-e61182114ade","year":2020},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:53eadd865bf2b2dbcb30add0bfb651f0735132fd325b2bb8d1627b8ef4611233","observation_id":"56dc422b-291c-4f0b-87a7-b9f59db3b7d5","resolution":{"observed_at":"2026-07-05T21:41:30.207699Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.214956Z","title":"Grand: Guidance, rebalancing, and assignment for networked dispatch in multi-agent path finding,","venue":null,"work_id":"a42d3afa-83d2-4455-9b65-b1c91daff13e","year":2026},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:3bf9b9abcdb4930ffddb7ed2b1527b3719ed61a453f8617f64e549d5ca1ea90f","observation_id":"9b623d42-0357-4fdc-aea8-ae396c8a6a69","resolution":{"observed_at":"2026-07-05T21:41:30.216446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2511.13961","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T18:47:16.867485Z","title":"Fico: Finite- horizon closed-loop factorization for unified multi-agent path finding,","venue":null,"work_id":"06a02ae2-fe25-4fc4-a429-dda39453d75d","year":2025},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:5cb4c875a5ff5ab7210234ca5f79fb8d4689cdab1346864df762efccdcce985b","observation_id":"6f995a47-86e4-412a-8e9b-3aa5edcb9ef2","resolution":{"observed_at":"2026-07-02T18:47:16.868904Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.199935Z","title":"Icbs: The improved conflict-based search algorithm for multi-agent pathfinding,","venue":null,"work_id":"7fb904cb-ed5c-4e36-8d0c-c5d86510b0c0","year":2015},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:c93b458ebe6d2e5a1c26a5caf05952467f97e52359f93f0c935d606786b73eea","observation_id":"f747ed00-75a0-4e55-8976-d5325fd7851e","resolution":{"observed_at":"2026-07-05T21:41:30.201102Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.197389Z","title":"Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding prob- lem,","venue":null,"work_id":"0e8d28e6-0592-4fef-b5a3-46c191ba34c1","year":2014},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:ea0f9de7f923bde3391e3af214c78eb9ce47032682395e57827e57f26292eff3","observation_id":"90550109-7f14-4ffd-8525-1cea180fd123","resolution":{"observed_at":"2026-07-05T21:41:30.199393Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.194941Z","title":"Eecbs: A bounded-suboptimal search for multi-agent path finding,","venue":null,"work_id":"5ca0296a-73d4-440b-ba8b-ffcc62986106","year":2021},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:5845330c2bceed04c95a8b01da9ee8c5e59158a48f58dde69e99075a2f7ca43e","observation_id":"d5ed2666-9bdb-4005-b8dc-0b67a4049002","resolution":{"observed_at":"2026-07-05T21:41:30.196814Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-09T17:34:57.483409Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"cited_work":{"arxiv_id":"2602.12024","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.12024","snapshot_observed_at":"2026-07-02T18:47:16.862926Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","venue":"cs.RO","work_id":"bb5981ac-724e-4530-8f45-9f9f8a34d0a1","year":2026},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"cited_paper":"/paper/2602.12024","citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:cded8002d6d0a681b993bf4c46db09ff2cc2ee848503658b4e47aed2679b78df","observation_id":"64752cb5-d76e-42ef-bc93-b79410a3fd49","resolution":{"observed_at":"2026-07-02T18:47:16.864147Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2604.00428","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-02T18:47:16.860012Z","title":"Certificate-driven closed-loop multi-agent path finding with inheritable factorization,","venue":null,"work_id":"2ca8289c-0eb2-451f-adce-c6bbd616a2b6","year":2026},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:1f7ce05bb69d3b365aa08c047f3924a2353eabef77c0edb83cc651132c05cddd","observation_id":"b8af26d8-0f7e-4e2e-b80e-0adf1892d66c","resolution":{"observed_at":"2026-07-02T18:47:16.861774Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.187526Z","title":"Multi-agent path finding in configurable environments,","venue":null,"work_id":"c0a6fdba-703e-42f2-8298-40ba60528543","year":2020},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:80521aba25163cf09314e992268c0857160a0b607b1676c1314662e289e10094","observation_id":"36f0fbb7-403d-4576-a932-b4838c8ca2eb","resolution":{"observed_at":"2026-07-05T21:41:30.189112Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2605.16097","last_updated":"2026-05-15T15:52:52Z","snapshot_observed_at":"2026-08-01T22:36:08.175579Z","submitted_at":"2026-05-15T15:52:52Z","title":"Multi-Agent Cooperative Transportation: Optimal and Efficient Task Allocation and Path Finding","version":1},"cited_work":{"arxiv_id":"2605.16097","doi":null,"metadata_source":"pith","pith_arxiv_id":"2605.16097","snapshot_observed_at":"2026-07-02T18:47:16.865269Z","title":"Multi-Agent Cooperative Transportation: Optimal and Efficient Task Allocation and Path Finding","venue":"cs.MA","work_id":"a8fd98c0-f984-4222-a154-54d27768aed0","year":2026},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"cited_paper":"/paper/2605.16097","citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:40ab6f417d994291c27feb610813db6bb94b4f007a8a900a0a54d51c53a4ff12","observation_id":"86a4c298-a391-431d-80c1-f90fe4dd15f9","resolution":{"observed_at":"2026-07-02T18:47:16.866434Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.182972Z","title":"Learning node-selection strate- gies in bounded-suboptimal conflict-based search for multi-agent path finding,","venue":null,"work_id":"fd7b13b6-d115-4b6d-ad53-f2fcb77b3a66","year":2021},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:44b476e85bbb79e25a0dc57b25ee8b8c206b138a3a85597028e844c5ae12f032","observation_id":"c12d0dff-daf2-4172-9025-46798e400756","resolution":{"observed_at":"2026-07-05T21:41:30.184229Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-06T02:51:52.794764Z","title":"Priority inheri- tance with backtracking for iterative multi-agent path finding","venue":null,"work_id":"b0e88635-00e4-4c10-832c-aa46cbe0d64a","year":2022},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:d791e54d3708f0242a20dccb558ae121d0f4fe7749b9b84a9acde87bdecd1e2d","observation_id":"3388ad20-4ce0-46a4-8007-60c13109e00f","resolution":{"observed_at":"2026-07-05T21:41:30.165986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.184801Z","title":"Branch-and-bound methods: A survey,","venue":null,"work_id":"2b694387-0e4f-4397-bcf8-bd220198c299","year":1966},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:77f737831f6247d9f9bed4f23ffee6f8124a6cac4da56e1d5a967c8d0d8528ce","observation_id":"443ea3af-7320-4ebc-bc9a-19fb8c157377","resolution":{"observed_at":"2026-07-05T21:41:30.186925Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.162871Z","title":"Constraint integer programming,","venue":null,"work_id":"ed1cd985-4350-4b8a-91c1-04510b6bfef0","year":2007},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:ac40f257f17f749840acda5897e101db23c8285cf29e7867c8dfe95b57cf0557","observation_id":"3781a69b-f0e7-4ff9-9b8f-3dbd901effb1","resolution":{"observed_at":"2026-07-05T21:41:30.163956Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.180902Z","title":"Parameter guidelines,","venue":null,"work_id":"325d201a-d3e9-45fe-ab33-47bca66696c8","year":2026},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:02be8d101a18ce9ec25f8e1a5f98b444dae60d21e65ee8f48caa7a98c0eb1952","observation_id":"b6930efd-3399-4b16-8f42-0524b6cfb54f","resolution":{"observed_at":"2026-07-05T21:41:30.182016Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.177214Z","title":"Mip emphasis switch,","venue":null,"work_id":"be290149-e908-4c16-814f-f7e9b5b3304d","year":2026},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:ac39a3a0e6c5ca66f61b1159304c12cba51e00d1e68e2efc499e11845c706130","observation_id":"9f284415-d4fb-4167-b64d-1ae49f1a770c","resolution":{"observed_at":"2026-07-05T21:41:30.178479Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.212201Z","title":"Anytime hybrid best-first search with tree decomposition for weighted csp,","venue":null,"work_id":"7b771bda-1414-4a86-9a80-b4f1cb6b5776","year":2015},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:00931931449bf5077ec782975b54c3bc47233f932f5426d9f79f1ad926ed2b42","observation_id":"cc86c00e-3b18-4a5b-8ab5-d2ba25cd3ab3","resolution":{"observed_at":"2026-07-05T21:41:30.214391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.208586Z","title":"Learning to search in branch and bound algorithms,","venue":null,"work_id":"c10de07f-690e-4bfe-b271-8ccc92bf067b","year":2014},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:75e89d8e6da8713028837ca8644b97c4e938e01912f96d01a53bd7d3973552bd","observation_id":"b271a156-1512-443a-aa6a-82f84bf9dc1c","resolution":{"observed_at":"2026-07-05T21:41:30.209838Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.191587Z","title":"Reinforcement learning for node selection in branch-and-bound,","venue":null,"work_id":"9d7aa170-0877-4056-800a-5f623f29bb20","year":2024},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:7b34af5c7d509b71a6226ac8423e9efe6a51432e7f55e51a744db2159e06b582","observation_id":"25a15300-35eb-4cd5-96ae-b74b1689162b","resolution":{"observed_at":"2026-07-05T21:41:30.192750Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.189780Z","title":"Learning to compare nodes in branch and bound with graph neural networks,","venue":null,"work_id":"1f2232ee-c9ca-4a24-a570-b7fc1e54eca4","year":2022},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:586bd2c8bd71a39ed001f15adf0e0e3336c49222718ff92b6178a938ab4254e7","observation_id":"216fc87e-78d2-4dae-9696-5e243ede1a44","resolution":{"observed_at":"2026-07-05T21:41:30.190963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-05T21:41:30.210402Z","title":"Learning to resolve conflicts for multi-agent path finding with conflict-based search,","venue":null,"work_id":"04d02318-5eb8-4e2c-9769-1b1a5525ac00","year":2021},"citing_paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-02T18:46:43.417975Z"},"links":{"citing_paper":"/paper/2607.00156"},"observation_digest":"sha256:c1171bd7451587a625dc88df23ebd3f1dcd0a7cdc9c2ecfb323bfca7395260e4","observation_id":"9ac86517-b5bd-4d2a-8814-979668d37494","resolution":{"observed_at":"2026-07-05T21:41:30.211563Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.00156","last_updated":"2026-06-30T20:31:23Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-01T19:59:45.411549Z","submitted_at":"2026-06-30T20:31:23Z","title":"Dual-Informed Vertical Expansion for Multi-Objective Node Selection in Anytime Conflict-Based Search"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":4,"verified_fuzzy":24},"total_outbound_references":28},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2607.00156."}