{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:5H5SFYWKX2EZRMX24XZDURMD55","short_pith_number":"pith:5H5SFYWK","canonical_record":{"source":{"id":"1902.00126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-31T23:30:19Z","cross_cats_sorted":[],"title_canon_sha256":"045b7b9b96256a385911ee1dc64c720313556af2d4a2fec47f2dea88b9f30ecf","abstract_canon_sha256":"7c572e6f2cdf62178cead83d5ae8500a15dffb115060276ffc39327311d793d7"},"schema_version":"1.0"},"canonical_sha256":"e9fb22e2cabe8998b2fae5f23a4583ef78e86f2f652c6182277f4cc18acc0611","source":{"kind":"arxiv","id":"1902.00126","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00126","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00126v1","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00126","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"5H5SFYWKX2EZ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5H5SFYWKX2EZRMX2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5H5SFYWK","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:5H5SFYWKX2EZRMX24XZDURMD55","target":"record","payload":{"canonical_record":{"source":{"id":"1902.00126","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-31T23:30:19Z","cross_cats_sorted":[],"title_canon_sha256":"045b7b9b96256a385911ee1dc64c720313556af2d4a2fec47f2dea88b9f30ecf","abstract_canon_sha256":"7c572e6f2cdf62178cead83d5ae8500a15dffb115060276ffc39327311d793d7"},"schema_version":"1.0"},"canonical_sha256":"e9fb22e2cabe8998b2fae5f23a4583ef78e86f2f652c6182277f4cc18acc0611","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:58.208964Z","signature_b64":"qwS86XWIzuBZgzdbKy/Uys6tfCMiA11cyie3l0dabYLxkncU1GCFvljZCmQaFmpl+EhjtXHxF9upJMonZMIvDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9fb22e2cabe8998b2fae5f23a4583ef78e86f2f652c6182277f4cc18acc0611","last_reissued_at":"2026-05-17T23:54:58.208507Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:58.208507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.00126","source_version":1,"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-17T23:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qdCjI4ZcZh2ipOlni8B6xevZEXJ2ML2z+Wzm4Y/tSDnCO83IEWJFt1mAnhTqYBJa5BAL7TNg2efNGaASd6IEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:38:54.045620Z"},"content_sha256":"329c3e510ab244818a6099c663bd137511e1f518718c104a144200823d35d642","schema_version":"1.0","event_id":"sha256:329c3e510ab244818a6099c663bd137511e1f518718c104a144200823d35d642"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:5H5SFYWKX2EZRMX24XZDURMD55","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost surely constrained convex optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ahmet Alacaoglu, Ion Necoara, Olivier Fercoq, Volkan Cevher","submitted_at":"2019-01-31T23:30:19Z","abstract_excerpt":"We propose a stochastic gradient framework for solving stochastic composite convex optimization problems with (possibly) infinite number of linear inclusion constraints that need to be satisfied almost surely. We use smoothing and homotopy techniques to handle constraints without the need for matrix-valued projections. We show for our stochastic gradient algorithm $\\mathcal{O}(\\log(k)/\\sqrt{k})$ convergence rate for general convex objectives and $\\mathcal{O}(\\log(k)/k)$ convergence rate for restricted strongly convex objectives. These rates are known to be optimal up to logarithmic factors, ev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00126","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":""},"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-17T23:54:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jkJXh9qZONZjNE2nTjRwaL7fCZ0VvRKUqBH3kSFSQvGdL1SY6RWEKGvB8Qvah67vzkEUajlUMPln4G6tHu0SDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:38:54.046262Z"},"content_sha256":"f5a03226af8b62f4c6f76e4e67d36e5810368b879ba30e8f4b190779c18c3a27","schema_version":"1.0","event_id":"sha256:f5a03226af8b62f4c6f76e4e67d36e5810368b879ba30e8f4b190779c18c3a27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5H5SFYWKX2EZRMX24XZDURMD55/bundle.json","state_url":"https://pith.science/pith/5H5SFYWKX2EZRMX24XZDURMD55/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5H5SFYWKX2EZRMX24XZDURMD55/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-05-26T08:38:54Z","links":{"resolver":"https://pith.science/pith/5H5SFYWKX2EZRMX24XZDURMD55","bundle":"https://pith.science/pith/5H5SFYWKX2EZRMX24XZDURMD55/bundle.json","state":"https://pith.science/pith/5H5SFYWKX2EZRMX24XZDURMD55/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5H5SFYWKX2EZRMX24XZDURMD55/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:5H5SFYWKX2EZRMX24XZDURMD55","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":"7c572e6f2cdf62178cead83d5ae8500a15dffb115060276ffc39327311d793d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-31T23:30:19Z","title_canon_sha256":"045b7b9b96256a385911ee1dc64c720313556af2d4a2fec47f2dea88b9f30ecf"},"schema_version":"1.0","source":{"id":"1902.00126","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00126","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00126v1","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00126","created_at":"2026-05-17T23:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"5H5SFYWKX2EZ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"5H5SFYWKX2EZRMX2","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"5H5SFYWK","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:f5a03226af8b62f4c6f76e4e67d36e5810368b879ba30e8f4b190779c18c3a27","target":"graph","created_at":"2026-05-17T23:54:58Z","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":"We propose a stochastic gradient framework for solving stochastic composite convex optimization problems with (possibly) infinite number of linear inclusion constraints that need to be satisfied almost surely. We use smoothing and homotopy techniques to handle constraints without the need for matrix-valued projections. We show for our stochastic gradient algorithm $\\mathcal{O}(\\log(k)/\\sqrt{k})$ convergence rate for general convex objectives and $\\mathcal{O}(\\log(k)/k)$ convergence rate for restricted strongly convex objectives. These rates are known to be optimal up to logarithmic factors, ev","authors_text":"Ahmet Alacaoglu, Ion Necoara, Olivier Fercoq, Volkan Cevher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-31T23:30:19Z","title":"Almost surely constrained convex optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00126","kind":"arxiv","version":1},"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:329c3e510ab244818a6099c663bd137511e1f518718c104a144200823d35d642","target":"record","created_at":"2026-05-17T23:54:58Z","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":"7c572e6f2cdf62178cead83d5ae8500a15dffb115060276ffc39327311d793d7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-01-31T23:30:19Z","title_canon_sha256":"045b7b9b96256a385911ee1dc64c720313556af2d4a2fec47f2dea88b9f30ecf"},"schema_version":"1.0","source":{"id":"1902.00126","kind":"arxiv","version":1}},"canonical_sha256":"e9fb22e2cabe8998b2fae5f23a4583ef78e86f2f652c6182277f4cc18acc0611","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9fb22e2cabe8998b2fae5f23a4583ef78e86f2f652c6182277f4cc18acc0611","first_computed_at":"2026-05-17T23:54:58.208507Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:58.208507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qwS86XWIzuBZgzdbKy/Uys6tfCMiA11cyie3l0dabYLxkncU1GCFvljZCmQaFmpl+EhjtXHxF9upJMonZMIvDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:58.208964Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00126","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:329c3e510ab244818a6099c663bd137511e1f518718c104a144200823d35d642","sha256:f5a03226af8b62f4c6f76e4e67d36e5810368b879ba30e8f4b190779c18c3a27"],"state_sha256":"c1eba23e2e6ccf6cc09d099f3d5c6135298360535a7e90c4deaa68a1e943d823"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTr/xqTexYNiB8cNSODRToLeHRea+0uJReW9n+CqJDStK8IocikneD4q5i/4G7VFUaPprr4zUhPRTbgN61AdDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:38:54.050111Z","bundle_sha256":"b96e8e326e2afa87a99cc5901775a00ce20e06755bd8ac108c9105e94e300826"}}