{"as_of":"2026-08-16T17:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c16b32916720f5272527ea13d7541b784cf780d9b3aefd5bf6f2abe6f0977e2a","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-14T14:28:56.886555Z","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-14T11:12:34.270214Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1902.06916","last_updated":"2019-06-01T17:05:34Z","snapshot_observed_at":"2026-08-14T17:14:35.091524Z","submitted_at":"2019-02-19T06:37:02Z","title":"Universality of Computational Lower Bounds for Submatrix Detection","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.06916","snapshot_observed_at":"2026-08-14T14:28:56.886555Z","title":"U niversality of computational lower bounds for submatrix detection","venue":null,"work_id":null,"year":1902},"citing_paper":{"arxiv_id":"1908.06130","last_updated":"2020-05-19T01:20:43Z","snapshot_observed_at":"2026-08-16T13:54:37.785613Z","submitted_at":"2019-08-08T22:14:09Z","title":"Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries","version":2},"reference_index":2018,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.886555Z"},"links":{"cited_paper":"/paper/1902.06916","citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:923c705d538072379ab653cdcd13b030abf101c288b89d70da0f9ce78c8b1cf3","observation_id":"7d6b4a0b-8380-451a-bb8a-0d7b6a3e624a","resolution":{"observed_at":"2026-08-14T14:28:56.886555Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1902.06916","last_updated":"2019-06-01T17:05:34Z","snapshot_observed_at":"2026-08-14T17:14:35.091524Z","submitted_at":"2019-02-19T06:37:02Z","title":"Universality of Computational Lower Bounds for Submatrix Detection","version":3},"cited_work":{"arxiv_id":"1902.06916","doi":null,"metadata_source":"pith","pith_arxiv_id":"1902.06916","snapshot_observed_at":"2026-08-14T11:12:34.270214Z","title":"Universality of Computational Lower Bounds for Submatrix Detection","venue":"math.ST","work_id":"809cce6f-aba0-4c77-96e3-4ce8fd43364e","year":2019},"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":24,"source":"pdf_text","source_observed_at":"2026-08-14T11:12:33.877276Z"},"links":{"cited_paper":"/paper/1902.06916","citing_paper":"/paper/1908.09959"},"observation_digest":"sha256:6b1ba6edbd1d6554e9d27894e371ac831ea8e89c9ccc5b213cd96a504ff6a948","observation_id":"47b8cf61-42fc-4961-a6c6-578056c8cee9","resolution":{"observed_at":"2026-08-14T11:12:34.275263Z","resolver_source":"local_arxiv","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"}}],"links":{"evidence":"/evidence","html":"/paper/1902.06916/citation-record","integrity":"/paper/1902.06916/integrity","json":"/paper/1902.06916/citation-record.json","paper":"/paper/1902.06916"},"outbound":[],"paper":{"arxiv_id":"1902.06916","last_updated":"2019-06-01T17:05:34Z","latest_version":3,"primary_category":"math.ST","snapshot_observed_at":"2026-08-14T17:14:35.091524Z","submitted_at":"2019-02-19T06:37:02Z","title":"Universality of Computational Lower Bounds for Submatrix Detection"},"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:1902.06916."}