{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:4UI7XJUPZY6NHBJMNNK2UBIVT5","short_pith_number":"pith:4UI7XJUP","canonical_record":{"source":{"id":"1303.6424","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-03-26T10:20:42Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ddf96846694c8bdf19e0438fb31245e64bf781144d8f17e8b3975ac3587bd8db","abstract_canon_sha256":"456d5680c7d312d07c2662cca05c541298ed50a0e75e976ec1ce238807a7f3ab"},"schema_version":"1.0"},"canonical_sha256":"e511fba68fce3cd3852c6b55aa05159f4935cf5b517fa498b6afc98382567349","source":{"kind":"arxiv","id":"1303.6424","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6424","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6424v1","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6424","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"4UI7XJUPZY6N","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4UI7XJUPZY6NHBJM","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4UI7XJUP","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:4UI7XJUPZY6NHBJMNNK2UBIVT5","target":"record","payload":{"canonical_record":{"source":{"id":"1303.6424","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-03-26T10:20:42Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ddf96846694c8bdf19e0438fb31245e64bf781144d8f17e8b3975ac3587bd8db","abstract_canon_sha256":"456d5680c7d312d07c2662cca05c541298ed50a0e75e976ec1ce238807a7f3ab"},"schema_version":"1.0"},"canonical_sha256":"e511fba68fce3cd3852c6b55aa05159f4935cf5b517fa498b6afc98382567349","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:29:49.467037Z","signature_b64":"FIpzqxh9ECtYj0g1BHetzkhAZ3DdPhL8uj9UamqkOpYdROjOiTNV9ebInbH8VIOVT2GIIfcLlyCoGpe0kP3KCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e511fba68fce3cd3852c6b55aa05159f4935cf5b517fa498b6afc98382567349","last_reissued_at":"2026-05-18T03:29:49.466459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:29:49.466459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.6424","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-18T03:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eFSGWZntzFMbnjzmFY6No2rwcMgRdLHHLIjeHlpUsi5EbPSJ7g5MzFbnSLXJBwbXsstjRtSQBUH0k0OY2ssPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:42:47.352110Z"},"content_sha256":"f77a55f922b2104ec7de892be24f3865d073a546bb9d5f5c7a9ca13a8117aadc","schema_version":"1.0","event_id":"sha256:f77a55f922b2104ec7de892be24f3865d073a546bb9d5f5c7a9ca13a8117aadc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:4UI7XJUPZY6NHBJMNNK2UBIVT5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model Checking for Modal Dependence Logic: An Approach Through Post's Lattice","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Heribert Vollmer, Julian-Steffen M\\\"uller","submitted_at":"2013-03-26T10:20:42Z","abstract_excerpt":"In this paper we investigate an extended version of modal dependence logic by allowing arbitrary Boolean connectives. Modal dependence logic was recently introduced by Jouko V\\\"a\\\"an\\\"anen by extending modal logic by a the dependence atom dep(.). In this paper we study the computational complexity of the model checking problem. For a complete classification of arbitrary Boolean functions we are using a Lattice approach introduced by Emil Post. This classification is done for all fragments of the logical language allowing modalities $\\Diamond$ and $\\Box$, the dependence atom, and logical symbol"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6424","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-18T03:29:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mlVnQ4dt9MQj6T4+qeDbiIR3DHLQQcSbU/zWdbuGEu/HZPQRSjk2jnS/rQwim5GQRm4sdIo7QTw3lwUCR1RmBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:42:47.352504Z"},"content_sha256":"845c0e733f380775d2ced8b9279b3cd1560a84fb9414225a69db4c12ad68677f","schema_version":"1.0","event_id":"sha256:845c0e733f380775d2ced8b9279b3cd1560a84fb9414225a69db4c12ad68677f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4UI7XJUPZY6NHBJMNNK2UBIVT5/bundle.json","state_url":"https://pith.science/pith/4UI7XJUPZY6NHBJMNNK2UBIVT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4UI7XJUPZY6NHBJMNNK2UBIVT5/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-01T03:42:47Z","links":{"resolver":"https://pith.science/pith/4UI7XJUPZY6NHBJMNNK2UBIVT5","bundle":"https://pith.science/pith/4UI7XJUPZY6NHBJMNNK2UBIVT5/bundle.json","state":"https://pith.science/pith/4UI7XJUPZY6NHBJMNNK2UBIVT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4UI7XJUPZY6NHBJMNNK2UBIVT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:4UI7XJUPZY6NHBJMNNK2UBIVT5","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":"456d5680c7d312d07c2662cca05c541298ed50a0e75e976ec1ce238807a7f3ab","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-03-26T10:20:42Z","title_canon_sha256":"ddf96846694c8bdf19e0438fb31245e64bf781144d8f17e8b3975ac3587bd8db"},"schema_version":"1.0","source":{"id":"1303.6424","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.6424","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"arxiv_version","alias_value":"1303.6424v1","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.6424","created_at":"2026-05-18T03:29:49Z"},{"alias_kind":"pith_short_12","alias_value":"4UI7XJUPZY6N","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"4UI7XJUPZY6NHBJM","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"4UI7XJUP","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:845c0e733f380775d2ced8b9279b3cd1560a84fb9414225a69db4c12ad68677f","target":"graph","created_at":"2026-05-18T03:29:49Z","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":"In this paper we investigate an extended version of modal dependence logic by allowing arbitrary Boolean connectives. Modal dependence logic was recently introduced by Jouko V\\\"a\\\"an\\\"anen by extending modal logic by a the dependence atom dep(.). In this paper we study the computational complexity of the model checking problem. For a complete classification of arbitrary Boolean functions we are using a Lattice approach introduced by Emil Post. This classification is done for all fragments of the logical language allowing modalities $\\Diamond$ and $\\Box$, the dependence atom, and logical symbol","authors_text":"Heribert Vollmer, Julian-Steffen M\\\"uller","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-03-26T10:20:42Z","title":"Model Checking for Modal Dependence Logic: An Approach Through Post's Lattice"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.6424","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:f77a55f922b2104ec7de892be24f3865d073a546bb9d5f5c7a9ca13a8117aadc","target":"record","created_at":"2026-05-18T03:29:49Z","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":"456d5680c7d312d07c2662cca05c541298ed50a0e75e976ec1ce238807a7f3ab","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-03-26T10:20:42Z","title_canon_sha256":"ddf96846694c8bdf19e0438fb31245e64bf781144d8f17e8b3975ac3587bd8db"},"schema_version":"1.0","source":{"id":"1303.6424","kind":"arxiv","version":1}},"canonical_sha256":"e511fba68fce3cd3852c6b55aa05159f4935cf5b517fa498b6afc98382567349","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e511fba68fce3cd3852c6b55aa05159f4935cf5b517fa498b6afc98382567349","first_computed_at":"2026-05-18T03:29:49.466459Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:29:49.466459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FIpzqxh9ECtYj0g1BHetzkhAZ3DdPhL8uj9UamqkOpYdROjOiTNV9ebInbH8VIOVT2GIIfcLlyCoGpe0kP3KCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:29:49.467037Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.6424","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f77a55f922b2104ec7de892be24f3865d073a546bb9d5f5c7a9ca13a8117aadc","sha256:845c0e733f380775d2ced8b9279b3cd1560a84fb9414225a69db4c12ad68677f"],"state_sha256":"ba7c6e72823b8fbee7906f2515f596f1159d38839ccf06dbe0010c86d0a9ec1d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WSjs88fPv6tQA+2AYeYc50sDlsggYyxu5P7eOGZ0O0uUU2D6fnyR0Sm3+9ohP0x6cwWieFFnFUWq0bv2ahp3Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:42:47.355018Z","bundle_sha256":"e6800d6dc3fe3e44b8b4f7aa0b0e3cee33f96c7f85edf0b21e1be2e686ba0caa"}}