{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GKJEQ5NXLHHKR72A3OAJSFD67T","short_pith_number":"pith:GKJEQ5NX","canonical_record":{"source":{"id":"1504.06105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-23T09:37:06Z","cross_cats_sorted":[],"title_canon_sha256":"0d3866149e9922b793366a45dbd5cb205caa40773d23c41030aadff728246c49","abstract_canon_sha256":"932c0c06939a80a99f126daa0af8a1f395baa98db68c0d3f568a22f89775140a"},"schema_version":"1.0"},"canonical_sha256":"32924875b759cea8ff40db8099147efcdeece54b6ebf7411fe84a11e98b2f6e2","source":{"kind":"arxiv","id":"1504.06105","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06105","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06105v1","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06105","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"pith_short_12","alias_value":"GKJEQ5NXLHHK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GKJEQ5NXLHHKR72A","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GKJEQ5NX","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GKJEQ5NXLHHKR72A3OAJSFD67T","target":"record","payload":{"canonical_record":{"source":{"id":"1504.06105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-23T09:37:06Z","cross_cats_sorted":[],"title_canon_sha256":"0d3866149e9922b793366a45dbd5cb205caa40773d23c41030aadff728246c49","abstract_canon_sha256":"932c0c06939a80a99f126daa0af8a1f395baa98db68c0d3f568a22f89775140a"},"schema_version":"1.0"},"canonical_sha256":"32924875b759cea8ff40db8099147efcdeece54b6ebf7411fe84a11e98b2f6e2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:02.576208Z","signature_b64":"A/YDho5O6mLZlNE2yAdxetQvwzsfgRDLTEMnAOS+4sn5AAsZ0SRENmuiT7rY0RtloLIDlirwAaKedoyU9GOeBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32924875b759cea8ff40db8099147efcdeece54b6ebf7411fe84a11e98b2f6e2","last_reissued_at":"2026-05-18T02:18:02.575537Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:02.575537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.06105","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:18:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ocBYpxxMA/JlYgmaML7ilPeib9Nam8fSm+4U9nOcHTDEb4G6Q7Dqb461pCYaruvyZqiNvfza5NIV1KEatevXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:26:26.172270Z"},"content_sha256":"cd02ee2bea872f2275c6f1f0bbd80c3ec4a71073d30161ae66ec934ec7d2ebda","schema_version":"1.0","event_id":"sha256:cd02ee2bea872f2275c6f1f0bbd80c3ec4a71073d30161ae66ec934ec7d2ebda"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GKJEQ5NXLHHKR72A3OAJSFD67T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Model Checking Constraint LTL over Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Alexander Kartzow, Thomas Weidner","submitted_at":"2015-04-23T09:37:06Z","abstract_excerpt":"Constraint automata are an adaptation of B\\\"uchi-automata that process data words where the data comes from some relational structure S. Every transition of such an automaton comes with constraints in terms of the relations of S. A transition can only be fired if the current and the next data values satisfy all constraints of this transition. These automata have been used in the setting where S is a linear order for deciding constraint LTL with constraints over S. In this paper, S is the infinitely branching infinite order tree T. We provide a PSPACE algorithm for emptiness of T-constraint aut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06105","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:18:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x7+oZe5Wiq8EggOTBJMbNb7RLRJ32Qs5+lJfJkWdwvQk3Tr/4ig/zwyCilvun/SFIrwoRzcMWJ5fQAOyW5eNBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T12:26:26.172617Z"},"content_sha256":"4ae34150c5b36c23094a917f3ac5f65f87185b10e13f6d25fb505d309741094d","schema_version":"1.0","event_id":"sha256:4ae34150c5b36c23094a917f3ac5f65f87185b10e13f6d25fb505d309741094d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GKJEQ5NXLHHKR72A3OAJSFD67T/bundle.json","state_url":"https://pith.science/pith/GKJEQ5NXLHHKR72A3OAJSFD67T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GKJEQ5NXLHHKR72A3OAJSFD67T/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-28T12:26:26Z","links":{"resolver":"https://pith.science/pith/GKJEQ5NXLHHKR72A3OAJSFD67T","bundle":"https://pith.science/pith/GKJEQ5NXLHHKR72A3OAJSFD67T/bundle.json","state":"https://pith.science/pith/GKJEQ5NXLHHKR72A3OAJSFD67T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GKJEQ5NXLHHKR72A3OAJSFD67T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GKJEQ5NXLHHKR72A3OAJSFD67T","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":"932c0c06939a80a99f126daa0af8a1f395baa98db68c0d3f568a22f89775140a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-23T09:37:06Z","title_canon_sha256":"0d3866149e9922b793366a45dbd5cb205caa40773d23c41030aadff728246c49"},"schema_version":"1.0","source":{"id":"1504.06105","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.06105","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"arxiv_version","alias_value":"1504.06105v1","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06105","created_at":"2026-05-18T02:18:02Z"},{"alias_kind":"pith_short_12","alias_value":"GKJEQ5NXLHHK","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GKJEQ5NXLHHKR72A","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GKJEQ5NX","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:4ae34150c5b36c23094a917f3ac5f65f87185b10e13f6d25fb505d309741094d","target":"graph","created_at":"2026-05-18T02:18:02Z","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":"Constraint automata are an adaptation of B\\\"uchi-automata that process data words where the data comes from some relational structure S. Every transition of such an automaton comes with constraints in terms of the relations of S. A transition can only be fired if the current and the next data values satisfy all constraints of this transition. These automata have been used in the setting where S is a linear order for deciding constraint LTL with constraints over S. In this paper, S is the infinitely branching infinite order tree T. We provide a PSPACE algorithm for emptiness of T-constraint aut","authors_text":"Alexander Kartzow, Thomas Weidner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-23T09:37:06Z","title":"Model Checking Constraint LTL over Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06105","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:cd02ee2bea872f2275c6f1f0bbd80c3ec4a71073d30161ae66ec934ec7d2ebda","target":"record","created_at":"2026-05-18T02:18:02Z","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":"932c0c06939a80a99f126daa0af8a1f395baa98db68c0d3f568a22f89775140a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-23T09:37:06Z","title_canon_sha256":"0d3866149e9922b793366a45dbd5cb205caa40773d23c41030aadff728246c49"},"schema_version":"1.0","source":{"id":"1504.06105","kind":"arxiv","version":1}},"canonical_sha256":"32924875b759cea8ff40db8099147efcdeece54b6ebf7411fe84a11e98b2f6e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32924875b759cea8ff40db8099147efcdeece54b6ebf7411fe84a11e98b2f6e2","first_computed_at":"2026-05-18T02:18:02.575537Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:02.575537Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A/YDho5O6mLZlNE2yAdxetQvwzsfgRDLTEMnAOS+4sn5AAsZ0SRENmuiT7rY0RtloLIDlirwAaKedoyU9GOeBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:02.576208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.06105","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd02ee2bea872f2275c6f1f0bbd80c3ec4a71073d30161ae66ec934ec7d2ebda","sha256:4ae34150c5b36c23094a917f3ac5f65f87185b10e13f6d25fb505d309741094d"],"state_sha256":"4edb03144ef03462f4cb9dc40a5049da76eb68229bcc8b741fd006d6ae251f79"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zisjfvthz6iNrbGmfAvFDUNwUUIPWIGeqCIoa7Y+gCMaybvLf1S6U+m3GDyxLw28NptHKT737wh843CszNgrAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T12:26:26.174374Z","bundle_sha256":"ec84c8c0f15ee8b76f870ba8aca5007555384f4cc70f67799994a6efb9f710ec"}}