{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4J2CH4ZCPF3AZHR6MNXGKCK2ST","short_pith_number":"pith:4J2CH4ZC","schema_version":"1.0","canonical_sha256":"e27423f32279760c9e3e636e65095a94c89e7c92d045dd096581c0c634c2a612","source":{"kind":"arxiv","id":"1109.5302","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.5302","created_at":"2026-05-17T23:39:59.132547+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.5302v3","created_at":"2026-05-17T23:39:59.132547+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5302","created_at":"2026-05-17T23:39:59.132547+00:00"},{"alias_kind":"pith_short_12","alias_value":"4J2CH4ZCPF3A","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4J2CH4ZCPF3AZHR6","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4J2CH4ZC","created_at":"2026-05-18T12:26:20.644004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4J2CH4ZCPF3AZHR6MNXGKCK2ST","json":"https://pith.science/pith/4J2CH4ZCPF3AZHR6MNXGKCK2ST.json","graph_json":"https://pith.science/api/pith-number/4J2CH4ZCPF3AZHR6MNXGKCK2ST/graph.json","events_json":"https://pith.science/api/pith-number/4J2CH4ZCPF3AZHR6MNXGKCK2ST/events.json","paper":"https://pith.science/paper/4J2CH4ZC"},"agent_actions":{"view_html":"https://pith.science/pith/4J2CH4ZCPF3AZHR6MNXGKCK2ST","download_json":"https://pith.science/pith/4J2CH4ZCPF3AZHR6MNXGKCK2ST.json","view_paper":"https://pith.science/paper/4J2CH4ZC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.5302&json=true","fetch_graph":"https://pith.science/api/pith-number/4J2CH4ZCPF3AZHR6MNXGKCK2ST/graph.json","fetch_events":"https://pith.science/api/pith-number/4J2CH4ZCPF3AZHR6MNXGKCK2ST/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4J2CH4ZCPF3AZHR6MNXGKCK2ST/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4J2CH4ZCPF3AZHR6MNXGKCK2ST/action/storage_attestation","attest_author":"https://pith.science/pith/4J2CH4ZCPF3AZHR6MNXGKCK2ST/action/author_attestation","sign_citation":"https://pith.science/pith/4J2CH4ZCPF3AZHR6MNXGKCK2ST/action/citation_signature","submit_replication":"https://pith.science/pith/4J2CH4ZCPF3AZHR6MNXGKCK2ST/action/replication_record"}},"created_at":"2026-05-17T23:39:59.132547+00:00","updated_at":"2026-05-17T23:39:59.132547+00:00"}