{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ZCB3TJZG7TGIDUXFGCLGLXYH2X","short_pith_number":"pith:ZCB3TJZG","canonical_record":{"source":{"id":"1604.03887","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-13T17:49:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2ea0de4fd2aed846446b30be13f1f64745a2d592407affa8b21d33611a07d107","abstract_canon_sha256":"91385845e7a0a2020a2661b2847df1ba2e1be0eb9f1e23c760bfc7aec77b02ef"},"schema_version":"1.0"},"canonical_sha256":"c883b9a726fccc81d2e5309665df07d5fa6a5690e1f2361de963a55680f88d51","source":{"kind":"arxiv","id":"1604.03887","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03887","created_at":"2026-07-05T01:39:39Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03887v8","created_at":"2026-07-05T01:39:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03887","created_at":"2026-07-05T01:39:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZCB3TJZG7TGI","created_at":"2026-07-05T01:39:39Z"},{"alias_kind":"pith_short_16","alias_value":"ZCB3TJZG7TGIDUXF","created_at":"2026-07-05T01:39:39Z"},{"alias_kind":"pith_short_8","alias_value":"ZCB3TJZG","created_at":"2026-07-05T01:39:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ZCB3TJZG7TGIDUXFGCLGLXYH2X","target":"record","payload":{"canonical_record":{"source":{"id":"1604.03887","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-13T17:49:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"2ea0de4fd2aed846446b30be13f1f64745a2d592407affa8b21d33611a07d107","abstract_canon_sha256":"91385845e7a0a2020a2661b2847df1ba2e1be0eb9f1e23c760bfc7aec77b02ef"},"schema_version":"1.0"},"canonical_sha256":"c883b9a726fccc81d2e5309665df07d5fa6a5690e1f2361de963a55680f88d51","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:39:39.906142Z","signature_b64":"LyzXuiPpX79ZFkqAFENASsaqGU2pC/wOTqrx+GyKrErh796kAiPMvY3FufoEg6E5JpMrhQ/TCxjdH8MRY5xnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c883b9a726fccc81d2e5309665df07d5fa6a5690e1f2361de963a55680f88d51","last_reissued_at":"2026-07-05T01:39:39.905732Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:39:39.905732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.03887","source_version":8,"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-07-05T01:39:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GSZxpBmy8liN/ptlxY4crOd5l9eEJwwMra0PgZtoWZaTt1g58ontyuHfcvALcTnqtheNbbys0J12YDHu2jphCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:58:32.189780Z"},"content_sha256":"aec0064daa5ccab97a1053bd20b934c31eb6d653c12db0a6039d5c7c4b203071","schema_version":"1.0","event_id":"sha256:aec0064daa5ccab97a1053bd20b934c31eb6d653c12db0a6039d5c7c4b203071"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ZCB3TJZG7TGIDUXFGCLGLXYH2X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for stochastic optimization with functional or expectation constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Guanghui Lan, Zhiqiang Zhou","submitted_at":"2016-04-13T17:49:30Z","abstract_excerpt":"This paper considers the problem of minimizing an expectation function over a closed convex set, coupled with a {\\color{black} functional or expectation} constraint on either decision variables or problem parameters. We first present a new stochastic approximation (SA) type algorithm, namely the cooperative SA (CSA), to handle problems with the constraint on devision variables. We show that this algorithm exhibits the optimal ${\\cal O}(1/\\epsilon^2)$ rate of convergence, in terms of both optimality gap and constraint violation, when the objective and constraint functions are generally convex, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03887","kind":"arxiv","version":8},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1604.03887/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:39:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EXN27y1pdjxdF67mS1g4CVBwZDFF+ETNMc4Ti/iNplR8al98Vq8btZgSUEs5OgMzevo68TaF7y8hqTJ7LtvBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T05:58:32.190297Z"},"content_sha256":"75c9302c0ea1d2cb4256d06c4bf369ae97f564f01e23b369648cc4b3fa0c632a","schema_version":"1.0","event_id":"sha256:75c9302c0ea1d2cb4256d06c4bf369ae97f564f01e23b369648cc4b3fa0c632a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZCB3TJZG7TGIDUXFGCLGLXYH2X/bundle.json","state_url":"https://pith.science/pith/ZCB3TJZG7TGIDUXFGCLGLXYH2X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZCB3TJZG7TGIDUXFGCLGLXYH2X/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-08-15T05:58:32Z","links":{"resolver":"https://pith.science/pith/ZCB3TJZG7TGIDUXFGCLGLXYH2X","bundle":"https://pith.science/pith/ZCB3TJZG7TGIDUXFGCLGLXYH2X/bundle.json","state":"https://pith.science/pith/ZCB3TJZG7TGIDUXFGCLGLXYH2X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZCB3TJZG7TGIDUXFGCLGLXYH2X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ZCB3TJZG7TGIDUXFGCLGLXYH2X","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":"91385845e7a0a2020a2661b2847df1ba2e1be0eb9f1e23c760bfc7aec77b02ef","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-13T17:49:30Z","title_canon_sha256":"2ea0de4fd2aed846446b30be13f1f64745a2d592407affa8b21d33611a07d107"},"schema_version":"1.0","source":{"id":"1604.03887","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.03887","created_at":"2026-07-05T01:39:39Z"},{"alias_kind":"arxiv_version","alias_value":"1604.03887v8","created_at":"2026-07-05T01:39:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.03887","created_at":"2026-07-05T01:39:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZCB3TJZG7TGI","created_at":"2026-07-05T01:39:39Z"},{"alias_kind":"pith_short_16","alias_value":"ZCB3TJZG7TGIDUXF","created_at":"2026-07-05T01:39:39Z"},{"alias_kind":"pith_short_8","alias_value":"ZCB3TJZG","created_at":"2026-07-05T01:39:39Z"}],"graph_snapshots":[{"event_id":"sha256:75c9302c0ea1d2cb4256d06c4bf369ae97f564f01e23b369648cc4b3fa0c632a","target":"graph","created_at":"2026-07-05T01:39:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1604.03887/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper considers the problem of minimizing an expectation function over a closed convex set, coupled with a {\\color{black} functional or expectation} constraint on either decision variables or problem parameters. We first present a new stochastic approximation (SA) type algorithm, namely the cooperative SA (CSA), to handle problems with the constraint on devision variables. We show that this algorithm exhibits the optimal ${\\cal O}(1/\\epsilon^2)$ rate of convergence, in terms of both optimality gap and constraint violation, when the objective and constraint functions are generally convex, ","authors_text":"Guanghui Lan, Zhiqiang Zhou","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-13T17:49:30Z","title":"Algorithms for stochastic optimization with functional or expectation constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.03887","kind":"arxiv","version":8},"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:aec0064daa5ccab97a1053bd20b934c31eb6d653c12db0a6039d5c7c4b203071","target":"record","created_at":"2026-07-05T01:39:39Z","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":"91385845e7a0a2020a2661b2847df1ba2e1be0eb9f1e23c760bfc7aec77b02ef","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-13T17:49:30Z","title_canon_sha256":"2ea0de4fd2aed846446b30be13f1f64745a2d592407affa8b21d33611a07d107"},"schema_version":"1.0","source":{"id":"1604.03887","kind":"arxiv","version":8}},"canonical_sha256":"c883b9a726fccc81d2e5309665df07d5fa6a5690e1f2361de963a55680f88d51","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c883b9a726fccc81d2e5309665df07d5fa6a5690e1f2361de963a55680f88d51","first_computed_at":"2026-07-05T01:39:39.905732Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:39:39.905732Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LyzXuiPpX79ZFkqAFENASsaqGU2pC/wOTqrx+GyKrErh796kAiPMvY3FufoEg6E5JpMrhQ/TCxjdH8MRY5xnBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:39:39.906142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.03887","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aec0064daa5ccab97a1053bd20b934c31eb6d653c12db0a6039d5c7c4b203071","sha256:75c9302c0ea1d2cb4256d06c4bf369ae97f564f01e23b369648cc4b3fa0c632a"],"state_sha256":"7b82d49be83beb1bccc707f2d92c53647ecccc1fda5fea85cfb9f52c570f35a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"95PU9qgh1/6Xo5QINZ5eWuFjYUK286Ac9+/LEDaVtMWpeT7vlRRFr8wmMsazyKmbEMyPDkAFkaTv9KtfF6QNCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T05:58:32.194079Z","bundle_sha256":"7a35cc367206cd8f876e1415386dcc31c895bb5f22215904fb1806b65ffb1f8e"}}