{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JEMIETWCC7YM7ARGZLON3CBD6S","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":"6acd147b7a0382fe312c46b7272e7f3a2bfa0a151402a2d966b1a87e2a39e16c","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-29T12:21:32Z","title_canon_sha256":"acd9e7023f8d75d61488c6d6d4a7ee5b4c893071c4e65af2b4017429063ce659"},"schema_version":"1.0","source":{"id":"2606.30202","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.30202","created_at":"2026-06-30T02:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"2606.30202v1","created_at":"2026-06-30T02:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30202","created_at":"2026-06-30T02:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"JEMIETWCC7YM","created_at":"2026-06-30T02:17:53Z"},{"alias_kind":"pith_short_16","alias_value":"JEMIETWCC7YM7ARG","created_at":"2026-06-30T02:17:53Z"},{"alias_kind":"pith_short_8","alias_value":"JEMIETWC","created_at":"2026-06-30T02:17:53Z"}],"graph_snapshots":[{"event_id":"sha256:84fe9e559d22784a7aef1e90f7fc52fe04af664ed4d85c1369ec67c238b4da42","target":"graph","created_at":"2026-06-30T02:17:53Z","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/2606.30202/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We isolate three structural conditions on trust-region radius update rules for smooth unconstrained nonlinear optimisation, and study the class of mechanisms they define. The conditions act on the radius directly: a lower bound relative to the gradient norm, a contraction on unsuccessful iterations, and a controlled expansion on successful ones. A mechanism is \\emph{weakly admissible} if it satisfies the first two conditions, and \\emph{strongly admissible} if it satisfies the lower bound together with the controlled-expansion condition. Under uniformly bounded model Hessians, weak admissibilit","authors_text":"Fabian Bastin, J\\'er\\'emy Rieussec","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-29T12:21:32Z","title":"A survey of trust-region radius update mechanisms. Part I: First-order analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30202","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:df669588032f1a98f9b588b17ca9fcd37f517bf1477edc0f31b573864ed4d154","target":"record","created_at":"2026-06-30T02:17:53Z","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":"6acd147b7a0382fe312c46b7272e7f3a2bfa0a151402a2d966b1a87e2a39e16c","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-29T12:21:32Z","title_canon_sha256":"acd9e7023f8d75d61488c6d6d4a7ee5b4c893071c4e65af2b4017429063ce659"},"schema_version":"1.0","source":{"id":"2606.30202","kind":"arxiv","version":1}},"canonical_sha256":"4918824ec217f0cf8226cadcdd8823f49ca9adb5ef1c810a4c3c8cdb483929d3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4918824ec217f0cf8226cadcdd8823f49ca9adb5ef1c810a4c3c8cdb483929d3","first_computed_at":"2026-06-30T02:17:53.844512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T02:17:53.844512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tyj88UfIAO2/KWe1k5aSA23n8QQVAIYupL0lgJmCNgykBMCtbgLhWqRHNTElqTSLg/mbVs9d66XzYyNdcJ9lDg==","signature_status":"signed_v1","signed_at":"2026-06-30T02:17:53.844950Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.30202","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df669588032f1a98f9b588b17ca9fcd37f517bf1477edc0f31b573864ed4d154","sha256:84fe9e559d22784a7aef1e90f7fc52fe04af664ed4d85c1369ec67c238b4da42"],"state_sha256":"c03b44a19d4446a82edfb0c2115894dce89c095e048128669b6b6b43205e9216"}