{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SQIXMYMOCBFTP7GY66GMUNRP4F","short_pith_number":"pith:SQIXMYMO","schema_version":"1.0","canonical_sha256":"941176618e104b37fcd8f78cca362fe14caaf2c3e0e5d6caff13769de8d72029","source":{"kind":"arxiv","id":"2405.14255","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Proximal Point Methods for Monotone Inclusions under Expected Similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Abdurakhmon Sadiev, Laurent Condat, Peter Richt\\'arik","submitted_at":"2024-05-23T07:34:55Z","abstract_excerpt":"Monotone inclusions have a wide range of applications, including minimization, saddle-point, and equilibria problems. We introduce new stochastic algorithms, with or without variance reduction, to estimate a root of the expectation of possibly set-valued monotone operators, using at every iteration one call to the resolvent of a randomly sampled operator. We also introduce a notion of similarity between the operators, which holds even for discontinuous operators. We leverage it to derive linear convergence results in the strongly monotone setting."},"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":"2405.14255","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-05-23T07:34:55Z","cross_cats_sorted":[],"title_canon_sha256":"d5556e9cb1759e90cf1d7e9e540be3323ce133ff487095270a62c9431d2b88d2","abstract_canon_sha256":"da81e46358b29129254100b79e4b6e63a9fdd5a5471257717c3ea875a1deca2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:22:12.007388Z","signature_b64":"1KA6jVln6usk5+vgcafaKJK8iuvJfspD2n0+qgtwHK4Tuo3DZqkubuYwdO/A456qa3Ui5PW3Xnh+OrJclOE/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"941176618e104b37fcd8f78cca362fe14caaf2c3e0e5d6caff13769de8d72029","last_reissued_at":"2026-07-05T08:22:12.007006Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:22:12.007006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Proximal Point Methods for Monotone Inclusions under Expected Similarity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Abdurakhmon Sadiev, Laurent Condat, Peter Richt\\'arik","submitted_at":"2024-05-23T07:34:55Z","abstract_excerpt":"Monotone inclusions have a wide range of applications, including minimization, saddle-point, and equilibria problems. We introduce new stochastic algorithms, with or without variance reduction, to estimate a root of the expectation of possibly set-valued monotone operators, using at every iteration one call to the resolvent of a randomly sampled operator. We also introduce a notion of similarity between the operators, which holds even for discontinuous operators. We leverage it to derive linear convergence results in the strongly monotone setting."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.14255","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.14255/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2405.14255","created_at":"2026-07-05T08:22:12.007064+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.14255v1","created_at":"2026-07-05T08:22:12.007064+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.14255","created_at":"2026-07-05T08:22:12.007064+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQIXMYMOCBFT","created_at":"2026-07-05T08:22:12.007064+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQIXMYMOCBFTP7GY","created_at":"2026-07-05T08:22:12.007064+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQIXMYMO","created_at":"2026-07-05T08:22:12.007064+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.15368","citing_title":"Tighter Performance Theory of FedExProx","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SQIXMYMOCBFTP7GY66GMUNRP4F","json":"https://pith.science/pith/SQIXMYMOCBFTP7GY66GMUNRP4F.json","graph_json":"https://pith.science/api/pith-number/SQIXMYMOCBFTP7GY66GMUNRP4F/graph.json","events_json":"https://pith.science/api/pith-number/SQIXMYMOCBFTP7GY66GMUNRP4F/events.json","paper":"https://pith.science/paper/SQIXMYMO"},"agent_actions":{"view_html":"https://pith.science/pith/SQIXMYMOCBFTP7GY66GMUNRP4F","download_json":"https://pith.science/pith/SQIXMYMOCBFTP7GY66GMUNRP4F.json","view_paper":"https://pith.science/paper/SQIXMYMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.14255&json=true","fetch_graph":"https://pith.science/api/pith-number/SQIXMYMOCBFTP7GY66GMUNRP4F/graph.json","fetch_events":"https://pith.science/api/pith-number/SQIXMYMOCBFTP7GY66GMUNRP4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQIXMYMOCBFTP7GY66GMUNRP4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQIXMYMOCBFTP7GY66GMUNRP4F/action/storage_attestation","attest_author":"https://pith.science/pith/SQIXMYMOCBFTP7GY66GMUNRP4F/action/author_attestation","sign_citation":"https://pith.science/pith/SQIXMYMOCBFTP7GY66GMUNRP4F/action/citation_signature","submit_replication":"https://pith.science/pith/SQIXMYMOCBFTP7GY66GMUNRP4F/action/replication_record"}},"created_at":"2026-07-05T08:22:12.007064+00:00","updated_at":"2026-07-05T08:22:12.007064+00:00"}