{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KDB7N6IY6CZCCFINFADZR6D6S3","short_pith_number":"pith:KDB7N6IY","schema_version":"1.0","canonical_sha256":"50c3f6f918f0b221150d280798f87e96c1c92a8cefc29a6fe0c0257a7c2bc78e","source":{"kind":"arxiv","id":"1802.07389","version":1},"attestation_state":"computed","paper":{"title":"3LC: Lightweight and Effective Traffic Compression for Distributed Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"David G. Andersen, Hyeontaek Lim, Michael Kaminsky","submitted_at":"2018-02-21T01:08:58Z","abstract_excerpt":"The performance and efficiency of distributed machine learning (ML) depends significantly on how long it takes for nodes to exchange state changes. Overly-aggressive attempts to reduce communication often sacrifice final model accuracy and necessitate additional ML techniques to compensate for this loss, limiting their generality. Some attempts to reduce communication incur high computation overhead, which makes their performance benefits visible only over slow networks.\n  We present 3LC, a lossy compression scheme for state change traffic that strikes balance between multiple goals: traffic r"},"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":"1802.07389","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-21T01:08:58Z","cross_cats_sorted":["cs.DC","stat.ML"],"title_canon_sha256":"12f60a80c1902330fc7f8ff176b72247ebafeee0d01a1242c3a2208c81ea3564","abstract_canon_sha256":"120f6fffe3d63463b16ffbde683fef002419306232725db162240a4108fae709"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:50.352128Z","signature_b64":"7XzTQiQn7SyYL5/TPdjE9ooVh8cPMRUaGC09W8FjOfm+fe2rZlqN7Ygtl/08/Y79L7SpLp9Mpy2xTgITU+/bCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50c3f6f918f0b221150d280798f87e96c1c92a8cefc29a6fe0c0257a7c2bc78e","last_reissued_at":"2026-05-18T00:22:50.351627Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:50.351627Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"3LC: Lightweight and Effective Traffic Compression for Distributed Machine Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","stat.ML"],"primary_cat":"cs.LG","authors_text":"David G. Andersen, Hyeontaek Lim, Michael Kaminsky","submitted_at":"2018-02-21T01:08:58Z","abstract_excerpt":"The performance and efficiency of distributed machine learning (ML) depends significantly on how long it takes for nodes to exchange state changes. Overly-aggressive attempts to reduce communication often sacrifice final model accuracy and necessitate additional ML techniques to compensate for this loss, limiting their generality. Some attempts to reduce communication incur high computation overhead, which makes their performance benefits visible only over slow networks.\n  We present 3LC, a lossy compression scheme for state change traffic that strikes balance between multiple goals: traffic r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.07389","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.07389","created_at":"2026-05-18T00:22:50.351704+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.07389v1","created_at":"2026-05-18T00:22:50.351704+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.07389","created_at":"2026-05-18T00:22:50.351704+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDB7N6IY6CZC","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDB7N6IY6CZCCFIN","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDB7N6IY","created_at":"2026-05-18T12:32:33.847187+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/KDB7N6IY6CZCCFINFADZR6D6S3","json":"https://pith.science/pith/KDB7N6IY6CZCCFINFADZR6D6S3.json","graph_json":"https://pith.science/api/pith-number/KDB7N6IY6CZCCFINFADZR6D6S3/graph.json","events_json":"https://pith.science/api/pith-number/KDB7N6IY6CZCCFINFADZR6D6S3/events.json","paper":"https://pith.science/paper/KDB7N6IY"},"agent_actions":{"view_html":"https://pith.science/pith/KDB7N6IY6CZCCFINFADZR6D6S3","download_json":"https://pith.science/pith/KDB7N6IY6CZCCFINFADZR6D6S3.json","view_paper":"https://pith.science/paper/KDB7N6IY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.07389&json=true","fetch_graph":"https://pith.science/api/pith-number/KDB7N6IY6CZCCFINFADZR6D6S3/graph.json","fetch_events":"https://pith.science/api/pith-number/KDB7N6IY6CZCCFINFADZR6D6S3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDB7N6IY6CZCCFINFADZR6D6S3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDB7N6IY6CZCCFINFADZR6D6S3/action/storage_attestation","attest_author":"https://pith.science/pith/KDB7N6IY6CZCCFINFADZR6D6S3/action/author_attestation","sign_citation":"https://pith.science/pith/KDB7N6IY6CZCCFINFADZR6D6S3/action/citation_signature","submit_replication":"https://pith.science/pith/KDB7N6IY6CZCCFINFADZR6D6S3/action/replication_record"}},"created_at":"2026-05-18T00:22:50.351704+00:00","updated_at":"2026-05-18T00:22:50.351704+00:00"}