{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NRZHZKP72BUTKXTA7DIH4NKAPC","short_pith_number":"pith:NRZHZKP7","canonical_record":{"source":{"id":"2408.12065","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-08-22T02:05:44Z","cross_cats_sorted":[],"title_canon_sha256":"ee953a05a1664139d8b54480397aa0932528b852bebdcd61a4c323e3a0346596","abstract_canon_sha256":"4d9ee9115dcf1b602050b359207ac2c007d844d9626ebb76502d2e7fa473c7a2"},"schema_version":"1.0"},"canonical_sha256":"6c727ca9ffd069355e60f8d07e354078937d175ce8f850cffc643bfb23743f87","source":{"kind":"arxiv","id":"2408.12065","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.12065","created_at":"2026-07-05T08:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"2408.12065v1","created_at":"2026-07-05T08:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.12065","created_at":"2026-07-05T08:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"NRZHZKP72BUT","created_at":"2026-07-05T08:58:03Z"},{"alias_kind":"pith_short_16","alias_value":"NRZHZKP72BUTKXTA","created_at":"2026-07-05T08:58:03Z"},{"alias_kind":"pith_short_8","alias_value":"NRZHZKP7","created_at":"2026-07-05T08:58:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NRZHZKP72BUTKXTA7DIH4NKAPC","target":"record","payload":{"canonical_record":{"source":{"id":"2408.12065","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-08-22T02:05:44Z","cross_cats_sorted":[],"title_canon_sha256":"ee953a05a1664139d8b54480397aa0932528b852bebdcd61a4c323e3a0346596","abstract_canon_sha256":"4d9ee9115dcf1b602050b359207ac2c007d844d9626ebb76502d2e7fa473c7a2"},"schema_version":"1.0"},"canonical_sha256":"6c727ca9ffd069355e60f8d07e354078937d175ce8f850cffc643bfb23743f87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:58:03.348017Z","signature_b64":"WltjYS2Tfx6X8Ohm1B28M0dky5DQqEEoiAvecI0i6ZY8mef21ibG9SgrrY6rNN6DVeRR3gdKFWiBJRjgUa73Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c727ca9ffd069355e60f8d07e354078937d175ce8f850cffc643bfb23743f87","last_reissued_at":"2026-07-05T08:58:03.347665Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:58:03.347665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.12065","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-05T08:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2ukwhRey4IwzZ/NJJwxtJYmlEXlAeblPN5sG9nKopBI2n0OmPpTmLn+qsIC1Y2vHqaa0KCNfvaMF6l2b2tDSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:42:53.047791Z"},"content_sha256":"982ea06f5112e8c4f8e537c9463795d87383f930a7612d9d95a310bf7ba8eeba","schema_version":"1.0","event_id":"sha256:982ea06f5112e8c4f8e537c9463795d87383f930a7612d9d95a310bf7ba8eeba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NRZHZKP72BUTKXTA7DIH4NKAPC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Transformers As Approximations of Solomonoff Induction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Michael Witbrock, Nathan Young","submitted_at":"2024-08-22T02:05:44Z","abstract_excerpt":"Solomonoff Induction is an optimal-in-the-limit unbounded algorithm for sequence prediction, representing a Bayesian mixture of every computable probability distribution and performing close to optimally in predicting any computable sequence.\n  Being an optimal form of computational sequence prediction, it seems plausible that it may be used as a model against which other methods of sequence prediction might be compared.\n  We put forth and explore the hypothesis that Transformer models - the basis of Large Language Models - approximate Solomonoff Induction better than any other extant sequence"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.12065","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/2408.12065/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-05T08:58:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gk1mU8cjzh6OgT03ra/82jgIGx8CGzvKMi96heKt2EbrxtKexZNqqOESnyEQ9t3zDj46ARZgdkswHnG6l9VGAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T04:42:53.048291Z"},"content_sha256":"d59f26a83db5adcc4585126d1f082611ddf27b19b9a1b759dffa51a7d0958ec4","schema_version":"1.0","event_id":"sha256:d59f26a83db5adcc4585126d1f082611ddf27b19b9a1b759dffa51a7d0958ec4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NRZHZKP72BUTKXTA7DIH4NKAPC/bundle.json","state_url":"https://pith.science/pith/NRZHZKP72BUTKXTA7DIH4NKAPC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NRZHZKP72BUTKXTA7DIH4NKAPC/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-08T04:42:53Z","links":{"resolver":"https://pith.science/pith/NRZHZKP72BUTKXTA7DIH4NKAPC","bundle":"https://pith.science/pith/NRZHZKP72BUTKXTA7DIH4NKAPC/bundle.json","state":"https://pith.science/pith/NRZHZKP72BUTKXTA7DIH4NKAPC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NRZHZKP72BUTKXTA7DIH4NKAPC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NRZHZKP72BUTKXTA7DIH4NKAPC","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":"4d9ee9115dcf1b602050b359207ac2c007d844d9626ebb76502d2e7fa473c7a2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-08-22T02:05:44Z","title_canon_sha256":"ee953a05a1664139d8b54480397aa0932528b852bebdcd61a4c323e3a0346596"},"schema_version":"1.0","source":{"id":"2408.12065","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.12065","created_at":"2026-07-05T08:58:03Z"},{"alias_kind":"arxiv_version","alias_value":"2408.12065v1","created_at":"2026-07-05T08:58:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.12065","created_at":"2026-07-05T08:58:03Z"},{"alias_kind":"pith_short_12","alias_value":"NRZHZKP72BUT","created_at":"2026-07-05T08:58:03Z"},{"alias_kind":"pith_short_16","alias_value":"NRZHZKP72BUTKXTA","created_at":"2026-07-05T08:58:03Z"},{"alias_kind":"pith_short_8","alias_value":"NRZHZKP7","created_at":"2026-07-05T08:58:03Z"}],"graph_snapshots":[{"event_id":"sha256:d59f26a83db5adcc4585126d1f082611ddf27b19b9a1b759dffa51a7d0958ec4","target":"graph","created_at":"2026-07-05T08:58:03Z","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/2408.12065/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Solomonoff Induction is an optimal-in-the-limit unbounded algorithm for sequence prediction, representing a Bayesian mixture of every computable probability distribution and performing close to optimally in predicting any computable sequence.\n  Being an optimal form of computational sequence prediction, it seems plausible that it may be used as a model against which other methods of sequence prediction might be compared.\n  We put forth and explore the hypothesis that Transformer models - the basis of Large Language Models - approximate Solomonoff Induction better than any other extant sequence","authors_text":"Michael Witbrock, Nathan Young","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-08-22T02:05:44Z","title":"Transformers As Approximations of Solomonoff Induction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.12065","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:982ea06f5112e8c4f8e537c9463795d87383f930a7612d9d95a310bf7ba8eeba","target":"record","created_at":"2026-07-05T08:58:03Z","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":"4d9ee9115dcf1b602050b359207ac2c007d844d9626ebb76502d2e7fa473c7a2","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-08-22T02:05:44Z","title_canon_sha256":"ee953a05a1664139d8b54480397aa0932528b852bebdcd61a4c323e3a0346596"},"schema_version":"1.0","source":{"id":"2408.12065","kind":"arxiv","version":1}},"canonical_sha256":"6c727ca9ffd069355e60f8d07e354078937d175ce8f850cffc643bfb23743f87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c727ca9ffd069355e60f8d07e354078937d175ce8f850cffc643bfb23743f87","first_computed_at":"2026-07-05T08:58:03.347665Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:58:03.347665Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WltjYS2Tfx6X8Ohm1B28M0dky5DQqEEoiAvecI0i6ZY8mef21ibG9SgrrY6rNN6DVeRR3gdKFWiBJRjgUa73Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:58:03.348017Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.12065","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:982ea06f5112e8c4f8e537c9463795d87383f930a7612d9d95a310bf7ba8eeba","sha256:d59f26a83db5adcc4585126d1f082611ddf27b19b9a1b759dffa51a7d0958ec4"],"state_sha256":"7599db6664f8fc7b47999eb96b3c29134e9cd179fec17daf84fa94cffcc5775e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9ZwuwiQ4Ree83hJeBvTQ4gGw0Bmkvl7NE0BgCm62rarOlQiv9VcFEdfDQGAwCmklPU7QBxXGtzS26sAu3HxeBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T04:42:53.053026Z","bundle_sha256":"593a823f5485b25f2bf7515a80050505cf47760e6b1f327b231f3f212dd6ca42"}}