{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FXGGVFRF2TSGBN5VR7QCJHYHAO","short_pith_number":"pith:FXGGVFRF","canonical_record":{"source":{"id":"1408.4080","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-08-18T17:58:35Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"1d1bde5b3beabd11af45040a6b206c864fa77d9cff25bc1837f111e8d43587d1","abstract_canon_sha256":"7def03f890812fd17b43f41269d463e2e2c9325afa3608af84c44b5a19821496"},"schema_version":"1.0"},"canonical_sha256":"2dcc6a9625d4e460b7b58fe0249f0703a0d6354583f84997cece7687fae9daef","source":{"kind":"arxiv","id":"1408.4080","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4080","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4080v1","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4080","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"pith_short_12","alias_value":"FXGGVFRF2TSG","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FXGGVFRF2TSGBN5V","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FXGGVFRF","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FXGGVFRF2TSGBN5VR7QCJHYHAO","target":"record","payload":{"canonical_record":{"source":{"id":"1408.4080","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-08-18T17:58:35Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"1d1bde5b3beabd11af45040a6b206c864fa77d9cff25bc1837f111e8d43587d1","abstract_canon_sha256":"7def03f890812fd17b43f41269d463e2e2c9325afa3608af84c44b5a19821496"},"schema_version":"1.0"},"canonical_sha256":"2dcc6a9625d4e460b7b58fe0249f0703a0d6354583f84997cece7687fae9daef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:57.287909Z","signature_b64":"YmVdb29C5G3S4k6WKSSakCKGP+1mw/EUeURZ8HHDXuVg0y3F2VpfK0R/mG9+0vmqO7OWTIk2l+Ag9ESD8JdQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2dcc6a9625d4e460b7b58fe0249f0703a0d6354583f84997cece7687fae9daef","last_reissued_at":"2026-05-18T02:44:57.287478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:57.287478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.4080","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-18T02:44:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U3CM54m2NSATw27X88lJDdzIh7Mp9SVQYWoaqRyW0X1aXVN3b4pQOKfNtduzp2vetZ/S+7iJoCVx9VPE5XZ3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:42:00.150189Z"},"content_sha256":"1c11184e81cb0c7cfd824e19894f34e544aa653003d1b109eae82e50c722e58d","schema_version":"1.0","event_id":"sha256:1c11184e81cb0c7cfd824e19894f34e544aa653003d1b109eae82e50c722e58d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FXGGVFRF2TSGBN5VR7QCJHYHAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Team Semantics and Recursive Enumerability","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-08-18T17:58:35Z","abstract_excerpt":"It is well known that dependence logic captures the complexity class NP, and it has recently been shown that inclusion logic captures P on ordered models. These results demonstrate that team semantics offers interesting new possibilities for descriptive complexity theory. In order to properly understand the connection between team semantics and descriptive complexity, we introduce an extension D* of dependence logic that can define exactly all recursively enumerable classes of finite models. Thus D* provides an approach to computation alternative to Turing machines. The essential novel feature"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4080","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-18T02:44:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/PQtBtc3tdAA8DmmygtU2ICfuXztbEioXlnEguJwFSpQj3zlvJgkbRy2YjB851KjDYvIsFXvy5MZTdJFZ+uRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:42:00.150891Z"},"content_sha256":"d2d51b368636134a338471320af2b4dd229f69d2295a15f5f41d69fe67ce6add","schema_version":"1.0","event_id":"sha256:d2d51b368636134a338471320af2b4dd229f69d2295a15f5f41d69fe67ce6add"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FXGGVFRF2TSGBN5VR7QCJHYHAO/bundle.json","state_url":"https://pith.science/pith/FXGGVFRF2TSGBN5VR7QCJHYHAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FXGGVFRF2TSGBN5VR7QCJHYHAO/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-25T23:42:00Z","links":{"resolver":"https://pith.science/pith/FXGGVFRF2TSGBN5VR7QCJHYHAO","bundle":"https://pith.science/pith/FXGGVFRF2TSGBN5VR7QCJHYHAO/bundle.json","state":"https://pith.science/pith/FXGGVFRF2TSGBN5VR7QCJHYHAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FXGGVFRF2TSGBN5VR7QCJHYHAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FXGGVFRF2TSGBN5VR7QCJHYHAO","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":"7def03f890812fd17b43f41269d463e2e2c9325afa3608af84c44b5a19821496","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-08-18T17:58:35Z","title_canon_sha256":"1d1bde5b3beabd11af45040a6b206c864fa77d9cff25bc1837f111e8d43587d1"},"schema_version":"1.0","source":{"id":"1408.4080","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.4080","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"arxiv_version","alias_value":"1408.4080v1","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.4080","created_at":"2026-05-18T02:44:57Z"},{"alias_kind":"pith_short_12","alias_value":"FXGGVFRF2TSG","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FXGGVFRF2TSGBN5V","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FXGGVFRF","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:d2d51b368636134a338471320af2b4dd229f69d2295a15f5f41d69fe67ce6add","target":"graph","created_at":"2026-05-18T02:44:57Z","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":"It is well known that dependence logic captures the complexity class NP, and it has recently been shown that inclusion logic captures P on ordered models. These results demonstrate that team semantics offers interesting new possibilities for descriptive complexity theory. In order to properly understand the connection between team semantics and descriptive complexity, we introduce an extension D* of dependence logic that can define exactly all recursively enumerable classes of finite models. Thus D* provides an approach to computation alternative to Turing machines. The essential novel feature","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-08-18T17:58:35Z","title":"Team Semantics and Recursive Enumerability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.4080","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:1c11184e81cb0c7cfd824e19894f34e544aa653003d1b109eae82e50c722e58d","target":"record","created_at":"2026-05-18T02:44:57Z","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":"7def03f890812fd17b43f41269d463e2e2c9325afa3608af84c44b5a19821496","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-08-18T17:58:35Z","title_canon_sha256":"1d1bde5b3beabd11af45040a6b206c864fa77d9cff25bc1837f111e8d43587d1"},"schema_version":"1.0","source":{"id":"1408.4080","kind":"arxiv","version":1}},"canonical_sha256":"2dcc6a9625d4e460b7b58fe0249f0703a0d6354583f84997cece7687fae9daef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2dcc6a9625d4e460b7b58fe0249f0703a0d6354583f84997cece7687fae9daef","first_computed_at":"2026-05-18T02:44:57.287478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:57.287478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YmVdb29C5G3S4k6WKSSakCKGP+1mw/EUeURZ8HHDXuVg0y3F2VpfK0R/mG9+0vmqO7OWTIk2l+Ag9ESD8JdQCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:57.287909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.4080","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c11184e81cb0c7cfd824e19894f34e544aa653003d1b109eae82e50c722e58d","sha256:d2d51b368636134a338471320af2b4dd229f69d2295a15f5f41d69fe67ce6add"],"state_sha256":"c1e6ecf88e2a9eb432333751c0c3193f7adaf9f7553a22322624f0f6c04bd262"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pYYDOcyleoJPoFVyk6m4DTt2XHo99ka8qJWNpjqZK2c5VAh9eXllDAfGHAdrYHAsKFnE19enbEkQp6096GK1Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:42:00.154428Z","bundle_sha256":"44342de98527b11d0e6cb43755955336644987ca928de4d03143936b3788e74f"}}