{"as_of":"2026-08-11T11:27:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4bf8ac8bdb535068e65034cfdf5718de08cb86e11c8b62a606dd0093e7120f42","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:20:17.917831Z","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.407148Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2105.07132","last_updated":"2023-04-08T08:00:00Z","snapshot_observed_at":"2026-07-06T11:09:41.435966Z","submitted_at":"2021-05-15T04:05:01Z","title":"Offline Time-Independent Multi-Agent Path Planning","version":3},"cited_work":{"arxiv_id":"2105.07132","doi":null,"metadata_source":"pith","pith_arxiv_id":"2105.07132","snapshot_observed_at":"2026-08-07T14:20:20.407148Z","title":"Offline Time-Independent Multi-Agent Path Planning","venue":"cs.MA","work_id":"e8cfd04b-ddc0-44c9-a507-c800641c879c","year":2021},"citing_paper":{"arxiv_id":"2505.19219","last_updated":"2025-07-31T14:16:44Z","snapshot_observed_at":"2026-08-09T20:59:53.581516Z","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":2019,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:17.917831Z"},"links":{"cited_paper":"/paper/2105.07132","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:505394223a57a3b2c40a58aa59cafce21923a57f7b23fd94d8bfe955bb78c37e","observation_id":"b0964045-ac46-478c-ab61-438d5c8a7697","resolution":{"observed_at":"2026-08-07T14:20:20.449584Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/2105.07132/citation-record","integrity":"/paper/2105.07132/integrity","json":"/paper/2105.07132/citation-record.json","paper":"/paper/2105.07132"},"outbound":[],"paper":{"arxiv_id":"2105.07132","last_updated":"2023-04-08T08:00:00Z","latest_version":3,"primary_category":"cs.MA","snapshot_observed_at":"2026-07-06T11:09:41.435966Z","submitted_at":"2021-05-15T04:05:01Z","title":"Offline Time-Independent Multi-Agent Path Planning"},"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 1 inbound Pith citation observation for arXiv:2105.07132."}