{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Z2SKUMKXZJXGPZJ2V4AT53PLBQ","short_pith_number":"pith:Z2SKUMKX","schema_version":"1.0","canonical_sha256":"cea4aa3157ca6e67e53aaf013eedeb0c1b889dda5cd44bf82d1d8c3ae085d69e","source":{"kind":"arxiv","id":"1805.08584","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1805.08584","created_at":"2026-05-18T00:15:25.893149+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08584v1","created_at":"2026-05-18T00:15:25.893149+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08584","created_at":"2026-05-18T00:15:25.893149+00:00"},{"alias_kind":"pith_short_12","alias_value":"Z2SKUMKXZJXG","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Z2SKUMKXZJXGPZJ2","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Z2SKUMKX","created_at":"2026-05-18T12:33:04.347982+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/Z2SKUMKXZJXGPZJ2V4AT53PLBQ","json":"https://pith.science/pith/Z2SKUMKXZJXGPZJ2V4AT53PLBQ.json","graph_json":"https://pith.science/api/pith-number/Z2SKUMKXZJXGPZJ2V4AT53PLBQ/graph.json","events_json":"https://pith.science/api/pith-number/Z2SKUMKXZJXGPZJ2V4AT53PLBQ/events.json","paper":"https://pith.science/paper/Z2SKUMKX"},"agent_actions":{"view_html":"https://pith.science/pith/Z2SKUMKXZJXGPZJ2V4AT53PLBQ","download_json":"https://pith.science/pith/Z2SKUMKXZJXGPZJ2V4AT53PLBQ.json","view_paper":"https://pith.science/paper/Z2SKUMKX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08584&json=true","fetch_graph":"https://pith.science/api/pith-number/Z2SKUMKXZJXGPZJ2V4AT53PLBQ/graph.json","fetch_events":"https://pith.science/api/pith-number/Z2SKUMKXZJXGPZJ2V4AT53PLBQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Z2SKUMKXZJXGPZJ2V4AT53PLBQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Z2SKUMKXZJXGPZJ2V4AT53PLBQ/action/storage_attestation","attest_author":"https://pith.science/pith/Z2SKUMKXZJXGPZJ2V4AT53PLBQ/action/author_attestation","sign_citation":"https://pith.science/pith/Z2SKUMKXZJXGPZJ2V4AT53PLBQ/action/citation_signature","submit_replication":"https://pith.science/pith/Z2SKUMKXZJXGPZJ2V4AT53PLBQ/action/replication_record"}},"created_at":"2026-05-18T00:15:25.893149+00:00","updated_at":"2026-05-18T00:15:25.893149+00:00"}