{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DCRQJY3CBOC3GRBBJ6NRT5JFFL","short_pith_number":"pith:DCRQJY3C","schema_version":"1.0","canonical_sha256":"18a304e3620b85b344214f9b19f5252ade4a88a7b01d63511f22bc914155d4b4","source":{"kind":"arxiv","id":"2310.02003","version":6},"attestation_state":"computed","paper":{"title":"L2MAC: Large Language Model Automatic Computer for Extensive Code Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.PL"],"primary_cat":"cs.SE","authors_text":"Max Ruiz Luyten, Mihaela van der Schaar, Samuel Holt","submitted_at":"2023-10-02T16:55:19Z","abstract_excerpt":"Transformer-based large language models (LLMs) are constrained by the fixed context window of the underlying transformer architecture, hindering their ability to produce long and coherent outputs. Memory-augmented LLMs are a promising solution, but current approaches cannot handle long output generation tasks since they (1) only focus on reading memory and reduce its evolution to the concatenation of new memories or (2) use very specialized memories that cannot adapt to other domains. This paper presents L2MAC, the first practical LLM-based general-purpose stored-program automatic computer (vo"},"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":"2310.02003","kind":"arxiv","version":6},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.SE","submitted_at":"2023-10-02T16:55:19Z","cross_cats_sorted":["cs.AI","cs.LG","cs.PL"],"title_canon_sha256":"26a42c86a27973906ad735de38d90eb9f87c7517e3e364b21dae568ee590158c","abstract_canon_sha256":"c59ffc830e1a435a44d381d0216da583b65468dea88d2646af55101d56dace21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:28:09.186395Z","signature_b64":"nk69ZB/8FFrErytptYSVAKEhx6gEDM4PmRChVx3zOB+2ZaClXCib3Btumw9cxRECkezpJELfd0TvRQxjC0DmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18a304e3620b85b344214f9b19f5252ade4a88a7b01d63511f22bc914155d4b4","last_reissued_at":"2026-07-05T11:28:09.185902Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:28:09.185902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"L2MAC: Large Language Model Automatic Computer for Extensive Code Generation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.PL"],"primary_cat":"cs.SE","authors_text":"Max Ruiz Luyten, Mihaela van der Schaar, Samuel Holt","submitted_at":"2023-10-02T16:55:19Z","abstract_excerpt":"Transformer-based large language models (LLMs) are constrained by the fixed context window of the underlying transformer architecture, hindering their ability to produce long and coherent outputs. Memory-augmented LLMs are a promising solution, but current approaches cannot handle long output generation tasks since they (1) only focus on reading memory and reduce its evolution to the concatenation of new memories or (2) use very specialized memories that cannot adapt to other domains. This paper presents L2MAC, the first practical LLM-based general-purpose stored-program automatic computer (vo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.02003","kind":"arxiv","version":6},"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/2310.02003/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":"2310.02003","created_at":"2026-07-05T11:28:09.185961+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.02003v6","created_at":"2026-07-05T11:28:09.185961+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.02003","created_at":"2026-07-05T11:28:09.185961+00:00"},{"alias_kind":"pith_short_12","alias_value":"DCRQJY3CBOC3","created_at":"2026-07-05T11:28:09.185961+00:00"},{"alias_kind":"pith_short_16","alias_value":"DCRQJY3CBOC3GRBB","created_at":"2026-07-05T11:28:09.185961+00:00"},{"alias_kind":"pith_short_8","alias_value":"DCRQJY3C","created_at":"2026-07-05T11:28:09.185961+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.17359","citing_title":"Learning Transferable Topology Priors for Multi-Agent LLM Collaboration Across Domains","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2604.17503","citing_title":"SkillGraph: Self-Evolving Multi-Agent Collaboration with Multimodal Graph Topology","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DCRQJY3CBOC3GRBBJ6NRT5JFFL","json":"https://pith.science/pith/DCRQJY3CBOC3GRBBJ6NRT5JFFL.json","graph_json":"https://pith.science/api/pith-number/DCRQJY3CBOC3GRBBJ6NRT5JFFL/graph.json","events_json":"https://pith.science/api/pith-number/DCRQJY3CBOC3GRBBJ6NRT5JFFL/events.json","paper":"https://pith.science/paper/DCRQJY3C"},"agent_actions":{"view_html":"https://pith.science/pith/DCRQJY3CBOC3GRBBJ6NRT5JFFL","download_json":"https://pith.science/pith/DCRQJY3CBOC3GRBBJ6NRT5JFFL.json","view_paper":"https://pith.science/paper/DCRQJY3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.02003&json=true","fetch_graph":"https://pith.science/api/pith-number/DCRQJY3CBOC3GRBBJ6NRT5JFFL/graph.json","fetch_events":"https://pith.science/api/pith-number/DCRQJY3CBOC3GRBBJ6NRT5JFFL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DCRQJY3CBOC3GRBBJ6NRT5JFFL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DCRQJY3CBOC3GRBBJ6NRT5JFFL/action/storage_attestation","attest_author":"https://pith.science/pith/DCRQJY3CBOC3GRBBJ6NRT5JFFL/action/author_attestation","sign_citation":"https://pith.science/pith/DCRQJY3CBOC3GRBBJ6NRT5JFFL/action/citation_signature","submit_replication":"https://pith.science/pith/DCRQJY3CBOC3GRBBJ6NRT5JFFL/action/replication_record"}},"created_at":"2026-07-05T11:28:09.185961+00:00","updated_at":"2026-07-05T11:28:09.185961+00:00"}