{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:OHJ4JCXE5KCSFKNHFP64NARC6O","short_pith_number":"pith:OHJ4JCXE","schema_version":"1.0","canonical_sha256":"71d3c48ae4ea8522a9a72bfdc68222f3aae66061539391704785cba8faf63040","source":{"kind":"arxiv","id":"cs/0309048","version":5},"attestation_state":"computed","paper":{"title":"Goedel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements","license":"","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Juergen Schmidhuber","submitted_at":"2003-09-25T15:59:46Z","abstract_excerpt":"We present the first class of mathematically rigorous, general, fully self-referential, self-improving, optimally efficient problem solvers. Inspired by Kurt Goedel's celebrated self-referential formulas (1931), such a problem solver rewrites any part of its own code as soon as it has found a proof that the rewrite is useful, where the problem-dependent utility function and the hardware and the entire initial code are described by axioms encoded in an initial proof searcher which is also part of the initial code. The searcher systematically and efficiently tests computable proof techniques (pr"},"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/0309048","kind":"arxiv","version":5},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2003-09-25T15:59:46Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d4803f30b289ef8e63f6703e88d345eb760e65c67a2af8e105fac3ed7f64670c","abstract_canon_sha256":"e4461a627c2bb30515ea63d3fd022a04913036ad025ba04fbb7c1c576479a993"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:58:04.413857Z","signature_b64":"Gs7fhstFAsGv/Y5hrZ050CvqzNz+KYjnvJP0s7Ohp1ntVYEBZbnRkeaFrA43jaMUDCnyO4RzaXH/xbjvUWfJBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71d3c48ae4ea8522a9a72bfdc68222f3aae66061539391704785cba8faf63040","last_reissued_at":"2026-07-04T14:58:04.413509Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:58:04.413509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Goedel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements","license":"","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Juergen Schmidhuber","submitted_at":"2003-09-25T15:59:46Z","abstract_excerpt":"We present the first class of mathematically rigorous, general, fully self-referential, self-improving, optimally efficient problem solvers. Inspired by Kurt Goedel's celebrated self-referential formulas (1931), such a problem solver rewrites any part of its own code as soon as it has found a proof that the rewrite is useful, where the problem-dependent utility function and the hardware and the entire initial code are described by axioms encoded in an initial proof searcher which is also part of the initial code. The searcher systematically and efficiently tests computable proof techniques (pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0309048","kind":"arxiv","version":5},"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/0309048/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/0309048","created_at":"2026-07-04T14:58:04.413566+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0309048v5","created_at":"2026-07-04T14:58:04.413566+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0309048","created_at":"2026-07-04T14:58:04.413566+00:00"},{"alias_kind":"pith_short_12","alias_value":"OHJ4JCXE5KCS","created_at":"2026-07-04T14:58:04.413566+00:00"},{"alias_kind":"pith_short_16","alias_value":"OHJ4JCXE5KCSFKNH","created_at":"2026-07-04T14:58:04.413566+00:00"},{"alias_kind":"pith_short_8","alias_value":"OHJ4JCXE","created_at":"2026-07-04T14:58:04.413566+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":11,"internal_anchor_count":10,"sample":[{"citing_arxiv_id":"2607.07663","citing_title":"Recursive Self-Improvement in AI: From Bounded Self-Refinement to Autonomous Research Loops","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2607.00871","citing_title":"Self-Evolving Agents with Anytime-Valid Certificates","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2606.04455","citing_title":"The Meta-Agent Challenge: Are Current Agents Capable of Autonomous Agent Development?","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2606.28347","citing_title":"Agentic Safety is an Epistemic Property, Not a Behavioral One","ref_index":61,"is_internal_anchor":true},{"citing_arxiv_id":"2606.28955","citing_title":"Modification-Considering Value Learning for Reward Hacking Mitigation in RL","ref_index":25,"is_internal_anchor":true},{"citing_arxiv_id":"2605.25062","citing_title":"Cultivating Machine Intelligence: The OMEGA Shift from Top-Down Optimization to Autopoietic Cognitive Ecologies","ref_index":71,"is_internal_anchor":true},{"citing_arxiv_id":"2605.23019","citing_title":"PACE: Two-Timescale Self-Evolution for Small Language Model Agents","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2605.11518","citing_title":"AutoLLMResearch: Training Research Agents for Automating LLM Experiment Configuration - Learning from Cheap, Optimizing Expensive","ref_index":23,"is_internal_anchor":true},{"citing_arxiv_id":"2309.16797","citing_title":"Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolution","ref_index":291,"is_internal_anchor":true},{"citing_arxiv_id":"2408.08435","citing_title":"Automated Design of Agentic Systems","ref_index":205,"is_internal_anchor":true},{"citing_arxiv_id":"2605.11518","citing_title":"AutoLLMResearch: Training Research Agents for Automating LLM Experiment Configuration - Learning from Cheap, Optimizing Expensive","ref_index":23,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OHJ4JCXE5KCSFKNHFP64NARC6O","json":"https://pith.science/pith/OHJ4JCXE5KCSFKNHFP64NARC6O.json","graph_json":"https://pith.science/api/pith-number/OHJ4JCXE5KCSFKNHFP64NARC6O/graph.json","events_json":"https://pith.science/api/pith-number/OHJ4JCXE5KCSFKNHFP64NARC6O/events.json","paper":"https://pith.science/paper/OHJ4JCXE"},"agent_actions":{"view_html":"https://pith.science/pith/OHJ4JCXE5KCSFKNHFP64NARC6O","download_json":"https://pith.science/pith/OHJ4JCXE5KCSFKNHFP64NARC6O.json","view_paper":"https://pith.science/paper/OHJ4JCXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0309048&json=true","fetch_graph":"https://pith.science/api/pith-number/OHJ4JCXE5KCSFKNHFP64NARC6O/graph.json","fetch_events":"https://pith.science/api/pith-number/OHJ4JCXE5KCSFKNHFP64NARC6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OHJ4JCXE5KCSFKNHFP64NARC6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OHJ4JCXE5KCSFKNHFP64NARC6O/action/storage_attestation","attest_author":"https://pith.science/pith/OHJ4JCXE5KCSFKNHFP64NARC6O/action/author_attestation","sign_citation":"https://pith.science/pith/OHJ4JCXE5KCSFKNHFP64NARC6O/action/citation_signature","submit_replication":"https://pith.science/pith/OHJ4JCXE5KCSFKNHFP64NARC6O/action/replication_record"}},"created_at":"2026-07-04T14:58:04.413566+00:00","updated_at":"2026-07-04T14:58:04.413566+00:00"}