{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2HUOAODLMQ2BE76XABJFLBHOVZ","short_pith_number":"pith:2HUOAODL","schema_version":"1.0","canonical_sha256":"d1e8e0386b6434127fd700525584eeae5da06de6608a57c1cce07229771ed84a","source":{"kind":"arxiv","id":"2309.14855","version":3},"attestation_state":"computed","paper":{"title":"A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Pengcheng Xie, Ya-Xiang Yuan","submitted_at":"2023-09-26T11:33:00Z","abstract_excerpt":"This paper proposes the method 2D-MoSub (2-dimensional model-based subspace method), which is a novel derivative-free optimization (DFO) method based on the subspace method for general unconstrained optimization and especially aims to solve large-scale DFO problems. Our method combines 2-dimensional quadratic interpolation models and trust-region techniques to iteratively update the points and explore the 2-dimensional subspace. Its framework includes initialization, constructing the interpolation set, building the quadratic interpolation model, performing trust-region trial steps, and updatin"},"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":"2309.14855","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-09-26T11:33:00Z","cross_cats_sorted":[],"title_canon_sha256":"3e6d0377b927cfcf3139c9d482a66d67c68a1b4f2be40d27934e2ca1219e23e9","abstract_canon_sha256":"a4dd2c453aa945eb4d11c4eb59a8101e5f66f5500f6bd9541224d261280be838"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:29:28.648973Z","signature_b64":"YuqMmVzaEoAyIVue2Ha1QCR7m1awNmKxA6outoN7qGEEwWPGsnsMcfvqEbVRioBkDm0nz2f9FqaqwEYRlJbMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1e8e0386b6434127fd700525584eeae5da06de6608a57c1cce07229771ed84a","last_reissued_at":"2026-07-05T07:29:28.648529Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:29:28.648529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Pengcheng Xie, Ya-Xiang Yuan","submitted_at":"2023-09-26T11:33:00Z","abstract_excerpt":"This paper proposes the method 2D-MoSub (2-dimensional model-based subspace method), which is a novel derivative-free optimization (DFO) method based on the subspace method for general unconstrained optimization and especially aims to solve large-scale DFO problems. Our method combines 2-dimensional quadratic interpolation models and trust-region techniques to iteratively update the points and explore the 2-dimensional subspace. Its framework includes initialization, constructing the interpolation set, building the quadratic interpolation model, performing trust-region trial steps, and updatin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.14855","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/2309.14855/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":"2309.14855","created_at":"2026-07-05T07:29:28.648585+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.14855v3","created_at":"2026-07-05T07:29:28.648585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.14855","created_at":"2026-07-05T07:29:28.648585+00:00"},{"alias_kind":"pith_short_12","alias_value":"2HUOAODLMQ2B","created_at":"2026-07-05T07:29:28.648585+00:00"},{"alias_kind":"pith_short_16","alias_value":"2HUOAODLMQ2BE76X","created_at":"2026-07-05T07:29:28.648585+00:00"},{"alias_kind":"pith_short_8","alias_value":"2HUOAODL","created_at":"2026-07-05T07:29:28.648585+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.08256","citing_title":"Model-Driven Subspaces for Large-Scale Optimization with Local Approximation Strategy","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2HUOAODLMQ2BE76XABJFLBHOVZ","json":"https://pith.science/pith/2HUOAODLMQ2BE76XABJFLBHOVZ.json","graph_json":"https://pith.science/api/pith-number/2HUOAODLMQ2BE76XABJFLBHOVZ/graph.json","events_json":"https://pith.science/api/pith-number/2HUOAODLMQ2BE76XABJFLBHOVZ/events.json","paper":"https://pith.science/paper/2HUOAODL"},"agent_actions":{"view_html":"https://pith.science/pith/2HUOAODLMQ2BE76XABJFLBHOVZ","download_json":"https://pith.science/pith/2HUOAODLMQ2BE76XABJFLBHOVZ.json","view_paper":"https://pith.science/paper/2HUOAODL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.14855&json=true","fetch_graph":"https://pith.science/api/pith-number/2HUOAODLMQ2BE76XABJFLBHOVZ/graph.json","fetch_events":"https://pith.science/api/pith-number/2HUOAODLMQ2BE76XABJFLBHOVZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2HUOAODLMQ2BE76XABJFLBHOVZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2HUOAODLMQ2BE76XABJFLBHOVZ/action/storage_attestation","attest_author":"https://pith.science/pith/2HUOAODLMQ2BE76XABJFLBHOVZ/action/author_attestation","sign_citation":"https://pith.science/pith/2HUOAODLMQ2BE76XABJFLBHOVZ/action/citation_signature","submit_replication":"https://pith.science/pith/2HUOAODLMQ2BE76XABJFLBHOVZ/action/replication_record"}},"created_at":"2026-07-05T07:29:28.648585+00:00","updated_at":"2026-07-05T07:29:28.648585+00:00"}