{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:PLCCFRER4GGBZBKZXOV2XEQLEY","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":"d5f993baa2098deed8d164103d99c6b5f0b2009c4dbf8635d7fde2a2ff5750e9","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2022-04-15T15:59:43Z","title_canon_sha256":"b08d5830f31bc81c228fefe61bd7e484fcbbf1c459951b498e35a2facbd408a0"},"schema_version":"1.0","source":{"id":"2204.07526","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.07526","created_at":"2026-07-05T07:35:34Z"},{"alias_kind":"arxiv_version","alias_value":"2204.07526v2","created_at":"2026-07-05T07:35:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.07526","created_at":"2026-07-05T07:35:34Z"},{"alias_kind":"pith_short_12","alias_value":"PLCCFRER4GGB","created_at":"2026-07-05T07:35:34Z"},{"alias_kind":"pith_short_16","alias_value":"PLCCFRER4GGBZBKZ","created_at":"2026-07-05T07:35:34Z"},{"alias_kind":"pith_short_8","alias_value":"PLCCFRER","created_at":"2026-07-05T07:35:34Z"}],"graph_snapshots":[{"event_id":"sha256:c457c025756a08d627b7489a23717a0ed8a69be779b441817102412e89de93c7","target":"graph","created_at":"2026-07-05T07:35:34Z","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/2204.07526/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Tensor PCA is a stylized statistical inference problem introduced by Montanari and Richard to study the computational difficulty of estimating an unknown parameter from higher-order moment tensors. Unlike its matrix counterpart, Tensor PCA exhibits a statistical-computational gap, i.e., a sample size regime where the problem is information-theoretically solvable but conjectured to be computationally hard. This paper derives computational lower bounds on the run-time of memory bounded algorithms for Tensor PCA using communication complexity. These lower bounds specify a trade-off among the numb","authors_text":"Daniel Hsu, Rishabh Dudeja","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2022-04-15T15:59:43Z","title":"Statistical-Computational Trade-offs in Tensor PCA and Related Problems via Communication Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.07526","kind":"arxiv","version":2},"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:840a469d0d23314719c3ff19406fcd278c14aa8ff1619a36fecd6acad1959ede","target":"record","created_at":"2026-07-05T07:35:34Z","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":"d5f993baa2098deed8d164103d99c6b5f0b2009c4dbf8635d7fde2a2ff5750e9","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2022-04-15T15:59:43Z","title_canon_sha256":"b08d5830f31bc81c228fefe61bd7e484fcbbf1c459951b498e35a2facbd408a0"},"schema_version":"1.0","source":{"id":"2204.07526","kind":"arxiv","version":2}},"canonical_sha256":"7ac422c491e18c1c8559bbabab920b263952a4e07cd4861dd0048a8c97ff50ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ac422c491e18c1c8559bbabab920b263952a4e07cd4861dd0048a8c97ff50ca","first_computed_at":"2026-07-05T07:35:34.251166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:35:34.251166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hGSccMjtwIcH7et+Sx1B5LEFVxisEvBxQQsG7mb/S0dWFu6FS/qd40r7SN9+Pqej6/7aUxhmPrraPMFnIpZCAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:35:34.251640Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.07526","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:840a469d0d23314719c3ff19406fcd278c14aa8ff1619a36fecd6acad1959ede","sha256:c457c025756a08d627b7489a23717a0ed8a69be779b441817102412e89de93c7"],"state_sha256":"47d3f00a5e47fd725a8e27fc120cedd18008a23f4da29e004342cadb87ebf9e2"}