{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:F3RJPFNSJKLQID5ZOGCDGYTUC2","short_pith_number":"pith:F3RJPFNS","canonical_record":{"source":{"id":"0911.0108","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2009-10-31T20:32:12Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"a6b74fa8a9d13d94e872643daf02658f3417943d601ea282b967fe29c5d5f651","abstract_canon_sha256":"f26ef7cff7d92993d4341b81d6781ac6a64973d7b0cc459e3e2a0480cbfe128d"},"schema_version":"1.0"},"canonical_sha256":"2ee29795b24a97040fb971843362741697abd0148ed15e79250268b659e589d6","source":{"kind":"arxiv","id":"0911.0108","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.0108","created_at":"2026-05-18T04:15:36Z"},{"alias_kind":"arxiv_version","alias_value":"0911.0108v3","created_at":"2026-05-18T04:15:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.0108","created_at":"2026-05-18T04:15:36Z"},{"alias_kind":"pith_short_12","alias_value":"F3RJPFNSJKLQ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"F3RJPFNSJKLQID5Z","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"F3RJPFNS","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:F3RJPFNSJKLQID5ZOGCDGYTUC2","target":"record","payload":{"canonical_record":{"source":{"id":"0911.0108","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2009-10-31T20:32:12Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"a6b74fa8a9d13d94e872643daf02658f3417943d601ea282b967fe29c5d5f651","abstract_canon_sha256":"f26ef7cff7d92993d4341b81d6781ac6a64973d7b0cc459e3e2a0480cbfe128d"},"schema_version":"1.0"},"canonical_sha256":"2ee29795b24a97040fb971843362741697abd0148ed15e79250268b659e589d6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:36.933454Z","signature_b64":"tKKNQ5I9CTdcr0F5KbLyZJnqJUIYTlT+Pcx625zRWBX14qspL0sQ399QAcqPhky5xkro0PSnAmOLU3xGAoPpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ee29795b24a97040fb971843362741697abd0148ed15e79250268b659e589d6","last_reissued_at":"2026-05-18T04:15:36.933011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:36.933011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0911.0108","source_version":3,"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-18T04:15:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7IvFTBpGltmNIF89ZeR5IP8YvE03xpDMLuBzxdQsU4UmB/Yqlt88qcYpqD7YvI3nEjOq4ycWAMxYMPwgC72zCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:08:04.057573Z"},"content_sha256":"c862e98f3724e681c6707bd2287c9cefd31e2f48c8e8481e66e75b5321064ba9","schema_version":"1.0","event_id":"sha256:c862e98f3724e681c6707bd2287c9cefd31e2f48c8e8481e66e75b5321064ba9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:F3RJPFNSJKLQID5ZOGCDGYTUC2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"D-optimal designs via a cocktail algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.CO","authors_text":"Yaming Yu","submitted_at":"2009-10-31T20:32:12Z","abstract_excerpt":"A fast new algorithm is proposed for numerical computation of (approximate) D-optimal designs. This \"cocktail algorithm\" extends the well-known vertex direction method (VDM; Fedorov 1972) and the multiplicative algorithm (Silvey, Titterington and Torsney, 1978), and shares their simplicity and monotonic convergence properties. Numerical examples show that the cocktail algorithm can lead to dramatically improved speed, sometimes by orders of magnitude, relative to either the multiplicative algorithm or the vertex exchange method (a variant of VDM). Key to the improved speed is a new nearest nei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.0108","kind":"arxiv","version":3},"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-18T04:15:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6MVA99QZcP4b23idzWW0Rj/ZluDqznmRm0uap729i3fpQM6KjCnOAPMR6tjWe2qB1M/wSJufEnlqZ2AoOf/nDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T07:08:04.057910Z"},"content_sha256":"d8d0107390c137a36adc4706935bfd2708c01aad5189e0ed761a51aaab98ac4a","schema_version":"1.0","event_id":"sha256:d8d0107390c137a36adc4706935bfd2708c01aad5189e0ed761a51aaab98ac4a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F3RJPFNSJKLQID5ZOGCDGYTUC2/bundle.json","state_url":"https://pith.science/pith/F3RJPFNSJKLQID5ZOGCDGYTUC2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F3RJPFNSJKLQID5ZOGCDGYTUC2/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-06-20T07:08:04Z","links":{"resolver":"https://pith.science/pith/F3RJPFNSJKLQID5ZOGCDGYTUC2","bundle":"https://pith.science/pith/F3RJPFNSJKLQID5ZOGCDGYTUC2/bundle.json","state":"https://pith.science/pith/F3RJPFNSJKLQID5ZOGCDGYTUC2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F3RJPFNSJKLQID5ZOGCDGYTUC2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:F3RJPFNSJKLQID5ZOGCDGYTUC2","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":"f26ef7cff7d92993d4341b81d6781ac6a64973d7b0cc459e3e2a0480cbfe128d","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2009-10-31T20:32:12Z","title_canon_sha256":"a6b74fa8a9d13d94e872643daf02658f3417943d601ea282b967fe29c5d5f651"},"schema_version":"1.0","source":{"id":"0911.0108","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0911.0108","created_at":"2026-05-18T04:15:36Z"},{"alias_kind":"arxiv_version","alias_value":"0911.0108v3","created_at":"2026-05-18T04:15:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.0108","created_at":"2026-05-18T04:15:36Z"},{"alias_kind":"pith_short_12","alias_value":"F3RJPFNSJKLQ","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"F3RJPFNSJKLQID5Z","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"F3RJPFNS","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:d8d0107390c137a36adc4706935bfd2708c01aad5189e0ed761a51aaab98ac4a","target":"graph","created_at":"2026-05-18T04:15:36Z","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 fast new algorithm is proposed for numerical computation of (approximate) D-optimal designs. This \"cocktail algorithm\" extends the well-known vertex direction method (VDM; Fedorov 1972) and the multiplicative algorithm (Silvey, Titterington and Torsney, 1978), and shares their simplicity and monotonic convergence properties. Numerical examples show that the cocktail algorithm can lead to dramatically improved speed, sometimes by orders of magnitude, relative to either the multiplicative algorithm or the vertex exchange method (a variant of VDM). Key to the improved speed is a new nearest nei","authors_text":"Yaming Yu","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2009-10-31T20:32:12Z","title":"D-optimal designs via a cocktail algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.0108","kind":"arxiv","version":3},"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:c862e98f3724e681c6707bd2287c9cefd31e2f48c8e8481e66e75b5321064ba9","target":"record","created_at":"2026-05-18T04:15:36Z","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":"f26ef7cff7d92993d4341b81d6781ac6a64973d7b0cc459e3e2a0480cbfe128d","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2009-10-31T20:32:12Z","title_canon_sha256":"a6b74fa8a9d13d94e872643daf02658f3417943d601ea282b967fe29c5d5f651"},"schema_version":"1.0","source":{"id":"0911.0108","kind":"arxiv","version":3}},"canonical_sha256":"2ee29795b24a97040fb971843362741697abd0148ed15e79250268b659e589d6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ee29795b24a97040fb971843362741697abd0148ed15e79250268b659e589d6","first_computed_at":"2026-05-18T04:15:36.933011Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:36.933011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tKKNQ5I9CTdcr0F5KbLyZJnqJUIYTlT+Pcx625zRWBX14qspL0sQ399QAcqPhky5xkro0PSnAmOLU3xGAoPpBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:36.933454Z","signed_message":"canonical_sha256_bytes"},"source_id":"0911.0108","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c862e98f3724e681c6707bd2287c9cefd31e2f48c8e8481e66e75b5321064ba9","sha256:d8d0107390c137a36adc4706935bfd2708c01aad5189e0ed761a51aaab98ac4a"],"state_sha256":"65b30956ef8436ce219a0e8f7882bbe14ba88e9bbe36bc042e6f64b96d3392b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g6giSAFTqP1cdUZ2B4sGsbzM58yc0lSW4f5YPvkEtmnKY3d8i9gntz6ooF445qtim2QEUYoUnE7pfSTQlq2LBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T07:08:04.059755Z","bundle_sha256":"8334636cc1b16bd95496d1e74cacf3c6c014ba79c9171f439db660cf026df96f"}}