{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:5UMKQMGMBQA7CV37WBEYNBB4ER","short_pith_number":"pith:5UMKQMGM","canonical_record":{"source":{"id":"1712.09302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-12-26T16:29:51Z","cross_cats_sorted":["cs.PL","math.CT","math.LO"],"title_canon_sha256":"5bf420fad76d81d884984c3911f64955d6347a6bd62502e3fc834b5182c63f9f","abstract_canon_sha256":"aa2c4024b6792c98eb419347bf886c26e63d65023734782568569a59f9ff9f9b"},"schema_version":"1.0"},"canonical_sha256":"ed18a830cc0c01f1577fb04986843c2470ddcfd5ca955f7b45d921ae087b3427","source":{"kind":"arxiv","id":"1712.09302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09302","created_at":"2026-05-18T00:27:13Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09302v1","created_at":"2026-05-18T00:27:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09302","created_at":"2026-05-18T00:27:13Z"},{"alias_kind":"pith_short_12","alias_value":"5UMKQMGMBQA7","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5UMKQMGMBQA7CV37","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5UMKQMGM","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:5UMKQMGMBQA7CV37WBEYNBB4ER","target":"record","payload":{"canonical_record":{"source":{"id":"1712.09302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-12-26T16:29:51Z","cross_cats_sorted":["cs.PL","math.CT","math.LO"],"title_canon_sha256":"5bf420fad76d81d884984c3911f64955d6347a6bd62502e3fc834b5182c63f9f","abstract_canon_sha256":"aa2c4024b6792c98eb419347bf886c26e63d65023734782568569a59f9ff9f9b"},"schema_version":"1.0"},"canonical_sha256":"ed18a830cc0c01f1577fb04986843c2470ddcfd5ca955f7b45d921ae087b3427","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:13.988836Z","signature_b64":"mSrLKvXj9+5D/NZY6jFEszlxHmHAxXfNh0ZF50J9A2dB708euPHsfo1vwAZSQ0j+14iriUPAVyhKhFSxP3abCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ed18a830cc0c01f1577fb04986843c2470ddcfd5ca955f7b45d921ae087b3427","last_reissued_at":"2026-05-18T00:27:13.988417Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:13.988417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.09302","source_version":1,"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:27:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qY2rD0FI/hNHmQZfhgDrKH9d9ZdB5JJimmCnkgJKDXlbI7c+jjM3lqz6DSuGIBEPAdVv6DmyytyDt21fZtSeAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:59:37.293337Z"},"content_sha256":"6f013f4ce3d642940d41f0877e72af9dc2780145a93a4f4d9f2a213cf419cbf0","schema_version":"1.0","event_id":"sha256:6f013f4ce3d642940d41f0877e72af9dc2780145a93a4f4d9f2a213cf419cbf0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:5UMKQMGMBQA7CV37WBEYNBB4ER","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Semantics of Intensionality and Intensional Recursion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL","math.CT","math.LO"],"primary_cat":"cs.LO","authors_text":"G. A. Kavvos","submitted_at":"2017-12-26T16:29:51Z","abstract_excerpt":"Intensionality is a phenomenon that occurs in logic and computation. In the most general sense, a function is intensional if it operates at a level finer than (extensional) equality. This is a familiar setting for computer scientists, who often study different programs or processes that are interchangeable, i.e. extensionally equal, even though they are not implemented in the same way, so intensionally distinct. Concomitant with intensionality is the phenomenon of intensional recursion, which refers to the ability of a program to have access to its own code. In computability theory, intensiona"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09302","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"},"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:27:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+s5Dzkv9PrHO13Vs+9LKJKcJsCVSklZZHqlaBnN8KsLat7r4hixXAMVNY0nXdEXrusuNWgn8dO0aTfCiszJSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:59:37.293683Z"},"content_sha256":"24f8ba364310277cd3db292b53a64ef7483060fa957ca8dd9721cf302b537bad","schema_version":"1.0","event_id":"sha256:24f8ba364310277cd3db292b53a64ef7483060fa957ca8dd9721cf302b537bad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5UMKQMGMBQA7CV37WBEYNBB4ER/bundle.json","state_url":"https://pith.science/pith/5UMKQMGMBQA7CV37WBEYNBB4ER/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5UMKQMGMBQA7CV37WBEYNBB4ER/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-29T21:59:37Z","links":{"resolver":"https://pith.science/pith/5UMKQMGMBQA7CV37WBEYNBB4ER","bundle":"https://pith.science/pith/5UMKQMGMBQA7CV37WBEYNBB4ER/bundle.json","state":"https://pith.science/pith/5UMKQMGMBQA7CV37WBEYNBB4ER/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5UMKQMGMBQA7CV37WBEYNBB4ER/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:5UMKQMGMBQA7CV37WBEYNBB4ER","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":"aa2c4024b6792c98eb419347bf886c26e63d65023734782568569a59f9ff9f9b","cross_cats_sorted":["cs.PL","math.CT","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-12-26T16:29:51Z","title_canon_sha256":"5bf420fad76d81d884984c3911f64955d6347a6bd62502e3fc834b5182c63f9f"},"schema_version":"1.0","source":{"id":"1712.09302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.09302","created_at":"2026-05-18T00:27:13Z"},{"alias_kind":"arxiv_version","alias_value":"1712.09302v1","created_at":"2026-05-18T00:27:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.09302","created_at":"2026-05-18T00:27:13Z"},{"alias_kind":"pith_short_12","alias_value":"5UMKQMGMBQA7","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"5UMKQMGMBQA7CV37","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"5UMKQMGM","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:24f8ba364310277cd3db292b53a64ef7483060fa957ca8dd9721cf302b537bad","target":"graph","created_at":"2026-05-18T00:27:13Z","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":"Intensionality is a phenomenon that occurs in logic and computation. In the most general sense, a function is intensional if it operates at a level finer than (extensional) equality. This is a familiar setting for computer scientists, who often study different programs or processes that are interchangeable, i.e. extensionally equal, even though they are not implemented in the same way, so intensionally distinct. Concomitant with intensionality is the phenomenon of intensional recursion, which refers to the ability of a program to have access to its own code. In computability theory, intensiona","authors_text":"G. A. Kavvos","cross_cats":["cs.PL","math.CT","math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-12-26T16:29:51Z","title":"On the Semantics of Intensionality and Intensional Recursion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.09302","kind":"arxiv","version":1},"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:6f013f4ce3d642940d41f0877e72af9dc2780145a93a4f4d9f2a213cf419cbf0","target":"record","created_at":"2026-05-18T00:27:13Z","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":"aa2c4024b6792c98eb419347bf886c26e63d65023734782568569a59f9ff9f9b","cross_cats_sorted":["cs.PL","math.CT","math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-12-26T16:29:51Z","title_canon_sha256":"5bf420fad76d81d884984c3911f64955d6347a6bd62502e3fc834b5182c63f9f"},"schema_version":"1.0","source":{"id":"1712.09302","kind":"arxiv","version":1}},"canonical_sha256":"ed18a830cc0c01f1577fb04986843c2470ddcfd5ca955f7b45d921ae087b3427","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ed18a830cc0c01f1577fb04986843c2470ddcfd5ca955f7b45d921ae087b3427","first_computed_at":"2026-05-18T00:27:13.988417Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:13.988417Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mSrLKvXj9+5D/NZY6jFEszlxHmHAxXfNh0ZF50J9A2dB708euPHsfo1vwAZSQ0j+14iriUPAVyhKhFSxP3abCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:13.988836Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.09302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6f013f4ce3d642940d41f0877e72af9dc2780145a93a4f4d9f2a213cf419cbf0","sha256:24f8ba364310277cd3db292b53a64ef7483060fa957ca8dd9721cf302b537bad"],"state_sha256":"38ed9a3b061ff3d309471ba6d5628d4bb3408c1298ac530b5e533993c191c6b2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PVogpbEs49pqmEuCbUFmhYE5dkjbR6+80LMkQvBtnVAFsBQgktE/Hgn9F0FxwoYrtC+7NIM3GmVzuMl5+9ZDCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T21:59:37.296084Z","bundle_sha256":"dc6edaf7cf889beb7e9803bd0991de5a14f1bf490abf54b29780a823c6996daf"}}