{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:OVH7PNC74ZM7SZYZEEW5N7HPY4","short_pith_number":"pith:OVH7PNC7","canonical_record":{"source":{"id":"1401.6359","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-24T14:50:44Z","cross_cats_sorted":[],"title_canon_sha256":"2f7906ac6bea54a4879240842deb9bc4ebeec4f4eedebb17d78a595da886be40","abstract_canon_sha256":"0f75c05d0322875d3ea129999aa2b988d2dd3ec5843b6ae68edf9b5aff8f76f4"},"schema_version":"1.0"},"canonical_sha256":"754ff7b45fe659f96719212dd6fcefc72d9fc6bf1a2e3ab88ad0344c6304a132","source":{"kind":"arxiv","id":"1401.6359","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6359","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6359v5","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6359","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"pith_short_12","alias_value":"OVH7PNC74ZM7","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OVH7PNC74ZM7SZYZ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OVH7PNC7","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:OVH7PNC74ZM7SZYZEEW5N7HPY4","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6359","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-24T14:50:44Z","cross_cats_sorted":[],"title_canon_sha256":"2f7906ac6bea54a4879240842deb9bc4ebeec4f4eedebb17d78a595da886be40","abstract_canon_sha256":"0f75c05d0322875d3ea129999aa2b988d2dd3ec5843b6ae68edf9b5aff8f76f4"},"schema_version":"1.0"},"canonical_sha256":"754ff7b45fe659f96719212dd6fcefc72d9fc6bf1a2e3ab88ad0344c6304a132","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:22.746174Z","signature_b64":"pku7P05QGbIv73ivB4kmMya4fQDNXOt/ljQNmPAU0WmU5fzPZziyWHqaujdavG58s0nfIWey9aCFSvaX1tcGCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"754ff7b45fe659f96719212dd6fcefc72d9fc6bf1a2e3ab88ad0344c6304a132","last_reissued_at":"2026-05-18T02:50:22.745499Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:22.745499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6359","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:50:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zvf6Uh6nX7B2OFFph6GW1vtwtQNPPlv9jdjeqLp6emTFDtPza38oi/3XZwbkOKTJhSiayTy0IHO3eiRruidCCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:05:33.391776Z"},"content_sha256":"99071096758c1c1f3edbe2f2398ed4f119b0228e2d14e9f75aebd327a32a0414","schema_version":"1.0","event_id":"sha256:99071096758c1c1f3edbe2f2398ed4f119b0228e2d14e9f75aebd327a32a0414"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:OVH7PNC74ZM7SZYZEEW5N7HPY4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subsumption Checking in Conjunctive Coalgebraic Fixpoint Logics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniel Gor\\'in, Lutz Schr\\\"oder","submitted_at":"2014-01-24T14:50:44Z","abstract_excerpt":"While reasoning in a logic extending a complete Boolean basis is coNP-hard, restricting to conjunctive fragments of modal languages sometimes allows for tractable reasoning even in the presence of greatest fixpoints. One such example is the EL family of description logics; here, efficient reasoning is based on satisfaction checking in suitable small models that characterize formulas in terms of simulations. It is well-known, though, that not every conjunctive modal language has a tractable reasoning problem. Natural questions are then how common such tractable fragments are and how to identify"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6359","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:50:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajTo9D2RfKbSvCot8LsDdDUGJW5f09hhXY5KCg2nEyIrhlpoVQtCQsK1QDoCs77zlogxdQ6b/SP22OQxE5UzDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T22:05:33.392110Z"},"content_sha256":"b2bfc6e2bd3c623cf3bb42ccf21b1c63e74a12349bef50849961d91e846f9f99","schema_version":"1.0","event_id":"sha256:b2bfc6e2bd3c623cf3bb42ccf21b1c63e74a12349bef50849961d91e846f9f99"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OVH7PNC74ZM7SZYZEEW5N7HPY4/bundle.json","state_url":"https://pith.science/pith/OVH7PNC74ZM7SZYZEEW5N7HPY4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OVH7PNC74ZM7SZYZEEW5N7HPY4/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-24T22:05:33Z","links":{"resolver":"https://pith.science/pith/OVH7PNC74ZM7SZYZEEW5N7HPY4","bundle":"https://pith.science/pith/OVH7PNC74ZM7SZYZEEW5N7HPY4/bundle.json","state":"https://pith.science/pith/OVH7PNC74ZM7SZYZEEW5N7HPY4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OVH7PNC74ZM7SZYZEEW5N7HPY4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:OVH7PNC74ZM7SZYZEEW5N7HPY4","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":"0f75c05d0322875d3ea129999aa2b988d2dd3ec5843b6ae68edf9b5aff8f76f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-24T14:50:44Z","title_canon_sha256":"2f7906ac6bea54a4879240842deb9bc4ebeec4f4eedebb17d78a595da886be40"},"schema_version":"1.0","source":{"id":"1401.6359","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6359","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6359v5","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6359","created_at":"2026-05-18T02:50:22Z"},{"alias_kind":"pith_short_12","alias_value":"OVH7PNC74ZM7","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"OVH7PNC74ZM7SZYZ","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"OVH7PNC7","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:b2bfc6e2bd3c623cf3bb42ccf21b1c63e74a12349bef50849961d91e846f9f99","target":"graph","created_at":"2026-05-18T02:50:22Z","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":"While reasoning in a logic extending a complete Boolean basis is coNP-hard, restricting to conjunctive fragments of modal languages sometimes allows for tractable reasoning even in the presence of greatest fixpoints. One such example is the EL family of description logics; here, efficient reasoning is based on satisfaction checking in suitable small models that characterize formulas in terms of simulations. It is well-known, though, that not every conjunctive modal language has a tractable reasoning problem. Natural questions are then how common such tractable fragments are and how to identify","authors_text":"Daniel Gor\\'in, Lutz Schr\\\"oder","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-24T14:50:44Z","title":"Subsumption Checking in Conjunctive Coalgebraic Fixpoint Logics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6359","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:99071096758c1c1f3edbe2f2398ed4f119b0228e2d14e9f75aebd327a32a0414","target":"record","created_at":"2026-05-18T02:50:22Z","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":"0f75c05d0322875d3ea129999aa2b988d2dd3ec5843b6ae68edf9b5aff8f76f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-01-24T14:50:44Z","title_canon_sha256":"2f7906ac6bea54a4879240842deb9bc4ebeec4f4eedebb17d78a595da886be40"},"schema_version":"1.0","source":{"id":"1401.6359","kind":"arxiv","version":5}},"canonical_sha256":"754ff7b45fe659f96719212dd6fcefc72d9fc6bf1a2e3ab88ad0344c6304a132","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"754ff7b45fe659f96719212dd6fcefc72d9fc6bf1a2e3ab88ad0344c6304a132","first_computed_at":"2026-05-18T02:50:22.745499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:22.745499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pku7P05QGbIv73ivB4kmMya4fQDNXOt/ljQNmPAU0WmU5fzPZziyWHqaujdavG58s0nfIWey9aCFSvaX1tcGCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:22.746174Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6359","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99071096758c1c1f3edbe2f2398ed4f119b0228e2d14e9f75aebd327a32a0414","sha256:b2bfc6e2bd3c623cf3bb42ccf21b1c63e74a12349bef50849961d91e846f9f99"],"state_sha256":"95c19302f50651ea6499032c492c27f79617d45a20416e50d17106b06cd8cd6a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H5w2+GdAe2rKVQlf/+jwwd8Qv3WPG6lAUN3oMjDahc6z0Hty5ubj0dp1C4IY2JeJM6hgciWTwAg3dPzJUDW3Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T22:05:33.394132Z","bundle_sha256":"f63221ec610a2c59b75df6693762cce6e0d34851f4449973b6b735e802dccabe"}}