{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:5FXESDOY5BTD5BD6P2IJXF5IGK","short_pith_number":"pith:5FXESDOY","schema_version":"1.0","canonical_sha256":"e96e490dd8e8663e847e7e909b97a8328fd51cd0179d6015aac76b98188d4ddc","source":{"kind":"arxiv","id":"1902.07324","version":2},"attestation_state":"computed","paper":{"title":"Computational Hardness of Certifying Bounds on Constrained PCA Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Afonso S. Bandeira, Alexander S. Wein, Dmitriy Kunisky","submitted_at":"2019-02-19T22:18:46Z","abstract_excerpt":"Given a random $n \\times n$ symmetric matrix $\\boldsymbol W$ drawn from the Gaussian orthogonal ensemble (GOE), we consider the problem of certifying an upper bound on the maximum value of the quadratic form $\\boldsymbol x^\\top \\boldsymbol W \\boldsymbol x$ over all vectors $\\boldsymbol x$ in a constraint set $\\mathcal{S} \\subset \\mathbb{R}^n$. For a certain class of normalized constraint sets $\\mathcal{S}$ we show that, conditional on certain complexity-theoretic assumptions, there is no polynomial-time algorithm certifying a better upper bound than the largest eigenvalue of $\\boldsymbol W$. A"},"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":"1902.07324","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-02-19T22:18:46Z","cross_cats_sorted":["cs.CC","math.ST","stat.TH"],"title_canon_sha256":"7345224c094d7e295977f305678313a9c4e4cfe367a44097cc3cf522f7248609","abstract_canon_sha256":"c7715e6651c885d97232101c8bbfb419f5bcf45c1b3e899ec48404d1c2c2822b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:14.596974Z","signature_b64":"Zv7sx2o9ugE9xxi7qfIICpj7bDPtmnqoXI6m1xCVb1kcKqIqUvgdhcmXXteDW2OCdnm+do0wkQo6Ne9omqwLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e96e490dd8e8663e847e7e909b97a8328fd51cd0179d6015aac76b98188d4ddc","last_reissued_at":"2026-05-17T23:49:14.596199Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:14.596199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Hardness of Certifying Bounds on Constrained PCA Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.ST","stat.TH"],"primary_cat":"cs.DS","authors_text":"Afonso S. Bandeira, Alexander S. Wein, Dmitriy Kunisky","submitted_at":"2019-02-19T22:18:46Z","abstract_excerpt":"Given a random $n \\times n$ symmetric matrix $\\boldsymbol W$ drawn from the Gaussian orthogonal ensemble (GOE), we consider the problem of certifying an upper bound on the maximum value of the quadratic form $\\boldsymbol x^\\top \\boldsymbol W \\boldsymbol x$ over all vectors $\\boldsymbol x$ in a constraint set $\\mathcal{S} \\subset \\mathbb{R}^n$. For a certain class of normalized constraint sets $\\mathcal{S}$ we show that, conditional on certain complexity-theoretic assumptions, there is no polynomial-time algorithm certifying a better upper bound than the largest eigenvalue of $\\boldsymbol W$. A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07324","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":""},"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":"1902.07324","created_at":"2026-05-17T23:49:14.596342+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07324v2","created_at":"2026-05-17T23:49:14.596342+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07324","created_at":"2026-05-17T23:49:14.596342+00:00"},{"alias_kind":"pith_short_12","alias_value":"5FXESDOY5BTD","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"5FXESDOY5BTD5BD6","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"5FXESDOY","created_at":"2026-05-18T12:33:10.108867+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.11636","citing_title":"Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5FXESDOY5BTD5BD6P2IJXF5IGK","json":"https://pith.science/pith/5FXESDOY5BTD5BD6P2IJXF5IGK.json","graph_json":"https://pith.science/api/pith-number/5FXESDOY5BTD5BD6P2IJXF5IGK/graph.json","events_json":"https://pith.science/api/pith-number/5FXESDOY5BTD5BD6P2IJXF5IGK/events.json","paper":"https://pith.science/paper/5FXESDOY"},"agent_actions":{"view_html":"https://pith.science/pith/5FXESDOY5BTD5BD6P2IJXF5IGK","download_json":"https://pith.science/pith/5FXESDOY5BTD5BD6P2IJXF5IGK.json","view_paper":"https://pith.science/paper/5FXESDOY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07324&json=true","fetch_graph":"https://pith.science/api/pith-number/5FXESDOY5BTD5BD6P2IJXF5IGK/graph.json","fetch_events":"https://pith.science/api/pith-number/5FXESDOY5BTD5BD6P2IJXF5IGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5FXESDOY5BTD5BD6P2IJXF5IGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5FXESDOY5BTD5BD6P2IJXF5IGK/action/storage_attestation","attest_author":"https://pith.science/pith/5FXESDOY5BTD5BD6P2IJXF5IGK/action/author_attestation","sign_citation":"https://pith.science/pith/5FXESDOY5BTD5BD6P2IJXF5IGK/action/citation_signature","submit_replication":"https://pith.science/pith/5FXESDOY5BTD5BD6P2IJXF5IGK/action/replication_record"}},"created_at":"2026-05-17T23:49:14.596342+00:00","updated_at":"2026-05-17T23:49:14.596342+00:00"}