{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CO5ZR4FD4PK3LPA4Q4JHYRPQBR","short_pith_number":"pith:CO5ZR4FD","canonical_record":{"source":{"id":"1608.05046","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-17T18:59:23Z","cross_cats_sorted":[],"title_canon_sha256":"3c46214ff7139ff06e0d7e87a3168a12bcda6d07817f0c768b7c812709a84545","abstract_canon_sha256":"77633ebb89e1d1a9552895e02ff41fbe39fd1f3dae5196ac9a93ae6eefbe1729"},"schema_version":"1.0"},"canonical_sha256":"13bb98f0a3e3d5b5bc1c87127c45f00c59444e51c134354ff8c47f2fd5a34a19","source":{"kind":"arxiv","id":"1608.05046","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05046","created_at":"2026-05-18T01:08:32Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05046v1","created_at":"2026-05-18T01:08:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05046","created_at":"2026-05-18T01:08:32Z"},{"alias_kind":"pith_short_12","alias_value":"CO5ZR4FD4PK3","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CO5ZR4FD4PK3LPA4","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CO5ZR4FD","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CO5ZR4FD4PK3LPA4Q4JHYRPQBR","target":"record","payload":{"canonical_record":{"source":{"id":"1608.05046","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-17T18:59:23Z","cross_cats_sorted":[],"title_canon_sha256":"3c46214ff7139ff06e0d7e87a3168a12bcda6d07817f0c768b7c812709a84545","abstract_canon_sha256":"77633ebb89e1d1a9552895e02ff41fbe39fd1f3dae5196ac9a93ae6eefbe1729"},"schema_version":"1.0"},"canonical_sha256":"13bb98f0a3e3d5b5bc1c87127c45f00c59444e51c134354ff8c47f2fd5a34a19","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:32.887769Z","signature_b64":"03e2obQSqHQ78ysfK11C92i/LPi8+dOTVsztwc4FM5Aj/h55PNbBnGmeHsGW3ENRSqN0QoTMkq8t+7lZu1YHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13bb98f0a3e3d5b5bc1c87127c45f00c59444e51c134354ff8c47f2fd5a34a19","last_reissued_at":"2026-05-18T01:08:32.887111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:32.887111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.05046","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-18T01:08:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"frj4Im0yCbawAD3MfPyRPbnyO/Si1LPPKQeX+vfadTBucx8b+9RDz7j8MFX7rV3eCI4LmqPZddK6X+doIEbgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T07:00:18.745195Z"},"content_sha256":"e92fa9aaefc24823a274c793a0d6d65699d219981c5c679883a73f91d180f6af","schema_version":"1.0","event_id":"sha256:e92fa9aaefc24823a274c793a0d6d65699d219981c5c679883a73f91d180f6af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CO5ZR4FD4PK3LPA4Q4JHYRPQBR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Practical optimal experiment design with probabilistic programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Daniel Ly, Long Ouyang, Michael Henry Tessler, Noah Goodman","submitted_at":"2016-08-17T18:59:23Z","abstract_excerpt":"Scientists often run experiments to distinguish competing theories. This requires patience, rigor, and ingenuity - there is often a large space of possible experiments one could run. But we need not comb this space by hand - if we represent our theories as formal models and explicitly declare the space of experiments, we can automate the search for good experiments, looking for those with high expected information gain. Here, we present a general and principled approach to experiment design based on probabilistic programming languages (PPLs). PPLs offer a clean separation between declaring pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05046","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-18T01:08:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I30le5k6y9KFkoiHwKAQSQKrrQAb8/pgA5mioLhHn5nkxCVryxjEbzZLPtmB8jdkEoJYzA02vGFzMuF1eJjQCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T07:00:18.745551Z"},"content_sha256":"7a1965e460eb267eaa0e4a3e5738a741acd88f6273dc1f8ec85b2a1b3e94b5be","schema_version":"1.0","event_id":"sha256:7a1965e460eb267eaa0e4a3e5738a741acd88f6273dc1f8ec85b2a1b3e94b5be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CO5ZR4FD4PK3LPA4Q4JHYRPQBR/bundle.json","state_url":"https://pith.science/pith/CO5ZR4FD4PK3LPA4Q4JHYRPQBR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CO5ZR4FD4PK3LPA4Q4JHYRPQBR/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-12T07:00:18Z","links":{"resolver":"https://pith.science/pith/CO5ZR4FD4PK3LPA4Q4JHYRPQBR","bundle":"https://pith.science/pith/CO5ZR4FD4PK3LPA4Q4JHYRPQBR/bundle.json","state":"https://pith.science/pith/CO5ZR4FD4PK3LPA4Q4JHYRPQBR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CO5ZR4FD4PK3LPA4Q4JHYRPQBR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CO5ZR4FD4PK3LPA4Q4JHYRPQBR","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":"77633ebb89e1d1a9552895e02ff41fbe39fd1f3dae5196ac9a93ae6eefbe1729","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-17T18:59:23Z","title_canon_sha256":"3c46214ff7139ff06e0d7e87a3168a12bcda6d07817f0c768b7c812709a84545"},"schema_version":"1.0","source":{"id":"1608.05046","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05046","created_at":"2026-05-18T01:08:32Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05046v1","created_at":"2026-05-18T01:08:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05046","created_at":"2026-05-18T01:08:32Z"},{"alias_kind":"pith_short_12","alias_value":"CO5ZR4FD4PK3","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CO5ZR4FD4PK3LPA4","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CO5ZR4FD","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:7a1965e460eb267eaa0e4a3e5738a741acd88f6273dc1f8ec85b2a1b3e94b5be","target":"graph","created_at":"2026-05-18T01:08:32Z","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":"Scientists often run experiments to distinguish competing theories. This requires patience, rigor, and ingenuity - there is often a large space of possible experiments one could run. But we need not comb this space by hand - if we represent our theories as formal models and explicitly declare the space of experiments, we can automate the search for good experiments, looking for those with high expected information gain. Here, we present a general and principled approach to experiment design based on probabilistic programming languages (PPLs). PPLs offer a clean separation between declaring pro","authors_text":"Daniel Ly, Long Ouyang, Michael Henry Tessler, Noah Goodman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-17T18:59:23Z","title":"Practical optimal experiment design with probabilistic programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05046","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:e92fa9aaefc24823a274c793a0d6d65699d219981c5c679883a73f91d180f6af","target":"record","created_at":"2026-05-18T01:08:32Z","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":"77633ebb89e1d1a9552895e02ff41fbe39fd1f3dae5196ac9a93ae6eefbe1729","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-17T18:59:23Z","title_canon_sha256":"3c46214ff7139ff06e0d7e87a3168a12bcda6d07817f0c768b7c812709a84545"},"schema_version":"1.0","source":{"id":"1608.05046","kind":"arxiv","version":1}},"canonical_sha256":"13bb98f0a3e3d5b5bc1c87127c45f00c59444e51c134354ff8c47f2fd5a34a19","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"13bb98f0a3e3d5b5bc1c87127c45f00c59444e51c134354ff8c47f2fd5a34a19","first_computed_at":"2026-05-18T01:08:32.887111Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:32.887111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"03e2obQSqHQ78ysfK11C92i/LPi8+dOTVsztwc4FM5Aj/h55PNbBnGmeHsGW3ENRSqN0QoTMkq8t+7lZu1YHBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:32.887769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05046","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e92fa9aaefc24823a274c793a0d6d65699d219981c5c679883a73f91d180f6af","sha256:7a1965e460eb267eaa0e4a3e5738a741acd88f6273dc1f8ec85b2a1b3e94b5be"],"state_sha256":"5ca6a80b9c2a0cc3b15b6b851c4cb0d76424cf8c4e5f38f44f746604b1b2d495"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NdsvRI3NtCJEZBqVJHdmQcWjtaLyspR5uK9n6mJzeKYXNj8eSdeTnT4LZUPhbpCFajBKaxHjgZs3x8RLGfGWAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T07:00:18.747541Z","bundle_sha256":"5caeaef626dccb0879251ca7448857b5e129084a0cb3648add3b51bfee807041"}}