{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:Y6A6PQURQBODY65SZXLTFT7U4A","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":"7709918088c9aa15884cb67462d917d919bf50b94ec6b594a6775c45353c3fcf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-09T18:38:46Z","title_canon_sha256":"ac59bf9eddbbe99fc7c0329ef79ebbd3eee3add31aef8e9a3c44575f1f587b4a"},"schema_version":"1.0","source":{"id":"2505.06374","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.06374","created_at":"2026-06-12T01:09:08Z"},{"alias_kind":"arxiv_version","alias_value":"2505.06374v2","created_at":"2026-06-12T01:09:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.06374","created_at":"2026-06-12T01:09:08Z"},{"alias_kind":"pith_short_12","alias_value":"Y6A6PQURQBOD","created_at":"2026-06-12T01:09:08Z"},{"alias_kind":"pith_short_16","alias_value":"Y6A6PQURQBODY65S","created_at":"2026-06-12T01:09:08Z"},{"alias_kind":"pith_short_8","alias_value":"Y6A6PQUR","created_at":"2026-06-12T01:09:08Z"}],"graph_snapshots":[{"event_id":"sha256:7dc633e6dcf85fa1cdb4df4d50f8931e05d775b7a03470da5a070533c8b79837","target":"graph","created_at":"2026-06-12T01:09: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/2505.06374/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"ADAGB2, a generalization of the Adagrad algorithm for stochastic optimization is introduced, which is also applicable to bound-constrained problems and capable of using second-order information when available. It is shown that, given $\\delta\\in(0,1)$ and $\\epsilon\\in(0,1]$, the ADAGB2 algorithm needs at most $\\calO(\\epsilon^{-2})$ iterations to ensure an $\\epsilon$-approximate first-order critical point of the bound-constrained problem with probability at least $1-\\delta$, provided the average root mean square error of the gradient oracle is sufficiently small. Should this condition fail, it i","authors_text":"B. Morini, Ph. L. Toint, S. Bellavia, S. Gratton","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-09T18:38:46Z","title":"Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.06374","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:49b921d2753cf61383d5a946b2854d7f1c9fd6fe1b026468c8bbf445f8c39f29","target":"record","created_at":"2026-06-12T01:09: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":"7709918088c9aa15884cb67462d917d919bf50b94ec6b594a6775c45353c3fcf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-09T18:38:46Z","title_canon_sha256":"ac59bf9eddbbe99fc7c0329ef79ebbd3eee3add31aef8e9a3c44575f1f587b4a"},"schema_version":"1.0","source":{"id":"2505.06374","kind":"arxiv","version":2}},"canonical_sha256":"c781e7c291805c3c7bb2cdd732cff4e005cdc23aa354e548fe5ccc88d5cca075","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c781e7c291805c3c7bb2cdd732cff4e005cdc23aa354e548fe5ccc88d5cca075","first_computed_at":"2026-06-12T01:09:08.864921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:09:08.864921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6JicI6JLoY/FajjGy6V8tV6f2rQyi5rijwcoODYTI0fKy8xmehZe7sHztzXnSimHfCqz02A8F5/8EWeaUWu7CA==","signature_status":"signed_v1","signed_at":"2026-06-12T01:09:08.865912Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.06374","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:49b921d2753cf61383d5a946b2854d7f1c9fd6fe1b026468c8bbf445f8c39f29","sha256:7dc633e6dcf85fa1cdb4df4d50f8931e05d775b7a03470da5a070533c8b79837"],"state_sha256":"6dd567b7efeacc5abfdb8bfc98f858e216e09d57f259aec62f060bb83a430ea0"}