{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:57CZJT7P5VKNSQ7HPKGWXYIAES","short_pith_number":"pith:57CZJT7P","canonical_record":{"source":{"id":"1610.08195","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-26T06:32:22Z","cross_cats_sorted":[],"title_canon_sha256":"0affecbc5d5338c3c9a4aa435d9f91a7243afe651b87a702e895b6127ad671d1","abstract_canon_sha256":"b4ed8bfa8be4b8194b4f297e29885d9cbfc2411d42aa7ab82cc12367d0f2e70c"},"schema_version":"1.0"},"canonical_sha256":"efc594cfefed54d943e77a8d6be10024b0cd06bf466408cedffbafc691302352","source":{"kind":"arxiv","id":"1610.08195","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08195","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08195v3","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08195","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"57CZJT7P5VKN","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"57CZJT7P5VKNSQ7H","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"57CZJT7P","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:57CZJT7P5VKNSQ7HPKGWXYIAES","target":"record","payload":{"canonical_record":{"source":{"id":"1610.08195","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-26T06:32:22Z","cross_cats_sorted":[],"title_canon_sha256":"0affecbc5d5338c3c9a4aa435d9f91a7243afe651b87a702e895b6127ad671d1","abstract_canon_sha256":"b4ed8bfa8be4b8194b4f297e29885d9cbfc2411d42aa7ab82cc12367d0f2e70c"},"schema_version":"1.0"},"canonical_sha256":"efc594cfefed54d943e77a8d6be10024b0cd06bf466408cedffbafc691302352","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:08.613332Z","signature_b64":"KjCVcsyQDhqF08kBypl7WWtOWWEh5KVUpVrOshA+VjDJrIrqfeHb+yT2MmV05TzfF4Iy+3Jov8FCboIazofIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efc594cfefed54d943e77a8d6be10024b0cd06bf466408cedffbafc691302352","last_reissued_at":"2026-05-18T00:26:08.612738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:08.612738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.08195","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-18T00:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hq94WiTee8blmsCugcL4UerZxOpMQ5csh11rDgauxA3K85NBSxJG+VUdq+kyMef6pQrXghwUqL8lydyp6U+jAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:20:52.559729Z"},"content_sha256":"fa8521e2a2a402be8d0120a1371819f48b1763a695acdeaa60adbc3b3e8b2ebf","schema_version":"1.0","event_id":"sha256:fa8521e2a2a402be8d0120a1371819f48b1763a695acdeaa60adbc3b3e8b2ebf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:57CZJT7P5VKNSQ7HPKGWXYIAES","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angelia Nedich, Farzad Yousefian, Uday V. Shanbhag","submitted_at":"2016-10-26T06:32:22Z","abstract_excerpt":"Motivated by multi-user optimization problems and non-cooperative Nash games in uncertain regimes, we consider stochastic Cartesian variational inequalities (SCVI) where the set is given as the Cartesian product of a collection of component sets. First, we consider the case where the number of the component sets is large. For solving this type of problems, the classical stochastic approximation methods and their prox generalizations are computationally inefficient as each iteration becomes very costly. To address this challenge, we develop a randomized block stochastic mirror-prox (B-SMP) algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08195","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-18T00:26:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z+Vg8DTSBiSmAeiX16F7qGptB4Ww/A6Q/5KxhfaUyXp/XwDC74BjNwFnznyOKOxKoCuoTXz7ooJOxNzaUPYOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T09:20:52.560087Z"},"content_sha256":"5974a73d79b3490dd4927d6846dd841263969243c1350dfd32399adf49e89c01","schema_version":"1.0","event_id":"sha256:5974a73d79b3490dd4927d6846dd841263969243c1350dfd32399adf49e89c01"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57CZJT7P5VKNSQ7HPKGWXYIAES/bundle.json","state_url":"https://pith.science/pith/57CZJT7P5VKNSQ7HPKGWXYIAES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57CZJT7P5VKNSQ7HPKGWXYIAES/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-12T09:20:52Z","links":{"resolver":"https://pith.science/pith/57CZJT7P5VKNSQ7HPKGWXYIAES","bundle":"https://pith.science/pith/57CZJT7P5VKNSQ7HPKGWXYIAES/bundle.json","state":"https://pith.science/pith/57CZJT7P5VKNSQ7HPKGWXYIAES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57CZJT7P5VKNSQ7HPKGWXYIAES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:57CZJT7P5VKNSQ7HPKGWXYIAES","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":"b4ed8bfa8be4b8194b4f297e29885d9cbfc2411d42aa7ab82cc12367d0f2e70c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-26T06:32:22Z","title_canon_sha256":"0affecbc5d5338c3c9a4aa435d9f91a7243afe651b87a702e895b6127ad671d1"},"schema_version":"1.0","source":{"id":"1610.08195","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.08195","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"arxiv_version","alias_value":"1610.08195v3","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.08195","created_at":"2026-05-18T00:26:08Z"},{"alias_kind":"pith_short_12","alias_value":"57CZJT7P5VKN","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"57CZJT7P5VKNSQ7H","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"57CZJT7P","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:5974a73d79b3490dd4927d6846dd841263969243c1350dfd32399adf49e89c01","target":"graph","created_at":"2026-05-18T00:26:08Z","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":"Motivated by multi-user optimization problems and non-cooperative Nash games in uncertain regimes, we consider stochastic Cartesian variational inequalities (SCVI) where the set is given as the Cartesian product of a collection of component sets. First, we consider the case where the number of the component sets is large. For solving this type of problems, the classical stochastic approximation methods and their prox generalizations are computationally inefficient as each iteration becomes very costly. To address this challenge, we develop a randomized block stochastic mirror-prox (B-SMP) algo","authors_text":"Angelia Nedich, Farzad Yousefian, Uday V. Shanbhag","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-26T06:32:22Z","title":"On stochastic mirror-prox algorithms for stochastic Cartesian variational inequalities: randomized block coordinate and optimal averaging schemes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.08195","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:fa8521e2a2a402be8d0120a1371819f48b1763a695acdeaa60adbc3b3e8b2ebf","target":"record","created_at":"2026-05-18T00:26:08Z","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":"b4ed8bfa8be4b8194b4f297e29885d9cbfc2411d42aa7ab82cc12367d0f2e70c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-10-26T06:32:22Z","title_canon_sha256":"0affecbc5d5338c3c9a4aa435d9f91a7243afe651b87a702e895b6127ad671d1"},"schema_version":"1.0","source":{"id":"1610.08195","kind":"arxiv","version":3}},"canonical_sha256":"efc594cfefed54d943e77a8d6be10024b0cd06bf466408cedffbafc691302352","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efc594cfefed54d943e77a8d6be10024b0cd06bf466408cedffbafc691302352","first_computed_at":"2026-05-18T00:26:08.612738Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:08.612738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KjCVcsyQDhqF08kBypl7WWtOWWEh5KVUpVrOshA+VjDJrIrqfeHb+yT2MmV05TzfF4Iy+3Jov8FCboIazofIBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:08.613332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.08195","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa8521e2a2a402be8d0120a1371819f48b1763a695acdeaa60adbc3b3e8b2ebf","sha256:5974a73d79b3490dd4927d6846dd841263969243c1350dfd32399adf49e89c01"],"state_sha256":"78c60fc0364c15785388dcfdfc4824f3a2a493cb3817e66500718352ffb9f426"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPhqTN4u50zisheH+zCQw7FKC4Hn/ChD9vKNv8yn6Vn2AB3OdNmd5Dm1we8ZYZmMHhFdGux7cRyGqwnLJKWdCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T09:20:52.562126Z","bundle_sha256":"cded4382b15b6becab4f9cfdf524b6fb8f6f956d8b251dcd5454f5ccd2033587"}}