{"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"}