{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7CUUVFKGHNTUBFJSLJ243O6SWS","short_pith_number":"pith:7CUUVFKG","canonical_record":{"source":{"id":"1109.5320","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-09-25T03:18:51Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"1815f5f1c659f451523ede091964dd61a885fae9e9f6cb04d3d7ec176d47a8db","abstract_canon_sha256":"6377db044929d4fefeed8848f528495438a535af210fbb08bf2be70b5fe416e0"},"schema_version":"1.0"},"canonical_sha256":"f8a94a95463b674095325a75cdbbd2b4b6fdf3827c95c78af81c7cb1f1c98e22","source":{"kind":"arxiv","id":"1109.5320","version":8},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5320","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5320v8","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5320","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"7CUUVFKGHNTU","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7CUUVFKGHNTUBFJS","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7CUUVFKG","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7CUUVFKGHNTUBFJSLJ243O6SWS","target":"record","payload":{"canonical_record":{"source":{"id":"1109.5320","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-09-25T03:18:51Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"1815f5f1c659f451523ede091964dd61a885fae9e9f6cb04d3d7ec176d47a8db","abstract_canon_sha256":"6377db044929d4fefeed8848f528495438a535af210fbb08bf2be70b5fe416e0"},"schema_version":"1.0"},"canonical_sha256":"f8a94a95463b674095325a75cdbbd2b4b6fdf3827c95c78af81c7cb1f1c98e22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:36.312342Z","signature_b64":"GdJ0TTi4Y7HNlE9lajhVpyUd0t5fpicTK2kp9+Ne0LyJKHUAMG732cWjBa3fovGUXwgSO/YbNuVoy4dnxC/jAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8a94a95463b674095325a75cdbbd2b4b6fdf3827c95c78af81c7cb1f1c98e22","last_reissued_at":"2026-05-18T02:21:36.311842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:36.311842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.5320","source_version":8,"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-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HfW90eahTav7wMKJ1iHCYaxt6ZgvVZllt9Xwb4f47srg3T2V4M5bX0XJgEIA1dsSq5v1uF/LWBsrw8pHVEstDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:35:17.374117Z"},"content_sha256":"1a5679ffab5918636a767e8c37ace2f9d108bd9485b0ebf97164fab43963caf4","schema_version":"1.0","event_id":"sha256:1a5679ffab5918636a767e8c37ace2f9d108bd9485b0ebf97164fab43963caf4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7CUUVFKGHNTUBFJSLJ243O6SWS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Designs for 2^k Factorial Experiments with Binary Response","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Abhyuday Mandal, Dibyen Majumdar, Jie Yang","submitted_at":"2011-09-25T03:18:51Z","abstract_excerpt":"We consider the problem of obtaining D-optimal designs for factorial experiments with a binary response and $k$ qualitative factors each at two levels. We obtain a characterization for a design to be locally D-optimal. Based on this characterization, we develop efficient numerical techniques to search for locally D-optimal designs. Using prior distributions on the parameters, we investigate EW D-optimal designs, which are designs that maximize the determinant of the expected information matrix. It turns out that these designs can be obtained very easily using our algorithm for locally D-optima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5320","kind":"arxiv","version":8},"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-18T02:21:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0tCUL+cNCD7S7OV/zqods3L5nZK1DT7O9dO8BK36usZ5fC8RbhZahgLbDUfufkdoAFkXWrtx5yA5x20D+hFzCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T13:35:17.374517Z"},"content_sha256":"30ffa704ea404b35b21aeb26eb5fccc1b8e190c934635667b7e23bacd6929f0a","schema_version":"1.0","event_id":"sha256:30ffa704ea404b35b21aeb26eb5fccc1b8e190c934635667b7e23bacd6929f0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7CUUVFKGHNTUBFJSLJ243O6SWS/bundle.json","state_url":"https://pith.science/pith/7CUUVFKGHNTUBFJSLJ243O6SWS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7CUUVFKGHNTUBFJSLJ243O6SWS/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-08T13:35:17Z","links":{"resolver":"https://pith.science/pith/7CUUVFKGHNTUBFJSLJ243O6SWS","bundle":"https://pith.science/pith/7CUUVFKGHNTUBFJSLJ243O6SWS/bundle.json","state":"https://pith.science/pith/7CUUVFKGHNTUBFJSLJ243O6SWS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7CUUVFKGHNTUBFJSLJ243O6SWS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7CUUVFKGHNTUBFJSLJ243O6SWS","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":"6377db044929d4fefeed8848f528495438a535af210fbb08bf2be70b5fe416e0","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-09-25T03:18:51Z","title_canon_sha256":"1815f5f1c659f451523ede091964dd61a885fae9e9f6cb04d3d7ec176d47a8db"},"schema_version":"1.0","source":{"id":"1109.5320","kind":"arxiv","version":8}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.5320","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.5320v8","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5320","created_at":"2026-05-18T02:21:36Z"},{"alias_kind":"pith_short_12","alias_value":"7CUUVFKGHNTU","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7CUUVFKGHNTUBFJS","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7CUUVFKG","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:30ffa704ea404b35b21aeb26eb5fccc1b8e190c934635667b7e23bacd6929f0a","target":"graph","created_at":"2026-05-18T02:21: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":"We consider the problem of obtaining D-optimal designs for factorial experiments with a binary response and $k$ qualitative factors each at two levels. We obtain a characterization for a design to be locally D-optimal. Based on this characterization, we develop efficient numerical techniques to search for locally D-optimal designs. Using prior distributions on the parameters, we investigate EW D-optimal designs, which are designs that maximize the determinant of the expected information matrix. It turns out that these designs can be obtained very easily using our algorithm for locally D-optima","authors_text":"Abhyuday Mandal, Dibyen Majumdar, Jie Yang","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-09-25T03:18:51Z","title":"Optimal Designs for 2^k Factorial Experiments with Binary Response"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5320","kind":"arxiv","version":8},"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:1a5679ffab5918636a767e8c37ace2f9d108bd9485b0ebf97164fab43963caf4","target":"record","created_at":"2026-05-18T02:21: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":"6377db044929d4fefeed8848f528495438a535af210fbb08bf2be70b5fe416e0","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-09-25T03:18:51Z","title_canon_sha256":"1815f5f1c659f451523ede091964dd61a885fae9e9f6cb04d3d7ec176d47a8db"},"schema_version":"1.0","source":{"id":"1109.5320","kind":"arxiv","version":8}},"canonical_sha256":"f8a94a95463b674095325a75cdbbd2b4b6fdf3827c95c78af81c7cb1f1c98e22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8a94a95463b674095325a75cdbbd2b4b6fdf3827c95c78af81c7cb1f1c98e22","first_computed_at":"2026-05-18T02:21:36.311842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:36.311842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GdJ0TTi4Y7HNlE9lajhVpyUd0t5fpicTK2kp9+Ne0LyJKHUAMG732cWjBa3fovGUXwgSO/YbNuVoy4dnxC/jAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:36.312342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.5320","source_kind":"arxiv","source_version":8}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a5679ffab5918636a767e8c37ace2f9d108bd9485b0ebf97164fab43963caf4","sha256:30ffa704ea404b35b21aeb26eb5fccc1b8e190c934635667b7e23bacd6929f0a"],"state_sha256":"558c2706df917ab9335b5063bc3df2012a7e3313bb8a8dfccd72a57876ead11e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dw2/4DYyMmUeeHP8kdUXo4B32kecbPmn4rKZKyURgHvLKiLc823YQAPIgtRNFY2wXRs6FbyjS/Mr1It1NcD6Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T13:35:17.376398Z","bundle_sha256":"35236b397689eb3ccfab55ec9d672e8c3df3dcf64680c72690836313daf60d5e"}}