{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FY2H724SF5R3OJSWBNCD7JBLOI","short_pith_number":"pith:FY2H724S","schema_version":"1.0","canonical_sha256":"2e347feb922f63b726560b443fa42b72161ecbccce3b84bd25338663b8b99ded","source":{"kind":"arxiv","id":"1504.06355","version":2},"attestation_state":"computed","paper":{"title":"On Freeze LTL with Ordered Attributes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniel Thoma, Normann Decker","submitted_at":"2015-04-23T22:09:18Z","abstract_excerpt":"This paper is concerned with Freeze LTL, a temporal logic on data words with registers. In a (multi-attributed) data word each position carries a letter from a finite alphabet and assigns a data value to a fixed, finite set of attributes. The satisfiability problem of Freeze LTL is undecidable if more than one register is available or tuples of data values can be stored and compared arbitrarily. Starting from the decidable one-register fragment we propose an extension that allows for specifying a dependency relation on attributes. This restricts in a flexible way how collections of attribute v"},"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.06355","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-04-23T22:09:18Z","cross_cats_sorted":[],"title_canon_sha256":"4eae870787830f945cef8d470923a282fc3adb10deb5c3c5897d07bf3596c1ae","abstract_canon_sha256":"6bb0b17484c09190c182ae82742114e0e8c3f25e0312dc50f152fe1a829e2bb6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:08.515180Z","signature_b64":"bnP05kNSPOjJh2PTQERfwVHh9vUA+lPq66XuYMEmAaJE28lGVl7ssC3mLJlD+7caswYKdSYwBt4bFayvulXoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e347feb922f63b726560b443fa42b72161ecbccce3b84bd25338663b8b99ded","last_reissued_at":"2026-05-18T01:23:08.514762Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:08.514762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Freeze LTL with Ordered Attributes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniel Thoma, Normann Decker","submitted_at":"2015-04-23T22:09:18Z","abstract_excerpt":"This paper is concerned with Freeze LTL, a temporal logic on data words with registers. In a (multi-attributed) data word each position carries a letter from a finite alphabet and assigns a data value to a fixed, finite set of attributes. The satisfiability problem of Freeze LTL is undecidable if more than one register is available or tuples of data values can be stored and compared arbitrarily. Starting from the decidable one-register fragment we propose an extension that allows for specifying a dependency relation on attributes. This restricts in a flexible way how collections of attribute v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.06355","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":"1504.06355","created_at":"2026-05-18T01:23:08.514820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.06355v2","created_at":"2026-05-18T01:23:08.514820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.06355","created_at":"2026-05-18T01:23:08.514820+00:00"},{"alias_kind":"pith_short_12","alias_value":"FY2H724SF5R3","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"FY2H724SF5R3OJSW","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"FY2H724S","created_at":"2026-05-18T12:29:22.688609+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.14850","citing_title":"The Complexity of Nested Reset Counter Systems","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FY2H724SF5R3OJSWBNCD7JBLOI","json":"https://pith.science/pith/FY2H724SF5R3OJSWBNCD7JBLOI.json","graph_json":"https://pith.science/api/pith-number/FY2H724SF5R3OJSWBNCD7JBLOI/graph.json","events_json":"https://pith.science/api/pith-number/FY2H724SF5R3OJSWBNCD7JBLOI/events.json","paper":"https://pith.science/paper/FY2H724S"},"agent_actions":{"view_html":"https://pith.science/pith/FY2H724SF5R3OJSWBNCD7JBLOI","download_json":"https://pith.science/pith/FY2H724SF5R3OJSWBNCD7JBLOI.json","view_paper":"https://pith.science/paper/FY2H724S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.06355&json=true","fetch_graph":"https://pith.science/api/pith-number/FY2H724SF5R3OJSWBNCD7JBLOI/graph.json","fetch_events":"https://pith.science/api/pith-number/FY2H724SF5R3OJSWBNCD7JBLOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FY2H724SF5R3OJSWBNCD7JBLOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FY2H724SF5R3OJSWBNCD7JBLOI/action/storage_attestation","attest_author":"https://pith.science/pith/FY2H724SF5R3OJSWBNCD7JBLOI/action/author_attestation","sign_citation":"https://pith.science/pith/FY2H724SF5R3OJSWBNCD7JBLOI/action/citation_signature","submit_replication":"https://pith.science/pith/FY2H724SF5R3OJSWBNCD7JBLOI/action/replication_record"}},"created_at":"2026-05-18T01:23:08.514820+00:00","updated_at":"2026-05-18T01:23:08.514820+00:00"}