{"as_of":"2026-08-16T17:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a8fc3aca8dea27680d0cd1363090c42c16133e44214e7ace252ce155e53cf24d","coverage":[{"denominator":8,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T04:19:06.120753Z","state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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-07T04:24:26.769422Z","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-07T04:24:27.370984Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"2505.01990","doi":null,"metadata_source":"pith","pith_arxiv_id":"2505.01990","snapshot_observed_at":"2026-08-07T04:24:27.370984Z","title":"On optimal distinguishers for Planted Clique","venue":"cs.CC","work_id":"fb3a98e9-2713-4702-b309-4d7022ac5739","year":2025},"citing_paper":{"arxiv_id":"2506.10748","last_updated":"2025-06-12T14:35:26Z","snapshot_observed_at":"2026-08-14T18:28:43.937637Z","submitted_at":"2025-06-12T14:35:26Z","title":"Computational Complexity of Statistics: New Insights from Low-Degree Polynomials","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:26.769422Z"},"links":{"cited_paper":"/paper/2505.01990","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:98e2207f4ce258e646dfec346a1a959176fcc76d5a75a09e48bcb725a46d1138","observation_id":"0bc14466-8979-4a90-95c0-71bd3008e608","resolution":{"observed_at":"2026-08-07T04:24:27.443334Z","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/2505.01990/citation-record","integrity":"/paper/2505.01990/integrity","json":"/paper/2505.01990/citation-record.json","paper":"/paper/2505.01990"},"outbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"1908.06130","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.06130","snapshot_observed_at":"2026-08-16T04:19:06.390370Z","title":"Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries","venue":"cs.CC","work_id":"59d1caec-0263-4958-b94b-0d357b2c5924","year":2019},"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":1,"source":"pdf_text","source_observed_at":"2026-08-16T04:19:06.079763Z"},"links":{"cited_paper":"/paper/1908.06130","citing_paper":"/paper/2505.01990"},"observation_digest":"sha256:2b6e68fd2951676fc97fa86d4a97e015679c1f0485e2c152df38d60a90aa9880","observation_id":"ba456929-224c-425b-ba5e-ea3aae6d2e8d","resolution":{"observed_at":"2026-08-16T04:19:06.395889Z","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":"2009.06107","last_updated":"2021-06-26T17:06:23Z","snapshot_observed_at":"2026-08-14T07:16:38.901682Z","submitted_at":"2020-09-13T22:55:18Z","title":"Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.06107","snapshot_observed_at":"2026-08-16T04:19:06.092175Z","title":"Complexity theoretic lower bounds for sparse principal component detection","venue":null,"work_id":null,"year":2020},"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":2,"source":"pdf_text","source_observed_at":"2026-08-16T04:19:06.092175Z"},"links":{"cited_paper":"/paper/2009.06107","citing_paper":"/paper/2505.01990"},"observation_digest":"sha256:24dff63a9054e7b506a815bee1ac33655eb996277dc0b3cc34a9113397db1571","observation_id":"dd8b7f49-7561-4e9a-9050-aa17fe9c8364","resolution":{"observed_at":"2026-08-16T04:19:06.092175Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:19:06.104147Z","title":"Large cliques elude the Metropolis process","venue":null,"work_id":null,"year":1992},"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":10,"source":"pdf_text","source_observed_at":"2026-08-16T04:19:06.104147Z"},"links":{"citing_paper":"/paper/2505.01990"},"observation_digest":"sha256:7ac9fa4f23da4e328126b063e800e2569b928337e8a666f669746274f5375f0c","observation_id":"d91a7084-099d-467c-818c-62a6590f0e47","resolution":{"observed_at":"2026-08-16T04:19:06.104147Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T04:19:06.407363Z","title":"Tensor SVD: Statistical and computational limits","venue":null,"work_id":"16ce91cf-75e0-42db-adc5-3c50ae6b6add","year":2018},"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":1982,"source":"pdf_text","source_observed_at":"2026-08-16T04:19:06.120753Z"},"links":{"citing_paper":"/paper/2505.01990"},"observation_digest":"sha256:abeba0dc1706b9c37709d6e618277160df9d4c3027494ba0d6c7602a8718718c","observation_id":"a1ea5637-edcc-4612-a478-b901a31302d4","resolution":{"observed_at":"2026-08-16T04:19:06.413019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1902.07324","last_updated":"2019-04-06T04:46:25Z","snapshot_observed_at":"2026-08-14T18:15:02.720907Z","submitted_at":"2019-02-19T22:18:46Z","title":"Computational Hardness of Certifying Bounds on Constrained PCA Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1902.07324","snapshot_observed_at":"2026-08-16T04:19:06.085725Z","title":"The uniform hardcore lemma via ap- proximate bregman projections","venue":null,"work_id":null,"year":2019},"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":2018,"source":"pdf_text","source_observed_at":"2026-08-16T04:19:06.085725Z"},"links":{"cited_paper":"/paper/1902.07324","citing_paper":"/paper/2505.01990"},"observation_digest":"sha256:5b89d6238b9a86672aefabccf23b38cb1a154332f3067290f208dac98235fbba","observation_id":"9fb2e6eb-8255-4d68-8fb5-58e6cd0c3181","resolution":{"observed_at":"2026-08-16T04:19:06.085725Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1911.01411","last_updated":"2019-11-04T18:53:35Z","snapshot_observed_at":"2026-08-05T12:58:55.915821Z","submitted_at":"2019-11-04T18:53:35Z","title":"Lifting Sum-of-Squares Lower Bounds: Degree-$2$ to Degree-$4$","version":1},"cited_work":{"arxiv_id":"1911.01411","doi":null,"metadata_source":"pith","pith_arxiv_id":"1911.01411","snapshot_observed_at":"2026-08-16T04:19:06.179549Z","title":"Lifting Sum-of-Squares Lower Bounds: Degree-$2$ to Degree-$4$","venue":"cs.CC","work_id":"768fa034-ecc7-4a68-95ac-94c05afab56a","year":2019},"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":2019,"source":"pdf_text","source_observed_at":"2026-08-16T04:19:06.110002Z"},"links":{"cited_paper":"/paper/1911.01411","citing_paper":"/paper/2505.01990"},"observation_digest":"sha256:d8c41581c88660a0e4ba4bf99bd06a88c3a2434e371fdee2f1d596d5c67d40b1","observation_id":"a96ce5d7-0760-4183-aab3-dc75293c1bb6","resolution":{"observed_at":"2026-08-16T04:19:06.186477Z","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":"2311.00289","last_updated":"2025-04-24T17:02:02Z","snapshot_observed_at":"2026-08-16T14:46:58.865566Z","submitted_at":"2023-11-01T04:41:16Z","title":"Precise Error Rates for Computationally Efficient Testing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.00289","snapshot_observed_at":"2026-08-16T04:19:06.115920Z","title":"Average-case hardness of RIP cer- tification","venue":null,"work_id":null,"year":2016},"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":2023,"source":"pdf_text","source_observed_at":"2026-08-16T04:19:06.115920Z"},"links":{"cited_paper":"/paper/2311.00289","citing_paper":"/paper/2505.01990"},"observation_digest":"sha256:122cf5e0cb02ea8dd7f6991e3f1abb68507b9862eb1140f9fc955c67fd41561e","observation_id":"3a65c40f-2ac0-49a3-8d9d-1963c36c8b00","resolution":{"observed_at":"2026-08-16T04:19:06.115920Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.01990","last_updated":"2025-07-19T00:31:14Z","latest_version":2,"primary_category":"cs.CC","snapshot_observed_at":"2026-08-16T04:01:59.768514Z","submitted_at":"2025-05-04T05:36:07Z","title":"On optimal distinguishers for Planted Clique"},"reference_resolution":{"displayed":8,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":5,"verified_exact":0,"verified_fuzzy":1},"total_outbound_references":8},"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 8 of 8 outbound references and 1 inbound Pith citation observation for arXiv:2505.01990."}