{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TALNBOLESXBMVCUYWZTMEE2RHE","short_pith_number":"pith:TALNBOLE","canonical_record":{"source":{"id":"1709.02091","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-07T06:48:29Z","cross_cats_sorted":[],"title_canon_sha256":"714cfa38c911bd371ec7f317c9298c2200b43f79be659ba54e1cafcc97f58793","abstract_canon_sha256":"0158c0bb0675b06b807e1bad1db9c236b995e282e5167d4f41a9cae8ccd63162"},"schema_version":"1.0"},"canonical_sha256":"9816d0b96495c2ca8a98b666c2135139318b0d243c74b291a1827ec410340a96","source":{"kind":"arxiv","id":"1709.02091","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02091","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02091v3","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02091","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"pith_short_12","alias_value":"TALNBOLESXBM","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"TALNBOLESXBMVCUY","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"TALNBOLE","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TALNBOLESXBMVCUYWZTMEE2RHE","target":"record","payload":{"canonical_record":{"source":{"id":"1709.02091","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-07T06:48:29Z","cross_cats_sorted":[],"title_canon_sha256":"714cfa38c911bd371ec7f317c9298c2200b43f79be659ba54e1cafcc97f58793","abstract_canon_sha256":"0158c0bb0675b06b807e1bad1db9c236b995e282e5167d4f41a9cae8ccd63162"},"schema_version":"1.0"},"canonical_sha256":"9816d0b96495c2ca8a98b666c2135139318b0d243c74b291a1827ec410340a96","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:30.382522Z","signature_b64":"yr5N07hb8EgCS6We7E4nHQo0r5822r1H3QUljwdol1+ppVPDEapx2eupdEQOw5Ery8wln7Uc744LbSfM5oNCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9816d0b96495c2ca8a98b666c2135139318b0d243c74b291a1827ec410340a96","last_reissued_at":"2026-05-18T00:35:30.382091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:30.382091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.02091","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:35:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ShhQOyBg2p7/ppHe5XmQkZpi/XDlYuYHIdgFNmzmh4bVEKt+DC8h6QNav79I86mLeWybburHp6dWN93GsR3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:07:57.715921Z"},"content_sha256":"1276c888b28d3b1f22b597fba5f836c56ae8ec2ee9b13a1b78255cc97be69aaa","schema_version":"1.0","event_id":"sha256:1276c888b28d3b1f22b597fba5f836c56ae8ec2ee9b13a1b78255cc97be69aaa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TALNBOLESXBMVCUYWZTMEE2RHE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous COMID: the theoretic basis for transmitted data sparsification tricks on Parameter Server","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Daning Cheng, Shigang Li, Yunquan Zhang","submitted_at":"2017-09-07T06:48:29Z","abstract_excerpt":"Asynchronous FTRL-proximal and L2 norm done at server are two widely used tricks in Parameters Server which is an implement of delayed SGD. Their commonness is leaving parts of updating computation on server which reduces the burden of network via making transmitted data sparse. But above tricks' convergences are not well-proved. In this paper, based on above commonness, we propose a more general algorithm named as asynchronous COMID and prove its convergence. We prove that asynchronous FTRL-proximal and L2 norm done at server are applications of asynchronous COMID, which demonstrates the conv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02091","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:35:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZRi8CfvnHK/CWWEZX8KVGbWSqsXBncF+qGkJtPKKVW9e9gcr6TVW72rC9GkKIXBzGLyK++Zf9PjKnZf3wQV4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:07:57.716331Z"},"content_sha256":"348034602af788cabbd7bb33e45642a2f94b10f286d9da16c979f2fa3af0071c","schema_version":"1.0","event_id":"sha256:348034602af788cabbd7bb33e45642a2f94b10f286d9da16c979f2fa3af0071c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TALNBOLESXBMVCUYWZTMEE2RHE/bundle.json","state_url":"https://pith.science/pith/TALNBOLESXBMVCUYWZTMEE2RHE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TALNBOLESXBMVCUYWZTMEE2RHE/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-01T01:07:57Z","links":{"resolver":"https://pith.science/pith/TALNBOLESXBMVCUYWZTMEE2RHE","bundle":"https://pith.science/pith/TALNBOLESXBMVCUYWZTMEE2RHE/bundle.json","state":"https://pith.science/pith/TALNBOLESXBMVCUYWZTMEE2RHE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TALNBOLESXBMVCUYWZTMEE2RHE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TALNBOLESXBMVCUYWZTMEE2RHE","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":"0158c0bb0675b06b807e1bad1db9c236b995e282e5167d4f41a9cae8ccd63162","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-07T06:48:29Z","title_canon_sha256":"714cfa38c911bd371ec7f317c9298c2200b43f79be659ba54e1cafcc97f58793"},"schema_version":"1.0","source":{"id":"1709.02091","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.02091","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"arxiv_version","alias_value":"1709.02091v3","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.02091","created_at":"2026-05-18T00:35:30Z"},{"alias_kind":"pith_short_12","alias_value":"TALNBOLESXBM","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"TALNBOLESXBMVCUY","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"TALNBOLE","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:348034602af788cabbd7bb33e45642a2f94b10f286d9da16c979f2fa3af0071c","target":"graph","created_at":"2026-05-18T00:35:30Z","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":"Asynchronous FTRL-proximal and L2 norm done at server are two widely used tricks in Parameters Server which is an implement of delayed SGD. Their commonness is leaving parts of updating computation on server which reduces the burden of network via making transmitted data sparse. But above tricks' convergences are not well-proved. In this paper, based on above commonness, we propose a more general algorithm named as asynchronous COMID and prove its convergence. We prove that asynchronous FTRL-proximal and L2 norm done at server are applications of asynchronous COMID, which demonstrates the conv","authors_text":"Daning Cheng, Shigang Li, Yunquan Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-07T06:48:29Z","title":"Asynchronous COMID: the theoretic basis for transmitted data sparsification tricks on Parameter Server"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02091","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:1276c888b28d3b1f22b597fba5f836c56ae8ec2ee9b13a1b78255cc97be69aaa","target":"record","created_at":"2026-05-18T00:35:30Z","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":"0158c0bb0675b06b807e1bad1db9c236b995e282e5167d4f41a9cae8ccd63162","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-09-07T06:48:29Z","title_canon_sha256":"714cfa38c911bd371ec7f317c9298c2200b43f79be659ba54e1cafcc97f58793"},"schema_version":"1.0","source":{"id":"1709.02091","kind":"arxiv","version":3}},"canonical_sha256":"9816d0b96495c2ca8a98b666c2135139318b0d243c74b291a1827ec410340a96","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9816d0b96495c2ca8a98b666c2135139318b0d243c74b291a1827ec410340a96","first_computed_at":"2026-05-18T00:35:30.382091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:35:30.382091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yr5N07hb8EgCS6We7E4nHQo0r5822r1H3QUljwdol1+ppVPDEapx2eupdEQOw5Ery8wln7Uc744LbSfM5oNCBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:35:30.382522Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.02091","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1276c888b28d3b1f22b597fba5f836c56ae8ec2ee9b13a1b78255cc97be69aaa","sha256:348034602af788cabbd7bb33e45642a2f94b10f286d9da16c979f2fa3af0071c"],"state_sha256":"13970ef6c5d85acc59d838d091073d04981115ed6a3211832313b3448c138f82"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0gPI8HCAFKg4S62YYxxGotz2IuADmjP5JWOR2nV2+dnngPx71eqvxtC2wiBYzR+Q+zppsTvAOrx0DuCeOQRtAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:07:57.718259Z","bundle_sha256":"ad8a8d547b0213f6e7468b01fe37de47743137241bf61ad39b2ab040f101e1a7"}}