{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:X4Q4ONMZL64DGQUYS5CXIRC4TR","short_pith_number":"pith:X4Q4ONMZ","schema_version":"1.0","canonical_sha256":"bf21c735995fb8334298974574445c9c6a8e0bac3b462d853ffe41f9e313a278","source":{"kind":"arxiv","id":"1306.0095","version":1},"attestation_state":"computed","paper":{"title":"Universal Induction with Varying Sets of Combinators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alexey Potapov, Sergey Rodionov","submitted_at":"2013-06-01T10:47:23Z","abstract_excerpt":"Universal induction is a crucial issue in AGI. Its practical applicability can be achieved by the choice of the reference machine or representation of algorithms agreed with the environment. This machine should be updatable for solving subsequent tasks more efficiently. We study this problem on an example of combinatory logic as the very simple Turing-complete reference machine, which enables modifying program representations by introducing different sets of primitive combinators. Genetic programming system is used to search for combinator expressions, which are easily decomposed into sub-expr"},"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":"1306.0095","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-06-01T10:47:23Z","cross_cats_sorted":[],"title_canon_sha256":"e06d2e0db6f2aae7f842f59beed69d4cb629eacd06d662ece1039f1efbf10434","abstract_canon_sha256":"a2067f4898f0aa87c7b7ca0246749d646fd8355369faeb256a8720fc93b61cf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:56.145673Z","signature_b64":"VvLhvtBtidIX+qdtuUFG74PQCggsm9Pra2Nn3Kf3hXRJirOhYR510tDi0hAnHhJC1D2i2krrtOeMttlPaWqlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf21c735995fb8334298974574445c9c6a8e0bac3b462d853ffe41f9e313a278","last_reissued_at":"2026-05-18T03:21:56.145254Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:56.145254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Induction with Varying Sets of Combinators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alexey Potapov, Sergey Rodionov","submitted_at":"2013-06-01T10:47:23Z","abstract_excerpt":"Universal induction is a crucial issue in AGI. Its practical applicability can be achieved by the choice of the reference machine or representation of algorithms agreed with the environment. This machine should be updatable for solving subsequent tasks more efficiently. We study this problem on an example of combinatory logic as the very simple Turing-complete reference machine, which enables modifying program representations by introducing different sets of primitive combinators. Genetic programming system is used to search for combinator expressions, which are easily decomposed into sub-expr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0095","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":""},"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":"1306.0095","created_at":"2026-05-18T03:21:56.145311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.0095v1","created_at":"2026-05-18T03:21:56.145311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0095","created_at":"2026-05-18T03:21:56.145311+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4Q4ONMZL64D","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4Q4ONMZL64DGQUY","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4Q4ONMZ","created_at":"2026-05-18T12:28:06.772260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X4Q4ONMZL64DGQUYS5CXIRC4TR","json":"https://pith.science/pith/X4Q4ONMZL64DGQUYS5CXIRC4TR.json","graph_json":"https://pith.science/api/pith-number/X4Q4ONMZL64DGQUYS5CXIRC4TR/graph.json","events_json":"https://pith.science/api/pith-number/X4Q4ONMZL64DGQUYS5CXIRC4TR/events.json","paper":"https://pith.science/paper/X4Q4ONMZ"},"agent_actions":{"view_html":"https://pith.science/pith/X4Q4ONMZL64DGQUYS5CXIRC4TR","download_json":"https://pith.science/pith/X4Q4ONMZL64DGQUYS5CXIRC4TR.json","view_paper":"https://pith.science/paper/X4Q4ONMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.0095&json=true","fetch_graph":"https://pith.science/api/pith-number/X4Q4ONMZL64DGQUYS5CXIRC4TR/graph.json","fetch_events":"https://pith.science/api/pith-number/X4Q4ONMZL64DGQUYS5CXIRC4TR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4Q4ONMZL64DGQUYS5CXIRC4TR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4Q4ONMZL64DGQUYS5CXIRC4TR/action/storage_attestation","attest_author":"https://pith.science/pith/X4Q4ONMZL64DGQUYS5CXIRC4TR/action/author_attestation","sign_citation":"https://pith.science/pith/X4Q4ONMZL64DGQUYS5CXIRC4TR/action/citation_signature","submit_replication":"https://pith.science/pith/X4Q4ONMZL64DGQUYS5CXIRC4TR/action/replication_record"}},"created_at":"2026-05-18T03:21:56.145311+00:00","updated_at":"2026-05-18T03:21:56.145311+00:00"}