{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:5Z2OQPGQYWRZSQN5SFBPEVU4FG","short_pith_number":"pith:5Z2OQPGQ","schema_version":"1.0","canonical_sha256":"ee74e83cd0c5a39941bd9142f2569c29910a69d67c0228197750004bada25ed5","source":{"kind":"arxiv","id":"1512.02337","version":2},"attestation_state":"computed","paper":{"title":"Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"David Steurer, Jonathan Shi, Samuel B. Hopkins, Tselil Schramm","submitted_at":"2015-12-08T05:49:07Z","abstract_excerpt":"We consider two problems that arise in machine learning applications: the problem of recovering a planted sparse vector in a random linear subspace and the problem of decomposing a random low-rank overcomplete 3-tensor. For both problems, the best known guarantees are based on the sum-of-squares method. We develop new algorithms inspired by analyses of the sum-of-squares method. Our algorithms achieve the same or similar guarantees as sum-of-squares for these problems but the running time is significantly faster.\n  For the planted sparse vector problem, we give an algorithm with running time n"},"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":"1512.02337","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-12-08T05:49:07Z","cross_cats_sorted":["cs.CC","cs.LG","stat.ML"],"title_canon_sha256":"c9bab099d6f8a5854c6bff89dadf84b7f1080c523b9f029378b7b8efc6620cbb","abstract_canon_sha256":"a16f4b3c45b5d4ebf369544b9f6a6c10e354d050285c53641c0d6e8c4ec48d25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:21.138532Z","signature_b64":"MwIb2QtAVS6CCWBa5jL3x8fdJpf/qSn43Q3S0KtEDpQlsSkeTTdikdV/rog2GfftqDLyLUy+v2qFolKjtohoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee74e83cd0c5a39941bd9142f2569c29910a69d67c0228197750004bada25ed5","last_reissued_at":"2026-05-18T01:21:21.138019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:21.138019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"David Steurer, Jonathan Shi, Samuel B. Hopkins, Tselil Schramm","submitted_at":"2015-12-08T05:49:07Z","abstract_excerpt":"We consider two problems that arise in machine learning applications: the problem of recovering a planted sparse vector in a random linear subspace and the problem of decomposing a random low-rank overcomplete 3-tensor. For both problems, the best known guarantees are based on the sum-of-squares method. We develop new algorithms inspired by analyses of the sum-of-squares method. Our algorithms achieve the same or similar guarantees as sum-of-squares for these problems but the running time is significantly faster.\n  For the planted sparse vector problem, we give an algorithm with running time n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.02337","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":"1512.02337","created_at":"2026-05-18T01:21:21.138104+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.02337v2","created_at":"2026-05-18T01:21:21.138104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.02337","created_at":"2026-05-18T01:21:21.138104+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Z2OQPGQYWRZ","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Z2OQPGQYWRZSQN5","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Z2OQPGQ","created_at":"2026-05-18T12:29:07.941421+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/5Z2OQPGQYWRZSQN5SFBPEVU4FG","json":"https://pith.science/pith/5Z2OQPGQYWRZSQN5SFBPEVU4FG.json","graph_json":"https://pith.science/api/pith-number/5Z2OQPGQYWRZSQN5SFBPEVU4FG/graph.json","events_json":"https://pith.science/api/pith-number/5Z2OQPGQYWRZSQN5SFBPEVU4FG/events.json","paper":"https://pith.science/paper/5Z2OQPGQ"},"agent_actions":{"view_html":"https://pith.science/pith/5Z2OQPGQYWRZSQN5SFBPEVU4FG","download_json":"https://pith.science/pith/5Z2OQPGQYWRZSQN5SFBPEVU4FG.json","view_paper":"https://pith.science/paper/5Z2OQPGQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.02337&json=true","fetch_graph":"https://pith.science/api/pith-number/5Z2OQPGQYWRZSQN5SFBPEVU4FG/graph.json","fetch_events":"https://pith.science/api/pith-number/5Z2OQPGQYWRZSQN5SFBPEVU4FG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Z2OQPGQYWRZSQN5SFBPEVU4FG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Z2OQPGQYWRZSQN5SFBPEVU4FG/action/storage_attestation","attest_author":"https://pith.science/pith/5Z2OQPGQYWRZSQN5SFBPEVU4FG/action/author_attestation","sign_citation":"https://pith.science/pith/5Z2OQPGQYWRZSQN5SFBPEVU4FG/action/citation_signature","submit_replication":"https://pith.science/pith/5Z2OQPGQYWRZSQN5SFBPEVU4FG/action/replication_record"}},"created_at":"2026-05-18T01:21:21.138104+00:00","updated_at":"2026-05-18T01:21:21.138104+00:00"}