{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7RHBJJW3HSJ4DHDEAXFIRGK5SG","short_pith_number":"pith:7RHBJJW3","canonical_record":{"source":{"id":"1105.0845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-05-04T15:01:33Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a593c84668fcc0eb73733a266f8eee3c206a40347748b0ee32a08137ee469b60","abstract_canon_sha256":"49158d36dab1ead10f3e15f4c68fea27be5a3ee05d7cedb2189c5fa788e4121f"},"schema_version":"1.0"},"canonical_sha256":"fc4e14a6db3c93c19c6405ca88995d9197f61e791c717503583eecf677544b5d","source":{"kind":"arxiv","id":"1105.0845","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0845","created_at":"2026-05-18T04:23:01Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0845v1","created_at":"2026-05-18T04:23:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0845","created_at":"2026-05-18T04:23:01Z"},{"alias_kind":"pith_short_12","alias_value":"7RHBJJW3HSJ4","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7RHBJJW3HSJ4DHDE","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7RHBJJW3","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7RHBJJW3HSJ4DHDEAXFIRGK5SG","target":"record","payload":{"canonical_record":{"source":{"id":"1105.0845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-05-04T15:01:33Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a593c84668fcc0eb73733a266f8eee3c206a40347748b0ee32a08137ee469b60","abstract_canon_sha256":"49158d36dab1ead10f3e15f4c68fea27be5a3ee05d7cedb2189c5fa788e4121f"},"schema_version":"1.0"},"canonical_sha256":"fc4e14a6db3c93c19c6405ca88995d9197f61e791c717503583eecf677544b5d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:01.694598Z","signature_b64":"HsGx6L0qIAZXpIBAEUK+4RYYyQ3UJfJEmHtoq5r937AqoEs075JUrj8xH4MTP3/6A23v6axc3yEIsSB3Ik6BDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc4e14a6db3c93c19c6405ca88995d9197f61e791c717503583eecf677544b5d","last_reissued_at":"2026-05-18T04:23:01.693815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:01.693815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.0845","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-18T04:23:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZdswyLR0GclJ4zNMqRTjrpPy9t54yAl+TVUW9ye1J4ujah3nn0B5dGUWDZLsOkUWQxeXCTBvZa+psAWESeYdCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:07:54.305332Z"},"content_sha256":"6c29fc320c8298ebf42735e7396f34b1866b3998c6168877e42c70826b5ad7a3","schema_version":"1.0","event_id":"sha256:6c29fc320c8298ebf42735e7396f34b1866b3998c6168877e42c70826b5ad7a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7RHBJJW3HSJ4DHDEAXFIRGK5SG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simplest Undecidable Modal Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Edith Hemaspaandra, Henning Schnoor","submitted_at":"2011-05-04T15:01:33Z","abstract_excerpt":"Modal logics are widely used in computer science. The complexity of their satisfiability problems has been an active field of research since the 1970s. We prove that even very \"simple\" modal logics can be undecidable: We show that there is an undecidable modal logic that can be obtained by restricting the allowed models with a first-order formula in which only universal quantifiers appear."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0845","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-18T04:23:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UGhQvPa/DDKIVZ2znfI5Pe8J1iOogb9R/EejmG7GK59fI5WHuKa86tlSWLi8t4D9npIB/Tb3Pt06IaNaUzCkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:07:54.306013Z"},"content_sha256":"bd3cfb75faef021cf56922f205124cea2ea03eae20ae6acf1e18f39e2c353ace","schema_version":"1.0","event_id":"sha256:bd3cfb75faef021cf56922f205124cea2ea03eae20ae6acf1e18f39e2c353ace"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7RHBJJW3HSJ4DHDEAXFIRGK5SG/bundle.json","state_url":"https://pith.science/pith/7RHBJJW3HSJ4DHDEAXFIRGK5SG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7RHBJJW3HSJ4DHDEAXFIRGK5SG/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-05-27T03:07:54Z","links":{"resolver":"https://pith.science/pith/7RHBJJW3HSJ4DHDEAXFIRGK5SG","bundle":"https://pith.science/pith/7RHBJJW3HSJ4DHDEAXFIRGK5SG/bundle.json","state":"https://pith.science/pith/7RHBJJW3HSJ4DHDEAXFIRGK5SG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7RHBJJW3HSJ4DHDEAXFIRGK5SG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7RHBJJW3HSJ4DHDEAXFIRGK5SG","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":"49158d36dab1ead10f3e15f4c68fea27be5a3ee05d7cedb2189c5fa788e4121f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-05-04T15:01:33Z","title_canon_sha256":"a593c84668fcc0eb73733a266f8eee3c206a40347748b0ee32a08137ee469b60"},"schema_version":"1.0","source":{"id":"1105.0845","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.0845","created_at":"2026-05-18T04:23:01Z"},{"alias_kind":"arxiv_version","alias_value":"1105.0845v1","created_at":"2026-05-18T04:23:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.0845","created_at":"2026-05-18T04:23:01Z"},{"alias_kind":"pith_short_12","alias_value":"7RHBJJW3HSJ4","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7RHBJJW3HSJ4DHDE","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7RHBJJW3","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:bd3cfb75faef021cf56922f205124cea2ea03eae20ae6acf1e18f39e2c353ace","target":"graph","created_at":"2026-05-18T04:23:01Z","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":"Modal logics are widely used in computer science. The complexity of their satisfiability problems has been an active field of research since the 1970s. We prove that even very \"simple\" modal logics can be undecidable: We show that there is an undecidable modal logic that can be obtained by restricting the allowed models with a first-order formula in which only universal quantifiers appear.","authors_text":"Edith Hemaspaandra, Henning Schnoor","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-05-04T15:01:33Z","title":"A Simplest Undecidable Modal Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.0845","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:6c29fc320c8298ebf42735e7396f34b1866b3998c6168877e42c70826b5ad7a3","target":"record","created_at":"2026-05-18T04:23:01Z","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":"49158d36dab1ead10f3e15f4c68fea27be5a3ee05d7cedb2189c5fa788e4121f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-05-04T15:01:33Z","title_canon_sha256":"a593c84668fcc0eb73733a266f8eee3c206a40347748b0ee32a08137ee469b60"},"schema_version":"1.0","source":{"id":"1105.0845","kind":"arxiv","version":1}},"canonical_sha256":"fc4e14a6db3c93c19c6405ca88995d9197f61e791c717503583eecf677544b5d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc4e14a6db3c93c19c6405ca88995d9197f61e791c717503583eecf677544b5d","first_computed_at":"2026-05-18T04:23:01.693815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:01.693815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HsGx6L0qIAZXpIBAEUK+4RYYyQ3UJfJEmHtoq5r937AqoEs075JUrj8xH4MTP3/6A23v6axc3yEIsSB3Ik6BDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:01.694598Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.0845","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c29fc320c8298ebf42735e7396f34b1866b3998c6168877e42c70826b5ad7a3","sha256:bd3cfb75faef021cf56922f205124cea2ea03eae20ae6acf1e18f39e2c353ace"],"state_sha256":"ee1959354b28d2bc3c71ef84f236a4db19c4a6cb8ece9da5129812a5875b7997"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"txo+IHNXUirFgyawwd8DPllWOnCJxeeH5yVeJk3ccIeW+dZQus6wjlyEKJnGhYcW9Clb6NeLMH1QdpsXDXGcCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:07:54.309700Z","bundle_sha256":"ba296412d40b740661e372ecbde7c7e84a309b7b223b8af7da01305062bfc13f"}}