{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:2ULGUBQO6OQE4GFHGXZW6QM5TT","short_pith_number":"pith:2ULGUBQO","canonical_record":{"source":{"id":"0808.4133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-08-29T17:09:06Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"17e1635204142e61d2d469aace8fc096c636a62a04f73386486592e037ccbbc0","abstract_canon_sha256":"ba4b3a391905514dfbfcb54104c02bcc9b29d3a067cdeea8ad2f0b776bca6986"},"schema_version":"1.0"},"canonical_sha256":"d5166a060ef3a04e18a735f36f419d9cc90d56ee28801da056578114b154b527","source":{"kind":"arxiv","id":"0808.4133","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.4133","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0808.4133v1","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.4133","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"2ULGUBQO6OQE","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"2ULGUBQO6OQE4GFH","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"2ULGUBQO","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:2ULGUBQO6OQE4GFHGXZW6QM5TT","target":"record","payload":{"canonical_record":{"source":{"id":"0808.4133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-08-29T17:09:06Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"17e1635204142e61d2d469aace8fc096c636a62a04f73386486592e037ccbbc0","abstract_canon_sha256":"ba4b3a391905514dfbfcb54104c02bcc9b29d3a067cdeea8ad2f0b776bca6986"},"schema_version":"1.0"},"canonical_sha256":"d5166a060ef3a04e18a735f36f419d9cc90d56ee28801da056578114b154b527","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:25.416906Z","signature_b64":"Ksd9UMeTsww0PO9RbelxghgWIkeupKEgmWUXdix7pSFVS+jSHC28ss6o8zSGcObuDobqZSlyKTP/r8LtWSetDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5166a060ef3a04e18a735f36f419d9cc90d56ee28801da056578114b154b527","last_reissued_at":"2026-05-18T00:58:25.416199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:25.416199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0808.4133","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:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uIMPNwcS7U3WssLCJw3M2WEsd42qd4sFPB0cv5Fk7qSXkx3QrFnyTfUULUw9g4pLX1D0Nzjl97iHcJHqskG4Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:25:20.039858Z"},"content_sha256":"317ea400a88ccbdad6baa1f3f01fbab9552ae02f749039fcb55b1315963dd22d","schema_version":"1.0","event_id":"sha256:317ea400a88ccbdad6baa1f3f01fbab9552ae02f749039fcb55b1315963dd22d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:2ULGUBQO6OQE4GFHGXZW6QM5TT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tableau-based decision procedure for the multi-agent epistemic logic with operators of common and distributed knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"cs.LO","authors_text":"Dmitry Shkatov, Valentin Goranko","submitted_at":"2008-08-29T17:09:06Z","abstract_excerpt":"We develop an incremental-tableau-based decision procedure for the multi-agent epistemic logic MAEL(CD) (aka S5_n (CD)), whose language contains operators of individual knowledge for a finite set Ag of agents, as well as operators of distributed and common knowledge among all agents in Ag. Our tableau procedure works in (deterministic) exponential time, thus establishing an upper bound for MAEL(CD)-satisfiability that matches the (implicit) lower-bound known from earlier results, which implies ExpTime-completeness of MAEL(CD)-satisfiability. Therefore, our procedure provides a complexity-optim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.4133","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:58:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I8/uX0chHerno4bwwMSLQfQGb8lgDxhzE1qUQ/1eqOauCLg8HdA25w4cIIK7TQ/l691cJb8uOGcA5d0AczeeAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T20:25:20.040194Z"},"content_sha256":"364111c69ecb95aecbe606a2c9802912a0dfd9194f1e3666f44635050dcb7baf","schema_version":"1.0","event_id":"sha256:364111c69ecb95aecbe606a2c9802912a0dfd9194f1e3666f44635050dcb7baf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2ULGUBQO6OQE4GFHGXZW6QM5TT/bundle.json","state_url":"https://pith.science/pith/2ULGUBQO6OQE4GFHGXZW6QM5TT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2ULGUBQO6OQE4GFHGXZW6QM5TT/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-22T20:25:20Z","links":{"resolver":"https://pith.science/pith/2ULGUBQO6OQE4GFHGXZW6QM5TT","bundle":"https://pith.science/pith/2ULGUBQO6OQE4GFHGXZW6QM5TT/bundle.json","state":"https://pith.science/pith/2ULGUBQO6OQE4GFHGXZW6QM5TT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2ULGUBQO6OQE4GFHGXZW6QM5TT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:2ULGUBQO6OQE4GFHGXZW6QM5TT","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":"ba4b3a391905514dfbfcb54104c02bcc9b29d3a067cdeea8ad2f0b776bca6986","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-08-29T17:09:06Z","title_canon_sha256":"17e1635204142e61d2d469aace8fc096c636a62a04f73386486592e037ccbbc0"},"schema_version":"1.0","source":{"id":"0808.4133","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0808.4133","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"arxiv_version","alias_value":"0808.4133v1","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.4133","created_at":"2026-05-18T00:58:25Z"},{"alias_kind":"pith_short_12","alias_value":"2ULGUBQO6OQE","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"2ULGUBQO6OQE4GFH","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"2ULGUBQO","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:364111c69ecb95aecbe606a2c9802912a0dfd9194f1e3666f44635050dcb7baf","target":"graph","created_at":"2026-05-18T00:58:25Z","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 develop an incremental-tableau-based decision procedure for the multi-agent epistemic logic MAEL(CD) (aka S5_n (CD)), whose language contains operators of individual knowledge for a finite set Ag of agents, as well as operators of distributed and common knowledge among all agents in Ag. Our tableau procedure works in (deterministic) exponential time, thus establishing an upper bound for MAEL(CD)-satisfiability that matches the (implicit) lower-bound known from earlier results, which implies ExpTime-completeness of MAEL(CD)-satisfiability. Therefore, our procedure provides a complexity-optim","authors_text":"Dmitry Shkatov, Valentin Goranko","cross_cats":["cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-08-29T17:09:06Z","title":"Tableau-based decision procedure for the multi-agent epistemic logic with operators of common and distributed knowledge"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.4133","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:317ea400a88ccbdad6baa1f3f01fbab9552ae02f749039fcb55b1315963dd22d","target":"record","created_at":"2026-05-18T00:58:25Z","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":"ba4b3a391905514dfbfcb54104c02bcc9b29d3a067cdeea8ad2f0b776bca6986","cross_cats_sorted":["cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2008-08-29T17:09:06Z","title_canon_sha256":"17e1635204142e61d2d469aace8fc096c636a62a04f73386486592e037ccbbc0"},"schema_version":"1.0","source":{"id":"0808.4133","kind":"arxiv","version":1}},"canonical_sha256":"d5166a060ef3a04e18a735f36f419d9cc90d56ee28801da056578114b154b527","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5166a060ef3a04e18a735f36f419d9cc90d56ee28801da056578114b154b527","first_computed_at":"2026-05-18T00:58:25.416199Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:25.416199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ksd9UMeTsww0PO9RbelxghgWIkeupKEgmWUXdix7pSFVS+jSHC28ss6o8zSGcObuDobqZSlyKTP/r8LtWSetDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:25.416906Z","signed_message":"canonical_sha256_bytes"},"source_id":"0808.4133","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:317ea400a88ccbdad6baa1f3f01fbab9552ae02f749039fcb55b1315963dd22d","sha256:364111c69ecb95aecbe606a2c9802912a0dfd9194f1e3666f44635050dcb7baf"],"state_sha256":"f0908b742cbcbdbb02c06b7e3c9d620cb9380c76e79c066ee014a44358acf8b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HP4L+75gx2JEiC5bnagiHmnTVyHuDWu4YiASt6wtMErid05kPm/7Rsd2SBgUYbpbUMEDVQoROO3rHzwnDi18Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T20:25:20.042105Z","bundle_sha256":"1e992355317dba5ce673427566e083cadfce3a0e09c4dda0c79ffaff84cf0fd9"}}