{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4J2CH4ZCPF3AZHR6MNXGKCK2ST","short_pith_number":"pith:4J2CH4ZC","canonical_record":{"source":{"id":"1109.5302","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-24T20:32:42Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0a3d5d303d683e44a7e367dc3ee77f6eed378db2e923055d1342582745b2a306","abstract_canon_sha256":"8d0f0cf918c622a27999cd73604b06dc99ed765f368943d1e288eaac72329ae2"},"schema_version":"1.0"},"canonical_sha256":"e27423f32279760c9e3e636e65095a94c89e7c92d045dd096581c0c634c2a612","source":{"kind":"arxiv","id":"1109.5302","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5302","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5302v3","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5302","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"pith_short_12","alias_value":"4J2CH4ZCPF3A","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4J2CH4ZCPF3AZHR6","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4J2CH4ZC","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4J2CH4ZCPF3AZHR6MNXGKCK2ST","target":"record","payload":{"canonical_record":{"source":{"id":"1109.5302","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-24T20:32:42Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"0a3d5d303d683e44a7e367dc3ee77f6eed378db2e923055d1342582745b2a306","abstract_canon_sha256":"8d0f0cf918c622a27999cd73604b06dc99ed765f368943d1e288eaac72329ae2"},"schema_version":"1.0"},"canonical_sha256":"e27423f32279760c9e3e636e65095a94c89e7c92d045dd096581c0c634c2a612","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:59.133051Z","signature_b64":"zXv8XV2pZgUn8xPrPoCHNjvsNAOrZ2K4vlcg0fl33qBKC6YWzfhUXuFNa4ZYV2Qlm6J0Q4IGFphiMENaUq0WBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e27423f32279760c9e3e636e65095a94c89e7c92d045dd096581c0c634c2a612","last_reissued_at":"2026-05-17T23:39:59.132451Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:59.132451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.5302","source_version":3,"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-17T23:39:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ktXnnVYxQAZf11D0chzFM1pUp9nT4lfWmXGHtXvk4IwEvGKzi1LJrA85FhknkUoM3/5luQtldgQhmzsZuATfBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:24:32.574762Z"},"content_sha256":"abc1eac977c5331be6ec0c6c7a47540975fcc18a8ae596844db3c50c0675f1b1","schema_version":"1.0","event_id":"sha256:abc1eac977c5331be6ec0c6c7a47540975fcc18a8ae596844db3c50c0675f1b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4J2CH4ZCPF3AZHR6MNXGKCK2ST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simultaneous Codeword Optimization (SimCO) for Dictionary Update and Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.LG","authors_text":"Tao Xu, Wei Dai, Wenwu Wang","submitted_at":"2011-09-24T20:32:42Z","abstract_excerpt":"We consider the data-driven dictionary learning problem. The goal is to seek an over-complete dictionary from which every training signal can be best approximated by a linear combination of only a few codewords. This task is often achieved by iteratively executing two operations: sparse coding and dictionary update. In the literature, there are two benchmark mechanisms to update a dictionary. The first approach, such as the MOD algorithm, is characterized by searching for the optimal codewords while fixing the sparse coefficients. In the second approach, represented by the K-SVD method, one co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5302","kind":"arxiv","version":3},"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-17T23:39:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9c9yebEY16PNAdo3Z8qld099PRPQ/mHax+bVKUbQdK314jGQgXWd4TbcK1DUULGHjlIw91o16rYw72IcgRmLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:24:32.575231Z"},"content_sha256":"f1b3a01634e7f6c328fc5c8c42e75dea22f5e7a0dd83d62ab00afcbbdd50189e","schema_version":"1.0","event_id":"sha256:f1b3a01634e7f6c328fc5c8c42e75dea22f5e7a0dd83d62ab00afcbbdd50189e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4J2CH4ZCPF3AZHR6MNXGKCK2ST/bundle.json","state_url":"https://pith.science/pith/4J2CH4ZCPF3AZHR6MNXGKCK2ST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4J2CH4ZCPF3AZHR6MNXGKCK2ST/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-25T15:24:32Z","links":{"resolver":"https://pith.science/pith/4J2CH4ZCPF3AZHR6MNXGKCK2ST","bundle":"https://pith.science/pith/4J2CH4ZCPF3AZHR6MNXGKCK2ST/bundle.json","state":"https://pith.science/pith/4J2CH4ZCPF3AZHR6MNXGKCK2ST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4J2CH4ZCPF3AZHR6MNXGKCK2ST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4J2CH4ZCPF3AZHR6MNXGKCK2ST","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":"8d0f0cf918c622a27999cd73604b06dc99ed765f368943d1e288eaac72329ae2","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-24T20:32:42Z","title_canon_sha256":"0a3d5d303d683e44a7e367dc3ee77f6eed378db2e923055d1342582745b2a306"},"schema_version":"1.0","source":{"id":"1109.5302","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5302","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5302v3","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5302","created_at":"2026-05-17T23:39:59Z"},{"alias_kind":"pith_short_12","alias_value":"4J2CH4ZCPF3A","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4J2CH4ZCPF3AZHR6","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4J2CH4ZC","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:f1b3a01634e7f6c328fc5c8c42e75dea22f5e7a0dd83d62ab00afcbbdd50189e","target":"graph","created_at":"2026-05-17T23:39:59Z","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 consider the data-driven dictionary learning problem. The goal is to seek an over-complete dictionary from which every training signal can be best approximated by a linear combination of only a few codewords. This task is often achieved by iteratively executing two operations: sparse coding and dictionary update. In the literature, there are two benchmark mechanisms to update a dictionary. The first approach, such as the MOD algorithm, is characterized by searching for the optimal codewords while fixing the sparse coefficients. In the second approach, represented by the K-SVD method, one co","authors_text":"Tao Xu, Wei Dai, Wenwu Wang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-24T20:32:42Z","title":"Simultaneous Codeword Optimization (SimCO) for Dictionary Update and Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5302","kind":"arxiv","version":3},"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:abc1eac977c5331be6ec0c6c7a47540975fcc18a8ae596844db3c50c0675f1b1","target":"record","created_at":"2026-05-17T23:39:59Z","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":"8d0f0cf918c622a27999cd73604b06dc99ed765f368943d1e288eaac72329ae2","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-09-24T20:32:42Z","title_canon_sha256":"0a3d5d303d683e44a7e367dc3ee77f6eed378db2e923055d1342582745b2a306"},"schema_version":"1.0","source":{"id":"1109.5302","kind":"arxiv","version":3}},"canonical_sha256":"e27423f32279760c9e3e636e65095a94c89e7c92d045dd096581c0c634c2a612","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e27423f32279760c9e3e636e65095a94c89e7c92d045dd096581c0c634c2a612","first_computed_at":"2026-05-17T23:39:59.132451Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:59.132451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zXv8XV2pZgUn8xPrPoCHNjvsNAOrZ2K4vlcg0fl33qBKC6YWzfhUXuFNa4ZYV2Qlm6J0Q4IGFphiMENaUq0WBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:59.133051Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5302","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abc1eac977c5331be6ec0c6c7a47540975fcc18a8ae596844db3c50c0675f1b1","sha256:f1b3a01634e7f6c328fc5c8c42e75dea22f5e7a0dd83d62ab00afcbbdd50189e"],"state_sha256":"0de946754742a4783f22f21715d5aea0165420b617647d5eca3105a9153429f0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EUhJMGzVJuSBulxAIK9ekya7q3uhz/24rpgbIs3DC6lh064xN8zl2Q/U5bvUoyzyavLi5E/mxnw5lrnbTd1FDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:24:32.579255Z","bundle_sha256":"dfc57ff98db47ccef818b7e0f1ee7a9b8b091663dc86bcddf6ba3ce8b8a460f9"}}