{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2XLPI6OGXECDEW7WO32NHPUISE","short_pith_number":"pith:2XLPI6OG","canonical_record":{"source":{"id":"1412.6396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-19T15:51:33Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"be617242d7780e998899946d0f7ded42d12f9f5589f2f085fdadce7d599301f2","abstract_canon_sha256":"32bde4c29420f40de08a94442ad54ee8cfd3a939fc33dbe1fafc5842d6234fc0"},"schema_version":"1.0"},"canonical_sha256":"d5d6f479c6b904325bf676f4d3be889109af3b284ff4ec232b425542eb21dd59","source":{"kind":"arxiv","id":"1412.6396","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6396","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6396v1","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6396","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"pith_short_12","alias_value":"2XLPI6OGXECD","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2XLPI6OGXECDEW7W","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2XLPI6OG","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2XLPI6OGXECDEW7WO32NHPUISE","target":"record","payload":{"canonical_record":{"source":{"id":"1412.6396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-19T15:51:33Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"be617242d7780e998899946d0f7ded42d12f9f5589f2f085fdadce7d599301f2","abstract_canon_sha256":"32bde4c29420f40de08a94442ad54ee8cfd3a939fc33dbe1fafc5842d6234fc0"},"schema_version":"1.0"},"canonical_sha256":"d5d6f479c6b904325bf676f4d3be889109af3b284ff4ec232b425542eb21dd59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:53.591362Z","signature_b64":"9s7EWpnxEuZmTQXnTtSPRSE3vsxWxEk5KMSrhT1QYPES1Fkh1nIcrs2hMkccOk5AnIvEkvPK14Cw2Y/OvWPsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5d6f479c6b904325bf676f4d3be889109af3b284ff4ec232b425542eb21dd59","last_reissued_at":"2026-05-18T02:30:53.590872Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:53.590872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.6396","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:30:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"14AD5BZa4Eb5FegQO+HCChXo3MqBZTj+Ap7/jXhSRScSljMmisPS0CDY06SLHtrXpJCcLhmJ0o0NT7+WbMb9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:31:11.976414Z"},"content_sha256":"6963494180dd47ed737d3a1e3b8b7f055dd7c0ca228262164a2cc2edf2e1dcc0","schema_version":"1.0","event_id":"sha256:6963494180dd47ed737d3a1e3b8b7f055dd7c0ca228262164a2cc2edf2e1dcc0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2XLPI6OGXECDEW7WO32NHPUISE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Existential Second-Order Logic Over Graphs: A Complete Complexity-Theoretic Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Till Tantau","submitted_at":"2014-12-19T15:51:33Z","abstract_excerpt":"Descriptive complexity theory aims at inferring a problem's computational complexity from the syntactic complexity of its description. A cornerstone of this theory is Fagin's Theorem, by which a graph property is expressible in existential second-order logic (ESO logic) if, and only if, it is in NP. A natural question, from the theory's point of view, is which syntactic fragments of ESO logic also still characterize NP. Research on this question has culminated in a dichotomy result by Gottlob, Kolatis, and Schwentick: for each possible quantifier prefix of an ESO formula, the resulting prefix "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6396","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:30:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uJ3SeVG6FtLnEIa5PD7BMjInSVQ8NMPA2unlpH6Q3cUD+J13GFKdFd8kqfZUWUvIcjMEtSQ/e5knc+Tll+0zCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:31:11.976772Z"},"content_sha256":"f371499ad38d347676740fdb12a5e3ba64d74cec77b0b9d6975d26d4d34e5891","schema_version":"1.0","event_id":"sha256:f371499ad38d347676740fdb12a5e3ba64d74cec77b0b9d6975d26d4d34e5891"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2XLPI6OGXECDEW7WO32NHPUISE/bundle.json","state_url":"https://pith.science/pith/2XLPI6OGXECDEW7WO32NHPUISE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2XLPI6OGXECDEW7WO32NHPUISE/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-22T12:31:11Z","links":{"resolver":"https://pith.science/pith/2XLPI6OGXECDEW7WO32NHPUISE","bundle":"https://pith.science/pith/2XLPI6OGXECDEW7WO32NHPUISE/bundle.json","state":"https://pith.science/pith/2XLPI6OGXECDEW7WO32NHPUISE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2XLPI6OGXECDEW7WO32NHPUISE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2XLPI6OGXECDEW7WO32NHPUISE","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":"32bde4c29420f40de08a94442ad54ee8cfd3a939fc33dbe1fafc5842d6234fc0","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-19T15:51:33Z","title_canon_sha256":"be617242d7780e998899946d0f7ded42d12f9f5589f2f085fdadce7d599301f2"},"schema_version":"1.0","source":{"id":"1412.6396","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.6396","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"arxiv_version","alias_value":"1412.6396v1","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.6396","created_at":"2026-05-18T02:30:53Z"},{"alias_kind":"pith_short_12","alias_value":"2XLPI6OGXECD","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2XLPI6OGXECDEW7W","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2XLPI6OG","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:f371499ad38d347676740fdb12a5e3ba64d74cec77b0b9d6975d26d4d34e5891","target":"graph","created_at":"2026-05-18T02:30:53Z","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":"Descriptive complexity theory aims at inferring a problem's computational complexity from the syntactic complexity of its description. A cornerstone of this theory is Fagin's Theorem, by which a graph property is expressible in existential second-order logic (ESO logic) if, and only if, it is in NP. A natural question, from the theory's point of view, is which syntactic fragments of ESO logic also still characterize NP. Research on this question has culminated in a dichotomy result by Gottlob, Kolatis, and Schwentick: for each possible quantifier prefix of an ESO formula, the resulting prefix ","authors_text":"Till Tantau","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-19T15:51:33Z","title":"Existential Second-Order Logic Over Graphs: A Complete Complexity-Theoretic Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.6396","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:6963494180dd47ed737d3a1e3b8b7f055dd7c0ca228262164a2cc2edf2e1dcc0","target":"record","created_at":"2026-05-18T02:30:53Z","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":"32bde4c29420f40de08a94442ad54ee8cfd3a939fc33dbe1fafc5842d6234fc0","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-12-19T15:51:33Z","title_canon_sha256":"be617242d7780e998899946d0f7ded42d12f9f5589f2f085fdadce7d599301f2"},"schema_version":"1.0","source":{"id":"1412.6396","kind":"arxiv","version":1}},"canonical_sha256":"d5d6f479c6b904325bf676f4d3be889109af3b284ff4ec232b425542eb21dd59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5d6f479c6b904325bf676f4d3be889109af3b284ff4ec232b425542eb21dd59","first_computed_at":"2026-05-18T02:30:53.590872Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:53.590872Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9s7EWpnxEuZmTQXnTtSPRSE3vsxWxEk5KMSrhT1QYPES1Fkh1nIcrs2hMkccOk5AnIvEkvPK14Cw2Y/OvWPsBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:53.591362Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.6396","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6963494180dd47ed737d3a1e3b8b7f055dd7c0ca228262164a2cc2edf2e1dcc0","sha256:f371499ad38d347676740fdb12a5e3ba64d74cec77b0b9d6975d26d4d34e5891"],"state_sha256":"52fc38c86abe44693e71a48bccf18e94cbad491c7d6914cf3de72dff8f19bbc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UTb4JK5y1CcsJxib71Ku/JX1A9N9gb3CxT8W5VODkkiGFDs091NpU1A3nQoVzkA6ioGfFBXEcHmepVagzyWtCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T12:31:11.978808Z","bundle_sha256":"ad76d95b128f9902fac9044f8fd259a88760bbb8603baef55ffb37d9acb92014"}}