{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:CQQOEG7EP4MKQBWB7WXT7GGZJX","short_pith_number":"pith:CQQOEG7E","canonical_record":{"source":{"id":"0905.3108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-05-19T15:27:04Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"0f47e3fdb076043588a011bb8a8f9f789274eb86ce63003d127598333e6ade9c","abstract_canon_sha256":"cab6b56a53c38f418ad5acf2b1f630a7b8f22b87de76b5311e14db2ccd455614"},"schema_version":"1.0"},"canonical_sha256":"1420e21be47f18a806c1fdaf3f98d94dd5f7d1e898bb7b0cdf366d455193a286","source":{"kind":"arxiv","id":"0905.3108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.3108","created_at":"2026-07-05T08:10:51Z"},{"alias_kind":"arxiv_version","alias_value":"0905.3108v1","created_at":"2026-07-05T08:10:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.3108","created_at":"2026-07-05T08:10:51Z"},{"alias_kind":"pith_short_12","alias_value":"CQQOEG7EP4MK","created_at":"2026-07-05T08:10:51Z"},{"alias_kind":"pith_short_16","alias_value":"CQQOEG7EP4MKQBWB","created_at":"2026-07-05T08:10:51Z"},{"alias_kind":"pith_short_8","alias_value":"CQQOEG7E","created_at":"2026-07-05T08:10:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:CQQOEG7EP4MKQBWB7WXT7GGZJX","target":"record","payload":{"canonical_record":{"source":{"id":"0905.3108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-05-19T15:27:04Z","cross_cats_sorted":["cs.AI","cs.CC"],"title_canon_sha256":"0f47e3fdb076043588a011bb8a8f9f789274eb86ce63003d127598333e6ade9c","abstract_canon_sha256":"cab6b56a53c38f418ad5acf2b1f630a7b8f22b87de76b5311e14db2ccd455614"},"schema_version":"1.0"},"canonical_sha256":"1420e21be47f18a806c1fdaf3f98d94dd5f7d1e898bb7b0cdf366d455193a286","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:10:51.488000Z","signature_b64":"x38pKS0vPNPXEWI3gkxlKrTV+/4bbldZZTNoRhEkZ76Q5lVtpPydnno3DOOhAPhI/BUBOWmMjm0Y1Ax/zh+cCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1420e21be47f18a806c1fdaf3f98d94dd5f7d1e898bb7b0cdf366d455193a286","last_reissued_at":"2026-07-05T08:10:51.487561Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:10:51.487561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0905.3108","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-07-05T08:10:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0s2hRygtDcRBYWUzE2umyj6TLs3rPmepNBswtNwKl/I0j1D098XIG2EhfYM+uWnty/DAUN0e6VHeQD6licFjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:33:23.330998Z"},"content_sha256":"053800d9949cfa12a4d6bdddea41df98567172070e59396e7ad373466ce39d5c","schema_version":"1.0","event_id":"sha256:053800d9949cfa12a4d6bdddea41df98567172070e59396e7ad373466ce39d5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:CQQOEG7EP4MKQBWB7WXT7GGZJX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC"],"primary_cat":"cs.LO","authors_text":"Ian Pratt-Hartmann, Yevgeny Kazakov","submitted_at":"2009-05-19T15:27:04Z","abstract_excerpt":"Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive interpretations such as \"It is true at no fewer than 15 accessible worlds that...\", or \"It is true at no more than 2 accessible worlds that...\". We investigate the complexity of satisfiability for this language over some familiar classes of frames. This problem is more challenging than its ordinary modal logic counterpart--especially in the case of transiti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.3108","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0905.3108/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T08:10:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ob/UQbrrlVaJSAbL9Nw/EgpxM18I6xt8Q4uiN4GDhQcmddR+OO5ymdzHgG52BHmbZ3D3nMWUR4ukZcm+St82CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:33:23.331568Z"},"content_sha256":"725be16dd9b091c58e2dadaa0622b9e204e4975951a99cfcc9e0ae3b1a7cfe02","schema_version":"1.0","event_id":"sha256:725be16dd9b091c58e2dadaa0622b9e204e4975951a99cfcc9e0ae3b1a7cfe02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQQOEG7EP4MKQBWB7WXT7GGZJX/bundle.json","state_url":"https://pith.science/pith/CQQOEG7EP4MKQBWB7WXT7GGZJX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQQOEG7EP4MKQBWB7WXT7GGZJX/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-08-03T18:33:23Z","links":{"resolver":"https://pith.science/pith/CQQOEG7EP4MKQBWB7WXT7GGZJX","bundle":"https://pith.science/pith/CQQOEG7EP4MKQBWB7WXT7GGZJX/bundle.json","state":"https://pith.science/pith/CQQOEG7EP4MKQBWB7WXT7GGZJX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQQOEG7EP4MKQBWB7WXT7GGZJX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:CQQOEG7EP4MKQBWB7WXT7GGZJX","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":"cab6b56a53c38f418ad5acf2b1f630a7b8f22b87de76b5311e14db2ccd455614","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-05-19T15:27:04Z","title_canon_sha256":"0f47e3fdb076043588a011bb8a8f9f789274eb86ce63003d127598333e6ade9c"},"schema_version":"1.0","source":{"id":"0905.3108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.3108","created_at":"2026-07-05T08:10:51Z"},{"alias_kind":"arxiv_version","alias_value":"0905.3108v1","created_at":"2026-07-05T08:10:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.3108","created_at":"2026-07-05T08:10:51Z"},{"alias_kind":"pith_short_12","alias_value":"CQQOEG7EP4MK","created_at":"2026-07-05T08:10:51Z"},{"alias_kind":"pith_short_16","alias_value":"CQQOEG7EP4MKQBWB","created_at":"2026-07-05T08:10:51Z"},{"alias_kind":"pith_short_8","alias_value":"CQQOEG7E","created_at":"2026-07-05T08:10:51Z"}],"graph_snapshots":[{"event_id":"sha256:725be16dd9b091c58e2dadaa0622b9e204e4975951a99cfcc9e0ae3b1a7cfe02","target":"graph","created_at":"2026-07-05T08:10:51Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0905.3108/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive interpretations such as \"It is true at no fewer than 15 accessible worlds that...\", or \"It is true at no more than 2 accessible worlds that...\". We investigate the complexity of satisfiability for this language over some familiar classes of frames. This problem is more challenging than its ordinary modal logic counterpart--especially in the case of transiti","authors_text":"Ian Pratt-Hartmann, Yevgeny Kazakov","cross_cats":["cs.AI","cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-05-19T15:27:04Z","title":"A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.3108","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:053800d9949cfa12a4d6bdddea41df98567172070e59396e7ad373466ce39d5c","target":"record","created_at":"2026-07-05T08:10:51Z","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":"cab6b56a53c38f418ad5acf2b1f630a7b8f22b87de76b5311e14db2ccd455614","cross_cats_sorted":["cs.AI","cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-05-19T15:27:04Z","title_canon_sha256":"0f47e3fdb076043588a011bb8a8f9f789274eb86ce63003d127598333e6ade9c"},"schema_version":"1.0","source":{"id":"0905.3108","kind":"arxiv","version":1}},"canonical_sha256":"1420e21be47f18a806c1fdaf3f98d94dd5f7d1e898bb7b0cdf366d455193a286","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1420e21be47f18a806c1fdaf3f98d94dd5f7d1e898bb7b0cdf366d455193a286","first_computed_at":"2026-07-05T08:10:51.487561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:10:51.487561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x38pKS0vPNPXEWI3gkxlKrTV+/4bbldZZTNoRhEkZ76Q5lVtpPydnno3DOOhAPhI/BUBOWmMjm0Y1Ax/zh+cCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:10:51.488000Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.3108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:053800d9949cfa12a4d6bdddea41df98567172070e59396e7ad373466ce39d5c","sha256:725be16dd9b091c58e2dadaa0622b9e204e4975951a99cfcc9e0ae3b1a7cfe02"],"state_sha256":"d0a1196c8e2e8cf2fabcaf756da343a800dea8548038321acea34738bdea6f71"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cI7/PFVVkYY5xQfdq30Djt5BjGHNVM1CT5XMH3SQCRDCVSb+/jE2iSCO0Mx3nG5322im+djC1Bj1Kgb6ILTnCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:33:23.338040Z","bundle_sha256":"1679109f8237a646bd07ee7f3a6dd66eafc6b75b812c5ce7bbec36af9ba5e4a2"}}