{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IHEUSRKFJ5WCVRTXXQ2ABUIGMX","short_pith_number":"pith:IHEUSRKF","schema_version":"1.0","canonical_sha256":"41c94945454f6c2ac677bc3400d10665e1f5cf1b9632452d03112b4393160eed","source":{"kind":"arxiv","id":"1812.06341","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.06341","created_at":"2026-05-17T23:58:10.520793+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.06341v1","created_at":"2026-05-17T23:58:10.520793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.06341","created_at":"2026-05-17T23:58:10.520793+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHEUSRKFJ5WC","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHEUSRKFJ5WCVRTX","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHEUSRKF","created_at":"2026-05-18T12:32:28.185984+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/IHEUSRKFJ5WCVRTXXQ2ABUIGMX","json":"https://pith.science/pith/IHEUSRKFJ5WCVRTXXQ2ABUIGMX.json","graph_json":"https://pith.science/api/pith-number/IHEUSRKFJ5WCVRTXXQ2ABUIGMX/graph.json","events_json":"https://pith.science/api/pith-number/IHEUSRKFJ5WCVRTXXQ2ABUIGMX/events.json","paper":"https://pith.science/paper/IHEUSRKF"},"agent_actions":{"view_html":"https://pith.science/pith/IHEUSRKFJ5WCVRTXXQ2ABUIGMX","download_json":"https://pith.science/pith/IHEUSRKFJ5WCVRTXXQ2ABUIGMX.json","view_paper":"https://pith.science/paper/IHEUSRKF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.06341&json=true","fetch_graph":"https://pith.science/api/pith-number/IHEUSRKFJ5WCVRTXXQ2ABUIGMX/graph.json","fetch_events":"https://pith.science/api/pith-number/IHEUSRKFJ5WCVRTXXQ2ABUIGMX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHEUSRKFJ5WCVRTXXQ2ABUIGMX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHEUSRKFJ5WCVRTXXQ2ABUIGMX/action/storage_attestation","attest_author":"https://pith.science/pith/IHEUSRKFJ5WCVRTXXQ2ABUIGMX/action/author_attestation","sign_citation":"https://pith.science/pith/IHEUSRKFJ5WCVRTXXQ2ABUIGMX/action/citation_signature","submit_replication":"https://pith.science/pith/IHEUSRKFJ5WCVRTXXQ2ABUIGMX/action/replication_record"}},"created_at":"2026-05-17T23:58:10.520793+00:00","updated_at":"2026-05-17T23:58:10.520793+00:00"}