{"as_of":"2026-08-11T21:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d927f78828feec96cede80f9d95b226482d9ae90de779ae84330417970cbb2f6","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T17:00:54.279914Z","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-20T02:22:59.354206Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2401.01149","last_updated":"2024-09-04T15:27:44Z","snapshot_observed_at":"2026-08-11T04:38:17.517520Z","submitted_at":"2024-01-02T10:59:29Z","title":"Search Games with Predictions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.01149","snapshot_observed_at":"2026-08-10T17:00:54.279914Z","title":"Search games with predictions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12770","last_updated":"2025-01-22T10:12:18Z","snapshot_observed_at":"2026-08-11T04:37:55.643591Z","submitted_at":"2025-01-22T10:12:18Z","title":"On Tradeoffs in Learning-Augmented Algorithms","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-10T17:00:54.279914Z"},"links":{"cited_paper":"/paper/2401.01149","citing_paper":"/paper/2501.12770"},"observation_digest":"sha256:a41bb25d678ad473f76318c9485e16e15bc640ee8c174e0334df364b14d3df56","observation_id":"64ab6155-2be9-47ce-99ec-d11bc7c2bb80","resolution":{"observed_at":"2026-08-10T17:00:54.279914Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.01149","last_updated":"2024-09-04T15:27:44Z","snapshot_observed_at":"2026-08-11T04:38:17.517520Z","submitted_at":"2024-01-02T10:59:29Z","title":"Search Games with Predictions","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.01149","snapshot_observed_at":"2026-08-06T15:45:55.442396Z","title":"Search games with predictions","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.15658","last_updated":"2025-07-21T14:21:13Z","snapshot_observed_at":"2026-08-11T04:39:11.809918Z","submitted_at":"2025-07-21T14:21:13Z","title":"Asynchronous Collective Tree Exploration: a Distributed Algorithm, and a new Lower Bound","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T15:45:55.442396Z"},"links":{"cited_paper":"/paper/2401.01149","citing_paper":"/paper/2507.15658"},"observation_digest":"sha256:c8e4763b964d006c516e2ef883bb209c8cf9e059d8db52a4af8e733757a70ead","observation_id":"57a465b0-ee7d-4c8c-92af-53f1f710ec37","resolution":{"observed_at":"2026-08-06T15:45:55.442396Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.01149","last_updated":"2024-09-04T15:27:44Z","snapshot_observed_at":"2026-08-11T04:38:17.517520Z","submitted_at":"2024-01-02T10:59:29Z","title":"Search Games with Predictions","version":2},"cited_work":{"arxiv_id":"2401.01149","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2401.01149","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"6e57719c-56a7-4327-be09-c150a3e9a566","year":2024},"citing_paper":{"arxiv_id":"2605.19440","last_updated":"2026-05-19T06:52:31Z","snapshot_observed_at":"2026-08-11T04:39:11.153596Z","submitted_at":"2026-05-19T06:52:31Z","title":"Competitive Search with a Faulty Satnav (GPS): When Probability Matching is Rational","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-20T02:18:33.172934Z"},"links":{"cited_paper":"/paper/2401.01149","citing_paper":"/paper/2605.19440"},"observation_digest":"sha256:47f4e652d6d675001a1d99ef3cd7af660456e0582f2748d261b804a0ee4f0a5e","observation_id":"d618265e-1727-48e4-8941-c8ea8b932363","resolution":{"observed_at":"2026-05-20T02:22:59.356849Z","resolver_source":"arxiv_id","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/2401.01149/citation-record","integrity":"/paper/2401.01149/integrity","json":"/paper/2401.01149/citation-record.json","paper":"/paper/2401.01149"},"outbound":[],"paper":{"arxiv_id":"2401.01149","last_updated":"2024-09-04T15:27:44Z","latest_version":2,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-11T04:38:17.517520Z","submitted_at":"2024-01-02T10:59:29Z","title":"Search Games with Predictions"},"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 3 inbound Pith citation observations for arXiv:2401.01149."}