{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QINLCGG5VJPGZG4HIIGZ2FRS4B","short_pith_number":"pith:QINLCGG5","schema_version":"1.0","canonical_sha256":"821ab118ddaa5e6c9b87420d9d1632e0544a29966e0b31ca425c1afaeedbace5","source":{"kind":"arxiv","id":"1609.05058","version":1},"attestation_state":"computed","paper":{"title":"A Formal Solution to the Grain of Truth Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG"],"primary_cat":"cs.AI","authors_text":"Benya Fallenstein, Jan Leike, Jessica Taylor","submitted_at":"2016-09-16T14:00:51Z","abstract_excerpt":"A Bayesian agent acting in a multi-agent environment learns to predict the other agents' policies if its prior assigns positive probability to them (in other words, its prior contains a \\emph{grain of truth}). Finding a reasonably large class of policies that contains the Bayes-optimal policies with respect to this class is known as the \\emph{grain of truth problem}. Only small classes are known to have a grain of truth and the literature contains several related impossibility results. In this paper we present a formal and general solution to the full grain of truth problem: we construct a cla"},"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":"1609.05058","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-09-16T14:00:51Z","cross_cats_sorted":["cs.GT","cs.LG"],"title_canon_sha256":"cc9eda4a3b116a6e2629cb9475ea79aaa4a1365461521ea211815b80b40f3236","abstract_canon_sha256":"3ad5fe6187bf8a7ce92d8d25ca1703051e2380b36cf29eb9a5dde2ab6eddd241"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:17.161134Z","signature_b64":"+DAqNYiAYZJ3uXDVD1HpiYNsMjlHkJQFIgmcTE6O1P78D2SZgrQQZE6v5CVW+K6H66k9SO4DmKJkkxB0mnAoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"821ab118ddaa5e6c9b87420d9d1632e0544a29966e0b31ca425c1afaeedbace5","last_reissued_at":"2026-05-18T01:04:17.160771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:17.160771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Formal Solution to the Grain of Truth Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LG"],"primary_cat":"cs.AI","authors_text":"Benya Fallenstein, Jan Leike, Jessica Taylor","submitted_at":"2016-09-16T14:00:51Z","abstract_excerpt":"A Bayesian agent acting in a multi-agent environment learns to predict the other agents' policies if its prior assigns positive probability to them (in other words, its prior contains a \\emph{grain of truth}). Finding a reasonably large class of policies that contains the Bayes-optimal policies with respect to this class is known as the \\emph{grain of truth problem}. Only small classes are known to have a grain of truth and the literature contains several related impossibility results. In this paper we present a formal and general solution to the full grain of truth problem: we construct a cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05058","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":""},"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":"1609.05058","created_at":"2026-05-18T01:04:17.160829+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.05058v1","created_at":"2026-05-18T01:04:17.160829+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05058","created_at":"2026-05-18T01:04:17.160829+00:00"},{"alias_kind":"pith_short_12","alias_value":"QINLCGG5VJPG","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QINLCGG5VJPGZG4H","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QINLCGG5","created_at":"2026-05-18T12:30:39.010887+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2602.23242","citing_title":"A Model-Free Universal AI","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QINLCGG5VJPGZG4HIIGZ2FRS4B","json":"https://pith.science/pith/QINLCGG5VJPGZG4HIIGZ2FRS4B.json","graph_json":"https://pith.science/api/pith-number/QINLCGG5VJPGZG4HIIGZ2FRS4B/graph.json","events_json":"https://pith.science/api/pith-number/QINLCGG5VJPGZG4HIIGZ2FRS4B/events.json","paper":"https://pith.science/paper/QINLCGG5"},"agent_actions":{"view_html":"https://pith.science/pith/QINLCGG5VJPGZG4HIIGZ2FRS4B","download_json":"https://pith.science/pith/QINLCGG5VJPGZG4HIIGZ2FRS4B.json","view_paper":"https://pith.science/paper/QINLCGG5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.05058&json=true","fetch_graph":"https://pith.science/api/pith-number/QINLCGG5VJPGZG4HIIGZ2FRS4B/graph.json","fetch_events":"https://pith.science/api/pith-number/QINLCGG5VJPGZG4HIIGZ2FRS4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QINLCGG5VJPGZG4HIIGZ2FRS4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QINLCGG5VJPGZG4HIIGZ2FRS4B/action/storage_attestation","attest_author":"https://pith.science/pith/QINLCGG5VJPGZG4HIIGZ2FRS4B/action/author_attestation","sign_citation":"https://pith.science/pith/QINLCGG5VJPGZG4HIIGZ2FRS4B/action/citation_signature","submit_replication":"https://pith.science/pith/QINLCGG5VJPGZG4HIIGZ2FRS4B/action/replication_record"}},"created_at":"2026-05-18T01:04:17.160829+00:00","updated_at":"2026-05-18T01:04:17.160829+00:00"}