{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RL4JSFWPL3S46Y4RAHYNDDBY5S","short_pith_number":"pith:RL4JSFWP","schema_version":"1.0","canonical_sha256":"8af89916cf5ee5cf639101f0d18c38ecba09e513f780e00a42a4a07db269a88b","source":{"kind":"arxiv","id":"1608.07163","version":3},"attestation_state":"computed","paper":{"title":"Total Recursion over Lexicographical Orderings: Elementary Recursive Operators Beyond PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"David Cerna","submitted_at":"2016-08-24T13:34:32Z","abstract_excerpt":"In this work we generalize primitive recursion in order to construct a hierarchy of terminating total recursive operators which we refer to as {\\em leveled primitive recursion of order $i$}($\\mathbf{PR}_{i}$). Primitive recursion is equivalent to leveled primitive recursion of order $1$ ($\\mathbf{PR}_{1}$). The functions constructable from the basic functions make up $\\mathbf{PR}_{0}$. Interestingly, we show that $\\mathbf{PR}_{2}$ is a conservative extension of $\\mathbf{PR}_{1}$. However, members of the hierarchy beyond $\\mathbf{PR}_{2}$, that is $\\mathbf{PR}_{i}$ where $i\\geq 3$, can formaliz"},"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":"1608.07163","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-08-24T13:34:32Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"3fbef77d6589897cc41ac6d3594c1ee1f4f45c07d2f62022aae2bc8a2b4ebd22","abstract_canon_sha256":"247dc919d3da43ee3a5057855ac34fa85f2522bfdf99883b3bd68069dacc0f2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:52.015023Z","signature_b64":"sW7fOwSxjQcbk85y/qzhtrYZASgu/czYaYUVvjAOy7zwxXvu6Nc1yURCmVK3qru+EXvhkiYkt8cUpmLn/MiUDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8af89916cf5ee5cf639101f0d18c38ecba09e513f780e00a42a4a07db269a88b","last_reissued_at":"2026-05-18T00:26:52.014389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:52.014389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Total Recursion over Lexicographical Orderings: Elementary Recursive Operators Beyond PR","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.LO","authors_text":"David Cerna","submitted_at":"2016-08-24T13:34:32Z","abstract_excerpt":"In this work we generalize primitive recursion in order to construct a hierarchy of terminating total recursive operators which we refer to as {\\em leveled primitive recursion of order $i$}($\\mathbf{PR}_{i}$). Primitive recursion is equivalent to leveled primitive recursion of order $1$ ($\\mathbf{PR}_{1}$). The functions constructable from the basic functions make up $\\mathbf{PR}_{0}$. Interestingly, we show that $\\mathbf{PR}_{2}$ is a conservative extension of $\\mathbf{PR}_{1}$. However, members of the hierarchy beyond $\\mathbf{PR}_{2}$, that is $\\mathbf{PR}_{i}$ where $i\\geq 3$, can formaliz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07163","kind":"arxiv","version":3},"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":"1608.07163","created_at":"2026-05-18T00:26:52.014489+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07163v3","created_at":"2026-05-18T00:26:52.014489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07163","created_at":"2026-05-18T00:26:52.014489+00:00"},{"alias_kind":"pith_short_12","alias_value":"RL4JSFWPL3S4","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RL4JSFWPL3S46Y4R","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RL4JSFWP","created_at":"2026-05-18T12:30:41.710351+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/RL4JSFWPL3S46Y4RAHYNDDBY5S","json":"https://pith.science/pith/RL4JSFWPL3S46Y4RAHYNDDBY5S.json","graph_json":"https://pith.science/api/pith-number/RL4JSFWPL3S46Y4RAHYNDDBY5S/graph.json","events_json":"https://pith.science/api/pith-number/RL4JSFWPL3S46Y4RAHYNDDBY5S/events.json","paper":"https://pith.science/paper/RL4JSFWP"},"agent_actions":{"view_html":"https://pith.science/pith/RL4JSFWPL3S46Y4RAHYNDDBY5S","download_json":"https://pith.science/pith/RL4JSFWPL3S46Y4RAHYNDDBY5S.json","view_paper":"https://pith.science/paper/RL4JSFWP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07163&json=true","fetch_graph":"https://pith.science/api/pith-number/RL4JSFWPL3S46Y4RAHYNDDBY5S/graph.json","fetch_events":"https://pith.science/api/pith-number/RL4JSFWPL3S46Y4RAHYNDDBY5S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RL4JSFWPL3S46Y4RAHYNDDBY5S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RL4JSFWPL3S46Y4RAHYNDDBY5S/action/storage_attestation","attest_author":"https://pith.science/pith/RL4JSFWPL3S46Y4RAHYNDDBY5S/action/author_attestation","sign_citation":"https://pith.science/pith/RL4JSFWPL3S46Y4RAHYNDDBY5S/action/citation_signature","submit_replication":"https://pith.science/pith/RL4JSFWPL3S46Y4RAHYNDDBY5S/action/replication_record"}},"created_at":"2026-05-18T00:26:52.014489+00:00","updated_at":"2026-05-18T00:26:52.014489+00:00"}