{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OI6Y6A2YKA6K6IKUWT4SMOLYID","short_pith_number":"pith:OI6Y6A2Y","canonical_record":{"source":{"id":"1804.02655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-08T09:01:41Z","cross_cats_sorted":[],"title_canon_sha256":"16c0ca11355e4f659153d2a3c3b359e5e9a62f14db12ece4bc299244d06e6583","abstract_canon_sha256":"90832bbabfc10a8c8a63927b1c035c9813fe2f158718f58b85af1c8504be3096"},"schema_version":"1.0"},"canonical_sha256":"723d8f0358503caf2154b4f926397840ce54588898b5958427ecf8c2f2c01f36","source":{"kind":"arxiv","id":"1804.02655","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02655","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02655v1","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02655","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"OI6Y6A2YKA6K","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OI6Y6A2YKA6K6IKU","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OI6Y6A2Y","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OI6Y6A2YKA6K6IKUWT4SMOLYID","target":"record","payload":{"canonical_record":{"source":{"id":"1804.02655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-08T09:01:41Z","cross_cats_sorted":[],"title_canon_sha256":"16c0ca11355e4f659153d2a3c3b359e5e9a62f14db12ece4bc299244d06e6583","abstract_canon_sha256":"90832bbabfc10a8c8a63927b1c035c9813fe2f158718f58b85af1c8504be3096"},"schema_version":"1.0"},"canonical_sha256":"723d8f0358503caf2154b4f926397840ce54588898b5958427ecf8c2f2c01f36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:58.784517Z","signature_b64":"zlhPfWezaEOJ40h+eDLqLS8oqDfHjlw8H0SC+5NELe9tWxZylUcy7WylLft8KgfDZde2Vq6YILsSOx8ArsLyBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"723d8f0358503caf2154b4f926397840ce54588898b5958427ecf8c2f2c01f36","last_reissued_at":"2026-05-18T00:18:58.783920Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:58.783920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.02655","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G6I7sGGbzCh/wsI6S46shMRflWjEPqIHjjtcUvcBYwf9VFNhYUdmnp9V6Z6p1ynmD3mbMApXAx1q/+jDsyhgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:15:02.764384Z"},"content_sha256":"15eaf50774bdc50cb53eb092bb814cf3fbfc330490e03a8e4dc04d5944eb89b1","schema_version":"1.0","event_id":"sha256:15eaf50774bdc50cb53eb092bb814cf3fbfc330490e03a8e4dc04d5944eb89b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OI6Y6A2YKA6K6IKUWT4SMOLYID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Computational Algorithm for Optimal Continuous Experimental Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Hon Keung Tony Ng, Jiangtao Duan, Wei Gao","submitted_at":"2018-04-08T09:01:41Z","abstract_excerpt":"A simple yet efficient computational algorithm for computing the continuous optimal experimental design for linear models is proposed. An alternative proof the monotonic convergence for $D$-optimal criterion on continuous design spaces are provided. We further show that the proposed algorithm converges to the $D$-optimal design. We also provide an algorithm for the $A$-optimality and conjecture that the algorithm convergence monotonically on continuous design spaces. Different numerical examples are used to demonstrated the usefulness and performance of the proposed algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02655","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RkNE2AOGemjjve0QLBMEfB2nrBFZUiY4NS7BPQCRXN3vPozm82oB0Ls7YLKtRD+jHp0o4XIZW9sFueAZKq5ECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:15:02.765046Z"},"content_sha256":"e20c3c18c937bf909b3bc5e8fbf9643271754bede100e35adde504a3305deb13","schema_version":"1.0","event_id":"sha256:e20c3c18c937bf909b3bc5e8fbf9643271754bede100e35adde504a3305deb13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OI6Y6A2YKA6K6IKUWT4SMOLYID/bundle.json","state_url":"https://pith.science/pith/OI6Y6A2YKA6K6IKUWT4SMOLYID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OI6Y6A2YKA6K6IKUWT4SMOLYID/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T05:15:02Z","links":{"resolver":"https://pith.science/pith/OI6Y6A2YKA6K6IKUWT4SMOLYID","bundle":"https://pith.science/pith/OI6Y6A2YKA6K6IKUWT4SMOLYID/bundle.json","state":"https://pith.science/pith/OI6Y6A2YKA6K6IKUWT4SMOLYID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OI6Y6A2YKA6K6IKUWT4SMOLYID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OI6Y6A2YKA6K6IKUWT4SMOLYID","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":"90832bbabfc10a8c8a63927b1c035c9813fe2f158718f58b85af1c8504be3096","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-08T09:01:41Z","title_canon_sha256":"16c0ca11355e4f659153d2a3c3b359e5e9a62f14db12ece4bc299244d06e6583"},"schema_version":"1.0","source":{"id":"1804.02655","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.02655","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.02655v1","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02655","created_at":"2026-05-18T00:18:58Z"},{"alias_kind":"pith_short_12","alias_value":"OI6Y6A2YKA6K","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OI6Y6A2YKA6K6IKU","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OI6Y6A2Y","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:e20c3c18c937bf909b3bc5e8fbf9643271754bede100e35adde504a3305deb13","target":"graph","created_at":"2026-05-18T00:18:58Z","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":"A simple yet efficient computational algorithm for computing the continuous optimal experimental design for linear models is proposed. An alternative proof the monotonic convergence for $D$-optimal criterion on continuous design spaces are provided. We further show that the proposed algorithm converges to the $D$-optimal design. We also provide an algorithm for the $A$-optimality and conjecture that the algorithm convergence monotonically on continuous design spaces. Different numerical examples are used to demonstrated the usefulness and performance of the proposed algorithms.","authors_text":"Hon Keung Tony Ng, Jiangtao Duan, Wei Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-08T09:01:41Z","title":"Efficient Computational Algorithm for Optimal Continuous Experimental Designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02655","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:15eaf50774bdc50cb53eb092bb814cf3fbfc330490e03a8e4dc04d5944eb89b1","target":"record","created_at":"2026-05-18T00:18:58Z","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":"90832bbabfc10a8c8a63927b1c035c9813fe2f158718f58b85af1c8504be3096","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2018-04-08T09:01:41Z","title_canon_sha256":"16c0ca11355e4f659153d2a3c3b359e5e9a62f14db12ece4bc299244d06e6583"},"schema_version":"1.0","source":{"id":"1804.02655","kind":"arxiv","version":1}},"canonical_sha256":"723d8f0358503caf2154b4f926397840ce54588898b5958427ecf8c2f2c01f36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"723d8f0358503caf2154b4f926397840ce54588898b5958427ecf8c2f2c01f36","first_computed_at":"2026-05-18T00:18:58.783920Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:58.783920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zlhPfWezaEOJ40h+eDLqLS8oqDfHjlw8H0SC+5NELe9tWxZylUcy7WylLft8KgfDZde2Vq6YILsSOx8ArsLyBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:58.784517Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.02655","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:15eaf50774bdc50cb53eb092bb814cf3fbfc330490e03a8e4dc04d5944eb89b1","sha256:e20c3c18c937bf909b3bc5e8fbf9643271754bede100e35adde504a3305deb13"],"state_sha256":"3f5f1322fda914605742967f99e0c4c8b29a2b8e744006cbcecb91bba038a886"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"82A+hci9wHNRyT8t4TiqE3gz2jy8qBvoOWajxG+PkuiBIIHpooCaJDw9JQJGVP0NqGUeKYXI587RkwW4sLMfCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:15:02.768872Z","bundle_sha256":"241cf065310bd745b6af5d22ad6881b600525c2cc755f71fbe03e26af061d49f"}}