{"as_of":"2026-08-09T20:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d43f9ad337882d1974805746cf129e5e5fe2385940c4c36819f42a41c40d0728","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.819213Z","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.525674Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1905.10149","last_updated":"2020-12-14T05:19:36Z","snapshot_observed_at":"2026-08-07T23:15:43.924142Z","submitted_at":"2019-05-24T11:12:25Z","title":"winPIBT: Extended Prioritized Algorithm for Iterative Multi-agent Path Finding","version":5},"cited_work":{"arxiv_id":"1905.10149","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.10149","snapshot_observed_at":"2026-08-07T14:20:20.525674Z","title":"winPIBT: Extended Prioritized Algorithm for Iterative Multi-agent Path Finding","venue":"cs.MA","work_id":"bc879eab-9e2c-40c7-a6f7-231c6333111b","year":2019},"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":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:20:17.819213Z"},"links":{"cited_paper":"/paper/1905.10149","citing_paper":"/paper/2505.19219"},"observation_digest":"sha256:6b8d04c69fb96e4d53cce47bd26524b4243dd9ddf90408a0ca04c3cf68356101","observation_id":"5299c64e-8d16-4d58-b320-80cd5ad0b5c6","resolution":{"observed_at":"2026-08-07T14:20:20.579937Z","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":"1905.10149","last_updated":"2020-12-14T05:19:36Z","snapshot_observed_at":"2026-08-07T23:15:43.924142Z","submitted_at":"2019-05-24T11:12:25Z","title":"winPIBT: Extended Prioritized Algorithm for Iterative Multi-agent Path Finding","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.10149","snapshot_observed_at":"2026-08-01T23:57:06.777837Z","title":"winPIBT: Extended Prioritized Algorithm for Iterative Multi-Agent Path Finding , year =","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2607.15182","last_updated":"2026-07-16T16:34:57Z","snapshot_observed_at":"2026-08-07T19:19:49.389651Z","submitted_at":"2026-07-16T16:34:57Z","title":"Stigmergic Graph Memory: An Environment-Aware Approach for Many-to-Many Multi-Agent Pickup and Delivery","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T23:57:06.777837Z"},"links":{"cited_paper":"/paper/1905.10149","citing_paper":"/paper/2607.15182"},"observation_digest":"sha256:5d385df3403b6ad9367ce12008748aed69fe3e9964088e81e14bff24867ce37e","observation_id":"a9bed0a4-67d1-4c92-949d-74ae7f3797a3","resolution":{"observed_at":"2026-08-01T23:57:06.777837Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1905.10149/citation-record","integrity":"/paper/1905.10149/integrity","json":"/paper/1905.10149/citation-record.json","paper":"/paper/1905.10149"},"outbound":[],"paper":{"arxiv_id":"1905.10149","last_updated":"2020-12-14T05:19:36Z","latest_version":5,"primary_category":"cs.MA","snapshot_observed_at":"2026-08-07T23:15:43.924142Z","submitted_at":"2019-05-24T11:12:25Z","title":"winPIBT: Extended Prioritized Algorithm for Iterative Multi-agent Path Finding"},"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:1905.10149."}