{"as_of":"2026-08-16T21:05:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:762c4d5bc0c14db445e000fdfddfbf79623cbf1f049d60c2739cd659e4f5b101","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":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:19:06.098527Z","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-02T05:56:40.067406Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1801.00518","last_updated":"2018-01-01T21:53:55Z","snapshot_observed_at":"2026-08-14T19:58:44.282563Z","submitted_at":"2018-01-01T21:53:55Z","title":"Statistical and Computational Limits for Sparse Matrix Detection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.00518","snapshot_observed_at":"2026-08-14T14:28:56.919264Z","title":"Tony Cai and Yihong Wu","venue":null,"work_id":null,"year":null},"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":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:28:56.919264Z"},"links":{"cited_paper":"/paper/1801.00518","citing_paper":"/paper/1908.06130"},"observation_digest":"sha256:2d88aacb6b320dc730a9e1f87529eb67125e9bffff059d7b997799b126fdac31","observation_id":"938d010d-2033-4a50-8713-d9ebefbb3c6b","resolution":{"observed_at":"2026-08-14T14:28:56.919264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.00518","last_updated":"2018-01-01T21:53:55Z","snapshot_observed_at":"2026-08-14T19:58:44.282563Z","submitted_at":"2018-01-01T21:53:55Z","title":"Statistical and Computational Limits for Sparse Matrix Detection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.00518","snapshot_observed_at":"2026-08-16T04:19:06.098527Z","title":"Subexponential-time algo- rithms for sparse PCA","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.01990","last_updated":"2025-07-19T00:31:14Z","snapshot_observed_at":"2026-08-16T04:01:59.768514Z","submitted_at":"2025-05-04T05:36:07Z","title":"On optimal distinguishers for Planted Clique","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T04:19:06.098527Z"},"links":{"cited_paper":"/paper/1801.00518","citing_paper":"/paper/2505.01990"},"observation_digest":"sha256:023c72db6f08003e93442ade77f29c6173f497ea2c031d09c4ca1ed3c598ccb3","observation_id":"d57676fa-7e69-4cb6-bda0-54e633fc7407","resolution":{"observed_at":"2026-08-16T04:19:06.098527Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1801.00518","last_updated":"2018-01-01T21:53:55Z","snapshot_observed_at":"2026-08-14T19:58:44.282563Z","submitted_at":"2018-01-01T21:53:55Z","title":"Statistical and Computational Limits for Sparse Matrix Detection","version":1},"cited_work":{"arxiv_id":"1801.00518","doi":null,"metadata_source":"pith","pith_arxiv_id":"1801.00518","snapshot_observed_at":"2026-07-02T05:56:40.067406Z","title":"Statistical and Computational Limits for Sparse Matrix Detection","venue":"math.ST","work_id":"9d8bdebb-19e4-4fda-a774-1cf55a3dd7b9","year":2018},"citing_paper":{"arxiv_id":"2607.00897","last_updated":"2026-07-01T13:02:12Z","snapshot_observed_at":"2026-08-14T20:26:06.599729Z","submitted_at":"2026-07-01T13:02:12Z","title":"Recovery of Planted Subgraphs","version":1},"reference_index":223,"source":"arxiv_source","source_observed_at":"2026-07-02T05:49:41.894386Z"},"links":{"cited_paper":"/paper/1801.00518","citing_paper":"/paper/2607.00897"},"observation_digest":"sha256:e8726a7799d21846858531b1795cb6bfeb93314898cb631d1958ad52ca9a302f","observation_id":"c4cf03c4-0969-42a9-a74b-ce2bfbf1e951","resolution":{"observed_at":"2026-07-02T05:56:40.068941Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"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":"1801.00518","last_updated":"2018-01-01T21:53:55Z","snapshot_observed_at":"2026-08-14T19:58:44.282563Z","submitted_at":"2018-01-01T21:53:55Z","title":"Statistical and Computational Limits for Sparse Matrix Detection","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1801.00518","snapshot_observed_at":"2026-08-01T19:10:36.525901Z","title":"arXiv preprint arXiv:1801.00518 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.17118","last_updated":"2026-07-19T08:09:08Z","snapshot_observed_at":"2026-08-09T21:09:23.816084Z","submitted_at":"2026-07-19T08:09:08Z","title":"Fundamental Limits of Query-Based Subgraph Detection","version":1},"reference_index":225,"source":"arxiv_source","source_observed_at":"2026-08-01T19:10:36.525901Z"},"links":{"cited_paper":"/paper/1801.00518","citing_paper":"/paper/2607.17118"},"observation_digest":"sha256:88decd48cf52f91b1743744b359e58b5329972d805532d711d96ca655c0ee1a1","observation_id":"14fed112-db0c-41bc-b3d5-e032eaeb6bcd","resolution":{"observed_at":"2026-08-01T19:10:36.525901Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1801.00518/citation-record","integrity":"/paper/1801.00518/integrity","json":"/paper/1801.00518/citation-record.json","paper":"/paper/1801.00518"},"outbound":[],"paper":{"arxiv_id":"1801.00518","last_updated":"2018-01-01T21:53:55Z","latest_version":1,"primary_category":"math.ST","snapshot_observed_at":"2026-08-14T19:58:44.282563Z","submitted_at":"2018-01-01T21:53:55Z","title":"Statistical and Computational Limits for Sparse Matrix 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 4 inbound Pith citation observations for arXiv:1801.00518."}