{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:44NJ7MAX5MWGHHPEU5PWGH4WXK","short_pith_number":"pith:44NJ7MAX","schema_version":"1.0","canonical_sha256":"e71a9fb017eb2c639de4a75f631f96baa0602381a14e0705191996fc30855981","source":{"kind":"arxiv","id":"1909.00145","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Convolutional Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"eess.IV","authors_text":"Jinhui Xiong, Peter Richt\\'arik, Wolfgang Heidrich","submitted_at":"2019-08-31T06:37:08Z","abstract_excerpt":"State-of-the-art methods for Convolutional Sparse Coding usually employ Fourier-domain solvers in order to speed up the convolution operators. However, this approach is not without shortcomings. For example, Fourier-domain representations implicitly assume circular boundary conditions and make it hard to fully exploit the sparsity of the problem as well as the small spatial support of the filters. In this work, we propose a novel stochastic spatial-domain solver, in which a randomized subsampling strategy is introduced during the learning sparse codes. Afterwards, we extend the proposed strate"},"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":"1909.00145","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2019-08-31T06:37:08Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"2817106c7cdd3bf545a93517370e06598224032f073819d63f4f83b6a767efdc","abstract_canon_sha256":"948f18c4af9421f97ffa728f3c16d2891e4055b9b54a091856dbb67e077a41c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:01:06.094952Z","signature_b64":"SFCWjQSpyFZSuSMXX7QdEDcy7a6pIc5x78Ka9oSNSF/V9G/5/IbJtLxyNx3JmbLabgX+UZ1JkYNieNOlQM5QDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e71a9fb017eb2c639de4a75f631f96baa0602381a14e0705191996fc30855981","last_reissued_at":"2026-07-05T00:01:06.094595Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:01:06.094595Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Convolutional Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"eess.IV","authors_text":"Jinhui Xiong, Peter Richt\\'arik, Wolfgang Heidrich","submitted_at":"2019-08-31T06:37:08Z","abstract_excerpt":"State-of-the-art methods for Convolutional Sparse Coding usually employ Fourier-domain solvers in order to speed up the convolution operators. However, this approach is not without shortcomings. For example, Fourier-domain representations implicitly assume circular boundary conditions and make it hard to fully exploit the sparsity of the problem as well as the small spatial support of the filters. In this work, we propose a novel stochastic spatial-domain solver, in which a randomized subsampling strategy is introduced during the learning sparse codes. Afterwards, we extend the proposed strate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.00145","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.00145/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1909.00145","created_at":"2026-07-05T00:01:06.094657+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.00145v1","created_at":"2026-07-05T00:01:06.094657+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.00145","created_at":"2026-07-05T00:01:06.094657+00:00"},{"alias_kind":"pith_short_12","alias_value":"44NJ7MAX5MWG","created_at":"2026-07-05T00:01:06.094657+00:00"},{"alias_kind":"pith_short_16","alias_value":"44NJ7MAX5MWGHHPE","created_at":"2026-07-05T00:01:06.094657+00:00"},{"alias_kind":"pith_short_8","alias_value":"44NJ7MAX","created_at":"2026-07-05T00:01:06.094657+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/44NJ7MAX5MWGHHPEU5PWGH4WXK","json":"https://pith.science/pith/44NJ7MAX5MWGHHPEU5PWGH4WXK.json","graph_json":"https://pith.science/api/pith-number/44NJ7MAX5MWGHHPEU5PWGH4WXK/graph.json","events_json":"https://pith.science/api/pith-number/44NJ7MAX5MWGHHPEU5PWGH4WXK/events.json","paper":"https://pith.science/paper/44NJ7MAX"},"agent_actions":{"view_html":"https://pith.science/pith/44NJ7MAX5MWGHHPEU5PWGH4WXK","download_json":"https://pith.science/pith/44NJ7MAX5MWGHHPEU5PWGH4WXK.json","view_paper":"https://pith.science/paper/44NJ7MAX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.00145&json=true","fetch_graph":"https://pith.science/api/pith-number/44NJ7MAX5MWGHHPEU5PWGH4WXK/graph.json","fetch_events":"https://pith.science/api/pith-number/44NJ7MAX5MWGHHPEU5PWGH4WXK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/44NJ7MAX5MWGHHPEU5PWGH4WXK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/44NJ7MAX5MWGHHPEU5PWGH4WXK/action/storage_attestation","attest_author":"https://pith.science/pith/44NJ7MAX5MWGHHPEU5PWGH4WXK/action/author_attestation","sign_citation":"https://pith.science/pith/44NJ7MAX5MWGHHPEU5PWGH4WXK/action/citation_signature","submit_replication":"https://pith.science/pith/44NJ7MAX5MWGHHPEU5PWGH4WXK/action/replication_record"}},"created_at":"2026-07-05T00:01:06.094657+00:00","updated_at":"2026-07-05T00:01:06.094657+00:00"}