{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:E3LB6YMTZX7RK3Q3AUUDWYKBVG","short_pith_number":"pith:E3LB6YMT","canonical_record":{"source":{"id":"1602.06220","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-19T16:59:35Z","cross_cats_sorted":[],"title_canon_sha256":"759e7b1c33dada371d1a264f127b17c93a88d9bc7acd0e37f3643e03b20d6a19","abstract_canon_sha256":"8684f9c01145c97555e7874968f1f38dcc5f65baab0b41cfb73b57d8b66f477a"},"schema_version":"1.0"},"canonical_sha256":"26d61f6193cdff156e1b05283b6141a9b10381c36d506070364519236da1e327","source":{"kind":"arxiv","id":"1602.06220","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06220","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06220v2","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06220","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"pith_short_12","alias_value":"E3LB6YMTZX7R","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E3LB6YMTZX7RK3Q3","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E3LB6YMT","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:E3LB6YMTZX7RK3Q3AUUDWYKBVG","target":"record","payload":{"canonical_record":{"source":{"id":"1602.06220","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-19T16:59:35Z","cross_cats_sorted":[],"title_canon_sha256":"759e7b1c33dada371d1a264f127b17c93a88d9bc7acd0e37f3643e03b20d6a19","abstract_canon_sha256":"8684f9c01145c97555e7874968f1f38dcc5f65baab0b41cfb73b57d8b66f477a"},"schema_version":"1.0"},"canonical_sha256":"26d61f6193cdff156e1b05283b6141a9b10381c36d506070364519236da1e327","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:58.070004Z","signature_b64":"JxGGi8HbAkSaq2sr//JA9+qqrt+IssUaORpM1H/t3n6sAHobfFNGUQAEE1DgKAwHLBkzESgIDSY4cU74Iei8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26d61f6193cdff156e1b05283b6141a9b10381c36d506070364519236da1e327","last_reissued_at":"2026-05-18T00:08:58.069375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:58.069375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.06220","source_version":2,"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-05-18T00:08:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ow3nXnuJea90CgwXGwyoLFpX2rNglttMIrWKqdfGt+i0X24EQBitStqhbMm3IPZGoq+NO71WgkqHPuubyEUYAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:03:49.700354Z"},"content_sha256":"549f357864352c9072bc0cc47688deb38fcd34f0c101b86cc67058825256b44d","schema_version":"1.0","event_id":"sha256:549f357864352c9072bc0cc47688deb38fcd34f0c101b86cc67058825256b44d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:E3LB6YMTZX7RK3Q3AUUDWYKBVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Kleene's Two Kinds of Recursion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"G. A. Kavvos","submitted_at":"2016-02-19T16:59:35Z","abstract_excerpt":"This is an elementary expository article regarding the application of Kleene's Recursion Theorems in making definitions by recursion. Whereas the Second Recursion Theorem (SRT) is applicable in a first-order setting, the First Recursion Theorem (FRT) requires a higher-order setting. In some cases both theorems are applicable, but one is stronger than the other: the FRT always produces least fixed points, but this is not always the case with the SRT. Nevertheless, an old result by Rogers allows us to bridge this gap by subtly redefining the implementation of a higher-order functional in order t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06220","kind":"arxiv","version":2},"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"},"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-05-18T00:08:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tzxAirhjSQzvZiYDLiLSa5n4Rrldp1WAejCp0GQN5TGDxSP8m7YsjPRqfc1ncEo1cRevysrewjAglrOB7PARBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:03:49.700701Z"},"content_sha256":"bf8d5666ad5a456f7c704aac80de2aae37b731860ab52983b9033b68e6fa677f","schema_version":"1.0","event_id":"sha256:bf8d5666ad5a456f7c704aac80de2aae37b731860ab52983b9033b68e6fa677f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E3LB6YMTZX7RK3Q3AUUDWYKBVG/bundle.json","state_url":"https://pith.science/pith/E3LB6YMTZX7RK3Q3AUUDWYKBVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E3LB6YMTZX7RK3Q3AUUDWYKBVG/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-06-30T07:03:49Z","links":{"resolver":"https://pith.science/pith/E3LB6YMTZX7RK3Q3AUUDWYKBVG","bundle":"https://pith.science/pith/E3LB6YMTZX7RK3Q3AUUDWYKBVG/bundle.json","state":"https://pith.science/pith/E3LB6YMTZX7RK3Q3AUUDWYKBVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E3LB6YMTZX7RK3Q3AUUDWYKBVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:E3LB6YMTZX7RK3Q3AUUDWYKBVG","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":"8684f9c01145c97555e7874968f1f38dcc5f65baab0b41cfb73b57d8b66f477a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-19T16:59:35Z","title_canon_sha256":"759e7b1c33dada371d1a264f127b17c93a88d9bc7acd0e37f3643e03b20d6a19"},"schema_version":"1.0","source":{"id":"1602.06220","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.06220","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"arxiv_version","alias_value":"1602.06220v2","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.06220","created_at":"2026-05-18T00:08:58Z"},{"alias_kind":"pith_short_12","alias_value":"E3LB6YMTZX7R","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"E3LB6YMTZX7RK3Q3","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"E3LB6YMT","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:bf8d5666ad5a456f7c704aac80de2aae37b731860ab52983b9033b68e6fa677f","target":"graph","created_at":"2026-05-18T00:08:58Z","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"},"paper":{"abstract_excerpt":"This is an elementary expository article regarding the application of Kleene's Recursion Theorems in making definitions by recursion. Whereas the Second Recursion Theorem (SRT) is applicable in a first-order setting, the First Recursion Theorem (FRT) requires a higher-order setting. In some cases both theorems are applicable, but one is stronger than the other: the FRT always produces least fixed points, but this is not always the case with the SRT. Nevertheless, an old result by Rogers allows us to bridge this gap by subtly redefining the implementation of a higher-order functional in order t","authors_text":"G. A. Kavvos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-19T16:59:35Z","title":"Kleene's Two Kinds of Recursion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.06220","kind":"arxiv","version":2},"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:549f357864352c9072bc0cc47688deb38fcd34f0c101b86cc67058825256b44d","target":"record","created_at":"2026-05-18T00:08:58Z","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":"8684f9c01145c97555e7874968f1f38dcc5f65baab0b41cfb73b57d8b66f477a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-02-19T16:59:35Z","title_canon_sha256":"759e7b1c33dada371d1a264f127b17c93a88d9bc7acd0e37f3643e03b20d6a19"},"schema_version":"1.0","source":{"id":"1602.06220","kind":"arxiv","version":2}},"canonical_sha256":"26d61f6193cdff156e1b05283b6141a9b10381c36d506070364519236da1e327","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26d61f6193cdff156e1b05283b6141a9b10381c36d506070364519236da1e327","first_computed_at":"2026-05-18T00:08:58.069375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:58.069375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JxGGi8HbAkSaq2sr//JA9+qqrt+IssUaORpM1H/t3n6sAHobfFNGUQAEE1DgKAwHLBkzESgIDSY4cU74Iei8Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:58.070004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.06220","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:549f357864352c9072bc0cc47688deb38fcd34f0c101b86cc67058825256b44d","sha256:bf8d5666ad5a456f7c704aac80de2aae37b731860ab52983b9033b68e6fa677f"],"state_sha256":"f8983a512a852fda2e5203a0e8f853c2c9a38ebaf08045692687a48ca1554228"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bJ+L1FaZE8DEHqgdiKHzY9fp+sZ1QvR1B5TEUsIVaWPr093oDwmoxRSQcn2o1EzsRzaFw6JXkodEbIORFzDfCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T07:03:49.702516Z","bundle_sha256":"c124c0465a3db062c92e2ebd17dd2683e66927f02b4bb1557521f1220f28631e"}}