{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:OTRFW245II4TR3JV5F6HTJMDZW","short_pith_number":"pith:OTRFW245","canonical_record":{"source":{"id":"2403.19381","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-03-28T12:42:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"14e11d4ca75b4c22d31c37f1880e7873267ff61e09d1948dfb8a474eef41d022","abstract_canon_sha256":"df6f2480e8afa08fda57edc15c6d999914a64ad7e628e2e4e70022467db5be72"},"schema_version":"1.0"},"canonical_sha256":"74e25b6b9d423938ed35e97c79a583cd8d91a8f9204f43f670ce723d68c25ea4","source":{"kind":"arxiv","id":"2403.19381","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.19381","created_at":"2026-07-05T09:23:04Z"},{"alias_kind":"arxiv_version","alias_value":"2403.19381v2","created_at":"2026-07-05T09:23:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.19381","created_at":"2026-07-05T09:23:04Z"},{"alias_kind":"pith_short_12","alias_value":"OTRFW245II4T","created_at":"2026-07-05T09:23:04Z"},{"alias_kind":"pith_short_16","alias_value":"OTRFW245II4TR3JV","created_at":"2026-07-05T09:23:04Z"},{"alias_kind":"pith_short_8","alias_value":"OTRFW245","created_at":"2026-07-05T09:23:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:OTRFW245II4TR3JV5F6HTJMDZW","target":"record","payload":{"canonical_record":{"source":{"id":"2403.19381","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-03-28T12:42:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"14e11d4ca75b4c22d31c37f1880e7873267ff61e09d1948dfb8a474eef41d022","abstract_canon_sha256":"df6f2480e8afa08fda57edc15c6d999914a64ad7e628e2e4e70022467db5be72"},"schema_version":"1.0"},"canonical_sha256":"74e25b6b9d423938ed35e97c79a583cd8d91a8f9204f43f670ce723d68c25ea4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:23:04.537573Z","signature_b64":"VfXsCC3t2nXlV8784cxMx221vnKAgeE3iaEnG42eqv8de8bnu5Xz12TI2LiPXPb1rJYY6FLmMr0SiYcuyNvACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74e25b6b9d423938ed35e97c79a583cd8d91a8f9204f43f670ce723d68c25ea4","last_reissued_at":"2026-07-05T09:23:04.537130Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:23:04.537130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.19381","source_version":2,"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-05T09:23:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LlaOhek9amdnT63gEs1tZHejmfu+YiM+nj6mvFWydFX4rw2+BhGxvU3xdin94sJ2HuSyD76oXDDwzzTwjK5IDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T23:43:51.428032Z"},"content_sha256":"b968c6a9f013621e2faf6d031db89718115aef7c42c6a703130af53ed38de790","schema_version":"1.0","event_id":"sha256:b968c6a9f013621e2faf6d031db89718115aef7c42c6a703130af53ed38de790"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:OTRFW245II4TR3JV5F6HTJMDZW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Uncertainty Quantification for Near-Bayes Optimal Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Chris Holmes, Ziyu Wang","submitted_at":"2024-03-28T12:42:25Z","abstract_excerpt":"Bayesian modelling allows for the quantification of predictive uncertainty which is crucial in safety-critical applications. Yet for many machine learning (ML) algorithms, it is difficult to construct or implement their Bayesian counterpart. In this work we present a promising approach to address this challenge, based on the hypothesis that commonly used ML algorithms are efficient across a wide variety of tasks and may thus be near Bayes-optimal w.r.t. an unknown task distribution. We prove that it is possible to recover the Bayesian posterior defined by the task distribution, which is unknow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.19381","kind":"arxiv","version":2},"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/2403.19381/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-05T09:23:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5RAnzMlqFwo/2nKZNHA7jLVd2Y20fSYPSIuTUcDMNFuTREdItMqQEpiPtwWfhVPrIvefEk/dnpwdOhq95ppzCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T23:43:51.428996Z"},"content_sha256":"7908d8b0917fb0210e4a19ce84203b81f21c2add4511a4386f881bdbea2a6f25","schema_version":"1.0","event_id":"sha256:7908d8b0917fb0210e4a19ce84203b81f21c2add4511a4386f881bdbea2a6f25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OTRFW245II4TR3JV5F6HTJMDZW/bundle.json","state_url":"https://pith.science/pith/OTRFW245II4TR3JV5F6HTJMDZW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OTRFW245II4TR3JV5F6HTJMDZW/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-03T23:43:51Z","links":{"resolver":"https://pith.science/pith/OTRFW245II4TR3JV5F6HTJMDZW","bundle":"https://pith.science/pith/OTRFW245II4TR3JV5F6HTJMDZW/bundle.json","state":"https://pith.science/pith/OTRFW245II4TR3JV5F6HTJMDZW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OTRFW245II4TR3JV5F6HTJMDZW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:OTRFW245II4TR3JV5F6HTJMDZW","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":"df6f2480e8afa08fda57edc15c6d999914a64ad7e628e2e4e70022467db5be72","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-03-28T12:42:25Z","title_canon_sha256":"14e11d4ca75b4c22d31c37f1880e7873267ff61e09d1948dfb8a474eef41d022"},"schema_version":"1.0","source":{"id":"2403.19381","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.19381","created_at":"2026-07-05T09:23:04Z"},{"alias_kind":"arxiv_version","alias_value":"2403.19381v2","created_at":"2026-07-05T09:23:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.19381","created_at":"2026-07-05T09:23:04Z"},{"alias_kind":"pith_short_12","alias_value":"OTRFW245II4T","created_at":"2026-07-05T09:23:04Z"},{"alias_kind":"pith_short_16","alias_value":"OTRFW245II4TR3JV","created_at":"2026-07-05T09:23:04Z"},{"alias_kind":"pith_short_8","alias_value":"OTRFW245","created_at":"2026-07-05T09:23:04Z"}],"graph_snapshots":[{"event_id":"sha256:7908d8b0917fb0210e4a19ce84203b81f21c2add4511a4386f881bdbea2a6f25","target":"graph","created_at":"2026-07-05T09:23:04Z","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/2403.19381/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bayesian modelling allows for the quantification of predictive uncertainty which is crucial in safety-critical applications. Yet for many machine learning (ML) algorithms, it is difficult to construct or implement their Bayesian counterpart. In this work we present a promising approach to address this challenge, based on the hypothesis that commonly used ML algorithms are efficient across a wide variety of tasks and may thus be near Bayes-optimal w.r.t. an unknown task distribution. We prove that it is possible to recover the Bayesian posterior defined by the task distribution, which is unknow","authors_text":"Chris Holmes, Ziyu Wang","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-03-28T12:42:25Z","title":"On Uncertainty Quantification for Near-Bayes Optimal Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.19381","kind":"arxiv","version":2},"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:b968c6a9f013621e2faf6d031db89718115aef7c42c6a703130af53ed38de790","target":"record","created_at":"2026-07-05T09:23:04Z","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":"df6f2480e8afa08fda57edc15c6d999914a64ad7e628e2e4e70022467db5be72","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2024-03-28T12:42:25Z","title_canon_sha256":"14e11d4ca75b4c22d31c37f1880e7873267ff61e09d1948dfb8a474eef41d022"},"schema_version":"1.0","source":{"id":"2403.19381","kind":"arxiv","version":2}},"canonical_sha256":"74e25b6b9d423938ed35e97c79a583cd8d91a8f9204f43f670ce723d68c25ea4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74e25b6b9d423938ed35e97c79a583cd8d91a8f9204f43f670ce723d68c25ea4","first_computed_at":"2026-07-05T09:23:04.537130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:23:04.537130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VfXsCC3t2nXlV8784cxMx221vnKAgeE3iaEnG42eqv8de8bnu5Xz12TI2LiPXPb1rJYY6FLmMr0SiYcuyNvACA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:23:04.537573Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.19381","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b968c6a9f013621e2faf6d031db89718115aef7c42c6a703130af53ed38de790","sha256:7908d8b0917fb0210e4a19ce84203b81f21c2add4511a4386f881bdbea2a6f25"],"state_sha256":"fc259ea5f21897c638940cbea57f2e8254b332cf1d089ea0957a23a68f2152c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q99Jz3vyd6SfX8rmt8nzDmUopgYK3Cj7FF6QR1rWq+qbhYILdJuPrAloBMwA90Cd5KtagjE7mU6WxlzFAwp7DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T23:43:51.443735Z","bundle_sha256":"5aade220d77a433b3a86474bea8fd283f7ff609ec16096e8d38ac4b50f0bdcc4"}}