{"as_of":"2026-08-10T14:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d0f64e287cdc59cc3f98cac698467f7b2e1af7855a785cd93cc6427bec78dedd","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-10T06:31:04.303077+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.604208Z","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-11T06:11:00.593343Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1311.4821","last_updated":"2018-03-06T18:24:11Z","snapshot_observed_at":"2026-07-06T03:28:39.762577Z","submitted_at":"2013-11-19T18:13:32Z","title":"On the Complexity of Random Satisfiability Problems with Planted Solutions","version":8},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1311.4821","snapshot_observed_at":"2026-08-07T13:10:03.604208Z","title":"77–86, 2015, 1311.4821","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.22743","last_updated":"2025-06-17T05:24:14Z","snapshot_observed_at":"2026-08-09T05:12:45.044052Z","submitted_at":"2025-05-28T18:04:10Z","title":"Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:03.604208Z"},"links":{"cited_paper":"/paper/1311.4821","citing_paper":"/paper/2505.22743"},"observation_digest":"sha256:9113d434460852cead2db8a11b7e8151da4fd324771e5618731675caa98f971d","observation_id":"bca273e7-8639-4353-b4f8-a62d467b46c1","resolution":{"observed_at":"2026-08-07T13:10:03.604208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1311.4821","last_updated":"2018-03-06T18:24:11Z","snapshot_observed_at":"2026-07-06T03:28:39.762577Z","submitted_at":"2013-11-19T18:13:32Z","title":"On the Complexity of Random Satisfiability Problems with Planted Solutions","version":8},"cited_work":{"arxiv_id":"1311.4821","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1311.4821","snapshot_observed_at":"2026-07-04T22:35:34.759044Z","title":"Feldman, W","venue":null,"work_id":"573f3546-ab1b-47ad-b316-56d433c5fccd","year":2018},"citing_paper":{"arxiv_id":"2604.09837","last_updated":"2026-04-10T19:09:24Z","snapshot_observed_at":"2026-07-31T13:18:33.420591Z","submitted_at":"2026-04-10T19:09:24Z","title":"Planted-solution SAT and Ising benchmarks from integer factorization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-10T17:46:21.888150Z"},"links":{"cited_paper":"/paper/1311.4821","citing_paper":"/paper/2604.09837"},"observation_digest":"sha256:af673d448943930cbf44021de4bd6c35b7d12715d5838731a2fa002f3ca1a4c4","observation_id":"5991f15e-521f-42de-a277-eec71320ebb4","resolution":{"observed_at":"2026-07-04T22:35:34.759044Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/1311.4821/citation-record","integrity":"/paper/1311.4821/integrity","json":"/paper/1311.4821/citation-record.json","paper":"/paper/1311.4821"},"outbound":[],"paper":{"arxiv_id":"1311.4821","last_updated":"2018-03-06T18:24:11Z","latest_version":8,"primary_category":"cs.CC","snapshot_observed_at":"2026-07-06T03:28:39.762577Z","submitted_at":"2013-11-19T18:13:32Z","title":"On the Complexity of Random Satisfiability Problems with Planted Solutions"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1311.4821."}