{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FNFG3GSRAXHJWUMJFAI3T755FX","short_pith_number":"pith:FNFG3GSR","canonical_record":{"source":{"id":"1310.6406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-10-23T22:03:27Z","cross_cats_sorted":[],"title_canon_sha256":"90ca204d341f74367f0e6fce20e40f8e80d94c24f6e6664265a7b854edc1a4b6","abstract_canon_sha256":"768f2707fdc2e1c8c613ee4ce7aa78bc3b4b02399448c59b1319b70a8c16f798"},"schema_version":"1.0"},"canonical_sha256":"2b4a6d9a5105ce9b51892811b9ffbd2dc5e735f041f5941bfefe94ff9e8b9e4e","source":{"kind":"arxiv","id":"1310.6406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6406","created_at":"2026-05-18T03:08:48Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6406v1","created_at":"2026-05-18T03:08:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6406","created_at":"2026-05-18T03:08:48Z"},{"alias_kind":"pith_short_12","alias_value":"FNFG3GSRAXHJ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FNFG3GSRAXHJWUMJ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FNFG3GSR","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FNFG3GSRAXHJWUMJFAI3T755FX","target":"record","payload":{"canonical_record":{"source":{"id":"1310.6406","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-10-23T22:03:27Z","cross_cats_sorted":[],"title_canon_sha256":"90ca204d341f74367f0e6fce20e40f8e80d94c24f6e6664265a7b854edc1a4b6","abstract_canon_sha256":"768f2707fdc2e1c8c613ee4ce7aa78bc3b4b02399448c59b1319b70a8c16f798"},"schema_version":"1.0"},"canonical_sha256":"2b4a6d9a5105ce9b51892811b9ffbd2dc5e735f041f5941bfefe94ff9e8b9e4e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:48.382232Z","signature_b64":"njz8L6zsqcWZkFoVoC+V74qErp7dcStO+I218LigGrKABz41VHhqXKVxvSHfEBhytUscnM5hFsfaisewaVpgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b4a6d9a5105ce9b51892811b9ffbd2dc5e735f041f5941bfefe94ff9e8b9e4e","last_reissued_at":"2026-05-18T03:08:48.381083Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:48.381083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.6406","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:08:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mB7SDc08BTdpKAR12NYNIxVjw1wEhf0v38Exz795LAEKtfsvo0qoP9BF2qqS2YMkiCImVhti1TVYa1H9y0ABBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:28:36.080174Z"},"content_sha256":"189979ad1821b4a668a89be473c431f6e387b75bd0573533117e6eadc2377eb3","schema_version":"1.0","event_id":"sha256:189979ad1821b4a668a89be473c431f6e387b75bd0573533117e6eadc2377eb3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FNFG3GSRAXHJWUMJFAI3T755FX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Dynamic Epistemic Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Francois Schwarzentruber, Guillaume Aucher","submitted_at":"2013-10-23T22:03:27Z","abstract_excerpt":"Although Dynamic Epistemic Logic (DEL) is an influential logical framework for representing and reasoning about information change, little is known about the computational complexity of its associated decision problems. In fact, we only know that for public announcement logic, a fragment of DEL, the satisfiability problem and the model-checking problem are respectively PSPACE-complete and in P. We contribute to fill this gap by proving that for the DEL language with event models, the model-checking problem is, surprisingly, PSPACE-complete. Also, we prove that the satisfiability problem is NEX"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6406","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:08:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ATLhnZ0dfqIjGfJVYIKQvmlUKwsahMofpGu5XNbxeRdHlMjQBfgKB/uFxlf5WsJoj6g5M4IvdlsM0VDtVW4TAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T14:28:36.080530Z"},"content_sha256":"cb7db30c775e27eb259808efe094887cdb6bdc2a62c92f866171a4fa0b92d6d4","schema_version":"1.0","event_id":"sha256:cb7db30c775e27eb259808efe094887cdb6bdc2a62c92f866171a4fa0b92d6d4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FNFG3GSRAXHJWUMJFAI3T755FX/bundle.json","state_url":"https://pith.science/pith/FNFG3GSRAXHJWUMJFAI3T755FX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FNFG3GSRAXHJWUMJFAI3T755FX/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-11T14:28:36Z","links":{"resolver":"https://pith.science/pith/FNFG3GSRAXHJWUMJFAI3T755FX","bundle":"https://pith.science/pith/FNFG3GSRAXHJWUMJFAI3T755FX/bundle.json","state":"https://pith.science/pith/FNFG3GSRAXHJWUMJFAI3T755FX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FNFG3GSRAXHJWUMJFAI3T755FX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FNFG3GSRAXHJWUMJFAI3T755FX","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":"768f2707fdc2e1c8c613ee4ce7aa78bc3b4b02399448c59b1319b70a8c16f798","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-10-23T22:03:27Z","title_canon_sha256":"90ca204d341f74367f0e6fce20e40f8e80d94c24f6e6664265a7b854edc1a4b6"},"schema_version":"1.0","source":{"id":"1310.6406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6406","created_at":"2026-05-18T03:08:48Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6406v1","created_at":"2026-05-18T03:08:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6406","created_at":"2026-05-18T03:08:48Z"},{"alias_kind":"pith_short_12","alias_value":"FNFG3GSRAXHJ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FNFG3GSRAXHJWUMJ","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FNFG3GSR","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:cb7db30c775e27eb259808efe094887cdb6bdc2a62c92f866171a4fa0b92d6d4","target":"graph","created_at":"2026-05-18T03:08:48Z","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":"Although Dynamic Epistemic Logic (DEL) is an influential logical framework for representing and reasoning about information change, little is known about the computational complexity of its associated decision problems. In fact, we only know that for public announcement logic, a fragment of DEL, the satisfiability problem and the model-checking problem are respectively PSPACE-complete and in P. We contribute to fill this gap by proving that for the DEL language with event models, the model-checking problem is, surprisingly, PSPACE-complete. Also, we prove that the satisfiability problem is NEX","authors_text":"Francois Schwarzentruber, Guillaume Aucher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-10-23T22:03:27Z","title":"On the Complexity of Dynamic Epistemic Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6406","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:189979ad1821b4a668a89be473c431f6e387b75bd0573533117e6eadc2377eb3","target":"record","created_at":"2026-05-18T03:08:48Z","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":"768f2707fdc2e1c8c613ee4ce7aa78bc3b4b02399448c59b1319b70a8c16f798","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-10-23T22:03:27Z","title_canon_sha256":"90ca204d341f74367f0e6fce20e40f8e80d94c24f6e6664265a7b854edc1a4b6"},"schema_version":"1.0","source":{"id":"1310.6406","kind":"arxiv","version":1}},"canonical_sha256":"2b4a6d9a5105ce9b51892811b9ffbd2dc5e735f041f5941bfefe94ff9e8b9e4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b4a6d9a5105ce9b51892811b9ffbd2dc5e735f041f5941bfefe94ff9e8b9e4e","first_computed_at":"2026-05-18T03:08:48.381083Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:48.381083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"njz8L6zsqcWZkFoVoC+V74qErp7dcStO+I218LigGrKABz41VHhqXKVxvSHfEBhytUscnM5hFsfaisewaVpgCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:48.382232Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.6406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:189979ad1821b4a668a89be473c431f6e387b75bd0573533117e6eadc2377eb3","sha256:cb7db30c775e27eb259808efe094887cdb6bdc2a62c92f866171a4fa0b92d6d4"],"state_sha256":"7b4b1d10467b858541abe76bfc54e4decb0e6cb6bfa8a2997a5a16d719ce4117"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a31yaPXV5Q4K7sexsRuv+FnGfmL4/uh0csbldyl93DtF0wgNv+QBKMZoyYxxSNt4kRzLAKWEnCzvM3961JAgDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T14:28:36.082481Z","bundle_sha256":"9a3d0f5cd4da910afb8b4f547f7aac673de675a97a20556b376b72e05ad030ad"}}