{"as_of":"2026-08-16T23:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4a62aa3807b6b3ccea8e9b04d62d40544b03b3f8f568bb465de55e93a04be947","coverage":[{"denominator":48,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":48,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:24:27.226304Z","state":"measured"},{"denominator":61,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":61,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":13,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T12:53:33.766327Z","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-10T05:46:50.306961Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_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},"cited_work":{"arxiv_id":"2506.10748","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.10748","snapshot_observed_at":"2026-07-10T05:46:50.306961Z","title":"Computational complexity of statistics: New insights from low- degree polynomials","venue":"math.ST","work_id":"18253a13-92a6-4fe0-ab5e-7f39680e98ab","year":2025},"citing_paper":{"arxiv_id":"2502.14407","last_updated":"2026-05-14T17:03:15Z","snapshot_observed_at":"2026-07-06T20:39:43.403470Z","submitted_at":"2025-02-20T09:48:26Z","title":"Sharp Phase Transitions in Estimation with Low-Degree Polynomials","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-05-23T02:54:16.701096Z"},"links":{"cited_paper":"/paper/2506.10748","citing_paper":"/paper/2502.14407"},"observation_digest":"sha256:385e45507fbed36d2b2591d4a59cfbb950a1017f04fb71eaeec048b54f9458ae","observation_id":"12d01909-b568-46e7-a21b-239ee02b560d","resolution":{"observed_at":"2026-05-23T02:55:19.434944Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2506.10748","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.10748","snapshot_observed_at":"2026-07-10T05:46:50.306961Z","title":"Computational complexity of statistics: New insights from low- degree polynomials","venue":"math.ST","work_id":"18253a13-92a6-4fe0-ab5e-7f39680e98ab","year":2025},"citing_paper":{"arxiv_id":"2603.26029","last_updated":"2026-04-04T03:25:38Z","snapshot_observed_at":"2026-08-15T08:53:57.455159Z","submitted_at":"2026-03-27T02:59:25Z","title":"Detection Is Harder Than Estimation in Certain Regimes: Inference for Moment and Cumulant Tensors","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-05-14T23:30:25.596266Z"},"links":{"cited_paper":"/paper/2506.10748","citing_paper":"/paper/2603.26029"},"observation_digest":"sha256:c1a07a8b14d9f51e2c885effc948a614081fbf0f2b8cc64e6d3ad091ebfa2e05","observation_id":"51714b5c-4fb4-43dd-a353-e797b45e743f","resolution":{"observed_at":"2026-05-14T23:33:16.402394Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2506.10748","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.10748","snapshot_observed_at":"2026-07-10T05:46:50.306961Z","title":"Computational complexity of statistics: New insights from low- degree polynomials","venue":"math.ST","work_id":"18253a13-92a6-4fe0-ab5e-7f39680e98ab","year":2025},"citing_paper":{"arxiv_id":"2604.06109","last_updated":"2026-04-07T17:20:35Z","snapshot_observed_at":"2026-08-05T13:00:24.386604Z","submitted_at":"2026-04-07T17:20:35Z","title":"Learning $\\mathsf{AC}^0$ Under Graphical Models","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-10T19:45:54.008353Z"},"links":{"cited_paper":"/paper/2506.10748","citing_paper":"/paper/2604.06109"},"observation_digest":"sha256:4c904ba20792d4157255ee9450517cfc3250b3aa07479aad7addb9bd35f32378","observation_id":"bd754b22-1415-4cdf-a037-7570f3447668","resolution":{"observed_at":"2026-05-10T22:30:52.927246Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2506.10748","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.10748","snapshot_observed_at":"2026-07-10T05:46:50.306961Z","title":"Computational complexity of statistics: New insights from low- degree polynomials","venue":"math.ST","work_id":"18253a13-92a6-4fe0-ab5e-7f39680e98ab","year":2025},"citing_paper":{"arxiv_id":"2604.17410","last_updated":"2026-04-19T12:34:09Z","snapshot_observed_at":"2026-07-06T23:04:32.734175Z","submitted_at":"2026-04-19T12:34:09Z","title":"Algorithmic Contiguity from Low-Degree Heuristic II: Predicting Detection-Recovery Gaps","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-10T05:43:13.646748Z"},"links":{"cited_paper":"/paper/2506.10748","citing_paper":"/paper/2604.17410"},"observation_digest":"sha256:9d944e5c08a79c889a5fc4ce7b448761990eb957a92845f9b9cb3b1def7cdc0d","observation_id":"abdf8e58-2511-43c7-bde6-acfffcfb9d75","resolution":{"observed_at":"2026-05-10T05:51:10.596891Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2506.10748","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.10748","snapshot_observed_at":"2026-07-10T05:46:50.306961Z","title":"Computational complexity of statistics: New insights from low- degree polynomials","venue":"math.ST","work_id":"18253a13-92a6-4fe0-ab5e-7f39680e98ab","year":2025},"citing_paper":{"arxiv_id":"2605.05618","last_updated":"2026-05-07T03:17:33Z","snapshot_observed_at":"2026-08-14T18:29:33.852224Z","submitted_at":"2026-05-07T03:17:33Z","title":"Algorithmic Phase Transition for Large Independent Sets in Dense Hypergraphs","version":1},"reference_index":107,"source":"pdf_text","source_observed_at":"2026-05-08T06:21:23.923750Z"},"links":{"cited_paper":"/paper/2506.10748","citing_paper":"/paper/2605.05618"},"observation_digest":"sha256:195d9bb94f292c260b745ff2849c54c7f87eecdf7c5eab34a0022eede1577094","observation_id":"baba80e9-3eb1-42e1-a50e-61c48859bf78","resolution":{"observed_at":"2026-05-11T21:11:20.535510Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2506.10748","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.10748","snapshot_observed_at":"2026-07-10T05:46:50.306961Z","title":"Computational complexity of statistics: New insights from low- degree polynomials","venue":"math.ST","work_id":"18253a13-92a6-4fe0-ab5e-7f39680e98ab","year":2025},"citing_paper":{"arxiv_id":"2605.18042","last_updated":"2026-05-18T08:34:07Z","snapshot_observed_at":"2026-08-16T08:06:25.983386Z","submitted_at":"2026-05-18T08:34:07Z","title":"On efficient robust regression with subquadratic samples","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-05-20T01:02:31.290353Z"},"links":{"cited_paper":"/paper/2506.10748","citing_paper":"/paper/2605.18042"},"observation_digest":"sha256:b4c4a3734ff7867fcb1fcf27a0013c79e5b5f820aad17a97c00e1014c073f3f9","observation_id":"e9a072ee-be62-4ed1-aebe-75c7bd794237","resolution":{"observed_at":"2026-05-20T01:02:54.314746Z","resolver_source":"arxiv_id","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":"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},"cited_work":{"arxiv_id":"2506.10748","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.10748","snapshot_observed_at":"2026-07-10T05:46:50.306961Z","title":"Computational complexity of statistics: New insights from low- degree polynomials","venue":"math.ST","work_id":"18253a13-92a6-4fe0-ab5e-7f39680e98ab","year":2025},"citing_paper":{"arxiv_id":"2605.21360","last_updated":"2026-05-20T16:24:54Z","snapshot_observed_at":"2026-07-06T23:31:51.443407Z","submitted_at":"2026-05-20T16:24:54Z","title":"Linear Functional Testing with General Loadings in Sparse Regression: Separation Rates and Computational Barriers","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-05-21T03:10:11.335336Z"},"links":{"cited_paper":"/paper/2506.10748","citing_paper":"/paper/2605.21360"},"observation_digest":"sha256:6101d53b6d6b23a45adb1c09f69fb767fab7aba5e23cd502fdf743b096485ad0","observation_id":"189e5ef3-7307-4468-95a2-31d6c4dbfa14","resolution":{"observed_at":"2026-05-21T03:13:56.136374Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2506.10748","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.10748","snapshot_observed_at":"2026-07-10T05:46:50.306961Z","title":"Computational complexity of statistics: New insights from low- degree polynomials","venue":"math.ST","work_id":"18253a13-92a6-4fe0-ab5e-7f39680e98ab","year":2025},"citing_paper":{"arxiv_id":"2605.30113","last_updated":"2026-05-28T15:49:59Z","snapshot_observed_at":"2026-08-14T18:29:33.345753Z","submitted_at":"2026-05-28T15:49:59Z","title":"Low-degree estimation thresholds in planted hypergraphs and tensor PCA","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-29T00:02:41.365005Z"},"links":{"cited_paper":"/paper/2506.10748","citing_paper":"/paper/2605.30113"},"observation_digest":"sha256:b6ba101b91ca955cf02e9b4a8ef982d71ee74fae87e1aa9e71f326dacd97a3ca","observation_id":"8dda36ca-6ebe-42d7-a026-577f2bc90a14","resolution":{"observed_at":"2026-06-29T00:02:49.580380Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2506.10748","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.10748","snapshot_observed_at":"2026-07-10T05:46:50.306961Z","title":"Computational complexity of statistics: New insights from low- degree polynomials","venue":"math.ST","work_id":"18253a13-92a6-4fe0-ab5e-7f39680e98ab","year":2025},"citing_paper":{"arxiv_id":"2606.05266","last_updated":"2026-06-03T16:28:30Z","snapshot_observed_at":"2026-08-03T01:30:11.375194Z","submitted_at":"2026-06-03T16:28:30Z","title":"Sharp Low-Degree Thresholds for Planted-vs-Planted Testing","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-06-28T07:25:38.525429Z"},"links":{"cited_paper":"/paper/2506.10748","citing_paper":"/paper/2606.05266"},"observation_digest":"sha256:7b8389039ce96c83b8bdebd9d375b5998d14477bb3b7e3b2f4fe747e57602234","observation_id":"b8b37e8f-976e-4912-9fb8-3c4334b4fa6f","resolution":{"observed_at":"2026-07-02T06:16:43.969695Z","resolver_source":"arxiv_id","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":"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},"cited_work":{"arxiv_id":"2506.10748","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.10748","snapshot_observed_at":"2026-07-10T05:46:50.306961Z","title":"Computational complexity of statistics: New insights from low- degree polynomials","venue":"math.ST","work_id":"18253a13-92a6-4fe0-ab5e-7f39680e98ab","year":2025},"citing_paper":{"arxiv_id":"2606.11149","last_updated":"2026-06-09T17:35:18Z","snapshot_observed_at":"2026-07-06T23:50:16.299969Z","submitted_at":"2026-06-09T17:35:18Z","title":"Efficiently Learning Drifting Halfspaces with Massart Noise","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-06-27T13:43:58.910519Z"},"links":{"cited_paper":"/paper/2506.10748","citing_paper":"/paper/2606.11149"},"observation_digest":"sha256:870cc33e373902899e05d1e10b4c7425a0335e4599171ecc3944a49f56cfccaf","observation_id":"f3b555fd-06bf-4857-b899-1664514cd78d","resolution":{"observed_at":"2026-07-03T04:37:37.614296Z","resolver_source":"arxiv_id","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"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":"2506.10748","doi":null,"metadata_source":"pith","pith_arxiv_id":"2506.10748","snapshot_observed_at":"2026-07-10T05:46:50.306961Z","title":"Computational complexity of statistics: New insights from low- degree polynomials","venue":"math.ST","work_id":"18253a13-92a6-4fe0-ab5e-7f39680e98ab","year":2025},"citing_paper":{"arxiv_id":"2607.08538","last_updated":"2026-07-09T14:33:47Z","snapshot_observed_at":"2026-08-14T18:29:35.959769Z","submitted_at":"2026-07-09T14:33:47Z","title":"High-Dimensional Procrustes Matching via Tree Counts","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-07-10T05:43:54.305661Z"},"links":{"cited_paper":"/paper/2506.10748","citing_paper":"/paper/2607.08538"},"observation_digest":"sha256:ec0c86ebac3fede3c9671448887f080d8286ac451cd8d0dee454ab7ffe1f8840","observation_id":"6bb99042-fc29-4c64-bd5a-d8b233f10a98","resolution":{"observed_at":"2026-07-10T05:46:50.309079Z","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":"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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10748","snapshot_observed_at":"2026-08-01T12:53:33.766327Z","title":"arXiv preprint arXiv:2506.10748 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.19342","last_updated":"2026-07-21T17:59:04Z","snapshot_observed_at":"2026-08-14T18:29:37.485705Z","submitted_at":"2026-07-21T17:59:04Z","title":"Improved Strongly Polynomial Work-Span Tradeoffs for Directed Single Source Shortest Paths","version":1},"reference_index":143,"source":"arxiv_source","source_observed_at":"2026-08-01T12:53:33.766327Z"},"links":{"cited_paper":"/paper/2506.10748","citing_paper":"/paper/2607.19342"},"observation_digest":"sha256:e335d6e812c9b34260df8b70fd25e4616ec73e0052cfd645798ffdbef186147c","observation_id":"5740d9d7-7c27-4706-85c4-066cbc407d5b","resolution":{"observed_at":"2026-08-01T12:53:33.766327Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_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},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.10748","snapshot_observed_at":"2026-08-01T10:21:09.312369Z","title":"Wein , title =","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.20318","last_updated":"2026-07-22T16:04:22Z","snapshot_observed_at":"2026-08-15T16:52:18.041381Z","submitted_at":"2026-07-22T16:04:22Z","title":"The Polynomial-Time Low-Degree Conjecture is False","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T10:21:09.312369Z"},"links":{"cited_paper":"/paper/2506.10748","citing_paper":"/paper/2607.20318"},"observation_digest":"sha256:dd3c7275ffc07cd1edb08b3debccd450a1691b8a29f1389bd5f81657a2362209","observation_id":"51c7cf9c-caeb-44f5-a99d-19015f82bb89","resolution":{"observed_at":"2026-08-01T10:21:09.312369Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2506.10748/citation-record","integrity":"/paper/2506.10748/integrity","json":"/paper/2506.10748/citation-record.json","paper":"/paper/2506.10748"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:24:24.439592Z","title":"Algorithmic universality, low-degree poly- nomials, and max-cut in sparse random graphs","venue":null,"work_id":null,"year":null},"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":10,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:24.439592Z"},"links":{"citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:55a356796534bad06dfcafe3a7fd46115346c8012d3ba9266abd12423ed26593","observation_id":"8127156f-ca78-4b20-9380-cd2448d410f7","resolution":{"observed_at":"2026-08-07T04:24:24.439592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.22743","last_updated":"2025-06-17T05:24:14Z","snapshot_observed_at":"2026-08-14T18:27:42.694549Z","submitted_at":"2025-05-28T18:04:10Z","title":"Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.22743","snapshot_observed_at":"2026-08-07T04:24:24.520500Z","title":"Information- computation gaps in quantum learning via low-degree likelihood","venue":null,"work_id":null,"year":null},"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":11,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:24.520500Z"},"links":{"cited_paper":"/paper/2505.22743","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:0b662df06bdf1073e41147d7f53a33fc6bb462240654879090f5b756ae93359b","observation_id":"87027f6b-6824-45e5-920c-0d7bf7dbfdd8","resolution":{"observed_at":"2026-08-07T04:24:24.520500Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.03047","last_updated":"2025-06-11T17:18:47Z","snapshot_observed_at":"2026-08-16T12:53:02.987442Z","submitted_at":"2025-03-04T23:08:51Z","title":"Stochastic block models with many communities and the Kesten--Stigum bound","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.03047","snapshot_observed_at":"2026-08-07T04:24:24.580870Z","title":"Stochastic block models with many communities and the Kesten–Stigum bound","venue":null,"work_id":null,"year":null},"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":12,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:24.580870Z"},"links":{"cited_paper":"/paper/2503.03047","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:c674eb0a52d4b4f3ad2505f5bcecfe61bb6044badd323d3a88184f71cbce0100","observation_id":"45251f6b-cd6e-4451-aa14-281d5e9ddd67","resolution":{"observed_at":"2026-08-07T04:24:24.580870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2506.06259","last_updated":"2025-06-06T17:39:32Z","snapshot_observed_at":"2026-08-10T19:38:00.186819Z","submitted_at":"2025-06-06T17:39:32Z","title":"An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.06259","snapshot_observed_at":"2026-08-07T04:24:24.671125Z","title":"An optimized Franz-Parisi criterion and its equivalence with SQ lower bounds","venue":null,"work_id":null,"year":null},"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":13,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:24.671125Z"},"links":{"cited_paper":"/paper/2506.06259","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:1e3a084ff80872d0f4c08260437034373122c78e9fbf9c7fc499658fed58752e","observation_id":"975c7fce-92aa-4c05-bc50-3e84d9ffd1b9","resolution":{"observed_at":"2026-08-07T04:24:24.671125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.00746","last_updated":"2025-07-08T21:14:36Z","snapshot_observed_at":"2026-08-16T13:29:08.881959Z","submitted_at":"2024-08-01T17:49:55Z","title":"On the Low-Temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.00746","snapshot_observed_at":"2026-08-07T04:24:24.717183Z","title":"On the low-temperature MCMC threshold: the cases of sparse tensor PCA, sparse regression, and a geometric rule","venue":null,"work_id":null,"year":null},"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":14,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:24.717183Z"},"links":{"cited_paper":"/paper/2408.00746","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:f01219c503d3952d25a99839e56157d03517042cd4817414ca9da877fb4f3551","observation_id":"42cdbcd2-d77d-4cf7-922a-2f09f0aed989","resolution":{"observed_at":"2026-08-07T04:24:24.717183Z","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-07T04:24:24.812597Z","title":"Low-degree hardness of detection for corre- lated Erd˝ os-R´ enyi graphs.arXiv preprint arXiv:2311.15931 ,","venue":null,"work_id":null,"year":null},"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":15,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:24.812597Z"},"links":{"citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:b35b68b6e0d3f2f027a6ab8938e7813365f2894e1bbee59335f16bd819bb9e6f","observation_id":"d80886c4-9e70-46f7-903c-edba91a67bb2","resolution":{"observed_at":"2026-08-07T04:24:24.812597Z","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":"2404.03842","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:24:28.529796Z","title":"The low-degree hardness of finding large inde- pendent sets in sparse random hypergraphs","venue":null,"work_id":"45d2fca4-e07d-4bfc-8f9d-a24236e2bf8e","year":null},"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":17,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:24.952784Z"},"links":{"citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:cd302394591102b2802618bb3b23b28db9012a966517be1e0eb0b66703b4f302","observation_id":"336d24b9-53dc-44ae-b913-0f17cf72cad4","resolution":{"observed_at":"2026-08-07T04:24:28.535415Z","resolver_source":"raw_fallback","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"}},{"citation":{"cited_paper":{"arxiv_id":"2503.19069","last_updated":"2025-05-18T18:13:59Z","snapshot_observed_at":"2026-08-16T12:47:13.318541Z","submitted_at":"2025-03-24T18:54:43Z","title":"Detecting Arbitrary Planted Subgraphs in Random Graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.19069","snapshot_observed_at":"2026-08-07T04:24:25.015488Z","title":"Detecting arbitrary planted subgraphs in random graphs","venue":null,"work_id":null,"year":null},"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":18,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:25.015488Z"},"links":{"cited_paper":"/paper/2503.19069","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:6e4f4e37776f626e80e02a06a88ff6db0f82c148943a9523089a2ae8b622d744","observation_id":"0d101b51-f463-41d5-bba9-bd2b3b855a3d","resolution":{"observed_at":"2026-08-07T04:24:25.015488Z","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-07T04:24:25.121158Z","title":"Optimal hardness of online algorithms for large independent sets","venue":null,"work_id":null,"year":null},"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":20,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:25.121158Z"},"links":{"citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:7c5cf333a3c5a740525b2377aa0dd9ec32ac08e4d98e93f1c2bdc3f43d447f5f","observation_id":"69afa1e4-555f-4826-875a-b53b8ce71ad5","resolution":{"observed_at":"2026-08-07T04:24:25.121158Z","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-07T04:24:28.934451Z","title":"Disordered systems in- sights on computational hardness","venue":null,"work_id":"19a08c67-52d5-4191-acca-0f0c3ff5e277","year":2022},"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":21,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:25.185855Z"},"links":{"citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:0f8de2e6ab742e7b2939bad513d87e69a0b1cbcc04257667c9b567e6b1bda3ac","observation_id":"e5a83bd1-31bf-4200-b970-e4e39251b971","resolution":{"observed_at":"2026-08-07T04:24:28.938388Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:24:25.252990Z","title":"Optimal low degree hardness for broadcasting on trees","venue":null,"work_id":null,"year":null},"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":22,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:25.252990Z"},"links":{"citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:ee0e915fbacfd02e3d8b7a3ef561b2a6f8109abbc9e2dd2fe6ffff444623826f","observation_id":"61a46ba7-79c3-46a3-8597-3de179c0c6d5","resolution":{"observed_at":"2026-08-07T04:24:25.252990Z","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-07T04:24:25.295266Z","title":"Strong low degree hardness for stable local optima in spin glasses","venue":null,"work_id":null,"year":null},"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":23,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:25.295266Z"},"links":{"citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:6c9eda9b22578dfcb6aeff1a542e8e79471badc9252b90ed5b59cd83f34a9b67","observation_id":"aa3e6856-87d9-47de-98e7-572d8431d809","resolution":{"observed_at":"2026-08-07T04:24:25.295266Z","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-07T04:24:28.914075Z","title":"Sum-of-squares lower bounds for independent set on ultra-sparse random graphs","venue":null,"work_id":"79b5874c-7b48-47d6-b566-051def382fca","year":1923},"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":28,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:25.676431Z"},"links":{"citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:26e5ebbee5924e01768da8d267a25401a4e9e4074cc9faf8cef832487386ae78","observation_id":"5a88e7a8-507f-4d96-b65a-a1e88e556003","resolution":{"observed_at":"2026-08-07T04:24:28.917318Z","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":"2411.19885","last_updated":"2024-11-18T18:20:30Z","snapshot_observed_at":"2026-08-12T20:55:58.591961Z","submitted_at":"2024-11-18T18:20:30Z","title":"Statistical inference of a ranked community in a directed graph","version":1},"cited_work":{"arxiv_id":"2411.19885","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.19885","snapshot_observed_at":"2026-08-07T04:24:28.197974Z","title":"Statistical inference of a ranked community in a directed graph","venue":"math.ST","work_id":"3fa46b32-f7ec-4fba-854c-66cfd2e82024","year":2024},"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":29,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:25.737693Z"},"links":{"cited_paper":"/paper/2411.19885","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:a869a2ce0de4f4003e9efd3fe9274e8ab28a2fbf2a629d823dc0200a88071568","observation_id":"d45f2266-ea15-45af-9c79-964c973d30b1","resolution":{"observed_at":"2026-08-07T04:24:28.201731Z","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":"2412.21155","last_updated":"2024-12-30T18:34:36Z","snapshot_observed_at":"2026-08-12T11:00:03.797879Z","submitted_at":"2024-12-30T18:34:36Z","title":"Low coordinate degree algorithms II: Categorical signals and generalized stochastic block models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.21155","snapshot_observed_at":"2026-08-07T04:24:25.794793Z","title":"Low coordinate degree algorithms II: Categorical signals and gen- eralized stochastic block models","venue":null,"work_id":null,"year":null},"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":30,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:25.794793Z"},"links":{"cited_paper":"/paper/2412.21155","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:bbb93619c767fae2652eb407d471556fc5ba01117ef0dceeddf793b4be701395","observation_id":"339288b1-f36d-4fa1-8c7f-929609163866","resolution":{"observed_at":"2026-08-07T04:24:25.794793Z","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-07T04:24:25.870792Z","title":"Algorithmic contiguity from low-degree conjecture and applications in correlated random graphs","venue":null,"work_id":null,"year":null},"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":31,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:25.870792Z"},"links":{"citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:025e0a46e03dd9db35e45ddffa578bf5db2f6e873134f79233e8e279cb8af20d","observation_id":"691369a3-3c40-48f2-b98f-0ca3b90582f7","resolution":{"observed_at":"2026-08-07T04:24:25.870792Z","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":"2504.03097","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:24:28.044509Z","title":"A computational transition for detecting multivariate shuffled linear regression by low-degree polynomials","venue":null,"work_id":"330ff6ec-9926-4f59-9b3b-b4c089836f7b","year":null},"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":32,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:25.935168Z"},"links":{"citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:82408c142c9eee588f0944f9c49794af57dab2e2646ade516ab71142f59533ce","observation_id":"b9182341-c84a-4bb0-a072-a09df3339213","resolution":{"observed_at":"2026-08-07T04:24:28.106048Z","resolver_source":"raw_fallback","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"}},{"citation":{"cited_paper":{"arxiv_id":"2506.09959","last_updated":"2025-06-11T17:33:25Z","snapshot_observed_at":"2026-08-12T19:41:30.152244Z","submitted_at":"2025-06-11T17:33:25Z","title":"Almost-Optimal Local-Search Methods for Sparse Tensor PCA","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2506.09959","snapshot_observed_at":"2026-08-07T04:24:26.117470Z","title":"Almost-optimal local-search methods for sparse tensor PCA","venue":null,"work_id":null,"year":null},"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":34,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:26.117470Z"},"links":{"cited_paper":"/paper/2506.09959","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:df71b77f539698412a5a1a711172f914fd0a8b3af4027b436f82cf965b05b909","observation_id":"4c286b12-9ef2-4c83-9a0d-a26a217b6af0","resolution":{"observed_at":"2026-08-07T04:24:26.117470Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.04600","last_updated":"2023-06-07T03:25:39Z","snapshot_observed_at":"2026-08-16T16:47:02.913266Z","submitted_at":"2022-07-11T03:16:10Z","title":"Optimal Clustering by Lloyd Algorithm for Low-Rank Mixture Model","version":2},"cited_work":{"arxiv_id":"2207.04600","doi":null,"metadata_source":"pith","pith_arxiv_id":"2207.04600","snapshot_observed_at":"2026-08-07T04:24:27.770720Z","title":"Optimal Clustering by Lloyd Algorithm for Low-Rank Mixture Model","venue":"math.ST","work_id":"4386a297-1d9f-40bb-af03-0df15ae440b6","year":2022},"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":35,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:26.178271Z"},"links":{"cited_paper":"/paper/2207.04600","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:b9753158f472a65de8fede98d30230011e4c30d542b0af4eac37eae19881708f","observation_id":"2798fd47-74ef-47f2-855d-3503e3336b9c","resolution":{"observed_at":"2026-08-07T04:24:27.835686Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2410.09231","last_updated":"2024-10-16T14:20:16Z","snapshot_observed_at":"2026-08-16T13:10:11.050366Z","submitted_at":"2024-10-11T20:08:54Z","title":"On The MCMC Performance In Bernoulli Group Testing And The Random Max Set-Cover Problem","version":2},"cited_work":{"arxiv_id":"2410.09231","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.09231","snapshot_observed_at":"2026-08-07T04:24:27.539710Z","title":"On The MCMC Performance In Bernoulli Group Testing And The Random Max Set-Cover Problem","venue":"math.ST","work_id":"07772bba-3278-437d-9be6-8b502f864296","year":2024},"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":36,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:26.268758Z"},"links":{"cited_paper":"/paper/2410.09231","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:af280779113c2650bb02c7a1e48928a393b196a3f33ed80c36ee4acb7ef8b225","observation_id":"4eeb56e9-3613-47d7-b9f5-d60c58565cfe","resolution":{"observed_at":"2026-08-07T04:24:27.644063Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1806.04343","last_updated":"2019-06-24T09:44:37Z","snapshot_observed_at":"2026-08-14T19:04:54.016870Z","submitted_at":"2018-06-12T05:56:46Z","title":"Phase transitions in spiked matrix estimation: information-theoretic analysis","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.04343","snapshot_observed_at":"2026-08-07T04:24:26.328079Z","title":"Phase transitions in spiked matrix estimation: information-theoretic analysis","venue":null,"work_id":null,"year":null},"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":37,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:26.328079Z"},"links":{"cited_paper":"/paper/1806.04343","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:ae180cf26dfb6a1e760bac940ba25e120b142a4bca0850b6acd0afeeb3fe24c6","observation_id":"117d393f-9e8f-4741-a3f9-a44ec9e1d857","resolution":{"observed_at":"2026-08-07T04:24:26.328079Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.20607","last_updated":"2025-05-27T01:01:36Z","snapshot_observed_at":"2026-08-12T07:01:53.200620Z","submitted_at":"2025-05-27T01:01:36Z","title":"Strong Low Degree Hardness for the Number Partitioning Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.20607","snapshot_observed_at":"2026-08-07T04:24:26.512685Z","title":"Strong low degree hardness for the number parti- tioning problem","venue":null,"work_id":null,"year":null},"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":39,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:26.512685Z"},"links":{"cited_paper":"/paper/2505.20607","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:595d9b383aa0e2100d62f77c03234019d43aaf8b2cfc347c8be9f237983bb06f","observation_id":"ed35b9c8-630c-4115-abc9-fcae816b3e19","resolution":{"observed_at":"2026-08-07T04:24:26.512685Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.15957","last_updated":"2025-02-21T19:38:54Z","snapshot_observed_at":"2026-08-16T13:40:28.034893Z","submitted_at":"2024-06-22T23:08:03Z","title":"Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.15957","snapshot_observed_at":"2026-08-07T04:24:26.601170Z","title":"Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs","venue":null,"work_id":null,"year":null},"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":40,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:26.601170Z"},"links":{"cited_paper":"/paper/2406.15957","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:32768aae6371a5eb518e3fb9a8ae9189fbdd7f47f2b499a324cd6f1ec35c4573","observation_id":"3f45cc4b-f044-472b-bfe7-77f02b42c1f6","resolution":{"observed_at":"2026-08-07T04:24:26.601170Z","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-07T04:24:28.903541Z","title":"Approximate message passing with spec- tral initialization for generalized linear models","venue":null,"work_id":"6e813fa7-1f3e-4c1a-8920-89e1fbbbae59","year":2022},"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":41,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:26.690850Z"},"links":{"citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:241cf10f2894ffaebd4f7c58fffd5261dab4bcd7f3ba0f58e949a64327464e53","observation_id":"e5868bf1-0bb2-4101-8ec6-1946a17f54bb","resolution":{"observed_at":"2026-08-07T04:24:28.907373Z","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":"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"}},{"citation":{"cited_paper":{"arxiv_id":"2011.04253","last_updated":"2023-02-09T23:46:24Z","snapshot_observed_at":"2026-08-16T19:07:15.803014Z","submitted_at":"2020-11-09T08:58:38Z","title":"Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.04253","snapshot_observed_at":"2026-08-07T04:24:26.847273Z","title":"Machinery for proving sum-of-squares lower bounds on certification problems","venue":null,"work_id":null,"year":2011},"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":43,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:26.847273Z"},"links":{"cited_paper":"/paper/2011.04253","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:5f8be1bd626852ac6853ba9960495228d7bff53cc59562a082c8df0335695145","observation_id":"9c4c5a25-2610-4bda-8713-5f773fbe39a3","resolution":{"observed_at":"2026-08-07T04:24:26.847273Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.04632","last_updated":"2025-04-06T22:01:47Z","snapshot_observed_at":"2026-08-16T12:43:32.959338Z","submitted_at":"2025-04-06T22:01:47Z","title":"Tight Low Degree Hardness for Optimizing Pure Spherical Spin Glasses","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.04632","snapshot_observed_at":"2026-08-07T04:24:26.913655Z","title":"Tight low degree hardness for optimizing pure spherical spin glasses","venue":null,"work_id":null,"year":null},"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":44,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:26.913655Z"},"links":{"cited_paper":"/paper/2504.04632","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:f99e05b7e6852aca6cd6d659f430fc2360f0a03e35535f8a06b5d1df05a0f768","observation_id":"08029a3d-dbcf-44bf-b6d9-e2934bcdeebd","resolution":{"observed_at":"2026-08-07T04:24:26.913655Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.14383","last_updated":"2024-10-06T22:10:19Z","snapshot_observed_at":"2026-08-16T14:24:27.827568Z","submitted_at":"2024-01-25T18:40:35Z","title":"Sum-of-Squares & Gaussian Processes I: Certification","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.14383","snapshot_observed_at":"2026-08-07T04:24:26.966629Z","title":"Sum-of-squares & gaussian processes I: Certification","venue":null,"work_id":null,"year":null},"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":45,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:26.966629Z"},"links":{"cited_paper":"/paper/2401.14383","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:f321c9b90de8f1767d3a843f864dc14d3a79da229793a25a665af981fe9b1b64","observation_id":"b268ebf9-8f6e-404e-ab4a-293f2ff3f0f1","resolution":{"observed_at":"2026-08-07T04:24:26.966629Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.14407","last_updated":"2026-05-14T17:03:15Z","snapshot_observed_at":"2026-07-06T20:39:43.403470Z","submitted_at":"2025-02-20T09:48:26Z","title":"Sharp Phase Transitions in Estimation with Low-Degree Polynomials","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.14407","snapshot_observed_at":"2026-08-07T04:24:27.030768Z","title":"Sharp phase transitions in estimation with low-degree polynomials","venue":null,"work_id":null,"year":null},"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":46,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:27.030768Z"},"links":{"cited_paper":"/paper/2502.14407","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:0d22a9d993904864c8ebef9c6db0854b6bdbf72b408a8faea563f767891bfdf8","observation_id":"cc41b965-41c4-4c69-b969-eaac0dab6bdf","resolution":{"observed_at":"2026-08-07T04:24:27.030768Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.07487","last_updated":"2022-03-01T02:31:31Z","snapshot_observed_at":"2026-08-16T17:27:24.155061Z","submitted_at":"2022-01-19T09:22:42Z","title":"A Concise Tutorial on Approximate Message Passing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.07487","snapshot_observed_at":"2026-08-07T04:24:27.226304Z","title":"A concise tutorial on approximate message passing","venue":null,"work_id":null,"year":null},"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":48,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:27.226304Z"},"links":{"cited_paper":"/paper/2201.07487","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:aa9875caaf805997cf25da365b1c5af382a7ba86bce0aed771176bafb0021aa6","observation_id":"8029d2bd-4266-4c6f-a8a6-06ee0dd08c31","resolution":{"observed_at":"2026-08-07T04:24:27.226304Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.03424","last_updated":"2024-06-05T16:20:52Z","snapshot_observed_at":"2026-08-16T13:45:49.261576Z","submitted_at":"2024-06-05T16:20:52Z","title":"Computational lower bounds for multi-frequency group synchronization","version":1},"cited_work":{"arxiv_id":"2406.03424","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.03424","snapshot_observed_at":"2026-08-07T04:24:28.213150Z","title":"Computational lower bounds for multi-frequency group synchronization","venue":"math.ST","work_id":"c9207d62-e876-482b-a7d7-895461374c5d","year":2024},"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":1976,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:25.603443Z"},"links":{"cited_paper":"/paper/2406.03424","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:178d0b3036afa81925d6c7ef55ad4969a71beda6d2143224bdcd4ffb3e54dab1","observation_id":"1e415d23-b62b-4957-813d-18677a3919d9","resolution":{"observed_at":"2026-08-07T04:24:28.216755Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"2411.01836","last_updated":"2025-06-24T04:51:07Z","snapshot_observed_at":"2026-08-16T13:03:18.110385Z","submitted_at":"2024-11-04T06:15:25Z","title":"Some easy optimization problems have the overlap-gap property","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.01836","snapshot_observed_at":"2026-08-07T04:24:26.026517Z","title":"Some easy optimization problems have the overlap-gap property","venue":null,"work_id":null,"year":null},"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":1985,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:26.026517Z"},"links":{"cited_paper":"/paper/2411.01836","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:626c21f984773b14a31afc0ce970b1f65c2629a90447189a876a5b2e6f763020","observation_id":"e0354515-e6f9-4d70-9316-9389ca1a0e59","resolution":{"observed_at":"2026-08-07T04:24:26.026517Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.07881","last_updated":"2024-11-06T16:30:40Z","snapshot_observed_at":"2026-08-16T14:01:40.938959Z","submitted_at":"2024-04-11T16:10:52Z","title":"Fourier Analysis of Iterative Algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.07881","snapshot_observed_at":"2026-08-07T04:24:25.529700Z","title":"Fourier analysis of iterative algorithms","venue":null,"work_id":null,"year":null},"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":2000,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:25.529700Z"},"links":{"cited_paper":"/paper/2404.07881","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:934607cec6c9b680dd709f7deef34b78f4cec7b67e36ecdf74377fce1e7881c6","observation_id":"92f86025-bb2b-45db-83e7-1c1f679b1569","resolution":{"observed_at":"2026-08-07T04:24:25.529700Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.12512","last_updated":"2024-11-19T13:53:43Z","snapshot_observed_at":"2026-08-12T17:24:21.280622Z","submitted_at":"2024-11-19T13:53:43Z","title":"Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations","version":1},"cited_work":{"arxiv_id":"2411.12512","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.12512","snapshot_observed_at":"2026-08-07T04:24:28.892814Z","title":"Near-Optimal Time-Sparsity Trade-Offs for Solving Noisy Linear Equations","venue":"cs.CC","work_id":"735dd2f3-3379-4043-b1ea-8ba1e21174c2","year":2024},"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":2005,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:23.495397Z"},"links":{"cited_paper":"/paper/2411.12512","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:d3908b2dee8205a13fefab144774b86f4ba3c21e5b609678324745bf28808e8b","observation_id":"ac17c1da-afb1-4357-ae43-ec66bac437d3","resolution":{"observed_at":"2026-08-07T04:24:28.896781Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1404.5236","last_updated":"2014-05-27T17:52:52Z","snapshot_observed_at":"2026-08-14T23:36:52.171240Z","submitted_at":"2014-04-21T16:24:13Z","title":"Sum-of-squares proofs and the quest toward optimal algorithms","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1404.5236","snapshot_observed_at":"2026-08-07T04:24:24.119911Z","title":"Sum-of-squares proofs and the quest toward optimal algorithms","venue":null,"work_id":null,"year":null},"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":2006,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:24.119911Z"},"links":{"cited_paper":"/paper/1404.5236","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:bcf2f2a937b47e9a42f95652fd2c7d21d200b2dbc83878e1e620092fc65c4024","observation_id":"e481cb00-aaea-4ee1-8422-cbcc64d0ae84","resolution":{"observed_at":"2026-08-07T04:24:24.119911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.16517","last_updated":"2025-07-28T02:24:56Z","snapshot_observed_at":"2026-08-10T12:39:32.784151Z","submitted_at":"2025-01-27T21:31:01Z","title":"Symmetric Perceptrons, Number Partitioning and Lattices","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.16517","snapshot_observed_at":"2026-08-07T04:24:27.096421Z","title":"Symmetric perceptrons, number partitioning and lattices","venue":null,"work_id":null,"year":null},"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":2008,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:27.096421Z"},"links":{"cited_paper":"/paper/2501.16517","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:4d5109511b0c5b31292a19f7b63ad29c86e987404355ed3b439096aaedcf835f","observation_id":"9b1e8f82-daa4-491b-a04a-86a075442119","resolution":{"observed_at":"2026-08-07T04:24:27.096421Z","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-07T04:24:24.227968Z","title":"A computational transi- tion for detecting correlated stochastic block models by low-degree polynomials","venue":null,"work_id":null,"year":null},"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":2009,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:24.227968Z"},"links":{"citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:ca7cd7dc022eacfe23ac48fdc5b1457050e3f810d3719d6c06d8a6ec214db3ce","observation_id":"4b89cecb-d397-4a41-8b0b-e170f438341c","resolution":{"observed_at":"2026-08-07T04:24:24.227968Z","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-07T04:24:28.945980Z","title":"The LASSO risk for Gaussian matrices","venue":null,"work_id":"b67488df-ef90-4dcc-8a0c-2c6a1ec67d33","year":1997},"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":2011,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:24.028013Z"},"links":{"citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:80b48a7f242f043973ca36b42c3cd2a555d3fe9264e446e2e8f10991dc34616d","observation_id":"5b99bf26-c404-41c1-a218-f01d781f3627","resolution":{"observed_at":"2026-08-07T04:24:28.949403Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:24:28.924190Z","title":"A greedy anytime algorithm for sparse PCA","venue":null,"work_id":"25864bc5-46a6-4815-bce3-6091e28caab9","year":1939},"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":2016,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:25.380771Z"},"links":{"citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:67d341fb5b10e5773403025eedfb3b32921b06454047fc2e8faadd141f31ba43","observation_id":"f3cf2947-dfaa-4047-8a84-154ff27cf229","resolution":{"observed_at":"2026-08-07T04:24:28.927655Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:24:28.965966Z","title":"Algorithmic thresholds for tensor PCA","venue":null,"work_id":"eb8cfe2a-10e3-4353-8a5e-add95fbc5532","year":null},"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":2017,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:23.593167Z"},"links":{"citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:f5e52398bed79ada92b091339b50a4fa4a0b0e218b054851644004953ea1e60c","observation_id":"2d7cb48d-1254-48c1-9c31-e67b3462ef69","resolution":{"observed_at":"2026-08-07T04:24:28.969547Z","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":"2411.02764","last_updated":"2024-11-05T03:20:14Z","snapshot_observed_at":"2026-08-16T13:02:55.556610Z","submitted_at":"2024-11-05T03:20:14Z","title":"Fast, robust approximate message passing","version":1},"cited_work":{"arxiv_id":"2411.02764","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.02764","snapshot_observed_at":"2026-08-07T04:24:28.236838Z","title":"Fast, robust approximate message passing","venue":"cs.DS","work_id":"6871444d-09b4-455e-92b8-cabe910beb1e","year":2024},"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":2018,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:25.449794Z"},"links":{"cited_paper":"/paper/2411.02764","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:6cad5196e4da4d43cb908d1a1b71e6dd1c2a82fe5e431711346fbc69556be871","observation_id":"381bbbdd-1f88-4f9f-9f72-6c7e4b2fdef4","resolution":{"observed_at":"2026-08-07T04:24:28.241069Z","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"}},{"citation":{"cited_paper":{"arxiv_id":"1809.06304","last_updated":"2018-09-17T16:14:55Z","snapshot_observed_at":"2026-08-14T18:27:21.697844Z","submitted_at":"2018-09-17T16:14:55Z","title":"Approximate message-passing for convex optimization with non-separable penalties","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.06304","snapshot_observed_at":"2026-08-07T04:24:26.423484Z","title":"Approximate message-passing for convex optimization with non-separable penalties","venue":null,"work_id":null,"year":null},"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":2019,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:26.423484Z"},"links":{"cited_paper":"/paper/1809.06304","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:732c149366135c369ec41c9cfb91434c33b1e989089a2abe98bc5422df761853","observation_id":"291cdc5b-0798-4815-b338-af6d5b941e6b","resolution":{"observed_at":"2026-08-07T04:24:26.423484Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.15024","last_updated":"2025-04-28T13:50:28Z","snapshot_observed_at":"2026-08-16T12:56:32.301231Z","submitted_at":"2025-02-20T20:21:03Z","title":"Low degree conjecture implies sharp computational thresholds in stochastic block model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.15024","snapshot_observed_at":"2026-08-07T04:24:24.862524Z","title":"Low degree conjecture implies sharp computational thresholds in stochastic block model","venue":null,"work_id":null,"year":null},"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":2020,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:24.862524Z"},"links":{"cited_paper":"/paper/2502.15024","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:90284cbbb6833ff3ff60b67a3c03fd212f324f1272aceba6e094610dd6d2dc28","observation_id":"282a4397-bb20-4021-bb01-549866163411","resolution":{"observed_at":"2026-08-07T04:24:24.862524Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.15312","last_updated":"2025-01-25T19:51:38Z","snapshot_observed_at":"2026-08-16T00:45:34.428696Z","submitted_at":"2025-01-25T19:51:38Z","title":"Turing in the shadows of Nobel and Abel: an algorithmic story behind two recent prizes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.15312","snapshot_observed_at":"2026-08-07T04:24:25.061900Z","title":"Turing in the shadows of Nobel and Abel: an algorithmic story behind two recent prizes","venue":null,"work_id":null,"year":null},"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":2021,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:25.061900Z"},"links":{"cited_paper":"/paper/2501.15312","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:592b5a5190aac3a8c18992574d8bd25d4dd6692fc9f018e54976b3f75b8a9215","observation_id":"de08cdf1-f584-4f44-972c-c8e72d96b3d7","resolution":{"observed_at":"2026-08-07T04:24:25.061900Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.02802","last_updated":"2025-06-16T10:52:48Z","snapshot_observed_at":"2026-08-16T12:53:08.309188Z","submitted_at":"2025-03-04T17:25:32Z","title":"Computational Equivalence of Spiked Covariance and Spiked Wigner Models via Gram-Schmidt Perturbation","version":2},"cited_work":{"arxiv_id":"2503.02802","doi":null,"metadata_source":"pith","pith_arxiv_id":"2503.02802","snapshot_observed_at":"2026-08-07T04:24:28.879751Z","title":"Computational Equivalence of Spiked Covariance and Spiked Wigner Models via Gram-Schmidt Perturbation","venue":"math.ST","work_id":"a9708262-2d33-4824-b478-3d4ed2496247","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":2022,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:23.704170Z"},"links":{"cited_paper":"/paper/2503.02802","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:5911ecd4d7efed3d90e201a459fe679f16eeaf6b8472d44661fd1dfd06969796","observation_id":"bef3ace4-ea56-42ff-b4c2-92bfaf9522a9","resolution":{"observed_at":"2026-08-07T04:24:28.883011Z","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"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:24:28.956166Z","title":"Algorithms approaching the threshold for semi-random planted clique","venue":null,"work_id":"77a75408-e3b3-4c91-a2c6-49af6d803d36","year":1918},"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":2023,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:23.940836Z"},"links":{"citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:45f65955a282442e1392bc9e8a21eae66efab6696ee0f839642d2355e6ce07a7","observation_id":"8081c65a-3982-44fe-bdd5-0a0f487ab13f","resolution":{"observed_at":"2026-08-07T04:24:28.959507Z","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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T04:24:24.345870Z","title":"Detecting correlation efficiently in stochastic block models: breaking Otter’s threshold by counting decorated trees","venue":null,"work_id":null,"year":null},"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":2024,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:24.345870Z"},"links":{"citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:c2d3e6b0fd911bd9145de12a39dcc0c2c1e421efc50ec04e1113c9765a71f721","observation_id":"c38b180b-7d4f-43f4-867e-fad237eeb4e8","resolution":{"observed_at":"2026-08-07T04:24:24.345870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2505.17360","last_updated":"2025-05-23T00:30:55Z","snapshot_observed_at":"2026-08-15T23:19:04.267457Z","submitted_at":"2025-05-23T00:30:55Z","title":"The Quasi-Polynomial Low-Degree Conjecture is False","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2505.17360","snapshot_observed_at":"2026-08-07T04:24:23.810810Z","title":"The quasi- polynomial low-degree conjecture is false","venue":null,"work_id":null,"year":null},"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":2025,"source":"pdf_text","source_observed_at":"2026-08-07T04:24:23.810810Z"},"links":{"cited_paper":"/paper/2505.17360","citing_paper":"/paper/2506.10748"},"observation_digest":"sha256:ccb18e42a92a916fa12a5ddc23cdcae0f13eaf9ca0e1f720aebe875b6ae708b7","observation_id":"23876183-404a-484c-b1ee-8464e13ab8b4","resolution":{"observed_at":"2026-08-07T04:24:23.810810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2506.10748","last_updated":"2025-06-12T14:35:26Z","latest_version":1,"primary_category":"math.ST","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"},"reference_resolution":{"displayed":48,"state_counts":{"malformed_identifier":0,"metadata_mismatch":1,"parse_uncertain":0,"unresolved":31,"verified_exact":9,"verified_fuzzy":7},"total_outbound_references":48},"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 48 of 48 outbound references and 13 inbound Pith citation observations for arXiv:2506.10748."}