{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:6RYOOUAS3TF42RJTR33MGTEJMS","short_pith_number":"pith:6RYOOUAS","canonical_record":{"source":{"id":"2412.02079","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-03T01:48:27Z","cross_cats_sorted":[],"title_canon_sha256":"cd21c20ec19b8c5888fb8ee6dad020e282ec124a076d71cf8ba8d44182a3d409","abstract_canon_sha256":"08b5a554e3189b699fe33fb4153697b53dd04c5db7e3f52950bdc714d3fcb860"},"schema_version":"1.0"},"canonical_sha256":"f470e75012dccbcd45338ef6c34c896498b2ea85a55a9ffc35553501286f700a","source":{"kind":"arxiv","id":"2412.02079","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.02079","created_at":"2026-07-05T11:59:09Z"},{"alias_kind":"arxiv_version","alias_value":"2412.02079v3","created_at":"2026-07-05T11:59:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02079","created_at":"2026-07-05T11:59:09Z"},{"alias_kind":"pith_short_12","alias_value":"6RYOOUAS3TF4","created_at":"2026-07-05T11:59:09Z"},{"alias_kind":"pith_short_16","alias_value":"6RYOOUAS3TF42RJT","created_at":"2026-07-05T11:59:09Z"},{"alias_kind":"pith_short_8","alias_value":"6RYOOUAS","created_at":"2026-07-05T11:59:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:6RYOOUAS3TF42RJTR33MGTEJMS","target":"record","payload":{"canonical_record":{"source":{"id":"2412.02079","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-03T01:48:27Z","cross_cats_sorted":[],"title_canon_sha256":"cd21c20ec19b8c5888fb8ee6dad020e282ec124a076d71cf8ba8d44182a3d409","abstract_canon_sha256":"08b5a554e3189b699fe33fb4153697b53dd04c5db7e3f52950bdc714d3fcb860"},"schema_version":"1.0"},"canonical_sha256":"f470e75012dccbcd45338ef6c34c896498b2ea85a55a9ffc35553501286f700a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:59:09.549968Z","signature_b64":"L+NuA4I2a9M+beR+Dfs36jANI7KKoyAG6iikX1V/wzxZiKZIXBSV85hwJDHhRTbYfAP5sYJ7s/S0JhlbGDt6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f470e75012dccbcd45338ef6c34c896498b2ea85a55a9ffc35553501286f700a","last_reissued_at":"2026-07-05T11:59:09.549495Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:59:09.549495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.02079","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:59:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TGYlVvlQmW6IbGH7Sma0gVfvz3EWxBuijarOIlTUbumzlXSCTnMDSa0PxaOb4BBcuhEQcojIWrCn/Dz+HRKeBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:32:54.468838Z"},"content_sha256":"19ace1419841141b0a89944e9299a6da9b7b0b4a1fc0bf94bbfbdceaa4569fbc","schema_version":"1.0","event_id":"sha256:19ace1419841141b0a89944e9299a6da9b7b0b4a1fc0bf94bbfbdceaa4569fbc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:6RYOOUAS3TF42RJTR33MGTEJMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A simple and practical adaptive trust-region method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fadi Hamad, Oliver Hinder","submitted_at":"2024-12-03T01:48:27Z","abstract_excerpt":"We present an adaptive trust-region method for unconstrained optimization that allows inexact solutions to the trust-region subproblems. Our method is a simple variant of the classical trust-region method of \\citet{sorensen1982newton}. The method achieves the best possible convergence bound up to an additive log factor, for finding an $\\epsilon$-approximate stationary point, i.e., $O( \\Delta_f L^{1/2} \\epsilon^{-3/2}) + \\tilde{O}(1)$ iterations where $L$ is the Lipschitz constant of the Hessian, $\\Delta_f$ is the optimality gap, and $\\epsilon$ is the termination tolerance for the gradient norm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02079","kind":"arxiv","version":3},"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/2412.02079/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:59:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86OnzqA7KuqOvaVxKRL8UJHyznW1trh4y4DNPsm4IGBkNFgoVSpmCoBcbBRcVReRQlzKuAUQ0E1Su3Ybry0eBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:32:54.469396Z"},"content_sha256":"8ba03dded994c77830bec8a7a24375404898c88aae9ce208a851912dcd9091b8","schema_version":"1.0","event_id":"sha256:8ba03dded994c77830bec8a7a24375404898c88aae9ce208a851912dcd9091b8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6RYOOUAS3TF42RJTR33MGTEJMS/bundle.json","state_url":"https://pith.science/pith/6RYOOUAS3TF42RJTR33MGTEJMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6RYOOUAS3TF42RJTR33MGTEJMS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T23:32:54Z","links":{"resolver":"https://pith.science/pith/6RYOOUAS3TF42RJTR33MGTEJMS","bundle":"https://pith.science/pith/6RYOOUAS3TF42RJTR33MGTEJMS/bundle.json","state":"https://pith.science/pith/6RYOOUAS3TF42RJTR33MGTEJMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6RYOOUAS3TF42RJTR33MGTEJMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:6RYOOUAS3TF42RJTR33MGTEJMS","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":"08b5a554e3189b699fe33fb4153697b53dd04c5db7e3f52950bdc714d3fcb860","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-03T01:48:27Z","title_canon_sha256":"cd21c20ec19b8c5888fb8ee6dad020e282ec124a076d71cf8ba8d44182a3d409"},"schema_version":"1.0","source":{"id":"2412.02079","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.02079","created_at":"2026-07-05T11:59:09Z"},{"alias_kind":"arxiv_version","alias_value":"2412.02079v3","created_at":"2026-07-05T11:59:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.02079","created_at":"2026-07-05T11:59:09Z"},{"alias_kind":"pith_short_12","alias_value":"6RYOOUAS3TF4","created_at":"2026-07-05T11:59:09Z"},{"alias_kind":"pith_short_16","alias_value":"6RYOOUAS3TF42RJT","created_at":"2026-07-05T11:59:09Z"},{"alias_kind":"pith_short_8","alias_value":"6RYOOUAS","created_at":"2026-07-05T11:59:09Z"}],"graph_snapshots":[{"event_id":"sha256:8ba03dded994c77830bec8a7a24375404898c88aae9ce208a851912dcd9091b8","target":"graph","created_at":"2026-07-05T11:59:09Z","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/2412.02079/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present an adaptive trust-region method for unconstrained optimization that allows inexact solutions to the trust-region subproblems. Our method is a simple variant of the classical trust-region method of \\citet{sorensen1982newton}. The method achieves the best possible convergence bound up to an additive log factor, for finding an $\\epsilon$-approximate stationary point, i.e., $O( \\Delta_f L^{1/2} \\epsilon^{-3/2}) + \\tilde{O}(1)$ iterations where $L$ is the Lipschitz constant of the Hessian, $\\Delta_f$ is the optimality gap, and $\\epsilon$ is the termination tolerance for the gradient norm","authors_text":"Fadi Hamad, Oliver Hinder","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-03T01:48:27Z","title":"A simple and practical adaptive trust-region method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.02079","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:19ace1419841141b0a89944e9299a6da9b7b0b4a1fc0bf94bbfbdceaa4569fbc","target":"record","created_at":"2026-07-05T11:59:09Z","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":"08b5a554e3189b699fe33fb4153697b53dd04c5db7e3f52950bdc714d3fcb860","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-12-03T01:48:27Z","title_canon_sha256":"cd21c20ec19b8c5888fb8ee6dad020e282ec124a076d71cf8ba8d44182a3d409"},"schema_version":"1.0","source":{"id":"2412.02079","kind":"arxiv","version":3}},"canonical_sha256":"f470e75012dccbcd45338ef6c34c896498b2ea85a55a9ffc35553501286f700a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f470e75012dccbcd45338ef6c34c896498b2ea85a55a9ffc35553501286f700a","first_computed_at":"2026-07-05T11:59:09.549495Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:59:09.549495Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"L+NuA4I2a9M+beR+Dfs36jANI7KKoyAG6iikX1V/wzxZiKZIXBSV85hwJDHhRTbYfAP5sYJ7s/S0JhlbGDt6AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:59:09.549968Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.02079","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19ace1419841141b0a89944e9299a6da9b7b0b4a1fc0bf94bbfbdceaa4569fbc","sha256:8ba03dded994c77830bec8a7a24375404898c88aae9ce208a851912dcd9091b8"],"state_sha256":"4b510a71ccaed95596655cdf86741b6e035b848e2feaf30df3377f68bdf10cae"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wO2fzDvykvWX4Eb2mUpZiSPr6Wc6cYvR1iwE3AJ57tWmH6RPqOw/T+g4R/qKhS4D3lRkxGzk2IO76I5mIxewDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T23:32:54.474678Z","bundle_sha256":"b0e1462641585c324ece64ade6fa75c316a6e35cb2438ccd719a57fbd2604102"}}