{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:TGDY53XY6DIGXPIFKESVOEQRHF","short_pith_number":"pith:TGDY53XY","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"},"canonical_sha256":"99878eeef8f0d06bbd055125571211394a75a8bacc21331ab36c0faf7eacaf04","source":{"kind":"arxiv","id":"1204.1196","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1196","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1196v2","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1196","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"pith_short_12","alias_value":"TGDY53XY6DIG","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TGDY53XY6DIGXPIF","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TGDY53XY","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:TGDY53XY6DIGXPIFKESVOEQRHF","target":"record","payload":{"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"},"canonical_sha256":"99878eeef8f0d06bbd055125571211394a75a8bacc21331ab36c0faf7eacaf04","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"},"source_kind":"arxiv","source_id":"1204.1196","source_version":2,"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-18T03:53:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2IxtXCm4N9mlc4DsSUdZkPcYbjjI1mnAtAyFayBlaBWT7VBLut+CE35LlZJKXr0ujZrB36OBEIrrPYPfxu3uAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:26:13.035629Z"},"content_sha256":"cc24ac6bc58964766c1b454dfc483913c9d2264b229d290067868952206646c5","schema_version":"1.0","event_id":"sha256:cc24ac6bc58964766c1b454dfc483913c9d2264b229d290067868952206646c5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:TGDY53XY6DIGXPIFKESVOEQRHF","target":"graph","payload":{"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"},"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-18T03:53:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"plSSqxPtY40cD6WSK7LdcgNZkvTAkP14wue+/s1pTMyUsKDYIOKdlCVBGsqyggkzaT5SNvzfq753c6+OdkSCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T05:26:13.036383Z"},"content_sha256":"b6bf69d3cca9870cac53b7b776ef171e2d60286459e4797a7c60b2f7009e8b46","schema_version":"1.0","event_id":"sha256:b6bf69d3cca9870cac53b7b776ef171e2d60286459e4797a7c60b2f7009e8b46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TGDY53XY6DIGXPIFKESVOEQRHF/bundle.json","state_url":"https://pith.science/pith/TGDY53XY6DIGXPIFKESVOEQRHF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TGDY53XY6DIGXPIFKESVOEQRHF/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-10T05:26:13Z","links":{"resolver":"https://pith.science/pith/TGDY53XY6DIGXPIFKESVOEQRHF","bundle":"https://pith.science/pith/TGDY53XY6DIGXPIFKESVOEQRHF/bundle.json","state":"https://pith.science/pith/TGDY53XY6DIGXPIFKESVOEQRHF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TGDY53XY6DIGXPIFKESVOEQRHF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:TGDY53XY6DIGXPIFKESVOEQRHF","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":"7a01385344267da8eb0b3af7e7f0c18e28eebaedcf3c073aba6a6b877ce3a94e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-05T12:15:24Z","title_canon_sha256":"9653cf73e1678ba1cf5994a23ba5b77173ccd6b458f4852e7dbe6e4e13529e7a"},"schema_version":"1.0","source":{"id":"1204.1196","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.1196","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"arxiv_version","alias_value":"1204.1196v2","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.1196","created_at":"2026-05-18T03:53:44Z"},{"alias_kind":"pith_short_12","alias_value":"TGDY53XY6DIG","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"TGDY53XY6DIGXPIF","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"TGDY53XY","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:b6bf69d3cca9870cac53b7b776ef171e2d60286459e4797a7c60b2f7009e8b46","target":"graph","created_at":"2026-05-18T03:53:44Z","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":"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","authors_text":"Arne Meier, Felix Weiss, Martin Mundhenk, Michael Thomas, Stefan G\\\"oller, Thomas Schneider","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-05T12:15:24Z","title":"The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.1196","kind":"arxiv","version":2},"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:cc24ac6bc58964766c1b454dfc483913c9d2264b229d290067868952206646c5","target":"record","created_at":"2026-05-18T03:53:44Z","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":"7a01385344267da8eb0b3af7e7f0c18e28eebaedcf3c073aba6a6b877ce3a94e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-04-05T12:15:24Z","title_canon_sha256":"9653cf73e1678ba1cf5994a23ba5b77173ccd6b458f4852e7dbe6e4e13529e7a"},"schema_version":"1.0","source":{"id":"1204.1196","kind":"arxiv","version":2}},"canonical_sha256":"99878eeef8f0d06bbd055125571211394a75a8bacc21331ab36c0faf7eacaf04","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"99878eeef8f0d06bbd055125571211394a75a8bacc21331ab36c0faf7eacaf04","first_computed_at":"2026-05-18T03:53:44.757566Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:44.757566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wFg8qw0NLgmujfBvV7/+KKj9D+EyYoq2tD7Z5hw13N4AhrDWR0xT7qvfDUMkKfuP9IxwxB3DLUhJ3mP+wwRoDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:44.758089Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.1196","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc24ac6bc58964766c1b454dfc483913c9d2264b229d290067868952206646c5","sha256:b6bf69d3cca9870cac53b7b776ef171e2d60286459e4797a7c60b2f7009e8b46"],"state_sha256":"e4f15bbf6ad324d485467d51c72b4819ba5f46089772f6874e984edb9e996f85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"to7IZF6issMW4XaIb0g0TIFqV5jRosURO2MZhIbtGpIGgkmTtdhleG5CW43OfSr3z0KaNfhiZTiIoqkXZQ4/CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T05:26:13.040851Z","bundle_sha256":"1b9cfa387eb9a14a671269e1247632e170cfe6616f83b9a7bccce0b7af07d9e9"}}