{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:R2SCVKV4FOAKRT7D5CYJEGSPBN","short_pith_number":"pith:R2SCVKV4","schema_version":"1.0","canonical_sha256":"8ea42aaabc2b80a8cfe3e8b0921a4f0b74e37757a4125b77b92fe262ac5b04d1","source":{"kind":"arxiv","id":"1407.1543","version":2},"attestation_state":"computed","paper":{"title":"Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Boaz Barak, David Steurer, Jonathan A. Kelner","submitted_at":"2014-07-06T20:42:05Z","abstract_excerpt":"We give a new approach to the dictionary learning (also known as \"sparse coding\") problem of recovering an unknown $n\\times m$ matrix $A$ (for $m \\geq n$) from examples of the form \\[ y = Ax + e, \\] where $x$ is a random vector in $\\mathbb R^m$ with at most $\\tau m$ nonzero coordinates, and $e$ is a random noise vector in $\\mathbb R^n$ with bounded magnitude. For the case $m=O(n)$, our algorithm recovers every column of $A$ within arbitrarily good constant accuracy in time $m^{O(\\log m/\\log(\\tau^{-1}))}$, in particular achieving polynomial time if $\\tau = m^{-\\delta}$ for any $\\delta>0$, and t"},"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":"1407.1543","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-06T20:42:05Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"88c74aad521524bf91b9fde676549490ffaa14012c97d3b2cd9ce045b178650d","abstract_canon_sha256":"997b394496a0d919696c36a6aa226ca00d40d2281041ad8a72c4a775fe934f72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:19.718486Z","signature_b64":"ZUhJ1bYAKWtqFfWQkQ8v2OOyItfg2HBKug4T/5f0+S9eNGoR9wiynDxxV440nKZ3eCE6pUequn2r/LwYkINKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ea42aaabc2b80a8cfe3e8b0921a4f0b74e37757a4125b77b92fe262ac5b04d1","last_reissued_at":"2026-05-18T02:38:19.717887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:19.717887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Boaz Barak, David Steurer, Jonathan A. Kelner","submitted_at":"2014-07-06T20:42:05Z","abstract_excerpt":"We give a new approach to the dictionary learning (also known as \"sparse coding\") problem of recovering an unknown $n\\times m$ matrix $A$ (for $m \\geq n$) from examples of the form \\[ y = Ax + e, \\] where $x$ is a random vector in $\\mathbb R^m$ with at most $\\tau m$ nonzero coordinates, and $e$ is a random noise vector in $\\mathbb R^n$ with bounded magnitude. For the case $m=O(n)$, our algorithm recovers every column of $A$ within arbitrarily good constant accuracy in time $m^{O(\\log m/\\log(\\tau^{-1}))}$, in particular achieving polynomial time if $\\tau = m^{-\\delta}$ for any $\\delta>0$, and t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1543","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":"1407.1543","created_at":"2026-05-18T02:38:19.717992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.1543v2","created_at":"2026-05-18T02:38:19.717992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1543","created_at":"2026-05-18T02:38:19.717992+00:00"},{"alias_kind":"pith_short_12","alias_value":"R2SCVKV4FOAK","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"R2SCVKV4FOAKRT7D","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"R2SCVKV4","created_at":"2026-05-18T12:28:46.137349+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/R2SCVKV4FOAKRT7D5CYJEGSPBN","json":"https://pith.science/pith/R2SCVKV4FOAKRT7D5CYJEGSPBN.json","graph_json":"https://pith.science/api/pith-number/R2SCVKV4FOAKRT7D5CYJEGSPBN/graph.json","events_json":"https://pith.science/api/pith-number/R2SCVKV4FOAKRT7D5CYJEGSPBN/events.json","paper":"https://pith.science/paper/R2SCVKV4"},"agent_actions":{"view_html":"https://pith.science/pith/R2SCVKV4FOAKRT7D5CYJEGSPBN","download_json":"https://pith.science/pith/R2SCVKV4FOAKRT7D5CYJEGSPBN.json","view_paper":"https://pith.science/paper/R2SCVKV4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.1543&json=true","fetch_graph":"https://pith.science/api/pith-number/R2SCVKV4FOAKRT7D5CYJEGSPBN/graph.json","fetch_events":"https://pith.science/api/pith-number/R2SCVKV4FOAKRT7D5CYJEGSPBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R2SCVKV4FOAKRT7D5CYJEGSPBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R2SCVKV4FOAKRT7D5CYJEGSPBN/action/storage_attestation","attest_author":"https://pith.science/pith/R2SCVKV4FOAKRT7D5CYJEGSPBN/action/author_attestation","sign_citation":"https://pith.science/pith/R2SCVKV4FOAKRT7D5CYJEGSPBN/action/citation_signature","submit_replication":"https://pith.science/pith/R2SCVKV4FOAKRT7D5CYJEGSPBN/action/replication_record"}},"created_at":"2026-05-18T02:38:19.717992+00:00","updated_at":"2026-05-18T02:38:19.717992+00:00"}