{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SYZWKEWRC2NI55LQ3Y4RSSDRYV","short_pith_number":"pith:SYZWKEWR","canonical_record":{"source":{"id":"1705.02969","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-08T16:50:15Z","cross_cats_sorted":[],"title_canon_sha256":"46d7548802033da986e648defc6bb6877934d40d5f340528e314a3893e0976d3","abstract_canon_sha256":"f5303218db65e0319d54c6e146d4047efd5ee309ba1b5a3c4a350c1df93e8271"},"schema_version":"1.0"},"canonical_sha256":"96336512d1169a8ef570de39194871c55cc6dc69977addb050e295f7ff197585","source":{"kind":"arxiv","id":"1705.02969","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02969","created_at":"2026-05-18T00:43:43Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02969v4","created_at":"2026-05-18T00:43:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02969","created_at":"2026-05-18T00:43:43Z"},{"alias_kind":"pith_short_12","alias_value":"SYZWKEWRC2NI","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SYZWKEWRC2NI55LQ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SYZWKEWR","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SYZWKEWRC2NI55LQ3Y4RSSDRYV","target":"record","payload":{"canonical_record":{"source":{"id":"1705.02969","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-08T16:50:15Z","cross_cats_sorted":[],"title_canon_sha256":"46d7548802033da986e648defc6bb6877934d40d5f340528e314a3893e0976d3","abstract_canon_sha256":"f5303218db65e0319d54c6e146d4047efd5ee309ba1b5a3c4a350c1df93e8271"},"schema_version":"1.0"},"canonical_sha256":"96336512d1169a8ef570de39194871c55cc6dc69977addb050e295f7ff197585","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:43.097069Z","signature_b64":"S/V6KI+6BDx4D44sgw7lpM+bdo/wLe+18P7tkl+QAe3Ek8OBS1vJUi3NAlRlDBcsOMtU1ukZ0esrq5oVLpr3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96336512d1169a8ef570de39194871c55cc6dc69977addb050e295f7ff197585","last_reissued_at":"2026-05-18T00:43:43.096651Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:43.096651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.02969","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:43:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ajIyBlxgwBWd/KoulBT5HmsAabzHC1uSEdG3jbm3TQULxyVpZjSy1Pvnoswemx3ngARcyidOC58bdgab+aLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:01:49.890719Z"},"content_sha256":"c52eb464e58808897a44f9e5db2fa3279eefc6f827fb6a3b41126f02c35cff81","schema_version":"1.0","event_id":"sha256:c52eb464e58808897a44f9e5db2fa3279eefc6f827fb6a3b41126f02c35cff81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SYZWKEWRC2NI55LQ3Y4RSSDRYV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On variance reduction for stochastic smooth convex optimization with multiplicative noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alejandro Jofr\\'e, Philip Thompson","submitted_at":"2017-05-08T16:50:15Z","abstract_excerpt":"We propose dynamic sampled stochastic approximation (SA) methods for stochastic optimization with a heavy-tailed distribution (with finite 2nd moment). The objective is the sum of a smooth convex function with a convex regularizer. Typically, it is assumed an oracle with an upper bound $\\sigma^2$ on its variance (OUBV). Differently, we assume an oracle with \\emph{multiplicative noise}. This rarely addressed setup is more aggressive but realistic, where the variance may not be bounded. Our methods achieve optimal iteration complexity and (near) optimal oracle complexity. For the smooth convex c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02969","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:43:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sa2+Y1scc3p53f1YF8LGTXkH9kvgWtSW2QeqadBtGPp9UeTdg0C1KoQDVOLh7YaAggduMUynEvW8Lxhl6rgDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T05:01:49.891060Z"},"content_sha256":"a9be8811b65d85c9aee159fc9936e413ffce17132de7ae326d414446b6b8b5bd","schema_version":"1.0","event_id":"sha256:a9be8811b65d85c9aee159fc9936e413ffce17132de7ae326d414446b6b8b5bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SYZWKEWRC2NI55LQ3Y4RSSDRYV/bundle.json","state_url":"https://pith.science/pith/SYZWKEWRC2NI55LQ3Y4RSSDRYV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SYZWKEWRC2NI55LQ3Y4RSSDRYV/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-23T05:01:49Z","links":{"resolver":"https://pith.science/pith/SYZWKEWRC2NI55LQ3Y4RSSDRYV","bundle":"https://pith.science/pith/SYZWKEWRC2NI55LQ3Y4RSSDRYV/bundle.json","state":"https://pith.science/pith/SYZWKEWRC2NI55LQ3Y4RSSDRYV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SYZWKEWRC2NI55LQ3Y4RSSDRYV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SYZWKEWRC2NI55LQ3Y4RSSDRYV","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":"f5303218db65e0319d54c6e146d4047efd5ee309ba1b5a3c4a350c1df93e8271","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-08T16:50:15Z","title_canon_sha256":"46d7548802033da986e648defc6bb6877934d40d5f340528e314a3893e0976d3"},"schema_version":"1.0","source":{"id":"1705.02969","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.02969","created_at":"2026-05-18T00:43:43Z"},{"alias_kind":"arxiv_version","alias_value":"1705.02969v4","created_at":"2026-05-18T00:43:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02969","created_at":"2026-05-18T00:43:43Z"},{"alias_kind":"pith_short_12","alias_value":"SYZWKEWRC2NI","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SYZWKEWRC2NI55LQ","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SYZWKEWR","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:a9be8811b65d85c9aee159fc9936e413ffce17132de7ae326d414446b6b8b5bd","target":"graph","created_at":"2026-05-18T00:43:43Z","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 propose dynamic sampled stochastic approximation (SA) methods for stochastic optimization with a heavy-tailed distribution (with finite 2nd moment). The objective is the sum of a smooth convex function with a convex regularizer. Typically, it is assumed an oracle with an upper bound $\\sigma^2$ on its variance (OUBV). Differently, we assume an oracle with \\emph{multiplicative noise}. This rarely addressed setup is more aggressive but realistic, where the variance may not be bounded. Our methods achieve optimal iteration complexity and (near) optimal oracle complexity. For the smooth convex c","authors_text":"Alejandro Jofr\\'e, Philip Thompson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-08T16:50:15Z","title":"On variance reduction for stochastic smooth convex optimization with multiplicative noise"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02969","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:c52eb464e58808897a44f9e5db2fa3279eefc6f827fb6a3b41126f02c35cff81","target":"record","created_at":"2026-05-18T00:43:43Z","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":"f5303218db65e0319d54c6e146d4047efd5ee309ba1b5a3c4a350c1df93e8271","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-08T16:50:15Z","title_canon_sha256":"46d7548802033da986e648defc6bb6877934d40d5f340528e314a3893e0976d3"},"schema_version":"1.0","source":{"id":"1705.02969","kind":"arxiv","version":4}},"canonical_sha256":"96336512d1169a8ef570de39194871c55cc6dc69977addb050e295f7ff197585","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96336512d1169a8ef570de39194871c55cc6dc69977addb050e295f7ff197585","first_computed_at":"2026-05-18T00:43:43.096651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:43.096651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S/V6KI+6BDx4D44sgw7lpM+bdo/wLe+18P7tkl+QAe3Ek8OBS1vJUi3NAlRlDBcsOMtU1ukZ0esrq5oVLpr3BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:43.097069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.02969","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c52eb464e58808897a44f9e5db2fa3279eefc6f827fb6a3b41126f02c35cff81","sha256:a9be8811b65d85c9aee159fc9936e413ffce17132de7ae326d414446b6b8b5bd"],"state_sha256":"9a5ac16840f3045919312f5371b7a6eef63c62f256dac9838dfce84fd0a83c59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NBip3HZF6r5TNhW9Ka/gCmQV3ZPoNIYHtqeH0AUQUfQU42gr6GipTmJzGBUbqKhkI0oNa9aIndNifPWEnwokAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T05:01:49.892962Z","bundle_sha256":"080ef0c91d124f35f43340c8739d1a2c4150a6fdb9291e538c969e27e4ac04b2"}}