{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CVC76WO76B5HB2DEHLO5XMBSVP","short_pith_number":"pith:CVC76WO7","schema_version":"1.0","canonical_sha256":"1545ff59dff07a70e8643adddbb032abf3156e2ca391696fbd0a3b4947a19aae","source":{"kind":"arxiv","id":"1610.09018","version":6},"attestation_state":"computed","paper":{"title":"Optimal Belief Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","physics.data-an","stat.TH"],"primary_cat":"math.ST","authors_text":"Reimar H. Leike, Torsten A. En{\\ss}lin","submitted_at":"2016-10-27T21:38:08Z","abstract_excerpt":"In Bayesian statistics probability distributions express beliefs. However, for many problems the beliefs cannot be computed analytically and approximations of beliefs are needed. We seek a loss function that quantifies how \"embarrassing\" it is to communicate a given approximation. We reproduce and discuss an old proof showing that there is only one ranking under the requirements that (1) the best ranked approximation is the non-approximated belief and (2) that the ranking judges approximations only by their predictions for actual outcomes. The loss function that is obtained in the derivation i"},"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":"1610.09018","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2016-10-27T21:38:08Z","cross_cats_sorted":["cs.AI","physics.data-an","stat.TH"],"title_canon_sha256":"24019f17e65db96f8c1dfd11ce9e4df932fc4da91c01fd1dc5982de210e3c7eb","abstract_canon_sha256":"b90bfcc4aa06bd0ea5ab8d6b4081230f42647a621eb65a61dcb8fa163f7b4924"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:39.857311Z","signature_b64":"ByPbUHr6r8XPpUUBRDm7wWSloobKSFsKilgjvQWVsw6zeNk4c4KZZ+F5FHdxTB7dP7HzIQMlgoHw/sPaH0zVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1545ff59dff07a70e8643adddbb032abf3156e2ca391696fbd0a3b4947a19aae","last_reissued_at":"2026-05-18T00:38:39.856842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:39.856842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Belief Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","physics.data-an","stat.TH"],"primary_cat":"math.ST","authors_text":"Reimar H. Leike, Torsten A. En{\\ss}lin","submitted_at":"2016-10-27T21:38:08Z","abstract_excerpt":"In Bayesian statistics probability distributions express beliefs. However, for many problems the beliefs cannot be computed analytically and approximations of beliefs are needed. We seek a loss function that quantifies how \"embarrassing\" it is to communicate a given approximation. We reproduce and discuss an old proof showing that there is only one ranking under the requirements that (1) the best ranked approximation is the non-approximated belief and (2) that the ranking judges approximations only by their predictions for actual outcomes. The loss function that is obtained in the derivation i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09018","kind":"arxiv","version":6},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.09018","created_at":"2026-05-18T00:38:39.856913+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09018v6","created_at":"2026-05-18T00:38:39.856913+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09018","created_at":"2026-05-18T00:38:39.856913+00:00"},{"alias_kind":"pith_short_12","alias_value":"CVC76WO76B5H","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CVC76WO76B5HB2DE","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CVC76WO7","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.04088","citing_title":"Quantifying imperfect cognition via achieved information gain","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CVC76WO76B5HB2DEHLO5XMBSVP","json":"https://pith.science/pith/CVC76WO76B5HB2DEHLO5XMBSVP.json","graph_json":"https://pith.science/api/pith-number/CVC76WO76B5HB2DEHLO5XMBSVP/graph.json","events_json":"https://pith.science/api/pith-number/CVC76WO76B5HB2DEHLO5XMBSVP/events.json","paper":"https://pith.science/paper/CVC76WO7"},"agent_actions":{"view_html":"https://pith.science/pith/CVC76WO76B5HB2DEHLO5XMBSVP","download_json":"https://pith.science/pith/CVC76WO76B5HB2DEHLO5XMBSVP.json","view_paper":"https://pith.science/paper/CVC76WO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09018&json=true","fetch_graph":"https://pith.science/api/pith-number/CVC76WO76B5HB2DEHLO5XMBSVP/graph.json","fetch_events":"https://pith.science/api/pith-number/CVC76WO76B5HB2DEHLO5XMBSVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CVC76WO76B5HB2DEHLO5XMBSVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CVC76WO76B5HB2DEHLO5XMBSVP/action/storage_attestation","attest_author":"https://pith.science/pith/CVC76WO76B5HB2DEHLO5XMBSVP/action/author_attestation","sign_citation":"https://pith.science/pith/CVC76WO76B5HB2DEHLO5XMBSVP/action/citation_signature","submit_replication":"https://pith.science/pith/CVC76WO76B5HB2DEHLO5XMBSVP/action/replication_record"}},"created_at":"2026-05-18T00:38:39.856913+00:00","updated_at":"2026-05-18T00:38:39.856913+00:00"}