{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RCNDI6XZSRYQ5DJLLYLO5E5CGE","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":"c95b62b27f7443757d1e01bf0a2d47b78d1595c8ed767a02b19d6ae8dd5e95e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-01-17T13:49:47Z","title_canon_sha256":"b0372ed676a43922c7ea3ef0e94a5eb38f15432a8281ef7bb69603190f79b237"},"schema_version":"1.0","source":{"id":"1801.05661","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.05661","created_at":"2026-05-18T00:25:40Z"},{"alias_kind":"arxiv_version","alias_value":"1801.05661v1","created_at":"2026-05-18T00:25:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.05661","created_at":"2026-05-18T00:25:40Z"},{"alias_kind":"pith_short_12","alias_value":"RCNDI6XZSRYQ","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RCNDI6XZSRYQ5DJL","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RCNDI6XZ","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:52f03a9d098763c1c9e52ba63448958391638d005aeea0f099aa48e6338a4d4e","target":"graph","created_at":"2026-05-18T00:25:40Z","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":"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","authors_text":"Lenka Filov\\'a, Peter Richt\\'arik, Radoslav Harman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-01-17T13:49:47Z","title":"A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.05661","kind":"arxiv","version":1},"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:14918ce0be9eeaeee8509c6a91ff5e9aadbb86d30333e3f85b65f4581ad3032f","target":"record","created_at":"2026-05-18T00:25:40Z","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":"c95b62b27f7443757d1e01bf0a2d47b78d1595c8ed767a02b19d6ae8dd5e95e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-01-17T13:49:47Z","title_canon_sha256":"b0372ed676a43922c7ea3ef0e94a5eb38f15432a8281ef7bb69603190f79b237"},"schema_version":"1.0","source":{"id":"1801.05661","kind":"arxiv","version":1}},"canonical_sha256":"889a347af994710e8d2b5e16ee93a231287f0bfc7b08d8ed30332da893d2e9fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"889a347af994710e8d2b5e16ee93a231287f0bfc7b08d8ed30332da893d2e9fa","first_computed_at":"2026-05-18T00:25:40.517899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:40.517899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FIQOuRFKz0DImkzqs4sMrDEN3/hZohm3sa8q4vPFOqUpqTmvzH/z3Eiqzv4xdwQVLH0/BLo1meBTTG3X29T8AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:40.518433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.05661","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14918ce0be9eeaeee8509c6a91ff5e9aadbb86d30333e3f85b65f4581ad3032f","sha256:52f03a9d098763c1c9e52ba63448958391638d005aeea0f099aa48e6338a4d4e"],"state_sha256":"d8c76ecf8153becb2ad1e373157c3b9779588ca325e9a43f668dc47269da9219"}