{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:U3X4C44HM777AJSXVVLQZ2MGDY","short_pith_number":"pith:U3X4C44H","schema_version":"1.0","canonical_sha256":"a6efc1738767fff02657ad570ce9861e0570f687104aaed14552aa218d3c0161","source":{"kind":"arxiv","id":"2102.12676","version":1},"attestation_state":"computed","paper":{"title":"Efficient computational algorithms for approximate optimal designs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Hon Keung Tony Ng, Jiangtao Duan, Wei Gao, Yanyuan Ma","submitted_at":"2021-02-25T04:21:31Z","abstract_excerpt":"In this paper, we propose two simple yet efficient computational algorithms to obtain approximate optimal designs for multi-dimensional linear regression on a large variety of design spaces. We focus on the two commonly used optimal criteria, $D$- and $A$-optimal criteria. For $D$-optimality, we provide an alternative proof for the monotonic convergence for $D$-optimal criterion and propose an efficient computational algorithm to obtain the approximate $D$-optimal design. We further show that the proposed algorithm converges to the $D$-optimal design, and then prove that the approximate $D$-op"},"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":"2102.12676","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.ST","submitted_at":"2021-02-25T04:21:31Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"5b9a291a4c76f261bc6474bc84d77b79cefd28aa896f9f4ce7e8fc06ed2ec104","abstract_canon_sha256":"8970f056250669e5d8d23cc5efa2d85e89a699d5682c6597ee16a9c17006e05c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:18:22.810778Z","signature_b64":"Rh981utJqfgyu5NA5EmClBmUGKv8XHO4BdIwqCJpxr083k2L0d/1yigLUUXuD+w5sjWzwr3zF0FIkrisNlM9Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6efc1738767fff02657ad570ce9861e0570f687104aaed14552aa218d3c0161","last_reissued_at":"2026-07-05T02:18:22.810428Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:18:22.810428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient computational algorithms for approximate optimal designs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Hon Keung Tony Ng, Jiangtao Duan, Wei Gao, Yanyuan Ma","submitted_at":"2021-02-25T04:21:31Z","abstract_excerpt":"In this paper, we propose two simple yet efficient computational algorithms to obtain approximate optimal designs for multi-dimensional linear regression on a large variety of design spaces. We focus on the two commonly used optimal criteria, $D$- and $A$-optimal criteria. For $D$-optimality, we provide an alternative proof for the monotonic convergence for $D$-optimal criterion and propose an efficient computational algorithm to obtain the approximate $D$-optimal design. We further show that the proposed algorithm converges to the $D$-optimal design, and then prove that the approximate $D$-op"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.12676","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/2102.12676/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":"2102.12676","created_at":"2026-07-05T02:18:22.810490+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.12676v1","created_at":"2026-07-05T02:18:22.810490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.12676","created_at":"2026-07-05T02:18:22.810490+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3X4C44HM777","created_at":"2026-07-05T02:18:22.810490+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3X4C44HM777AJSX","created_at":"2026-07-05T02:18:22.810490+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3X4C44H","created_at":"2026-07-05T02:18:22.810490+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/U3X4C44HM777AJSXVVLQZ2MGDY","json":"https://pith.science/pith/U3X4C44HM777AJSXVVLQZ2MGDY.json","graph_json":"https://pith.science/api/pith-number/U3X4C44HM777AJSXVVLQZ2MGDY/graph.json","events_json":"https://pith.science/api/pith-number/U3X4C44HM777AJSXVVLQZ2MGDY/events.json","paper":"https://pith.science/paper/U3X4C44H"},"agent_actions":{"view_html":"https://pith.science/pith/U3X4C44HM777AJSXVVLQZ2MGDY","download_json":"https://pith.science/pith/U3X4C44HM777AJSXVVLQZ2MGDY.json","view_paper":"https://pith.science/paper/U3X4C44H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.12676&json=true","fetch_graph":"https://pith.science/api/pith-number/U3X4C44HM777AJSXVVLQZ2MGDY/graph.json","fetch_events":"https://pith.science/api/pith-number/U3X4C44HM777AJSXVVLQZ2MGDY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3X4C44HM777AJSXVVLQZ2MGDY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3X4C44HM777AJSXVVLQZ2MGDY/action/storage_attestation","attest_author":"https://pith.science/pith/U3X4C44HM777AJSXVVLQZ2MGDY/action/author_attestation","sign_citation":"https://pith.science/pith/U3X4C44HM777AJSXVVLQZ2MGDY/action/citation_signature","submit_replication":"https://pith.science/pith/U3X4C44HM777AJSXVVLQZ2MGDY/action/replication_record"}},"created_at":"2026-07-05T02:18:22.810490+00:00","updated_at":"2026-07-05T02:18:22.810490+00:00"}