{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:HACSSUY3PAD2ZHMFSOZGXQEQBX","short_pith_number":"pith:HACSSUY3","canonical_record":{"source":{"id":"2510.03187","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-10-03T17:13:55Z","cross_cats_sorted":[],"title_canon_sha256":"55c2aa2fc64975b78be2c4df59c19ef9f06f9238093e6cecbec0236289af822e","abstract_canon_sha256":"a3ae8ab6cd789b8837d490e0a50428495d75e5ec9adcdbebe4c4606faa833ad9"},"schema_version":"1.0"},"canonical_sha256":"380529531b7807ac9d8593b26bc0900de611e91a55d3c735bb5de1a0cbd96047","source":{"kind":"arxiv","id":"2510.03187","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.03187","created_at":"2026-06-30T00:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"2510.03187v2","created_at":"2026-06-30T00:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.03187","created_at":"2026-06-30T00:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"HACSSUY3PAD2","created_at":"2026-06-30T00:15:08Z"},{"alias_kind":"pith_short_16","alias_value":"HACSSUY3PAD2ZHMF","created_at":"2026-06-30T00:15:08Z"},{"alias_kind":"pith_short_8","alias_value":"HACSSUY3","created_at":"2026-06-30T00:15:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:HACSSUY3PAD2ZHMFSOZGXQEQBX","target":"record","payload":{"canonical_record":{"source":{"id":"2510.03187","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-10-03T17:13:55Z","cross_cats_sorted":[],"title_canon_sha256":"55c2aa2fc64975b78be2c4df59c19ef9f06f9238093e6cecbec0236289af822e","abstract_canon_sha256":"a3ae8ab6cd789b8837d490e0a50428495d75e5ec9adcdbebe4c4606faa833ad9"},"schema_version":"1.0"},"canonical_sha256":"380529531b7807ac9d8593b26bc0900de611e91a55d3c735bb5de1a0cbd96047","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T00:15:08.084398Z","signature_b64":"1SnGj0bGS4am0+/Moqhnw33bBDwKvuv7jArrhVpx/Y9BvlrszGnQcDtghHYCVpSF0Ep94nvMKiWCE+66vgixCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"380529531b7807ac9d8593b26bc0900de611e91a55d3c735bb5de1a0cbd96047","last_reissued_at":"2026-06-30T00:15:08.083860Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T00:15:08.083860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2510.03187","source_version":2,"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-06-30T00:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O6gZFneHQHC0Ywh+8C5eaGF91irKULrHhk366cWm8xneTIVIKKlvNb3DJjLundaOKRpCrC4RY8FcoR00HTwDAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T10:56:39.909626Z"},"content_sha256":"80b4fe9e649091bb3346bafe2e48b4b885337febc1b29f070e970adc7aa3a989","schema_version":"1.0","event_id":"sha256:80b4fe9e649091bb3346bafe2e48b4b885337febc1b29f070e970adc7aa3a989"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:HACSSUY3PAD2ZHMFSOZGXQEQBX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ProxSTORM -- A Stochastic Trust-Region Algorithm for Nonsmooth Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aurya Javeed, Drew P. Kouri, Katya Scheinberg, Robert J. Baraldi","submitted_at":"2025-10-03T17:13:55Z","abstract_excerpt":"We develop a stochastic trust-region algorithm for minimizing the sum of a Lipschitz-smooth but possibly nonconvex function and a convex but possibly nonsmooth function. Such a problem class arises in many applications, including data science, operations research, and PDE-constrained optimization. This algorithm, which we call ProxSTORM, generalizes STORM [15,11]-a stochastic trust-region algorithm for the unconstrained optimization of smooth functions-and the inexact deterministic proximal trust-region algorithm in [5]. In the absence of a nonsmooth term, we recover the original STORM algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.03187","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.03187/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-06-30T00:15:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ErIluPkVgoQqdqXKtDA2R7zmzzhPEE9uWEMw1qVbJjuGn+3hLcmGvicvMicaUuBFZX55BveM54SrRz25AZwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T10:56:39.910588Z"},"content_sha256":"dc67764557cae60c580d0a9a743cb8e295807258b9544d8fc14358dc108893a5","schema_version":"1.0","event_id":"sha256:dc67764557cae60c580d0a9a743cb8e295807258b9544d8fc14358dc108893a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HACSSUY3PAD2ZHMFSOZGXQEQBX/bundle.json","state_url":"https://pith.science/pith/HACSSUY3PAD2ZHMFSOZGXQEQBX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HACSSUY3PAD2ZHMFSOZGXQEQBX/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-09T10:56:39Z","links":{"resolver":"https://pith.science/pith/HACSSUY3PAD2ZHMFSOZGXQEQBX","bundle":"https://pith.science/pith/HACSSUY3PAD2ZHMFSOZGXQEQBX/bundle.json","state":"https://pith.science/pith/HACSSUY3PAD2ZHMFSOZGXQEQBX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HACSSUY3PAD2ZHMFSOZGXQEQBX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:HACSSUY3PAD2ZHMFSOZGXQEQBX","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":"a3ae8ab6cd789b8837d490e0a50428495d75e5ec9adcdbebe4c4606faa833ad9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-10-03T17:13:55Z","title_canon_sha256":"55c2aa2fc64975b78be2c4df59c19ef9f06f9238093e6cecbec0236289af822e"},"schema_version":"1.0","source":{"id":"2510.03187","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.03187","created_at":"2026-06-30T00:15:08Z"},{"alias_kind":"arxiv_version","alias_value":"2510.03187v2","created_at":"2026-06-30T00:15:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.03187","created_at":"2026-06-30T00:15:08Z"},{"alias_kind":"pith_short_12","alias_value":"HACSSUY3PAD2","created_at":"2026-06-30T00:15:08Z"},{"alias_kind":"pith_short_16","alias_value":"HACSSUY3PAD2ZHMF","created_at":"2026-06-30T00:15:08Z"},{"alias_kind":"pith_short_8","alias_value":"HACSSUY3","created_at":"2026-06-30T00:15:08Z"}],"graph_snapshots":[{"event_id":"sha256:dc67764557cae60c580d0a9a743cb8e295807258b9544d8fc14358dc108893a5","target":"graph","created_at":"2026-06-30T00:15: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2510.03187/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We develop a stochastic trust-region algorithm for minimizing the sum of a Lipschitz-smooth but possibly nonconvex function and a convex but possibly nonsmooth function. Such a problem class arises in many applications, including data science, operations research, and PDE-constrained optimization. This algorithm, which we call ProxSTORM, generalizes STORM [15,11]-a stochastic trust-region algorithm for the unconstrained optimization of smooth functions-and the inexact deterministic proximal trust-region algorithm in [5]. In the absence of a nonsmooth term, we recover the original STORM algorit","authors_text":"Aurya Javeed, Drew P. Kouri, Katya Scheinberg, Robert J. Baraldi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-10-03T17:13:55Z","title":"ProxSTORM -- A Stochastic Trust-Region Algorithm for Nonsmooth Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.03187","kind":"arxiv","version":2},"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:80b4fe9e649091bb3346bafe2e48b4b885337febc1b29f070e970adc7aa3a989","target":"record","created_at":"2026-06-30T00:15: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":"a3ae8ab6cd789b8837d490e0a50428495d75e5ec9adcdbebe4c4606faa833ad9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-10-03T17:13:55Z","title_canon_sha256":"55c2aa2fc64975b78be2c4df59c19ef9f06f9238093e6cecbec0236289af822e"},"schema_version":"1.0","source":{"id":"2510.03187","kind":"arxiv","version":2}},"canonical_sha256":"380529531b7807ac9d8593b26bc0900de611e91a55d3c735bb5de1a0cbd96047","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"380529531b7807ac9d8593b26bc0900de611e91a55d3c735bb5de1a0cbd96047","first_computed_at":"2026-06-30T00:15:08.083860Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T00:15:08.083860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1SnGj0bGS4am0+/Moqhnw33bBDwKvuv7jArrhVpx/Y9BvlrszGnQcDtghHYCVpSF0Ep94nvMKiWCE+66vgixCg==","signature_status":"signed_v1","signed_at":"2026-06-30T00:15:08.084398Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.03187","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80b4fe9e649091bb3346bafe2e48b4b885337febc1b29f070e970adc7aa3a989","sha256:dc67764557cae60c580d0a9a743cb8e295807258b9544d8fc14358dc108893a5"],"state_sha256":"244c20598ecd62211305142a83279149c49a6678c3705c183b6b349138a70ee3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"30S0G0ZGNX3j2DV07I9t8X9T8j+XqgQf/gwlMAAT4Eu0+8a5ZW+Li5hDTr4vN56w9NIiL3y/4pBLpvlAfsNACg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T10:56:39.916529Z","bundle_sha256":"8a8e679edf71e0470716d70848a6855c1a55cb7acfd968954ee5bb08183a2e59"}}