{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FUS5XC5ETGCHPCJUJFON44DSEU","short_pith_number":"pith:FUS5XC5E","canonical_record":{"source":{"id":"1609.03261","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-12T03:35:29Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"98db2a163eab49926a6a0635bb035aa0655235da958381b3d6c40375de93aeef","abstract_canon_sha256":"787f2474f3b0c7b7f5fd44770549498025690d1eeab73b51293859f6b2cd09ab"},"schema_version":"1.0"},"canonical_sha256":"2d25db8ba49984778934495cde70722524f271ec1c99e472ae2c3d850f0432bd","source":{"kind":"arxiv","id":"1609.03261","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03261","created_at":"2026-05-17T23:46:06Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03261v3","created_at":"2026-05-17T23:46:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03261","created_at":"2026-05-17T23:46:06Z"},{"alias_kind":"pith_short_12","alias_value":"FUS5XC5ETGCH","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FUS5XC5ETGCHPCJU","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FUS5XC5E","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FUS5XC5ETGCHPCJUJFON44DSEU","target":"record","payload":{"canonical_record":{"source":{"id":"1609.03261","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-12T03:35:29Z","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"title_canon_sha256":"98db2a163eab49926a6a0635bb035aa0655235da958381b3d6c40375de93aeef","abstract_canon_sha256":"787f2474f3b0c7b7f5fd44770549498025690d1eeab73b51293859f6b2cd09ab"},"schema_version":"1.0"},"canonical_sha256":"2d25db8ba49984778934495cde70722524f271ec1c99e472ae2c3d850f0432bd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:06.730098Z","signature_b64":"j8ScQBDXWho00rFlEo7Pb1bi1Qv3S5103qnatZQRV5WxkvTE96qWA0/7MjCrkbgrXdzTXDLIyL5Cyc74YN94Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d25db8ba49984778934495cde70722524f271ec1c99e472ae2c3d850f0432bd","last_reissued_at":"2026-05-17T23:46:06.729575Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:06.729575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.03261","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-17T23:46:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TiLvVE/0gcEF7KFoPMLL7amnNnBkb/AvIH54UaUEk7dsN90NjvJcU83L4EcfUOkhhJ8jdRJ9uH1fTVzsMnobBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:25:55.478951Z"},"content_sha256":"fef6c57bf81ac19e39920af6fcb7e71d6fd40a3165ed58b9b7048dd41211b220","schema_version":"1.0","event_id":"sha256:fef6c57bf81ac19e39920af6fcb7e71d6fd40a3165ed58b9b7048dd41211b220"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FUS5XC5ETGCHPCJUJFON44DSEU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Less than a Single Pass: Stochastically Controlled Stochastic Gradient Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Lihua Lei, Michael I. Jordan","submitted_at":"2016-09-12T03:35:29Z","abstract_excerpt":"We develop and analyze a procedure for gradient-based optimization that we refer to as stochastically controlled stochastic gradient (SCSG). As a member of the SVRG family of algorithms, SCSG makes use of gradient estimates at two scales, with the number of updates at the faster scale being governed by a geometric random variable. Unlike most existing algorithms in this family, both the computation cost and the communication cost of SCSG do not necessarily scale linearly with the sample size $n$; indeed, these costs are independent of $n$ when the target accuracy is low. An experimental evalua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03261","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-17T23:46:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CunXX2v9NPcI9Tia+6iBPLvkTu/JU2jNW8z8brK+ORJZtbm6TrGBx85ADXPdujVogNLXcaB9YVwJLymTb+7uCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:25:55.479308Z"},"content_sha256":"966eeba7378a5033139aa86666f412e38390c7734ad7120fec6033bc7666b5d7","schema_version":"1.0","event_id":"sha256:966eeba7378a5033139aa86666f412e38390c7734ad7120fec6033bc7666b5d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FUS5XC5ETGCHPCJUJFON44DSEU/bundle.json","state_url":"https://pith.science/pith/FUS5XC5ETGCHPCJUJFON44DSEU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FUS5XC5ETGCHPCJUJFON44DSEU/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-02T01:25:55Z","links":{"resolver":"https://pith.science/pith/FUS5XC5ETGCHPCJUJFON44DSEU","bundle":"https://pith.science/pith/FUS5XC5ETGCHPCJUJFON44DSEU/bundle.json","state":"https://pith.science/pith/FUS5XC5ETGCHPCJUJFON44DSEU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FUS5XC5ETGCHPCJUJFON44DSEU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FUS5XC5ETGCHPCJUJFON44DSEU","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":"787f2474f3b0c7b7f5fd44770549498025690d1eeab73b51293859f6b2cd09ab","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-12T03:35:29Z","title_canon_sha256":"98db2a163eab49926a6a0635bb035aa0655235da958381b3d6c40375de93aeef"},"schema_version":"1.0","source":{"id":"1609.03261","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03261","created_at":"2026-05-17T23:46:06Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03261v3","created_at":"2026-05-17T23:46:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03261","created_at":"2026-05-17T23:46:06Z"},{"alias_kind":"pith_short_12","alias_value":"FUS5XC5ETGCH","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FUS5XC5ETGCHPCJU","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FUS5XC5E","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:966eeba7378a5033139aa86666f412e38390c7734ad7120fec6033bc7666b5d7","target":"graph","created_at":"2026-05-17T23:46:06Z","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":"We develop and analyze a procedure for gradient-based optimization that we refer to as stochastically controlled stochastic gradient (SCSG). As a member of the SVRG family of algorithms, SCSG makes use of gradient estimates at two scales, with the number of updates at the faster scale being governed by a geometric random variable. Unlike most existing algorithms in this family, both the computation cost and the communication cost of SCSG do not necessarily scale linearly with the sample size $n$; indeed, these costs are independent of $n$ when the target accuracy is low. An experimental evalua","authors_text":"Lihua Lei, Michael I. Jordan","cross_cats":["cs.DS","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-12T03:35:29Z","title":"Less than a Single Pass: Stochastically Controlled Stochastic Gradient Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03261","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:fef6c57bf81ac19e39920af6fcb7e71d6fd40a3165ed58b9b7048dd41211b220","target":"record","created_at":"2026-05-17T23:46:06Z","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":"787f2474f3b0c7b7f5fd44770549498025690d1eeab73b51293859f6b2cd09ab","cross_cats_sorted":["cs.DS","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-12T03:35:29Z","title_canon_sha256":"98db2a163eab49926a6a0635bb035aa0655235da958381b3d6c40375de93aeef"},"schema_version":"1.0","source":{"id":"1609.03261","kind":"arxiv","version":3}},"canonical_sha256":"2d25db8ba49984778934495cde70722524f271ec1c99e472ae2c3d850f0432bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d25db8ba49984778934495cde70722524f271ec1c99e472ae2c3d850f0432bd","first_computed_at":"2026-05-17T23:46:06.729575Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:06.729575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j8ScQBDXWho00rFlEo7Pb1bi1Qv3S5103qnatZQRV5WxkvTE96qWA0/7MjCrkbgrXdzTXDLIyL5Cyc74YN94Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:06.730098Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03261","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fef6c57bf81ac19e39920af6fcb7e71d6fd40a3165ed58b9b7048dd41211b220","sha256:966eeba7378a5033139aa86666f412e38390c7734ad7120fec6033bc7666b5d7"],"state_sha256":"21332fe404b3ba3976c9e800b3748a67e87e1d46b75c9d8a5af7bf454c788168"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y6I9/AOMU7tqBpacvDYCHlhH3mRY5XNqAJZivhn1AyMqzR0ZiPX6cInNKsUal+BjqSSIU75SzFMwTei43OIpBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:25:55.482247Z","bundle_sha256":"b8cb07cfba6ec4175a10746a35ea204a64ac8a3ce1e02bcc7abd2221bf2d7358"}}