{"as_of":"2026-08-14T11:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4dcc7a6e37565dad0d9bc6dd1e52d1ffc19d59e187d979bfcef5ee0b88caaa0a","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T23:08:28.089283Z","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-11T08:16:01.418226Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2105.15081","last_updated":"2022-10-13T06:08:00Z","snapshot_observed_at":"2026-08-13T19:13:07.154302Z","submitted_at":"2021-05-31T16:10:49Z","title":"Optimal Spectral Recovery of a Planted Vector in a Subspace","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.15081","snapshot_observed_at":"2026-08-10T23:08:28.089283Z","title":"Optimization of polynomial functions","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2412.21203","last_updated":"2024-12-30T18:59:46Z","snapshot_observed_at":"2026-08-13T08:45:18.036631Z","submitted_at":"2024-12-30T18:59:46Z","title":"SoS Certificates for Sparse Singular Values and Their Applications: Robust Statistics, Subspace Distortion, and More","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T23:08:28.089283Z"},"links":{"cited_paper":"/paper/2105.15081","citing_paper":"/paper/2412.21203"},"observation_digest":"sha256:b07931c2110b03731b467a50a1447bf771b16340e23da1bdded51c87f9291112","observation_id":"8bead756-fb7d-4c01-afab-83e9f53b086a","resolution":{"observed_at":"2026-08-10T23:08:28.089283Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.15081","last_updated":"2022-10-13T06:08:00Z","snapshot_observed_at":"2026-08-13T19:13:07.154302Z","submitted_at":"2021-05-31T16:10:49Z","title":"Optimal Spectral Recovery of a Planted Vector in a Subspace","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2105.15081","snapshot_observed_at":"2026-08-09T11:38:49.811350Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.02668","last_updated":"2025-06-30T11:52:00Z","snapshot_observed_at":"2026-08-13T08:45:55.353289Z","submitted_at":"2025-02-04T19:18:17Z","title":"Recovering Imbalanced Clusters via Gradient-Based Projection Pursuit","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T11:38:49.811350Z"},"links":{"cited_paper":"/paper/2105.15081","citing_paper":"/paper/2502.02668"},"observation_digest":"sha256:d1e31366e37a963c838267d8219962cc692666c38fba6a7815131b5dab49382e","observation_id":"08a249df-4055-403a-8c23-defa26b80c89","resolution":{"observed_at":"2026-08-09T11:38:49.811350Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2105.15081","last_updated":"2022-10-13T06:08:00Z","snapshot_observed_at":"2026-08-13T19:13:07.154302Z","submitted_at":"2021-05-31T16:10:49Z","title":"Optimal Spectral Recovery of a Planted Vector in a Subspace","version":2},"cited_work":{"arxiv_id":"2105.15081","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2105.15081","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Optimal spectral recovery of a planted vector in a subspace.arXiv preprint arXiv:2105.15081","venue":null,"work_id":"bb5beaf0-1a93-41d4-8fbc-0b165dd8bf90","year":null},"citing_paper":{"arxiv_id":"2604.10457","last_updated":"2026-04-12T04:41:44Z","snapshot_observed_at":"2026-08-03T00:42:32.613487Z","submitted_at":"2026-04-12T04:41:44Z","title":"Near Optimal Algorithms for Noisy $k$-XOR under Low-Degree Heuristic","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-05-10T16:44:24.061591Z"},"links":{"cited_paper":"/paper/2105.15081","citing_paper":"/paper/2604.10457"},"observation_digest":"sha256:a87416e725f46f3bc0a5ade7a3e4c2f3dd1c774bab2d5de306554ea8468c593f","observation_id":"9757a857-1e13-454a-828a-f82a6b6f4e44","resolution":{"observed_at":"2026-05-11T08:16:01.422464Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2105.15081/citation-record","integrity":"/paper/2105.15081/integrity","json":"/paper/2105.15081/citation-record.json","paper":"/paper/2105.15081"},"outbound":[],"paper":{"arxiv_id":"2105.15081","last_updated":"2022-10-13T06:08:00Z","latest_version":2,"primary_category":"math.ST","snapshot_observed_at":"2026-08-13T19:13:07.154302Z","submitted_at":"2021-05-31T16:10:49Z","title":"Optimal Spectral Recovery of a Planted Vector in a Subspace"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2105.15081."}