{"as_of":"2026-08-09T09:59:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ee7108420feef44b2f01d9663874db8091c7acbbc81c6c16f6159e2cb5e3c1b9","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T06:10:59.887144Z","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-07-01T12:05:43.193391Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.04204","last_updated":"2024-07-16T17:38:46Z","snapshot_observed_at":"2026-07-06T16:44:23.357719Z","submitted_at":"2023-11-07T18:43:27Z","title":"Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.04204","snapshot_observed_at":"2026-08-07T06:10:59.887144Z","title":"Sharp thresholds imply circuit lower bounds: from random 2-sat to planted clique","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.06259","last_updated":"2025-06-06T17:39:32Z","snapshot_observed_at":"2026-08-07T05:55:17.794762Z","submitted_at":"2025-06-06T17:39:32Z","title":"An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T06:10:59.887144Z"},"links":{"cited_paper":"/paper/2311.04204","citing_paper":"/paper/2506.06259"},"observation_digest":"sha256:3ab75a978d3c7e7fa2ef53257f8ebee826ad8539b26a49c82d168e66053264a8","observation_id":"2f7ee15c-f406-477b-af67-79ac55f015d9","resolution":{"observed_at":"2026-08-07T06:10:59.887144Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.04204","last_updated":"2024-07-16T17:38:46Z","snapshot_observed_at":"2026-07-06T16:44:23.357719Z","submitted_at":"2023-11-07T18:43:27Z","title":"Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique","version":3},"cited_work":{"arxiv_id":"2311.04204","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.04204","snapshot_observed_at":"2026-07-01T12:05:43.193391Z","title":"Gamarnik, E","venue":null,"work_id":"8c00a676-11ab-4383-8230-ea55a1d62fe1","year":2023},"citing_paper":{"arxiv_id":"2606.31657","last_updated":"2026-06-30T13:36:46Z","snapshot_observed_at":"2026-07-07T00:05:22.503928Z","submitted_at":"2026-06-30T13:36:46Z","title":"Sensitivity Lower Bounds via Locally Testable Codes","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-01T02:54:42.449898Z"},"links":{"cited_paper":"/paper/2311.04204","citing_paper":"/paper/2606.31657"},"observation_digest":"sha256:410d9c14b3be14db4f39b3f0d6ad2d2a27be3e568000cdac2dc9e1d3277539c6","observation_id":"286a803d-3939-41c9-a13a-f89304c4e5fe","resolution":{"observed_at":"2026-07-01T12:05:43.194871Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2311.04204/citation-record","integrity":"/paper/2311.04204/integrity","json":"/paper/2311.04204/citation-record.json","paper":"/paper/2311.04204"},"outbound":[],"paper":{"arxiv_id":"2311.04204","last_updated":"2024-07-16T17:38:46Z","latest_version":3,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T16:44:23.357719Z","submitted_at":"2023-11-07T18:43:27Z","title":"Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique"},"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 2 inbound Pith citation observations for arXiv:2311.04204."}