{"as_of":"2026-08-09T20:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5c7a84d51770d4811974f78f0e27aeec41c59054f7be923c729e7e8457068f7e","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-08T06:04:24.368187Z","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-12T08:41:25.952438Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2404.03554","last_updated":"2024-04-04T16:06:39Z","snapshot_observed_at":"2026-08-07T09:01:11.787908Z","submitted_at":"2024-04-04T16:06:39Z","title":"No Panacea in Planning: Algorithm Selection for Suboptimal Multi-Agent Path Finding","version":1},"cited_work":{"arxiv_id":"2404.03554","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2404.03554","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Chen,et al.No Panacea in Planning: Algorithm Selection for Suboptimal Multi-Agent Path Finding","venue":null,"work_id":"bcfa6196-b2de-4dc7-8b0a-fd7d8dc4f7ca","year":null},"citing_paper":{"arxiv_id":"2604.25567","last_updated":"2026-04-28T12:39:12Z","snapshot_observed_at":"2026-07-06T23:11:25.757664Z","submitted_at":"2026-04-28T12:39:12Z","title":"Should I Replan? Learning to Spot the Right Time in Robust MAPF Execution","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-07T14:01:56.724017Z"},"links":{"cited_paper":"/paper/2404.03554","citing_paper":"/paper/2604.25567"},"observation_digest":"sha256:9f815c413cedb706aaf93f0e3d4757a2504a01da0875fd5a6e234439d3e5e0a9","observation_id":"626d1a0c-f5d1-4c69-813b-82d2a20f10fd","resolution":{"observed_at":"2026-05-12T08:41:25.954651Z","resolver_source":"arxiv_id","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":"2404.03554","last_updated":"2024-04-04T16:06:39Z","snapshot_observed_at":"2026-08-07T09:01:11.787908Z","submitted_at":"2024-04-04T16:06:39Z","title":"No Panacea in Planning: Algorithm Selection for Suboptimal Multi-Agent Path Finding","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.03554","snapshot_observed_at":"2026-08-08T06:04:24.368187Z","title":"arXiv preprint arXiv:2404.03554 , 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-09T20:11:21.845264Z","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":33,"source":"arxiv_source","source_observed_at":"2026-08-08T06:04:24.368187Z"},"links":{"cited_paper":"/paper/2404.03554","citing_paper":"/paper/2608.05588"},"observation_digest":"sha256:71b0381c31fa4289cc96b46ce95bf78733402a4c6dc676353d3abf71d5f16f51","observation_id":"aa9abc0d-06be-4204-9d9b-4c1e2ee5f83e","resolution":{"observed_at":"2026-08-08T06:04:24.368187Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2404.03554/citation-record","integrity":"/paper/2404.03554/integrity","json":"/paper/2404.03554/citation-record.json","paper":"/paper/2404.03554"},"outbound":[],"paper":{"arxiv_id":"2404.03554","last_updated":"2024-04-04T16:06:39Z","latest_version":1,"primary_category":"cs.MA","snapshot_observed_at":"2026-08-07T09:01:11.787908Z","submitted_at":"2024-04-04T16:06:39Z","title":"No Panacea in Planning: Algorithm Selection for Suboptimal 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:2404.03554."}