{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4LSRFA2FGECARBYD2LTWXSM2UX","short_pith_number":"pith:4LSRFA2F","canonical_record":{"source":{"id":"1805.08768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T17:54:13Z","cross_cats_sorted":["cs.AI","cs.DC","stat.ML"],"title_canon_sha256":"b9b2954cab20d1f7d08e64bf069a6c791cf9645de770fd9bc64bfdef66fb335f","abstract_canon_sha256":"34cad94bec556a19efaf8f1de3e23f7831a76bb1a97d4f8cdd11f83100dc5628"},"schema_version":"1.0"},"canonical_sha256":"e2e51283453104088703d2e76bc99aa5fdf6088a0390885adcd958cc11eed457","source":{"kind":"arxiv","id":"1805.08768","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08768","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08768v1","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08768","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"pith_short_12","alias_value":"4LSRFA2FGECA","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4LSRFA2FGECARBYD","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4LSRFA2F","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4LSRFA2FGECARBYD2LTWXSM2UX","target":"record","payload":{"canonical_record":{"source":{"id":"1805.08768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T17:54:13Z","cross_cats_sorted":["cs.AI","cs.DC","stat.ML"],"title_canon_sha256":"b9b2954cab20d1f7d08e64bf069a6c791cf9645de770fd9bc64bfdef66fb335f","abstract_canon_sha256":"34cad94bec556a19efaf8f1de3e23f7831a76bb1a97d4f8cdd11f83100dc5628"},"schema_version":"1.0"},"canonical_sha256":"e2e51283453104088703d2e76bc99aa5fdf6088a0390885adcd958cc11eed457","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:25.120418Z","signature_b64":"VuOorCcWhYO2/G4sKJCViusYcI/ePBKTiO1Dhh+Rk15xXb2uR4r3wOmIPgoSqSd2NepVSzP2pLVZMwpA7HumCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2e51283453104088703d2e76bc99aa5fdf6088a0390885adcd958cc11eed457","last_reissued_at":"2026-05-18T00:15:25.119886Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:25.119886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.08768","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-18T00:15:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A5t2T7Sy4FNPHeYWTi98VY/AT99hwB2e0Mrdd1Ba7btip5tUQGvK35P/ozmvE7e2xm9WScjAJe49+8ZWJs/DAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:11:32.959148Z"},"content_sha256":"5f32db43c3cc4b021ecb208dcf8cec7bd62e323c8c7ad3c626390cbc13fd84f7","schema_version":"1.0","event_id":"sha256:5f32db43c3cc4b021ecb208dcf8cec7bd62e323c8c7ad3c626390cbc13fd84f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4LSRFA2FGECARBYD2LTWXSM2UX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Binary Compression: Towards Distributed Deep Learning with minimal Communication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Felix Sattler, Klaus-Robert M\\\"uller, Simon Wiedemann, Wojciech Samek","submitted_at":"2018-05-22T17:54:13Z","abstract_excerpt":"Currently, progressively larger deep neural networks are trained on ever growing data corpora. As this trend is only going to increase in the future, distributed training schemes are becoming increasingly relevant. A major issue in distributed training is the limited communication bandwidth between contributing nodes or prohibitive communication cost in general. These challenges become even more pressing, as the number of computation nodes increases. To counteract this development we propose sparse binary compression (SBC), a compression framework that allows for a drastic reduction of communi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08768","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-18T00:15:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ARzs4PvRQSJtlUo9qZ2sxqclhFkwrgQZnACKQSRGJMzomKS+4apf0Q8Wb+fCkZzlbpUMjgSyJq9o10l3yzKSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:11:32.959517Z"},"content_sha256":"8698f22ae175154c6c5f7e603b28a04402b177b3446f8c0739ed697d0e599ffc","schema_version":"1.0","event_id":"sha256:8698f22ae175154c6c5f7e603b28a04402b177b3446f8c0739ed697d0e599ffc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4LSRFA2FGECARBYD2LTWXSM2UX/bundle.json","state_url":"https://pith.science/pith/4LSRFA2FGECARBYD2LTWXSM2UX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4LSRFA2FGECARBYD2LTWXSM2UX/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-31T07:11:32Z","links":{"resolver":"https://pith.science/pith/4LSRFA2FGECARBYD2LTWXSM2UX","bundle":"https://pith.science/pith/4LSRFA2FGECARBYD2LTWXSM2UX/bundle.json","state":"https://pith.science/pith/4LSRFA2FGECARBYD2LTWXSM2UX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4LSRFA2FGECARBYD2LTWXSM2UX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4LSRFA2FGECARBYD2LTWXSM2UX","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":"34cad94bec556a19efaf8f1de3e23f7831a76bb1a97d4f8cdd11f83100dc5628","cross_cats_sorted":["cs.AI","cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T17:54:13Z","title_canon_sha256":"b9b2954cab20d1f7d08e64bf069a6c791cf9645de770fd9bc64bfdef66fb335f"},"schema_version":"1.0","source":{"id":"1805.08768","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08768","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08768v1","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08768","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"pith_short_12","alias_value":"4LSRFA2FGECA","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4LSRFA2FGECARBYD","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4LSRFA2F","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:8698f22ae175154c6c5f7e603b28a04402b177b3446f8c0739ed697d0e599ffc","target":"graph","created_at":"2026-05-18T00:15:25Z","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":"Currently, progressively larger deep neural networks are trained on ever growing data corpora. As this trend is only going to increase in the future, distributed training schemes are becoming increasingly relevant. A major issue in distributed training is the limited communication bandwidth between contributing nodes or prohibitive communication cost in general. These challenges become even more pressing, as the number of computation nodes increases. To counteract this development we propose sparse binary compression (SBC), a compression framework that allows for a drastic reduction of communi","authors_text":"Felix Sattler, Klaus-Robert M\\\"uller, Simon Wiedemann, Wojciech Samek","cross_cats":["cs.AI","cs.DC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T17:54:13Z","title":"Sparse Binary Compression: Towards Distributed Deep Learning with minimal Communication"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08768","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:5f32db43c3cc4b021ecb208dcf8cec7bd62e323c8c7ad3c626390cbc13fd84f7","target":"record","created_at":"2026-05-18T00:15:25Z","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":"34cad94bec556a19efaf8f1de3e23f7831a76bb1a97d4f8cdd11f83100dc5628","cross_cats_sorted":["cs.AI","cs.DC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-22T17:54:13Z","title_canon_sha256":"b9b2954cab20d1f7d08e64bf069a6c791cf9645de770fd9bc64bfdef66fb335f"},"schema_version":"1.0","source":{"id":"1805.08768","kind":"arxiv","version":1}},"canonical_sha256":"e2e51283453104088703d2e76bc99aa5fdf6088a0390885adcd958cc11eed457","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2e51283453104088703d2e76bc99aa5fdf6088a0390885adcd958cc11eed457","first_computed_at":"2026-05-18T00:15:25.119886Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:25.119886Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VuOorCcWhYO2/G4sKJCViusYcI/ePBKTiO1Dhh+Rk15xXb2uR4r3wOmIPgoSqSd2NepVSzP2pLVZMwpA7HumCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:25.120418Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08768","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5f32db43c3cc4b021ecb208dcf8cec7bd62e323c8c7ad3c626390cbc13fd84f7","sha256:8698f22ae175154c6c5f7e603b28a04402b177b3446f8c0739ed697d0e599ffc"],"state_sha256":"f14d5f2d41f4f869cc1aad041f456b71f05a6fcfe3f640f46b81836e23c7995d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HfKGu3/Ne5Z+b+IDqZNq2i2FoNQyqPQSQGvDzEaFUyzSf2Sp09aPAV6HwQlVw+JS6xDbeTs2fmZTYIP9aBC5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:11:32.961655Z","bundle_sha256":"3157a403672c9a8c3cb85b95504d297d766567c9172b4b41c38bb60755b6e97b"}}