{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2000:5XX6S32ZLK4EP5QIYQXJCMSYIE","short_pith_number":"pith:5XX6S32Z","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"},"canonical_sha256":"edefe96f595ab847f608c42e913258412dbe21fd56ee338877077c5dd146a573","source":{"kind":"arxiv","id":"cs/0004001","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0004001","created_at":"2026-07-04T15:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0004001v1","created_at":"2026-07-04T15:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0004001","created_at":"2026-07-04T15:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"5XX6S32ZLK4E","created_at":"2026-07-04T15:02:59Z"},{"alias_kind":"pith_short_16","alias_value":"5XX6S32ZLK4EP5QI","created_at":"2026-07-04T15:02:59Z"},{"alias_kind":"pith_short_8","alias_value":"5XX6S32Z","created_at":"2026-07-04T15:02:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2000:5XX6S32ZLK4EP5QIYQXJCMSYIE","target":"record","payload":{"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"},"canonical_sha256":"edefe96f595ab847f608c42e913258412dbe21fd56ee338877077c5dd146a573","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"},"source_kind":"arxiv","source_id":"cs/0004001","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-07-04T15:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zxpXGt9d4jv5bLAJRanY+kJ+z+aQKel5sj7hZo5gK0taergo2oV3bVP+9BEP/sG2TCnnqj1VG+c0AXpt/uy4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:23:01.156075Z"},"content_sha256":"7d17cad3b331bcc0c652f9eec015f0a4a3eb7cbd17ae57c1fed538157929c53d","schema_version":"1.0","event_id":"sha256:7d17cad3b331bcc0c652f9eec015f0a4a3eb7cbd17ae57c1fed538157929c53d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2000:5XX6S32ZLK4EP5QIYQXJCMSYIE","target":"graph","payload":{"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"},"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-07-04T15:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"01KqCv1M43FCrVLPOo0N5PDIajwrydc6muLqCoLraEOotcnQyO+ZmdSvdvtaXSc4pCLer3kWzRiJx+LNcRk0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T03:23:01.156615Z"},"content_sha256":"ade6046c84135140f1b5259b9deb679fd40837ed170f4934fce397e0cd6e0563","schema_version":"1.0","event_id":"sha256:ade6046c84135140f1b5259b9deb679fd40837ed170f4934fce397e0cd6e0563"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5XX6S32ZLK4EP5QIYQXJCMSYIE/bundle.json","state_url":"https://pith.science/pith/5XX6S32ZLK4EP5QIYQXJCMSYIE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5XX6S32ZLK4EP5QIYQXJCMSYIE/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-05T03:23:01Z","links":{"resolver":"https://pith.science/pith/5XX6S32ZLK4EP5QIYQXJCMSYIE","bundle":"https://pith.science/pith/5XX6S32ZLK4EP5QIYQXJCMSYIE/bundle.json","state":"https://pith.science/pith/5XX6S32ZLK4EP5QIYQXJCMSYIE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5XX6S32ZLK4EP5QIYQXJCMSYIE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2000:5XX6S32ZLK4EP5QIYQXJCMSYIE","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":"5ff867dfea5206f6f32601b01cd673ef17b1f583297dc4579712fe26d9b6398f","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"","primary_cat":"cs.AI","submitted_at":"2000-04-03T06:16:16Z","title_canon_sha256":"e3ade6bf5bb113bcc46bcfc68040f477d4f723f1095c59d6e415472918e8126d"},"schema_version":"1.0","source":{"id":"cs/0004001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0004001","created_at":"2026-07-04T15:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0004001v1","created_at":"2026-07-04T15:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0004001","created_at":"2026-07-04T15:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"5XX6S32ZLK4E","created_at":"2026-07-04T15:02:59Z"},{"alias_kind":"pith_short_16","alias_value":"5XX6S32ZLK4EP5QI","created_at":"2026-07-04T15:02:59Z"},{"alias_kind":"pith_short_8","alias_value":"5XX6S32Z","created_at":"2026-07-04T15:02:59Z"}],"graph_snapshots":[{"event_id":"sha256:ade6046c84135140f1b5259b9deb679fd40837ed170f4934fce397e0cd6e0563","target":"graph","created_at":"2026-07-04T15:02:59Z","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/cs/0004001/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Marcus Hutter","cross_cats":["cs.IT","cs.LG","math.IT"],"headline":"","license":"","primary_cat":"cs.AI","submitted_at":"2000-04-03T06:16:16Z","title":"A Theory of Universal Artificial Intelligence based on Algorithmic Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0004001","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:7d17cad3b331bcc0c652f9eec015f0a4a3eb7cbd17ae57c1fed538157929c53d","target":"record","created_at":"2026-07-04T15:02:59Z","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":"5ff867dfea5206f6f32601b01cd673ef17b1f583297dc4579712fe26d9b6398f","cross_cats_sorted":["cs.IT","cs.LG","math.IT"],"license":"","primary_cat":"cs.AI","submitted_at":"2000-04-03T06:16:16Z","title_canon_sha256":"e3ade6bf5bb113bcc46bcfc68040f477d4f723f1095c59d6e415472918e8126d"},"schema_version":"1.0","source":{"id":"cs/0004001","kind":"arxiv","version":1}},"canonical_sha256":"edefe96f595ab847f608c42e913258412dbe21fd56ee338877077c5dd146a573","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"edefe96f595ab847f608c42e913258412dbe21fd56ee338877077c5dd146a573","first_computed_at":"2026-07-04T15:02:59.384388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:02:59.384388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kl5mryG8D1UhG0JK+s/ZA/A2jSLCAMpQ4pxblVqGd9oH1rlsE/A0yy11s8D4OpkDrcBEPHetWw21my3JKcwKCg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:02:59.384838Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0004001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d17cad3b331bcc0c652f9eec015f0a4a3eb7cbd17ae57c1fed538157929c53d","sha256:ade6046c84135140f1b5259b9deb679fd40837ed170f4934fce397e0cd6e0563"],"state_sha256":"f525a49d61c9c93d67477b3dcf998a5038f2fad852f7767a3d3b50618bb1176e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Yi+Mi7ylUbGSOFXT+VbUn/QQQg7eYPdEJTMvm6qfIwv2icnIsxV6iHRB2ickOpZtLjNXzc7boVZKVrQisWGnDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T03:23:01.161790Z","bundle_sha256":"06b3dc48ca38a329681d119b3ae95145813020b5baee0145f6d2b3ce76218e3a"}}