{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:7VMHTIJETAQ4PMLRMMJLLTJKV7","short_pith_number":"pith:7VMHTIJE","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"},"canonical_sha256":"fd5879a1249821c7b1716312b5cd2aaff9249522e9c1a8724266a9b22f961c84","source":{"kind":"arxiv","id":"0904.4119","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.4119","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"arxiv_version","alias_value":"0904.4119v2","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.4119","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"pith_short_12","alias_value":"7VMHTIJETAQ4","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"7VMHTIJETAQ4PMLR","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"7VMHTIJE","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:7VMHTIJETAQ4PMLRMMJLLTJKV7","target":"record","payload":{"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"},"canonical_sha256":"fd5879a1249821c7b1716312b5cd2aaff9249522e9c1a8724266a9b22f961c84","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"},"source_kind":"arxiv","source_id":"0904.4119","source_version":2,"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-18T01:37:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8VpxyF+ntkDWCrKQ+ZLMl9DSPsLwux4vg+DQSklDP9u33JPNKlDbN3o0dBgypYq9jTY9FWUWmxaU/2/SvqmiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:36:51.127425Z"},"content_sha256":"56df4bcbe7e0eaabf5ed3efa7224ce84b965a8b983992b2a8206e99c68ec15a6","schema_version":"1.0","event_id":"sha256:56df4bcbe7e0eaabf5ed3efa7224ce84b965a8b983992b2a8206e99c68ec15a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:7VMHTIJETAQ4PMLRMMJLLTJKV7","target":"graph","payload":{"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"},"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-18T01:37:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g4v1gKAK0LJQKO/uU6iVFwuDPvY6ENdbvyPifp5hhbGSOKIwB4wbSjTCiTuMMbhFAaNdn84k3Woct4gRPDwoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T19:36:51.127772Z"},"content_sha256":"01c3a2e764891ec956b7593af04a937af6dcecb5d75a13239faa00206dcb8176","schema_version":"1.0","event_id":"sha256:01c3a2e764891ec956b7593af04a937af6dcecb5d75a13239faa00206dcb8176"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7VMHTIJETAQ4PMLRMMJLLTJKV7/bundle.json","state_url":"https://pith.science/pith/7VMHTIJETAQ4PMLRMMJLLTJKV7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7VMHTIJETAQ4PMLRMMJLLTJKV7/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-30T19:36:51Z","links":{"resolver":"https://pith.science/pith/7VMHTIJETAQ4PMLRMMJLLTJKV7","bundle":"https://pith.science/pith/7VMHTIJETAQ4PMLRMMJLLTJKV7/bundle.json","state":"https://pith.science/pith/7VMHTIJETAQ4PMLRMMJLLTJKV7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7VMHTIJETAQ4PMLRMMJLLTJKV7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:7VMHTIJETAQ4PMLRMMJLLTJKV7","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":"77a6289ac0ebeb4d3a46de58fb6232c296ac368260dd927ba5b71341d669237a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-04-27T09:33:44Z","title_canon_sha256":"e1afc99c81ac0795f1d424c1eb077c44dd91a376fbd6dae9a60a07dfcbfb2b7f"},"schema_version":"1.0","source":{"id":"0904.4119","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0904.4119","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"arxiv_version","alias_value":"0904.4119v2","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0904.4119","created_at":"2026-05-18T01:37:40Z"},{"alias_kind":"pith_short_12","alias_value":"7VMHTIJETAQ4","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"7VMHTIJETAQ4PMLR","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"7VMHTIJE","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:01c3a2e764891ec956b7593af04a937af6dcecb5d75a13239faa00206dcb8176","target":"graph","created_at":"2026-05-18T01:37:40Z","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":"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.","authors_text":"Mikolaj Bojanczyk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-04-27T09:33:44Z","title":"Two-Way Unary Temporal Logic over Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0904.4119","kind":"arxiv","version":2},"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:56df4bcbe7e0eaabf5ed3efa7224ce84b965a8b983992b2a8206e99c68ec15a6","target":"record","created_at":"2026-05-18T01:37:40Z","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":"77a6289ac0ebeb4d3a46de58fb6232c296ac368260dd927ba5b71341d669237a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2009-04-27T09:33:44Z","title_canon_sha256":"e1afc99c81ac0795f1d424c1eb077c44dd91a376fbd6dae9a60a07dfcbfb2b7f"},"schema_version":"1.0","source":{"id":"0904.4119","kind":"arxiv","version":2}},"canonical_sha256":"fd5879a1249821c7b1716312b5cd2aaff9249522e9c1a8724266a9b22f961c84","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd5879a1249821c7b1716312b5cd2aaff9249522e9c1a8724266a9b22f961c84","first_computed_at":"2026-05-18T01:37:40.428491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:40.428491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ONWVLJ/iKkDZNG4ZwK9G7alQ2Wexcz0FqqwOLj5ak3EA+cd8B+Nf8y4lrob7xY0teV71cr77dWCd7eBR6qBCBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:40.429165Z","signed_message":"canonical_sha256_bytes"},"source_id":"0904.4119","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:56df4bcbe7e0eaabf5ed3efa7224ce84b965a8b983992b2a8206e99c68ec15a6","sha256:01c3a2e764891ec956b7593af04a937af6dcecb5d75a13239faa00206dcb8176"],"state_sha256":"bb81549663962d61bac82546d908356617bf39887754f001175cbb5f3f6b53a3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5/2cGZH83ujM1anwGkr0N0oKs3QG6hfhungD3GduOohz7xdCnS+DK6XJ5+yfwi6mW7cU2cWTLAwtJPzVmY7GCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T19:36:51.129964Z","bundle_sha256":"db029fcb2454afea16a9b242fce442fc5c8165d0575b83662483a8d4cc995938"}}