{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:ARI4JUWPH6UTQANCHHHHNMSHHY","short_pith_number":"pith:ARI4JUWP","canonical_record":{"source":{"id":"0906.1489","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-06-08T13:17:35Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"45a5bbde49b33608ea0622fadff40e61a3e695af8c804a90916798905dd7ea88","abstract_canon_sha256":"4e4107e7ae5c270d87428137c4cdb592e150eb4aef38af46c08bf717988cb320"},"schema_version":"1.0"},"canonical_sha256":"0451c4d2cf3fa93801a239ce76b2473e22f6ac0017cf47b8f59f54ceacd388f8","source":{"kind":"arxiv","id":"0906.1489","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.1489","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"arxiv_version","alias_value":"0906.1489v1","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.1489","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"pith_short_12","alias_value":"ARI4JUWPH6UT","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"ARI4JUWPH6UTQANC","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"ARI4JUWP","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:ARI4JUWPH6UTQANCHHHHNMSHHY","target":"record","payload":{"canonical_record":{"source":{"id":"0906.1489","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-06-08T13:17:35Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"45a5bbde49b33608ea0622fadff40e61a3e695af8c804a90916798905dd7ea88","abstract_canon_sha256":"4e4107e7ae5c270d87428137c4cdb592e150eb4aef38af46c08bf717988cb320"},"schema_version":"1.0"},"canonical_sha256":"0451c4d2cf3fa93801a239ce76b2473e22f6ac0017cf47b8f59f54ceacd388f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:55.512846Z","signature_b64":"/QkU7iPl9/cZaJrDUa8wvaco40CaoK62caSXL29evP2qLaTmYua0ItWG8NpQfwtiCZIPex04ohrAnA8PSHd8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0451c4d2cf3fa93801a239ce76b2473e22f6ac0017cf47b8f59f54ceacd388f8","last_reissued_at":"2026-05-18T02:24:55.512071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:55.512071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0906.1489","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-18T02:24:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AhDpXtO5GZ5SSCsgjkafUOz1o2LupItfBvmkzqdiMpBBpWuvGlVXBq63hqsfSbcvvsr6XbbyqyGgN/JZOpMGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T00:56:13.164763Z"},"content_sha256":"8ce1a6c7b64efce6fa53fdb81595f9a8b36b0bd35739e3b56b33d23778daf7e2","schema_version":"1.0","event_id":"sha256:8ce1a6c7b64efce6fa53fdb81595f9a8b36b0bd35739e3b56b33d23778daf7e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:ARI4JUWPH6UTQANCHHHHNMSHHY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Arne Meier, Felix Weiss, Martin Mundhenk, Michael Thomas, Thomas Schneider, Volker Weber","submitted_at":"2009-06-08T13:17:35Z","abstract_excerpt":"The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this paper, we investigate the effect of restricting the propositional part of the language on decidability and on the complexity of the satisfiability problem over arbitrary, transitive, total frames, and frames based on equivalence relations. We also consider different sets of modal and hybrid operators. We trace the border of decidability and give the precise complexity of most fragments, in particular for all fragments "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.1489","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-18T02:24:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z9HazwgB9ry/sQl4rd3GI9j7N4i1OV6FXXCJLo/YtT+RTsgzaWNobA9dMb1yKLWZVn9UA2IcHh/HUNN+IaITDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T00:56:13.165108Z"},"content_sha256":"6b306d630dd6ce209f1d1ac437e9dcdfdfe59f483c496b18f27b4f5d49c199ed","schema_version":"1.0","event_id":"sha256:6b306d630dd6ce209f1d1ac437e9dcdfdfe59f483c496b18f27b4f5d49c199ed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ARI4JUWPH6UTQANCHHHHNMSHHY/bundle.json","state_url":"https://pith.science/pith/ARI4JUWPH6UTQANCHHHHNMSHHY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ARI4JUWPH6UTQANCHHHHNMSHHY/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-28T00:56:13Z","links":{"resolver":"https://pith.science/pith/ARI4JUWPH6UTQANCHHHHNMSHHY","bundle":"https://pith.science/pith/ARI4JUWPH6UTQANCHHHHNMSHHY/bundle.json","state":"https://pith.science/pith/ARI4JUWPH6UTQANCHHHHNMSHHY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ARI4JUWPH6UTQANCHHHHNMSHHY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:ARI4JUWPH6UTQANCHHHHNMSHHY","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":"4e4107e7ae5c270d87428137c4cdb592e150eb4aef38af46c08bf717988cb320","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-06-08T13:17:35Z","title_canon_sha256":"45a5bbde49b33608ea0622fadff40e61a3e695af8c804a90916798905dd7ea88"},"schema_version":"1.0","source":{"id":"0906.1489","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.1489","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"arxiv_version","alias_value":"0906.1489v1","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.1489","created_at":"2026-05-18T02:24:55Z"},{"alias_kind":"pith_short_12","alias_value":"ARI4JUWPH6UT","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"ARI4JUWPH6UTQANC","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"ARI4JUWP","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:6b306d630dd6ce209f1d1ac437e9dcdfdfe59f483c496b18f27b4f5d49c199ed","target":"graph","created_at":"2026-05-18T02:24:55Z","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":"The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this paper, we investigate the effect of restricting the propositional part of the language on decidability and on the complexity of the satisfiability problem over arbitrary, transitive, total frames, and frames based on equivalence relations. We also consider different sets of modal and hybrid operators. We trace the border of decidability and give the precise complexity of most fragments, in particular for all fragments ","authors_text":"Arne Meier, Felix Weiss, Martin Mundhenk, Michael Thomas, Thomas Schneider, Volker Weber","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-06-08T13:17:35Z","title":"The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.1489","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:8ce1a6c7b64efce6fa53fdb81595f9a8b36b0bd35739e3b56b33d23778daf7e2","target":"record","created_at":"2026-05-18T02:24:55Z","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":"4e4107e7ae5c270d87428137c4cdb592e150eb4aef38af46c08bf717988cb320","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-06-08T13:17:35Z","title_canon_sha256":"45a5bbde49b33608ea0622fadff40e61a3e695af8c804a90916798905dd7ea88"},"schema_version":"1.0","source":{"id":"0906.1489","kind":"arxiv","version":1}},"canonical_sha256":"0451c4d2cf3fa93801a239ce76b2473e22f6ac0017cf47b8f59f54ceacd388f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0451c4d2cf3fa93801a239ce76b2473e22f6ac0017cf47b8f59f54ceacd388f8","first_computed_at":"2026-05-18T02:24:55.512071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:24:55.512071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/QkU7iPl9/cZaJrDUa8wvaco40CaoK62caSXL29evP2qLaTmYua0ItWG8NpQfwtiCZIPex04ohrAnA8PSHd8Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:24:55.512846Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.1489","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ce1a6c7b64efce6fa53fdb81595f9a8b36b0bd35739e3b56b33d23778daf7e2","sha256:6b306d630dd6ce209f1d1ac437e9dcdfdfe59f483c496b18f27b4f5d49c199ed"],"state_sha256":"2e2e0e392122569a3fea547dfbc4809e6072862b0fc8a17ddc1d2777d0f162f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r1Ojll/13aMo4574fzOTHB6cGhrTO+N4KbQtNO6pp26l5TI5YROhX1gOBhVzncJGafxKnTjjf6RHmuLCwWqrAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T00:56:13.166997Z","bundle_sha256":"d22408baa56270cab420a74e078f5ab7d5d81ebbe658a29ca2c7bfc3c30435e0"}}