{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:SJHZ46KTEQINCXZGGPGBA2VOEM","short_pith_number":"pith:SJHZ46KT","schema_version":"1.0","canonical_sha256":"924f9e79532410d15f2633cc106aae230d60ae2db80a008af9c88212d820d339","source":{"kind":"arxiv","id":"1903.05219","version":1},"attestation_state":"computed","paper":{"title":"Confident Kernel Sparse Coding and Dictionary Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Babak Hosseini, Barbara Hammer","submitted_at":"2019-03-12T21:15:51Z","abstract_excerpt":"In recent years, kernel-based sparse coding (K-SRC) has received particular attention due to its efficient representation of nonlinear data structures in the feature space. Nevertheless, the existing K-SRC methods suffer from the lack of consistency between their training and test optimization frameworks. In this work, we propose a novel confident K-SRC and dictionary learning algorithm (CKSC) which focuses on the discriminative reconstruction of the data based on its representation in the kernel space. CKSC focuses on reconstructing each data sample via weighted contributions which are confid"},"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":"1903.05219","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-03-12T21:15:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"e2a0ae484f1f0f3847bab66da36d6deaa0bfb77468cd9e837b6a277e3ec2cf46","abstract_canon_sha256":"3076db55d1c69ce66988db18405febdf24a89d24c71ec16b6b63aa12e60b0db7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:25.075667Z","signature_b64":"nkkKAUDCt37RrBMTHY+qqEEOcbcM4W0oss+yWuxciLyCVOWNXmqWco353txdFaz9p33Tdf5YdIFqy9lV9zHNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"924f9e79532410d15f2633cc106aae230d60ae2db80a008af9c88212d820d339","last_reissued_at":"2026-05-17T23:51:25.075107Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:25.075107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Confident Kernel Sparse Coding and Dictionary Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Babak Hosseini, Barbara Hammer","submitted_at":"2019-03-12T21:15:51Z","abstract_excerpt":"In recent years, kernel-based sparse coding (K-SRC) has received particular attention due to its efficient representation of nonlinear data structures in the feature space. Nevertheless, the existing K-SRC methods suffer from the lack of consistency between their training and test optimization frameworks. In this work, we propose a novel confident K-SRC and dictionary learning algorithm (CKSC) which focuses on the discriminative reconstruction of the data based on its representation in the kernel space. CKSC focuses on reconstructing each data sample via weighted contributions which are confid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05219","kind":"arxiv","version":1},"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":"1903.05219","created_at":"2026-05-17T23:51:25.075186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.05219v1","created_at":"2026-05-17T23:51:25.075186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05219","created_at":"2026-05-17T23:51:25.075186+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJHZ46KTEQIN","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJHZ46KTEQINCXZG","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJHZ46KT","created_at":"2026-05-18T12:33:27.125529+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/SJHZ46KTEQINCXZGGPGBA2VOEM","json":"https://pith.science/pith/SJHZ46KTEQINCXZGGPGBA2VOEM.json","graph_json":"https://pith.science/api/pith-number/SJHZ46KTEQINCXZGGPGBA2VOEM/graph.json","events_json":"https://pith.science/api/pith-number/SJHZ46KTEQINCXZGGPGBA2VOEM/events.json","paper":"https://pith.science/paper/SJHZ46KT"},"agent_actions":{"view_html":"https://pith.science/pith/SJHZ46KTEQINCXZGGPGBA2VOEM","download_json":"https://pith.science/pith/SJHZ46KTEQINCXZGGPGBA2VOEM.json","view_paper":"https://pith.science/paper/SJHZ46KT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.05219&json=true","fetch_graph":"https://pith.science/api/pith-number/SJHZ46KTEQINCXZGGPGBA2VOEM/graph.json","fetch_events":"https://pith.science/api/pith-number/SJHZ46KTEQINCXZGGPGBA2VOEM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJHZ46KTEQINCXZGGPGBA2VOEM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJHZ46KTEQINCXZGGPGBA2VOEM/action/storage_attestation","attest_author":"https://pith.science/pith/SJHZ46KTEQINCXZGGPGBA2VOEM/action/author_attestation","sign_citation":"https://pith.science/pith/SJHZ46KTEQINCXZGGPGBA2VOEM/action/citation_signature","submit_replication":"https://pith.science/pith/SJHZ46KTEQINCXZGGPGBA2VOEM/action/replication_record"}},"created_at":"2026-05-17T23:51:25.075186+00:00","updated_at":"2026-05-17T23:51:25.075186+00:00"}