{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:2YL2MJYO5P5BWONFFYDUGLGSWX","short_pith_number":"pith:2YL2MJYO","schema_version":"1.0","canonical_sha256":"d617a6270eebfa1b39a52e07432cd2b5f24fcfcc76a6d0611c7b6a7cc1d6e7cd","source":{"kind":"arxiv","id":"1212.2834","version":2},"attestation_state":"computed","paper":{"title":"Dictionary Subselection Using an Overcomplete Joint Sparsity Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Laurent Daudet, Mehrdad Yaghoobi, Michael E. Davies","submitted_at":"2012-12-12T15:02:20Z","abstract_excerpt":"Many natural signals exhibit a sparse representation, whenever a suitable describing model is given. Here, a linear generative model is considered, where many sparsity-based signal processing techniques rely on such a simplified model. As this model is often unknown for many classes of the signals, we need to select such a model based on the domain knowledge or using some exemplar signals. This paper presents a new exemplar based approach for the linear model (called the dictionary) selection, for such sparse inverse problems. The problem of dictionary selection, which has also been called the"},"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":"1212.2834","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-12T15:02:20Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"b8349c536c72aace12ff9f4777840660b0aadcd356c10385bd071e3f30a01c09","abstract_canon_sha256":"ec695dd56d944c8045baf466b38802af45cc21d084e19093f5a96e5f265fd6e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:31.274520Z","signature_b64":"DiV245g67UmZyTHsRogFoWr4AhChc1WenjCA6gOKHQGEn4Ie43PJo4zb0q2EZKGd+pR/IVV7xgkGxjHqg5MeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d617a6270eebfa1b39a52e07432cd2b5f24fcfcc76a6d0611c7b6a7cc1d6e7cd","last_reissued_at":"2026-05-18T03:21:31.274098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:31.274098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dictionary Subselection Using an Overcomplete Joint Sparsity Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Laurent Daudet, Mehrdad Yaghoobi, Michael E. Davies","submitted_at":"2012-12-12T15:02:20Z","abstract_excerpt":"Many natural signals exhibit a sparse representation, whenever a suitable describing model is given. Here, a linear generative model is considered, where many sparsity-based signal processing techniques rely on such a simplified model. As this model is often unknown for many classes of the signals, we need to select such a model based on the domain knowledge or using some exemplar signals. This paper presents a new exemplar based approach for the linear model (called the dictionary) selection, for such sparse inverse problems. The problem of dictionary selection, which has also been called the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2834","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.2834","created_at":"2026-05-18T03:21:31.274154+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.2834v2","created_at":"2026-05-18T03:21:31.274154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2834","created_at":"2026-05-18T03:21:31.274154+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YL2MJYO5P5B","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YL2MJYO5P5BWONF","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YL2MJYO","created_at":"2026-05-18T12:26:50.516681+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/2YL2MJYO5P5BWONFFYDUGLGSWX","json":"https://pith.science/pith/2YL2MJYO5P5BWONFFYDUGLGSWX.json","graph_json":"https://pith.science/api/pith-number/2YL2MJYO5P5BWONFFYDUGLGSWX/graph.json","events_json":"https://pith.science/api/pith-number/2YL2MJYO5P5BWONFFYDUGLGSWX/events.json","paper":"https://pith.science/paper/2YL2MJYO"},"agent_actions":{"view_html":"https://pith.science/pith/2YL2MJYO5P5BWONFFYDUGLGSWX","download_json":"https://pith.science/pith/2YL2MJYO5P5BWONFFYDUGLGSWX.json","view_paper":"https://pith.science/paper/2YL2MJYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.2834&json=true","fetch_graph":"https://pith.science/api/pith-number/2YL2MJYO5P5BWONFFYDUGLGSWX/graph.json","fetch_events":"https://pith.science/api/pith-number/2YL2MJYO5P5BWONFFYDUGLGSWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YL2MJYO5P5BWONFFYDUGLGSWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YL2MJYO5P5BWONFFYDUGLGSWX/action/storage_attestation","attest_author":"https://pith.science/pith/2YL2MJYO5P5BWONFFYDUGLGSWX/action/author_attestation","sign_citation":"https://pith.science/pith/2YL2MJYO5P5BWONFFYDUGLGSWX/action/citation_signature","submit_replication":"https://pith.science/pith/2YL2MJYO5P5BWONFFYDUGLGSWX/action/replication_record"}},"created_at":"2026-05-18T03:21:31.274154+00:00","updated_at":"2026-05-18T03:21:31.274154+00:00"}