{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:R2SCVKV4FOAKRT7D5CYJEGSPBN","short_pith_number":"pith:R2SCVKV4","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"},"canonical_sha256":"8ea42aaabc2b80a8cfe3e8b0921a4f0b74e37757a4125b77b92fe262ac5b04d1","source":{"kind":"arxiv","id":"1407.1543","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1543","created_at":"2026-05-18T02:38:19Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1543v2","created_at":"2026-05-18T02:38:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1543","created_at":"2026-05-18T02:38:19Z"},{"alias_kind":"pith_short_12","alias_value":"R2SCVKV4FOAK","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"R2SCVKV4FOAKRT7D","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"R2SCVKV4","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:R2SCVKV4FOAKRT7D5CYJEGSPBN","target":"record","payload":{"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"},"canonical_sha256":"8ea42aaabc2b80a8cfe3e8b0921a4f0b74e37757a4125b77b92fe262ac5b04d1","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"},"source_kind":"arxiv","source_id":"1407.1543","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:38:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KtCedcFNIb8QDoG7nA4aPH2XCaYjqKlrYVJYe36S4Y6uv3GL/wRh0SvFe7esFzb1DLDPfaGr9TCLdCTaqLmwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:19:02.164475Z"},"content_sha256":"ec8d5e84c9b100d0f8474cc24457f1998bd71cfe48170c4180da87346a81b115","schema_version":"1.0","event_id":"sha256:ec8d5e84c9b100d0f8474cc24457f1998bd71cfe48170c4180da87346a81b115"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:R2SCVKV4FOAKRT7D5CYJEGSPBN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:38:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yvuIT1op6NJORG/PQ2W0gIlOGHD54biDyTsDf7zYlX5q+ITohP2Titrt4VNmA9g7TOCUTBMX2/gclKdmmJYDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:19:02.165158Z"},"content_sha256":"b1437d789a9d81e499fa7d3c8362e1ff81fa09d45a28e160502054fa985248a0","schema_version":"1.0","event_id":"sha256:b1437d789a9d81e499fa7d3c8362e1ff81fa09d45a28e160502054fa985248a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R2SCVKV4FOAKRT7D5CYJEGSPBN/bundle.json","state_url":"https://pith.science/pith/R2SCVKV4FOAKRT7D5CYJEGSPBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R2SCVKV4FOAKRT7D5CYJEGSPBN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-09T08:19:02Z","links":{"resolver":"https://pith.science/pith/R2SCVKV4FOAKRT7D5CYJEGSPBN","bundle":"https://pith.science/pith/R2SCVKV4FOAKRT7D5CYJEGSPBN/bundle.json","state":"https://pith.science/pith/R2SCVKV4FOAKRT7D5CYJEGSPBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R2SCVKV4FOAKRT7D5CYJEGSPBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:R2SCVKV4FOAKRT7D5CYJEGSPBN","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":"997b394496a0d919696c36a6aa226ca00d40d2281041ad8a72c4a775fe934f72","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-06T20:42:05Z","title_canon_sha256":"88c74aad521524bf91b9fde676549490ffaa14012c97d3b2cd9ce045b178650d"},"schema_version":"1.0","source":{"id":"1407.1543","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.1543","created_at":"2026-05-18T02:38:19Z"},{"alias_kind":"arxiv_version","alias_value":"1407.1543v2","created_at":"2026-05-18T02:38:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1543","created_at":"2026-05-18T02:38:19Z"},{"alias_kind":"pith_short_12","alias_value":"R2SCVKV4FOAK","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"R2SCVKV4FOAKRT7D","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"R2SCVKV4","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:b1437d789a9d81e499fa7d3c8362e1ff81fa09d45a28e160502054fa985248a0","target":"graph","created_at":"2026-05-18T02:38:19Z","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 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","authors_text":"Boaz Barak, David Steurer, Jonathan A. Kelner","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-06T20:42:05Z","title":"Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1543","kind":"arxiv","version":2},"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:ec8d5e84c9b100d0f8474cc24457f1998bd71cfe48170c4180da87346a81b115","target":"record","created_at":"2026-05-18T02:38:19Z","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":"997b394496a0d919696c36a6aa226ca00d40d2281041ad8a72c4a775fe934f72","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-06T20:42:05Z","title_canon_sha256":"88c74aad521524bf91b9fde676549490ffaa14012c97d3b2cd9ce045b178650d"},"schema_version":"1.0","source":{"id":"1407.1543","kind":"arxiv","version":2}},"canonical_sha256":"8ea42aaabc2b80a8cfe3e8b0921a4f0b74e37757a4125b77b92fe262ac5b04d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ea42aaabc2b80a8cfe3e8b0921a4f0b74e37757a4125b77b92fe262ac5b04d1","first_computed_at":"2026-05-18T02:38:19.717887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:19.717887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZUhJ1bYAKWtqFfWQkQ8v2OOyItfg2HBKug4T/5f0+S9eNGoR9wiynDxxV440nKZ3eCE6pUequn2r/LwYkINKDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:19.718486Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.1543","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec8d5e84c9b100d0f8474cc24457f1998bd71cfe48170c4180da87346a81b115","sha256:b1437d789a9d81e499fa7d3c8362e1ff81fa09d45a28e160502054fa985248a0"],"state_sha256":"f1d0d26ad8653eb7c4c47e02d85e8d2c267594e9643650f1e01fc4edab40dc66"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CiS60Gv4xpAiaTmViXKEu/nANbTbm4FlzOoc7PbUHxe5jCCZdHQAKsXqi/9e1jRL/er+YUtd8ktvVkS9pVMZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:19:02.169352Z","bundle_sha256":"c5b450bd670d1d9b88553772d087f3ed6b5d356da227442341e571d1340af149"}}