{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:65F6HPC65ZE3RJKGFCWPUTOJJK","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":"0eedf0149c6d49f833fdff2210a878061756aa4d998f59ee469c34e2d297095e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-03T15:10:40Z","title_canon_sha256":"efce2d601317000a771e51671571138d4a03c4db8a2950b3c8583cf1819cc21a"},"schema_version":"1.0","source":{"id":"2203.01757","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2203.01757","created_at":"2026-07-05T10:06:35Z"},{"alias_kind":"arxiv_version","alias_value":"2203.01757v3","created_at":"2026-07-05T10:06:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.01757","created_at":"2026-07-05T10:06:35Z"},{"alias_kind":"pith_short_12","alias_value":"65F6HPC65ZE3","created_at":"2026-07-05T10:06:35Z"},{"alias_kind":"pith_short_16","alias_value":"65F6HPC65ZE3RJKG","created_at":"2026-07-05T10:06:35Z"},{"alias_kind":"pith_short_8","alias_value":"65F6HPC6","created_at":"2026-07-05T10:06:35Z"}],"graph_snapshots":[{"event_id":"sha256:59237c00c9da36b2dc293933bb8c8a609a0898865981b2e0ca5724010aa93360","target":"graph","created_at":"2026-07-05T10:06:35Z","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/2203.01757/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Two classes of algorithms for optimization in the presence of noise are presented, that do not require the evaluation of the objective function. The first generalizes the well-known Adagrad method. Its complexity is then analyzed as a function of its parameters. A second class of algorithms is then derived whose complexity is at least as good as that of the first class. Initial numerical experiments on finite-sum problems arising from deep-learning applications suggest that methods of the second class may outperform those of the first.","authors_text":"Ph. L. Toint, S. Gratton, S. Jerad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-03T15:10:40Z","title":"Complexity and performance for two classes of noise-tolerant first-order algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.01757","kind":"arxiv","version":3},"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:32e0d1c66597643b7b42f4f9811d93fc861b7ba0ef41a3cf3fb0bd5046dbd22c","target":"record","created_at":"2026-07-05T10:06:35Z","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":"0eedf0149c6d49f833fdff2210a878061756aa4d998f59ee469c34e2d297095e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-03-03T15:10:40Z","title_canon_sha256":"efce2d601317000a771e51671571138d4a03c4db8a2950b3c8583cf1819cc21a"},"schema_version":"1.0","source":{"id":"2203.01757","kind":"arxiv","version":3}},"canonical_sha256":"f74be3bc5eee49b8a54628acfa4dc94ab26cfe3444419d7afd2e184b74f20342","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f74be3bc5eee49b8a54628acfa4dc94ab26cfe3444419d7afd2e184b74f20342","first_computed_at":"2026-07-05T10:06:35.857715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:06:35.857715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"T39va0tGTlbWmz8pTyC8eXdr/0Z0ozpjWmwT5NbtfbRT/vARjb0kyXGHlbLruBPCIC4E43UL8wj3xIT5i5xZAw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:06:35.858118Z","signed_message":"canonical_sha256_bytes"},"source_id":"2203.01757","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32e0d1c66597643b7b42f4f9811d93fc861b7ba0ef41a3cf3fb0bd5046dbd22c","sha256:59237c00c9da36b2dc293933bb8c8a609a0898865981b2e0ca5724010aa93360"],"state_sha256":"dcf398bab6af2a855d7e14a6253dd95a12c84e95886d269de7800b2058de1774"}