{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JUOVXUVBZNJZDXIF5VMQCNNKPS","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":"7028199863f82ee0b92f36ee02f635965e871571714d34dc75cabf9f81bae1f5","cross_cats_sorted":["cs.DS","cs.IT","math.CO","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-14T21:56:11Z","title_canon_sha256":"18b94f3144ab4f9823df9a4de5a43b538724e01f4e57aacccbe11ff019525a3c"},"schema_version":"1.0","source":{"id":"1704.04548","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.04548","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"arxiv_version","alias_value":"1704.04548v1","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.04548","created_at":"2026-05-18T00:46:18Z"},{"alias_kind":"pith_short_12","alias_value":"JUOVXUVBZNJZ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JUOVXUVBZNJZDXIF","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JUOVXUVB","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:6e71fbcac90a0f65b1092af97d189621eae06cfb53556eda7ebde155e6bf7faa","target":"graph","created_at":"2026-05-18T00:46:18Z","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"},"paper":{"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}","authors_text":"Ahmed El Alaoui, Benjamin Recht, Max Simchowitz","cross_cats":["cs.DS","cs.IT","math.CO","math.IT","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-14T21:56:11Z","title":"On the Gap Between Strict-Saddles and True Convexity: An Omega(log d) Lower Bound for Eigenvector Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.04548","kind":"arxiv","version":1},"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:e5599b39d2eed0ac93a5627ccae55734adaae8ff9a27e6b56efdc81f759db50c","target":"record","created_at":"2026-05-18T00:46:18Z","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":"7028199863f82ee0b92f36ee02f635965e871571714d34dc75cabf9f81bae1f5","cross_cats_sorted":["cs.DS","cs.IT","math.CO","math.IT","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-04-14T21:56:11Z","title_canon_sha256":"18b94f3144ab4f9823df9a4de5a43b538724e01f4e57aacccbe11ff019525a3c"},"schema_version":"1.0","source":{"id":"1704.04548","kind":"arxiv","version":1}},"canonical_sha256":"4d1d5bd2a1cb5391dd05ed590135aa7ca8d2b953e54a713bf6474eaf2c27f046","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d1d5bd2a1cb5391dd05ed590135aa7ca8d2b953e54a713bf6474eaf2c27f046","first_computed_at":"2026-05-18T00:46:18.206090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:18.206090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"trmmaRDpe3/MxbKi+aVti3+jupS2WPJmDa90sbtTBNP31vt4Jd+0lb5CIVqQzETptcUxDbpvqLhgjAW6D8gUCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:18.206539Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.04548","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5599b39d2eed0ac93a5627ccae55734adaae8ff9a27e6b56efdc81f759db50c","sha256:6e71fbcac90a0f65b1092af97d189621eae06cfb53556eda7ebde155e6bf7faa"],"state_sha256":"8a66bd7d83bbab8e02bcc6314aae075f5a386785a92f99b5474f026b08492728"}