{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ON6OOD6LL5OT6TOAC6YP4HWTYO","short_pith_number":"pith:ON6OOD6L","canonical_record":{"source":{"id":"1711.07564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-20T21:58:01Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"3130b54d7365abee175be7a341684d3c91bcdfbcfab6b9a2a1132d66ce7a6c45","abstract_canon_sha256":"0e8e65d0905d6c96734b1888bf4d8f5b9d5063783955232260efc0f801bf5694"},"schema_version":"1.0"},"canonical_sha256":"737ce70fcb5f5d3f4dc017b0fe1ed3c3b2862916d39b23cc85c30ac90a50c48f","source":{"kind":"arxiv","id":"1711.07564","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07564","created_at":"2026-05-18T00:29:58Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07564v1","created_at":"2026-05-18T00:29:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07564","created_at":"2026-05-18T00:29:58Z"},{"alias_kind":"pith_short_12","alias_value":"ON6OOD6LL5OT","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"ON6OOD6LL5OT6TOA","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"ON6OOD6L","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ON6OOD6LL5OT6TOAC6YP4HWTYO","target":"record","payload":{"canonical_record":{"source":{"id":"1711.07564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-20T21:58:01Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"3130b54d7365abee175be7a341684d3c91bcdfbcfab6b9a2a1132d66ce7a6c45","abstract_canon_sha256":"0e8e65d0905d6c96734b1888bf4d8f5b9d5063783955232260efc0f801bf5694"},"schema_version":"1.0"},"canonical_sha256":"737ce70fcb5f5d3f4dc017b0fe1ed3c3b2862916d39b23cc85c30ac90a50c48f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:58.684415Z","signature_b64":"Se28zkIC/099wQUrHChcPi8xYgqQoUOoEnKI0Ru+4r/RSWmIkprkpCvoYfzZQXXlTnML4wR6zFpmnUFtwtguAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"737ce70fcb5f5d3f4dc017b0fe1ed3c3b2862916d39b23cc85c30ac90a50c48f","last_reissued_at":"2026-05-18T00:29:58.683827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:58.683827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.07564","source_version":1,"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:29:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvI28D+zT0Y0D4CKTncKDfYf8cNekDsIQz/3QYkPNbgkUqLy0A6IaF5WpgJZ6sbj1m56jFBYZGvFsuXjKKHLDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:30:44.768037Z"},"content_sha256":"45ecff3a36ac2db782f10f1e7293af560e372db888ffdd20d67ceab0584698d4","schema_version":"1.0","event_id":"sha256:45ecff3a36ac2db782f10f1e7293af560e372db888ffdd20d67ceab0584698d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ON6OOD6LL5OT6TOAC6YP4HWTYO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unbiased Simulation for Optimizing Stochastic Function Compositions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"math.OC","authors_text":"Chaoxu Zhou, Donald Goldfarb, Fengpei Li, Garud Iyengar, Jose Blanchet","submitted_at":"2017-11-20T21:58:01Z","abstract_excerpt":"In this paper, we introduce an unbiased gradient simulation algorithms for solving convex optimization problem with stochastic function compositions. We show that the unbiased gradient generated from the algorithm has finite variance and finite expected computation cost. We then combined the unbiased gradient simulation with two variance reduced algorithms (namely SVRG and SCSG) and showed that the proposed optimization algorithms based on unbiased gradient simulations exhibit satisfactory convergence properties. Specifically, in the SVRG case, the algorithm with simulated gradient can be show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07564","kind":"arxiv","version":1},"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:29:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OkMbD9uoWTh0KsxKG014SnXSpR47VLsKKm63icgoevl20wA6yAac/JZNv3q6eipCeunVwZzn7gmaHwqL7VsoCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:30:44.768752Z"},"content_sha256":"10706c12c2066381b55c4e9c351e5ad941a5d76f4acc02f901f97d286665c7d5","schema_version":"1.0","event_id":"sha256:10706c12c2066381b55c4e9c351e5ad941a5d76f4acc02f901f97d286665c7d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ON6OOD6LL5OT6TOAC6YP4HWTYO/bundle.json","state_url":"https://pith.science/pith/ON6OOD6LL5OT6TOAC6YP4HWTYO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ON6OOD6LL5OT6TOAC6YP4HWTYO/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-05-27T03:30:44Z","links":{"resolver":"https://pith.science/pith/ON6OOD6LL5OT6TOAC6YP4HWTYO","bundle":"https://pith.science/pith/ON6OOD6LL5OT6TOAC6YP4HWTYO/bundle.json","state":"https://pith.science/pith/ON6OOD6LL5OT6TOAC6YP4HWTYO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ON6OOD6LL5OT6TOAC6YP4HWTYO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ON6OOD6LL5OT6TOAC6YP4HWTYO","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":"0e8e65d0905d6c96734b1888bf4d8f5b9d5063783955232260efc0f801bf5694","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-20T21:58:01Z","title_canon_sha256":"3130b54d7365abee175be7a341684d3c91bcdfbcfab6b9a2a1132d66ce7a6c45"},"schema_version":"1.0","source":{"id":"1711.07564","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.07564","created_at":"2026-05-18T00:29:58Z"},{"alias_kind":"arxiv_version","alias_value":"1711.07564v1","created_at":"2026-05-18T00:29:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07564","created_at":"2026-05-18T00:29:58Z"},{"alias_kind":"pith_short_12","alias_value":"ON6OOD6LL5OT","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"ON6OOD6LL5OT6TOA","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"ON6OOD6L","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:10706c12c2066381b55c4e9c351e5ad941a5d76f4acc02f901f97d286665c7d5","target":"graph","created_at":"2026-05-18T00:29:58Z","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 introduce an unbiased gradient simulation algorithms for solving convex optimization problem with stochastic function compositions. We show that the unbiased gradient generated from the algorithm has finite variance and finite expected computation cost. We then combined the unbiased gradient simulation with two variance reduced algorithms (namely SVRG and SCSG) and showed that the proposed optimization algorithms based on unbiased gradient simulations exhibit satisfactory convergence properties. Specifically, in the SVRG case, the algorithm with simulated gradient can be show","authors_text":"Chaoxu Zhou, Donald Goldfarb, Fengpei Li, Garud Iyengar, Jose Blanchet","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-20T21:58:01Z","title":"Unbiased Simulation for Optimizing Stochastic Function Compositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07564","kind":"arxiv","version":1},"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:45ecff3a36ac2db782f10f1e7293af560e372db888ffdd20d67ceab0584698d4","target":"record","created_at":"2026-05-18T00:29:58Z","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":"0e8e65d0905d6c96734b1888bf4d8f5b9d5063783955232260efc0f801bf5694","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-11-20T21:58:01Z","title_canon_sha256":"3130b54d7365abee175be7a341684d3c91bcdfbcfab6b9a2a1132d66ce7a6c45"},"schema_version":"1.0","source":{"id":"1711.07564","kind":"arxiv","version":1}},"canonical_sha256":"737ce70fcb5f5d3f4dc017b0fe1ed3c3b2862916d39b23cc85c30ac90a50c48f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"737ce70fcb5f5d3f4dc017b0fe1ed3c3b2862916d39b23cc85c30ac90a50c48f","first_computed_at":"2026-05-18T00:29:58.683827Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:58.683827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Se28zkIC/099wQUrHChcPi8xYgqQoUOoEnKI0Ru+4r/RSWmIkprkpCvoYfzZQXXlTnML4wR6zFpmnUFtwtguAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:58.684415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.07564","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45ecff3a36ac2db782f10f1e7293af560e372db888ffdd20d67ceab0584698d4","sha256:10706c12c2066381b55c4e9c351e5ad941a5d76f4acc02f901f97d286665c7d5"],"state_sha256":"5f51dd0ba4e606dba8f8c28a9ba725b8c066a81c8916f5afc6fcf01eefd1bab9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YOl6XO/P06w4AlineI8hRQp6l6THTcd2tE0n0t+TM4pbY7KCDlpsnl0BrCcwbPQfTflE6nByFFywtCmgzESqDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:30:44.772598Z","bundle_sha256":"df5092582772c106a995b3ec19250cd726daee26fa10f7f7de46fd2360b8046b"}}