{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:O7NLHPRIMKOIP5Y6EDWGOR6346","short_pith_number":"pith:O7NLHPRI","canonical_record":{"source":{"id":"2412.02338","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-03T10:00:04Z","cross_cats_sorted":[],"title_canon_sha256":"f087f305fd073c2953a514b2e11991a7ecf18d16e093e4199d7df1c26fe7975f","abstract_canon_sha256":"e3d16108da514f41182d204963b18122498e3825c80ab42114960d2dd95ddefd"},"schema_version":"1.0"},"canonical_sha256":"77dab3be28629c87f71e20ec6747dbe7a77f66ec071b88502ff51d4aa0e31088","source":{"kind":"arxiv","id":"2412.02338","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.02338","created_at":"2026-07-05T09:43:48Z"},{"alias_kind":"arxiv_version","alias_value":"2412.02338v1","created_at":"2026-07-05T09:43:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02338","created_at":"2026-07-05T09:43:48Z"},{"alias_kind":"pith_short_12","alias_value":"O7NLHPRIMKOI","created_at":"2026-07-05T09:43:48Z"},{"alias_kind":"pith_short_16","alias_value":"O7NLHPRIMKOIP5Y6","created_at":"2026-07-05T09:43:48Z"},{"alias_kind":"pith_short_8","alias_value":"O7NLHPRI","created_at":"2026-07-05T09:43:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:O7NLHPRIMKOIP5Y6EDWGOR6346","target":"record","payload":{"canonical_record":{"source":{"id":"2412.02338","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-03T10:00:04Z","cross_cats_sorted":[],"title_canon_sha256":"f087f305fd073c2953a514b2e11991a7ecf18d16e093e4199d7df1c26fe7975f","abstract_canon_sha256":"e3d16108da514f41182d204963b18122498e3825c80ab42114960d2dd95ddefd"},"schema_version":"1.0"},"canonical_sha256":"77dab3be28629c87f71e20ec6747dbe7a77f66ec071b88502ff51d4aa0e31088","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:43:48.397210Z","signature_b64":"c3k93QihxlN1j9R8aITh3D/I4jPXHHJ8wIVEpP3/D0owY5XmIUzT2GWsrtdXEDzAN7sdW1jB96h2X7AnsTQJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77dab3be28629c87f71e20ec6747dbe7a77f66ec071b88502ff51d4aa0e31088","last_reissued_at":"2026-07-05T09:43:48.396804Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:43:48.396804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.02338","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-07-05T09:43:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dJAWr1j7rrKaAz2t3JVVHlC8jrXgmFMwu1xy5G8wt3lzSJpnzQhnGHgFK1MSmsreUj7C566qLYSDr0PDINxvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:45:47.469723Z"},"content_sha256":"75028bc3674e6646f3b7c913b650d6a2e5e7b343145607ef9a2e68a438ec9111","schema_version":"1.0","event_id":"sha256:75028bc3674e6646f3b7c913b650d6a2e5e7b343145607ef9a2e68a438ec9111"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:O7NLHPRIMKOIP5Y6EDWGOR6346","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic halfspace approximation method for convex optimization with nonsmooth functional constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ion Necoara, Nitesh Kumar Singh","submitted_at":"2024-12-03T10:00:04Z","abstract_excerpt":"In this work, we consider convex optimization problems with smooth objective function and nonsmooth functional constraints. We propose a new stochastic gradient algorithm, called Stochastic Halfspace Approximation Method (SHAM), to solve this problem, where at each iteration we first take a gradient step for the objective function and then we perform a projection step onto one halfspace approximation of a randomly chosen constraint. We propose various strategies to create this stochastic halfspace approximation and we provide a unified convergence analysis that yields new convergence rates for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02338","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/2412.02338/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"},"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-07-05T09:43:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wOR2lN2rT/zI9EFBdZ94ipsIQfrl1TimyuQrC6bGl4LJIoCzCb9TfzNLdeaH66Bsjufi7OvhXi9S46kWbX4LCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:45:47.470684Z"},"content_sha256":"dd321d799ed8f47c794cc6276e28dcd60334efec59878f087918771df123881a","schema_version":"1.0","event_id":"sha256:dd321d799ed8f47c794cc6276e28dcd60334efec59878f087918771df123881a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O7NLHPRIMKOIP5Y6EDWGOR6346/bundle.json","state_url":"https://pith.science/pith/O7NLHPRIMKOIP5Y6EDWGOR6346/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O7NLHPRIMKOIP5Y6EDWGOR6346/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-08-18T18:45:47Z","links":{"resolver":"https://pith.science/pith/O7NLHPRIMKOIP5Y6EDWGOR6346","bundle":"https://pith.science/pith/O7NLHPRIMKOIP5Y6EDWGOR6346/bundle.json","state":"https://pith.science/pith/O7NLHPRIMKOIP5Y6EDWGOR6346/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O7NLHPRIMKOIP5Y6EDWGOR6346/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:O7NLHPRIMKOIP5Y6EDWGOR6346","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":"e3d16108da514f41182d204963b18122498e3825c80ab42114960d2dd95ddefd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-03T10:00:04Z","title_canon_sha256":"f087f305fd073c2953a514b2e11991a7ecf18d16e093e4199d7df1c26fe7975f"},"schema_version":"1.0","source":{"id":"2412.02338","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.02338","created_at":"2026-07-05T09:43:48Z"},{"alias_kind":"arxiv_version","alias_value":"2412.02338v1","created_at":"2026-07-05T09:43:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02338","created_at":"2026-07-05T09:43:48Z"},{"alias_kind":"pith_short_12","alias_value":"O7NLHPRIMKOI","created_at":"2026-07-05T09:43:48Z"},{"alias_kind":"pith_short_16","alias_value":"O7NLHPRIMKOIP5Y6","created_at":"2026-07-05T09:43:48Z"},{"alias_kind":"pith_short_8","alias_value":"O7NLHPRI","created_at":"2026-07-05T09:43:48Z"}],"graph_snapshots":[{"event_id":"sha256:dd321d799ed8f47c794cc6276e28dcd60334efec59878f087918771df123881a","target":"graph","created_at":"2026-07-05T09:43:48Z","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/2412.02338/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this work, we consider convex optimization problems with smooth objective function and nonsmooth functional constraints. We propose a new stochastic gradient algorithm, called Stochastic Halfspace Approximation Method (SHAM), to solve this problem, where at each iteration we first take a gradient step for the objective function and then we perform a projection step onto one halfspace approximation of a randomly chosen constraint. We propose various strategies to create this stochastic halfspace approximation and we provide a unified convergence analysis that yields new convergence rates for","authors_text":"Ion Necoara, Nitesh Kumar Singh","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-03T10:00:04Z","title":"Stochastic halfspace approximation method for convex optimization with nonsmooth functional constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02338","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:75028bc3674e6646f3b7c913b650d6a2e5e7b343145607ef9a2e68a438ec9111","target":"record","created_at":"2026-07-05T09:43:48Z","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":"e3d16108da514f41182d204963b18122498e3825c80ab42114960d2dd95ddefd","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-12-03T10:00:04Z","title_canon_sha256":"f087f305fd073c2953a514b2e11991a7ecf18d16e093e4199d7df1c26fe7975f"},"schema_version":"1.0","source":{"id":"2412.02338","kind":"arxiv","version":1}},"canonical_sha256":"77dab3be28629c87f71e20ec6747dbe7a77f66ec071b88502ff51d4aa0e31088","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77dab3be28629c87f71e20ec6747dbe7a77f66ec071b88502ff51d4aa0e31088","first_computed_at":"2026-07-05T09:43:48.396804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:43:48.396804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c3k93QihxlN1j9R8aITh3D/I4jPXHHJ8wIVEpP3/D0owY5XmIUzT2GWsrtdXEDzAN7sdW1jB96h2X7AnsTQJBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:43:48.397210Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.02338","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75028bc3674e6646f3b7c913b650d6a2e5e7b343145607ef9a2e68a438ec9111","sha256:dd321d799ed8f47c794cc6276e28dcd60334efec59878f087918771df123881a"],"state_sha256":"c5718156a02c4f6f4aff7aff156ac3c56946086207674ca12433dd8944f5f18d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OcpG0fl7jTi0NQzBte8BkcipFs7qi9zRAbj0jTOGTVfDZOUOWutkpDDThxhDJFegzNNjbfYWHzyzZ7Vdn8wODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T18:45:47.477219Z","bundle_sha256":"db21ea90d7b0ec330c3a310097f0a6debfa7566d78d6d98812862fe053f0e9d5"}}