{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:YFPUNFLI3S6CDMCFMS6CUCPO67","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d85d4004ef8af6d4722b70614735b011f6d5d56015c5e44d879f27d0fbebdb21","cross_cats_sorted":["cs.DS","math.PR","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-09-12T00:21:20Z","title_canon_sha256":"3dfae2a38c4a7a2df1462a9d0c71b55c5e33dee0b4a276911c41e1e1ec7e28d8"},"schema_version":"1.0","source":{"id":"2509.09904","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.09904","created_at":"2026-07-05T12:09:51Z"},{"alias_kind":"arxiv_version","alias_value":"2509.09904v1","created_at":"2026-07-05T12:09:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09904","created_at":"2026-07-05T12:09:51Z"},{"alias_kind":"pith_short_12","alias_value":"YFPUNFLI3S6C","created_at":"2026-07-05T12:09:51Z"},{"alias_kind":"pith_short_16","alias_value":"YFPUNFLI3S6CDMCF","created_at":"2026-07-05T12:09:51Z"},{"alias_kind":"pith_short_8","alias_value":"YFPUNFLI","created_at":"2026-07-05T12:09:51Z"}],"graph_snapshots":[{"event_id":"sha256:7c4a73c6355df571edbe3e6198112772132c2b416dcdb7d4198459f1277b8b61","target":"graph","created_at":"2026-07-05T12:09:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.09904/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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}.","authors_text":"Zhangsong Li","cross_cats":["cs.DS","math.PR","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-09-12T00:21:20Z","title":"A Smooth Computational Transition in Tensor PCA"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09904","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:10a9b87a7d92a77adb3fae31e5533984eb8aa3b2ccfa5f5372a6a1ef5c448efb","target":"record","created_at":"2026-07-05T12:09:51Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d85d4004ef8af6d4722b70614735b011f6d5d56015c5e44d879f27d0fbebdb21","cross_cats_sorted":["cs.DS","math.PR","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2025-09-12T00:21:20Z","title_canon_sha256":"3dfae2a38c4a7a2df1462a9d0c71b55c5e33dee0b4a276911c41e1e1ec7e28d8"},"schema_version":"1.0","source":{"id":"2509.09904","kind":"arxiv","version":1}},"canonical_sha256":"c15f469568dcbc21b04564bc2a09eef7f028dc536b0cb20796b20cc12cfe718b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c15f469568dcbc21b04564bc2a09eef7f028dc536b0cb20796b20cc12cfe718b","first_computed_at":"2026-07-05T12:09:51.796245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:09:51.796245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"H5fsid8YJLFOjtB4jpfIxIZBs7gN+ja/FpmOs5l9zpz65w37XXbJJ6E3BoZvN93laUZuyvFnKsML1LXumzitCg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:09:51.796764Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.09904","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10a9b87a7d92a77adb3fae31e5533984eb8aa3b2ccfa5f5372a6a1ef5c448efb","sha256:7c4a73c6355df571edbe3e6198112772132c2b416dcdb7d4198459f1277b8b61"],"state_sha256":"051c71729ca251d8d49578c6424ac85e138f58a19f2298418bf2af9ade77d55d"}