{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BYEUZYZXBMHISN6P4Q363ORC5U","short_pith_number":"pith:BYEUZYZX","schema_version":"1.0","canonical_sha256":"0e094ce3370b0e8937cfe437edba22ed1128c744ac6836b5ee4935b4327c45d8","source":{"kind":"arxiv","id":"1703.00272","version":2},"attestation_state":"computed","paper":{"title":"Incremental constraint projection methods for monotone stochastic variational inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alejandro Jofr\\'e, Alfredo Iusem, Philip Thompson","submitted_at":"2017-03-01T12:50:13Z","abstract_excerpt":"We consider stochastic variational inequalities with monotone operators defined as the expected value of a random operator. We assume the feasible set is the intersection of a large family of convex sets. We propose a method that combines stochastic approximation with incremental constraint projections meaning that at each iteration, a step similar to some variant of a deterministic projection method is taken after the random operator is sampled and a component of the intersection defining the feasible set is chosen at random. Such sequential scheme is well suited for applications involving la"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1703.00272","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-03-01T12:50:13Z","cross_cats_sorted":[],"title_canon_sha256":"616f3834c5aeebc4b27fd75eac3141fce7deb0665444dc5c22c96c5d3f387cb2","abstract_canon_sha256":"5297e044f05c4eed56171d24682d958097fec3176a852f3d1c544cd7f4e210bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:41.654280Z","signature_b64":"VQvkEOANflqK7cAPGxnrAQpSWtgQsOPFEs8XNFHLoy6SBP6ISENzMwkfrQ1DeWghFoCq/TE5Mvu9MLyWY3K2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0e094ce3370b0e8937cfe437edba22ed1128c744ac6836b5ee4935b4327c45d8","last_reissued_at":"2026-05-18T00:49:41.653853Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:41.653853Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental constraint projection methods for monotone stochastic variational inequalities","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alejandro Jofr\\'e, Alfredo Iusem, Philip Thompson","submitted_at":"2017-03-01T12:50:13Z","abstract_excerpt":"We consider stochastic variational inequalities with monotone operators defined as the expected value of a random operator. We assume the feasible set is the intersection of a large family of convex sets. We propose a method that combines stochastic approximation with incremental constraint projections meaning that at each iteration, a step similar to some variant of a deterministic projection method is taken after the random operator is sampled and a component of the intersection defining the feasible set is chosen at random. Such sequential scheme is well suited for applications involving la"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00272","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.00272","created_at":"2026-05-18T00:49:41.653910+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00272v2","created_at":"2026-05-18T00:49:41.653910+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00272","created_at":"2026-05-18T00:49:41.653910+00:00"},{"alias_kind":"pith_short_12","alias_value":"BYEUZYZXBMHI","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BYEUZYZXBMHISN6P","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BYEUZYZX","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BYEUZYZXBMHISN6P4Q363ORC5U","json":"https://pith.science/pith/BYEUZYZXBMHISN6P4Q363ORC5U.json","graph_json":"https://pith.science/api/pith-number/BYEUZYZXBMHISN6P4Q363ORC5U/graph.json","events_json":"https://pith.science/api/pith-number/BYEUZYZXBMHISN6P4Q363ORC5U/events.json","paper":"https://pith.science/paper/BYEUZYZX"},"agent_actions":{"view_html":"https://pith.science/pith/BYEUZYZXBMHISN6P4Q363ORC5U","download_json":"https://pith.science/pith/BYEUZYZXBMHISN6P4Q363ORC5U.json","view_paper":"https://pith.science/paper/BYEUZYZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00272&json=true","fetch_graph":"https://pith.science/api/pith-number/BYEUZYZXBMHISN6P4Q363ORC5U/graph.json","fetch_events":"https://pith.science/api/pith-number/BYEUZYZXBMHISN6P4Q363ORC5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BYEUZYZXBMHISN6P4Q363ORC5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BYEUZYZXBMHISN6P4Q363ORC5U/action/storage_attestation","attest_author":"https://pith.science/pith/BYEUZYZXBMHISN6P4Q363ORC5U/action/author_attestation","sign_citation":"https://pith.science/pith/BYEUZYZXBMHISN6P4Q363ORC5U/action/citation_signature","submit_replication":"https://pith.science/pith/BYEUZYZXBMHISN6P4Q363ORC5U/action/replication_record"}},"created_at":"2026-05-18T00:49:41.653910+00:00","updated_at":"2026-05-18T00:49:41.653910+00:00"}