{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:PLCCFRER4GGBZBKZXOV2XEQLEY","short_pith_number":"pith:PLCCFRER","schema_version":"1.0","canonical_sha256":"7ac422c491e18c1c8559bbabab920b263952a4e07cd4861dd0048a8c97ff50ca","source":{"kind":"arxiv","id":"2204.07526","version":2},"attestation_state":"computed","paper":{"title":"Statistical-Computational Trade-offs in Tensor PCA and Related Problems via Communication Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Daniel Hsu, Rishabh Dudeja","submitted_at":"2022-04-15T15:59:43Z","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"},"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":"2204.07526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2022-04-15T15:59:43Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"title_canon_sha256":"b08d5830f31bc81c228fefe61bd7e484fcbbf1c459951b498e35a2facbd408a0","abstract_canon_sha256":"d5f993baa2098deed8d164103d99c6b5f0b2009c4dbf8635d7fde2a2ff5750e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:35:34.251640Z","signature_b64":"hGSccMjtwIcH7et+Sx1B5LEFVxisEvBxQQsG7mb/S0dWFu6FS/qd40r7SN9+Pqej6/7aUxhmPrraPMFnIpZCAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ac422c491e18c1c8559bbabab920b263952a4e07cd4861dd0048a8c97ff50ca","last_reissued_at":"2026-07-05T07:35:34.251166Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:35:34.251166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Statistical-Computational Trade-offs in Tensor PCA and Related Problems via Communication Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","math.IT","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Daniel Hsu, Rishabh Dudeja","submitted_at":"2022-04-15T15:59:43Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.07526","kind":"arxiv","version":2},"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/2204.07526/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":"2204.07526","created_at":"2026-07-05T07:35:34.251223+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.07526v2","created_at":"2026-07-05T07:35:34.251223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.07526","created_at":"2026-07-05T07:35:34.251223+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLCCFRER4GGB","created_at":"2026-07-05T07:35:34.251223+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLCCFRER4GGBZBKZ","created_at":"2026-07-05T07:35:34.251223+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLCCFRER","created_at":"2026-07-05T07:35:34.251223+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.26029","citing_title":"Detection Is Harder Than Estimation in Certain Regimes: Inference for Moment and Cumulant Tensors","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PLCCFRER4GGBZBKZXOV2XEQLEY","json":"https://pith.science/pith/PLCCFRER4GGBZBKZXOV2XEQLEY.json","graph_json":"https://pith.science/api/pith-number/PLCCFRER4GGBZBKZXOV2XEQLEY/graph.json","events_json":"https://pith.science/api/pith-number/PLCCFRER4GGBZBKZXOV2XEQLEY/events.json","paper":"https://pith.science/paper/PLCCFRER"},"agent_actions":{"view_html":"https://pith.science/pith/PLCCFRER4GGBZBKZXOV2XEQLEY","download_json":"https://pith.science/pith/PLCCFRER4GGBZBKZXOV2XEQLEY.json","view_paper":"https://pith.science/paper/PLCCFRER","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.07526&json=true","fetch_graph":"https://pith.science/api/pith-number/PLCCFRER4GGBZBKZXOV2XEQLEY/graph.json","fetch_events":"https://pith.science/api/pith-number/PLCCFRER4GGBZBKZXOV2XEQLEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLCCFRER4GGBZBKZXOV2XEQLEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLCCFRER4GGBZBKZXOV2XEQLEY/action/storage_attestation","attest_author":"https://pith.science/pith/PLCCFRER4GGBZBKZXOV2XEQLEY/action/author_attestation","sign_citation":"https://pith.science/pith/PLCCFRER4GGBZBKZXOV2XEQLEY/action/citation_signature","submit_replication":"https://pith.science/pith/PLCCFRER4GGBZBKZXOV2XEQLEY/action/replication_record"}},"created_at":"2026-07-05T07:35:34.251223+00:00","updated_at":"2026-07-05T07:35:34.251223+00:00"}