{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:I5KBIZBALSKWDVXKZDFZRR6UJN","short_pith_number":"pith:I5KBIZBA","canonical_record":{"source":{"id":"1303.0448","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-03-03T01:49:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5289cb676f3f16e1ca91b2a0c7d81cfcfec1988cb84295bb023da2b94f657211","abstract_canon_sha256":"501ea371daa297e69217f1e4f838377b170f210781e6ec30413886cc3dd86ff4"},"schema_version":"1.0"},"canonical_sha256":"47541464205c9561d6eac8cb98c7d44b6ef7c2e72114ed60cc14133c343eb8f0","source":{"kind":"arxiv","id":"1303.0448","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0448","created_at":"2026-05-18T03:12:22Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0448v2","created_at":"2026-05-18T03:12:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0448","created_at":"2026-05-18T03:12:22Z"},{"alias_kind":"pith_short_12","alias_value":"I5KBIZBALSKW","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I5KBIZBALSKWDVXK","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I5KBIZBA","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:I5KBIZBALSKWDVXKZDFZRR6UJN","target":"record","payload":{"canonical_record":{"source":{"id":"1303.0448","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-03-03T01:49:56Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5289cb676f3f16e1ca91b2a0c7d81cfcfec1988cb84295bb023da2b94f657211","abstract_canon_sha256":"501ea371daa297e69217f1e4f838377b170f210781e6ec30413886cc3dd86ff4"},"schema_version":"1.0"},"canonical_sha256":"47541464205c9561d6eac8cb98c7d44b6ef7c2e72114ed60cc14133c343eb8f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:22.342910Z","signature_b64":"p/eLAJ+wNrT0oU7POJndXf8p3mYSvsTEFoDSfaEfiPW2nNUMNGpzkZ8HQkuX+3zR5F8JLSryuwXfx6bJGX7uDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47541464205c9561d6eac8cb98c7d44b6ef7c2e72114ed60cc14133c343eb8f0","last_reissued_at":"2026-05-18T03:12:22.342028Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:22.342028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.0448","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-18T03:12:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BDJgZ7Rt4/wprxKom7wTsHW2JohqRr8mgS+Mqf3lftKVDuV140ch3QHb43eUHXtI3kMzvOv81Zob+VSDvi6tCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:55:45.316928Z"},"content_sha256":"9170dc5b6f58a4f9edcc3705c3de60afe2b22375e5c4f191352f526f1459e08a","schema_version":"1.0","event_id":"sha256:9170dc5b6f58a4f9edcc3705c3de60afe2b22375e5c4f191352f526f1459e08a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:I5KBIZBALSKWDVXKZDFZRR6UJN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Stable Multilevel Dictionaries for Sparse Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.CV","authors_text":"Andreas Spanias, Jayaraman J. Thiagarajan, Karthikeyan Natesan Ramamurthy","submitted_at":"2013-03-03T01:49:56Z","abstract_excerpt":"Sparse representations using learned dictionaries are being increasingly used with success in several data processing and machine learning applications. The availability of abundant training data necessitates the development of efficient, robust and provably good dictionary learning algorithms. Algorithmic stability and generalization are desirable characteristics for dictionary learning algorithms that aim to build global dictionaries which can efficiently model any test data similar to the training samples. In this paper, we propose an algorithm to learn dictionaries for sparse representatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0448","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-18T03:12:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Sw29GJWwGDIGoZUjoItT84O6DneXBoxgT9eqMtnnASsFJf1t0reiZhU0VHz4aPRdedNbZe4IbERT3AAe6yJBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:55:45.317275Z"},"content_sha256":"473a710087e631ff20abf2dac78d3cf901bcc8af7be1d6623db35746934305ff","schema_version":"1.0","event_id":"sha256:473a710087e631ff20abf2dac78d3cf901bcc8af7be1d6623db35746934305ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I5KBIZBALSKWDVXKZDFZRR6UJN/bundle.json","state_url":"https://pith.science/pith/I5KBIZBALSKWDVXKZDFZRR6UJN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I5KBIZBALSKWDVXKZDFZRR6UJN/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-28T09:55:45Z","links":{"resolver":"https://pith.science/pith/I5KBIZBALSKWDVXKZDFZRR6UJN","bundle":"https://pith.science/pith/I5KBIZBALSKWDVXKZDFZRR6UJN/bundle.json","state":"https://pith.science/pith/I5KBIZBALSKWDVXKZDFZRR6UJN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I5KBIZBALSKWDVXKZDFZRR6UJN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:I5KBIZBALSKWDVXKZDFZRR6UJN","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":"501ea371daa297e69217f1e4f838377b170f210781e6ec30413886cc3dd86ff4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-03-03T01:49:56Z","title_canon_sha256":"5289cb676f3f16e1ca91b2a0c7d81cfcfec1988cb84295bb023da2b94f657211"},"schema_version":"1.0","source":{"id":"1303.0448","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0448","created_at":"2026-05-18T03:12:22Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0448v2","created_at":"2026-05-18T03:12:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0448","created_at":"2026-05-18T03:12:22Z"},{"alias_kind":"pith_short_12","alias_value":"I5KBIZBALSKW","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"I5KBIZBALSKWDVXK","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"I5KBIZBA","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:473a710087e631ff20abf2dac78d3cf901bcc8af7be1d6623db35746934305ff","target":"graph","created_at":"2026-05-18T03:12: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":"Sparse representations using learned dictionaries are being increasingly used with success in several data processing and machine learning applications. The availability of abundant training data necessitates the development of efficient, robust and provably good dictionary learning algorithms. Algorithmic stability and generalization are desirable characteristics for dictionary learning algorithms that aim to build global dictionaries which can efficiently model any test data similar to the training samples. In this paper, we propose an algorithm to learn dictionaries for sparse representatio","authors_text":"Andreas Spanias, Jayaraman J. Thiagarajan, Karthikeyan Natesan Ramamurthy","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-03-03T01:49:56Z","title":"Learning Stable Multilevel Dictionaries for Sparse Representations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0448","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:9170dc5b6f58a4f9edcc3705c3de60afe2b22375e5c4f191352f526f1459e08a","target":"record","created_at":"2026-05-18T03:12: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":"501ea371daa297e69217f1e4f838377b170f210781e6ec30413886cc3dd86ff4","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2013-03-03T01:49:56Z","title_canon_sha256":"5289cb676f3f16e1ca91b2a0c7d81cfcfec1988cb84295bb023da2b94f657211"},"schema_version":"1.0","source":{"id":"1303.0448","kind":"arxiv","version":2}},"canonical_sha256":"47541464205c9561d6eac8cb98c7d44b6ef7c2e72114ed60cc14133c343eb8f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47541464205c9561d6eac8cb98c7d44b6ef7c2e72114ed60cc14133c343eb8f0","first_computed_at":"2026-05-18T03:12:22.342028Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:22.342028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p/eLAJ+wNrT0oU7POJndXf8p3mYSvsTEFoDSfaEfiPW2nNUMNGpzkZ8HQkuX+3zR5F8JLSryuwXfx6bJGX7uDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:22.342910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0448","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9170dc5b6f58a4f9edcc3705c3de60afe2b22375e5c4f191352f526f1459e08a","sha256:473a710087e631ff20abf2dac78d3cf901bcc8af7be1d6623db35746934305ff"],"state_sha256":"8c2c4a3f50f67f58a56e7038165e9eb591ec71ab64bcdd133fe2ea1ff0a6493d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WreGncXUggIbeKJiQmr6rvjSWqnNenR+bgTfoiSyRGOGNIMw7LSPBWiuZkmhybd3G2ezhmUdSpEitbjaFfqmCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:55:45.319249Z","bundle_sha256":"87e1f5759ac4394629d30355debd3f3e41aefafa16f1a7c77ce647b3a5308462"}}