{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:2XYMTRQQDIVB2IRIJ37X7O4CA7","short_pith_number":"pith:2XYMTRQQ","canonical_record":{"source":{"id":"1812.10538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2018-12-26T21:05:27Z","cross_cats_sorted":["cs.LG","eess.SP","stat.ML"],"title_canon_sha256":"2ebb673291d84ef5de0ca267a1d8d16079dc986fecc7e8847d63a2605f1995b8","abstract_canon_sha256":"bf2b6d518d03453467b6fcabebd3c75f074f133e30a2b34afa2935e9ff00efd6"},"schema_version":"1.0"},"canonical_sha256":"d5f0c9c6101a2a1d22284eff7fbb8207f4dd106505f84d51bcc93a8b0f59dd3a","source":{"kind":"arxiv","id":"1812.10538","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10538","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10538v1","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10538","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"pith_short_12","alias_value":"2XYMTRQQDIVB","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2XYMTRQQDIVB2IRI","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2XYMTRQQ","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:2XYMTRQQDIVB2IRIJ37X7O4CA7","target":"record","payload":{"canonical_record":{"source":{"id":"1812.10538","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2018-12-26T21:05:27Z","cross_cats_sorted":["cs.LG","eess.SP","stat.ML"],"title_canon_sha256":"2ebb673291d84ef5de0ca267a1d8d16079dc986fecc7e8847d63a2605f1995b8","abstract_canon_sha256":"bf2b6d518d03453467b6fcabebd3c75f074f133e30a2b34afa2935e9ff00efd6"},"schema_version":"1.0"},"canonical_sha256":"d5f0c9c6101a2a1d22284eff7fbb8207f4dd106505f84d51bcc93a8b0f59dd3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:20.786834Z","signature_b64":"++3cey79vvpZtFEbplWB/QzEOnKMhbdekzuLhixddX/5AjvQypZHnIayER8hiu4rnhDRF+mvhYDGqGP6oTDUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5f0c9c6101a2a1d22284eff7fbb8207f4dd106505f84d51bcc93a8b0f59dd3a","last_reissued_at":"2026-05-17T23:57:20.786144Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:20.786144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.10538","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-17T23:57:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XamwwuUW0H5+EFvtVoRGpU3YCrBgjcQQP8FBcuSI1bsLxmFA42NtfncXHElDdLdT5wdSzVlQsJoLO53AgZbVCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:00:47.804584Z"},"content_sha256":"de33e7123b1082f2c7c811d232d38e9e9cd518a6a8695ac9d2247f87ff2e2fc3","schema_version":"1.0","event_id":"sha256:de33e7123b1082f2c7c811d232d38e9e9cd518a6a8695ac9d2247f87ff2e2fc3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:2XYMTRQQDIVB2IRIJ37X7O4CA7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Greedy Approach to $\\ell_{0,\\infty}$ Based Convolutional Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","eess.SP","stat.ML"],"primary_cat":"eess.IV","authors_text":"Elad Plaut, Raja Giryes","submitted_at":"2018-12-26T21:05:27Z","abstract_excerpt":"Sparse coding techniques for image processing traditionally rely on a processing of small overlapping patches separately followed by averaging. This has the disadvantage that the reconstructed image no longer obeys the sparsity prior used in the processing. For this purpose convolutional sparse coding has been introduced, where a shift-invariant dictionary is used and the sparsity of the recovered image is maintained. Most such strategies target the $\\ell_0$ \"norm\" or the $\\ell_1$ norm of the whole image, which may create an imbalanced sparsity across various regions in the image. In order to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10538","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-17T23:57:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SCmlpg3rrV6SF0WPn6IFv5DdSa3KxmfmGfxzJe4Gt4FoW/Be4uqQyP+hP4CZ8a+XWQDJPbPzpr+c1y9Qph+EAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T05:00:47.805303Z"},"content_sha256":"47de3d0bbac7b60346ac53c7cb16c6fe9e30bb3335f27e467262b1b1e80d725f","schema_version":"1.0","event_id":"sha256:47de3d0bbac7b60346ac53c7cb16c6fe9e30bb3335f27e467262b1b1e80d725f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2XYMTRQQDIVB2IRIJ37X7O4CA7/bundle.json","state_url":"https://pith.science/pith/2XYMTRQQDIVB2IRIJ37X7O4CA7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2XYMTRQQDIVB2IRIJ37X7O4CA7/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-09T05:00:47Z","links":{"resolver":"https://pith.science/pith/2XYMTRQQDIVB2IRIJ37X7O4CA7","bundle":"https://pith.science/pith/2XYMTRQQDIVB2IRIJ37X7O4CA7/bundle.json","state":"https://pith.science/pith/2XYMTRQQDIVB2IRIJ37X7O4CA7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2XYMTRQQDIVB2IRIJ37X7O4CA7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2XYMTRQQDIVB2IRIJ37X7O4CA7","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":"bf2b6d518d03453467b6fcabebd3c75f074f133e30a2b34afa2935e9ff00efd6","cross_cats_sorted":["cs.LG","eess.SP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2018-12-26T21:05:27Z","title_canon_sha256":"2ebb673291d84ef5de0ca267a1d8d16079dc986fecc7e8847d63a2605f1995b8"},"schema_version":"1.0","source":{"id":"1812.10538","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.10538","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"arxiv_version","alias_value":"1812.10538v1","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.10538","created_at":"2026-05-17T23:57:20Z"},{"alias_kind":"pith_short_12","alias_value":"2XYMTRQQDIVB","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2XYMTRQQDIVB2IRI","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2XYMTRQQ","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:47de3d0bbac7b60346ac53c7cb16c6fe9e30bb3335f27e467262b1b1e80d725f","target":"graph","created_at":"2026-05-17T23:57:20Z","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":"Sparse coding techniques for image processing traditionally rely on a processing of small overlapping patches separately followed by averaging. This has the disadvantage that the reconstructed image no longer obeys the sparsity prior used in the processing. For this purpose convolutional sparse coding has been introduced, where a shift-invariant dictionary is used and the sparsity of the recovered image is maintained. Most such strategies target the $\\ell_0$ \"norm\" or the $\\ell_1$ norm of the whole image, which may create an imbalanced sparsity across various regions in the image. In order to ","authors_text":"Elad Plaut, Raja Giryes","cross_cats":["cs.LG","eess.SP","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2018-12-26T21:05:27Z","title":"A Greedy Approach to $\\ell_{0,\\infty}$ Based Convolutional Sparse Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.10538","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:de33e7123b1082f2c7c811d232d38e9e9cd518a6a8695ac9d2247f87ff2e2fc3","target":"record","created_at":"2026-05-17T23:57:20Z","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":"bf2b6d518d03453467b6fcabebd3c75f074f133e30a2b34afa2935e9ff00efd6","cross_cats_sorted":["cs.LG","eess.SP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2018-12-26T21:05:27Z","title_canon_sha256":"2ebb673291d84ef5de0ca267a1d8d16079dc986fecc7e8847d63a2605f1995b8"},"schema_version":"1.0","source":{"id":"1812.10538","kind":"arxiv","version":1}},"canonical_sha256":"d5f0c9c6101a2a1d22284eff7fbb8207f4dd106505f84d51bcc93a8b0f59dd3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5f0c9c6101a2a1d22284eff7fbb8207f4dd106505f84d51bcc93a8b0f59dd3a","first_computed_at":"2026-05-17T23:57:20.786144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:20.786144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"++3cey79vvpZtFEbplWB/QzEOnKMhbdekzuLhixddX/5AjvQypZHnIayER8hiu4rnhDRF+mvhYDGqGP6oTDUDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:20.786834Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.10538","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de33e7123b1082f2c7c811d232d38e9e9cd518a6a8695ac9d2247f87ff2e2fc3","sha256:47de3d0bbac7b60346ac53c7cb16c6fe9e30bb3335f27e467262b1b1e80d725f"],"state_sha256":"9c6b620a228c7240128660b423ad22aff334f65ef331036655cc26b6e8b23428"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fEpEIDHNn3NLtL/Rs/YQMXq7bkac/5NLqb0nkYLtODNtxPhjPrNmEz6GJ53n3AxYGH6Gg98S29UMp1rJ9kbRBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T05:00:47.809204Z","bundle_sha256":"0f1580fc8519c19e1001d4777af6d93971b81ff4e0fadefe6fb790e891a1f9b4"}}