{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GKJEQ5NXLHHKR72A3OAJSFD67T","short_pith_number":"pith:GKJEQ5NX","schema_version":"1.0","canonical_sha256":"32924875b759cea8ff40db8099147efcdeece54b6ebf7411fe84a11e98b2f6e2","source":{"kind":"arxiv","id":"1504.06105","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.06105","created_at":"2026-05-18T02:18:02.575633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06105v1","created_at":"2026-05-18T02:18:02.575633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06105","created_at":"2026-05-18T02:18:02.575633+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKJEQ5NXLHHK","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKJEQ5NXLHHKR72A","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKJEQ5NX","created_at":"2026-05-18T12:29:22.688609+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/GKJEQ5NXLHHKR72A3OAJSFD67T","json":"https://pith.science/pith/GKJEQ5NXLHHKR72A3OAJSFD67T.json","graph_json":"https://pith.science/api/pith-number/GKJEQ5NXLHHKR72A3OAJSFD67T/graph.json","events_json":"https://pith.science/api/pith-number/GKJEQ5NXLHHKR72A3OAJSFD67T/events.json","paper":"https://pith.science/paper/GKJEQ5NX"},"agent_actions":{"view_html":"https://pith.science/pith/GKJEQ5NXLHHKR72A3OAJSFD67T","download_json":"https://pith.science/pith/GKJEQ5NXLHHKR72A3OAJSFD67T.json","view_paper":"https://pith.science/paper/GKJEQ5NX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06105&json=true","fetch_graph":"https://pith.science/api/pith-number/GKJEQ5NXLHHKR72A3OAJSFD67T/graph.json","fetch_events":"https://pith.science/api/pith-number/GKJEQ5NXLHHKR72A3OAJSFD67T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKJEQ5NXLHHKR72A3OAJSFD67T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKJEQ5NXLHHKR72A3OAJSFD67T/action/storage_attestation","attest_author":"https://pith.science/pith/GKJEQ5NXLHHKR72A3OAJSFD67T/action/author_attestation","sign_citation":"https://pith.science/pith/GKJEQ5NXLHHKR72A3OAJSFD67T/action/citation_signature","submit_replication":"https://pith.science/pith/GKJEQ5NXLHHKR72A3OAJSFD67T/action/replication_record"}},"created_at":"2026-05-18T02:18:02.575633+00:00","updated_at":"2026-05-18T02:18:02.575633+00:00"}