{"as_of":"2026-08-11T20:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3805456d355a1a7cafd58856d292180fe8058f2e31c56ba3a83afd76d572c52a","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-11T06:34:44.6726+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-10T17:55:34.425016Z","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-10T17:55:34.747338Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1602.04287","last_updated":"2016-02-13T04:18:03Z","snapshot_observed_at":"2026-07-30T21:10:41.721319Z","submitted_at":"2016-02-13T04:18:03Z","title":"A Minimax Theory for Adaptive Data Analysis","version":1},"cited_work":{"arxiv_id":"1602.04287","doi":null,"metadata_source":"pith","pith_arxiv_id":"1602.04287","snapshot_observed_at":"2026-08-10T17:55:34.747338Z","title":"A Minimax Theory for Adaptive Data Analysis","venue":"stat.ML","work_id":"bd0f8164-09ae-4eab-b8c6-6181bf0ab0f9","year":2016},"citing_paper":{"arxiv_id":"2501.11804","last_updated":"2025-01-21T00:45:34Z","snapshot_observed_at":"2026-08-10T17:48:18.473936Z","submitted_at":"2025-01-21T00:45:34Z","title":"Paradise of Forking Paths: Revisiting the Adaptive Data Analysis Problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T17:55:34.425016Z"},"links":{"cited_paper":"/paper/1602.04287","citing_paper":"/paper/2501.11804"},"observation_digest":"sha256:fa106ea044893ad991d81992255ebbf01cd84b14e2ab18b90c03dd8589759f3f","observation_id":"aba76f2a-baf0-4738-9553-1bf1871e0219","resolution":{"observed_at":"2026-08-10T17:55:34.751900Z","resolver_source":"local_arxiv","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/1602.04287/citation-record","integrity":"/paper/1602.04287/integrity","json":"/paper/1602.04287/citation-record.json","paper":"/paper/1602.04287"},"outbound":[],"paper":{"arxiv_id":"1602.04287","last_updated":"2016-02-13T04:18:03Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-07-30T21:10:41.721319Z","submitted_at":"2016-02-13T04:18:03Z","title":"A Minimax Theory for Adaptive Data Analysis"},"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 1 inbound Pith citation observation for arXiv:1602.04287."}