{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JUOVXUVBZNJZDXIF5VMQCNNKPS","short_pith_number":"pith:JUOVXUVB","schema_version":"1.0","canonical_sha256":"4d1d5bd2a1cb5391dd05ed590135aa7ca8d2b953e54a713bf6474eaf2c27f046","source":{"kind":"arxiv","id":"1704.04548","version":1},"attestation_state":"computed","paper":{"title":"On the Gap Between Strict-Saddles and True Convexity: An Omega(log d) Lower Bound for Eigenvector Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.CO","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ahmed El Alaoui, Benjamin Recht, Max Simchowitz","submitted_at":"2017-04-14T21:56:11Z","abstract_excerpt":"We prove a \\emph{query complexity} lower bound on rank-one principal component analysis (PCA). We consider an oracle model where, given a symmetric matrix $M \\in \\mathbb{R}^{d \\times d}$, an algorithm is allowed to make $T$ \\emph{exact} queries of the form $w^{(i)} = Mv^{(i)}$ for $i \\in \\{1,\\dots,T\\}$, where $v^{(i)}$ is drawn from a distribution which depends arbitrarily on the past queries and measurements $\\{v^{(j)},w^{(j)}\\}_{1 \\le j \\le i-1}$. We show that for a small constant $\\epsilon$, any adaptive, randomized algorithm which can find a unit vector $\\widehat{v}$ for which $\\widehat{v}"},"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":"1704.04548","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-14T21:56:11Z","cross_cats_sorted":["cs.DS","cs.IT","math.CO","math.IT","stat.ML"],"title_canon_sha256":"18b94f3144ab4f9823df9a4de5a43b538724e01f4e57aacccbe11ff019525a3c","abstract_canon_sha256":"7028199863f82ee0b92f36ee02f635965e871571714d34dc75cabf9f81bae1f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:18.206539Z","signature_b64":"trmmaRDpe3/MxbKi+aVti3+jupS2WPJmDa90sbtTBNP31vt4Jd+0lb5CIVqQzETptcUxDbpvqLhgjAW6D8gUCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d1d5bd2a1cb5391dd05ed590135aa7ca8d2b953e54a713bf6474eaf2c27f046","last_reissued_at":"2026-05-18T00:46:18.206090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:18.206090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Gap Between Strict-Saddles and True Convexity: An Omega(log d) Lower Bound for Eigenvector Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.CO","math.IT","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ahmed El Alaoui, Benjamin Recht, Max Simchowitz","submitted_at":"2017-04-14T21:56:11Z","abstract_excerpt":"We prove a \\emph{query complexity} lower bound on rank-one principal component analysis (PCA). We consider an oracle model where, given a symmetric matrix $M \\in \\mathbb{R}^{d \\times d}$, an algorithm is allowed to make $T$ \\emph{exact} queries of the form $w^{(i)} = Mv^{(i)}$ for $i \\in \\{1,\\dots,T\\}$, where $v^{(i)}$ is drawn from a distribution which depends arbitrarily on the past queries and measurements $\\{v^{(j)},w^{(j)}\\}_{1 \\le j \\le i-1}$. We show that for a small constant $\\epsilon$, any adaptive, randomized algorithm which can find a unit vector $\\widehat{v}$ for which $\\widehat{v}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04548","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":""},"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":"1704.04548","created_at":"2026-05-18T00:46:18.206168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.04548v1","created_at":"2026-05-18T00:46:18.206168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04548","created_at":"2026-05-18T00:46:18.206168+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUOVXUVBZNJZ","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUOVXUVBZNJZDXIF","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUOVXUVB","created_at":"2026-05-18T12:31:24.725408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JUOVXUVBZNJZDXIF5VMQCNNKPS","json":"https://pith.science/pith/JUOVXUVBZNJZDXIF5VMQCNNKPS.json","graph_json":"https://pith.science/api/pith-number/JUOVXUVBZNJZDXIF5VMQCNNKPS/graph.json","events_json":"https://pith.science/api/pith-number/JUOVXUVBZNJZDXIF5VMQCNNKPS/events.json","paper":"https://pith.science/paper/JUOVXUVB"},"agent_actions":{"view_html":"https://pith.science/pith/JUOVXUVBZNJZDXIF5VMQCNNKPS","download_json":"https://pith.science/pith/JUOVXUVBZNJZDXIF5VMQCNNKPS.json","view_paper":"https://pith.science/paper/JUOVXUVB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.04548&json=true","fetch_graph":"https://pith.science/api/pith-number/JUOVXUVBZNJZDXIF5VMQCNNKPS/graph.json","fetch_events":"https://pith.science/api/pith-number/JUOVXUVBZNJZDXIF5VMQCNNKPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUOVXUVBZNJZDXIF5VMQCNNKPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUOVXUVBZNJZDXIF5VMQCNNKPS/action/storage_attestation","attest_author":"https://pith.science/pith/JUOVXUVBZNJZDXIF5VMQCNNKPS/action/author_attestation","sign_citation":"https://pith.science/pith/JUOVXUVBZNJZDXIF5VMQCNNKPS/action/citation_signature","submit_replication":"https://pith.science/pith/JUOVXUVBZNJZDXIF5VMQCNNKPS/action/replication_record"}},"created_at":"2026-05-18T00:46:18.206168+00:00","updated_at":"2026-05-18T00:46:18.206168+00:00"}