{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:K2LOSZNAWXYOPOH4WYPPFN3FTQ","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":"80fc9e6f9bba837b9b585cda63aec284b7483d8c34cca1f96b3d87eda03ad0f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-10-20T10:05:21Z","title_canon_sha256":"1694ec572662a3465a21a4d2314a42140891facd8c3a5c7bb496771de4e214e3"},"schema_version":"1.0","source":{"id":"2510.17366","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2510.17366","created_at":"2026-07-01T01:17:42Z"},{"alias_kind":"arxiv_version","alias_value":"2510.17366v2","created_at":"2026-07-01T01:17:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.17366","created_at":"2026-07-01T01:17:42Z"},{"alias_kind":"pith_short_12","alias_value":"K2LOSZNAWXYO","created_at":"2026-07-01T01:17:42Z"},{"alias_kind":"pith_short_16","alias_value":"K2LOSZNAWXYOPOH4","created_at":"2026-07-01T01:17:42Z"},{"alias_kind":"pith_short_8","alias_value":"K2LOSZNA","created_at":"2026-07-01T01:17:42Z"}],"graph_snapshots":[{"event_id":"sha256:262206a81072464cecf2a970d5d7ad1c912cbc1b0399b1deb63e5d50a596bec5","target":"graph","created_at":"2026-07-01T01:17:42Z","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/2510.17366/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We propose a derivative-free trust-region method based on finite-difference gradient approximations for smooth optimization problems with convex constraints. For nonconvex problems, we establish a worst-case complexity bound of $\\mathcal{O}\\!\\left(n\\left(\\frac{L}{\\sigma}\\epsilon\\right)^{-2}\\right)$ function evaluations for the method to reach an $\\left(\\frac{L}{\\sigma}\\epsilon\\right)$-approximate stationary point, where $n$ is the number of variables, $L$ is the Lipschitz constant of the gradient, and $\\sigma$ is a user-defined estimate of $L$. If the objective function is convex, the complexi","authors_text":"D\\^an\\^a Davar, Geovani Nunes Grapiglia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-10-20T10:05:21Z","title":"A Finite-Difference Trust-Region Method for Convexly Constrained Smooth Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.17366","kind":"arxiv","version":2},"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:b0cb76b86678648f535adb7070b2ad17224b74b7d4b1556718ab40e1e1cd9487","target":"record","created_at":"2026-07-01T01:17:42Z","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":"80fc9e6f9bba837b9b585cda63aec284b7483d8c34cca1f96b3d87eda03ad0f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-10-20T10:05:21Z","title_canon_sha256":"1694ec572662a3465a21a4d2314a42140891facd8c3a5c7bb496771de4e214e3"},"schema_version":"1.0","source":{"id":"2510.17366","kind":"arxiv","version":2}},"canonical_sha256":"5696e965a0b5f0e7b8fcb61ef2b7659c13a56ef45adcdfd956e51a0e49af34d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5696e965a0b5f0e7b8fcb61ef2b7659c13a56ef45adcdfd956e51a0e49af34d7","first_computed_at":"2026-07-01T01:17:42.257197Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-01T01:17:42.257197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Drsg0UMAHlGwcLSwqhUZ1Ehwql2nKY9kznnLAtHFgmuRDd5bP5TN12N2eesHRocqcMKJJ4baO0F8EFz6Gb2IDQ==","signature_status":"signed_v1","signed_at":"2026-07-01T01:17:42.257678Z","signed_message":"canonical_sha256_bytes"},"source_id":"2510.17366","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0cb76b86678648f535adb7070b2ad17224b74b7d4b1556718ab40e1e1cd9487","sha256:262206a81072464cecf2a970d5d7ad1c912cbc1b0399b1deb63e5d50a596bec5"],"state_sha256":"91c4c95564f0f1359f57560b2ce95800194c113cbf14a9a962df8f738b99009c"}