{"as_of":"2026-08-09T13:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c38372b5a6ea80581a6c973cb80a59df106636bfe602e22c590269c6289c1f55","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-09T06:31:02.800959+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-08T15:20:15.634523Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.00558","last_updated":"2023-11-01T14:55:04Z","snapshot_observed_at":"2026-07-06T16:41:43.009493Z","submitted_at":"2023-11-01T14:55:04Z","title":"An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes","version":1},"cited_work":{"arxiv_id":"2311.00558","doi":"10.48550/arxiv.2311.00558","metadata_source":"arxiv_reference","pith_arxiv_id":"2311.00558","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"[KM24b] Pravesh K","venue":"arXiv (Cornell University)","work_id":"5425a24f-18ae-45c6-96ae-3398a0e63d87","year":2024},"citing_paper":{"arxiv_id":"2605.14994","last_updated":"2026-05-14T15:56:29Z","snapshot_observed_at":"2026-08-07T18:30:09.145234Z","submitted_at":"2026-05-14T15:56:29Z","title":"Sharp Bounds on the Eigenvalues of Kikuchi Graphs and Applications to Quantum Max Cut","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-30T20:29:21.396486Z"},"links":{"cited_paper":"/paper/2311.00558","citing_paper":"/paper/2605.14994"},"observation_digest":"sha256:220979d9991eddb5abaf7fd4ad1a78931d7fdba10a8840ec647dddbdd60b2b6e","observation_id":"d3b344a6-d6d2-48aa-a11d-7f2985704bb2","resolution":{"observed_at":"2026-06-30T20:35:01.910979Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"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"}},{"citation":{"cited_paper":{"arxiv_id":"2311.00558","last_updated":"2023-11-01T14:55:04Z","snapshot_observed_at":"2026-07-06T16:41:43.009493Z","submitted_at":"2023-11-01T14:55:04Z","title":"An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes","version":1},"cited_work":{"arxiv_id":"2311.00558","doi":"10.48550/arxiv.2311.00558","metadata_source":"arxiv_reference","pith_arxiv_id":"2311.00558","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"[KM24b] Pravesh K","venue":"arXiv (Cornell University)","work_id":"5425a24f-18ae-45c6-96ae-3398a0e63d87","year":2024},"citing_paper":{"arxiv_id":"2606.08597","last_updated":"2026-06-07T12:20:36Z","snapshot_observed_at":"2026-08-09T02:13:54.571610Z","submitted_at":"2026-06-07T12:20:36Z","title":"Kikuchi Graphs of Random Hypergraphs are Approximately Johnson","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T17:58:42.283848Z"},"links":{"cited_paper":"/paper/2311.00558","citing_paper":"/paper/2606.08597"},"observation_digest":"sha256:5ac2c8dd69f3b04c2835aebcf02a80577fcf1f86813ec3b6ad5cc64c4b9cfece","observation_id":"7d93fa19-a264-45cc-af90-3696ef82685a","resolution":{"observed_at":"2026-07-02T23:47:27.484440Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_paper":{"arxiv_id":"2311.00558","last_updated":"2023-11-01T14:55:04Z","snapshot_observed_at":"2026-07-06T16:41:43.009493Z","submitted_at":"2023-11-01T14:55:04Z","title":"An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.00558","snapshot_observed_at":"2026-08-08T15:20:15.634523Z","title":"arXiv preprint arXiv:2311.00558 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05331","last_updated":"2026-08-05T18:41:43Z","snapshot_observed_at":"2026-08-09T13:10:03.747506Z","submitted_at":"2026-08-05T18:41:43Z","title":"On the Approximability of Boolean Max-$k$-CSP","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-08T15:20:15.634523Z"},"links":{"cited_paper":"/paper/2311.00558","citing_paper":"/paper/2608.05331"},"observation_digest":"sha256:2658a45673525d9f63f7af33557bf98e235f8422e348dc691c4e45ea89928a2d","observation_id":"cb185413-58bf-451a-ab3e-cd55cce5cf12","resolution":{"observed_at":"2026-08-08T15:20:15.634523Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2311.00558/citation-record","integrity":"/paper/2311.00558/integrity","json":"/paper/2311.00558/citation-record.json","paper":"/paper/2311.00558"},"outbound":[],"paper":{"arxiv_id":"2311.00558","last_updated":"2023-11-01T14:55:04Z","latest_version":1,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T16:41:43.009493Z","submitted_at":"2023-11-01T14:55:04Z","title":"An Exponential Lower Bound for Linear 3-Query Locally Correctable Codes"},"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 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2311.00558."}