{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZSG4T3OP3OJDU62G63CINZMSND","short_pith_number":"pith:ZSG4T3OP","canonical_record":{"source":{"id":"1703.00439","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-01T18:49:35Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"78152b9ceb3b343fba04e21f236d9ee498fc49dc0cebb3c6295afc49ef9d2505","abstract_canon_sha256":"7b3b129a3a43e900e59f145b847a3659b4d102c7c811e9e5817296fac4351855"},"schema_version":"1.0"},"canonical_sha256":"cc8dc9edcfdb923a7b46f6c486e59268e0265d6e2b8c34cdfa714dcf02eef571","source":{"kind":"arxiv","id":"1703.00439","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00439","created_at":"2026-05-18T00:34:57Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00439v4","created_at":"2026-05-18T00:34:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00439","created_at":"2026-05-18T00:34:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZSG4T3OP3OJD","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZSG4T3OP3OJDU62G","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZSG4T3OP","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZSG4T3OP3OJDU62G63CINZMSND","target":"record","payload":{"canonical_record":{"source":{"id":"1703.00439","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-01T18:49:35Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"78152b9ceb3b343fba04e21f236d9ee498fc49dc0cebb3c6295afc49ef9d2505","abstract_canon_sha256":"7b3b129a3a43e900e59f145b847a3659b4d102c7c811e9e5817296fac4351855"},"schema_version":"1.0"},"canonical_sha256":"cc8dc9edcfdb923a7b46f6c486e59268e0265d6e2b8c34cdfa714dcf02eef571","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:57.474693Z","signature_b64":"OHMBU7YBhd11t9OCrzC8hfeDFO6Js1wxY689UdUGkQRwc+QX82U1dBy28yV2mmQmrsYTQYrUtGTbcIlw+e/uBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc8dc9edcfdb923a7b46f6c486e59268e0265d6e2b8c34cdfa714dcf02eef571","last_reissued_at":"2026-05-18T00:34:57.473913Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:57.473913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.00439","source_version":4,"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:34:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+XCNPuA+vtZI0qNMhOr2dPnUyCiSGSLyuqw/6BgH7dsN1fGDrc//mThXn0nAPzOPhhHPQ72ZXr7JsPqFtQlSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:49:43.882932Z"},"content_sha256":"38278f37a10647e017f41e0d7755798e96c45d3749ab3f0706f4a45c3a71036b","schema_version":"1.0","event_id":"sha256:38278f37a10647e017f41e0d7755798e96c45d3749ab3f0706f4a45c3a71036b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZSG4T3OP3OJDU62G63CINZMSND","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Doubly Accelerated Stochastic Variance Reduced Dual Averaging Method for Regularized Empirical Risk Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Taiji Suzuki, Tomoya Murata","submitted_at":"2017-03-01T18:49:35Z","abstract_excerpt":"In this paper, we develop a new accelerated stochastic gradient method for efficiently solving the convex regularized empirical risk minimization problem in mini-batch settings. The use of mini-batches is becoming a golden standard in the machine learning community, because mini-batch settings stabilize the gradient estimate and can easily make good use of parallel computing. The core of our proposed method is the incorporation of our new \"double acceleration\" technique and variance reduction technique. We theoretically analyze our proposed method and show that our method much improves the min"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00439","kind":"arxiv","version":4},"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:34:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W88x/f5CcMipm6ctv0Dndh9QbZ4YGA/G670wnio5+6FFb91/tB+ipn33WWRDZBZ2sQcuk2228Kocz5J0ZVDbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:49:43.883277Z"},"content_sha256":"901a270d7cf3ccbb1c87ad3aafca7885bdd34241b968fb77ff12cf9d8e19fa6f","schema_version":"1.0","event_id":"sha256:901a270d7cf3ccbb1c87ad3aafca7885bdd34241b968fb77ff12cf9d8e19fa6f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSG4T3OP3OJDU62G63CINZMSND/bundle.json","state_url":"https://pith.science/pith/ZSG4T3OP3OJDU62G63CINZMSND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSG4T3OP3OJDU62G63CINZMSND/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-27T13:49:43Z","links":{"resolver":"https://pith.science/pith/ZSG4T3OP3OJDU62G63CINZMSND","bundle":"https://pith.science/pith/ZSG4T3OP3OJDU62G63CINZMSND/bundle.json","state":"https://pith.science/pith/ZSG4T3OP3OJDU62G63CINZMSND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSG4T3OP3OJDU62G63CINZMSND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZSG4T3OP3OJDU62G63CINZMSND","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":"7b3b129a3a43e900e59f145b847a3659b4d102c7c811e9e5817296fac4351855","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-01T18:49:35Z","title_canon_sha256":"78152b9ceb3b343fba04e21f236d9ee498fc49dc0cebb3c6295afc49ef9d2505"},"schema_version":"1.0","source":{"id":"1703.00439","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.00439","created_at":"2026-05-18T00:34:57Z"},{"alias_kind":"arxiv_version","alias_value":"1703.00439v4","created_at":"2026-05-18T00:34:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00439","created_at":"2026-05-18T00:34:57Z"},{"alias_kind":"pith_short_12","alias_value":"ZSG4T3OP3OJD","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZSG4T3OP3OJDU62G","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZSG4T3OP","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:901a270d7cf3ccbb1c87ad3aafca7885bdd34241b968fb77ff12cf9d8e19fa6f","target":"graph","created_at":"2026-05-18T00:34:57Z","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 develop a new accelerated stochastic gradient method for efficiently solving the convex regularized empirical risk minimization problem in mini-batch settings. The use of mini-batches is becoming a golden standard in the machine learning community, because mini-batch settings stabilize the gradient estimate and can easily make good use of parallel computing. The core of our proposed method is the incorporation of our new \"double acceleration\" technique and variance reduction technique. We theoretically analyze our proposed method and show that our method much improves the min","authors_text":"Taiji Suzuki, Tomoya Murata","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-01T18:49:35Z","title":"Doubly Accelerated Stochastic Variance Reduced Dual Averaging Method for Regularized Empirical Risk Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00439","kind":"arxiv","version":4},"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:38278f37a10647e017f41e0d7755798e96c45d3749ab3f0706f4a45c3a71036b","target":"record","created_at":"2026-05-18T00:34:57Z","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":"7b3b129a3a43e900e59f145b847a3659b4d102c7c811e9e5817296fac4351855","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-01T18:49:35Z","title_canon_sha256":"78152b9ceb3b343fba04e21f236d9ee498fc49dc0cebb3c6295afc49ef9d2505"},"schema_version":"1.0","source":{"id":"1703.00439","kind":"arxiv","version":4}},"canonical_sha256":"cc8dc9edcfdb923a7b46f6c486e59268e0265d6e2b8c34cdfa714dcf02eef571","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc8dc9edcfdb923a7b46f6c486e59268e0265d6e2b8c34cdfa714dcf02eef571","first_computed_at":"2026-05-18T00:34:57.473913Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:57.473913Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OHMBU7YBhd11t9OCrzC8hfeDFO6Js1wxY689UdUGkQRwc+QX82U1dBy28yV2mmQmrsYTQYrUtGTbcIlw+e/uBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:57.474693Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.00439","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:38278f37a10647e017f41e0d7755798e96c45d3749ab3f0706f4a45c3a71036b","sha256:901a270d7cf3ccbb1c87ad3aafca7885bdd34241b968fb77ff12cf9d8e19fa6f"],"state_sha256":"0d3f1d36335b0dc36bdecbd66f2868008af434942ab8668962bd5c84c90e7e28"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZFB69y/pzOseSP1A2Zo/mGSmYllADiEq/LaxBuA/r85r3a6F+CV+q2nlp3rrjCHGLDnJxCkxP9ps9+y2ki9BAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T13:49:43.885252Z","bundle_sha256":"2c935b9f4e75bfb710dbdaaaff1bcfb106b2f1c0a0013ff8193def3e2589b396"}}