{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2000:5XX6S32ZLK4EP5QIYQXJCMSYIE","short_pith_number":"pith:5XX6S32Z","schema_version":"1.0","canonical_sha256":"edefe96f595ab847f608c42e913258412dbe21fd56ee338877077c5dd146a573","source":{"kind":"arxiv","id":"cs/0004001","version":1},"attestation_state":"computed","paper":{"title":"A Theory of Universal Artificial Intelligence based on Algorithmic Complexity","license":"","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cs.AI","authors_text":"Marcus Hutter","submitted_at":"2000-04-03T06:16:16Z","abstract_excerpt":"Decision theory formally solves the problem of rational agents in uncertain worlds if the true environmental prior probability distribution is known. Solomonoff's theory of universal induction formally solves the problem of sequence prediction for unknown prior distribution. We combine both ideas and get a parameterless theory of universal Artificial Intelligence. We give strong arguments that the resulting AIXI model is the most intelligent unbiased agent possible. We outline for a number of problem classes, including sequence prediction, strategic games, function minimization, reinforcement "},"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":"cs/0004001","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.AI","submitted_at":"2000-04-03T06:16:16Z","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"title_canon_sha256":"e3ade6bf5bb113bcc46bcfc68040f477d4f723f1095c59d6e415472918e8126d","abstract_canon_sha256":"5ff867dfea5206f6f32601b01cd673ef17b1f583297dc4579712fe26d9b6398f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:02:59.384838Z","signature_b64":"kl5mryG8D1UhG0JK+s/ZA/A2jSLCAMpQ4pxblVqGd9oH1rlsE/A0yy11s8D4OpkDrcBEPHetWw21my3JKcwKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"edefe96f595ab847f608c42e913258412dbe21fd56ee338877077c5dd146a573","last_reissued_at":"2026-07-04T15:02:59.384388Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:02:59.384388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Theory of Universal Artificial Intelligence based on Algorithmic Complexity","license":"","headline":"","cross_cats":["cs.IT","cs.LG","math.IT"],"primary_cat":"cs.AI","authors_text":"Marcus Hutter","submitted_at":"2000-04-03T06:16:16Z","abstract_excerpt":"Decision theory formally solves the problem of rational agents in uncertain worlds if the true environmental prior probability distribution is known. Solomonoff's theory of universal induction formally solves the problem of sequence prediction for unknown prior distribution. We combine both ideas and get a parameterless theory of universal Artificial Intelligence. We give strong arguments that the resulting AIXI model is the most intelligent unbiased agent possible. We outline for a number of problem classes, including sequence prediction, strategic games, function minimization, reinforcement "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0004001","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/cs/0004001/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0004001","created_at":"2026-07-04T15:02:59.384443+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0004001v1","created_at":"2026-07-04T15:02:59.384443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0004001","created_at":"2026-07-04T15:02:59.384443+00:00"},{"alias_kind":"pith_short_12","alias_value":"5XX6S32ZLK4E","created_at":"2026-07-04T15:02:59.384443+00:00"},{"alias_kind":"pith_short_16","alias_value":"5XX6S32ZLK4EP5QI","created_at":"2026-07-04T15:02:59.384443+00:00"},{"alias_kind":"pith_short_8","alias_value":"5XX6S32Z","created_at":"2026-07-04T15:02:59.384443+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2602.23242","citing_title":"A Model-Free Universal AI","ref_index":4,"is_internal_anchor":true},{"citing_arxiv_id":"2603.25414","citing_title":"Decidable By Construction: Design-Time Verification for Trustworthy AI","ref_index":16,"is_internal_anchor":true},{"citing_arxiv_id":"2605.02175","citing_title":"Intervention Complexity as a Canonical Reward and a Measure of Intelligence","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2309.07864","citing_title":"The Rise and Potential of Large Language Model Based Agents: A Survey","ref_index":232,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5XX6S32ZLK4EP5QIYQXJCMSYIE","json":"https://pith.science/pith/5XX6S32ZLK4EP5QIYQXJCMSYIE.json","graph_json":"https://pith.science/api/pith-number/5XX6S32ZLK4EP5QIYQXJCMSYIE/graph.json","events_json":"https://pith.science/api/pith-number/5XX6S32ZLK4EP5QIYQXJCMSYIE/events.json","paper":"https://pith.science/paper/5XX6S32Z"},"agent_actions":{"view_html":"https://pith.science/pith/5XX6S32ZLK4EP5QIYQXJCMSYIE","download_json":"https://pith.science/pith/5XX6S32ZLK4EP5QIYQXJCMSYIE.json","view_paper":"https://pith.science/paper/5XX6S32Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0004001&json=true","fetch_graph":"https://pith.science/api/pith-number/5XX6S32ZLK4EP5QIYQXJCMSYIE/graph.json","fetch_events":"https://pith.science/api/pith-number/5XX6S32ZLK4EP5QIYQXJCMSYIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5XX6S32ZLK4EP5QIYQXJCMSYIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5XX6S32ZLK4EP5QIYQXJCMSYIE/action/storage_attestation","attest_author":"https://pith.science/pith/5XX6S32ZLK4EP5QIYQXJCMSYIE/action/author_attestation","sign_citation":"https://pith.science/pith/5XX6S32ZLK4EP5QIYQXJCMSYIE/action/citation_signature","submit_replication":"https://pith.science/pith/5XX6S32ZLK4EP5QIYQXJCMSYIE/action/replication_record"}},"created_at":"2026-07-04T15:02:59.384443+00:00","updated_at":"2026-07-04T15:02:59.384443+00:00"}