{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RCNDI6XZSRYQ5DJLLYLO5E5CGE","short_pith_number":"pith:RCNDI6XZ","schema_version":"1.0","canonical_sha256":"889a347af994710e8d2b5e16ee93a231287f0bfc7b08d8ed30332da893d2e9fa","source":{"kind":"arxiv","id":"1801.05661","version":1},"attestation_state":"computed","paper":{"title":"A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Lenka Filov\\'a, Peter Richt\\'arik, Radoslav Harman","submitted_at":"2018-01-17T13:49:47Z","abstract_excerpt":"We propose a class of subspace ascent methods for computing optimal approximate designs that covers both existing as well as new and more efficient algorithms. Within this class of methods, we construct a simple, randomized exchange algorithm (REX). Numerical comparisons suggest that the performance of REX is comparable or superior to the performance of state-of-the-art methods across a broad range of problem structures and sizes. We focus on the most commonly used criterion of D-optimality that also has applications beyond experimental design, such as the construction of the minimum volume el"},"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":"1801.05661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-01-17T13:49:47Z","cross_cats_sorted":[],"title_canon_sha256":"b0372ed676a43922c7ea3ef0e94a5eb38f15432a8281ef7bb69603190f79b237","abstract_canon_sha256":"c95b62b27f7443757d1e01bf0a2d47b78d1595c8ed767a02b19d6ae8dd5e95e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:40.518433Z","signature_b64":"FIQOuRFKz0DImkzqs4sMrDEN3/hZohm3sa8q4vPFOqUpqTmvzH/z3Eiqzv4xdwQVLH0/BLo1meBTTG3X29T8AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"889a347af994710e8d2b5e16ee93a231287f0bfc7b08d8ed30332da893d2e9fa","last_reissued_at":"2026-05-18T00:25:40.517899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:40.517899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Lenka Filov\\'a, Peter Richt\\'arik, Radoslav Harman","submitted_at":"2018-01-17T13:49:47Z","abstract_excerpt":"We propose a class of subspace ascent methods for computing optimal approximate designs that covers both existing as well as new and more efficient algorithms. Within this class of methods, we construct a simple, randomized exchange algorithm (REX). Numerical comparisons suggest that the performance of REX is comparable or superior to the performance of state-of-the-art methods across a broad range of problem structures and sizes. We focus on the most commonly used criterion of D-optimality that also has applications beyond experimental design, such as the construction of the minimum volume el"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05661","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":""},"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":"1801.05661","created_at":"2026-05-18T00:25:40.517979+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.05661v1","created_at":"2026-05-18T00:25:40.517979+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05661","created_at":"2026-05-18T00:25:40.517979+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCNDI6XZSRYQ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCNDI6XZSRYQ5DJL","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCNDI6XZ","created_at":"2026-05-18T12:32:50.500415+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/RCNDI6XZSRYQ5DJLLYLO5E5CGE","json":"https://pith.science/pith/RCNDI6XZSRYQ5DJLLYLO5E5CGE.json","graph_json":"https://pith.science/api/pith-number/RCNDI6XZSRYQ5DJLLYLO5E5CGE/graph.json","events_json":"https://pith.science/api/pith-number/RCNDI6XZSRYQ5DJLLYLO5E5CGE/events.json","paper":"https://pith.science/paper/RCNDI6XZ"},"agent_actions":{"view_html":"https://pith.science/pith/RCNDI6XZSRYQ5DJLLYLO5E5CGE","download_json":"https://pith.science/pith/RCNDI6XZSRYQ5DJLLYLO5E5CGE.json","view_paper":"https://pith.science/paper/RCNDI6XZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.05661&json=true","fetch_graph":"https://pith.science/api/pith-number/RCNDI6XZSRYQ5DJLLYLO5E5CGE/graph.json","fetch_events":"https://pith.science/api/pith-number/RCNDI6XZSRYQ5DJLLYLO5E5CGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCNDI6XZSRYQ5DJLLYLO5E5CGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCNDI6XZSRYQ5DJLLYLO5E5CGE/action/storage_attestation","attest_author":"https://pith.science/pith/RCNDI6XZSRYQ5DJLLYLO5E5CGE/action/author_attestation","sign_citation":"https://pith.science/pith/RCNDI6XZSRYQ5DJLLYLO5E5CGE/action/citation_signature","submit_replication":"https://pith.science/pith/RCNDI6XZSRYQ5DJLLYLO5E5CGE/action/replication_record"}},"created_at":"2026-05-18T00:25:40.517979+00:00","updated_at":"2026-05-18T00:25:40.517979+00:00"}