{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TMSQRBGDR7MMQTIUDHBEN3NKPM","short_pith_number":"pith:TMSQRBGD","schema_version":"1.0","canonical_sha256":"9b250884c38fd8c84d1419c246edaa7b3322585a85ad5441338fdfe4f4224008","source":{"kind":"arxiv","id":"1604.04767","version":1},"attestation_state":"computed","paper":{"title":"Efficient Dictionary Learning with Sparseness-Enforcing Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NE"],"primary_cat":"cs.LG","authors_text":"G\\\"unther Palm, Markus Thom, Matthias Rapp","submitted_at":"2016-04-16T15:42:12Z","abstract_excerpt":"Learning dictionaries suitable for sparse coding instead of using engineered bases has proven effective in a variety of image processing tasks. This paper studies the optimization of dictionaries on image data where the representation is enforced to be explicitly sparse with respect to a smooth, normalized sparseness measure. This involves the computation of Euclidean projections onto level sets of the sparseness measure. While previous algorithms for this optimization problem had at least quasi-linear time complexity, here the first algorithm with linear time complexity and constant space com"},"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":"1604.04767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-16T15:42:12Z","cross_cats_sorted":["cs.CV","cs.NE"],"title_canon_sha256":"772f3fe4021cf233ec5e51ae5b3c8bf28b9e775796b7c73cf79371d3ada69b6f","abstract_canon_sha256":"d17b11a1c7062853c773cfcb6c5bbdad8465282a9143973302396c34c4a1c838"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:58.611669Z","signature_b64":"0/DpcrUBFVE8P8v+OfKB8o6YMKGbKvTbhsjCgqiNRx0puJXeIDZThe4n1a7HnQE7+asTX2Qr+4fMSLqmP4jFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b250884c38fd8c84d1419c246edaa7b3322585a85ad5441338fdfe4f4224008","last_reissued_at":"2026-05-18T01:16:58.610845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:58.610845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Dictionary Learning with Sparseness-Enforcing Projections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NE"],"primary_cat":"cs.LG","authors_text":"G\\\"unther Palm, Markus Thom, Matthias Rapp","submitted_at":"2016-04-16T15:42:12Z","abstract_excerpt":"Learning dictionaries suitable for sparse coding instead of using engineered bases has proven effective in a variety of image processing tasks. This paper studies the optimization of dictionaries on image data where the representation is enforced to be explicitly sparse with respect to a smooth, normalized sparseness measure. This involves the computation of Euclidean projections onto level sets of the sparseness measure. While previous algorithms for this optimization problem had at least quasi-linear time complexity, here the first algorithm with linear time complexity and constant space com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04767","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":"1604.04767","created_at":"2026-05-18T01:16:58.610971+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04767v1","created_at":"2026-05-18T01:16:58.610971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04767","created_at":"2026-05-18T01:16:58.610971+00:00"},{"alias_kind":"pith_short_12","alias_value":"TMSQRBGDR7MM","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TMSQRBGDR7MMQTIU","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TMSQRBGD","created_at":"2026-05-18T12:30:44.179134+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/TMSQRBGDR7MMQTIUDHBEN3NKPM","json":"https://pith.science/pith/TMSQRBGDR7MMQTIUDHBEN3NKPM.json","graph_json":"https://pith.science/api/pith-number/TMSQRBGDR7MMQTIUDHBEN3NKPM/graph.json","events_json":"https://pith.science/api/pith-number/TMSQRBGDR7MMQTIUDHBEN3NKPM/events.json","paper":"https://pith.science/paper/TMSQRBGD"},"agent_actions":{"view_html":"https://pith.science/pith/TMSQRBGDR7MMQTIUDHBEN3NKPM","download_json":"https://pith.science/pith/TMSQRBGDR7MMQTIUDHBEN3NKPM.json","view_paper":"https://pith.science/paper/TMSQRBGD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04767&json=true","fetch_graph":"https://pith.science/api/pith-number/TMSQRBGDR7MMQTIUDHBEN3NKPM/graph.json","fetch_events":"https://pith.science/api/pith-number/TMSQRBGDR7MMQTIUDHBEN3NKPM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TMSQRBGDR7MMQTIUDHBEN3NKPM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TMSQRBGDR7MMQTIUDHBEN3NKPM/action/storage_attestation","attest_author":"https://pith.science/pith/TMSQRBGDR7MMQTIUDHBEN3NKPM/action/author_attestation","sign_citation":"https://pith.science/pith/TMSQRBGDR7MMQTIUDHBEN3NKPM/action/citation_signature","submit_replication":"https://pith.science/pith/TMSQRBGDR7MMQTIUDHBEN3NKPM/action/replication_record"}},"created_at":"2026-05-18T01:16:58.610971+00:00","updated_at":"2026-05-18T01:16:58.610971+00:00"}