{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TMSQRBGDR7MMQTIUDHBEN3NKPM","short_pith_number":"pith:TMSQRBGD","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"},"canonical_sha256":"9b250884c38fd8c84d1419c246edaa7b3322585a85ad5441338fdfe4f4224008","source":{"kind":"arxiv","id":"1604.04767","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04767","created_at":"2026-05-18T01:16:58Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04767v1","created_at":"2026-05-18T01:16:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04767","created_at":"2026-05-18T01:16:58Z"},{"alias_kind":"pith_short_12","alias_value":"TMSQRBGDR7MM","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TMSQRBGDR7MMQTIU","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TMSQRBGD","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TMSQRBGDR7MMQTIUDHBEN3NKPM","target":"record","payload":{"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"},"canonical_sha256":"9b250884c38fd8c84d1419c246edaa7b3322585a85ad5441338fdfe4f4224008","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"},"source_kind":"arxiv","source_id":"1604.04767","source_version":1,"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-18T01:16:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XIrO6rzrbvo3r4+pznbmwYWOMMtXLl60mVTZv7nbhYOC584l67rzIMSjMqjY6M+M4abkeIyT+giPaqtTMhNvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:53:12.053032Z"},"content_sha256":"6838d38fcd51fa77fbf2249ad6c633189902bb4aaf670f00c97996d173206d8b","schema_version":"1.0","event_id":"sha256:6838d38fcd51fa77fbf2249ad6c633189902bb4aaf670f00c97996d173206d8b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TMSQRBGDR7MMQTIUDHBEN3NKPM","target":"graph","payload":{"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"},"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-18T01:16:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sA132fTjyPboMc4bQjHZXwg3a/y1YzA6SRFuVhK8MctmPMeNIbUf5CruzMyQRZ8FTlfAoyTORSFtbxSAfMYCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T04:53:12.053746Z"},"content_sha256":"9391c356d4bc37895a07c6f137031fd6b5fea6f25ce8ce3e1cae6d08e3c728c2","schema_version":"1.0","event_id":"sha256:9391c356d4bc37895a07c6f137031fd6b5fea6f25ce8ce3e1cae6d08e3c728c2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMSQRBGDR7MMQTIUDHBEN3NKPM/bundle.json","state_url":"https://pith.science/pith/TMSQRBGDR7MMQTIUDHBEN3NKPM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMSQRBGDR7MMQTIUDHBEN3NKPM/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-06-09T04:53:12Z","links":{"resolver":"https://pith.science/pith/TMSQRBGDR7MMQTIUDHBEN3NKPM","bundle":"https://pith.science/pith/TMSQRBGDR7MMQTIUDHBEN3NKPM/bundle.json","state":"https://pith.science/pith/TMSQRBGDR7MMQTIUDHBEN3NKPM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMSQRBGDR7MMQTIUDHBEN3NKPM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TMSQRBGDR7MMQTIUDHBEN3NKPM","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":"d17b11a1c7062853c773cfcb6c5bbdad8465282a9143973302396c34c4a1c838","cross_cats_sorted":["cs.CV","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-16T15:42:12Z","title_canon_sha256":"772f3fe4021cf233ec5e51ae5b3c8bf28b9e775796b7c73cf79371d3ada69b6f"},"schema_version":"1.0","source":{"id":"1604.04767","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.04767","created_at":"2026-05-18T01:16:58Z"},{"alias_kind":"arxiv_version","alias_value":"1604.04767v1","created_at":"2026-05-18T01:16:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04767","created_at":"2026-05-18T01:16:58Z"},{"alias_kind":"pith_short_12","alias_value":"TMSQRBGDR7MM","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TMSQRBGDR7MMQTIU","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TMSQRBGD","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:9391c356d4bc37895a07c6f137031fd6b5fea6f25ce8ce3e1cae6d08e3c728c2","target":"graph","created_at":"2026-05-18T01:16:58Z","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":"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","authors_text":"G\\\"unther Palm, Markus Thom, Matthias Rapp","cross_cats":["cs.CV","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-16T15:42:12Z","title":"Efficient Dictionary Learning with Sparseness-Enforcing Projections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04767","kind":"arxiv","version":1},"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:6838d38fcd51fa77fbf2249ad6c633189902bb4aaf670f00c97996d173206d8b","target":"record","created_at":"2026-05-18T01:16:58Z","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":"d17b11a1c7062853c773cfcb6c5bbdad8465282a9143973302396c34c4a1c838","cross_cats_sorted":["cs.CV","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-04-16T15:42:12Z","title_canon_sha256":"772f3fe4021cf233ec5e51ae5b3c8bf28b9e775796b7c73cf79371d3ada69b6f"},"schema_version":"1.0","source":{"id":"1604.04767","kind":"arxiv","version":1}},"canonical_sha256":"9b250884c38fd8c84d1419c246edaa7b3322585a85ad5441338fdfe4f4224008","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b250884c38fd8c84d1419c246edaa7b3322585a85ad5441338fdfe4f4224008","first_computed_at":"2026-05-18T01:16:58.610845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:58.610845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0/DpcrUBFVE8P8v+OfKB8o6YMKGbKvTbhsjCgqiNRx0puJXeIDZThe4n1a7HnQE7+asTX2Qr+4fMSLqmP4jFDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:58.611669Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.04767","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6838d38fcd51fa77fbf2249ad6c633189902bb4aaf670f00c97996d173206d8b","sha256:9391c356d4bc37895a07c6f137031fd6b5fea6f25ce8ce3e1cae6d08e3c728c2"],"state_sha256":"e9d69a0561000b3f5af9ca458297464e4dbb41ce7e15b5a40c8843853bdb21ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H6zHnn1qQd53fcSyyUgM8+tr2tJkc/fJixr0YfBIc8VWPFAg+RBkzmFy7CrlpnIr0x8JUUS3KQ2hGgxcWi93DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T04:53:12.057610Z","bundle_sha256":"a827a385bc438c637e06cb736d5af624303508fe2215161832fd645b385f3e98"}}