{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HYUIDMI25GMMJFF7JS5YHYUA4U","short_pith_number":"pith:HYUIDMI2","schema_version":"1.0","canonical_sha256":"3e2881b11ae998c494bf4cbb83e280e52a958218e813cf7541b3b4da5293f87d","source":{"kind":"arxiv","id":"1510.04931","version":1},"attestation_state":"computed","paper":{"title":"Bad Universal Priors and Notions of Optimality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Jan Leike, Marcus Hutter","submitted_at":"2015-10-16T16:22:23Z","abstract_excerpt":"A big open question of algorithmic information theory is the choice of the universal Turing machine (UTM). For Kolmogorov complexity and Solomonoff induction we have invariance theorems: the choice of the UTM changes bounds only by a constant. For the universally intelligent agent AIXI (Hutter, 2005) no invariance theorem is known. Our results are entirely negative: we discuss cases in which unlucky or adversarial choices of the UTM cause AIXI to misbehave drastically. We show that Legg-Hutter intelligence and thus balanced Pareto optimality is entirely subjective, and that every policy is Par"},"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":"1510.04931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-10-16T16:22:23Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2a7df890287945c6d5f8ba5143d289e0e0fcfa736c69b3a6cc4578adc38feb5a","abstract_canon_sha256":"3c3920f3eb0cb9701ded538b7aaff015cd37232ecb9375f1e6eae42107bdde39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:53.435582Z","signature_b64":"8gUS9fJ718y2xnX/lw14sbMEykRNMtax+Sca4rLjku0pPVc0Y5eE4O7KLCOV14Ikw6gfqCrYS5liMN1k+esJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e2881b11ae998c494bf4cbb83e280e52a958218e813cf7541b3b4da5293f87d","last_reissued_at":"2026-05-18T01:29:53.434855Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:53.434855Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bad Universal Priors and Notions of Optimality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Jan Leike, Marcus Hutter","submitted_at":"2015-10-16T16:22:23Z","abstract_excerpt":"A big open question of algorithmic information theory is the choice of the universal Turing machine (UTM). For Kolmogorov complexity and Solomonoff induction we have invariance theorems: the choice of the UTM changes bounds only by a constant. For the universally intelligent agent AIXI (Hutter, 2005) no invariance theorem is known. Our results are entirely negative: we discuss cases in which unlucky or adversarial choices of the UTM cause AIXI to misbehave drastically. We show that Legg-Hutter intelligence and thus balanced Pareto optimality is entirely subjective, and that every policy is Par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04931","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":"1510.04931","created_at":"2026-05-18T01:29:53.434964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.04931v1","created_at":"2026-05-18T01:29:53.434964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04931","created_at":"2026-05-18T01:29:53.434964+00:00"},{"alias_kind":"pith_short_12","alias_value":"HYUIDMI25GMM","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HYUIDMI25GMMJFF7","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HYUIDMI2","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.01005","citing_title":"Hierarchical Solomonoff Induction: An Unbounded Machine Learning Model","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HYUIDMI25GMMJFF7JS5YHYUA4U","json":"https://pith.science/pith/HYUIDMI25GMMJFF7JS5YHYUA4U.json","graph_json":"https://pith.science/api/pith-number/HYUIDMI25GMMJFF7JS5YHYUA4U/graph.json","events_json":"https://pith.science/api/pith-number/HYUIDMI25GMMJFF7JS5YHYUA4U/events.json","paper":"https://pith.science/paper/HYUIDMI2"},"agent_actions":{"view_html":"https://pith.science/pith/HYUIDMI25GMMJFF7JS5YHYUA4U","download_json":"https://pith.science/pith/HYUIDMI25GMMJFF7JS5YHYUA4U.json","view_paper":"https://pith.science/paper/HYUIDMI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.04931&json=true","fetch_graph":"https://pith.science/api/pith-number/HYUIDMI25GMMJFF7JS5YHYUA4U/graph.json","fetch_events":"https://pith.science/api/pith-number/HYUIDMI25GMMJFF7JS5YHYUA4U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HYUIDMI25GMMJFF7JS5YHYUA4U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HYUIDMI25GMMJFF7JS5YHYUA4U/action/storage_attestation","attest_author":"https://pith.science/pith/HYUIDMI25GMMJFF7JS5YHYUA4U/action/author_attestation","sign_citation":"https://pith.science/pith/HYUIDMI25GMMJFF7JS5YHYUA4U/action/citation_signature","submit_replication":"https://pith.science/pith/HYUIDMI25GMMJFF7JS5YHYUA4U/action/replication_record"}},"created_at":"2026-05-18T01:29:53.434964+00:00","updated_at":"2026-05-18T01:29:53.434964+00:00"}