{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2OAHEF5PCHNSA7SQU72AT4FEBJ","short_pith_number":"pith:2OAHEF5P","canonical_record":{"source":{"id":"1705.10087","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-29T09:21:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d5028542007d304207ef912a744fe1bb4b959bd14e4c5c0ce1e2d55a5b17fa23","abstract_canon_sha256":"1036c7300eef0321b95f9c90d6cc06974e06c5974cf41ac05f61e4f20d87b474"},"schema_version":"1.0"},"canonical_sha256":"d3807217af11db207e50a7f409f0a40a443c34f8baf48c029c72f5ee64b8ecbd","source":{"kind":"arxiv","id":"1705.10087","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10087","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10087v2","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10087","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"pith_short_12","alias_value":"2OAHEF5PCHNS","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2OAHEF5PCHNSA7SQ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2OAHEF5P","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2OAHEF5PCHNSA7SQU72AT4FEBJ","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10087","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-29T09:21:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d5028542007d304207ef912a744fe1bb4b959bd14e4c5c0ce1e2d55a5b17fa23","abstract_canon_sha256":"1036c7300eef0321b95f9c90d6cc06974e06c5974cf41ac05f61e4f20d87b474"},"schema_version":"1.0"},"canonical_sha256":"d3807217af11db207e50a7f409f0a40a443c34f8baf48c029c72f5ee64b8ecbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:09.040209Z","signature_b64":"gOLFs7m7th7+35f9yXPrrjEnm4hHBZ9+HB8hTSKRfXVYYdTJ8d3CCTY3cEWC5PGCxFfpTy7u/cH2PMbaASDrAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3807217af11db207e50a7f409f0a40a443c34f8baf48c029c72f5ee64b8ecbd","last_reissued_at":"2026-05-18T00:16:09.039527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:09.039527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10087","source_version":2,"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:16:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"STsEz5c/P+MUP+exE0VNeVelyw/YGsH9TpmKrX3RYKgr6lfIW+Q3gUishugGr6UFHET8mScryyDvlTS07zh/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T06:58:25.416776Z"},"content_sha256":"ac607b2608bc089bdb2d16b96934617aef2076822df3663617d11a4818885eb9","schema_version":"1.0","event_id":"sha256:ac607b2608bc089bdb2d16b96934617aef2076822df3663617d11a4818885eb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2OAHEF5PCHNSA7SQU72AT4FEBJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DICOD: Distributed Convolutional Sparse Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Laurent Oudre, Nicolas Vayatis, Thomas Moreau","submitted_at":"2017-05-29T09:21:30Z","abstract_excerpt":"In this paper, we introduce DICOD, a convolutional sparse coding algorithm which builds shift invariant representations for long signals. This algorithm is designed to run in a distributed setting, with local message passing, making it communication efficient. It is based on coordinate descent and uses locally greedy updates which accelerate the resolution compared to greedy coordinate selection. We prove the convergence of this algorithm and highlight its computational speed-up which is super-linear in the number of cores used. We also provide empirical evidence for the acceleration propertie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10087","kind":"arxiv","version":2},"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:16:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mD/Rx5SSrOC5Jk5YmFZAFdJ5aTTYnBP6DcM+1F1PgRFzgSmIw8LR706yyxDucAc/C1DkMn+P8DWuLEJxDFNDDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T06:58:25.417556Z"},"content_sha256":"1ccf17bbe28508353142d341e7fa96f037693df64795db18a088f3ce4650a01b","schema_version":"1.0","event_id":"sha256:1ccf17bbe28508353142d341e7fa96f037693df64795db18a088f3ce4650a01b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2OAHEF5PCHNSA7SQU72AT4FEBJ/bundle.json","state_url":"https://pith.science/pith/2OAHEF5PCHNSA7SQU72AT4FEBJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2OAHEF5PCHNSA7SQU72AT4FEBJ/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-05-20T06:58:25Z","links":{"resolver":"https://pith.science/pith/2OAHEF5PCHNSA7SQU72AT4FEBJ","bundle":"https://pith.science/pith/2OAHEF5PCHNSA7SQU72AT4FEBJ/bundle.json","state":"https://pith.science/pith/2OAHEF5PCHNSA7SQU72AT4FEBJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2OAHEF5PCHNSA7SQU72AT4FEBJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2OAHEF5PCHNSA7SQU72AT4FEBJ","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":"1036c7300eef0321b95f9c90d6cc06974e06c5974cf41ac05f61e4f20d87b474","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-29T09:21:30Z","title_canon_sha256":"d5028542007d304207ef912a744fe1bb4b959bd14e4c5c0ce1e2d55a5b17fa23"},"schema_version":"1.0","source":{"id":"1705.10087","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10087","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10087v2","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10087","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"pith_short_12","alias_value":"2OAHEF5PCHNS","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2OAHEF5PCHNSA7SQ","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2OAHEF5P","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:1ccf17bbe28508353142d341e7fa96f037693df64795db18a088f3ce4650a01b","target":"graph","created_at":"2026-05-18T00:16:09Z","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":"In this paper, we introduce DICOD, a convolutional sparse coding algorithm which builds shift invariant representations for long signals. This algorithm is designed to run in a distributed setting, with local message passing, making it communication efficient. It is based on coordinate descent and uses locally greedy updates which accelerate the resolution compared to greedy coordinate selection. We prove the convergence of this algorithm and highlight its computational speed-up which is super-linear in the number of cores used. We also provide empirical evidence for the acceleration propertie","authors_text":"Laurent Oudre, Nicolas Vayatis, Thomas Moreau","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-29T09:21:30Z","title":"DICOD: Distributed Convolutional Sparse Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10087","kind":"arxiv","version":2},"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:ac607b2608bc089bdb2d16b96934617aef2076822df3663617d11a4818885eb9","target":"record","created_at":"2026-05-18T00:16:09Z","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":"1036c7300eef0321b95f9c90d6cc06974e06c5974cf41ac05f61e4f20d87b474","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-29T09:21:30Z","title_canon_sha256":"d5028542007d304207ef912a744fe1bb4b959bd14e4c5c0ce1e2d55a5b17fa23"},"schema_version":"1.0","source":{"id":"1705.10087","kind":"arxiv","version":2}},"canonical_sha256":"d3807217af11db207e50a7f409f0a40a443c34f8baf48c029c72f5ee64b8ecbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d3807217af11db207e50a7f409f0a40a443c34f8baf48c029c72f5ee64b8ecbd","first_computed_at":"2026-05-18T00:16:09.039527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:09.039527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gOLFs7m7th7+35f9yXPrrjEnm4hHBZ9+HB8hTSKRfXVYYdTJ8d3CCTY3cEWC5PGCxFfpTy7u/cH2PMbaASDrAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:09.040209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10087","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac607b2608bc089bdb2d16b96934617aef2076822df3663617d11a4818885eb9","sha256:1ccf17bbe28508353142d341e7fa96f037693df64795db18a088f3ce4650a01b"],"state_sha256":"fbeb1c238a81a105aaa4847a530cbac5911cf380ae51077bfd9b116a0c2de991"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lqsZoYOvfe2/2Ps5jHH5fq7rqo6QcfM107pU9f7WWh/IiCCCSJL3/9Con77tLqDLpCze/faoAiwoO+77LcK2Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T06:58:25.421271Z","bundle_sha256":"a707e582eb70ee22556b225ec6b722497acb14b8b0fc3349102ec223279a57a1"}}