{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7FQUOV37WNA6WCBQ2ED7C2PBJ4","short_pith_number":"pith:7FQUOV37","canonical_record":{"source":{"id":"1405.1715","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-05-07T19:37:07Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"cfe82c6658ab5ffe54da9f097635687a5536cc9450956c79515120c17e76cd97","abstract_canon_sha256":"606b0c6aeb8f90abe1723881ed111770e4c7ab123f41e45eee48dcddb577f4af"},"schema_version":"1.0"},"canonical_sha256":"f96147577fb341eb0830d107f169e14f3493de26ab3a972714c76fe6ad8f0ee9","source":{"kind":"arxiv","id":"1405.1715","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1715","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1715v5","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1715","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"7FQUOV37WNA6","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7FQUOV37WNA6WCBQ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7FQUOV37","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7FQUOV37WNA6WCBQ2ED7C2PBJ4","target":"record","payload":{"canonical_record":{"source":{"id":"1405.1715","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-05-07T19:37:07Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"cfe82c6658ab5ffe54da9f097635687a5536cc9450956c79515120c17e76cd97","abstract_canon_sha256":"606b0c6aeb8f90abe1723881ed111770e4c7ab123f41e45eee48dcddb577f4af"},"schema_version":"1.0"},"canonical_sha256":"f96147577fb341eb0830d107f169e14f3493de26ab3a972714c76fe6ad8f0ee9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:17.480154Z","signature_b64":"J+V4vwdcNSbyASj6MlcInN8SX+AONlsZ3WVDY9vKvKuHcoSF1d8bBcnJ8f8eNcCoNiFD1mYlA16JmmePhhF2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f96147577fb341eb0830d107f169e14f3493de26ab3a972714c76fe6ad8f0ee9","last_reissued_at":"2026-05-18T02:44:17.479521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:17.479521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.1715","source_version":5,"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-18T02:44:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S6V3kNo22trQiwyXC6BXHGSCD+8dLgERF7NoGieUPL9izDOKp22jxkQ6DVo6nHrcCAhFHIEfiZdMjL0rQtv6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:17:29.294931Z"},"content_sha256":"e3fcb497a3fec191f59a5a937c23dc651f8c72bfe05608e189144dfdd46e6216","schema_version":"1.0","event_id":"sha256:e3fcb497a3fec191f59a5a937c23dc651f8c72bfe05608e189144dfdd46e6216"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7FQUOV37WNA6WCBQ2ED7C2PBJ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Some Turing-Complete Extensions of First-Order Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Antti Kuusisto","submitted_at":"2014-05-07T19:37:07Z","abstract_excerpt":"We introduce a natural Turing-complete extension of first-order logic FO. The extension adds two novel features to FO. The first one of these is the capacity to add new points to models and new tuples to relations. The second one is the possibility of recursive looping when a formula is evaluated using a semantic game. We first define a game-theoretic semantics for the logic and then prove that the expressive power of the logic corresponds in a canonical way to the recognition capacity of Turing machines. Finally, we show how to incorporate generalized quantifiers into the logic and argue for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1715","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":""},"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-18T02:44:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QkHcf03pnatisXt+nzjAtG/gxM92pv2BVxbcSya5JHQFWxoHAFnFgjTxQZQ/cYCT5OkDaYwxPxcMfwcmHm4pAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:17:29.295644Z"},"content_sha256":"d1c3431809b32eddb7bf231c7fcadfc50f32a0d7c5c65369f2899b17442bc8c0","schema_version":"1.0","event_id":"sha256:d1c3431809b32eddb7bf231c7fcadfc50f32a0d7c5c65369f2899b17442bc8c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FQUOV37WNA6WCBQ2ED7C2PBJ4/bundle.json","state_url":"https://pith.science/pith/7FQUOV37WNA6WCBQ2ED7C2PBJ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FQUOV37WNA6WCBQ2ED7C2PBJ4/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-05-27T06:17:29Z","links":{"resolver":"https://pith.science/pith/7FQUOV37WNA6WCBQ2ED7C2PBJ4","bundle":"https://pith.science/pith/7FQUOV37WNA6WCBQ2ED7C2PBJ4/bundle.json","state":"https://pith.science/pith/7FQUOV37WNA6WCBQ2ED7C2PBJ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FQUOV37WNA6WCBQ2ED7C2PBJ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7FQUOV37WNA6WCBQ2ED7C2PBJ4","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":"606b0c6aeb8f90abe1723881ed111770e4c7ab123f41e45eee48dcddb577f4af","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-05-07T19:37:07Z","title_canon_sha256":"cfe82c6658ab5ffe54da9f097635687a5536cc9450956c79515120c17e76cd97"},"schema_version":"1.0","source":{"id":"1405.1715","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.1715","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"arxiv_version","alias_value":"1405.1715v5","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1715","created_at":"2026-05-18T02:44:17Z"},{"alias_kind":"pith_short_12","alias_value":"7FQUOV37WNA6","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7FQUOV37WNA6WCBQ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7FQUOV37","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:d1c3431809b32eddb7bf231c7fcadfc50f32a0d7c5c65369f2899b17442bc8c0","target":"graph","created_at":"2026-05-18T02:44:17Z","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":"We introduce a natural Turing-complete extension of first-order logic FO. The extension adds two novel features to FO. The first one of these is the capacity to add new points to models and new tuples to relations. The second one is the possibility of recursive looping when a formula is evaluated using a semantic game. We first define a game-theoretic semantics for the logic and then prove that the expressive power of the logic corresponds in a canonical way to the recognition capacity of Turing machines. Finally, we show how to incorporate generalized quantifiers into the logic and argue for ","authors_text":"Antti Kuusisto","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-05-07T19:37:07Z","title":"Some Turing-Complete Extensions of First-Order Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1715","kind":"arxiv","version":5},"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:e3fcb497a3fec191f59a5a937c23dc651f8c72bfe05608e189144dfdd46e6216","target":"record","created_at":"2026-05-18T02:44:17Z","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":"606b0c6aeb8f90abe1723881ed111770e4c7ab123f41e45eee48dcddb577f4af","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-05-07T19:37:07Z","title_canon_sha256":"cfe82c6658ab5ffe54da9f097635687a5536cc9450956c79515120c17e76cd97"},"schema_version":"1.0","source":{"id":"1405.1715","kind":"arxiv","version":5}},"canonical_sha256":"f96147577fb341eb0830d107f169e14f3493de26ab3a972714c76fe6ad8f0ee9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f96147577fb341eb0830d107f169e14f3493de26ab3a972714c76fe6ad8f0ee9","first_computed_at":"2026-05-18T02:44:17.479521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:17.479521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J+V4vwdcNSbyASj6MlcInN8SX+AONlsZ3WVDY9vKvKuHcoSF1d8bBcnJ8f8eNcCoNiFD1mYlA16JmmePhhF2Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:17.480154Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.1715","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3fcb497a3fec191f59a5a937c23dc651f8c72bfe05608e189144dfdd46e6216","sha256:d1c3431809b32eddb7bf231c7fcadfc50f32a0d7c5c65369f2899b17442bc8c0"],"state_sha256":"7901a42709d44dc724b0fa147a2737a598022747a41ade5df91333da04a274c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wzglEq+zqE5Uiyx9Q3R2jz3bv9r8cVP9I7nE15L3VPN56vZJdgQW2kcclQQhWSpF40HANjm0vsk0kf8KGYXyBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:17:29.297882Z","bundle_sha256":"497ae8bdafad5998dac2c280d8844c501c4b5fb5d7a53891932118df17ef6a39"}}