{"as_of":"2026-08-08T13:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:47a2a85393035e487ce7f0cf4f16eef2536b37a0272ce650cc8636ec0bcfa72b","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-08T06:32:00.761636+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-07T13:10:03.475809Z","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-07-10T05:46:50.329286Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1201.1214","last_updated":"2016-08-15T01:17:38Z","snapshot_observed_at":"2026-07-06T02:40:28.120346Z","submitted_at":"2012-01-05T16:39:21Z","title":"Statistical Algorithms and a Lower Bound for Detecting Planted Clique","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1201.1214","snapshot_observed_at":"2026-08-07T13:10:03.475809Z","title":"2, 1201.1214","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.22743","last_updated":"2025-06-17T05:24:14Z","snapshot_observed_at":"2026-08-07T19:41:09.127788Z","submitted_at":"2025-05-28T18:04:10Z","title":"Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:03.475809Z"},"links":{"cited_paper":"/paper/1201.1214","citing_paper":"/paper/2505.22743"},"observation_digest":"sha256:7d39e25149e148cb66e9707c6fcaaf63fd066a210a44e983e0bce72fcd1ec9f8","observation_id":"8aa43d98-2adb-4cd9-af9b-a63943733706","resolution":{"observed_at":"2026-08-07T13:10:03.475809Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1201.1214","last_updated":"2016-08-15T01:17:38Z","snapshot_observed_at":"2026-07-06T02:40:28.120346Z","submitted_at":"2012-01-05T16:39:21Z","title":"Statistical Algorithms and a Lower Bound for Detecting Planted Clique","version":6},"cited_work":{"arxiv_id":"1201.1214","doi":null,"metadata_source":"pith","pith_arxiv_id":"1201.1214","snapshot_observed_at":"2026-07-10T05:46:50.329286Z","title":"Statistical Algorithms and a Lower Bound for Detecting Planted Clique","venue":"cs.CC","work_id":"cc5ac419-10ae-41c2-8c0e-75c45a0db1db","year":2012},"citing_paper":{"arxiv_id":"2607.08538","last_updated":"2026-07-09T14:33:47Z","snapshot_observed_at":"2026-08-02T08:52:19.720619Z","submitted_at":"2026-07-09T14:33:47Z","title":"High-Dimensional Procrustes Matching via Tree Counts","version":1},"reference_index":124,"source":"arxiv_source","source_observed_at":"2026-07-10T05:43:54.305661Z"},"links":{"cited_paper":"/paper/1201.1214","citing_paper":"/paper/2607.08538"},"observation_digest":"sha256:36b04c10b6aeeed177af136acf2af63a9d6572f4381b8a9890d4bfc1260ff8d9","observation_id":"058c852a-8e68-4421-bb86-a86c5e5dbfae","resolution":{"observed_at":"2026-07-10T05:46:50.330443Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/1201.1214/citation-record","integrity":"/paper/1201.1214/integrity","json":"/paper/1201.1214/citation-record.json","paper":"/paper/1201.1214"},"outbound":[],"paper":{"arxiv_id":"1201.1214","last_updated":"2016-08-15T01:17:38Z","latest_version":6,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T02:40:28.120346Z","submitted_at":"2012-01-05T16:39:21Z","title":"Statistical Algorithms and a Lower Bound for Detecting 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-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 2 inbound Pith citation observations for arXiv:1201.1214."}