{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:7VMHTIJETAQ4PMLRMMJLLTJKV7","short_pith_number":"pith:7VMHTIJE","schema_version":"1.0","canonical_sha256":"fd5879a1249821c7b1716312b5cd2aaff9249522e9c1a8724266a9b22f961c84","source":{"kind":"arxiv","id":"0904.4119","version":2},"attestation_state":"computed","paper":{"title":"Two-Way Unary Temporal Logic over Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mikolaj Bojanczyk","submitted_at":"2009-04-27T09:33:44Z","abstract_excerpt":"We consider a temporal logic EF+F^-1 for unranked, unordered finite trees. The logic has two operators: EF\\phi, which says \"in some proper descendant \\phi holds\", and F^-1\\phi, which says \"in some proper ancestor \\phi holds\". We present an algorithm for deciding if a regular language of unranked finite trees can be expressed in EF+F^-1. The algorithm uses a characterization expressed in terms of forest algebras."},"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":"0904.4119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-04-27T09:33:44Z","cross_cats_sorted":[],"title_canon_sha256":"e1afc99c81ac0795f1d424c1eb077c44dd91a376fbd6dae9a60a07dfcbfb2b7f","abstract_canon_sha256":"77a6289ac0ebeb4d3a46de58fb6232c296ac368260dd927ba5b71341d669237a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:40.429165Z","signature_b64":"ONWVLJ/iKkDZNG4ZwK9G7alQ2Wexcz0FqqwOLj5ak3EA+cd8B+Nf8y4lrob7xY0teV71cr77dWCd7eBR6qBCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd5879a1249821c7b1716312b5cd2aaff9249522e9c1a8724266a9b22f961c84","last_reissued_at":"2026-05-18T01:37:40.428491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:40.428491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Way Unary Temporal Logic over Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Mikolaj Bojanczyk","submitted_at":"2009-04-27T09:33:44Z","abstract_excerpt":"We consider a temporal logic EF+F^-1 for unranked, unordered finite trees. The logic has two operators: EF\\phi, which says \"in some proper descendant \\phi holds\", and F^-1\\phi, which says \"in some proper ancestor \\phi holds\". We present an algorithm for deciding if a regular language of unranked finite trees can be expressed in EF+F^-1. The algorithm uses a characterization expressed in terms of forest algebras."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.4119","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":"0904.4119","created_at":"2026-05-18T01:37:40.428628+00:00"},{"alias_kind":"arxiv_version","alias_value":"0904.4119v2","created_at":"2026-05-18T01:37:40.428628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.4119","created_at":"2026-05-18T01:37:40.428628+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VMHTIJETAQ4","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VMHTIJETAQ4PMLR","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VMHTIJE","created_at":"2026-05-18T12:25:58.837520+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.30405","citing_title":"Deciding the Common Fragment of CTL with Past and LTL","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7VMHTIJETAQ4PMLRMMJLLTJKV7","json":"https://pith.science/pith/7VMHTIJETAQ4PMLRMMJLLTJKV7.json","graph_json":"https://pith.science/api/pith-number/7VMHTIJETAQ4PMLRMMJLLTJKV7/graph.json","events_json":"https://pith.science/api/pith-number/7VMHTIJETAQ4PMLRMMJLLTJKV7/events.json","paper":"https://pith.science/paper/7VMHTIJE"},"agent_actions":{"view_html":"https://pith.science/pith/7VMHTIJETAQ4PMLRMMJLLTJKV7","download_json":"https://pith.science/pith/7VMHTIJETAQ4PMLRMMJLLTJKV7.json","view_paper":"https://pith.science/paper/7VMHTIJE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0904.4119&json=true","fetch_graph":"https://pith.science/api/pith-number/7VMHTIJETAQ4PMLRMMJLLTJKV7/graph.json","fetch_events":"https://pith.science/api/pith-number/7VMHTIJETAQ4PMLRMMJLLTJKV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VMHTIJETAQ4PMLRMMJLLTJKV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VMHTIJETAQ4PMLRMMJLLTJKV7/action/storage_attestation","attest_author":"https://pith.science/pith/7VMHTIJETAQ4PMLRMMJLLTJKV7/action/author_attestation","sign_citation":"https://pith.science/pith/7VMHTIJETAQ4PMLRMMJLLTJKV7/action/citation_signature","submit_replication":"https://pith.science/pith/7VMHTIJETAQ4PMLRMMJLLTJKV7/action/replication_record"}},"created_at":"2026-05-18T01:37:40.428628+00:00","updated_at":"2026-05-18T01:37:40.428628+00:00"}