{"as_of":"2026-08-16T17:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:04e1940d94410520e5d4ab34f3edde005c7e2bdee6e7b95dba2fbc00b944d1d4","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-16T06:30:59.297886+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-14T11:12:33.871828Z","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-24T15:09:36.813573Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1806.07508","last_updated":"2019-11-18T16:17:41Z","snapshot_observed_at":"2026-08-16T16:26:10.100149Z","submitted_at":"2018-06-19T23:48:25Z","title":"Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure","version":2},"cited_work":{"arxiv_id":"1806.07508","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1806.07508","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"R educibility and compu- tational lower bounds for problems with planted sparse stru cture","venue":null,"work_id":"8235bbcc-2fbe-422b-9c5c-d0614e9bb153","year":null},"citing_paper":{"arxiv_id":"1907.11636","last_updated":"2019-07-26T15:46:05Z","snapshot_observed_at":"2026-08-14T18:14:22.710933Z","submitted_at":"2019-07-26T15:46:05Z","title":"Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-05-24T15:08:21.512072Z"},"links":{"cited_paper":"/paper/1806.07508","citing_paper":"/paper/1907.11636"},"observation_digest":"sha256:28964c326d4e2738e2111e24e7b9ff742ecf2312b13b3d3b843e3f49c09c0462","observation_id":"1c8f95dd-2894-4630-b607-c8e4ca1bb108","resolution":{"observed_at":"2026-05-24T15:09:36.815853Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.07508","last_updated":"2019-11-18T16:17:41Z","snapshot_observed_at":"2026-08-16T16:26:10.100149Z","submitted_at":"2018-06-19T23:48:25Z","title":"Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.07508","snapshot_observed_at":"2026-08-14T11:12:33.871828Z","title":"Reducibility and computational lower bounds for problems with planted sparse structure","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.09959","last_updated":"2020-12-13T03:09:41Z","snapshot_observed_at":"2026-08-16T12:03:34.256863Z","submitted_at":"2019-08-26T23:46:07Z","title":"The Overlap Gap Property in Principal Submatrix Recovery","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T11:12:33.871828Z"},"links":{"cited_paper":"/paper/1806.07508","citing_paper":"/paper/1908.09959"},"observation_digest":"sha256:d77c6712a0c4759361d4bfed8f5a5cc0256f35e0c960c578b986eba9ee0d920f","observation_id":"126f4d07-3a22-4ffc-b226-2617fe47bd84","resolution":{"observed_at":"2026-08-14T11:12:33.871828Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1806.07508/citation-record","integrity":"/paper/1806.07508/integrity","json":"/paper/1806.07508/citation-record.json","paper":"/paper/1806.07508"},"outbound":[],"paper":{"arxiv_id":"1806.07508","last_updated":"2019-11-18T16:17:41Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-16T16:26:10.100149Z","submitted_at":"2018-06-19T23:48:25Z","title":"Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure"},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1806.07508."}