{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OVXWSQ3KGO7GOXZSSB63K5CEMV","short_pith_number":"pith:OVXWSQ3K","canonical_record":{"source":{"id":"1505.04363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-17T07:05:50Z","cross_cats_sorted":[],"title_canon_sha256":"17931da2d723b4b8c409c69cff07380c0a04d43a8983274d8fa021afb0a7b921","abstract_canon_sha256":"bc5f1fed9c4a8341ccb76244ca8aece4d1a65fe1c6fc1c4ec8fc5f8051335428"},"schema_version":"1.0"},"canonical_sha256":"756f69436a33be675f32907db57444657c076ea23d70688d305c4fa889386ac1","source":{"kind":"arxiv","id":"1505.04363","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04363","created_at":"2026-05-18T01:11:13Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04363v2","created_at":"2026-05-18T01:11:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04363","created_at":"2026-05-18T01:11:13Z"},{"alias_kind":"pith_short_12","alias_value":"OVXWSQ3KGO7G","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OVXWSQ3KGO7GOXZS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OVXWSQ3K","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OVXWSQ3KGO7GOXZSSB63K5CEMV","target":"record","payload":{"canonical_record":{"source":{"id":"1505.04363","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-17T07:05:50Z","cross_cats_sorted":[],"title_canon_sha256":"17931da2d723b4b8c409c69cff07380c0a04d43a8983274d8fa021afb0a7b921","abstract_canon_sha256":"bc5f1fed9c4a8341ccb76244ca8aece4d1a65fe1c6fc1c4ec8fc5f8051335428"},"schema_version":"1.0"},"canonical_sha256":"756f69436a33be675f32907db57444657c076ea23d70688d305c4fa889386ac1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:13.514219Z","signature_b64":"phAsJdtplqP75OkzBjGH7fC1igTcZR8S+2VfkYfuOqg1STsiy2eQCBl4nbPEF1MfR7a1x1JLQfmwxfFPoopfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"756f69436a33be675f32907db57444657c076ea23d70688d305c4fa889386ac1","last_reissued_at":"2026-05-18T01:11:13.513670Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:13.513670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.04363","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-18T01:11:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kaPwXVLvk6hQYs87TBDpPqLK31OpYl84kKr3OJc8xir9/PRHFIyyc1yW98tGjhDATPXOzjQOxx7OYjTd9p4TCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T07:02:41.348033Z"},"content_sha256":"f05dbb185e5d43ce8e247cf5480c27db3efe8e60b4e7871bd6be7d1826a800f3","schema_version":"1.0","event_id":"sha256:f05dbb185e5d43ce8e247cf5480c27db3efe8e60b4e7871bd6be7d1826a800f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OVXWSQ3KGO7GOXZSSB63K5CEMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local identifiability of $l_1$-minimization dictionary learning: a sufficient and almost necessary condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Bin Yu, Siqi Wu","submitted_at":"2015-05-17T07:05:50Z","abstract_excerpt":"We study the theoretical properties of learning a dictionary from $N$ signals $\\mathbf x_i\\in \\mathbb R^K$ for $i=1,...,N$ via $l_1$-minimization. We assume that $\\mathbf x_i$'s are $i.i.d.$ random linear combinations of the $K$ columns from a complete (i.e., square and invertible) reference dictionary $\\mathbf D_0 \\in \\mathbb R^{K\\times K}$. Here, the random linear coefficients are generated from either the $s$-sparse Gaussian model or the Bernoulli-Gaussian model. First, for the population case, we establish a sufficient and almost necessary condition for the reference dictionary $\\mathbf D_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04363","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-18T01:11:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"veO0QRs55JvSWvai6iNp9POXYCshdVJKvodYRexGFeKSCWMT8pLnmpf+0Ot8qu5fzuvl+lCN6d7MmM3B7z4JDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T07:02:41.348764Z"},"content_sha256":"274c90953e8563deafdd23664e752f5846396cda99b33cbedd5f3401db319394","schema_version":"1.0","event_id":"sha256:274c90953e8563deafdd23664e752f5846396cda99b33cbedd5f3401db319394"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVXWSQ3KGO7GOXZSSB63K5CEMV/bundle.json","state_url":"https://pith.science/pith/OVXWSQ3KGO7GOXZSSB63K5CEMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVXWSQ3KGO7GOXZSSB63K5CEMV/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-22T07:02:41Z","links":{"resolver":"https://pith.science/pith/OVXWSQ3KGO7GOXZSSB63K5CEMV","bundle":"https://pith.science/pith/OVXWSQ3KGO7GOXZSSB63K5CEMV/bundle.json","state":"https://pith.science/pith/OVXWSQ3KGO7GOXZSSB63K5CEMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVXWSQ3KGO7GOXZSSB63K5CEMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OVXWSQ3KGO7GOXZSSB63K5CEMV","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":"bc5f1fed9c4a8341ccb76244ca8aece4d1a65fe1c6fc1c4ec8fc5f8051335428","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-17T07:05:50Z","title_canon_sha256":"17931da2d723b4b8c409c69cff07380c0a04d43a8983274d8fa021afb0a7b921"},"schema_version":"1.0","source":{"id":"1505.04363","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.04363","created_at":"2026-05-18T01:11:13Z"},{"alias_kind":"arxiv_version","alias_value":"1505.04363v2","created_at":"2026-05-18T01:11:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04363","created_at":"2026-05-18T01:11:13Z"},{"alias_kind":"pith_short_12","alias_value":"OVXWSQ3KGO7G","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OVXWSQ3KGO7GOXZS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OVXWSQ3K","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:274c90953e8563deafdd23664e752f5846396cda99b33cbedd5f3401db319394","target":"graph","created_at":"2026-05-18T01:11:13Z","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 study the theoretical properties of learning a dictionary from $N$ signals $\\mathbf x_i\\in \\mathbb R^K$ for $i=1,...,N$ via $l_1$-minimization. We assume that $\\mathbf x_i$'s are $i.i.d.$ random linear combinations of the $K$ columns from a complete (i.e., square and invertible) reference dictionary $\\mathbf D_0 \\in \\mathbb R^{K\\times K}$. Here, the random linear coefficients are generated from either the $s$-sparse Gaussian model or the Bernoulli-Gaussian model. First, for the population case, we establish a sufficient and almost necessary condition for the reference dictionary $\\mathbf D_","authors_text":"Bin Yu, Siqi Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-17T07:05:50Z","title":"Local identifiability of $l_1$-minimization dictionary learning: a sufficient and almost necessary condition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04363","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:f05dbb185e5d43ce8e247cf5480c27db3efe8e60b4e7871bd6be7d1826a800f3","target":"record","created_at":"2026-05-18T01:11:13Z","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":"bc5f1fed9c4a8341ccb76244ca8aece4d1a65fe1c6fc1c4ec8fc5f8051335428","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-05-17T07:05:50Z","title_canon_sha256":"17931da2d723b4b8c409c69cff07380c0a04d43a8983274d8fa021afb0a7b921"},"schema_version":"1.0","source":{"id":"1505.04363","kind":"arxiv","version":2}},"canonical_sha256":"756f69436a33be675f32907db57444657c076ea23d70688d305c4fa889386ac1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"756f69436a33be675f32907db57444657c076ea23d70688d305c4fa889386ac1","first_computed_at":"2026-05-18T01:11:13.513670Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:13.513670Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"phAsJdtplqP75OkzBjGH7fC1igTcZR8S+2VfkYfuOqg1STsiy2eQCBl4nbPEF1MfR7a1x1JLQfmwxfFPoopfCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:13.514219Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.04363","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f05dbb185e5d43ce8e247cf5480c27db3efe8e60b4e7871bd6be7d1826a800f3","sha256:274c90953e8563deafdd23664e752f5846396cda99b33cbedd5f3401db319394"],"state_sha256":"fe25747108f0faba8b7a4672e1e07a410aa6881125deb4f39285ba6a49ba6463"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q7MU1RDj2Ih/LeYJiPNjZO4uJYK+AYuwTquQ0u1Oy3rFgdePXPcAasfLEiWKvV4WA0CTZ+DE6gBSp0Hq/9i+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T07:02:41.352376Z","bundle_sha256":"c217eac25358ae574fee8c9f1af93924a3dd7b90cd200abf9db4fd0d6960db0d"}}