{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:YFPUNFLI3S6CDMCFMS6CUCPO67","short_pith_number":"pith:YFPUNFLI","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"},"canonical_sha256":"c15f469568dcbc21b04564bc2a09eef7f028dc536b0cb20796b20cc12cfe718b","source":{"kind":"arxiv","id":"2509.09904","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:YFPUNFLI3S6CDMCFMS6CUCPO67","target":"record","payload":{"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"},"canonical_sha256":"c15f469568dcbc21b04564bc2a09eef7f028dc536b0cb20796b20cc12cfe718b","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"},"source_kind":"arxiv","source_id":"2509.09904","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Furv/Ag3lunVkty4HmIzbaWgHdBaOlnnmjcDRQ06LclXvdmaPEi0bypm2EN9T8nco2KJvMji3iX6ou29Il0xDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T17:50:06.060138Z"},"content_sha256":"10a9b87a7d92a77adb3fae31e5533984eb8aa3b2ccfa5f5372a6a1ef5c448efb","schema_version":"1.0","event_id":"sha256:10a9b87a7d92a77adb3fae31e5533984eb8aa3b2ccfa5f5372a6a1ef5c448efb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:YFPUNFLI3S6CDMCFMS6CUCPO67","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:09:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kM7+QIOtI1gSHoVnBNceaGPSiWid4TO3LiZWAorH2RP6gjCp8UB6ZtvaR5fHqjIY2ykI7ZgikivNnlFVwFPLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T17:50:06.060679Z"},"content_sha256":"7c4a73c6355df571edbe3e6198112772132c2b416dcdb7d4198459f1277b8b61","schema_version":"1.0","event_id":"sha256:7c4a73c6355df571edbe3e6198112772132c2b416dcdb7d4198459f1277b8b61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YFPUNFLI3S6CDMCFMS6CUCPO67/bundle.json","state_url":"https://pith.science/pith/YFPUNFLI3S6CDMCFMS6CUCPO67/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YFPUNFLI3S6CDMCFMS6CUCPO67/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T17:50:06Z","links":{"resolver":"https://pith.science/pith/YFPUNFLI3S6CDMCFMS6CUCPO67","bundle":"https://pith.science/pith/YFPUNFLI3S6CDMCFMS6CUCPO67/bundle.json","state":"https://pith.science/pith/YFPUNFLI3S6CDMCFMS6CUCPO67/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YFPUNFLI3S6CDMCFMS6CUCPO67/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aRIAO7Ia+vnu95a5btM8xECldPH/8SYsddQRgbQtNuu8F71coyMyBP3iqq5GDa7hUh6D3Nx9Xch11EHVBcvWDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T17:50:06.066202Z","bundle_sha256":"96cdccbb30fc37b337bce4bbb40afc18d6cb347e916c25bcc7edec11f3a12d8a"}}