{"as_of":"2026-08-11T21:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:92bd75cdc58f249198f7e14eaad67d1a5fb1ea451f9a57c723b30c2cee17d271","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-11T06:34:44.6726+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-05T15:25:39.709340Z","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-05-12T05:46:27.542117Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2211.13432","last_updated":"2022-11-24T06:27:18Z","snapshot_observed_at":"2026-08-11T16:15:14.089882Z","submitted_at":"2022-11-24T06:27:18Z","title":"LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding","version":1},"cited_work":{"arxiv_id":"2211.13432","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2211.13432","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"LaCAM: Search-based algorithm for quick multi-agent pathfinding","venue":null,"work_id":"091f030b-1c71-4c20-8e05-6b9cf845d975","year":2023},"citing_paper":{"arxiv_id":"2605.09344","last_updated":"2026-05-10T05:44:48Z","snapshot_observed_at":"2026-07-06T23:21:26.017420Z","submitted_at":"2026-05-10T05:44:48Z","title":"PECMAN: Perception-enabled Collaborative Multi-Agent Navigation in Unknown Environments","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-12T04:59:29.949361Z"},"links":{"cited_paper":"/paper/2211.13432","citing_paper":"/paper/2605.09344"},"observation_digest":"sha256:b990b773be96c592ba501f13122689ad56cca035681673e3fe95634db6bce4e7","observation_id":"dc330b9d-7a83-4adf-91a4-4195486d8f44","resolution":{"observed_at":"2026-05-12T05:46:27.548284Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.13432","last_updated":"2022-11-24T06:27:18Z","snapshot_observed_at":"2026-08-11T16:15:14.089882Z","submitted_at":"2022-11-24T06:27:18Z","title":"LaCAM: Search-Based Algorithm for Quick Multi-Agent Pathfinding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.13432","snapshot_observed_at":"2026-08-05T15:25:39.709340Z","title":"doi:10.48550/arXiv.2211.13432 , abstract =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.03644","last_updated":"2026-08-04T13:29:00Z","snapshot_observed_at":"2026-08-11T03:36:19.110855Z","submitted_at":"2026-08-04T13:29:00Z","title":"Is Inter-Seed Cross-Play Enough? Evaluating the Robustness of Zero-Shot Coordination Algorithms to Implementation Details","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-05T15:25:39.709340Z"},"links":{"cited_paper":"/paper/2211.13432","citing_paper":"/paper/2608.03644"},"observation_digest":"sha256:5a14d0d99f24f4faf3d4721350dccb033da51a3e0481357fb0a581f9ac592f5d","observation_id":"e04b621a-dd9a-4de7-8462-3c679f7a7d9b","resolution":{"observed_at":"2026-08-05T15:25:39.709340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2211.13432/citation-record","integrity":"/paper/2211.13432/integrity","json":"/paper/2211.13432/citation-record.json","paper":"/paper/2211.13432"},"outbound":[],"paper":{"arxiv_id":"2211.13432","last_updated":"2022-11-24T06:27:18Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-11T16:15:14.089882Z","submitted_at":"2022-11-24T06:27:18Z","title":"LaCAM: Search-Based Algorithm for Quick 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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2211.13432."}