{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ESNTWKVNBMBOFBTMTXLIHSC66T","short_pith_number":"pith:ESNTWKVN","canonical_record":{"source":{"id":"1409.4433","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-09-15T20:07:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"44ac9c7bff09c8ab71447975cd128256ff057d7d7d39437ff04c2394901170a2","abstract_canon_sha256":"0adf0c5e717fd8f7bd8f6506a86c792a9d1e02b29cbc852f7a4c89a5c23103c9"},"schema_version":"1.0"},"canonical_sha256":"249b3b2aad0b02e2866c9dd683c85ef4fed3c07559c9632913bc525f882f7d1a","source":{"kind":"arxiv","id":"1409.4433","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4433","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4433v3","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4433","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"pith_short_12","alias_value":"ESNTWKVNBMBO","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"ESNTWKVNBMBOFBTM","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"ESNTWKVN","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ESNTWKVNBMBOFBTMTXLIHSC66T","target":"record","payload":{"canonical_record":{"source":{"id":"1409.4433","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-09-15T20:07:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"44ac9c7bff09c8ab71447975cd128256ff057d7d7d39437ff04c2394901170a2","abstract_canon_sha256":"0adf0c5e717fd8f7bd8f6506a86c792a9d1e02b29cbc852f7a4c89a5c23103c9"},"schema_version":"1.0"},"canonical_sha256":"249b3b2aad0b02e2866c9dd683c85ef4fed3c07559c9632913bc525f882f7d1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:10.958012Z","signature_b64":"0+1NzOA2BjMQB1l4wQEgr86Pb6bATBSCekbE5pm8yyybXeaiOnIDznVKKCPLfqPpBH54CTKTzm5bMG70JVXQDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"249b3b2aad0b02e2866c9dd683c85ef4fed3c07559c9632913bc525f882f7d1a","last_reissued_at":"2026-05-18T00:53:10.957393Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:10.957393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.4433","source_version":3,"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:53:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s0QC2IjctC9o/p5WyVbMftraik6OU953H6/dDUb2HFAwZjUYCaD9oP28j54MtAF0/bKsXEJLpBMr83ZHxBT+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T11:05:30.780788Z"},"content_sha256":"185126a2117cc2a794440e0dd9d5b63c92a6da2c08f081a5360bee1401af5adc","schema_version":"1.0","event_id":"sha256:185126a2117cc2a794440e0dd9d5b63c92a6da2c08f081a5360bee1401af5adc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ESNTWKVNBMBOFBTMTXLIHSC66T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Faster Existential FO Model Checking on Posets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.LO","authors_text":"Brno), Jakub Gajarsk\\'y (Masaryk University, Jan Obdr\\v{z}\\'alek (Masaryk University, Petr Hlin\\v{e}n\\'y (Masaryk University, Sebastian Ordyniak (Masaryk University","submitted_at":"2014-09-15T20:07:27Z","abstract_excerpt":"We prove that the model checking problem for the existential fragment of first-order (FO) logic on partially ordered sets is fixed-parameter tractable (FPT) with respect to the formula and the width of a poset (the maximum size of an antichain). While there is a long line of research into FO model checking on graphs, the study of this problem on posets has been initiated just recently by Bova, Ganian and Szeider (CSL-LICS 2014), who proved that the existential fragment of FO has an FPT algorithm for a poset of fixed width. We improve upon their result in two ways: (1) the runtime of our algori"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4433","kind":"arxiv","version":3},"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:53:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eDrJYrYjZZeXIsrt/5jWYQ0r0vqFmPD2ZVVk1P1oSYwOn3cgXIen/08KqSI4TPyb/PadF8VFa1Dks1XlVPlvBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T11:05:30.781130Z"},"content_sha256":"f304ad0cdd3fbdf04b50dd7595dc6aba2897dd2cc76dddc6455631bb6d404923","schema_version":"1.0","event_id":"sha256:f304ad0cdd3fbdf04b50dd7595dc6aba2897dd2cc76dddc6455631bb6d404923"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ESNTWKVNBMBOFBTMTXLIHSC66T/bundle.json","state_url":"https://pith.science/pith/ESNTWKVNBMBOFBTMTXLIHSC66T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ESNTWKVNBMBOFBTMTXLIHSC66T/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-30T11:05:30Z","links":{"resolver":"https://pith.science/pith/ESNTWKVNBMBOFBTMTXLIHSC66T","bundle":"https://pith.science/pith/ESNTWKVNBMBOFBTMTXLIHSC66T/bundle.json","state":"https://pith.science/pith/ESNTWKVNBMBOFBTMTXLIHSC66T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ESNTWKVNBMBOFBTMTXLIHSC66T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ESNTWKVNBMBOFBTMTXLIHSC66T","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":"0adf0c5e717fd8f7bd8f6506a86c792a9d1e02b29cbc852f7a4c89a5c23103c9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-09-15T20:07:27Z","title_canon_sha256":"44ac9c7bff09c8ab71447975cd128256ff057d7d7d39437ff04c2394901170a2"},"schema_version":"1.0","source":{"id":"1409.4433","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.4433","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"arxiv_version","alias_value":"1409.4433v3","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.4433","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"pith_short_12","alias_value":"ESNTWKVNBMBO","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"ESNTWKVNBMBOFBTM","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"ESNTWKVN","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:f304ad0cdd3fbdf04b50dd7595dc6aba2897dd2cc76dddc6455631bb6d404923","target":"graph","created_at":"2026-05-18T00:53:10Z","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 prove that the model checking problem for the existential fragment of first-order (FO) logic on partially ordered sets is fixed-parameter tractable (FPT) with respect to the formula and the width of a poset (the maximum size of an antichain). While there is a long line of research into FO model checking on graphs, the study of this problem on posets has been initiated just recently by Bova, Ganian and Szeider (CSL-LICS 2014), who proved that the existential fragment of FO has an FPT algorithm for a poset of fixed width. We improve upon their result in two ways: (1) the runtime of our algori","authors_text":"Brno), Jakub Gajarsk\\'y (Masaryk University, Jan Obdr\\v{z}\\'alek (Masaryk University, Petr Hlin\\v{e}n\\'y (Masaryk University, Sebastian Ordyniak (Masaryk University","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-09-15T20:07:27Z","title":"Faster Existential FO Model Checking on Posets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.4433","kind":"arxiv","version":3},"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:185126a2117cc2a794440e0dd9d5b63c92a6da2c08f081a5360bee1401af5adc","target":"record","created_at":"2026-05-18T00:53:10Z","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":"0adf0c5e717fd8f7bd8f6506a86c792a9d1e02b29cbc852f7a4c89a5c23103c9","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-09-15T20:07:27Z","title_canon_sha256":"44ac9c7bff09c8ab71447975cd128256ff057d7d7d39437ff04c2394901170a2"},"schema_version":"1.0","source":{"id":"1409.4433","kind":"arxiv","version":3}},"canonical_sha256":"249b3b2aad0b02e2866c9dd683c85ef4fed3c07559c9632913bc525f882f7d1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"249b3b2aad0b02e2866c9dd683c85ef4fed3c07559c9632913bc525f882f7d1a","first_computed_at":"2026-05-18T00:53:10.957393Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:10.957393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0+1NzOA2BjMQB1l4wQEgr86Pb6bATBSCekbE5pm8yyybXeaiOnIDznVKKCPLfqPpBH54CTKTzm5bMG70JVXQDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:10.958012Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.4433","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:185126a2117cc2a794440e0dd9d5b63c92a6da2c08f081a5360bee1401af5adc","sha256:f304ad0cdd3fbdf04b50dd7595dc6aba2897dd2cc76dddc6455631bb6d404923"],"state_sha256":"89df568caf5e1f08a93176b8a838dd2775f5d42b1aff7567712598fc64b35893"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9n7oLOF9dSk4UWZUmJonQ6tI36B94Du0PQzhl61L99TC/QatcnVn4oxehVbOaVDxGvyx00ON1ALcarixtJItCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T11:05:30.783027Z","bundle_sha256":"5271b32116274e6a728346ee73e85e1b2555f1f9c3c62f09e9ab4a0c651472a8"}}