{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OXGB2KFC4K3U4R4KEYYKNGFWD5","short_pith_number":"pith:OXGB2KFC","canonical_record":{"source":{"id":"1602.05719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-18T08:51:08Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT","math.PR"],"title_canon_sha256":"5d3480e65cc60b4b47c99689a4bc3dae29ee9422e619f1e2ff151373dc3ec351","abstract_canon_sha256":"e3d5e5c5473d6afd56550fba3a69fa8654af7f90b46c4255d0c95fa3c4ba953f"},"schema_version":"1.0"},"canonical_sha256":"75cc1d28a2e2b74e478a2630a698b61f48b38aaa2cdc6d6f46c8110e34af0a32","source":{"kind":"arxiv","id":"1602.05719","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05719","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05719v1","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05719","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"OXGB2KFC4K3U","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OXGB2KFC4K3U4R4K","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OXGB2KFC","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OXGB2KFC4K3U4R4KEYYKNGFWD5","target":"record","payload":{"canonical_record":{"source":{"id":"1602.05719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-18T08:51:08Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT","math.PR"],"title_canon_sha256":"5d3480e65cc60b4b47c99689a4bc3dae29ee9422e619f1e2ff151373dc3ec351","abstract_canon_sha256":"e3d5e5c5473d6afd56550fba3a69fa8654af7f90b46c4255d0c95fa3c4ba953f"},"schema_version":"1.0"},"canonical_sha256":"75cc1d28a2e2b74e478a2630a698b61f48b38aaa2cdc6d6f46c8110e34af0a32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:23.432347Z","signature_b64":"k0h7Gn3zslzmW+Tp9zgHycbkmeL1i5Y6edFvA1WcdCCF41EkcDchBLltdt4gbQDK1OMLGt69yzbYQdDFJ+iZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75cc1d28a2e2b74e478a2630a698b61f48b38aaa2cdc6d6f46c8110e34af0a32","last_reissued_at":"2026-05-18T01:20:23.431667Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:23.431667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.05719","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-18T01:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3x8ljZt4adyarcu8lsnLaeWbbZ0bqugj64Q1pq7ABy8nfpYS+uznXRNJzqfLqaVuZOMfGj3HYB32wjK/M/y0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:22:39.154614Z"},"content_sha256":"07f05d06b76c8fd39f1e9f973927fa9f1b6c3f8ef923d24f20189605d04f5441","schema_version":"1.0","event_id":"sha256:07f05d06b76c8fd39f1e9f973927fa9f1b6c3f8ef923d24f20189605d04f5441"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OXGB2KFC4K3U4R4KEYYKNGFWD5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An improved analysis of the ER-SpUD dictionary learning algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT","math.PR"],"primary_cat":"cs.LG","authors_text":"Jaros{\\l}aw B{\\l}asiok, Jelani Nelson","submitted_at":"2016-02-18T08:51:08Z","abstract_excerpt":"In \"dictionary learning\" we observe $Y = AX + E$ for some $Y\\in\\mathbb{R}^{n\\times p}$, $A \\in\\mathbb{R}^{m\\times n}$, and $X\\in\\mathbb{R}^{m\\times p}$. The matrix $Y$ is observed, and $A, X, E$ are unknown. Here $E$ is \"noise\" of small norm, and $X$ is column-wise sparse. The matrix $A$ is referred to as a {\\em dictionary}, and its columns as {\\em atoms}. Then, given some small number $p$ of samples, i.e.\\ columns of $Y$, the goal is to learn the dictionary $A$ up to small error, as well as $X$. The motivation is that in many applications data is expected to sparse when represented by atoms i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05719","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-18T01:20:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g9yhzlPIhvfkaeDlCXUCBhmwOnmh0Pr32nYGASi2kltBiVtq8kewz0cEa9CJn0FjSkbQZ30pLN5d+VBjr5CjAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:22:39.155275Z"},"content_sha256":"7e831772d100b08c44d2a9c56aa6ddbac314825fb621dbb15c55be04bcdc879b","schema_version":"1.0","event_id":"sha256:7e831772d100b08c44d2a9c56aa6ddbac314825fb621dbb15c55be04bcdc879b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXGB2KFC4K3U4R4KEYYKNGFWD5/bundle.json","state_url":"https://pith.science/pith/OXGB2KFC4K3U4R4KEYYKNGFWD5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXGB2KFC4K3U4R4KEYYKNGFWD5/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-27T23:22:39Z","links":{"resolver":"https://pith.science/pith/OXGB2KFC4K3U4R4KEYYKNGFWD5","bundle":"https://pith.science/pith/OXGB2KFC4K3U4R4KEYYKNGFWD5/bundle.json","state":"https://pith.science/pith/OXGB2KFC4K3U4R4KEYYKNGFWD5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXGB2KFC4K3U4R4KEYYKNGFWD5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OXGB2KFC4K3U4R4KEYYKNGFWD5","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":"e3d5e5c5473d6afd56550fba3a69fa8654af7f90b46c4255d0c95fa3c4ba953f","cross_cats_sorted":["cs.DS","cs.IT","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-18T08:51:08Z","title_canon_sha256":"5d3480e65cc60b4b47c99689a4bc3dae29ee9422e619f1e2ff151373dc3ec351"},"schema_version":"1.0","source":{"id":"1602.05719","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05719","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05719v1","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05719","created_at":"2026-05-18T01:20:23Z"},{"alias_kind":"pith_short_12","alias_value":"OXGB2KFC4K3U","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OXGB2KFC4K3U4R4K","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OXGB2KFC","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:7e831772d100b08c44d2a9c56aa6ddbac314825fb621dbb15c55be04bcdc879b","target":"graph","created_at":"2026-05-18T01:20:23Z","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\" we observe $Y = AX + E$ for some $Y\\in\\mathbb{R}^{n\\times p}$, $A \\in\\mathbb{R}^{m\\times n}$, and $X\\in\\mathbb{R}^{m\\times p}$. The matrix $Y$ is observed, and $A, X, E$ are unknown. Here $E$ is \"noise\" of small norm, and $X$ is column-wise sparse. The matrix $A$ is referred to as a {\\em dictionary}, and its columns as {\\em atoms}. Then, given some small number $p$ of samples, i.e.\\ columns of $Y$, the goal is to learn the dictionary $A$ up to small error, as well as $X$. The motivation is that in many applications data is expected to sparse when represented by atoms i","authors_text":"Jaros{\\l}aw B{\\l}asiok, Jelani Nelson","cross_cats":["cs.DS","cs.IT","math.IT","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-18T08:51:08Z","title":"An improved analysis of the ER-SpUD dictionary learning algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05719","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:07f05d06b76c8fd39f1e9f973927fa9f1b6c3f8ef923d24f20189605d04f5441","target":"record","created_at":"2026-05-18T01:20:23Z","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":"e3d5e5c5473d6afd56550fba3a69fa8654af7f90b46c4255d0c95fa3c4ba953f","cross_cats_sorted":["cs.DS","cs.IT","math.IT","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-18T08:51:08Z","title_canon_sha256":"5d3480e65cc60b4b47c99689a4bc3dae29ee9422e619f1e2ff151373dc3ec351"},"schema_version":"1.0","source":{"id":"1602.05719","kind":"arxiv","version":1}},"canonical_sha256":"75cc1d28a2e2b74e478a2630a698b61f48b38aaa2cdc6d6f46c8110e34af0a32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75cc1d28a2e2b74e478a2630a698b61f48b38aaa2cdc6d6f46c8110e34af0a32","first_computed_at":"2026-05-18T01:20:23.431667Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:23.431667Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k0h7Gn3zslzmW+Tp9zgHycbkmeL1i5Y6edFvA1WcdCCF41EkcDchBLltdt4gbQDK1OMLGt69yzbYQdDFJ+iZCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:23.432347Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05719","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07f05d06b76c8fd39f1e9f973927fa9f1b6c3f8ef923d24f20189605d04f5441","sha256:7e831772d100b08c44d2a9c56aa6ddbac314825fb621dbb15c55be04bcdc879b"],"state_sha256":"ce1226146b066e81aaca3ce53b5b8c2d1af5e9f1242c8826a940e80e23fbe976"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rW9KVmsHC/9k+Xt+aGoGdnYcfJucKxm9c/Z3k9ZQlj2nHTx2PK4RDmYyEs1Fs4l9MRVr53kzk72IimAQb3mABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:22:39.159123Z","bundle_sha256":"f1262828cfb748c2ad4e4a57c8c918d8615b01442e4739cb7272793a3d9fc51e"}}