{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:X2M2C5A3WRBENBUKTDG5ANJRNF","short_pith_number":"pith:X2M2C5A3","canonical_record":{"source":{"id":"1709.00106","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-31T23:19:02Z","cross_cats_sorted":["cs.CV","eess.IV","math.OC","stat.ML"],"title_canon_sha256":"5591c9670b534cdd909e40c768f863b5f4de8275a34037a147627a796d381b04","abstract_canon_sha256":"0dccac72c762585c33e741346da3e904324df870eb80014fad29166b974857b2"},"schema_version":"1.0"},"canonical_sha256":"be99a1741bb44246868a98cdd035316972513a27f2fd745ecdf30f5003b0da3b","source":{"kind":"arxiv","id":"1709.00106","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00106","created_at":"2026-05-18T00:13:07Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00106v3","created_at":"2026-05-18T00:13:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00106","created_at":"2026-05-18T00:13:07Z"},{"alias_kind":"pith_short_12","alias_value":"X2M2C5A3WRBE","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X2M2C5A3WRBENBUK","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X2M2C5A3","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:X2M2C5A3WRBENBUKTDG5ANJRNF","target":"record","payload":{"canonical_record":{"source":{"id":"1709.00106","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-31T23:19:02Z","cross_cats_sorted":["cs.CV","eess.IV","math.OC","stat.ML"],"title_canon_sha256":"5591c9670b534cdd909e40c768f863b5f4de8275a34037a147627a796d381b04","abstract_canon_sha256":"0dccac72c762585c33e741346da3e904324df870eb80014fad29166b974857b2"},"schema_version":"1.0"},"canonical_sha256":"be99a1741bb44246868a98cdd035316972513a27f2fd745ecdf30f5003b0da3b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:07.447901Z","signature_b64":"pX6Nh0rxEon2zf107OJ0yEjJ5dReLf2XbUWXT34imo1SyKBBnfQS+XNtQqEdy8v3xaqR4ZdfNkICtPjW6N/5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be99a1741bb44246868a98cdd035316972513a27f2fd745ecdf30f5003b0da3b","last_reissued_at":"2026-05-18T00:13:07.447153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:07.447153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.00106","source_version":3,"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-18T00:13:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZnC0Zn+saaPIV0H+y01IIjcJ+Z2TIRm82kfeJQgV3S32XzmsEQdwCBqTqrnGRZsgMZDvM5+2LlFiJhFMc/OcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T01:01:11.944225Z"},"content_sha256":"21ee15522997acc48c1e9fa1eee3e035131b0839285f1848ff2d96118c6c42c9","schema_version":"1.0","event_id":"sha256:21ee15522997acc48c1e9fa1eee3e035131b0839285f1848ff2d96118c6c42c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:X2M2C5A3WRBENBUKTDG5ANJRNF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"First and Second Order Methods for Online Convolutional Dictionary Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","eess.IV","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Brendt Wohlberg, Cristina Garcia-Cardona, Jialin Liu, Wotao Yin","submitted_at":"2017-08-31T23:19:02Z","abstract_excerpt":"Convolutional sparse representations are a form of sparse representation with a structured, translation invariant dictionary. Most convolutional dictionary learning algorithms to date operate in batch mode, requiring simultaneous access to all training images during the learning process, which results in very high memory usage and severely limits the training data that can be used. Very recently, however, a number of authors have considered the design of online convolutional dictionary learning algorithms that offer far better scaling of memory and computational cost with training set size tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00106","kind":"arxiv","version":3},"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-18T00:13:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"meIuAnCAXV219EGPAA7eglBrDlzX1xFXmIx0Ng03Gkqn2hqbdA+23wMlUU4E41edoCXwzSlgWReUAd9ZcDFMAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T01:01:11.944605Z"},"content_sha256":"840ff6320ff105c4fa47480cc081e99125866f4a883fd3c5f3dd6789d824cb1d","schema_version":"1.0","event_id":"sha256:840ff6320ff105c4fa47480cc081e99125866f4a883fd3c5f3dd6789d824cb1d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X2M2C5A3WRBENBUKTDG5ANJRNF/bundle.json","state_url":"https://pith.science/pith/X2M2C5A3WRBENBUKTDG5ANJRNF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X2M2C5A3WRBENBUKTDG5ANJRNF/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-20T01:01:11Z","links":{"resolver":"https://pith.science/pith/X2M2C5A3WRBENBUKTDG5ANJRNF","bundle":"https://pith.science/pith/X2M2C5A3WRBENBUKTDG5ANJRNF/bundle.json","state":"https://pith.science/pith/X2M2C5A3WRBENBUKTDG5ANJRNF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X2M2C5A3WRBENBUKTDG5ANJRNF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:X2M2C5A3WRBENBUKTDG5ANJRNF","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":"0dccac72c762585c33e741346da3e904324df870eb80014fad29166b974857b2","cross_cats_sorted":["cs.CV","eess.IV","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-31T23:19:02Z","title_canon_sha256":"5591c9670b534cdd909e40c768f863b5f4de8275a34037a147627a796d381b04"},"schema_version":"1.0","source":{"id":"1709.00106","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.00106","created_at":"2026-05-18T00:13:07Z"},{"alias_kind":"arxiv_version","alias_value":"1709.00106v3","created_at":"2026-05-18T00:13:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00106","created_at":"2026-05-18T00:13:07Z"},{"alias_kind":"pith_short_12","alias_value":"X2M2C5A3WRBE","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"X2M2C5A3WRBENBUK","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"X2M2C5A3","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:840ff6320ff105c4fa47480cc081e99125866f4a883fd3c5f3dd6789d824cb1d","target":"graph","created_at":"2026-05-18T00:13:07Z","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":"Convolutional sparse representations are a form of sparse representation with a structured, translation invariant dictionary. Most convolutional dictionary learning algorithms to date operate in batch mode, requiring simultaneous access to all training images during the learning process, which results in very high memory usage and severely limits the training data that can be used. Very recently, however, a number of authors have considered the design of online convolutional dictionary learning algorithms that offer far better scaling of memory and computational cost with training set size tha","authors_text":"Brendt Wohlberg, Cristina Garcia-Cardona, Jialin Liu, Wotao Yin","cross_cats":["cs.CV","eess.IV","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-31T23:19:02Z","title":"First and Second Order Methods for Online Convolutional Dictionary Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00106","kind":"arxiv","version":3},"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:21ee15522997acc48c1e9fa1eee3e035131b0839285f1848ff2d96118c6c42c9","target":"record","created_at":"2026-05-18T00:13:07Z","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":"0dccac72c762585c33e741346da3e904324df870eb80014fad29166b974857b2","cross_cats_sorted":["cs.CV","eess.IV","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-31T23:19:02Z","title_canon_sha256":"5591c9670b534cdd909e40c768f863b5f4de8275a34037a147627a796d381b04"},"schema_version":"1.0","source":{"id":"1709.00106","kind":"arxiv","version":3}},"canonical_sha256":"be99a1741bb44246868a98cdd035316972513a27f2fd745ecdf30f5003b0da3b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be99a1741bb44246868a98cdd035316972513a27f2fd745ecdf30f5003b0da3b","first_computed_at":"2026-05-18T00:13:07.447153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:07.447153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pX6Nh0rxEon2zf107OJ0yEjJ5dReLf2XbUWXT34imo1SyKBBnfQS+XNtQqEdy8v3xaqR4ZdfNkICtPjW6N/5DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:07.447901Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.00106","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21ee15522997acc48c1e9fa1eee3e035131b0839285f1848ff2d96118c6c42c9","sha256:840ff6320ff105c4fa47480cc081e99125866f4a883fd3c5f3dd6789d824cb1d"],"state_sha256":"ea34ab4d18de4450dedb1f28f089f41ed87dc41c59b9a9ad52ebe156422a0e9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uwIx/GXvdv/aIQ72g5j+N/CUCsMqeFLUenevuNSLJjaCDRaHXJnbsMUGFlsMkcFSMYpCi31gK6IqBj67eMjdBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T01:01:11.946617Z","bundle_sha256":"d8e608cdcd19a04fc33c08a6862bce72b3d6024c24ccb9ae33912dd5e0386ebe"}}