{"as_of":"2026-08-11T01:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f072ac750d08fd7acef155811bc8fcdf6b6a3df565a3e9c984831c82446d2fe9","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T18:38:13.953646Z","state":"measured"},{"denominator":50,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":50,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T00:02:41.365005Z","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.560191Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"cited_work":{"arxiv_id":"2509.09904","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.09904","snapshot_observed_at":"2026-06-29T00:02:49.560191Z","title":"A smooth computational transition in tensor pca.arXiv preprint arXiv:2509.09904","venue":null,"work_id":"08d3529f-5e2e-4cf0-ac26-5e43581515a2","year":2025},"citing_paper":{"arxiv_id":"2604.10457","last_updated":"2026-04-12T04:41:44Z","snapshot_observed_at":"2026-08-03T00:42:32.613487Z","submitted_at":"2026-04-12T04:41:44Z","title":"Near Optimal Algorithms for Noisy $k$-XOR under Low-Degree Heuristic","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-05-10T16:44:24.061591Z"},"links":{"cited_paper":"/paper/2509.09904","citing_paper":"/paper/2604.10457"},"observation_digest":"sha256:00862485a631ab6b7f47421dadab182d779db1e9fc64a21ac2d51135a6968895","observation_id":"4f8f7294-358e-43dc-9036-c9d7244a036a","resolution":{"observed_at":"2026-05-11T08:16:01.453215Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"cited_work":{"arxiv_id":"2509.09904","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.09904","snapshot_observed_at":"2026-06-29T00:02:49.560191Z","title":"A smooth computational transition in tensor pca.arXiv preprint arXiv:2509.09904","venue":null,"work_id":"08d3529f-5e2e-4cf0-ac26-5e43581515a2","year":2025},"citing_paper":{"arxiv_id":"2605.19364","last_updated":"2026-05-19T04:55:13Z","snapshot_observed_at":"2026-08-01T08:03:02.715785Z","submitted_at":"2026-05-19T04:55:13Z","title":"Optimal Spectral Algorithms for Correlated Two-view Models in High Dimensions","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-20T02:36:58.026489Z"},"links":{"cited_paper":"/paper/2509.09904","citing_paper":"/paper/2605.19364"},"observation_digest":"sha256:df5718ac9ad049a166fdff67fb85a9023f520ed56bb8044f377a670ba3cbc1ca","observation_id":"c5213c88-ca31-48f3-a4f2-751bc984631a","resolution":{"observed_at":"2026-05-20T02:37:59.324166Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"cited_work":{"arxiv_id":"2509.09904","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2509.09904","snapshot_observed_at":"2026-06-29T00:02:49.560191Z","title":"A smooth computational transition in tensor pca.arXiv preprint arXiv:2509.09904","venue":null,"work_id":"08d3529f-5e2e-4cf0-ac26-5e43581515a2","year":2025},"citing_paper":{"arxiv_id":"2605.30113","last_updated":"2026-05-28T15:49:59Z","snapshot_observed_at":"2026-07-31T16:21:35.852277Z","submitted_at":"2026-05-28T15:49:59Z","title":"Low-degree estimation thresholds in planted hypergraphs and tensor PCA","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-29T00:02:41.365005Z"},"links":{"cited_paper":"/paper/2509.09904","citing_paper":"/paper/2605.30113"},"observation_digest":"sha256:e3c6f24bc5332264e5bdaaa069be4a8a9bb4d7b1664981c6d2ec6626d4483082","observation_id":"f35fd7bd-e3f3-4ec6-95f7-481160b3cd43","resolution":{"observed_at":"2026-06-29T00:02:49.562564Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2509.09904/citation-record","integrity":"/paper/2509.09904/integrity","json":"/paper/2509.09904/citation-record.json","paper":"/paper/2509.09904"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T18:38:13.412252Z","title":"Community detection in general stochastic block models: Fundamental limits and efficient algorithms for recovery","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.412252Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:5a6db52bc979c7be7a7bc9fe7d71be264113f0ec9b2c9888354d9b9bfd95cd4d","observation_id":"e8aa3027-b2cb-4a93-aa5d-62a9b4e0fb7d","resolution":{"observed_at":"2026-08-04T18:38:13.412252Z","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-04T18:38:13.431093Z","title":"Proof of the achievability conjectures for the general stochastic block model","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.431093Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:bb90aa9998f601c8901ec579a33cbfdb2ed3214c08aab281cd8a554ed4754f00","observation_id":"00793b2e-027d-484b-8069-408fcb46ce4e","resolution":{"observed_at":"2026-08-04T18:38:13.431093Z","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-04T18:38:13.436685Z","title":"Cenk Sahinalp","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.436685Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:a8c223da5efafab43f7ca40569a32e31de2954a70a008739be467340b26737c2","observation_id":"dcc36a4a-38c4-4124-9497-100b5fa91f91","resolution":{"observed_at":"2026-08-04T18:38:13.436685Z","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-04T18:38:13.444537Z","title":"Color-coding","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.444537Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:a7ef33a4a106cfe49736882fb9c5d187c13a402f18a9a3ab15646bb760a5042b","observation_id":"3eae5334-ac8f-4630-bd14-9ddd7c1c7f69","resolution":{"observed_at":"2026-08-04T18:38:13.444537Z","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-04T18:38:13.456009Z","title":"Approximation algorithms for some parameterized counting problems","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.456009Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:bf2644a6eb49bcde85012bf87932fd6cdf52e34ce0236d3a85b93ee3dc525307","observation_id":"65f39831-4020-4e31-8357-bf0a26affde2","resolution":{"observed_at":"2026-08-04T18:38:13.456009Z","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-04T18:38:13.463885Z","title":"Bandeira, Giorgio Cipolloni, Dominik Schr o der, and Ramon van Handel","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.463885Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:c96b70d587183f9f587c17b357553074e1ba29f7e3aaf1f0f0129fc4fc4a8662","observation_id":"66df5a4e-09b8-41e9-aa3a-235bf31b4c64","resolution":{"observed_at":"2026-08-04T18:38:13.463885Z","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-04T18:38:13.475387Z","title":"Bandeira, Ahmed El Alaoui, Samuel B","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.475387Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:d27956efd9e894c393901ec02bcd738010f60ae5cdd01582247564f3d99724c7","observation_id":"15ed9e15-bb21-4920-96d3-190676beb32b","resolution":{"observed_at":"2026-08-04T18:38:13.475387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.20539","last_updated":"2025-04-29T08:32:59Z","snapshot_observed_at":"2026-08-07T15:58:19.324745Z","submitted_at":"2025-04-29T08:32:59Z","title":"Randomstrasse101: Open Problems of 2024","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.20539","snapshot_observed_at":"2026-08-04T18:38:13.492302Z","title":"Bandeira, Anastasia Kireeva, Antoine Maillard, and Almut R o dder","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.492302Z"},"links":{"cited_paper":"/paper/2504.20539","citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:d51a753a548e3275f06917d79db2d6252f9d44b9e9723b8835aeec397f1908e3","observation_id":"df0f14ec-4cf1-4a39-bf58-d1d6c421824d","resolution":{"observed_at":"2026-08-04T18:38:13.492302Z","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-04T18:38:13.501458Z","title":"Bandeira, Dmitriy Kunisky, and Alexander S","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.501458Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:d10916354d7a6ee5b57300c2d20e41a757e95f0174b78e99b1681e29e14c5a7c","observation_id":"19123c8b-b6d1-4981-bf36-bfcfad3aa5ce","resolution":{"observed_at":"2026-08-04T18:38:13.501458Z","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-04T18:38:13.507509Z","title":"Contiguity and non-reconstruction results for planted partition models: the dense case","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.507509Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:48cb4cce28fc97135148dd4be84d359f38472903348d3d789098849713981ed9","observation_id":"40776427-513d-484d-8bd2-4e827d18f9b1","resolution":{"observed_at":"2026-08-04T18:38:13.507509Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.05305","last_updated":"2017-08-10T19:12:38Z","snapshot_observed_at":"2026-08-09T07:55:28.704730Z","submitted_at":"2017-05-15T15:49:08Z","title":"Optimal hypothesis testing for stochastic block models with growing degrees","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.05305","snapshot_observed_at":"2026-08-04T18:38:13.521205Z","title":"Optimal hypothesis testing for stochastic block models with growing degrees","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.521205Z"},"links":{"cited_paper":"/paper/1705.05305","citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:91e41bc203ce6be1e2893abc5053d040c63df01aa1221a0512d87e728557f438","observation_id":"947bae8f-5d3e-4a4c-ab42-b2157742e0b7","resolution":{"observed_at":"2026-08-04T18:38:13.521205Z","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-04T18:38:13.531179Z","title":"Hopkins, Jonathan Kelner, Pravesh K","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.531179Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:e793ed24e36eb1f8f3e45de01b1efe3da72200908662661bdeaac68045b604ee","observation_id":"e3c7dcf2-af97-4a9e-87b3-fb50dc16675a","resolution":{"observed_at":"2026-08-04T18:38:13.531179Z","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-04T18:38:13.540387Z","title":"Algorithmic threshold for tensor PCA","venue":null,"work_id":null,"year":2052},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.540387Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:3e62b2c38b3a0c28ec2a1c2c43419ed3b1c36caf20b835f1f11768ffd11898dd","observation_id":"0f042970-63fc-4b88-a4dd-8a3899dc19d0","resolution":{"observed_at":"2026-08-04T18:38:13.540387Z","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-04T18:38:13.551404Z","title":"Asymptotic enumeration of sparse uniform hypergraphs with given degrees","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.551404Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:f60c20764ce85ebc88b558f7b52601eac02961e48ded0a2ce0c1328e1a1b1b87","observation_id":"58166705-d6a5-4cf3-a371-7ed447b6b513","resolution":{"observed_at":"2026-08-04T18:38:13.551404Z","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-04T18:38:13.579360Z","title":"Non-backtracking spectrum of random graphs: Community detection and non-regular Ramanujan graphs","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.579360Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:5053575553d70bdeca1cf9994327b288c6df45deb5da18893d06aab9a69c6a61","observation_id":"09d1f51e-68b2-48ec-ac4f-8469124c1c2a","resolution":{"observed_at":"2026-08-04T18:38:13.579360Z","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-04T18:38:13.587076Z","title":"Reducibility and statistical-computational gaps from secret leakage","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.587076Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:f690af05c1e85b1decac8ab683b79fe6a6d81590e2cc6537e6e4c3999fcec1b3","observation_id":"b4a4c311-8aec-4b25-a40a-d60373108e2d","resolution":{"observed_at":"2026-08-04T18:38:13.587076Z","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-04T18:38:13.594087Z","title":"The algorithmic phase transition of random k -SAT for low degree polynomials","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.594087Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:9acca6a13f538663d66972a1117a1f6b0bac26a3e8f6b79825befb4684347e16","observation_id":"a11655d5-c831-4619-960b-a5e1ac13f7e9","resolution":{"observed_at":"2026-08-04T18:38:13.594087Z","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-04T18:38:13.605877Z","title":"Testing for high-dimensional geometry in random graphs","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.605877Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:cad6ff718f7f7b59782e25dba60b8ce6aa87d8473976274c1f984baf3360dc12","observation_id":"edc9ca5b-7c43-4a8f-a92e-eec01fc58baa","resolution":{"observed_at":"2026-08-04T18:38:13.605877Z","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-04T18:38:13.617968Z","title":"A computational transition for detecting correlated stochastic block models by low-degree polynomials","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.617968Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:46308678fc248b973b3460a26ab9f9b66cba65e73cfa9c76639f862b5e7803bc","observation_id":"b1405356-90a1-4571-ad8b-3d60a7ada60b","resolution":{"observed_at":"2026-08-04T18:38:13.617968Z","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-04T18:38:13.629739Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.629739Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:1485d7e5dba0efae1cdff8ea5c1339ab51b2bd2b80f85c6a6e2383953f44b5cc","observation_id":"0ecfe51e-7035-44ec-86e1-32e972389153","resolution":{"observed_at":"2026-08-04T18:38:13.629739Z","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-04T18:38:13.640103Z","title":"Low-degree hardness of detection for correlated Graphs","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.640103Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:2482cb1d01ca37abb42842df1ae573cbc192d2fb984da08562fb85c768ea765b","observation_id":"82d453cd-e9de-451b-8a89-d213b8d6d27c","resolution":{"observed_at":"2026-08-04T18:38:13.640103Z","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-04T18:38:13.646690Z","title":"Wein, and Afonso S","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.646690Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:d476dc175618aba6ba8ccdbb7e1e71824ffb10f2b792039575e58f203ca7cf1f","observation_id":"dfd3d04a-bc34-46c7-8607-1d577aef60f9","resolution":{"observed_at":"2026-08-04T18:38:13.646690Z","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-04T18:38:13.654586Z","title":"Hypertree decompositions and tractable queries","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.654586Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:166a75dea35fe7e07dc934bca3548f7d1a852673a0b0bb004871c17bf1791b89","observation_id":"fa48fba2-55e5-4445-9937-28e908f8555c","resolution":{"observed_at":"2026-08-04T18:38:13.654586Z","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-04T18:38:13.673661Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.673661Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:3368e96625614e129627a40e633d98259d27685cb98b43ca736361a30f899101","observation_id":"3aaa8f73-1bbc-4dcc-9e2f-49f2e95ccd96","resolution":{"observed_at":"2026-08-04T18:38:13.673661Z","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-04T18:38:13.698298Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.698298Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:4490f0a6c803033ce2581cbea8f4fa0b938d0b0a7c578c09617ca4fd707ed2c5","observation_id":"c846898f-ee09-4047-9d32-5752eb7712a7","resolution":{"observed_at":"2026-08-04T18:38:13.698298Z","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-04T18:38:13.705650Z","title":"Hopkins, Pravesh K","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.705650Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:db221e45b7adc23b5fa169e618b6b5ebff9ef4d353f69bea1aa1cc2428d8c996","observation_id":"237f4f15-1c93-42a1-929e-3630c36f5ffa","resolution":{"observed_at":"2026-08-04T18:38:13.705650Z","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-04T18:38:13.714134Z","title":"Hopkins, Jonathan Shi, and David Steurer","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.714134Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:88c5a68a07363bd79c01465dc691aac5a2d07f96ce165a3b2024be33320d23fd","observation_id":"9e813458-8076-4b35-9234-29f687c58726","resolution":{"observed_at":"2026-08-04T18:38:13.714134Z","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-04T18:38:13.725521Z","title":"Hopkins and David Steurer","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.725521Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:8b1c40318c287dea96f7c0b733a744fbde4f13d8f3472d941e3d6b9de04a8cfe","observation_id":"283f97f7-c565-497c-9fd1-4323681cae4b","resolution":{"observed_at":"2026-08-04T18:38:13.725521Z","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-04T18:38:13.748881Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.748881Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:ae4f8070cf6e871d7e28aa9f4ffd79dcf59497cb50e6c6dff98be15d5e75d94a","observation_id":"d110c098-ba1e-4531-b656-e55b9040f36b","resolution":{"observed_at":"2026-08-04T18:38:13.748881Z","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-04T18:38:13.782741Z","title":"Wein, and Afonso S","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.782741Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:7fdf0a5ac3c1df2753fd5664c133330d0fbfbf67bb82016174e905ec7924124c","observation_id":"a42e853d-4256-42c5-9634-ac0836c66fb0","resolution":{"observed_at":"2026-08-04T18:38:13.782741Z","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-04T18:38:13.797498Z","title":"Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.797498Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:056b1249d8ca5b99557efdc5746bb89257a6afbc42460b5fe37ddb6e81daad39","observation_id":"fd48218a-2dbf-4b18-b8c6-96c75185f396","resolution":{"observed_at":"2026-08-04T18:38:13.797498Z","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-04T18:38:13.807560Z","title":"Statistical and computational phase transitions in spiked tensor estimation","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.807560Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:6676ae85717b9a96b31ba3b9a8fba01d8d6de3c957af5d5f6dd9c9316bef3284","observation_id":"1d24c235-6334-4bc1-8ebd-0e3cbba8e834","resolution":{"observed_at":"2026-08-04T18:38:13.807560Z","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-04T18:38:13.816741Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.816741Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:644d096f95ae970fccaca771ef25fc5632b098c15b8ca4b559962af1c60b88be","observation_id":"6666e9b0-3e88-425d-9bb9-3281c006639d","resolution":{"observed_at":"2026-08-04T18:38:13.816741Z","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-04T18:38:13.826094Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.826094Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:35d01a5a8e3e56cc09e0003dbd217cc552f35c320f1e0b73d7710ea1abb62009","observation_id":"5ebac40e-a944-4380-bfc8-f889057d3b47","resolution":{"observed_at":"2026-08-04T18:38:13.826094Z","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-04T18:38:13.834293Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.834293Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:6edac1833bdfe27777da081a0643a88f169b39def360ae0ce054b22d6d751a1e","observation_id":"db9ba875-d001-494a-9d29-1db568492294","resolution":{"observed_at":"2026-08-04T18:38:13.834293Z","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-04T18:38:13.846383Z","title":"Community detection thresholds and the weak Ramanujan property","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.846383Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:c054b9aa3064b64956cadbde7ad6d4b6e4ecc9a71fdca511dd72349da4a4a924","observation_id":"06d0434f-e74b-4aa0-8cdb-1c4079436150","resolution":{"observed_at":"2026-08-04T18:38:13.846383Z","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-04T18:38:13.855956Z","title":"Network motifs: simple building blocks of complex networks","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.855956Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:431d9f7a34f67dafcfbb2d3e0afe60201198da42c959e2b908cf9d4fd7d3f00f","observation_id":"48ef4ba9-beb3-46b2-b4e5-7a056b712772","resolution":{"observed_at":"2026-08-04T18:38:13.855956Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.04343","last_updated":"2019-06-24T09:44:37Z","snapshot_observed_at":"2026-07-06T06:44:18.193764Z","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-04T18:38:13.863456Z","title":"Phase transitions in spiked matrix estimation: information-theoretic analysis","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.863456Z"},"links":{"cited_paper":"/paper/1806.04343","citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:00272aabae2bd151daa35c70f59bcae67be213177622b87d02bcec9b29283bc8","observation_id":"5793365c-5bed-4d18-9df4-b5f71211f8f9","resolution":{"observed_at":"2026-08-04T18:38:13.863456Z","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-04T18:38:13.875133Z","title":"Reconstruction and estimation in the planted partition model","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.875133Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:8f1db2dccb097ac155d210193b5d255dff6e46cf41c01efb1ec7b1bad2435e9b","observation_id":"b8f462d1-52a6-487a-afa9-31659f076ef1","resolution":{"observed_at":"2026-08-04T18:38:13.875133Z","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-04T18:38:13.882462Z","title":"A proof of the block model threshold conjecture","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.882462Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:53a704a51abe6b379c9503d6dbfadd87272023489adc6dd256e418a255f34e05","observation_id":"af1ed4fe-2e00-4838-877a-016b6bec68c5","resolution":{"observed_at":"2026-08-04T18:38:13.882462Z","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-04T18:38:13.889244Z","title":"Weak recovery, hypothesis testing, and mutual information in stochastic block models and planted factor graphs","venue":null,"work_id":null,"year":2062},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.889244Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:1bbd7da8480cbe15a850eba6179aa4e14be1071b403568544110c8795c8d3355","observation_id":"7c0de347-fdbb-4cd0-bcd5-ada41c90958f","resolution":{"observed_at":"2026-08-04T18:38:13.889244Z","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-04T18:38:13.902010Z","title":"Silva, David Aparicio, and Fernando Silva","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.902010Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:9e75bf611cdf56bab12ce2408df09016543b95f7a472607b00b9835137f4a38f","observation_id":"c2ee7cd3-a56c-4797-8978-b27d3c9c6a49","resolution":{"observed_at":"2026-08-04T18:38:13.902010Z","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-04T18:38:13.918176Z","title":"A statistical model for tensor PCA","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.918176Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:bf6395b402f127c8d79bbc0737277fe67cbbfb74781c555546dfa5c989ff9b1b","observation_id":"ed50bd98-7640-4d84-8022-e438d4eb6de1","resolution":{"observed_at":"2026-08-04T18:38:13.918176Z","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-04T18:38:13.924559Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.924559Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:571744dfcfc0ff63ad3ec2ff1d169569d1bb12ceabe86e6d8fccb762bfb27e62","observation_id":"55c248d4-df13-4ec1-a797-fd40d9578075","resolution":{"observed_at":"2026-08-04T18:38:13.924559Z","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-04T18:38:13.935721Z","title":"Average-case hardness of RIP certification","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.935721Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:4e6bd67d0dae90b3e24c1254c68400182de7f7253a585d95e9440280df730f4a","observation_id":"7fccf9e2-f27f-48ac-9b78-a6489dfac02f","resolution":{"observed_at":"2026-08-04T18:38:13.935721Z","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-04T18:38:13.943017Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.943017Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:07d144e7474c1466e4472b11317c6e32f74ca08fc0508e5af123d3a513cc2a4e","observation_id":"4f385b28-71d6-42bc-9f8d-7ed09125e146","resolution":{"observed_at":"2026-08-04T18:38:13.943017Z","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-04T18:38:13.953646Z","title":"Wein, Ahmed El Alaoui, and Cristopher Moore","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-04T18:38:13.953646Z"},"links":{"citing_paper":"/paper/2509.09904"},"observation_digest":"sha256:9e0f280f12b0e2467cb99d9e2c50db91c1a8acb3ca791bb065d960fda08ae34b","observation_id":"67bebde0-e913-4243-9308-c9859e2e4b76","resolution":{"observed_at":"2026-08-04T18:38:13.953646Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.09904","last_updated":"2025-09-12T00:21:20Z","latest_version":1,"primary_category":"math.ST","snapshot_observed_at":"2026-08-10T12:40:40.392695Z","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":47,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":47},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 3 inbound Pith citation observations for arXiv:2509.09904."}