{"as_of":"2026-08-08T09:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:aa3371ee0f57340edffc63301bcbe1c6b98ae29fe414ad497516bab9eb96c8c7","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:26:09.945249Z","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-25T05:10:21.948130Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2002.10689","last_updated":"2020-02-25T06:09:30Z","snapshot_observed_at":"2026-08-02T06:23:27.066738Z","submitted_at":"2020-02-25T06:09:30Z","title":"A Theory of Usable Information Under Computational Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.10689","snapshot_observed_at":"2026-08-07T15:26:09.945249Z","title":"A theory of usable information under computational constraints","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.15303","last_updated":"2025-05-21T09:34:27Z","snapshot_observed_at":"2026-08-07T22:50:41.068927Z","submitted_at":"2025-05-21T09:34:27Z","title":"Laplace Sample Information: Data Informativeness Through a Bayesian Lens","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-07T15:26:09.945249Z"},"links":{"cited_paper":"/paper/2002.10689","citing_paper":"/paper/2505.15303"},"observation_digest":"sha256:c5f7ff97687f000874c3de5db4072ac7427d60e08907d5aeab895d0a47f2688d","observation_id":"1557a7cb-8939-4676-8e91-3d26f9c25a62","resolution":{"observed_at":"2026-08-07T15:26:09.945249Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10689","last_updated":"2020-02-25T06:09:30Z","snapshot_observed_at":"2026-08-02T06:23:27.066738Z","submitted_at":"2020-02-25T06:09:30Z","title":"A Theory of Usable Information Under Computational Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.10689","snapshot_observed_at":"2026-08-07T12:35:41.368427Z","title":"A theory of usable information under computational constraints, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.24832","last_updated":"2025-06-18T15:27:03Z","snapshot_observed_at":"2026-08-08T09:16:38.722740Z","submitted_at":"2025-05-30T17:34:03Z","title":"How much do language models memorize?","version":3},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-07T12:35:41.368427Z"},"links":{"cited_paper":"/paper/2002.10689","citing_paper":"/paper/2505.24832"},"observation_digest":"sha256:60e99ebe905b624db5a99df8d0687d8f067aa4c2c157daf3066ade22e9e06a8c","observation_id":"47911f31-5f6f-4971-b1a1-c16b5621bfa8","resolution":{"observed_at":"2026-08-07T12:35:41.368427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10689","last_updated":"2020-02-25T06:09:30Z","snapshot_observed_at":"2026-08-02T06:23:27.066738Z","submitted_at":"2020-02-25T06:09:30Z","title":"A Theory of Usable Information Under Computational Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.10689","snapshot_observed_at":"2026-08-07T10:43:53.975431Z","title":"A theory of usable information under computational constraints","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2506.04870","last_updated":"2025-06-05T10:47:14Z","snapshot_observed_at":"2026-08-07T10:29:09.298734Z","submitted_at":"2025-06-05T10:47:14Z","title":"Aligning Multimodal Representations through an Information Bottleneck","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-07T10:43:53.975431Z"},"links":{"cited_paper":"/paper/2002.10689","citing_paper":"/paper/2506.04870"},"observation_digest":"sha256:1b26c1fccabb5c56f8f088aef6cf279e6db930e663a2c2dba4e34e915ecf0e27","observation_id":"ccc34d92-69f0-4757-ae50-eb8e762be252","resolution":{"observed_at":"2026-08-07T10:43:53.975431Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10689","last_updated":"2020-02-25T06:09:30Z","snapshot_observed_at":"2026-08-02T06:23:27.066738Z","submitted_at":"2020-02-25T06:09:30Z","title":"A Theory of Usable Information Under Computational Constraints","version":1},"cited_work":{"arxiv_id":"2002.10689","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.10689","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2002.10689 , year=","venue":null,"work_id":"e6a1141e-ca1f-43bf-ad94-e584bf4ec662","year":2002},"citing_paper":{"arxiv_id":"2604.13258","last_updated":"2026-04-14T19:43:43Z","snapshot_observed_at":"2026-07-06T23:01:19.191464Z","submitted_at":"2026-04-14T19:43:43Z","title":"Hessian-Enhanced Token Attribution (HETA): Interpreting Autoregressive LLMs","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-10T15:23:53.906870Z"},"links":{"cited_paper":"/paper/2002.10689","citing_paper":"/paper/2604.13258"},"observation_digest":"sha256:b62e88ece9a090a84353fb6da221031a6b565bb9b1b44fa0f6a01a13370d65f5","observation_id":"758f968f-13d4-4e3b-bcb8-88eb9031e3b4","resolution":{"observed_at":"2026-05-11T10:41:02.188710Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10689","last_updated":"2020-02-25T06:09:30Z","snapshot_observed_at":"2026-08-02T06:23:27.066738Z","submitted_at":"2020-02-25T06:09:30Z","title":"A Theory of Usable Information Under Computational Constraints","version":1},"cited_work":{"arxiv_id":"2002.10689","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2002.10689","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2002.10689 , year=","venue":null,"work_id":"e6a1141e-ca1f-43bf-ad94-e584bf4ec662","year":2002},"citing_paper":{"arxiv_id":"2605.23402","last_updated":"2026-05-22T09:13:29Z","snapshot_observed_at":"2026-07-06T23:33:39.204744Z","submitted_at":"2026-05-22T09:13:29Z","title":"Parametric Prior Mapping Framework for Non-stationary Probabilistic Time Series Forecasting","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-05-25T05:09:06.410581Z"},"links":{"cited_paper":"/paper/2002.10689","citing_paper":"/paper/2605.23402"},"observation_digest":"sha256:06ab397998cfb33688c947679f700131d0a57c69b91e3b35f9443856a0aa0ee5","observation_id":"60e19352-28ee-41ec-a964-f5c94f9d4f84","resolution":{"observed_at":"2026-05-25T05:10:21.950819Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2002.10689","last_updated":"2020-02-25T06:09:30Z","snapshot_observed_at":"2026-08-02T06:23:27.066738Z","submitted_at":"2020-02-25T06:09:30Z","title":"A Theory of Usable Information Under Computational Constraints","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2002.10689","snapshot_observed_at":"2026-07-14T00:50:24.285797Z","title":"arXiv preprint arXiv:2002.10689 , year=","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2607.10039","last_updated":"2026-07-10T23:45:28Z","snapshot_observed_at":"2026-08-06T18:39:14.493878Z","submitted_at":"2026-07-10T23:45:28Z","title":"Are We Ready for AI-Driven Discovery? AI Verification Before the Next Fundamental Physics Breakthrough","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-07-14T00:50:24.285797Z"},"links":{"cited_paper":"/paper/2002.10689","citing_paper":"/paper/2607.10039"},"observation_digest":"sha256:f234f95158bc69900ece26deae8777721076b6c38a698764ea340846fc1cf4f1","observation_id":"24557a6d-177f-462f-b870-b310d96bb688","resolution":{"observed_at":"2026-07-14T00:50:24.285797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2002.10689/citation-record","integrity":"/paper/2002.10689/integrity","json":"/paper/2002.10689/citation-record.json","paper":"/paper/2002.10689"},"outbound":[],"paper":{"arxiv_id":"2002.10689","last_updated":"2020-02-25T06:09:30Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-02T06:23:27.066738Z","submitted_at":"2020-02-25T06:09:30Z","title":"A Theory of Usable Information Under Computational Constraints"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2002.10689."}