{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ROIKUZIPKDY2W5HT3HR3SWQDXY","short_pith_number":"pith:ROIKUZIP","canonical_record":{"source":{"id":"1609.06804","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-22T02:50:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"3ea0dc7c1d9c32ccd76527e5cf99b794ba738b34f93b4d57614d035b30fd596d","abstract_canon_sha256":"5857900924c95579a341dc4b9af4cf29fc13e15147c51bc1da3a6f193ff405a2"},"schema_version":"1.0"},"canonical_sha256":"8b90aa650f50f1ab74f3d9e3b95a03be139c63bd3b535800b8e71567292b485c","source":{"kind":"arxiv","id":"1609.06804","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06804","created_at":"2026-05-18T01:03:40Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06804v2","created_at":"2026-05-18T01:03:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06804","created_at":"2026-05-18T01:03:40Z"},{"alias_kind":"pith_short_12","alias_value":"ROIKUZIPKDY2","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"ROIKUZIPKDY2W5HT","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"ROIKUZIP","created_at":"2026-05-18T12:30:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ROIKUZIPKDY2W5HT3HR3SWQDXY","target":"record","payload":{"canonical_record":{"source":{"id":"1609.06804","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-22T02:50:09Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"3ea0dc7c1d9c32ccd76527e5cf99b794ba738b34f93b4d57614d035b30fd596d","abstract_canon_sha256":"5857900924c95579a341dc4b9af4cf29fc13e15147c51bc1da3a6f193ff405a2"},"schema_version":"1.0"},"canonical_sha256":"8b90aa650f50f1ab74f3d9e3b95a03be139c63bd3b535800b8e71567292b485c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:40.370049Z","signature_b64":"+VSQpu198QryKxyr7PO5LVMSmx46bVRoDuyC8dgfsGejcwO2cO3b4xoQdtWXVCUW3V7C047jgIy8zsQizG7ICw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b90aa650f50f1ab74f3d9e3b95a03be139c63bd3b535800b8e71567292b485c","last_reissued_at":"2026-05-18T01:03:40.369536Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:40.369536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.06804","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-18T01:03:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"37Eb0dYBIdOZMTtdD6jcYIo+MkazN5z8NUxsywgwhDc9EkzvEIStnG+zKFaDq7nP2kiV/OToMS0+kK2SHZSSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:57:17.794656Z"},"content_sha256":"21da88b89e0f0a9186db911deafba4748907c04f1c5d11d3c39272517b602178","schema_version":"1.0","event_id":"sha256:21da88b89e0f0a9186db911deafba4748907c04f1c5d11d3c39272517b602178"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ROIKUZIPKDY2W5HT3HR3SWQDXY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decoupled Asynchronous Proximal Stochastic Gradient Descent with Variance Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Bin Gu, Heng Huang, Zhouyuan Huo","submitted_at":"2016-09-22T02:50:09Z","abstract_excerpt":"In the era of big data, optimizing large scale machine learning problems becomes a challenging task and draws significant attention. Asynchronous optimization algorithms come out as a promising solution. Recently, decoupled asynchronous proximal stochastic gradient descent (DAP-SGD) is proposed to minimize a composite function. It is claimed to be able to off-loads the computation bottleneck from server to workers by allowing workers to evaluate the proximal operators, therefore, server just need to do element-wise operations. However, it still suffers from slow convergence rate because of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06804","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-18T01:03:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IM68LgrB1LE4PMu3dsM2bOLJrsOk1tNdWlKtIva4wB8tduzXkGqCCPz5kRfzWILV5XZzBkWy6j4ERDZhB4n4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T17:57:17.795076Z"},"content_sha256":"dd26181749481e4fdde3a2ba19fa5c0f89c78d19d503aaaaefe5ec0619467988","schema_version":"1.0","event_id":"sha256:dd26181749481e4fdde3a2ba19fa5c0f89c78d19d503aaaaefe5ec0619467988"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROIKUZIPKDY2W5HT3HR3SWQDXY/bundle.json","state_url":"https://pith.science/pith/ROIKUZIPKDY2W5HT3HR3SWQDXY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROIKUZIPKDY2W5HT3HR3SWQDXY/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-04T17:57:17Z","links":{"resolver":"https://pith.science/pith/ROIKUZIPKDY2W5HT3HR3SWQDXY","bundle":"https://pith.science/pith/ROIKUZIPKDY2W5HT3HR3SWQDXY/bundle.json","state":"https://pith.science/pith/ROIKUZIPKDY2W5HT3HR3SWQDXY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROIKUZIPKDY2W5HT3HR3SWQDXY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ROIKUZIPKDY2W5HT3HR3SWQDXY","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":"5857900924c95579a341dc4b9af4cf29fc13e15147c51bc1da3a6f193ff405a2","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-22T02:50:09Z","title_canon_sha256":"3ea0dc7c1d9c32ccd76527e5cf99b794ba738b34f93b4d57614d035b30fd596d"},"schema_version":"1.0","source":{"id":"1609.06804","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.06804","created_at":"2026-05-18T01:03:40Z"},{"alias_kind":"arxiv_version","alias_value":"1609.06804v2","created_at":"2026-05-18T01:03:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06804","created_at":"2026-05-18T01:03:40Z"},{"alias_kind":"pith_short_12","alias_value":"ROIKUZIPKDY2","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"ROIKUZIPKDY2W5HT","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"ROIKUZIP","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:dd26181749481e4fdde3a2ba19fa5c0f89c78d19d503aaaaefe5ec0619467988","target":"graph","created_at":"2026-05-18T01:03:40Z","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 the era of big data, optimizing large scale machine learning problems becomes a challenging task and draws significant attention. Asynchronous optimization algorithms come out as a promising solution. Recently, decoupled asynchronous proximal stochastic gradient descent (DAP-SGD) is proposed to minimize a composite function. It is claimed to be able to off-loads the computation bottleneck from server to workers by allowing workers to evaluate the proximal operators, therefore, server just need to do element-wise operations. However, it still suffers from slow convergence rate because of the","authors_text":"Bin Gu, Heng Huang, Zhouyuan Huo","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-22T02:50:09Z","title":"Decoupled Asynchronous Proximal Stochastic Gradient Descent with Variance Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06804","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:21da88b89e0f0a9186db911deafba4748907c04f1c5d11d3c39272517b602178","target":"record","created_at":"2026-05-18T01:03:40Z","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":"5857900924c95579a341dc4b9af4cf29fc13e15147c51bc1da3a6f193ff405a2","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-22T02:50:09Z","title_canon_sha256":"3ea0dc7c1d9c32ccd76527e5cf99b794ba738b34f93b4d57614d035b30fd596d"},"schema_version":"1.0","source":{"id":"1609.06804","kind":"arxiv","version":2}},"canonical_sha256":"8b90aa650f50f1ab74f3d9e3b95a03be139c63bd3b535800b8e71567292b485c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8b90aa650f50f1ab74f3d9e3b95a03be139c63bd3b535800b8e71567292b485c","first_computed_at":"2026-05-18T01:03:40.369536Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:40.369536Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+VSQpu198QryKxyr7PO5LVMSmx46bVRoDuyC8dgfsGejcwO2cO3b4xoQdtWXVCUW3V7C047jgIy8zsQizG7ICw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:40.370049Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.06804","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:21da88b89e0f0a9186db911deafba4748907c04f1c5d11d3c39272517b602178","sha256:dd26181749481e4fdde3a2ba19fa5c0f89c78d19d503aaaaefe5ec0619467988"],"state_sha256":"887778152dca8682e66cad8959f3d0193bb2a4e543827dca5a9b70cb38e26b9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s913Y7YSoBNhAOGWNDqmljua0+sOqtMvvBmFgx56N8bNraiWr6HvwZyCvKzz43YyJ3l0zLcSTtKWvGqfgfp6Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T17:57:17.797698Z","bundle_sha256":"5fb08f4242e8ff04b530a6ea9555e62a1335929048b387d4e40ede4718078ddb"}}