{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:IPOHHNNLZWJKNEKUXD7BMLPSPY","short_pith_number":"pith:IPOHHNNL","schema_version":"1.0","canonical_sha256":"43dc73b5abcd92a69154b8fe162df27e37b873eb5455678d3f55301da1e78d3c","source":{"kind":"arxiv","id":"2605.27837","version":1},"attestation_state":"computed","paper":{"title":"Optimal Spectral Design with Prior Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anton J. Kleywegt, Johannes Milz, Mohit Singh, Weijun Xie","submitted_at":"2026-05-27T01:50:29Z","abstract_excerpt":"We study a class of spectral design problems in which a prior positive semidefinite information matrix is updated by a sum of rank-one matrices constructed from chosen design vectors subject to a bound on their Euclidean norm. The objective of a spectral design problem is any symmetric convex function of the eigenvalues of the updated information matrix. This framework unifies classical optimal experimental design criteria, including A-, D-, and E-optimality. It also arises in model-based derivative-free optimization, where sampling directions determine the conditioning and accuracy of regress"},"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":"2605.27837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-27T01:50:29Z","cross_cats_sorted":[],"title_canon_sha256":"f163d28a7affd10166adfea8e2be8bf5a40dba899158103f5a2c427b2b216604","abstract_canon_sha256":"01341e0c75579e121c98b6e63b3083ec5772615c7558e5564439feb71f80524d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T01:04:50.007887Z","signature_b64":"JgRhuipyCtIvkJx9Q8OBTJQfEn2Xa7gzGiQuUrWrFF6keSB2MUJFox2vbNIJ93Qq5ysSOg7Wjw0TOv+x62IVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43dc73b5abcd92a69154b8fe162df27e37b873eb5455678d3f55301da1e78d3c","last_reissued_at":"2026-05-28T01:04:50.007551Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T01:04:50.007551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Spectral Design with Prior Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anton J. Kleywegt, Johannes Milz, Mohit Singh, Weijun Xie","submitted_at":"2026-05-27T01:50:29Z","abstract_excerpt":"We study a class of spectral design problems in which a prior positive semidefinite information matrix is updated by a sum of rank-one matrices constructed from chosen design vectors subject to a bound on their Euclidean norm. The objective of a spectral design problem is any symmetric convex function of the eigenvalues of the updated information matrix. This framework unifies classical optimal experimental design criteria, including A-, D-, and E-optimality. It also arises in model-based derivative-free optimization, where sampling directions determine the conditioning and accuracy of regress"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.27837","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/2605.27837/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":"2605.27837","created_at":"2026-05-28T01:04:50.007607+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.27837v1","created_at":"2026-05-28T01:04:50.007607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.27837","created_at":"2026-05-28T01:04:50.007607+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPOHHNNLZWJK","created_at":"2026-05-28T01:04:50.007607+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPOHHNNLZWJKNEKU","created_at":"2026-05-28T01:04:50.007607+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPOHHNNL","created_at":"2026-05-28T01:04:50.007607+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IPOHHNNLZWJKNEKUXD7BMLPSPY","json":"https://pith.science/pith/IPOHHNNLZWJKNEKUXD7BMLPSPY.json","graph_json":"https://pith.science/api/pith-number/IPOHHNNLZWJKNEKUXD7BMLPSPY/graph.json","events_json":"https://pith.science/api/pith-number/IPOHHNNLZWJKNEKUXD7BMLPSPY/events.json","paper":"https://pith.science/paper/IPOHHNNL"},"agent_actions":{"view_html":"https://pith.science/pith/IPOHHNNLZWJKNEKUXD7BMLPSPY","download_json":"https://pith.science/pith/IPOHHNNLZWJKNEKUXD7BMLPSPY.json","view_paper":"https://pith.science/paper/IPOHHNNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.27837&json=true","fetch_graph":"https://pith.science/api/pith-number/IPOHHNNLZWJKNEKUXD7BMLPSPY/graph.json","fetch_events":"https://pith.science/api/pith-number/IPOHHNNLZWJKNEKUXD7BMLPSPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPOHHNNLZWJKNEKUXD7BMLPSPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPOHHNNLZWJKNEKUXD7BMLPSPY/action/storage_attestation","attest_author":"https://pith.science/pith/IPOHHNNLZWJKNEKUXD7BMLPSPY/action/author_attestation","sign_citation":"https://pith.science/pith/IPOHHNNLZWJKNEKUXD7BMLPSPY/action/citation_signature","submit_replication":"https://pith.science/pith/IPOHHNNLZWJKNEKUXD7BMLPSPY/action/replication_record"}},"created_at":"2026-05-28T01:04:50.007607+00:00","updated_at":"2026-05-28T01:04:50.007607+00:00"}