{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JEMIETWCC7YM7ARGZLON3CBD6S","short_pith_number":"pith:JEMIETWC","schema_version":"1.0","canonical_sha256":"4918824ec217f0cf8226cadcdd8823f49ca9adb5ef1c810a4c3c8cdb483929d3","source":{"kind":"arxiv","id":"2606.30202","version":1},"attestation_state":"computed","paper":{"title":"A survey of trust-region radius update mechanisms. Part I: First-order analysis","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Fabian Bastin, J\\'er\\'emy Rieussec","submitted_at":"2026-06-29T12:21:32Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.30202","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.OC","submitted_at":"2026-06-29T12:21:32Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"acd9e7023f8d75d61488c6d6d4a7ee5b4c893071c4e65af2b4017429063ce659","abstract_canon_sha256":"6acd147b7a0382fe312c46b7272e7f3a2bfa0a151402a2d966b1a87e2a39e16c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:17:53.844950Z","signature_b64":"tyj88UfIAO2/KWe1k5aSA23n8QQVAIYupL0lgJmCNgykBMCtbgLhWqRHNTElqTSLg/mbVs9d66XzYyNdcJ9lDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4918824ec217f0cf8226cadcdd8823f49ca9adb5ef1c810a4c3c8cdb483929d3","last_reissued_at":"2026-06-30T02:17:53.844512Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:17:53.844512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A survey of trust-region radius update mechanisms. Part I: First-order analysis","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Fabian Bastin, J\\'er\\'emy Rieussec","submitted_at":"2026-06-29T12:21:32Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30202","kind":"arxiv","version":1},"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/2606.30202/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.30202","created_at":"2026-06-30T02:17:53.844572+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.30202v1","created_at":"2026-06-30T02:17:53.844572+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30202","created_at":"2026-06-30T02:17:53.844572+00:00"},{"alias_kind":"pith_short_12","alias_value":"JEMIETWCC7YM","created_at":"2026-06-30T02:17:53.844572+00:00"},{"alias_kind":"pith_short_16","alias_value":"JEMIETWCC7YM7ARG","created_at":"2026-06-30T02:17:53.844572+00:00"},{"alias_kind":"pith_short_8","alias_value":"JEMIETWC","created_at":"2026-06-30T02:17:53.844572+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JEMIETWCC7YM7ARGZLON3CBD6S","json":"https://pith.science/pith/JEMIETWCC7YM7ARGZLON3CBD6S.json","graph_json":"https://pith.science/api/pith-number/JEMIETWCC7YM7ARGZLON3CBD6S/graph.json","events_json":"https://pith.science/api/pith-number/JEMIETWCC7YM7ARGZLON3CBD6S/events.json","paper":"https://pith.science/paper/JEMIETWC"},"agent_actions":{"view_html":"https://pith.science/pith/JEMIETWCC7YM7ARGZLON3CBD6S","download_json":"https://pith.science/pith/JEMIETWCC7YM7ARGZLON3CBD6S.json","view_paper":"https://pith.science/paper/JEMIETWC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.30202&json=true","fetch_graph":"https://pith.science/api/pith-number/JEMIETWCC7YM7ARGZLON3CBD6S/graph.json","fetch_events":"https://pith.science/api/pith-number/JEMIETWCC7YM7ARGZLON3CBD6S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JEMIETWCC7YM7ARGZLON3CBD6S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JEMIETWCC7YM7ARGZLON3CBD6S/action/storage_attestation","attest_author":"https://pith.science/pith/JEMIETWCC7YM7ARGZLON3CBD6S/action/author_attestation","sign_citation":"https://pith.science/pith/JEMIETWCC7YM7ARGZLON3CBD6S/action/citation_signature","submit_replication":"https://pith.science/pith/JEMIETWCC7YM7ARGZLON3CBD6S/action/replication_record"}},"created_at":"2026-06-30T02:17:53.844572+00:00","updated_at":"2026-06-30T02:17:53.844572+00:00"}