{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MIM57BKG63XCXISHR6ZOYHHID2","short_pith_number":"pith:MIM57BKG","canonical_record":{"source":{"id":"1401.0579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-03T02:52:17Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a04207da299e8a2e42e107a4b03faacdabe42a0c1ad5073da49ac7975e9d5a97","abstract_canon_sha256":"da08ffe92cd2636072d6fef0320bd323100abb76e9a21169b32e8befc933d597"},"schema_version":"1.0"},"canonical_sha256":"6219df8546f6ee2ba2478fb2ec1ce81e872618a3e3b61a06b2351519927ea511","source":{"kind":"arxiv","id":"1401.0579","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0579","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0579v1","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0579","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"MIM57BKG63XC","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MIM57BKG63XCXISH","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MIM57BKG","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MIM57BKG63XCXISHR6ZOYHHID2","target":"record","payload":{"canonical_record":{"source":{"id":"1401.0579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-03T02:52:17Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a04207da299e8a2e42e107a4b03faacdabe42a0c1ad5073da49ac7975e9d5a97","abstract_canon_sha256":"da08ffe92cd2636072d6fef0320bd323100abb76e9a21169b32e8befc933d597"},"schema_version":"1.0"},"canonical_sha256":"6219df8546f6ee2ba2478fb2ec1ce81e872618a3e3b61a06b2351519927ea511","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:22.409715Z","signature_b64":"cVwJFI4e9Gryp6xL2wc135IGztQUgnYhwLCkowYKQF3dM552nhjm8ntj5uFtM0bG3DVMV8k+SMPHUx8RkdnyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6219df8546f6ee2ba2478fb2ec1ce81e872618a3e3b61a06b2351519927ea511","last_reissued_at":"2026-05-18T03:03:22.409063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:22.409063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.0579","source_version":1,"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-18T03:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P56vGZ9XIA98y5HQ8xMHkel30RUgWeV6JRE8xD69ighGmwhJdku5kN+cIYcKFHlSTjtCtINyq29CDkJD3IhTCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:41:41.790548Z"},"content_sha256":"3badbd76f06428772e12853ddc036136d1e0209c0435bc3fdd2e9fecbe2e2590","schema_version":"1.0","event_id":"sha256:3badbd76f06428772e12853ddc036136d1e0209c0435bc3fdd2e9fecbe2e2590"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MIM57BKG63XCXISHR6ZOYHHID2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"More Algorithms for Provable Dictionary Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.DS","authors_text":"Aditya Bhaskara, Rong Ge, Sanjeev Arora, Tengyu Ma","submitted_at":"2014-01-03T02:52:17Z","abstract_excerpt":"In dictionary learning, also known as sparse coding, the algorithm is given samples of the form $y = Ax$ where $x\\in \\mathbb{R}^m$ is an unknown random sparse vector and $A$ is an unknown dictionary matrix in $\\mathbb{R}^{n\\times m}$ (usually $m > n$, which is the overcomplete case). The goal is to learn $A$ and $x$. This problem has been studied in neuroscience, machine learning, visions, and image processing. In practice it is solved by heuristic algorithms and provable algorithms seemed hard to find. Recently, provable algorithms were found that work if the unknown feature vector $x$ is $\\s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0579","kind":"arxiv","version":1},"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-18T03:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tcIIRf4xWVHWKNH8Gcv8DK+v+bO/Tuq7+s+0pnMF2nZXk246JM0Qym8dgHiqQoc29nOBgAmGQoyZKDGPHAd3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:41:41.791248Z"},"content_sha256":"ad24129c01583f9da54857f4b8e1147ae72b6253168db7c3e88451033eadc676","schema_version":"1.0","event_id":"sha256:ad24129c01583f9da54857f4b8e1147ae72b6253168db7c3e88451033eadc676"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MIM57BKG63XCXISHR6ZOYHHID2/bundle.json","state_url":"https://pith.science/pith/MIM57BKG63XCXISHR6ZOYHHID2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MIM57BKG63XCXISHR6ZOYHHID2/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-05-29T15:41:41Z","links":{"resolver":"https://pith.science/pith/MIM57BKG63XCXISHR6ZOYHHID2","bundle":"https://pith.science/pith/MIM57BKG63XCXISHR6ZOYHHID2/bundle.json","state":"https://pith.science/pith/MIM57BKG63XCXISHR6ZOYHHID2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MIM57BKG63XCXISHR6ZOYHHID2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MIM57BKG63XCXISHR6ZOYHHID2","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":"da08ffe92cd2636072d6fef0320bd323100abb76e9a21169b32e8befc933d597","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-03T02:52:17Z","title_canon_sha256":"a04207da299e8a2e42e107a4b03faacdabe42a0c1ad5073da49ac7975e9d5a97"},"schema_version":"1.0","source":{"id":"1401.0579","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0579","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0579v1","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0579","created_at":"2026-05-18T03:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"MIM57BKG63XC","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MIM57BKG63XCXISH","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MIM57BKG","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:ad24129c01583f9da54857f4b8e1147ae72b6253168db7c3e88451033eadc676","target":"graph","created_at":"2026-05-18T03:03:22Z","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":"In dictionary learning, also known as sparse coding, the algorithm is given samples of the form $y = Ax$ where $x\\in \\mathbb{R}^m$ is an unknown random sparse vector and $A$ is an unknown dictionary matrix in $\\mathbb{R}^{n\\times m}$ (usually $m > n$, which is the overcomplete case). The goal is to learn $A$ and $x$. This problem has been studied in neuroscience, machine learning, visions, and image processing. In practice it is solved by heuristic algorithms and provable algorithms seemed hard to find. Recently, provable algorithms were found that work if the unknown feature vector $x$ is $\\s","authors_text":"Aditya Bhaskara, Rong Ge, Sanjeev Arora, Tengyu Ma","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-03T02:52:17Z","title":"More Algorithms for Provable Dictionary Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0579","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:3badbd76f06428772e12853ddc036136d1e0209c0435bc3fdd2e9fecbe2e2590","target":"record","created_at":"2026-05-18T03:03:22Z","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":"da08ffe92cd2636072d6fef0320bd323100abb76e9a21169b32e8befc933d597","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-03T02:52:17Z","title_canon_sha256":"a04207da299e8a2e42e107a4b03faacdabe42a0c1ad5073da49ac7975e9d5a97"},"schema_version":"1.0","source":{"id":"1401.0579","kind":"arxiv","version":1}},"canonical_sha256":"6219df8546f6ee2ba2478fb2ec1ce81e872618a3e3b61a06b2351519927ea511","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6219df8546f6ee2ba2478fb2ec1ce81e872618a3e3b61a06b2351519927ea511","first_computed_at":"2026-05-18T03:03:22.409063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:22.409063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cVwJFI4e9Gryp6xL2wc135IGztQUgnYhwLCkowYKQF3dM552nhjm8ntj5uFtM0bG3DVMV8k+SMPHUx8RkdnyAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:22.409715Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0579","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3badbd76f06428772e12853ddc036136d1e0209c0435bc3fdd2e9fecbe2e2590","sha256:ad24129c01583f9da54857f4b8e1147ae72b6253168db7c3e88451033eadc676"],"state_sha256":"c6b8db0ba66138443092ceb28599a69dc3cec7080697c18ba14392f4a193349d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZQNcvzgTkhxS2/0IDGTlmDVnOsBI+xQvXG8ek18YCOkGYMzh2T34niWHR5zmSFQJokJczK0n0AxDMdaCyRbXDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:41:41.795002Z","bundle_sha256":"eb9759b8b5ba940434ef7c053b8edbf71271e9e79b1571f624d141ffbe967942"}}