{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:6R7BM4UKWCCXBCIMSZX6OLFLT7","short_pith_number":"pith:6R7BM4UK","schema_version":"1.0","canonical_sha256":"f47e16728ab08570890c966fe72cab9fdf77cb282c83db11d0d4ab8635642b45","source":{"kind":"arxiv","id":"0706.4044","version":1},"attestation_state":"computed","paper":{"title":"PSPACE Bounds for Rank-1 Modal Logics","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Dirk Pattinson, Lutz Schr\\\"oder","submitted_at":"2007-06-27T15:15:57Z","abstract_excerpt":"For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal logics. Our main result is that all rank-1 logics enjoy a shallow model property and thus are, under mild assumptions on the format of their axiomatisation, in PSPACE. This leads to a unified derivation of tight PSPACE-bounds for a number of logics including K, KD, coalition logic, graded modal logic, majority logic, and probabilistic modal logic. Our generi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"0706.4044","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2007-06-27T15:15:57Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"13339fd05f4d0e09490a00cff59f42eb52c1810ba18c51d4de1e0222efc82c59","abstract_canon_sha256":"e791cf62b5e272a17c46a265e3503ec64dd7e8ab31c86c7af0fe7257a83d6b52"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:31.514838Z","signature_b64":"tkQAL2Xcd5kRsEHWDxXsGwWvAwZb3LOrjRWr/lA3dBiQXQfFRrxDc2g7DErkAD6HDsqmpGaOvDlJyM5uz3NlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f47e16728ab08570890c966fe72cab9fdf77cb282c83db11d0d4ab8635642b45","last_reissued_at":"2026-05-18T04:31:31.514386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:31.514386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PSPACE Bounds for Rank-1 Modal Logics","license":"","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Dirk Pattinson, Lutz Schr\\\"oder","submitted_at":"2007-06-27T15:15:57Z","abstract_excerpt":"For lack of general algorithmic methods that apply to wide classes of logics, establishing a complexity bound for a given modal logic is often a laborious task. The present work is a step towards a general theory of the complexity of modal logics. Our main result is that all rank-1 logics enjoy a shallow model property and thus are, under mild assumptions on the format of their axiomatisation, in PSPACE. This leads to a unified derivation of tight PSPACE-bounds for a number of logics including K, KD, coalition logic, graded modal logic, majority logic, and probabilistic modal logic. Our generi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0706.4044","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0706.4044","created_at":"2026-05-18T04:31:31.514450+00:00"},{"alias_kind":"arxiv_version","alias_value":"0706.4044v1","created_at":"2026-05-18T04:31:31.514450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0706.4044","created_at":"2026-05-18T04:31:31.514450+00:00"},{"alias_kind":"pith_short_12","alias_value":"6R7BM4UKWCCX","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6R7BM4UKWCCXBCIM","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6R7BM4UK","created_at":"2026-05-18T12:25:55.427421+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6R7BM4UKWCCXBCIMSZX6OLFLT7","json":"https://pith.science/pith/6R7BM4UKWCCXBCIMSZX6OLFLT7.json","graph_json":"https://pith.science/api/pith-number/6R7BM4UKWCCXBCIMSZX6OLFLT7/graph.json","events_json":"https://pith.science/api/pith-number/6R7BM4UKWCCXBCIMSZX6OLFLT7/events.json","paper":"https://pith.science/paper/6R7BM4UK"},"agent_actions":{"view_html":"https://pith.science/pith/6R7BM4UKWCCXBCIMSZX6OLFLT7","download_json":"https://pith.science/pith/6R7BM4UKWCCXBCIMSZX6OLFLT7.json","view_paper":"https://pith.science/paper/6R7BM4UK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0706.4044&json=true","fetch_graph":"https://pith.science/api/pith-number/6R7BM4UKWCCXBCIMSZX6OLFLT7/graph.json","fetch_events":"https://pith.science/api/pith-number/6R7BM4UKWCCXBCIMSZX6OLFLT7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6R7BM4UKWCCXBCIMSZX6OLFLT7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6R7BM4UKWCCXBCIMSZX6OLFLT7/action/storage_attestation","attest_author":"https://pith.science/pith/6R7BM4UKWCCXBCIMSZX6OLFLT7/action/author_attestation","sign_citation":"https://pith.science/pith/6R7BM4UKWCCXBCIMSZX6OLFLT7/action/citation_signature","submit_replication":"https://pith.science/pith/6R7BM4UKWCCXBCIMSZX6OLFLT7/action/replication_record"}},"created_at":"2026-05-18T04:31:31.514450+00:00","updated_at":"2026-05-18T04:31:31.514450+00:00"}