{"as_of":"2026-08-09T19:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:6379542144951996a10097a4a46044e1821c7ea3c85adb0bae7ab6b4f08738e0","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:20:17.723877Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-08-07T14:20:20.665236Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2305.03632","last_updated":"2023-05-05T15:43:20Z","snapshot_observed_at":"2026-07-06T15:23:49.202914Z","submitted_at":"2023-05-05T15:43:20Z","title":"Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding","version":1},"cited_work":{"arxiv_id":"2305.03632","doi":null,"metadata_source":"pith","pith_arxiv_id":"2305.03632","snapshot_observed_at":"2026-08-07T14:20:20.665236Z","title":"Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding","venue":"cs.AI","work_id":"a95fe4d0-1dd4-43c1-a82b-89a14a02d80b","year":2023},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-07T14:16:28.562971Z","submitted_at":"2025-05-25T16:28:06Z","title":"Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:17.723877Z"},"links":{"cited_paper":"/paper/2305.03632","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:41f3e79cd5f6d06c96853ab53894f0aa34369c2ee394a79b1091bb2661408247","observation_id":"928d5bad-3f1c-457f-a701-9dee3a73c0ae","resolution":{"observed_at":"2026-08-07T14:20:20.710669Z","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":{"arxiv_id":"2305.03632","last_updated":"2023-05-05T15:43:20Z","snapshot_observed_at":"2026-07-06T15:23:49.202914Z","submitted_at":"2023-05-05T15:43:20Z","title":"Improving LaCAM for Scalable Eventually Optimal Multi-Agent Pathfinding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2305.03632","snapshot_observed_at":"2026-08-03T00:03:08.597775Z","title":"Improving lacam for scalable eventually 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-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},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T00:03:08.597775Z"},"links":{"cited_paper":"/paper/2305.03632","citing_paper":"/paper/2602.12024"},"observation_digest":"sha256:965a4d35228555f330fe96638594472c0f1f8dba8ddbbe030792368ac97a89b9","observation_id":"5e388148-1ea9-4926-8194-4d31eb5ff535","resolution":{"observed_at":"2026-08-03T00:03:08.597775Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2305.03632/citation-record","integrity":"/paper/2305.03632/integrity","json":"/paper/2305.03632/citation-record.json","paper":"/paper/2305.03632"},"outbound":[],"paper":{"arxiv_id":"2305.03632","last_updated":"2023-05-05T15:43:20Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-07-06T15:23:49.202914Z","submitted_at":"2023-05-05T15:43:20Z","title":"Improving LaCAM for Scalable Eventually 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-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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2305.03632."}