{"as_of":"2026-08-10T03:35:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a59ad308b148f62f25a9d2d04b8b2be854316c4a21a37952b03ffe3317fcc549","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-09T06:31:02.800959+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-08T13:52:09.754000Z","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-08T18:16:14.154549Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2502.10551","last_updated":"2025-05-09T15:40:21Z","snapshot_observed_at":"2026-08-07T18:16:45.655424Z","submitted_at":"2025-02-14T20:46:31Z","title":"A review of minimum cost box searching games","version":2},"cited_work":{"arxiv_id":"2502.10551","doi":"10.48550/arxiv.2502.10551","metadata_source":"pith","pith_arxiv_id":"2502.10551","snapshot_observed_at":"2026-08-08T18:16:14.154549Z","title":"A review of minimum cost box searching games","venue":"math.OC","work_id":"eddd097d-d633-4e07-8e7e-ec56917ca35b","year":2025},"citing_paper":{"arxiv_id":"2608.05406","last_updated":"2026-08-05T20:59:57Z","snapshot_observed_at":"2026-08-09T23:10:47.371998Z","submitted_at":"2026-08-05T20:59:57Z","title":"An Exact Solution of the Two-Ball Multi-Look Search Game with Three Boxes and Heterogeneous Costs","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-08T13:52:09.754000Z"},"links":{"cited_paper":"/paper/2502.10551","citing_paper":"/paper/2608.05406"},"observation_digest":"sha256:a7689e9ee54f3ddb05892089549851b5744b688b8a082bf892eca8b25393f171","observation_id":"81fb37f4-aae2-4719-a566-b5e1620a7d6c","resolution":{"observed_at":"2026-08-08T13:52:09.916540Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2502.10551/citation-record","integrity":"/paper/2502.10551/integrity","json":"/paper/2502.10551/citation-record.json","paper":"/paper/2502.10551"},"outbound":[],"paper":{"arxiv_id":"2502.10551","last_updated":"2025-05-09T15:40:21Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T18:16:45.655424Z","submitted_at":"2025-02-14T20:46:31Z","title":"A review of minimum cost box searching games"},"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 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2502.10551."}