{"as_of":"2026-08-09T01:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:569786849a362e125bc9f3066fb0f696b519ca7aa160f921a9a0c4d9cfcafa27","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T06:04:24.525421Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-02T07:56:47.639375Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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-03T00:03:08.688527Z","title":"Engineering lacam*: Towards real-time, large-scale, and near- optimal multi-agent pathfinding,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.12024","last_updated":"2026-06-23T21:08:28Z","snapshot_observed_at":"2026-08-03T00:03:06.342934Z","submitted_at":"2026-02-12T14:55:16Z","title":"Adaptive-Horizon Conflict-Based Search for Closed-Loop Multi-Agent Path Finding","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:08.688527Z"},"links":{"cited_paper":"/paper/2308.04292","citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:4c8025a4bbe738195e1ba844e9a8af6a80ed23bb2064b560c2100e18a62ed2ff","observation_id":"216f7256-202c-4d89-acd6-02b3e60e034a","resolution":{"observed_at":"2026-08-03T00:03:08.688527Z","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":"2308.04292","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2308.04292","snapshot_observed_at":"2026-07-02T07:56:47.639375Z","title":"Engineering LaCAM: Towards real-time, large-scale, and near-optimal multi-agent pathfinding,","venue":null,"work_id":"e1440b1d-a07c-48ee-b483-2c81db1a9674","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":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-28T06:29:49.540562Z"},"links":{"cited_paper":"/paper/2308.04292","citing_paper":"/paper/2606.04746"},"observation_digest":"sha256:43cfc90995e89861f9e1b967bb773f3f3628422d2600d08c6eb270576b9bd544","observation_id":"065887bf-fd60-42ad-9f0c-cc74394b64f6","resolution":{"observed_at":"2026-07-02T07:56:47.640846Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"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"}},{"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-06T13:57:14.159318Z","title":"Engineering lacam*: Towards real-time, large-scale, and near- optimal multi-agent pathfinding,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2608.04905","last_updated":"2026-08-05T14:33:59Z","snapshot_observed_at":"2026-08-08T23:13:25.259436Z","submitted_at":"2026-08-05T14:33:59Z","title":"PRIMAL3: Pathfinding via Reinforcement and Imitation Multi-Agent Learning - Leveraging LaCAM3","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T13:57:14.159318Z"},"links":{"cited_paper":"/paper/2308.04292","citing_paper":"/paper/2608.04905"},"observation_digest":"sha256:0b0b39e07d73cb36a7d6963b005f5255a1ce01a403e8b6891bf2a47ba1a5ce76","observation_id":"d724bea3-2b0c-4cab-897a-a0c8864c8cce","resolution":{"observed_at":"2026-08-06T13:57:14.159318Z","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-08T06:04:24.525421Z","title":"arXiv preprint arXiv:2308.04292 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05588","last_updated":"2026-08-06T04:17:38Z","snapshot_observed_at":"2026-08-09T00:10:48.809034Z","submitted_at":"2026-08-06T04:17:38Z","title":"Search-Aided Joint Agent-Environment Reinforcement Learning for Robust Lifelong Multi-Agent Path Finding with Rotations","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-08T06:04:24.525421Z"},"links":{"cited_paper":"/paper/2308.04292","citing_paper":"/paper/2608.05588"},"observation_digest":"sha256:28cc483c287063d94acd38aa5213f7cc3f5c10cff0bc8a4f072b5fa06a0a0ac2","observation_id":"f4e44e33-172f-4543-adce-06f52626cef7","resolution":{"observed_at":"2026-08-08T06:04:24.525421Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2308.04292/citation-record","integrity":"/paper/2308.04292/integrity","json":"/paper/2308.04292/citation-record.json","paper":"/paper/2308.04292"},"outbound":[],"paper":{"arxiv_id":"2308.04292","last_updated":"2024-01-21T22:40:07Z","latest_version":2,"primary_category":"cs.AI","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2308.04292."}