{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:K2LOSZNAWXYOPOH4WYPPFN3FTQ","short_pith_number":"pith:K2LOSZNA","schema_version":"1.0","canonical_sha256":"5696e965a0b5f0e7b8fcb61ef2b7659c13a56ef45adcdfd956e51a0e49af34d7","source":{"kind":"arxiv","id":"2510.17366","version":2},"attestation_state":"computed","paper":{"title":"A Finite-Difference Trust-Region Method for Convexly Constrained Smooth Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"D\\^an\\^a Davar, Geovani Nunes Grapiglia","submitted_at":"2025-10-20T10:05:21Z","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"},"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":"2510.17366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-10-20T10:05:21Z","cross_cats_sorted":[],"title_canon_sha256":"1694ec572662a3465a21a4d2314a42140891facd8c3a5c7bb496771de4e214e3","abstract_canon_sha256":"80fc9e6f9bba837b9b585cda63aec284b7483d8c34cca1f96b3d87eda03ad0f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:17:42.257678Z","signature_b64":"Drsg0UMAHlGwcLSwqhUZ1Ehwql2nKY9kznnLAtHFgmuRDd5bP5TN12N2eesHRocqcMKJJ4baO0F8EFz6Gb2IDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5696e965a0b5f0e7b8fcb61ef2b7659c13a56ef45adcdfd956e51a0e49af34d7","last_reissued_at":"2026-07-01T01:17:42.257197Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:17:42.257197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Finite-Difference Trust-Region Method for Convexly Constrained Smooth Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"D\\^an\\^a Davar, Geovani Nunes Grapiglia","submitted_at":"2025-10-20T10:05:21Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.17366","kind":"arxiv","version":2},"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/2510.17366/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":"2510.17366","created_at":"2026-07-01T01:17:42.257258+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.17366v2","created_at":"2026-07-01T01:17:42.257258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.17366","created_at":"2026-07-01T01:17:42.257258+00:00"},{"alias_kind":"pith_short_12","alias_value":"K2LOSZNAWXYO","created_at":"2026-07-01T01:17:42.257258+00:00"},{"alias_kind":"pith_short_16","alias_value":"K2LOSZNAWXYOPOH4","created_at":"2026-07-01T01:17:42.257258+00:00"},{"alias_kind":"pith_short_8","alias_value":"K2LOSZNA","created_at":"2026-07-01T01:17:42.257258+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/K2LOSZNAWXYOPOH4WYPPFN3FTQ","json":"https://pith.science/pith/K2LOSZNAWXYOPOH4WYPPFN3FTQ.json","graph_json":"https://pith.science/api/pith-number/K2LOSZNAWXYOPOH4WYPPFN3FTQ/graph.json","events_json":"https://pith.science/api/pith-number/K2LOSZNAWXYOPOH4WYPPFN3FTQ/events.json","paper":"https://pith.science/paper/K2LOSZNA"},"agent_actions":{"view_html":"https://pith.science/pith/K2LOSZNAWXYOPOH4WYPPFN3FTQ","download_json":"https://pith.science/pith/K2LOSZNAWXYOPOH4WYPPFN3FTQ.json","view_paper":"https://pith.science/paper/K2LOSZNA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.17366&json=true","fetch_graph":"https://pith.science/api/pith-number/K2LOSZNAWXYOPOH4WYPPFN3FTQ/graph.json","fetch_events":"https://pith.science/api/pith-number/K2LOSZNAWXYOPOH4WYPPFN3FTQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K2LOSZNAWXYOPOH4WYPPFN3FTQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K2LOSZNAWXYOPOH4WYPPFN3FTQ/action/storage_attestation","attest_author":"https://pith.science/pith/K2LOSZNAWXYOPOH4WYPPFN3FTQ/action/author_attestation","sign_citation":"https://pith.science/pith/K2LOSZNAWXYOPOH4WYPPFN3FTQ/action/citation_signature","submit_replication":"https://pith.science/pith/K2LOSZNAWXYOPOH4WYPPFN3FTQ/action/replication_record"}},"created_at":"2026-07-01T01:17:42.257258+00:00","updated_at":"2026-07-01T01:17:42.257258+00:00"}