{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YFPUNFLI3S6CDMCFMS6CUCPO67","short_pith_number":"pith:YFPUNFLI","schema_version":"1.0","canonical_sha256":"c15f469568dcbc21b04564bc2a09eef7f028dc536b0cb20796b20cc12cfe718b","source":{"kind":"arxiv","id":"2509.09904","version":1},"attestation_state":"computed","paper":{"title":"A Smooth Computational Transition in Tensor PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Zhangsong Li","submitted_at":"2025-09-12T00:21:20Z","abstract_excerpt":"We propose an efficient algorithm for tensor PCA based on counting a specific family of weighted hypergraphs. For the order-$p$ tensor PCA problem where $p \\geq 3$ is a fixed integer, we show that when the signal-to-noise ratio is $\\lambda n^{-\\frac{p}{4}}$ where $\\lambda=\\Omega(1)$, our algorithm succeeds and runs in time $n^{C+o(1)}$ where $C=C(\\lambda)$ is a constant depending on $\\lambda$. This algorithm improves a poly-logarithmic factor compared to previous algorithms based on the Sum-of-Squares hierarchy \\cite{HSS15} or based on the Kikuchi hierarchy in statistical physics \\cite{WEM19}."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2509.09904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-09-12T00:21:20Z","cross_cats_sorted":["cs.DS","math.PR","stat.ML","stat.TH"],"title_canon_sha256":"3dfae2a38c4a7a2df1462a9d0c71b55c5e33dee0b4a276911c41e1e1ec7e28d8","abstract_canon_sha256":"d85d4004ef8af6d4722b70614735b011f6d5d56015c5e44d879f27d0fbebdb21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:51.796764Z","signature_b64":"H5fsid8YJLFOjtB4jpfIxIZBs7gN+ja/FpmOs5l9zpz65w37XXbJJ6E3BoZvN93laUZuyvFnKsML1LXumzitCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c15f469568dcbc21b04564bc2a09eef7f028dc536b0cb20796b20cc12cfe718b","last_reissued_at":"2026-07-05T12:09:51.796245Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:51.796245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Smooth Computational Transition in Tensor PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.PR","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Zhangsong Li","submitted_at":"2025-09-12T00:21:20Z","abstract_excerpt":"We propose an efficient algorithm for tensor PCA based on counting a specific family of weighted hypergraphs. For the order-$p$ tensor PCA problem where $p \\geq 3$ is a fixed integer, we show that when the signal-to-noise ratio is $\\lambda n^{-\\frac{p}{4}}$ where $\\lambda=\\Omega(1)$, our algorithm succeeds and runs in time $n^{C+o(1)}$ where $C=C(\\lambda)$ is a constant depending on $\\lambda$. This algorithm improves a poly-logarithmic factor compared to previous algorithms based on the Sum-of-Squares hierarchy \\cite{HSS15} or based on the Kikuchi hierarchy in statistical physics \\cite{WEM19}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09904","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.09904/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2509.09904","created_at":"2026-07-05T12:09:51.796306+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.09904v1","created_at":"2026-07-05T12:09:51.796306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09904","created_at":"2026-07-05T12:09:51.796306+00:00"},{"alias_kind":"pith_short_12","alias_value":"YFPUNFLI3S6C","created_at":"2026-07-05T12:09:51.796306+00:00"},{"alias_kind":"pith_short_16","alias_value":"YFPUNFLI3S6CDMCF","created_at":"2026-07-05T12:09:51.796306+00:00"},{"alias_kind":"pith_short_8","alias_value":"YFPUNFLI","created_at":"2026-07-05T12:09:51.796306+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30113","citing_title":"Low-degree estimation thresholds in planted hypergraphs and tensor PCA","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.19364","citing_title":"Optimal Spectral Algorithms for Correlated Two-view Models in High Dimensions","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.10457","citing_title":"Near Optimal Algorithms for Noisy $k$-XOR under Low-Degree Heuristic","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YFPUNFLI3S6CDMCFMS6CUCPO67","json":"https://pith.science/pith/YFPUNFLI3S6CDMCFMS6CUCPO67.json","graph_json":"https://pith.science/api/pith-number/YFPUNFLI3S6CDMCFMS6CUCPO67/graph.json","events_json":"https://pith.science/api/pith-number/YFPUNFLI3S6CDMCFMS6CUCPO67/events.json","paper":"https://pith.science/paper/YFPUNFLI"},"agent_actions":{"view_html":"https://pith.science/pith/YFPUNFLI3S6CDMCFMS6CUCPO67","download_json":"https://pith.science/pith/YFPUNFLI3S6CDMCFMS6CUCPO67.json","view_paper":"https://pith.science/paper/YFPUNFLI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.09904&json=true","fetch_graph":"https://pith.science/api/pith-number/YFPUNFLI3S6CDMCFMS6CUCPO67/graph.json","fetch_events":"https://pith.science/api/pith-number/YFPUNFLI3S6CDMCFMS6CUCPO67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YFPUNFLI3S6CDMCFMS6CUCPO67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YFPUNFLI3S6CDMCFMS6CUCPO67/action/storage_attestation","attest_author":"https://pith.science/pith/YFPUNFLI3S6CDMCFMS6CUCPO67/action/author_attestation","sign_citation":"https://pith.science/pith/YFPUNFLI3S6CDMCFMS6CUCPO67/action/citation_signature","submit_replication":"https://pith.science/pith/YFPUNFLI3S6CDMCFMS6CUCPO67/action/replication_record"}},"created_at":"2026-07-05T12:09:51.796306+00:00","updated_at":"2026-07-05T12:09:51.796306+00:00"}