{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CWH7PL7GOOER7NQQU2I3CPV5NG","short_pith_number":"pith:CWH7PL7G","canonical_record":{"source":{"id":"1410.0311","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-08-26T07:23:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ad4054eb2d18287ba35accd8787ad4de16fe1e5f846819d88b86d062321bc879","abstract_canon_sha256":"afb740fdb7a134aa256e72433b13cd47d106273cc800cd9ac1065b7e38bc1748"},"schema_version":"1.0"},"canonical_sha256":"158ff7afe673891fb610a691b13ebd69bbcaf6c6d87738327d2a098761e187ed","source":{"kind":"arxiv","id":"1410.0311","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0311","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0311v2","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0311","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"CWH7PL7GOOER","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"CWH7PL7GOOER7NQQ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"CWH7PL7G","created_at":"2026-05-18T12:28:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CWH7PL7GOOER7NQQU2I3CPV5NG","target":"record","payload":{"canonical_record":{"source":{"id":"1410.0311","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-08-26T07:23:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ad4054eb2d18287ba35accd8787ad4de16fe1e5f846819d88b86d062321bc879","abstract_canon_sha256":"afb740fdb7a134aa256e72433b13cd47d106273cc800cd9ac1065b7e38bc1748"},"schema_version":"1.0"},"canonical_sha256":"158ff7afe673891fb610a691b13ebd69bbcaf6c6d87738327d2a098761e187ed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:48.980776Z","signature_b64":"HYXr/Tgexp+VJCi3CrdKJlgzXX9U6S18PjuOY+57vNkTDfsjUmeybmflGYCeP0oRGwScD6o2I5HgU5qxc2egDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"158ff7afe673891fb610a691b13ebd69bbcaf6c6d87738327d2a098761e187ed","last_reissued_at":"2026-05-18T02:25:48.980226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:48.980226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.0311","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:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0RspDavw1YssMd4cazC0Yn9pljk3LyUHSADG4jvK/bP9GcwzksmQP5Lb+ddyPUnoykPOewhXFo0L1MFoOl6FDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:09:17.257597Z"},"content_sha256":"8034b3a4043f14f10cbbf955aa22c28770e893a0581d77463bfabc563ef959b9","schema_version":"1.0","event_id":"sha256:8034b3a4043f14f10cbbf955aa22c28770e893a0581d77463bfabc563ef959b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CWH7PL7GOOER7NQQU2I3CPV5NG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$\\ell_1$-K-SVD: A Robust Dictionary Learning Algorithm With Simultaneous Update","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Chandra Sekhar Seelamantula, Rupam Basu, Subhadip Mukherjee","submitted_at":"2014-08-26T07:23:04Z","abstract_excerpt":"We develop a dictionary learning algorithm by minimizing the $\\ell_1$ distortion metric on the data term, which is known to be robust for non-Gaussian noise contamination. The proposed algorithm exploits the idea of iterative minimization of weighted $\\ell_2$ error. We refer to this algorithm as $\\ell_1$-K-SVD, where the dictionary atoms and the corresponding sparse coefficients are simultaneously updated to minimize the $\\ell_1$ objective, resulting in noise-robustness. We demonstrate through experiments that the $\\ell_1$-K-SVD algorithm results in higher atom recovery rate compared with the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0311","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:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"07NtxNz6AjgEuc+dYqPwPVksqYJxslSGPPRbbLQFHCLiZANEQyKKpvFuivKnetwXod6L/nJGFOH68uWQBylgBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T11:09:17.257946Z"},"content_sha256":"23fd63c85fc359511e4fe5ead06662eca7491c152eb08e905797b5173db69e2b","schema_version":"1.0","event_id":"sha256:23fd63c85fc359511e4fe5ead06662eca7491c152eb08e905797b5173db69e2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWH7PL7GOOER7NQQU2I3CPV5NG/bundle.json","state_url":"https://pith.science/pith/CWH7PL7GOOER7NQQU2I3CPV5NG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWH7PL7GOOER7NQQU2I3CPV5NG/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-28T11:09:17Z","links":{"resolver":"https://pith.science/pith/CWH7PL7GOOER7NQQU2I3CPV5NG","bundle":"https://pith.science/pith/CWH7PL7GOOER7NQQU2I3CPV5NG/bundle.json","state":"https://pith.science/pith/CWH7PL7GOOER7NQQU2I3CPV5NG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWH7PL7GOOER7NQQU2I3CPV5NG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CWH7PL7GOOER7NQQU2I3CPV5NG","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":"afb740fdb7a134aa256e72433b13cd47d106273cc800cd9ac1065b7e38bc1748","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-08-26T07:23:04Z","title_canon_sha256":"ad4054eb2d18287ba35accd8787ad4de16fe1e5f846819d88b86d062321bc879"},"schema_version":"1.0","source":{"id":"1410.0311","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0311","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0311v2","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0311","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"CWH7PL7GOOER","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_16","alias_value":"CWH7PL7GOOER7NQQ","created_at":"2026-05-18T12:28:25Z"},{"alias_kind":"pith_short_8","alias_value":"CWH7PL7G","created_at":"2026-05-18T12:28:25Z"}],"graph_snapshots":[{"event_id":"sha256:23fd63c85fc359511e4fe5ead06662eca7491c152eb08e905797b5173db69e2b","target":"graph","created_at":"2026-05-18T02:25:48Z","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 develop a dictionary learning algorithm by minimizing the $\\ell_1$ distortion metric on the data term, which is known to be robust for non-Gaussian noise contamination. The proposed algorithm exploits the idea of iterative minimization of weighted $\\ell_2$ error. We refer to this algorithm as $\\ell_1$-K-SVD, where the dictionary atoms and the corresponding sparse coefficients are simultaneously updated to minimize the $\\ell_1$ objective, resulting in noise-robustness. We demonstrate through experiments that the $\\ell_1$-K-SVD algorithm results in higher atom recovery rate compared with the ","authors_text":"Chandra Sekhar Seelamantula, Rupam Basu, Subhadip Mukherjee","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-08-26T07:23:04Z","title":"$\\ell_1$-K-SVD: A Robust Dictionary Learning Algorithm With Simultaneous Update"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0311","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:8034b3a4043f14f10cbbf955aa22c28770e893a0581d77463bfabc563ef959b9","target":"record","created_at":"2026-05-18T02:25:48Z","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":"afb740fdb7a134aa256e72433b13cd47d106273cc800cd9ac1065b7e38bc1748","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2014-08-26T07:23:04Z","title_canon_sha256":"ad4054eb2d18287ba35accd8787ad4de16fe1e5f846819d88b86d062321bc879"},"schema_version":"1.0","source":{"id":"1410.0311","kind":"arxiv","version":2}},"canonical_sha256":"158ff7afe673891fb610a691b13ebd69bbcaf6c6d87738327d2a098761e187ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"158ff7afe673891fb610a691b13ebd69bbcaf6c6d87738327d2a098761e187ed","first_computed_at":"2026-05-18T02:25:48.980226Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:48.980226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HYXr/Tgexp+VJCi3CrdKJlgzXX9U6S18PjuOY+57vNkTDfsjUmeybmflGYCeP0oRGwScD6o2I5HgU5qxc2egDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:48.980776Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0311","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8034b3a4043f14f10cbbf955aa22c28770e893a0581d77463bfabc563ef959b9","sha256:23fd63c85fc359511e4fe5ead06662eca7491c152eb08e905797b5173db69e2b"],"state_sha256":"4a2210b853fae2ef39f046bbebd32ee895525b299a0fe36f2f0908f94ac295a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lhl8QYX0M5uQE3i2ZSwSg//g+M/hDbzo3KJm3csnwfDgVxnxQUojlCrFOENy/Le1ag5xux9MiMH5x0RPsitxDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T11:09:17.259862Z","bundle_sha256":"cd52cd158c4df33d63ce7a97915d3b93302dd4968408a14786c2f029a2c31131"}}