{"as_of":"2026-08-17T05:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:abaa24e91047a975b327de71eb2d3a36384c56bf633e7fc5c14e282b7b508584","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:48:04.292455Z","state":"measured"},{"denominator":42,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":42,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:24:26.117470Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-06-29T00:02:49.575430Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"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":"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":"2506.09959","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2506.09959","snapshot_observed_at":"2026-06-29T00:02:49.575430Z","title":"Almost-optimal local-search methods for sparse tensor PCA.arXiv preprint arXiv:2506.09959,","venue":null,"work_id":"c3a52337-0ec2-47e7-b412-4ec617a06f84","year":null},"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":13,"source":"pdf_text","source_observed_at":"2026-06-29T00:02:41.365005Z"},"links":{"cited_paper":"/paper/2506.09959","citing_paper":"/paper/2605.30113"},"observation_digest":"sha256:771521d711671a93a86f54540c58f54d80430833b8aca7ef74327cffd716a5e1","observation_id":"01da083f-98dc-4fbd-bf16-d85c437a80e8","resolution":{"observed_at":"2026-06-29T00:02:49.577580Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2506.09959/citation-record","integrity":"/paper/2506.09959/integrity","json":"/paper/2506.09959/citation-record.json","paper":"/paper/2506.09959"},"outbound":[{"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:48:04.880602Z","title":"Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,","venue":null,"work_id":"f4dbad57-7d11-477b-8791-f35f495abdd2","year":1974},"citing_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},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:03.801487Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:ef826b07fbc4e7bd9e7bd4f89fa02c9b32bb8b5b0e52406efca7f8b3b7fb35fc","observation_id":"0c076d70-1c52-4be9-bf28-9f57b2742ebc","resolution":{"observed_at":"2026-08-07T04:48:04.885963Z","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:48:04.865625Z","title":"Homotopy analysis for tensor pca","venue":null,"work_id":"51cbcff4-7921-4377-beb4-260100e6a700","year":2017},"citing_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},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:03.894290Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:b516ceb6edd871402fc95ce8f20945ee24d9c0960016e889999ab697678e467a","observation_id":"8d542153-ae22-47a7-97a4-3339cd9cc9d0","resolution":{"observed_at":"2026-08-07T04:48:04.870108Z","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:48:04.851044Z","title":"Algorithmic thresholds for tensor pca","venue":null,"work_id":"11f97b37-d24c-4902-bac3-684f30e15bf3","year":2020},"citing_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},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.000869Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:1c66476a7b8d5613e8efd71d091f03edd021361f046739f34e3a41a7caa14e0f","observation_id":"bf96daca-c58a-4b1a-84ab-41043700ece1","resolution":{"observed_at":"2026-08-07T04:48:04.855756Z","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:48:04.836673Z","title":"High-dimensional analysis of semidefinite relaxations for sparse principal components","venue":null,"work_id":"a9575ff5-df90-46e1-a058-1b9f195d88c0","year":2008},"citing_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},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.118845Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:f4085702bae9e881faba50ef3c73546cccbf7f44e126651fdfa64b9a33724f2a","observation_id":"a27ae111-fdd3-41dc-a0f9-6712c1981363","resolution":{"observed_at":"2026-08-07T04:48:04.841122Z","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:48:04.821694Z","title":"Free energy wells and overlap gap property in sparse pca","venue":null,"work_id":"023ff757-7d63-44b3-8883-72e1ab14525b","year":2023},"citing_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},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.150454Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:84d29c450a2392ee686c1df8b59bbcd9bad80dd3b891bb1ac7b42f97d0b86600","observation_id":"991f177c-8d8f-4537-86af-64c0e6effefb","resolution":{"observed_at":"2026-08-07T04:48:04.826156Z","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:48:04.807076Z","title":"Reducibility and computational lower bounds for problems with planted sparse structure","venue":null,"work_id":"fe2e7626-e46a-4150-9b99-fa4911f3c1ac","year":2018},"citing_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},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.154735Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:2027ca0e623871986bf944495edda476c044f91304d6d7ec93d8b0b91370f53e","observation_id":"44195c0c-d442-449d-b412-6076371a5e26","resolution":{"observed_at":"2026-08-07T04:48:04.811463Z","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:48:04.159424Z","title":"Concentration Inequalities: A Nonasymptotic Theory of Independence","venue":null,"work_id":null,"year":2013},"citing_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},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.159424Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:f2297589db98ce7d3c611fa4e8b1e4cbd5c0213416a301563fa2aaba147072d2","observation_id":"61b71223-06b7-46ea-8d4d-e78f7521a263","resolution":{"observed_at":"2026-08-07T04:48:04.159424Z","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:48:04.781813Z","title":"Tony Cai, Tengyuan Liang, and Alexander Rakhlin","venue":null,"work_id":"cc7e57ab-29e0-4038-bf75-b87ef5267802","year":2017},"citing_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},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.163485Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:00939fbc3be50281c37d0be327bf5a83edeb31297fe4ec724e6b96c7734299d4","observation_id":"a024e45a-3a84-467f-a0ec-69f87fe51c55","resolution":{"observed_at":"2026-08-07T04:48:04.786638Z","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:48:04.167481Z","title":"Almost-linear planted cliques elude the metropolis process","venue":null,"work_id":null,"year":2025},"citing_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},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.167481Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:96cf9f225590047d3b2469e0ccb16252317bfdff26c7ebce0c20a137818649b5","observation_id":"7992995f-4d19-49dc-a8fd-d14bb349bf12","resolution":{"observed_at":"2026-08-07T04:48:04.167481Z","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:48:04.755109Z","title":"On the low-temperature mcmc threshold: the cases of sparse tensor pca, sparse regression, and a geometric rule, 2024","venue":null,"work_id":"45d797f3-3a7a-48d8-9b46-2575fd69d184","year":2024},"citing_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},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.171553Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:b564025266172ab701e861274ddd8d8b1ca0667c561c94da3860e566deb5b28b","observation_id":"933e4c8e-b6f5-4aa5-ae45-2f415a719198","resolution":{"observed_at":"2026-08-07T04:48:04.759880Z","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:48:04.739173Z","title":"The power of two matrices in spectral algorithms for community recovery","venue":null,"work_id":"a8ff0e78-caf5-4653-ab3a-3170eb1b9f32","year":2023},"citing_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},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.175510Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:8ab7e9d5b0b0463ae6b0c1e5eebd9fbee7b44bb15ca8c44375949b92bf59173f","observation_id":"9fb5382b-31da-4d60-9546-ea1021dadcbb","resolution":{"observed_at":"2026-08-07T04:48:04.744653Z","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:48:04.723463Z","title":"Statistical query lower bounds for robust estimation of high-dimensional gaussians and gaussian mixtures","venue":null,"work_id":"811bdee7-8a99-4dd3-9a1a-3d66214f6fab","year":2017},"citing_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},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.179402Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:ebe447b47df4522bc7134f53ca58ed18d29df4945ec0a04270c37e8334868945","observation_id":"947da417-ae26-4981-8270-81027b6e8ce6","resolution":{"observed_at":"2026-08-07T04:48:04.728547Z","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:48:04.183360Z","title":"Message-passing algorithms for compressed sensing","venue":null,"work_id":null,"year":2009},"citing_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},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.183360Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:6a071bbf1ac74d57a70540cc31ca407cc5f1f2217512390370a1e9e059b18bb5","observation_id":"2b0ae91d-cdbb-4051-bdb1-089fe48ca7bb","resolution":{"observed_at":"2026-08-07T04:48:04.183360Z","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:48:04.697807Z","title":"Statistical algorithms and a lower bound for detecting planted cliques","venue":null,"work_id":"d75a869a-77af-4893-84c3-1fb42006c503","year":2017},"citing_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},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.187236Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:62bf3d1319135fbc2b79ecccedefce6b3930fed6a88cca62a8485df939cd3d57","observation_id":"428821f6-28b7-42a3-adab-e23255145687","resolution":{"observed_at":"2026-08-07T04:48:04.702331Z","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:48:04.683458Z","title":"Finding hidden cliques in linear time","venue":null,"work_id":"ddc41e70-d549-43ff-a444-31a56d1e7891","year":2010},"citing_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},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.191297Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:176f0ac81209d338cfe549166fb51ab75d8213c1fc54f97c71c963b93f06aba3","observation_id":"7bcae25d-f962-4144-b9b9-b1f48e4b8830","resolution":{"observed_at":"2026-08-07T04:48:04.687940Z","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:48:04.195369Z","title":"A unifying tutorial on approximate message passing","venue":null,"work_id":null,"year":2022},"citing_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},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.195369Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:f554d01d4005eede8dd5e8e4702671bcd9dea997381f04615924c30e54331df0","observation_id":"daba2f04-73a0-4ac6-a94a-de0eea4aa00a","resolution":{"observed_at":"2026-08-07T04:48:04.195369Z","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:48:04.659364Z","title":"Finding planted cliques using markov chain monte carlo, 2023","venue":null,"work_id":"c0819081-ebf0-4a1e-9348-a98ca43fe9a6","year":2023},"citing_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},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.199631Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:ad5fcec93940e51bb7a3e2122ca63415ceb69d96841a04f7b2039eabfb4891fb","observation_id":"929145c2-037e-47b8-a2b0-7a48eb088c27","resolution":{"observed_at":"2026-08-07T04:48:04.663729Z","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:48:04.645826Z","title":"Probability and random processes","venue":null,"work_id":"ccefd0c6-240f-4151-86a0-c4b19d19caf0","year":2001},"citing_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},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.203595Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:6d33eb37f1cc5224efc6dae3d204191e31c89a13b8d60eb01639f26cce4c4075","observation_id":"481e0e2b-1344-4350-942e-57fc8161b507","resolution":{"observed_at":"2026-08-07T04:48:04.649826Z","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:48:04.631285Z","title":"Sparse high-dimensional linear regression","venue":null,"work_id":"475519ee-eabb-433c-9768-5636753263f1","year":2022},"citing_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},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.207462Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:44b5aaef4585c546700f15a9c2bfa717b31cc5fa88a7fec27a653c526fb1c74e","observation_id":"a7f0dc02-610f-43f2-9bab-06777c69485d","resolution":{"observed_at":"2026-08-07T04:48:04.636201Z","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:48:04.616565Z","title":"The landscape of the planted clique problem: Dense subgraphs and the overlap gap property","venue":null,"work_id":"b483639d-1352-4758-8480-d26acc3c78d7","year":2024},"citing_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},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.211387Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:fd8da873f14684e6756ed08448b82bbaaa82d6acb9219fbe534757c85a8cc1e9","observation_id":"6316c35c-b1bd-4bde-93ab-5feef863d173","resolution":{"observed_at":"2026-08-07T04:48:04.621082Z","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:48:04.602518Z","title":"Hardy, J.E","venue":null,"work_id":"1d15af8e-9da0-45d5-8185-d93b5216e4c7","year":1934},"citing_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},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.215583Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:2874df03522e2de4ccda43a0ef8f184768a3e7de0345320f15ecc108570ef37c","observation_id":"d5a02375-a263-4c18-80cf-1d01ee25d02f","resolution":{"observed_at":"2026-08-07T04:48:04.606747Z","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:48:04.587972Z","title":"A robust spectral algorithm for overcomplete tensor decomposition","venue":null,"work_id":"349ecb7c-52c5-444a-8878-c68211ddae95","year":2019},"citing_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},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.220035Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:dc5c4673ddbac12c0db07206c937548682e3170e9a0df930cff7428897768a3a","observation_id":"6e5ff383-ec42-431a-82b6-1193082209c0","resolution":{"observed_at":"2026-08-07T04:48:04.592489Z","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:48:04.572179Z","title":"Large cliques elude the metropolis process","venue":null,"work_id":"716b0f5c-a4b7-468e-b72d-e9183ec99c9c","year":1992},"citing_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},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.224028Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:973562ce27c35101371391317bc5666fc17c1cf0bf7e9c2fa50c239aafc1b194","observation_id":"09d5fafc-3c6b-4d8e-881a-e55f50f8b440","resolution":{"observed_at":"2026-08-07T04:48:04.577475Z","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:48:04.557021Z","title":"Johnson, Samuel Kotz, and Narayanaswamy Balakrishnan","venue":null,"work_id":"49a90d02-e5ca-44df-8561-2e1f6ff0143d","year":1994},"citing_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},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.227943Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:ba1f578a9b0ca43f70c9d9f525d11386be9e65d2eb22e655806066fe301c104a","observation_id":"af35fc59-1f4d-4e73-a8b1-9a6ca4736e57","resolution":{"observed_at":"2026-08-07T04:48:04.561360Z","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:48:04.542501Z","title":"On consistency and sparsity for principal components analysis in high dimensions","venue":null,"work_id":"786c354e-dc78-4b3d-925c-5628302c12df","year":2009},"citing_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},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.231958Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:29a4455d35456bb43d9dba7858ebbd486f7aa429f9910e070a99631b7797c428","observation_id":"42236c39-b599-408a-b9d0-03ab155219ac","resolution":{"observed_at":"2026-08-07T04:48:04.547014Z","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:48:04.527519Z","title":"Notes on computational hardness of hypothesis testing: Predictions using the low-degree likelihood ratio","venue":null,"work_id":"f6a645b4-a995-4104-8eeb-93081c7e9e77","year":2019},"citing_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},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.236030Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:0e980cbd9c589c0ecf65b486f561a781d2da4476664471a365229882d3691382","observation_id":"31a0d7be-4f9e-4b30-b787-888b40678018","resolution":{"observed_at":"2026-08-07T04:48:04.532721Z","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:48:04.513040Z","title":"Drift Analysis , pages 89--131","venue":null,"work_id":"22f35daf-90ad-4e7d-9d3c-60527bdbf9da","year":2020},"citing_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},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.239949Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:ea7e12bf487a7a3f86579bdce85192f8d7a98e3582b4ccff37e069a871ec3e85","observation_id":"cd50f395-efaf-47e6-ad32-49a468b489bd","resolution":{"observed_at":"2026-08-07T04:48:04.517646Z","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:48:04.499250Z","title":null,"venue":null,"work_id":"c6920761-4318-4566-a44c-cc12f7f80e6b","year":2024},"citing_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},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.243824Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:cc63fdcca02e6475a5721ae7453613b55bfa29a73edee195aa11abc168436f90","observation_id":"13969783-2460-484a-bc90-ad3a330ee1d4","resolution":{"observed_at":"2026-08-07T04:48:04.503422Z","resolver_source":"raw_fallback","status":"unresolved"},"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:48:04.247841Z","title":"Markov chains and mixing times , volume 107","venue":null,"work_id":null,"year":2017},"citing_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},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.247841Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:1192384c6ff6c44c2a9e4ab0d1ab2681b86b6e58bee9055f989efe412cd25d46","observation_id":"c8824872-3fd6-408c-ba37-d095be8e78c5","resolution":{"observed_at":"2026-08-07T04:48:04.247841Z","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:48:04.471960Z","title":"Tensor clustering with planted structures: Statistical optimality and computational limits","venue":null,"work_id":"2ccc0cb9-b60b-4d3f-9f63-77856b7311e3","year":2022},"citing_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},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.251753Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:940999e8f6a4a672cb99aaddb6c4bb4b85e80ef74a5398aea961ab9556e3fa65","observation_id":"7b9bd90f-9c5f-4205-996b-71121134499a","resolution":{"observed_at":"2026-08-07T04:48:04.477272Z","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:48:04.457856Z","title":"Randomized Algorithms","venue":null,"work_id":"dbe45346-3695-4cdc-8418-4cf8efa7a778","year":1995},"citing_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},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.255583Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:c488a2277566640e36fe28b4212f3f7da5078b244e9cc2d083ae7a36b5b26154","observation_id":"c448f73f-8b58-4fa4-aea5-5671f7863ec8","resolution":{"observed_at":"2026-08-07T04:48:04.461982Z","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:48:04.443249Z","title":"A statistical model for tensor pca","venue":null,"work_id":"6162dd38-5edf-4503-b938-a7322bc82c7d","year":2014},"citing_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},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.259421Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:337cf334b572a3caa97cd4ff8bcf00826f368de7c71c03dfc076235c1470f081","observation_id":"4a67f19b-af36-41da-a202-33d99ab65ee0","resolution":{"observed_at":"2026-08-07T04:48:04.447888Z","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:48:04.428804Z","title":null,"venue":null,"work_id":"d9657278-bd23-47f0-b7ab-d7b4ce2196e3","year":2025},"citing_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},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.263474Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:5865d433bc7d0860b1570973bc2d43d87bbb7f79e50c8b04d71a20707e49abb8","observation_id":"e294c020-ea5f-4399-82c3-d750f9f70987","resolution":{"observed_at":"2026-08-07T04:48:04.432990Z","resolver_source":"raw_fallback","status":"unresolved"},"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:48:04.414819Z","title":"The all-or-nothing phenomenon in sparse tensor pca","venue":null,"work_id":"1e5feb44-64b0-4313-97fe-5a7a984e6f12","year":2020},"citing_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},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.267427Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:f3e74502fc28053cf9430685e8868c55ef4b631a51e83ebdf7bec15ef1d8f340","observation_id":"2ccde32e-7892-4ed8-874d-4bedd5307ee5","resolution":{"observed_at":"2026-08-07T04:48:04.419335Z","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:48:04.399521Z","title":null,"venue":null,"work_id":"e75aa392-4aed-474d-86e7-918fd46d7450","year":2009},"citing_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},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.271340Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:8a7383053eaa88d56d32061da4cb2a20b72bc8597c310589722e31ef43467a8d","observation_id":"fcfe44e5-e958-4439-8d76-df81ef7d7786","resolution":{"observed_at":"2026-08-07T04:48:04.404224Z","resolver_source":"raw_fallback","status":"unresolved"},"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:48:04.384317Z","title":"Wein, and Afonso S","venue":null,"work_id":"0ef9aa3f-0951-41cb-8a76-da1fe6b7cf74","year":2020},"citing_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},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.275376Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:157c6403efc3604617414ccce921c0b508ff16fccb622c0c1b3ff93bed1feb71","observation_id":"482081e1-ac59-4005-9062-4ee7a7d8c887","resolution":{"observed_at":"2026-08-07T04:48:04.388746Z","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:48:04.370134Z","title":"Hanson-Wright inequality and sub-gaussian concentration","venue":null,"work_id":"c778aff3-b999-4466-a453-fed37e6dd6d5","year":2013},"citing_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},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.280348Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:f1855321fc255e18d3d48d8a042c1e1f093d2c26d7cab7e911f048d3c3b70c00","observation_id":"1ac79c46-855f-4d46-af45-db226948b31e","resolution":{"observed_at":"2026-08-07T04:48:04.374387Z","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:48:04.355585Z","title":"L \\'e vy Processes and Infinitely Divisible Distributions , volume 68 of Cambridge Studies in Advanced Mathematics","venue":null,"work_id":"29219270-0f89-4374-8ce4-a1920359505c","year":2013},"citing_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},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.284588Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:c0ffb2b59b3161e0a4a569d037a7e2568a00051e62f979aa8d749134dc7320a2","observation_id":"cdc0bf80-f211-4283-9d9e-5bd6a6554fcf","resolution":{"observed_at":"2026-08-07T04:48:04.360119Z","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:48:04.340171Z","title":"Computational barriers to estimation from low-degree polynomials","venue":null,"work_id":"5bb61e57-7031-48e6-8ac0-a778e55d8ae9","year":2022},"citing_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},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.288502Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:d687f15785a6658d1510869fe032759ae398e97256af6c9bc71f81cdf4556162","observation_id":"8dd07d2d-487d-462f-9663-33fee1bd9cb2","resolution":{"observed_at":"2026-08-07T04:48:04.345516Z","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:48:04.323871Z","title":"Wainwright, and Michael I","venue":null,"work_id":"d9311ef9-5e4e-4097-a5a7-cf0a27133d61","year":2016},"citing_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},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T04:48:04.292455Z"},"links":{"citing_paper":"/paper/2506.09959"},"observation_digest":"sha256:68a8f9a1bf91ae12c6a5030872c27bb0ecba40d5db70e68d2cbe26ab4b15623b","observation_id":"60e1582f-229a-4806-a006-98ce4fb1d6e2","resolution":{"observed_at":"2026-08-07T04:48:04.329778Z","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"}}],"paper":{"arxiv_id":"2506.09959","last_updated":"2025-06-11T17:33:25Z","latest_version":1,"primary_category":"math.ST","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"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":32},"total_outbound_references":40},"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 17 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 2 inbound Pith citation observations for arXiv:2506.09959."}