{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:4ZA2KO6PG5CEABXSGRK66Q6MPJ","short_pith_number":"pith:4ZA2KO6P","canonical_record":{"source":{"id":"2607.08335","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-07-09T10:21:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8f35be13b51b01892a73c8f8033628602ccb54b240b252fcbe67e092ff67bcbf","abstract_canon_sha256":"b1849c778fdbef0b576abbb77a48286a264c228e178f71c5abdffddb185d1781"},"schema_version":"1.0"},"canonical_sha256":"e641a53bcf37444006f23455ef43cc7a67b9aed2045402abf8ab71f860eafd3e","source":{"kind":"arxiv","id":"2607.08335","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.08335","created_at":"2026-07-10T01:19:47Z"},{"alias_kind":"arxiv_version","alias_value":"2607.08335v1","created_at":"2026-07-10T01:19:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08335","created_at":"2026-07-10T01:19:47Z"},{"alias_kind":"pith_short_12","alias_value":"4ZA2KO6PG5CE","created_at":"2026-07-10T01:19:47Z"},{"alias_kind":"pith_short_16","alias_value":"4ZA2KO6PG5CEABXS","created_at":"2026-07-10T01:19:47Z"},{"alias_kind":"pith_short_8","alias_value":"4ZA2KO6P","created_at":"2026-07-10T01:19:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:4ZA2KO6PG5CEABXSGRK66Q6MPJ","target":"record","payload":{"canonical_record":{"source":{"id":"2607.08335","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-07-09T10:21:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8f35be13b51b01892a73c8f8033628602ccb54b240b252fcbe67e092ff67bcbf","abstract_canon_sha256":"b1849c778fdbef0b576abbb77a48286a264c228e178f71c5abdffddb185d1781"},"schema_version":"1.0"},"canonical_sha256":"e641a53bcf37444006f23455ef43cc7a67b9aed2045402abf8ab71f860eafd3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-10T01:19:47.491762Z","signature_b64":"F8FfWs4ScfGy1KMC0c1HsKOCRE0OiCcVBOeX3d+nE9EPBd53CXjAJ0DyrH9Ad/1K3ocukOvgJnLDJpTgYDzUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e641a53bcf37444006f23455ef43cc7a67b9aed2045402abf8ab71f860eafd3e","last_reissued_at":"2026-07-10T01:19:47.491384Z","signature_status":"signed_v1","first_computed_at":"2026-07-10T01:19:47.491384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.08335","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-07-10T01:19:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v39a1HZNjY01LeuvFpXNYkKnuI0WNL/lIpdjUn/mFyPyf9Ma6FvjFVaBzLqFpUlivGJ/XiePciyevZTZNU5sBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:51:03.279725Z"},"content_sha256":"6f3ef9733289561d8e97101f0101bccc0e13be4d2fa242aa8ad5f30646a0bfa5","schema_version":"1.0","event_id":"sha256:6f3ef9733289561d8e97101f0101bccc0e13be4d2fa242aa8ad5f30646a0bfa5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:4ZA2KO6PG5CEABXSGRK66Q6MPJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Experimental Design via Score Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Angus Phillips, Gavin Kerrigan, Tom Rainforth","submitted_at":"2026-07-09T10:21:06Z","abstract_excerpt":"Policy-based approaches to Bayesian experimental design (BED) allow the learning of deep policy networks that adaptively make intelligent design decisions based on previously collected data. However, the training of such policies is often held back by a fundamental challenge: the double intractability of the expected information gain (EIG). This necessitates expensive or complex approximations that restrict the effort one can invest in optimising the policy itself. To address this, we show that the double intractability of the EIG can be isolated from the policy learning by first solving a sco"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08335","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.08335/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-10T01:19:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LHvCsa+UJdFFVEl38RXDO1A3t6lpI9HVxRVaotxkVXohq+4zl747jvqDjZuUT7dV269cDztuNAWpZ+Ad5MKQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T13:51:03.280667Z"},"content_sha256":"d17203066ef0a5d35889e037150044f0eef14973978559f65d00e8bb87bdae9e","schema_version":"1.0","event_id":"sha256:d17203066ef0a5d35889e037150044f0eef14973978559f65d00e8bb87bdae9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4ZA2KO6PG5CEABXSGRK66Q6MPJ/bundle.json","state_url":"https://pith.science/pith/4ZA2KO6PG5CEABXSGRK66Q6MPJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4ZA2KO6PG5CEABXSGRK66Q6MPJ/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-08-04T13:51:03Z","links":{"resolver":"https://pith.science/pith/4ZA2KO6PG5CEABXSGRK66Q6MPJ","bundle":"https://pith.science/pith/4ZA2KO6PG5CEABXSGRK66Q6MPJ/bundle.json","state":"https://pith.science/pith/4ZA2KO6PG5CEABXSGRK66Q6MPJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4ZA2KO6PG5CEABXSGRK66Q6MPJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:4ZA2KO6PG5CEABXSGRK66Q6MPJ","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":"b1849c778fdbef0b576abbb77a48286a264c228e178f71c5abdffddb185d1781","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-07-09T10:21:06Z","title_canon_sha256":"8f35be13b51b01892a73c8f8033628602ccb54b240b252fcbe67e092ff67bcbf"},"schema_version":"1.0","source":{"id":"2607.08335","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.08335","created_at":"2026-07-10T01:19:47Z"},{"alias_kind":"arxiv_version","alias_value":"2607.08335v1","created_at":"2026-07-10T01:19:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08335","created_at":"2026-07-10T01:19:47Z"},{"alias_kind":"pith_short_12","alias_value":"4ZA2KO6PG5CE","created_at":"2026-07-10T01:19:47Z"},{"alias_kind":"pith_short_16","alias_value":"4ZA2KO6PG5CEABXS","created_at":"2026-07-10T01:19:47Z"},{"alias_kind":"pith_short_8","alias_value":"4ZA2KO6P","created_at":"2026-07-10T01:19:47Z"}],"graph_snapshots":[{"event_id":"sha256:d17203066ef0a5d35889e037150044f0eef14973978559f65d00e8bb87bdae9e","target":"graph","created_at":"2026-07-10T01:19:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.08335/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Policy-based approaches to Bayesian experimental design (BED) allow the learning of deep policy networks that adaptively make intelligent design decisions based on previously collected data. However, the training of such policies is often held back by a fundamental challenge: the double intractability of the expected information gain (EIG). This necessitates expensive or complex approximations that restrict the effort one can invest in optimising the policy itself. To address this, we show that the double intractability of the EIG can be isolated from the policy learning by first solving a sco","authors_text":"Angus Phillips, Gavin Kerrigan, Tom Rainforth","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-07-09T10:21:06Z","title":"Bayesian Experimental Design via Score Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.08335","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:6f3ef9733289561d8e97101f0101bccc0e13be4d2fa242aa8ad5f30646a0bfa5","target":"record","created_at":"2026-07-10T01:19:47Z","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":"b1849c778fdbef0b576abbb77a48286a264c228e178f71c5abdffddb185d1781","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2026-07-09T10:21:06Z","title_canon_sha256":"8f35be13b51b01892a73c8f8033628602ccb54b240b252fcbe67e092ff67bcbf"},"schema_version":"1.0","source":{"id":"2607.08335","kind":"arxiv","version":1}},"canonical_sha256":"e641a53bcf37444006f23455ef43cc7a67b9aed2045402abf8ab71f860eafd3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e641a53bcf37444006f23455ef43cc7a67b9aed2045402abf8ab71f860eafd3e","first_computed_at":"2026-07-10T01:19:47.491384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-10T01:19:47.491384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F8FfWs4ScfGy1KMC0c1HsKOCRE0OiCcVBOeX3d+nE9EPBd53CXjAJ0DyrH9Ad/1K3ocukOvgJnLDJpTgYDzUAg==","signature_status":"signed_v1","signed_at":"2026-07-10T01:19:47.491762Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.08335","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f3ef9733289561d8e97101f0101bccc0e13be4d2fa242aa8ad5f30646a0bfa5","sha256:d17203066ef0a5d35889e037150044f0eef14973978559f65d00e8bb87bdae9e"],"state_sha256":"f89d1b34f5c4e5fff8f42b565e8c340e9fcf137d9c3204d6549debb0c24ceab7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+GoJRm99yXNHh91VVBHkca7HvqaxkLTMPeMbQX3Zs/xTITp2pDlk3AGDGG/9u/ynkAvG4D3z7xxIwite4TK+Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T13:51:03.286915Z","bundle_sha256":"fee938a6dbb688fe8192340bfc019ddfb244615d29dc723786f6d1a7d83c7175"}}