{"as_of":"2026-08-09T11:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d69a281f4f15f8098d9b98167d633af320f5427f8b30836d69753a2df041286c","coverage":[{"denominator":15,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T12:25:17.465435Z","state":"measured"},{"denominator":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"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/2606.04746/citation-record","integrity":"/paper/2606.04746/integrity","json":"/paper/2606.04746/citation-record.json","paper":"/paper/2606.04746"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:25:17.423244Z","title":"Multi-agent path finding with delay probabilities,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2606.04746","last_updated":"2026-07-28T09:03:39Z","snapshot_observed_at":"2026-08-02T12:25:17.084276Z","submitted_at":"2026-06-03T11:28:09Z","title":"CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T12:25:17.423244Z"},"links":{"citing_paper":"/paper/2606.04746"},"observation_digest":"sha256:c9e353594311597d30d413668b4d5f5ad6b1fdeda8482bb805bdfde71d85f853","observation_id":"e6307400-2e5e-46a6-93df-1304cc5b2987","resolution":{"observed_at":"2026-08-02T12:25:17.423244Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:25:17.427098Z","title":"Persistent and robust execution of mapf schedules in warehouses,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.04746","last_updated":"2026-07-28T09:03:39Z","snapshot_observed_at":"2026-08-02T12:25:17.084276Z","submitted_at":"2026-06-03T11:28:09Z","title":"CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T12:25:17.427098Z"},"links":{"citing_paper":"/paper/2606.04746"},"observation_digest":"sha256:55ddd5fbf74c29b276be0f4edf9cb6cb0081b24266a5cf098ce410d7ef23f6d7","observation_id":"50d082af-7990-4153-a942-e512ef6a8d26","resolution":{"observed_at":"2026-08-02T12:25:17.427098Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:25:17.430308Z","title":"Bidirectional temporal plan graph: Enabling switchable passing orders for more efficient multi-agent path finding plan execution,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.04746","last_updated":"2026-07-28T09:03:39Z","snapshot_observed_at":"2026-08-02T12:25:17.084276Z","submitted_at":"2026-06-03T11:28:09Z","title":"CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T12:25:17.430308Z"},"links":{"citing_paper":"/paper/2606.04746"},"observation_digest":"sha256:57e8e25b716a6fc72239607863231491235532d8d8a7d77493fe8c31c29da483","observation_id":"41e899a8-d65f-4730-a756-200d04562b6c","resolution":{"observed_at":"2026-08-02T12:25:17.430308Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:25:17.433572Z","title":"Multi-agent pathfinding: Definitions, variants, and benchmarks,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.04746","last_updated":"2026-07-28T09:03:39Z","snapshot_observed_at":"2026-08-02T12:25:17.084276Z","submitted_at":"2026-06-03T11:28:09Z","title":"CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T12:25:17.433572Z"},"links":{"citing_paper":"/paper/2606.04746"},"observation_digest":"sha256:2a85f83d44eca0b2b279bb269b86a1eb6956e3826b76ea0bbfa3fd7c7cf58aa4","observation_id":"d5943479-da53-45bd-9362-e952cfc64cff","resolution":{"observed_at":"2026-08-02T12:25:17.433572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:25:17.436566Z","title":"Conflict-based search for optimal multi-agent pathfinding,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2606.04746","last_updated":"2026-07-28T09:03:39Z","snapshot_observed_at":"2026-08-02T12:25:17.084276Z","submitted_at":"2026-06-03T11:28:09Z","title":"CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T12:25:17.436566Z"},"links":{"citing_paper":"/paper/2606.04746"},"observation_digest":"sha256:de9271a17c772bdab86c32add969045b553b13ae81f801def642c3a16e4b582a","observation_id":"23771bed-2a51-440c-9fb7-644f0fb64859","resolution":{"observed_at":"2026-08-02T12:25:17.436566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:25:17.440158Z","title":"Coordinating hundreds of cooperative, autonomous vehicles in warehouses,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.04746","last_updated":"2026-07-28T09:03:39Z","snapshot_observed_at":"2026-08-02T12:25:17.084276Z","submitted_at":"2026-06-03T11:28:09Z","title":"CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T12:25:17.440158Z"},"links":{"citing_paper":"/paper/2606.04746"},"observation_digest":"sha256:b1bc6992541b4d65931c0f13ac8f6f494679cdf60a00a97615d1d281c5563675","observation_id":"b3ba0739-b0bc-4b51-b6cc-077204634fdf","resolution":{"observed_at":"2026-08-02T12:25:17.440158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:25:17.443622Z","title":"Analyzing planner design trade-offs for mapf under adg-based realistic execution,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2606.04746","last_updated":"2026-07-28T09:03:39Z","snapshot_observed_at":"2026-08-02T12:25:17.084276Z","submitted_at":"2026-06-03T11:28:09Z","title":"CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T12:25:17.443622Z"},"links":{"citing_paper":"/paper/2606.04746"},"observation_digest":"sha256:91bc4f5c8e848582da2ce3404ec2c8cfe0e57b5d814f71a342d25896561ad32d","observation_id":"4e82d540-ff93-4f92-92ac-3deffbe23012","resolution":{"observed_at":"2026-08-02T12:25:17.443622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:25:17.446356Z","title":"Which mapf model works best for automated warehousing?","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2606.04746","last_updated":"2026-07-28T09:03:39Z","snapshot_observed_at":"2026-08-02T12:25:17.084276Z","submitted_at":"2026-06-03T11:28:09Z","title":"CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T12:25:17.446356Z"},"links":{"citing_paper":"/paper/2606.04746"},"observation_digest":"sha256:f8053256e13f8e1972a8d338b710b363ac556979a266c14d2f70ccd679828258","observation_id":"72db8582-43f7-4227-a8fa-20a7e12f3ba9","resolution":{"observed_at":"2026-08-02T12:25:17.446356Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:25:17.449026Z","title":"Traffic flow optimisation for lifelong multi-agent path finding,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.04746","last_updated":"2026-07-28T09:03:39Z","snapshot_observed_at":"2026-08-02T12:25:17.084276Z","submitted_at":"2026-06-03T11:28:09Z","title":"CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T12:25:17.449026Z"},"links":{"citing_paper":"/paper/2606.04746"},"observation_digest":"sha256:f547ad9dd2aca7a0fb9b1032a270144fb4a646104a5936ed4ec7c459edd72c58","observation_id":"9b85a664-a347-4aa3-a249-068190a09706","resolution":{"observed_at":"2026-08-02T12:25:17.449026Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:25:17.451622Z","title":"P3gasus: Pre-planned path execution graphs for multi-agent systems at ultra-large scale,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2606.04746","last_updated":"2026-07-28T09:03:39Z","snapshot_observed_at":"2026-08-02T12:25:17.084276Z","submitted_at":"2026-06-03T11:28:09Z","title":"CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T12:25:17.451622Z"},"links":{"citing_paper":"/paper/2606.04746"},"observation_digest":"sha256:626d02c9cc166ca145a30f0191a344a5e5213a92b4b9dfb4cecd54e2c5d42f20","observation_id":"39c4a703-d523-41c7-92a5-ea00c727b75f","resolution":{"observed_at":"2026-08-02T12:25:17.451622Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:25:17.454387Z","title":"Improved heuristics for multi-agent path finding with conflict-based search,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2606.04746","last_updated":"2026-07-28T09:03:39Z","snapshot_observed_at":"2026-08-02T12:25:17.084276Z","submitted_at":"2026-06-03T11:28:09Z","title":"CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T12:25:17.454387Z"},"links":{"citing_paper":"/paper/2606.04746"},"observation_digest":"sha256:8b9def4d7771d17a9ce90a62045e83ba4c46cb369b18f9582ad719dd272d5dbd","observation_id":"c5ac0e19-7e95-4e0b-9432-63b89293fa08","resolution":{"observed_at":"2026-08-02T12:25:17.454387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:25:17.457047Z","title":"Eecbs: A bounded-suboptimal search for multi-agent path finding,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2606.04746","last_updated":"2026-07-28T09:03:39Z","snapshot_observed_at":"2026-08-02T12:25:17.084276Z","submitted_at":"2026-06-03T11:28:09Z","title":"CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T12:25:17.457047Z"},"links":{"citing_paper":"/paper/2606.04746"},"observation_digest":"sha256:2be67bf4b47f2910b059bc6fc22ecf1e20d16191a522a7d355156b1c12010f1f","observation_id":"4dad38d0-2fec-4ac9-ac71-ff531de101a5","resolution":{"observed_at":"2026-08-02T12:25:17.457047Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:25:17.459863Z","title":"Lacam: Search- based algorithm for quick multi-agent pathfinding,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.04746","last_updated":"2026-07-28T09:03:39Z","snapshot_observed_at":"2026-08-02T12:25:17.084276Z","submitted_at":"2026-06-03T11:28:09Z","title":"CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T12:25:17.459863Z"},"links":{"citing_paper":"/paper/2606.04746"},"observation_digest":"sha256:f3141396615f67ae9f385c9e3e449d3c1250a727e8b35e92ac8bca0ea5484269","observation_id":"b330fd0a-1d02-4948-a66d-f63162336803","resolution":{"observed_at":"2026-08-02T12:25:17.459863Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T12:25:17.462510Z","title":"Engineering lacam*: Towards real-time, large-scale, and near-optimal multi-agent pathfinding,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.04746","last_updated":"2026-07-28T09:03:39Z","snapshot_observed_at":"2026-08-02T12:25:17.084276Z","submitted_at":"2026-06-03T11:28:09Z","title":"CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T12:25:17.462510Z"},"links":{"citing_paper":"/paper/2606.04746"},"observation_digest":"sha256:259b01d24ae5a4e84a65f11f487691c70e15aa8a330034e6cf449fc8b2f6ee4e","observation_id":"fa1f04d4-8598-4a4c-8331-1425b7885f9f","resolution":{"observed_at":"2026-08-02T12:25:17.462510Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.04292","last_updated":"2024-01-21T22:40:07Z","snapshot_observed_at":"2026-07-06T16:03:54.971351Z","submitted_at":"2023-08-08T14:36:58Z","title":"Engineering LaCAM$^\\ast$: Towards Real-Time, Large-Scale, and Near-Optimal Multi-Agent Pathfinding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.04292","snapshot_observed_at":"2026-08-02T12:25:17.465435Z","title":"Engineering LaCAM: Towards real-time, large-scale, and near-optimal multi-agent pathfinding,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.04746","last_updated":"2026-07-28T09:03:39Z","snapshot_observed_at":"2026-08-02T12:25:17.084276Z","submitted_at":"2026-06-03T11:28:09Z","title":"CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T12:25:17.465435Z"},"links":{"cited_paper":"/paper/2308.04292","citing_paper":"/paper/2606.04746"},"observation_digest":"sha256:dec17b81add83a98194a979312f0d440971bca2f227a75fa3288e5aa02755d51","observation_id":"5fccc8ec-0282-42db-af1f-29163fce26ad","resolution":{"observed_at":"2026-08-02T12:25:17.465435Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.04746","last_updated":"2026-07-28T09:03:39Z","latest_version":3,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-02T12:25:17.084276Z","submitted_at":"2026-06-03T11:28:09Z","title":"CADENCE: Predicting Realized MAPF Execution Time Beyond Sum of Costs"},"reference_resolution":{"displayed":15,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":15},"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 15 of 15 outbound references and 0 inbound Pith citation observations for arXiv:2606.04746."}