{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KLC72B3BDA75FSGUABIOELLEUN","short_pith_number":"pith:KLC72B3B","canonical_record":{"source":{"id":"2608.11181","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CC","submitted_at":"2026-08-11T17:41:39Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"d1c5c8a06f38d9fadbddcf4703b9e1bb1666db6c7b42c4d84baa2958fd34ae23","abstract_canon_sha256":"838bc5aa88005b1fbf3b004d29295a54d7b4282e6e550eb7a242ab8e494b7b4b"},"schema_version":"1.0"},"canonical_sha256":"52c5fd0761183fd2c8d40050e22d64a36a1fc147777bd479b1f332923628d417","source":{"kind":"arxiv","id":"2608.11181","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.11181","created_at":"2026-08-12T01:24:45Z"},{"alias_kind":"arxiv_version","alias_value":"2608.11181v1","created_at":"2026-08-12T01:24:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11181","created_at":"2026-08-12T01:24:45Z"},{"alias_kind":"pith_short_12","alias_value":"KLC72B3BDA75","created_at":"2026-08-12T01:24:45Z"},{"alias_kind":"pith_short_16","alias_value":"KLC72B3BDA75FSGU","created_at":"2026-08-12T01:24:45Z"},{"alias_kind":"pith_short_8","alias_value":"KLC72B3B","created_at":"2026-08-12T01:24:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KLC72B3BDA75FSGUABIOELLEUN","target":"record","payload":{"canonical_record":{"source":{"id":"2608.11181","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CC","submitted_at":"2026-08-11T17:41:39Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"d1c5c8a06f38d9fadbddcf4703b9e1bb1666db6c7b42c4d84baa2958fd34ae23","abstract_canon_sha256":"838bc5aa88005b1fbf3b004d29295a54d7b4282e6e550eb7a242ab8e494b7b4b"},"schema_version":"1.0"},"canonical_sha256":"52c5fd0761183fd2c8d40050e22d64a36a1fc147777bd479b1f332923628d417","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-12T01:24:45.975188Z","signature_b64":"uBxWrpVi28q0KnbREYBuWwIx7N3AtX+pUeYwuzKSa4rodaWT5dUwaa2l7Obdw2vVlsxWc/lQ8yN5C6Nixe+iAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52c5fd0761183fd2c8d40050e22d64a36a1fc147777bd479b1f332923628d417","last_reissued_at":"2026-08-12T01:24:45.973486Z","signature_status":"signed_v1","first_computed_at":"2026-08-12T01:24:45.973486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.11181","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-08-12T01:24:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MUGuaC81R3pLTrriZQzsSuuNOwIjEJCUXMEb/ZgYzDk01MxExUjIe5khNmE9+cOxxOM7d/mbgfkkCeY2QrmtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:36:19.592592Z"},"content_sha256":"3955ea893a5ac0405b81d823bbea3beeee9156433957b0ef7914b8bdb2accfe1","schema_version":"1.0","event_id":"sha256:3955ea893a5ac0405b81d823bbea3beeee9156433957b0ef7914b8bdb2accfe1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KLC72B3BDA75FSGUABIOELLEUN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How to Verify Consistency of Probabilistic Claims","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CC","authors_text":"Oliver Richardson, Orr Paradise, Shafi Goldwasser, Yoshua Bengio","submitted_at":"2026-08-11T17:41:39Z","abstract_excerpt":"When a probabilistic predictor answers many conditional-probability queries, are its answers self-consistent, and can this be verified in polynomial time? This problem is of interest for AI safety, where safety is derived from honesty about probabilistic predictions of unwanted outcomes potentially caused by an AI action. We construct an interactive PCP as follows. Let a predictive model be specified by a probability circuit P and a circuit Q which outputs confidence in predictions. Together, P and Q implicitly specify exponentially many probabilistic claims. We show a protocol in which a poly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11181","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/2608.11181/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-08-12T01:24:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tzrQQdgCGGxGOnczdw2UY2AqKZOWCgWuV+6url9Ol6h8zxIxVUnvDjprq/WkQdb9YJ+hDOCI1iHmS9NbQGTdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T08:36:19.593098Z"},"content_sha256":"f84e701a94a680e2a50adef25230c919e9ed17f5875b4601f29a68f59cd2670b","schema_version":"1.0","event_id":"sha256:f84e701a94a680e2a50adef25230c919e9ed17f5875b4601f29a68f59cd2670b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KLC72B3BDA75FSGUABIOELLEUN/bundle.json","state_url":"https://pith.science/pith/KLC72B3BDA75FSGUABIOELLEUN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KLC72B3BDA75FSGUABIOELLEUN/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-18T08:36:19Z","links":{"resolver":"https://pith.science/pith/KLC72B3BDA75FSGUABIOELLEUN","bundle":"https://pith.science/pith/KLC72B3BDA75FSGUABIOELLEUN/bundle.json","state":"https://pith.science/pith/KLC72B3BDA75FSGUABIOELLEUN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KLC72B3BDA75FSGUABIOELLEUN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KLC72B3BDA75FSGUABIOELLEUN","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":"838bc5aa88005b1fbf3b004d29295a54d7b4282e6e550eb7a242ab8e494b7b4b","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CC","submitted_at":"2026-08-11T17:41:39Z","title_canon_sha256":"d1c5c8a06f38d9fadbddcf4703b9e1bb1666db6c7b42c4d84baa2958fd34ae23"},"schema_version":"1.0","source":{"id":"2608.11181","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.11181","created_at":"2026-08-12T01:24:45Z"},{"alias_kind":"arxiv_version","alias_value":"2608.11181v1","created_at":"2026-08-12T01:24:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.11181","created_at":"2026-08-12T01:24:45Z"},{"alias_kind":"pith_short_12","alias_value":"KLC72B3BDA75","created_at":"2026-08-12T01:24:45Z"},{"alias_kind":"pith_short_16","alias_value":"KLC72B3BDA75FSGU","created_at":"2026-08-12T01:24:45Z"},{"alias_kind":"pith_short_8","alias_value":"KLC72B3B","created_at":"2026-08-12T01:24:45Z"}],"graph_snapshots":[{"event_id":"sha256:f84e701a94a680e2a50adef25230c919e9ed17f5875b4601f29a68f59cd2670b","target":"graph","created_at":"2026-08-12T01:24:45Z","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/2608.11181/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"When a probabilistic predictor answers many conditional-probability queries, are its answers self-consistent, and can this be verified in polynomial time? This problem is of interest for AI safety, where safety is derived from honesty about probabilistic predictions of unwanted outcomes potentially caused by an AI action. We construct an interactive PCP as follows. Let a predictive model be specified by a probability circuit P and a circuit Q which outputs confidence in predictions. Together, P and Q implicitly specify exponentially many probabilistic claims. We show a protocol in which a poly","authors_text":"Oliver Richardson, Orr Paradise, Shafi Goldwasser, Yoshua Bengio","cross_cats":["cs.AI","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CC","submitted_at":"2026-08-11T17:41:39Z","title":"How to Verify Consistency of Probabilistic Claims"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.11181","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:3955ea893a5ac0405b81d823bbea3beeee9156433957b0ef7914b8bdb2accfe1","target":"record","created_at":"2026-08-12T01:24:45Z","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":"838bc5aa88005b1fbf3b004d29295a54d7b4282e6e550eb7a242ab8e494b7b4b","cross_cats_sorted":["cs.AI","cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.CC","submitted_at":"2026-08-11T17:41:39Z","title_canon_sha256":"d1c5c8a06f38d9fadbddcf4703b9e1bb1666db6c7b42c4d84baa2958fd34ae23"},"schema_version":"1.0","source":{"id":"2608.11181","kind":"arxiv","version":1}},"canonical_sha256":"52c5fd0761183fd2c8d40050e22d64a36a1fc147777bd479b1f332923628d417","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52c5fd0761183fd2c8d40050e22d64a36a1fc147777bd479b1f332923628d417","first_computed_at":"2026-08-12T01:24:45.973486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-12T01:24:45.973486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uBxWrpVi28q0KnbREYBuWwIx7N3AtX+pUeYwuzKSa4rodaWT5dUwaa2l7Obdw2vVlsxWc/lQ8yN5C6Nixe+iAg==","signature_status":"signed_v1","signed_at":"2026-08-12T01:24:45.975188Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.11181","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3955ea893a5ac0405b81d823bbea3beeee9156433957b0ef7914b8bdb2accfe1","sha256:f84e701a94a680e2a50adef25230c919e9ed17f5875b4601f29a68f59cd2670b"],"state_sha256":"2d9cffe2c72e1943dd572c915ca9fcca8424a4cc8ba9f8664ab85fd653f6d61d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+VhgwrTKNhso7n84bT/yvV/DZIXtsBGw3L9rQsnFGM4SBE5YhO0zoa0ccDHPvcUb8JtaJO4VdgnEs7AKaVmECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T08:36:19.599395Z","bundle_sha256":"aaa3c242ec52771032bb5999e518303165f671e63894a4a3903a286c384aafed"}}