{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ZNBUJ653WSSPNI67ORA4EPROZK","short_pith_number":"pith:ZNBUJ653","schema_version":"1.0","canonical_sha256":"cb4344fbbbb4a4f6a3df7441c23e2eca965ca65db27fe3e3f3da9ee60ceb3490","source":{"kind":"arxiv","id":"2505.14957","version":1},"attestation_state":"computed","paper":{"title":"Strong Formulations and Algorithms for Regularized A-optimal Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Yongchun Li","submitted_at":"2025-05-20T22:36:31Z","abstract_excerpt":"We study the Regularized A-optimal Design (RAOD) problem, which selects a subset of $k$ experiments to minimize the inverse of the Fisher information matrix, regularized with a scaled identity matrix. RAOD has broad applications in Bayesian experimental design, sensor placement, and cold-start recommendation. We prove its NP-hardness via a reduction from the independent set problem. By leveraging convex envelope techniques, we propose a new convex integer programming formulation for RAOD, whose continuous relaxation dominates those of existing formulations. More importantly, we demonstrate tha"},"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":"2505.14957","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-20T22:36:31Z","cross_cats_sorted":[],"title_canon_sha256":"3de10ce4a039635606286553292794315bfc518e3d6dff0a45f1b4c699500b4b","abstract_canon_sha256":"671d81e2e619d1184f7a2a455385f26821a2f0969c036a44c772d7c5ea525bbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:38.241354Z","signature_b64":"kGmCaIiE1/F22VXnsNtKEYpY63H7NR+6Qw7+veAVMYp0Lc35yXVY5uFoH6kGbCPHA5ZwWg2XXou7U/QX3rQgAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb4344fbbbb4a4f6a3df7441c23e2eca965ca65db27fe3e3f3da9ee60ceb3490","last_reissued_at":"2026-07-05T11:06:38.240892Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:38.240892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strong Formulations and Algorithms for Regularized A-optimal Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Yongchun Li","submitted_at":"2025-05-20T22:36:31Z","abstract_excerpt":"We study the Regularized A-optimal Design (RAOD) problem, which selects a subset of $k$ experiments to minimize the inverse of the Fisher information matrix, regularized with a scaled identity matrix. RAOD has broad applications in Bayesian experimental design, sensor placement, and cold-start recommendation. We prove its NP-hardness via a reduction from the independent set problem. By leveraging convex envelope techniques, we propose a new convex integer programming formulation for RAOD, whose continuous relaxation dominates those of existing formulations. More importantly, we demonstrate tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14957","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/2505.14957/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":"2505.14957","created_at":"2026-07-05T11:06:38.240949+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.14957v1","created_at":"2026-07-05T11:06:38.240949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14957","created_at":"2026-07-05T11:06:38.240949+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNBUJ653WSSP","created_at":"2026-07-05T11:06:38.240949+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNBUJ653WSSPNI67","created_at":"2026-07-05T11:06:38.240949+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNBUJ653","created_at":"2026-07-05T11:06:38.240949+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06642","citing_title":"The Approximation Ratio for the Risk of Myopic Bayesian Active Learning for Linear Regression","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZNBUJ653WSSPNI67ORA4EPROZK","json":"https://pith.science/pith/ZNBUJ653WSSPNI67ORA4EPROZK.json","graph_json":"https://pith.science/api/pith-number/ZNBUJ653WSSPNI67ORA4EPROZK/graph.json","events_json":"https://pith.science/api/pith-number/ZNBUJ653WSSPNI67ORA4EPROZK/events.json","paper":"https://pith.science/paper/ZNBUJ653"},"agent_actions":{"view_html":"https://pith.science/pith/ZNBUJ653WSSPNI67ORA4EPROZK","download_json":"https://pith.science/pith/ZNBUJ653WSSPNI67ORA4EPROZK.json","view_paper":"https://pith.science/paper/ZNBUJ653","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.14957&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNBUJ653WSSPNI67ORA4EPROZK/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNBUJ653WSSPNI67ORA4EPROZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNBUJ653WSSPNI67ORA4EPROZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNBUJ653WSSPNI67ORA4EPROZK/action/storage_attestation","attest_author":"https://pith.science/pith/ZNBUJ653WSSPNI67ORA4EPROZK/action/author_attestation","sign_citation":"https://pith.science/pith/ZNBUJ653WSSPNI67ORA4EPROZK/action/citation_signature","submit_replication":"https://pith.science/pith/ZNBUJ653WSSPNI67ORA4EPROZK/action/replication_record"}},"created_at":"2026-07-05T11:06:38.240949+00:00","updated_at":"2026-07-05T11:06:38.240949+00:00"}