{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NQMA4TNFTKC6HUSG7PYUU7JTPF","short_pith_number":"pith:NQMA4TNF","canonical_record":{"source":{"id":"1606.07526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-24T00:32:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"dd8e365a4a0741c95094dfec270c9035b442fd7d348ccc3158dc868649861519","abstract_canon_sha256":"e9ce86d63dc5befae4f7291b17963e0839cc188e8f1694db8421bbb09ba83f1e"},"schema_version":"1.0"},"canonical_sha256":"6c180e4da59a85e3d246fbf14a7d33794eb3257d12df68ed56815cbdb446cfcf","source":{"kind":"arxiv","id":"1606.07526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07526","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07526v1","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07526","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"NQMA4TNFTKC6","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NQMA4TNFTKC6HUSG","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NQMA4TNF","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NQMA4TNFTKC6HUSG7PYUU7JTPF","target":"record","payload":{"canonical_record":{"source":{"id":"1606.07526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-24T00:32:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"dd8e365a4a0741c95094dfec270c9035b442fd7d348ccc3158dc868649861519","abstract_canon_sha256":"e9ce86d63dc5befae4f7291b17963e0839cc188e8f1694db8421bbb09ba83f1e"},"schema_version":"1.0"},"canonical_sha256":"6c180e4da59a85e3d246fbf14a7d33794eb3257d12df68ed56815cbdb446cfcf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:57.334258Z","signature_b64":"tVGafvOMdd/f4JaM8uaoIhbyYv10xuiaaRl6hjXkcp6bVNtNM8hwhC8BM0dm59yNcX79EghJ+Lmv8t8FsPnCDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c180e4da59a85e3d246fbf14a7d33794eb3257d12df68ed56815cbdb446cfcf","last_reissued_at":"2026-05-18T01:11:57.333922Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:57.333922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.07526","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-18T01:11:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M6iausA8HfvYL1qoMZAILStqiShKSsUbXkJJiQw34/qbs8zd4kp3wh9BjxVwDxqsFAX5lnTC9TiLHQLQHMEvAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:54:33.357771Z"},"content_sha256":"ba3c103ee4bc4e2bd9c170e6dd99526392f81c9a6604af6c906defa6fc3139dc","schema_version":"1.0","event_id":"sha256:ba3c103ee4bc4e2bd9c170e6dd99526392f81c9a6604af6c906defa6fc3139dc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NQMA4TNFTKC6HUSG7PYUU7JTPF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Complexity Results for a Model of Theory of Mind Based on Dynamic Epistemic Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Behaviour), Cognition, Donders Institute for Brain, ILLC), Iris van de Pol (University of Amsterdam, Iris van Rooij (Radboud University Nijmegen, Jakub Szymanik (University of Amsterdam","submitted_at":"2016-06-24T00:32:51Z","abstract_excerpt":"In this paper we introduce a computational-level model of theory of mind (ToM) based on dynamic epistemic logic (DEL), and we analyze its computational complexity. The model is a special case of DEL model checking. We provide a parameterized complexity analysis, considering several aspects of DEL (e.g., number of agents, size of preconditions, etc.) as parameters. We show that model checking for DEL is PSPACE-hard, also when restricted to single-pointed models and S5 relations, thereby solving an open problem in the literature. Our approach is aimed at formalizing current intractability claims"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07526","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-18T01:11:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UNWdS6cDpBoG+RVqdbGlfbJCxEHw53m/8KZm1sC+BenG+VwrTctv0KHbVKI+pf4Vw7GLPfUdgUwORNXmheIZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T16:54:33.358115Z"},"content_sha256":"17c89eb0b25a8a81a3b7a98884722397bed34a3339f87388caf82a7c2be2c532","schema_version":"1.0","event_id":"sha256:17c89eb0b25a8a81a3b7a98884722397bed34a3339f87388caf82a7c2be2c532"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NQMA4TNFTKC6HUSG7PYUU7JTPF/bundle.json","state_url":"https://pith.science/pith/NQMA4TNFTKC6HUSG7PYUU7JTPF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NQMA4TNFTKC6HUSG7PYUU7JTPF/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-06T16:54:33Z","links":{"resolver":"https://pith.science/pith/NQMA4TNFTKC6HUSG7PYUU7JTPF","bundle":"https://pith.science/pith/NQMA4TNFTKC6HUSG7PYUU7JTPF/bundle.json","state":"https://pith.science/pith/NQMA4TNFTKC6HUSG7PYUU7JTPF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NQMA4TNFTKC6HUSG7PYUU7JTPF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NQMA4TNFTKC6HUSG7PYUU7JTPF","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":"e9ce86d63dc5befae4f7291b17963e0839cc188e8f1694db8421bbb09ba83f1e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-24T00:32:51Z","title_canon_sha256":"dd8e365a4a0741c95094dfec270c9035b442fd7d348ccc3158dc868649861519"},"schema_version":"1.0","source":{"id":"1606.07526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.07526","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"arxiv_version","alias_value":"1606.07526v1","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07526","created_at":"2026-05-18T01:11:57Z"},{"alias_kind":"pith_short_12","alias_value":"NQMA4TNFTKC6","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NQMA4TNFTKC6HUSG","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NQMA4TNF","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:17c89eb0b25a8a81a3b7a98884722397bed34a3339f87388caf82a7c2be2c532","target":"graph","created_at":"2026-05-18T01:11:57Z","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 introduce a computational-level model of theory of mind (ToM) based on dynamic epistemic logic (DEL), and we analyze its computational complexity. The model is a special case of DEL model checking. We provide a parameterized complexity analysis, considering several aspects of DEL (e.g., number of agents, size of preconditions, etc.) as parameters. We show that model checking for DEL is PSPACE-hard, also when restricted to single-pointed models and S5 relations, thereby solving an open problem in the literature. Our approach is aimed at formalizing current intractability claims","authors_text":"Behaviour), Cognition, Donders Institute for Brain, ILLC), Iris van de Pol (University of Amsterdam, Iris van Rooij (Radboud University Nijmegen, Jakub Szymanik (University of Amsterdam","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-24T00:32:51Z","title":"Parameterized Complexity Results for a Model of Theory of Mind Based on Dynamic Epistemic Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07526","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:ba3c103ee4bc4e2bd9c170e6dd99526392f81c9a6604af6c906defa6fc3139dc","target":"record","created_at":"2026-05-18T01:11:57Z","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":"e9ce86d63dc5befae4f7291b17963e0839cc188e8f1694db8421bbb09ba83f1e","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-06-24T00:32:51Z","title_canon_sha256":"dd8e365a4a0741c95094dfec270c9035b442fd7d348ccc3158dc868649861519"},"schema_version":"1.0","source":{"id":"1606.07526","kind":"arxiv","version":1}},"canonical_sha256":"6c180e4da59a85e3d246fbf14a7d33794eb3257d12df68ed56815cbdb446cfcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c180e4da59a85e3d246fbf14a7d33794eb3257d12df68ed56815cbdb446cfcf","first_computed_at":"2026-05-18T01:11:57.333922Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:57.333922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tVGafvOMdd/f4JaM8uaoIhbyYv10xuiaaRl6hjXkcp6bVNtNM8hwhC8BM0dm59yNcX79EghJ+Lmv8t8FsPnCDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:57.334258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.07526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba3c103ee4bc4e2bd9c170e6dd99526392f81c9a6604af6c906defa6fc3139dc","sha256:17c89eb0b25a8a81a3b7a98884722397bed34a3339f87388caf82a7c2be2c532"],"state_sha256":"0a96de3c4a025a978372e4d6163762fa371c1272716e2252a0f18dcb0480f4fe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3wESaEcMVCFstU1O+AC/LN8HMmqr29ptGyw5FRG21yiDhmD0KJxbU+60/jDKP6kZTmainiwzomWJxugHRXsMCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T16:54:33.359957Z","bundle_sha256":"49485383a42dbcf35f822cb0cb8108523100ab39badf476ca97df6738818ed00"}}