{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:5YLQLIWLS2ZMKRBJXIDGC6FDLF","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":"388297f242d8d3f585dbd66294047c139f6f72dbdb75ce2164041a9daac4fc80","cross_cats_sorted":["cs.AI","cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-15T17:32:10Z","title_canon_sha256":"55644031f976705d82920b3ce17d358aab997da042b62ab756633f0e9fa0d4c4"},"schema_version":"1.0","source":{"id":"2507.11513","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11513","created_at":"2026-07-05T11:37:40Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11513v1","created_at":"2026-07-05T11:37:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11513","created_at":"2026-07-05T11:37:40Z"},{"alias_kind":"pith_short_12","alias_value":"5YLQLIWLS2ZM","created_at":"2026-07-05T11:37:40Z"},{"alias_kind":"pith_short_16","alias_value":"5YLQLIWLS2ZMKRBJ","created_at":"2026-07-05T11:37:40Z"},{"alias_kind":"pith_short_8","alias_value":"5YLQLIWL","created_at":"2026-07-05T11:37:40Z"}],"graph_snapshots":[{"event_id":"sha256:d68e7ba5e4bc7e0c9631d6eee80eecf78e143b59d42e43bd1f5242a4f5b1d9df","target":"graph","created_at":"2026-07-05T11:37:40Z","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/2507.11513/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Two OFFO (Objective-Function Free Optimization) noise tolerant algorithms are presented that handle bound constraints, inexact gradients and use second-order information when available.The first is a multi-level method exploiting a hierarchical description of the problem and the second is a domain-decomposition method covering the standard addditive Schwarz decompositions. Both are generalizations of the first-order AdaGrad algorithm for unconstrained optimization. Because these algorithms share a common theoretical framework, a single convergence/complexity theory is provided which covers the","authors_text":"Alena Kopani\\v{c}\\'akov\\'a, Philippe Toint, Serge Gratton","cross_cats":["cs.AI","cs.NA","math.NA"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-15T17:32:10Z","title":"Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11513","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:e47f392f3da910b7697ba3fc35bde5b56ec4f457ba890a159e3b05599b044c10","target":"record","created_at":"2026-07-05T11:37:40Z","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":"388297f242d8d3f585dbd66294047c139f6f72dbdb75ce2164041a9daac4fc80","cross_cats_sorted":["cs.AI","cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2025-07-15T17:32:10Z","title_canon_sha256":"55644031f976705d82920b3ce17d358aab997da042b62ab756633f0e9fa0d4c4"},"schema_version":"1.0","source":{"id":"2507.11513","kind":"arxiv","version":1}},"canonical_sha256":"ee1705a2cb96b2c54429ba066178a35946311582a1af409de400e8158fc2984c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ee1705a2cb96b2c54429ba066178a35946311582a1af409de400e8158fc2984c","first_computed_at":"2026-07-05T11:37:40.301349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:37:40.301349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kge94Szq/hZvmb1aAMW7cdCen+GNgGMZ1Uq3/0bj54egUacKbRYT78Qy76N0F0TuCHoXf7JcgDyN73ERROpCAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:37:40.301858Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.11513","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e47f392f3da910b7697ba3fc35bde5b56ec4f457ba890a159e3b05599b044c10","sha256:d68e7ba5e4bc7e0c9631d6eee80eecf78e143b59d42e43bd1f5242a4f5b1d9df"],"state_sha256":"10eed1345bef21f907df4172d4c3e7d8b9bacba70b66cb64cff0c1385ed4ec1c"}