{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GUDUIBCAOGXO7ND3XMRICRPAWV","short_pith_number":"pith:GUDUIBCA","schema_version":"1.0","canonical_sha256":"350744044071aeefb47bbb228145e0b5585630a0554baa11e5db21f0c0f73d2f","source":{"kind":"arxiv","id":"1907.11635","version":3},"attestation_state":"computed","paper":{"title":"Subexponential-Time Algorithms for Sparse PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Afonso S. Bandeira, Alexander S. Wein, Dmitriy Kunisky, Yunzi Ding","submitted_at":"2019-07-26T15:45:13Z","abstract_excerpt":"We study the computational cost of recovering a unit-norm sparse principal component $x \\in \\mathbb{R}^n$ planted in a random matrix, in either the Wigner or Wishart spiked model (observing either $W + \\lambda xx^\\top$ with $W$ drawn from the Gaussian orthogonal ensemble, or $N$ independent samples from $\\mathcal{N}(0, I_n + \\beta xx^\\top)$, respectively). Prior work has shown that when the signal-to-noise ratio ($\\lambda$ or $\\beta\\sqrt{N/n}$, respectively) is a small constant and the fraction of nonzero entries in the planted vector is $\\|x\\|_0 / n = \\rho$, it is possible to recover $x$ in p"},"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":"1907.11635","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-07-26T15:45:13Z","cross_cats_sorted":["cs.CC","cs.DS","stat.ML","stat.TH"],"title_canon_sha256":"5135f9c08e47e129ce8f56f3ace4db4b829a2cd0b01c13dd85fe4dfa85535ccb","abstract_canon_sha256":"aa95672508bfbbb600b0a191dd9ff2d05a15e4f499e5508efdebdd8f00e18475"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:34:10.941889Z","signature_b64":"YcNHbMgE8VMhiCJE8fN+g72YBKiCi+Rvm1kMjE1oVzOHztmCgZSmiEd0Uu52r2p3zgRX9S7gwOkoAPPj5VfWDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"350744044071aeefb47bbb228145e0b5585630a0554baa11e5db21f0c0f73d2f","last_reissued_at":"2026-07-05T04:34:10.941482Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:34:10.941482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subexponential-Time Algorithms for Sparse PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Afonso S. Bandeira, Alexander S. Wein, Dmitriy Kunisky, Yunzi Ding","submitted_at":"2019-07-26T15:45:13Z","abstract_excerpt":"We study the computational cost of recovering a unit-norm sparse principal component $x \\in \\mathbb{R}^n$ planted in a random matrix, in either the Wigner or Wishart spiked model (observing either $W + \\lambda xx^\\top$ with $W$ drawn from the Gaussian orthogonal ensemble, or $N$ independent samples from $\\mathcal{N}(0, I_n + \\beta xx^\\top)$, respectively). Prior work has shown that when the signal-to-noise ratio ($\\lambda$ or $\\beta\\sqrt{N/n}$, respectively) is a small constant and the fraction of nonzero entries in the planted vector is $\\|x\\|_0 / n = \\rho$, it is possible to recover $x$ in p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11635","kind":"arxiv","version":3},"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/1907.11635/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":"1907.11635","created_at":"2026-07-05T04:34:10.941536+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.11635v3","created_at":"2026-07-05T04:34:10.941536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11635","created_at":"2026-07-05T04:34:10.941536+00:00"},{"alias_kind":"pith_short_12","alias_value":"GUDUIBCAOGXO","created_at":"2026-07-05T04:34:10.941536+00:00"},{"alias_kind":"pith_short_16","alias_value":"GUDUIBCAOGXO7ND3","created_at":"2026-07-05T04:34:10.941536+00:00"},{"alias_kind":"pith_short_8","alias_value":"GUDUIBCA","created_at":"2026-07-05T04:34:10.941536+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.22743","citing_title":"Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GUDUIBCAOGXO7ND3XMRICRPAWV","json":"https://pith.science/pith/GUDUIBCAOGXO7ND3XMRICRPAWV.json","graph_json":"https://pith.science/api/pith-number/GUDUIBCAOGXO7ND3XMRICRPAWV/graph.json","events_json":"https://pith.science/api/pith-number/GUDUIBCAOGXO7ND3XMRICRPAWV/events.json","paper":"https://pith.science/paper/GUDUIBCA"},"agent_actions":{"view_html":"https://pith.science/pith/GUDUIBCAOGXO7ND3XMRICRPAWV","download_json":"https://pith.science/pith/GUDUIBCAOGXO7ND3XMRICRPAWV.json","view_paper":"https://pith.science/paper/GUDUIBCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.11635&json=true","fetch_graph":"https://pith.science/api/pith-number/GUDUIBCAOGXO7ND3XMRICRPAWV/graph.json","fetch_events":"https://pith.science/api/pith-number/GUDUIBCAOGXO7ND3XMRICRPAWV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GUDUIBCAOGXO7ND3XMRICRPAWV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GUDUIBCAOGXO7ND3XMRICRPAWV/action/storage_attestation","attest_author":"https://pith.science/pith/GUDUIBCAOGXO7ND3XMRICRPAWV/action/author_attestation","sign_citation":"https://pith.science/pith/GUDUIBCAOGXO7ND3XMRICRPAWV/action/citation_signature","submit_replication":"https://pith.science/pith/GUDUIBCAOGXO7ND3XMRICRPAWV/action/replication_record"}},"created_at":"2026-07-05T04:34:10.941536+00:00","updated_at":"2026-07-05T04:34:10.941536+00:00"}