{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XJHOKGX57ZOL7WRBNT4LCJVTRT","short_pith_number":"pith:XJHOKGX5","schema_version":"1.0","canonical_sha256":"ba4ee51afdfe5cbfda216cf8b126b38cca9675920edd15053d77b792ed8200eb","source":{"kind":"arxiv","id":"2506.21948","version":2},"attestation_state":"computed","paper":{"title":"A Model-Based Derivative-Free Optimization Algorithm for Partially Separable Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Yichuan Liu, Yingzhou Li","submitted_at":"2025-06-27T06:42:37Z","abstract_excerpt":"We propose UPOQA, a derivative-free optimization algorithm for partially separable unconstrained problems, leveraging quadratic interpolation and a structured trust-region framework. By decomposing the objective into element functions, UPOQA constructs underdetermined element models and solves subproblems efficiently via a modified projected gradient method. Innovations include an approximate projection operator for structured trust regions, improved management of elemental radii and models, a starting point search mechanism, and support for hybrid black-white-box optimization, etc. Numerical "},"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":"2506.21948","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-06-27T06:42:37Z","cross_cats_sorted":[],"title_canon_sha256":"fc4978ad4bc12fe158fbcf2c6bcb4654796c48fb739ffcd98578f67a8c3233ba","abstract_canon_sha256":"ac0743c8b87c8c2d608cfb173bbe4782bc5dabbe5a589f36550d169bf1d8bafd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:04.780770Z","signature_b64":"E9+8vvMNU2WwOVmFhgAYG+b05EC/j412/ooj1nEY4oOBP2/ci8AJJ22SPpTwDhDHVoDJSFc44iWW9rK7B+VTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba4ee51afdfe5cbfda216cf8b126b38cca9675920edd15053d77b792ed8200eb","last_reissued_at":"2026-07-05T11:53:04.780334Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:04.780334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Model-Based Derivative-Free Optimization Algorithm for Partially Separable Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Yichuan Liu, Yingzhou Li","submitted_at":"2025-06-27T06:42:37Z","abstract_excerpt":"We propose UPOQA, a derivative-free optimization algorithm for partially separable unconstrained problems, leveraging quadratic interpolation and a structured trust-region framework. By decomposing the objective into element functions, UPOQA constructs underdetermined element models and solves subproblems efficiently via a modified projected gradient method. Innovations include an approximate projection operator for structured trust regions, improved management of elemental radii and models, a starting point search mechanism, and support for hybrid black-white-box optimization, etc. Numerical "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.21948","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/2506.21948/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":"2506.21948","created_at":"2026-07-05T11:53:04.780392+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.21948v2","created_at":"2026-07-05T11:53:04.780392+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.21948","created_at":"2026-07-05T11:53:04.780392+00:00"},{"alias_kind":"pith_short_12","alias_value":"XJHOKGX57ZOL","created_at":"2026-07-05T11:53:04.780392+00:00"},{"alias_kind":"pith_short_16","alias_value":"XJHOKGX57ZOL7WRB","created_at":"2026-07-05T11:53:04.780392+00:00"},{"alias_kind":"pith_short_8","alias_value":"XJHOKGX5","created_at":"2026-07-05T11:53:04.780392+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.05183","citing_title":"Adaptive direct search algorithms with relaxable and quantifiable constraints","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XJHOKGX57ZOL7WRBNT4LCJVTRT","json":"https://pith.science/pith/XJHOKGX57ZOL7WRBNT4LCJVTRT.json","graph_json":"https://pith.science/api/pith-number/XJHOKGX57ZOL7WRBNT4LCJVTRT/graph.json","events_json":"https://pith.science/api/pith-number/XJHOKGX57ZOL7WRBNT4LCJVTRT/events.json","paper":"https://pith.science/paper/XJHOKGX5"},"agent_actions":{"view_html":"https://pith.science/pith/XJHOKGX57ZOL7WRBNT4LCJVTRT","download_json":"https://pith.science/pith/XJHOKGX57ZOL7WRBNT4LCJVTRT.json","view_paper":"https://pith.science/paper/XJHOKGX5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.21948&json=true","fetch_graph":"https://pith.science/api/pith-number/XJHOKGX57ZOL7WRBNT4LCJVTRT/graph.json","fetch_events":"https://pith.science/api/pith-number/XJHOKGX57ZOL7WRBNT4LCJVTRT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XJHOKGX57ZOL7WRBNT4LCJVTRT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XJHOKGX57ZOL7WRBNT4LCJVTRT/action/storage_attestation","attest_author":"https://pith.science/pith/XJHOKGX57ZOL7WRBNT4LCJVTRT/action/author_attestation","sign_citation":"https://pith.science/pith/XJHOKGX57ZOL7WRBNT4LCJVTRT/action/citation_signature","submit_replication":"https://pith.science/pith/XJHOKGX57ZOL7WRBNT4LCJVTRT/action/replication_record"}},"created_at":"2026-07-05T11:53:04.780392+00:00","updated_at":"2026-07-05T11:53:04.780392+00:00"}