{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EVSRTUIPDK7ISXM3ERPKW7NNOH","short_pith_number":"pith:EVSRTUIP","schema_version":"1.0","canonical_sha256":"256519d10f1abe895d9b245eab7dad71cf967266726fc03d77c1f26df65f77bb","source":{"kind":"arxiv","id":"2506.20335","version":2},"attestation_state":"computed","paper":{"title":"CLARSTA: A random subspace trust-region algorithm for convex-constrained derivative-free optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amy Wiebe, Warren Hare, Yiwen Chen","submitted_at":"2025-06-25T11:44:32Z","abstract_excerpt":"This paper proposes a random subspace trust-region algorithm for general convex-constrained derivative-free optimization (DFO) problems. Similar to previous random subspace DFO methods, the convergence of our algorithm requires a certain accuracy of models and a certain quality of subspaces. For model accuracy, we define a new class of models that is only required to provide reasonable accuracy on the projection of the constraint set onto the subspace. We provide a new geometry measure to make these models easy to analyze, construct, and manage. For subspace quality, we use the concentration o"},"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.20335","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-25T11:44:32Z","cross_cats_sorted":[],"title_canon_sha256":"393ebe88d24f4d4742b9e88c81090e9e4befba82c7ae3ee589a6c2f6d38bbbfd","abstract_canon_sha256":"cb41fc29fa0fbbc768f0df13520fcd81223e8fda1983bd01310204499aaaf194"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:12.519992Z","signature_b64":"LhvvVhXWVET/Fi0iFMfLjH1m5IDRgYzi8TDMZS9Z+JXB+7iMI5W/zj1SFUzc7FEdS1h3xdP0Eln3iySx7jDUBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"256519d10f1abe895d9b245eab7dad71cf967266726fc03d77c1f26df65f77bb","last_reissued_at":"2026-05-18T03:10:12.519492Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:12.519492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CLARSTA: A random subspace trust-region algorithm for convex-constrained derivative-free optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Amy Wiebe, Warren Hare, Yiwen Chen","submitted_at":"2025-06-25T11:44:32Z","abstract_excerpt":"This paper proposes a random subspace trust-region algorithm for general convex-constrained derivative-free optimization (DFO) problems. Similar to previous random subspace DFO methods, the convergence of our algorithm requires a certain accuracy of models and a certain quality of subspaces. For model accuracy, we define a new class of models that is only required to provide reasonable accuracy on the projection of the constraint set onto the subspace. We provide a new geometry measure to make these models easy to analyze, construct, and manage. For subspace quality, we use the concentration o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.20335","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":""},"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.20335","created_at":"2026-05-18T03:10:12.519568+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.20335v2","created_at":"2026-05-18T03:10:12.519568+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20335","created_at":"2026-05-18T03:10:12.519568+00:00"},{"alias_kind":"pith_short_12","alias_value":"EVSRTUIPDK7I","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"EVSRTUIPDK7ISXM3","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"EVSRTUIP","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.12819","citing_title":"Accuracy and Relationships of Quadratic Models in Derivative-free Optimization","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EVSRTUIPDK7ISXM3ERPKW7NNOH","json":"https://pith.science/pith/EVSRTUIPDK7ISXM3ERPKW7NNOH.json","graph_json":"https://pith.science/api/pith-number/EVSRTUIPDK7ISXM3ERPKW7NNOH/graph.json","events_json":"https://pith.science/api/pith-number/EVSRTUIPDK7ISXM3ERPKW7NNOH/events.json","paper":"https://pith.science/paper/EVSRTUIP"},"agent_actions":{"view_html":"https://pith.science/pith/EVSRTUIPDK7ISXM3ERPKW7NNOH","download_json":"https://pith.science/pith/EVSRTUIPDK7ISXM3ERPKW7NNOH.json","view_paper":"https://pith.science/paper/EVSRTUIP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.20335&json=true","fetch_graph":"https://pith.science/api/pith-number/EVSRTUIPDK7ISXM3ERPKW7NNOH/graph.json","fetch_events":"https://pith.science/api/pith-number/EVSRTUIPDK7ISXM3ERPKW7NNOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EVSRTUIPDK7ISXM3ERPKW7NNOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EVSRTUIPDK7ISXM3ERPKW7NNOH/action/storage_attestation","attest_author":"https://pith.science/pith/EVSRTUIPDK7ISXM3ERPKW7NNOH/action/author_attestation","sign_citation":"https://pith.science/pith/EVSRTUIPDK7ISXM3ERPKW7NNOH/action/citation_signature","submit_replication":"https://pith.science/pith/EVSRTUIPDK7ISXM3ERPKW7NNOH/action/replication_record"}},"created_at":"2026-05-18T03:10:12.519568+00:00","updated_at":"2026-05-18T03:10:12.519568+00:00"}