{"as_of":"2026-08-11T00:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eff6557d801f69ff8473758a2f3d5198c903e53595b4ea0253b00773288c567b","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:10:03.185902Z","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-08-07T13:10:17.668096Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1907.11635","last_updated":"2022-06-23T17:28:55Z","snapshot_observed_at":"2026-08-04T13:56:18.132076Z","submitted_at":"2019-07-26T15:45:13Z","title":"Subexponential-Time Algorithms for Sparse PCA","version":3},"cited_work":{"arxiv_id":"1907.11635","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.11635","snapshot_observed_at":"2026-08-07T13:10:17.668096Z","title":"Subexponential-Time Algorithms for Sparse PCA","venue":"math.ST","work_id":"3a9ac969-a599-4b14-a4f8-345400fbccc5","year":2019},"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":49,"source":"pdf_text","source_observed_at":"2026-08-07T13:10:03.185902Z"},"links":{"cited_paper":"/paper/1907.11635","citing_paper":"/paper/2505.22743"},"observation_digest":"sha256:a4336a6443cc8fe859c29742e8c5eb612bddf77e1266dee7b0d2b1f39831c26c","observation_id":"a670dacc-6537-46cc-8578-6b0e56b80a91","resolution":{"observed_at":"2026-08-07T13:10:17.792122Z","resolver_source":"local_arxiv","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/1907.11635/citation-record","integrity":"/paper/1907.11635/integrity","json":"/paper/1907.11635/citation-record.json","paper":"/paper/1907.11635"},"outbound":[],"paper":{"arxiv_id":"1907.11635","last_updated":"2022-06-23T17:28:55Z","latest_version":3,"primary_category":"math.ST","snapshot_observed_at":"2026-08-04T13:56:18.132076Z","submitted_at":"2019-07-26T15:45:13Z","title":"Subexponential-Time Algorithms for Sparse PCA"},"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 11 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1907.11635."}