{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:SKFNARGPZSISZAXQXA43QK7HQZ","short_pith_number":"pith:SKFNARGP","canonical_record":{"source":{"id":"2301.04589","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-01-10T02:37:44Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"86b3c92963c7637ea1a7695a655a9248d23dbc3ec6353a5a72615c4ba8532661","abstract_canon_sha256":"6d263cbe94b57dde7e6c9e6e0a54adb79cce0739a05b7b93a8dcdf7247e7f5e1"},"schema_version":"1.0"},"canonical_sha256":"928ad044cfcc912c82f0b839b82be78640bfd43be6239a2950efeb4c1af728fb","source":{"kind":"arxiv","id":"2301.04589","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.04589","created_at":"2026-07-05T05:32:27Z"},{"alias_kind":"arxiv_version","alias_value":"2301.04589v1","created_at":"2026-07-05T05:32:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.04589","created_at":"2026-07-05T05:32:27Z"},{"alias_kind":"pith_short_12","alias_value":"SKFNARGPZSIS","created_at":"2026-07-05T05:32:27Z"},{"alias_kind":"pith_short_16","alias_value":"SKFNARGPZSISZAXQ","created_at":"2026-07-05T05:32:27Z"},{"alias_kind":"pith_short_8","alias_value":"SKFNARGP","created_at":"2026-07-05T05:32:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:SKFNARGPZSISZAXQXA43QK7HQZ","target":"record","payload":{"canonical_record":{"source":{"id":"2301.04589","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-01-10T02:37:44Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"86b3c92963c7637ea1a7695a655a9248d23dbc3ec6353a5a72615c4ba8532661","abstract_canon_sha256":"6d263cbe94b57dde7e6c9e6e0a54adb79cce0739a05b7b93a8dcdf7247e7f5e1"},"schema_version":"1.0"},"canonical_sha256":"928ad044cfcc912c82f0b839b82be78640bfd43be6239a2950efeb4c1af728fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:32:27.017402Z","signature_b64":"SoUap8qtYRIR2TLk0LRhL4C42Nx7LHFUdtlkpaxfNnzS0mcRTL4T4wrRr/JeIoIg49F4YhAIhiW9ZobNz6K3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"928ad044cfcc912c82f0b839b82be78640bfd43be6239a2950efeb4c1af728fb","last_reissued_at":"2026-07-05T05:32:27.017065Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:32:27.017065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2301.04589","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-05T05:32:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HgHJ3cy+VfxJaJCx7ZptXR0V0ADaYnO54C3ZnLb4Dp5wvPplEFRH0QNpiKRf9zm6BN2LGT3v55KWiaw+uohuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T16:30:16.554287Z"},"content_sha256":"20d0618e98ba831ae1558d72e6d888ccca88106bab1b9839c2105168297509ce","schema_version":"1.0","event_id":"sha256:20d0618e98ba831ae1558d72e6d888ccca88106bab1b9839c2105168297509ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:SKFNARGPZSISZAXQXA43QK7HQZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Memory Augmented Large Language Models are Computationally Universal","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.CL","authors_text":"Dale Schuurmans","submitted_at":"2023-01-10T02:37:44Z","abstract_excerpt":"We show that transformer-based large language models are computationally universal when augmented with an external memory. Any deterministic language model that conditions on strings of bounded length is equivalent to a finite automaton, hence computationally limited. However, augmenting such models with a read-write memory creates the possibility of processing arbitrarily large inputs and, potentially, simulating any algorithm. We establish that an existing large language model, Flan-U-PaLM 540B, can be combined with an associative read-write memory to exactly simulate the execution of a univ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.04589","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/2301.04589/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-05T05:32:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZZBvQ6V2gwpAV6ekm3WnJ3Z8CvjkXdCffm+PMdm7Ub5IyMj7V5mqW8G08YAv6TbTI6Eu57aKkK3vniIB1p1eDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T16:30:16.554769Z"},"content_sha256":"d13dbe365b843125fc61ed7f10a00f81fcf2991bb3ace634f5763bf858c9dc38","schema_version":"1.0","event_id":"sha256:d13dbe365b843125fc61ed7f10a00f81fcf2991bb3ace634f5763bf858c9dc38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SKFNARGPZSISZAXQXA43QK7HQZ/bundle.json","state_url":"https://pith.science/pith/SKFNARGPZSISZAXQXA43QK7HQZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SKFNARGPZSISZAXQXA43QK7HQZ/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-09T16:30:16Z","links":{"resolver":"https://pith.science/pith/SKFNARGPZSISZAXQXA43QK7HQZ","bundle":"https://pith.science/pith/SKFNARGPZSISZAXQXA43QK7HQZ/bundle.json","state":"https://pith.science/pith/SKFNARGPZSISZAXQXA43QK7HQZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SKFNARGPZSISZAXQXA43QK7HQZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:SKFNARGPZSISZAXQXA43QK7HQZ","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":"6d263cbe94b57dde7e6c9e6e0a54adb79cce0739a05b7b93a8dcdf7247e7f5e1","cross_cats_sorted":["cs.FL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-01-10T02:37:44Z","title_canon_sha256":"86b3c92963c7637ea1a7695a655a9248d23dbc3ec6353a5a72615c4ba8532661"},"schema_version":"1.0","source":{"id":"2301.04589","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.04589","created_at":"2026-07-05T05:32:27Z"},{"alias_kind":"arxiv_version","alias_value":"2301.04589v1","created_at":"2026-07-05T05:32:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.04589","created_at":"2026-07-05T05:32:27Z"},{"alias_kind":"pith_short_12","alias_value":"SKFNARGPZSIS","created_at":"2026-07-05T05:32:27Z"},{"alias_kind":"pith_short_16","alias_value":"SKFNARGPZSISZAXQ","created_at":"2026-07-05T05:32:27Z"},{"alias_kind":"pith_short_8","alias_value":"SKFNARGP","created_at":"2026-07-05T05:32:27Z"}],"graph_snapshots":[{"event_id":"sha256:d13dbe365b843125fc61ed7f10a00f81fcf2991bb3ace634f5763bf858c9dc38","target":"graph","created_at":"2026-07-05T05:32:27Z","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/2301.04589/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We show that transformer-based large language models are computationally universal when augmented with an external memory. Any deterministic language model that conditions on strings of bounded length is equivalent to a finite automaton, hence computationally limited. However, augmenting such models with a read-write memory creates the possibility of processing arbitrarily large inputs and, potentially, simulating any algorithm. We establish that an existing large language model, Flan-U-PaLM 540B, can be combined with an associative read-write memory to exactly simulate the execution of a univ","authors_text":"Dale Schuurmans","cross_cats":["cs.FL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-01-10T02:37:44Z","title":"Memory Augmented Large Language Models are Computationally Universal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.04589","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:20d0618e98ba831ae1558d72e6d888ccca88106bab1b9839c2105168297509ce","target":"record","created_at":"2026-07-05T05:32:27Z","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":"6d263cbe94b57dde7e6c9e6e0a54adb79cce0739a05b7b93a8dcdf7247e7f5e1","cross_cats_sorted":["cs.FL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2023-01-10T02:37:44Z","title_canon_sha256":"86b3c92963c7637ea1a7695a655a9248d23dbc3ec6353a5a72615c4ba8532661"},"schema_version":"1.0","source":{"id":"2301.04589","kind":"arxiv","version":1}},"canonical_sha256":"928ad044cfcc912c82f0b839b82be78640bfd43be6239a2950efeb4c1af728fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"928ad044cfcc912c82f0b839b82be78640bfd43be6239a2950efeb4c1af728fb","first_computed_at":"2026-07-05T05:32:27.017065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:32:27.017065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SoUap8qtYRIR2TLk0LRhL4C42Nx7LHFUdtlkpaxfNnzS0mcRTL4T4wrRr/JeIoIg49F4YhAIhiW9ZobNz6K3Bg==","signature_status":"signed_v1","signed_at":"2026-07-05T05:32:27.017402Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.04589","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:20d0618e98ba831ae1558d72e6d888ccca88106bab1b9839c2105168297509ce","sha256:d13dbe365b843125fc61ed7f10a00f81fcf2991bb3ace634f5763bf858c9dc38"],"state_sha256":"b548946d01a1ee9738d5c521cceaa8a4062e0590d0b9574295373c026272457e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MMT3kki6uHA1n1VLHf715Dq65wpRfexq8WzaR8SMhsbrBlcE0XnsfO67zDmvhAudCQobm1g5CgDOJasjasxPAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T16:30:16.558234Z","bundle_sha256":"d0b64c0b3e260b305bce0184a7cf303d135a74141353e4e639874c55a0abade2"}}