{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4K5UPIWJBELXKWX2QOVZV4MBOR","short_pith_number":"pith:4K5UPIWJ","schema_version":"1.0","canonical_sha256":"e2bb47a2c90917755afa83ab9af181744972b22a14b04c936be9a3d76be1ea1b","source":{"kind":"arxiv","id":"2509.08256","version":1},"attestation_state":"computed","paper":{"title":"Model-Driven Subspaces for Large-Scale Optimization with Local Approximation Strategy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Pengcheng Xie, Yitong He","submitted_at":"2025-09-10T03:25:56Z","abstract_excerpt":"Solving large-scale optimization problems is a bottleneck and is very important for machine learning and multiple kinds of scientific problems. Subspace-based methods using the local approximation strategy are one of the most important methods. This paper discusses different and novel kinds of advanced subspaces for such methods and presents a new algorithm with such subspaces, called MD-LAMBO. Theoretical analysis including the subspaces' properties, sufficient function value decrease, and global convergence is given for the new algorithm. The related model construction on the subspaces is gi"},"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":"2509.08256","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2025-09-10T03:25:56Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"7da2b09a1163a7c6207c3fca9bd78be4c8d953a7a43e1957809507e9e193fb78","abstract_canon_sha256":"372e10316bf0ca06f0bd1615bb4df55524f96d7ced8fdaca0ddef2c940d740a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:08:26.243757Z","signature_b64":"srh9oeZjKJYRwAv9ZZJSXlEB1+MAjStZJPUobsgxn8Q7eOa3DRan6crtcUQOTxnGU0qse2hvigd5QzffL8q4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2bb47a2c90917755afa83ab9af181744972b22a14b04c936be9a3d76be1ea1b","last_reissued_at":"2026-07-05T12:08:26.243100Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:08:26.243100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model-Driven Subspaces for Large-Scale Optimization with Local Approximation Strategy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"math.OC","authors_text":"Pengcheng Xie, Yitong He","submitted_at":"2025-09-10T03:25:56Z","abstract_excerpt":"Solving large-scale optimization problems is a bottleneck and is very important for machine learning and multiple kinds of scientific problems. Subspace-based methods using the local approximation strategy are one of the most important methods. This paper discusses different and novel kinds of advanced subspaces for such methods and presents a new algorithm with such subspaces, called MD-LAMBO. Theoretical analysis including the subspaces' properties, sufficient function value decrease, and global convergence is given for the new algorithm. The related model construction on the subspaces is gi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08256","kind":"arxiv","version":1},"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/2509.08256/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":"2509.08256","created_at":"2026-07-05T12:08:26.243188+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.08256v1","created_at":"2026-07-05T12:08:26.243188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08256","created_at":"2026-07-05T12:08:26.243188+00:00"},{"alias_kind":"pith_short_12","alias_value":"4K5UPIWJBELX","created_at":"2026-07-05T12:08:26.243188+00:00"},{"alias_kind":"pith_short_16","alias_value":"4K5UPIWJBELXKWX2","created_at":"2026-07-05T12:08:26.243188+00:00"},{"alias_kind":"pith_short_8","alias_value":"4K5UPIWJ","created_at":"2026-07-05T12:08:26.243188+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.19396","citing_title":"Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4K5UPIWJBELXKWX2QOVZV4MBOR","json":"https://pith.science/pith/4K5UPIWJBELXKWX2QOVZV4MBOR.json","graph_json":"https://pith.science/api/pith-number/4K5UPIWJBELXKWX2QOVZV4MBOR/graph.json","events_json":"https://pith.science/api/pith-number/4K5UPIWJBELXKWX2QOVZV4MBOR/events.json","paper":"https://pith.science/paper/4K5UPIWJ"},"agent_actions":{"view_html":"https://pith.science/pith/4K5UPIWJBELXKWX2QOVZV4MBOR","download_json":"https://pith.science/pith/4K5UPIWJBELXKWX2QOVZV4MBOR.json","view_paper":"https://pith.science/paper/4K5UPIWJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.08256&json=true","fetch_graph":"https://pith.science/api/pith-number/4K5UPIWJBELXKWX2QOVZV4MBOR/graph.json","fetch_events":"https://pith.science/api/pith-number/4K5UPIWJBELXKWX2QOVZV4MBOR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4K5UPIWJBELXKWX2QOVZV4MBOR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4K5UPIWJBELXKWX2QOVZV4MBOR/action/storage_attestation","attest_author":"https://pith.science/pith/4K5UPIWJBELXKWX2QOVZV4MBOR/action/author_attestation","sign_citation":"https://pith.science/pith/4K5UPIWJBELXKWX2QOVZV4MBOR/action/citation_signature","submit_replication":"https://pith.science/pith/4K5UPIWJBELXKWX2QOVZV4MBOR/action/replication_record"}},"created_at":"2026-07-05T12:08:26.243188+00:00","updated_at":"2026-07-05T12:08:26.243188+00:00"}