{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TGDY53XY6DIGXPIFKESVOEQRHF","short_pith_number":"pith:TGDY53XY","schema_version":"1.0","canonical_sha256":"99878eeef8f0d06bbd055125571211394a75a8bacc21331ab36c0faf7eacaf04","source":{"kind":"arxiv","id":"1204.1196","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Arne Meier, Felix Weiss, Martin Mundhenk, Michael Thomas, Stefan G\\\"oller, Thomas Schneider","submitted_at":"2012-04-05T12:15:24Z","abstract_excerpt":"Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of non-elementary complexity. In this paper, we consider monotone hybrid logics (i.e., the Boolean connectives are conjunction and disjunction only) over N and general linear orders. We show that the satisfiability problem remains non-elementary over linear orders, but its complexity drops to PSPACE-completeness over N. We categorize the strict fragments arising from dif"},"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":"1204.1196","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-05T12:15:24Z","cross_cats_sorted":[],"title_canon_sha256":"9653cf73e1678ba1cf5994a23ba5b77173ccd6b458f4852e7dbe6e4e13529e7a","abstract_canon_sha256":"7a01385344267da8eb0b3af7e7f0c18e28eebaedcf3c073aba6a6b877ce3a94e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:44.758089Z","signature_b64":"wFg8qw0NLgmujfBvV7/+KKj9D+EyYoq2tD7Z5hw13N4AhrDWR0xT7qvfDUMkKfuP9IxwxB3DLUhJ3mP+wwRoDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"99878eeef8f0d06bbd055125571211394a75a8bacc21331ab36c0faf7eacaf04","last_reissued_at":"2026-05-18T03:53:44.757566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:44.757566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Arne Meier, Felix Weiss, Martin Mundhenk, Michael Thomas, Stefan G\\\"oller, Thomas Schneider","submitted_at":"2012-04-05T12:15:24Z","abstract_excerpt":"Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of non-elementary complexity. In this paper, we consider monotone hybrid logics (i.e., the Boolean connectives are conjunction and disjunction only) over N and general linear orders. We show that the satisfiability problem remains non-elementary over linear orders, but its complexity drops to PSPACE-completeness over N. We categorize the strict fragments arising from dif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1196","kind":"arxiv","version":2},"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":"1204.1196","created_at":"2026-05-18T03:53:44.757650+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.1196v2","created_at":"2026-05-18T03:53:44.757650+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1196","created_at":"2026-05-18T03:53:44.757650+00:00"},{"alias_kind":"pith_short_12","alias_value":"TGDY53XY6DIG","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TGDY53XY6DIGXPIF","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TGDY53XY","created_at":"2026-05-18T12:27:23.164592+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/TGDY53XY6DIGXPIFKESVOEQRHF","json":"https://pith.science/pith/TGDY53XY6DIGXPIFKESVOEQRHF.json","graph_json":"https://pith.science/api/pith-number/TGDY53XY6DIGXPIFKESVOEQRHF/graph.json","events_json":"https://pith.science/api/pith-number/TGDY53XY6DIGXPIFKESVOEQRHF/events.json","paper":"https://pith.science/paper/TGDY53XY"},"agent_actions":{"view_html":"https://pith.science/pith/TGDY53XY6DIGXPIFKESVOEQRHF","download_json":"https://pith.science/pith/TGDY53XY6DIGXPIFKESVOEQRHF.json","view_paper":"https://pith.science/paper/TGDY53XY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.1196&json=true","fetch_graph":"https://pith.science/api/pith-number/TGDY53XY6DIGXPIFKESVOEQRHF/graph.json","fetch_events":"https://pith.science/api/pith-number/TGDY53XY6DIGXPIFKESVOEQRHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TGDY53XY6DIGXPIFKESVOEQRHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TGDY53XY6DIGXPIFKESVOEQRHF/action/storage_attestation","attest_author":"https://pith.science/pith/TGDY53XY6DIGXPIFKESVOEQRHF/action/author_attestation","sign_citation":"https://pith.science/pith/TGDY53XY6DIGXPIFKESVOEQRHF/action/citation_signature","submit_replication":"https://pith.science/pith/TGDY53XY6DIGXPIFKESVOEQRHF/action/replication_record"}},"created_at":"2026-05-18T03:53:44.757650+00:00","updated_at":"2026-05-18T03:53:44.757650+00:00"}