{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:Z2SKUMKXZJXGPZJ2V4AT53PLBQ","short_pith_number":"pith:Z2SKUMKX","canonical_record":{"source":{"id":"1805.08584","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-22T13:58:55Z","cross_cats_sorted":[],"title_canon_sha256":"43991a017c43a624990b9042eced0105c0676489b6fe7df0a17a8252e1237527","abstract_canon_sha256":"a619febd5abc03c3b5376401d9cb135acb72e2429818274920994ede57204b50"},"schema_version":"1.0"},"canonical_sha256":"cea4aa3157ca6e67e53aaf013eedeb0c1b889dda5cd44bf82d1d8c3ae085d69e","source":{"kind":"arxiv","id":"1805.08584","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08584","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08584v1","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08584","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"pith_short_12","alias_value":"Z2SKUMKXZJXG","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z2SKUMKXZJXGPZJ2","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z2SKUMKX","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:Z2SKUMKXZJXGPZJ2V4AT53PLBQ","target":"record","payload":{"canonical_record":{"source":{"id":"1805.08584","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-22T13:58:55Z","cross_cats_sorted":[],"title_canon_sha256":"43991a017c43a624990b9042eced0105c0676489b6fe7df0a17a8252e1237527","abstract_canon_sha256":"a619febd5abc03c3b5376401d9cb135acb72e2429818274920994ede57204b50"},"schema_version":"1.0"},"canonical_sha256":"cea4aa3157ca6e67e53aaf013eedeb0c1b889dda5cd44bf82d1d8c3ae085d69e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:25.893737Z","signature_b64":"KK1E5D0pTnZZwh+OC6PPo32L1VwSsG658liyiTbYjonAQA1fGBnncB9PsJHVVnng7+J7/km+4qEROuYJmaIwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cea4aa3157ca6e67e53aaf013eedeb0c1b889dda5cd44bf82d1d8c3ae085d69e","last_reissued_at":"2026-05-18T00:15:25.893042Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:25.893042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.08584","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-18T00:15:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vstgX6JOmarFknQZVJmPxJUs5mi9DShzLs3rHycEZPcM3axG2XrPJNc6e1M8y+Tmo27wJNWGpC/vrGsVFI9xAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:40:12.013281Z"},"content_sha256":"aed8351ee5c1a89916d3d30689a97f597efbbe3ce06da111c83e86e061d7f2a7","schema_version":"1.0","event_id":"sha256:aed8351ee5c1a89916d3d30689a97f597efbbe3ce06da111c83e86e061d7f2a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:Z2SKUMKXZJXGPZJ2V4AT53PLBQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Bottom-Up Position Tree Automaton, the Father Automaton and their Compact Versions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Djelloul Ziadi, Ludovic Mignot, Samira Attou","submitted_at":"2018-05-22T13:58:55Z","abstract_excerpt":"The conversion of a given regular tree expression into a tree automaton has been widely studied. However, classical interpretations are based upon a Top-Down interpretation of tree automata. In this paper, we propose new constructions based on the Gluskov's one and on the one of Ilie and Yu one using a Bottom-Up interpretation. One of the main goals of this technique is to consider as a next step the links with deterministic recognizers, consideration that cannot be performed with classical Top-Down approaches. Furthermore, we exhibit a method to factorize transitions of tree automata and show"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08584","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-18T00:15:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qwQdRqyThzVTWabvVMQXTPekTkXKUIbcylTuyWibQcpPFH8ixaTt4ObF0Mhrx7GfukFBL3oM5GNXW9+zP4G9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:40:12.013970Z"},"content_sha256":"88ffdb066aab1414078aceabded3e121f862a369355156ae7dff58a66215de1c","schema_version":"1.0","event_id":"sha256:88ffdb066aab1414078aceabded3e121f862a369355156ae7dff58a66215de1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z2SKUMKXZJXGPZJ2V4AT53PLBQ/bundle.json","state_url":"https://pith.science/pith/Z2SKUMKXZJXGPZJ2V4AT53PLBQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z2SKUMKXZJXGPZJ2V4AT53PLBQ/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-05-27T22:40:12Z","links":{"resolver":"https://pith.science/pith/Z2SKUMKXZJXGPZJ2V4AT53PLBQ","bundle":"https://pith.science/pith/Z2SKUMKXZJXGPZJ2V4AT53PLBQ/bundle.json","state":"https://pith.science/pith/Z2SKUMKXZJXGPZJ2V4AT53PLBQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z2SKUMKXZJXGPZJ2V4AT53PLBQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:Z2SKUMKXZJXGPZJ2V4AT53PLBQ","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":"a619febd5abc03c3b5376401d9cb135acb72e2429818274920994ede57204b50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-22T13:58:55Z","title_canon_sha256":"43991a017c43a624990b9042eced0105c0676489b6fe7df0a17a8252e1237527"},"schema_version":"1.0","source":{"id":"1805.08584","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.08584","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"arxiv_version","alias_value":"1805.08584v1","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08584","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"pith_short_12","alias_value":"Z2SKUMKXZJXG","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"Z2SKUMKXZJXGPZJ2","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"Z2SKUMKX","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:88ffdb066aab1414078aceabded3e121f862a369355156ae7dff58a66215de1c","target":"graph","created_at":"2026-05-18T00:15:25Z","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":"The conversion of a given regular tree expression into a tree automaton has been widely studied. However, classical interpretations are based upon a Top-Down interpretation of tree automata. In this paper, we propose new constructions based on the Gluskov's one and on the one of Ilie and Yu one using a Bottom-Up interpretation. One of the main goals of this technique is to consider as a next step the links with deterministic recognizers, consideration that cannot be performed with classical Top-Down approaches. Furthermore, we exhibit a method to factorize transitions of tree automata and show","authors_text":"Djelloul Ziadi, Ludovic Mignot, Samira Attou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-22T13:58:55Z","title":"The Bottom-Up Position Tree Automaton, the Father Automaton and their Compact Versions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08584","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:aed8351ee5c1a89916d3d30689a97f597efbbe3ce06da111c83e86e061d7f2a7","target":"record","created_at":"2026-05-18T00:15:25Z","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":"a619febd5abc03c3b5376401d9cb135acb72e2429818274920994ede57204b50","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-05-22T13:58:55Z","title_canon_sha256":"43991a017c43a624990b9042eced0105c0676489b6fe7df0a17a8252e1237527"},"schema_version":"1.0","source":{"id":"1805.08584","kind":"arxiv","version":1}},"canonical_sha256":"cea4aa3157ca6e67e53aaf013eedeb0c1b889dda5cd44bf82d1d8c3ae085d69e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cea4aa3157ca6e67e53aaf013eedeb0c1b889dda5cd44bf82d1d8c3ae085d69e","first_computed_at":"2026-05-18T00:15:25.893042Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:25.893042Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KK1E5D0pTnZZwh+OC6PPo32L1VwSsG658liyiTbYjonAQA1fGBnncB9PsJHVVnng7+J7/km+4qEROuYJmaIwBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:25.893737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.08584","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aed8351ee5c1a89916d3d30689a97f597efbbe3ce06da111c83e86e061d7f2a7","sha256:88ffdb066aab1414078aceabded3e121f862a369355156ae7dff58a66215de1c"],"state_sha256":"18783591fc0d375a088ec58d3a78646820cc4a47f5e2ead5acfcabdfc5f45188"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"07PYKqq/QtZ/cXDc6jMzMRT46DEc+zUNADYQ5jUCZgO5La8L24H1CdJJZcKs4AHZfmwTvmCiVPCxEAK612RuAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:40:12.017367Z","bundle_sha256":"bf398b992d23f7b8bcc98853b443f467573bf820398b29449a1099ea7b2453eb"}}