{"as_of":"2026-08-10T23:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2db2ace1eb0842dbb487ac620423263b6966b7ced9e7481fe0763cf79e8ab259","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-10T06:31:04.303077+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-06T13:57:14.239072Z","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-06T13:57:14.688142Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.07779","last_updated":"2025-05-12T17:31:51Z","snapshot_observed_at":"2026-08-07T15:47:47.662531Z","submitted_at":"2025-05-12T17:31:51Z","title":"Multi-Agent Path Finding via Finite-Horizon Hierarchical Factorization","version":1},"cited_work":{"arxiv_id":"2505.07779","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.07779","snapshot_observed_at":"2026-08-06T13:57:14.688142Z","title":"Multi-Agent Path Finding via Finite-Horizon Hierarchical Factorization","venue":"cs.RO","work_id":"1575a4ca-0e8d-4354-9626-53fa881c6247","year":2025},"citing_paper":{"arxiv_id":"2608.04905","last_updated":"2026-08-05T14:33:59Z","snapshot_observed_at":"2026-08-10T06:30:22.006797Z","submitted_at":"2026-08-05T14:33:59Z","title":"PRIMAL3: Pathfinding via Reinforcement and Imitation Multi-Agent Learning - Leveraging LaCAM3","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-06T13:57:14.239072Z"},"links":{"cited_paper":"/paper/2505.07779","citing_paper":"/paper/2608.04905"},"observation_digest":"sha256:5c6158b8c8c7c66b04b70902a81890c89f88bd1f2bcad10a2d1de613683a2d71","observation_id":"5d2bf6f3-9f32-43f4-ae4d-0cb509b7d60d","resolution":{"observed_at":"2026-08-06T13:57:14.691752Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.07779/citation-record","integrity":"/paper/2505.07779/integrity","json":"/paper/2505.07779/citation-record.json","paper":"/paper/2505.07779"},"outbound":[],"paper":{"arxiv_id":"2505.07779","last_updated":"2025-05-12T17:31:51Z","latest_version":1,"primary_category":"cs.RO","snapshot_observed_at":"2026-08-07T15:47:47.662531Z","submitted_at":"2025-05-12T17:31:51Z","title":"Multi-Agent Path Finding via Finite-Horizon Hierarchical Factorization"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2505.07779."}