{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WPOKIBPPHGCBUCNRILL55HQ5JX","short_pith_number":"pith:WPOKIBPP","canonical_record":{"source":{"id":"1808.03852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-11T19:25:04Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"983e84a39aaeeec39a79a959871240583fc4268397dc51440842678038774da5","abstract_canon_sha256":"db0c39e302dce385f692e5ed4ea91710c1c2513c2f62c0010843eb8b5d55488e"},"schema_version":"1.0"},"canonical_sha256":"b3dca405ef39841a09b142d7de9e1d4dc0b904cb678a71ef81204cd845479830","source":{"kind":"arxiv","id":"1808.03852","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03852","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03852v1","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03852","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"pith_short_12","alias_value":"WPOKIBPPHGCB","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WPOKIBPPHGCBUCNR","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WPOKIBPP","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WPOKIBPPHGCBUCNRILL55HQ5JX","target":"record","payload":{"canonical_record":{"source":{"id":"1808.03852","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-11T19:25:04Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"983e84a39aaeeec39a79a959871240583fc4268397dc51440842678038774da5","abstract_canon_sha256":"db0c39e302dce385f692e5ed4ea91710c1c2513c2f62c0010843eb8b5d55488e"},"schema_version":"1.0"},"canonical_sha256":"b3dca405ef39841a09b142d7de9e1d4dc0b904cb678a71ef81204cd845479830","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:19.520270Z","signature_b64":"OplAM9nR3EpvBIOyetPezZ7kFZngy2fTmuMP0tA5/aqYN0sGqSikreTdZzy0gMxmcGntt95dXNyIU8sOvVo6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3dca405ef39841a09b142d7de9e1d4dc0b904cb678a71ef81204cd845479830","last_reissued_at":"2026-05-18T00:08:19.519703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:19.519703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1808.03852","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:08:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5YxaZljKqJls34FpDIrLIGamvuFamQwqNH0e4qA7lzTjSvWcPmo+GD+DEXX7U1Xltwn85C5AoIYJLgKHexk2Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T15:52:02.341603Z"},"content_sha256":"b5c40102ab02be92732d1633a00ab9fb0f6107148eaf0f267f0cb0ec23408259","schema_version":"1.0","event_id":"sha256:b5c40102ab02be92732d1633a00ab9fb0f6107148eaf0f267f0cb0ec23408259"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WPOKIBPPHGCBUCNRILL55HQ5JX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Parameterized Complexity View on Description Logic Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.LO","authors_text":"Ronald de Haan","submitted_at":"2018-08-11T19:25:04Z","abstract_excerpt":"Description logics are knowledge representation languages that have been designed to strike a balance between expressivity and computational tractability. Many different description logics have been developed, and numerous computational problems for these logics have been studied for their computational complexity. However, essentially all complexity analyses of reasoning problems for description logics use the one-dimensional framework of classical complexity theory. The multi-dimensional framework of parameterized complexity theory is able to provide a much more detailed image of the complex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03852","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:08:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kpvjC7Gs/XJn+62DtQ5JJLiVf8vJUJVqRYpqkG7fqOO8ls7AfdsdAKScCGVlPzeOGnwfJwxTgSO6LTCFFvMMCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T15:52:02.341959Z"},"content_sha256":"fe2d045a47457ceaec8fd488d537b319a36065a74e19752efa082a1a44f62b46","schema_version":"1.0","event_id":"sha256:fe2d045a47457ceaec8fd488d537b319a36065a74e19752efa082a1a44f62b46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPOKIBPPHGCBUCNRILL55HQ5JX/bundle.json","state_url":"https://pith.science/pith/WPOKIBPPHGCBUCNRILL55HQ5JX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPOKIBPPHGCBUCNRILL55HQ5JX/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-07-04T15:52:02Z","links":{"resolver":"https://pith.science/pith/WPOKIBPPHGCBUCNRILL55HQ5JX","bundle":"https://pith.science/pith/WPOKIBPPHGCBUCNRILL55HQ5JX/bundle.json","state":"https://pith.science/pith/WPOKIBPPHGCBUCNRILL55HQ5JX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPOKIBPPHGCBUCNRILL55HQ5JX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WPOKIBPPHGCBUCNRILL55HQ5JX","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":"db0c39e302dce385f692e5ed4ea91710c1c2513c2f62c0010843eb8b5d55488e","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-11T19:25:04Z","title_canon_sha256":"983e84a39aaeeec39a79a959871240583fc4268397dc51440842678038774da5"},"schema_version":"1.0","source":{"id":"1808.03852","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.03852","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"arxiv_version","alias_value":"1808.03852v1","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.03852","created_at":"2026-05-18T00:08:19Z"},{"alias_kind":"pith_short_12","alias_value":"WPOKIBPPHGCB","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WPOKIBPPHGCBUCNR","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WPOKIBPP","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:fe2d045a47457ceaec8fd488d537b319a36065a74e19752efa082a1a44f62b46","target":"graph","created_at":"2026-05-18T00:08:19Z","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":"Description logics are knowledge representation languages that have been designed to strike a balance between expressivity and computational tractability. Many different description logics have been developed, and numerous computational problems for these logics have been studied for their computational complexity. However, essentially all complexity analyses of reasoning problems for description logics use the one-dimensional framework of classical complexity theory. The multi-dimensional framework of parameterized complexity theory is able to provide a much more detailed image of the complex","authors_text":"Ronald de Haan","cross_cats":["cs.AI","cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-11T19:25:04Z","title":"A Parameterized Complexity View on Description Logic Reasoning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.03852","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:b5c40102ab02be92732d1633a00ab9fb0f6107148eaf0f267f0cb0ec23408259","target":"record","created_at":"2026-05-18T00:08:19Z","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":"db0c39e302dce385f692e5ed4ea91710c1c2513c2f62c0010843eb8b5d55488e","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-08-11T19:25:04Z","title_canon_sha256":"983e84a39aaeeec39a79a959871240583fc4268397dc51440842678038774da5"},"schema_version":"1.0","source":{"id":"1808.03852","kind":"arxiv","version":1}},"canonical_sha256":"b3dca405ef39841a09b142d7de9e1d4dc0b904cb678a71ef81204cd845479830","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3dca405ef39841a09b142d7de9e1d4dc0b904cb678a71ef81204cd845479830","first_computed_at":"2026-05-18T00:08:19.519703Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:19.519703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OplAM9nR3EpvBIOyetPezZ7kFZngy2fTmuMP0tA5/aqYN0sGqSikreTdZzy0gMxmcGntt95dXNyIU8sOvVo6Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:19.520270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.03852","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5c40102ab02be92732d1633a00ab9fb0f6107148eaf0f267f0cb0ec23408259","sha256:fe2d045a47457ceaec8fd488d537b319a36065a74e19752efa082a1a44f62b46"],"state_sha256":"765276ce57fc682a3647425a17100ec1b452b7354af38c4e081cfcf1b8a99131"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a9gX8oJ8tdXWR4BYAvyGtt+1zKDZCT7EBGaJldC9pU+lLV4QyB4DUWhGkNFxFRzNLAACu6AvPwgt4nMSrM47DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T15:52:02.344265Z","bundle_sha256":"44b4ccf3e00877a64184780bcef7b758bfb12809b87a34e7e8c23bcdc473a26e"}}