{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IHEUSRKFJ5WCVRTXXQ2ABUIGMX","short_pith_number":"pith:IHEUSRKF","canonical_record":{"source":{"id":"1812.06341","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-12-15T19:37:14Z","cross_cats_sorted":[],"title_canon_sha256":"04aff0b982101373186a6d229696dbc0c8699c7e4fe533f8a9dfae79f157e0e6","abstract_canon_sha256":"4460a4bee1e8f0238777fe5d794188e7d235c313dea288ced9155e8f3e7d7033"},"schema_version":"1.0"},"canonical_sha256":"41c94945454f6c2ac677bc3400d10665e1f5cf1b9632452d03112b4393160eed","source":{"kind":"arxiv","id":"1812.06341","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06341","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06341v1","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06341","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"IHEUSRKFJ5WC","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IHEUSRKFJ5WCVRTX","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IHEUSRKF","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IHEUSRKFJ5WCVRTXXQ2ABUIGMX","target":"record","payload":{"canonical_record":{"source":{"id":"1812.06341","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-12-15T19:37:14Z","cross_cats_sorted":[],"title_canon_sha256":"04aff0b982101373186a6d229696dbc0c8699c7e4fe533f8a9dfae79f157e0e6","abstract_canon_sha256":"4460a4bee1e8f0238777fe5d794188e7d235c313dea288ced9155e8f3e7d7033"},"schema_version":"1.0"},"canonical_sha256":"41c94945454f6c2ac677bc3400d10665e1f5cf1b9632452d03112b4393160eed","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:10.521231Z","signature_b64":"JPmqmxh5KOlIXjtp4t74Q4/5658IyMbRV4bZhU5kxDBCp4bOE4E17T85yWmkFtTv/lx2yD+bSW5QCJ3B7SuMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41c94945454f6c2ac677bc3400d10665e1f5cf1b9632452d03112b4393160eed","last_reissued_at":"2026-05-17T23:58:10.520709Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:10.520709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.06341","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-17T23:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7QNUc2P+ZAZ/iBI4bDMdqhdt57CrbSePNoA4swSPg0gQFpY7oUFSEJ1dMyk2O2VsluzSM9IGuffgt8L5/KOCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:06:54.974731Z"},"content_sha256":"970582992fe21b235b265c7e5a0460303455f81de9c1bb430a3987f884500a00","schema_version":"1.0","event_id":"sha256:970582992fe21b235b265c7e5a0460303455f81de9c1bb430a3987f884500a00"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IHEUSRKFJ5WCVRTXXQ2ABUIGMX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decidable fragments of first-order modal logics with counting quantifiers over varying domains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Christopher Hampson","submitted_at":"2018-12-15T19:37:14Z","abstract_excerpt":"This paper explores the computational complexity of various natural one-variable fragments of first-order modal logics with the addition of counting quantifiers, over both constant and varying domains. The addition of counting quantifiers provides us a rich language with which to succinctly express statements about the quantity of objects satisfying a given first-order property, using a single variable.\n  Optimal NExpTime upper-bounds are provided for the satisfiability problems of the one-variable fragment of the minimal first-order modal logic QK, over both constant and expanding/decreasing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06341","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-17T23:58:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+soeehgP3A+yvigZYpDKvkWwgqVJ6KHLlFI70dSZv3CAertP27nXHLj7+va/ALHNCyf71UrknBzbXVh4woljCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T01:06:54.975075Z"},"content_sha256":"3145f43c6fb872f5c16a12fed3cbe6b25a93324d5ad5276651c2e580f4bc873b","schema_version":"1.0","event_id":"sha256:3145f43c6fb872f5c16a12fed3cbe6b25a93324d5ad5276651c2e580f4bc873b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHEUSRKFJ5WCVRTXXQ2ABUIGMX/bundle.json","state_url":"https://pith.science/pith/IHEUSRKFJ5WCVRTXXQ2ABUIGMX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHEUSRKFJ5WCVRTXXQ2ABUIGMX/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-02T01:06:54Z","links":{"resolver":"https://pith.science/pith/IHEUSRKFJ5WCVRTXXQ2ABUIGMX","bundle":"https://pith.science/pith/IHEUSRKFJ5WCVRTXXQ2ABUIGMX/bundle.json","state":"https://pith.science/pith/IHEUSRKFJ5WCVRTXXQ2ABUIGMX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHEUSRKFJ5WCVRTXXQ2ABUIGMX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IHEUSRKFJ5WCVRTXXQ2ABUIGMX","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":"4460a4bee1e8f0238777fe5d794188e7d235c313dea288ced9155e8f3e7d7033","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-12-15T19:37:14Z","title_canon_sha256":"04aff0b982101373186a6d229696dbc0c8699c7e4fe533f8a9dfae79f157e0e6"},"schema_version":"1.0","source":{"id":"1812.06341","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.06341","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"arxiv_version","alias_value":"1812.06341v1","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06341","created_at":"2026-05-17T23:58:10Z"},{"alias_kind":"pith_short_12","alias_value":"IHEUSRKFJ5WC","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"IHEUSRKFJ5WCVRTX","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"IHEUSRKF","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:3145f43c6fb872f5c16a12fed3cbe6b25a93324d5ad5276651c2e580f4bc873b","target":"graph","created_at":"2026-05-17T23:58:10Z","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":"This paper explores the computational complexity of various natural one-variable fragments of first-order modal logics with the addition of counting quantifiers, over both constant and varying domains. The addition of counting quantifiers provides us a rich language with which to succinctly express statements about the quantity of objects satisfying a given first-order property, using a single variable.\n  Optimal NExpTime upper-bounds are provided for the satisfiability problems of the one-variable fragment of the minimal first-order modal logic QK, over both constant and expanding/decreasing ","authors_text":"Christopher Hampson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-12-15T19:37:14Z","title":"Decidable fragments of first-order modal logics with counting quantifiers over varying domains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.06341","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:970582992fe21b235b265c7e5a0460303455f81de9c1bb430a3987f884500a00","target":"record","created_at":"2026-05-17T23:58:10Z","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":"4460a4bee1e8f0238777fe5d794188e7d235c313dea288ced9155e8f3e7d7033","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-12-15T19:37:14Z","title_canon_sha256":"04aff0b982101373186a6d229696dbc0c8699c7e4fe533f8a9dfae79f157e0e6"},"schema_version":"1.0","source":{"id":"1812.06341","kind":"arxiv","version":1}},"canonical_sha256":"41c94945454f6c2ac677bc3400d10665e1f5cf1b9632452d03112b4393160eed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41c94945454f6c2ac677bc3400d10665e1f5cf1b9632452d03112b4393160eed","first_computed_at":"2026-05-17T23:58:10.520709Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:10.520709Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JPmqmxh5KOlIXjtp4t74Q4/5658IyMbRV4bZhU5kxDBCp4bOE4E17T85yWmkFtTv/lx2yD+bSW5QCJ3B7SuMDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:10.521231Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.06341","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:970582992fe21b235b265c7e5a0460303455f81de9c1bb430a3987f884500a00","sha256:3145f43c6fb872f5c16a12fed3cbe6b25a93324d5ad5276651c2e580f4bc873b"],"state_sha256":"b34b6dfc15c5e1319da94797d5733a537f34a6e2e7d1e65c2e8f699310f9dc6e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hH2SgGyR1Ao2agWLnBbJP7TQPzMupg7WFChn+pYJ1F93oUzdx/W75X1ea+BWwv2oNFnp7CEeYU3u8MBoG27lCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T01:06:54.976936Z","bundle_sha256":"2c602ada9e02983348b4802e5555f82c9d2e83cabd9fcfae8308f1f6ac379db2"}}