{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:AU47RCJSLRNNI7SJFAOI6BA2RG","short_pith_number":"pith:AU47RCJS","schema_version":"1.0","canonical_sha256":"0539f889325c5ad47e49281c8f041a89a46e7c6477c9f85fbcaf26bca67559f1","source":{"kind":"arxiv","id":"2011.04253","version":2},"attestation_state":"computed","paper":{"title":"Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aaron Potechin, Goutham Rajendran","submitted_at":"2020-11-09T08:58:38Z","abstract_excerpt":"In this paper, we construct general machinery for proving Sum-of-Squares lower bounds on certification problems by generalizing the techniques used by Barak et al. [FOCS 2016] to prove Sum-of-Squares lower bounds for planted clique. Using this machinery, we prove degree $n^{\\epsilon}$ Sum-of-Squares lower bounds for tensor PCA, the Wishart model of sparse PCA, and a variant of planted clique which we call planted slightly denser subgraph."},"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":"2011.04253","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2020-11-09T08:58:38Z","cross_cats_sorted":[],"title_canon_sha256":"b603790b1c79f370c1de7b7d570107b565a57c630adc844284deffeb99eb3a24","abstract_canon_sha256":"d53e590f8c8bbc9344fde5c6732e260124b1124870cfc979a91acd09be4204fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:40:19.704522Z","signature_b64":"x3NbjjaxPFgF+qxnB04JbLqTbStLqw3MdVTFspp6GR1x2hCKGs5leS7mQR0vnKxyct774MKblzA06vbONc1cCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0539f889325c5ad47e49281c8f041a89a46e7c6477c9f85fbcaf26bca67559f1","last_reissued_at":"2026-07-05T05:40:19.704105Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:40:19.704105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Machinery for Proving Sum-of-Squares Lower Bounds on Certification Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Aaron Potechin, Goutham Rajendran","submitted_at":"2020-11-09T08:58:38Z","abstract_excerpt":"In this paper, we construct general machinery for proving Sum-of-Squares lower bounds on certification problems by generalizing the techniques used by Barak et al. [FOCS 2016] to prove Sum-of-Squares lower bounds for planted clique. Using this machinery, we prove degree $n^{\\epsilon}$ Sum-of-Squares lower bounds for tensor PCA, the Wishart model of sparse PCA, and a variant of planted clique which we call planted slightly denser subgraph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04253","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/2011.04253/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":"2011.04253","created_at":"2026-07-05T05:40:19.704160+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.04253v2","created_at":"2026-07-05T05:40:19.704160+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04253","created_at":"2026-07-05T05:40:19.704160+00:00"},{"alias_kind":"pith_short_12","alias_value":"AU47RCJSLRNN","created_at":"2026-07-05T05:40:19.704160+00:00"},{"alias_kind":"pith_short_16","alias_value":"AU47RCJSLRNNI7SJ","created_at":"2026-07-05T05:40:19.704160+00:00"},{"alias_kind":"pith_short_8","alias_value":"AU47RCJS","created_at":"2026-07-05T05:40:19.704160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"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":54,"is_internal_anchor":false},{"citing_arxiv_id":"2604.27336","citing_title":"Strongly Refuting Random CSP without Literals","ref_index":1,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AU47RCJSLRNNI7SJFAOI6BA2RG","json":"https://pith.science/pith/AU47RCJSLRNNI7SJFAOI6BA2RG.json","graph_json":"https://pith.science/api/pith-number/AU47RCJSLRNNI7SJFAOI6BA2RG/graph.json","events_json":"https://pith.science/api/pith-number/AU47RCJSLRNNI7SJFAOI6BA2RG/events.json","paper":"https://pith.science/paper/AU47RCJS"},"agent_actions":{"view_html":"https://pith.science/pith/AU47RCJSLRNNI7SJFAOI6BA2RG","download_json":"https://pith.science/pith/AU47RCJSLRNNI7SJFAOI6BA2RG.json","view_paper":"https://pith.science/paper/AU47RCJS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.04253&json=true","fetch_graph":"https://pith.science/api/pith-number/AU47RCJSLRNNI7SJFAOI6BA2RG/graph.json","fetch_events":"https://pith.science/api/pith-number/AU47RCJSLRNNI7SJFAOI6BA2RG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AU47RCJSLRNNI7SJFAOI6BA2RG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AU47RCJSLRNNI7SJFAOI6BA2RG/action/storage_attestation","attest_author":"https://pith.science/pith/AU47RCJSLRNNI7SJFAOI6BA2RG/action/author_attestation","sign_citation":"https://pith.science/pith/AU47RCJSLRNNI7SJFAOI6BA2RG/action/citation_signature","submit_replication":"https://pith.science/pith/AU47RCJSLRNNI7SJFAOI6BA2RG/action/replication_record"}},"created_at":"2026-07-05T05:40:19.704160+00:00","updated_at":"2026-07-05T05:40:19.704160+00:00"}