{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4ZA2KO6PG5CEABXSGRK66Q6MPJ","short_pith_number":"pith:4ZA2KO6P","schema_version":"1.0","canonical_sha256":"e641a53bcf37444006f23455ef43cc7a67b9aed2045402abf8ab71f860eafd3e","source":{"kind":"arxiv","id":"2607.08335","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.08335","created_at":"2026-07-10T01:19:47.491451+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.08335v1","created_at":"2026-07-10T01:19:47.491451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.08335","created_at":"2026-07-10T01:19:47.491451+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ZA2KO6PG5CE","created_at":"2026-07-10T01:19:47.491451+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ZA2KO6PG5CEABXS","created_at":"2026-07-10T01:19:47.491451+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ZA2KO6P","created_at":"2026-07-10T01:19:47.491451+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4ZA2KO6PG5CEABXSGRK66Q6MPJ","json":"https://pith.science/pith/4ZA2KO6PG5CEABXSGRK66Q6MPJ.json","graph_json":"https://pith.science/api/pith-number/4ZA2KO6PG5CEABXSGRK66Q6MPJ/graph.json","events_json":"https://pith.science/api/pith-number/4ZA2KO6PG5CEABXSGRK66Q6MPJ/events.json","paper":"https://pith.science/paper/4ZA2KO6P"},"agent_actions":{"view_html":"https://pith.science/pith/4ZA2KO6PG5CEABXSGRK66Q6MPJ","download_json":"https://pith.science/pith/4ZA2KO6PG5CEABXSGRK66Q6MPJ.json","view_paper":"https://pith.science/paper/4ZA2KO6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.08335&json=true","fetch_graph":"https://pith.science/api/pith-number/4ZA2KO6PG5CEABXSGRK66Q6MPJ/graph.json","fetch_events":"https://pith.science/api/pith-number/4ZA2KO6PG5CEABXSGRK66Q6MPJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ZA2KO6PG5CEABXSGRK66Q6MPJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ZA2KO6PG5CEABXSGRK66Q6MPJ/action/storage_attestation","attest_author":"https://pith.science/pith/4ZA2KO6PG5CEABXSGRK66Q6MPJ/action/author_attestation","sign_citation":"https://pith.science/pith/4ZA2KO6PG5CEABXSGRK66Q6MPJ/action/citation_signature","submit_replication":"https://pith.science/pith/4ZA2KO6PG5CEABXSGRK66Q6MPJ/action/replication_record"}},"created_at":"2026-07-10T01:19:47.491451+00:00","updated_at":"2026-07-10T01:19:47.491451+00:00"}