{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:EVSRTUIPDK7ISXM3ERPKW7NNOH","short_pith_number":"pith:EVSRTUIP","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"},"canonical_sha256":"256519d10f1abe895d9b245eab7dad71cf967266726fc03d77c1f26df65f77bb","source":{"kind":"arxiv","id":"2506.20335","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.20335","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"2506.20335v2","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20335","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"EVSRTUIPDK7I","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"EVSRTUIPDK7ISXM3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"EVSRTUIP","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:EVSRTUIPDK7ISXM3ERPKW7NNOH","target":"record","payload":{"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"},"canonical_sha256":"256519d10f1abe895d9b245eab7dad71cf967266726fc03d77c1f26df65f77bb","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"},"source_kind":"arxiv","source_id":"2506.20335","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vva/I3eYBd8v7jCt7WrMtclKQMOEO7o8eKEYOQfn2KN+oSTU/LPeFQtZafkX5uHg7e+I23ejEzmHHaGG1OMUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:22:47.778962Z"},"content_sha256":"f2a92e56f8d8bb2a565f5db78451f0a269b9a1a0c164b40a7ca0ade388c28ef6","schema_version":"1.0","event_id":"sha256:f2a92e56f8d8bb2a565f5db78451f0a269b9a1a0c164b40a7ca0ade388c28ef6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:EVSRTUIPDK7ISXM3ERPKW7NNOH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gC7ioDEKt0M5Ktl3o5Qk/ZlX6Z23P7qOjlptvjOKLpeUXzY+V8/Zs2ZK3qqFS339dLMLjN2UbKWYiF9r/wGzDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T18:22:47.779342Z"},"content_sha256":"14348072f32dd6ee29c3cf41a65412beebf121ddb3d20ff8cb096c4f062c27db","schema_version":"1.0","event_id":"sha256:14348072f32dd6ee29c3cf41a65412beebf121ddb3d20ff8cb096c4f062c27db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EVSRTUIPDK7ISXM3ERPKW7NNOH/bundle.json","state_url":"https://pith.science/pith/EVSRTUIPDK7ISXM3ERPKW7NNOH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EVSRTUIPDK7ISXM3ERPKW7NNOH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-21T18:22:47Z","links":{"resolver":"https://pith.science/pith/EVSRTUIPDK7ISXM3ERPKW7NNOH","bundle":"https://pith.science/pith/EVSRTUIPDK7ISXM3ERPKW7NNOH/bundle.json","state":"https://pith.science/pith/EVSRTUIPDK7ISXM3ERPKW7NNOH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EVSRTUIPDK7ISXM3ERPKW7NNOH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:EVSRTUIPDK7ISXM3ERPKW7NNOH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cb41fc29fa0fbbc768f0df13520fcd81223e8fda1983bd01310204499aaaf194","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-25T11:44:32Z","title_canon_sha256":"393ebe88d24f4d4742b9e88c81090e9e4befba82c7ae3ee589a6c2f6d38bbbfd"},"schema_version":"1.0","source":{"id":"2506.20335","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.20335","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"2506.20335v2","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.20335","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"EVSRTUIPDK7I","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"EVSRTUIPDK7ISXM3","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"EVSRTUIP","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:14348072f32dd6ee29c3cf41a65412beebf121ddb3d20ff8cb096c4f062c27db","target":"graph","created_at":"2026-05-18T03:10:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Amy Wiebe, Warren Hare, Yiwen Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-25T11:44:32Z","title":"CLARSTA: A random subspace trust-region algorithm for convex-constrained derivative-free optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.20335","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f2a92e56f8d8bb2a565f5db78451f0a269b9a1a0c164b40a7ca0ade388c28ef6","target":"record","created_at":"2026-05-18T03:10:12Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cb41fc29fa0fbbc768f0df13520fcd81223e8fda1983bd01310204499aaaf194","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-06-25T11:44:32Z","title_canon_sha256":"393ebe88d24f4d4742b9e88c81090e9e4befba82c7ae3ee589a6c2f6d38bbbfd"},"schema_version":"1.0","source":{"id":"2506.20335","kind":"arxiv","version":2}},"canonical_sha256":"256519d10f1abe895d9b245eab7dad71cf967266726fc03d77c1f26df65f77bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"256519d10f1abe895d9b245eab7dad71cf967266726fc03d77c1f26df65f77bb","first_computed_at":"2026-05-18T03:10:12.519492Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:12.519492Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LhvvVhXWVET/Fi0iFMfLjH1m5IDRgYzi8TDMZS9Z+JXB+7iMI5W/zj1SFUzc7FEdS1h3xdP0Eln3iySx7jDUBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:12.519992Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.20335","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2a92e56f8d8bb2a565f5db78451f0a269b9a1a0c164b40a7ca0ade388c28ef6","sha256:14348072f32dd6ee29c3cf41a65412beebf121ddb3d20ff8cb096c4f062c27db"],"state_sha256":"4aa26c0af807fe7790583cfdf43fe05ccdfe37de3939cb86b7048fa4dd965fbd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUQjgvKlS45kcrrqaq9/Rr7DOFCDr9XiMAqXOIus6IZTI2GFmZ/7X1juSSnftuzZBoORYtiP9FkAUt2/rnwiDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T18:22:47.781680Z","bundle_sha256":"716c645a62878653d32cc59e79c5fa147ca257fbd5e398f46af95602950241f5"}}