{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:IAL7XRNVIXD4U4EII3WYORD7J3","short_pith_number":"pith:IAL7XRNV","schema_version":"1.0","canonical_sha256":"4017fbc5b545c7ca708846ed87447f4ee578b72f1c5a5a5aebf6efdda8cf69d1","source":{"kind":"arxiv","id":"1401.5951","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Algorithm for the Equation Tree Automaton via the $k$-C-Continuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Djelloul Ziadi, Ludovic Mignot, Nadia Ouali Sebti","submitted_at":"2014-01-23T12:11:52Z","abstract_excerpt":"Champarnaud and Ziadi, and Khorsi et al. show how to compute the equation automaton of word regular expression $E$ via the $k$-C-Continuations.\n  Kuske and Meinecke extend the computation of the equation automaton to a regular tree expression $E$ over a ranked alphabet $\\Sigma$ and produce a $O(R\\cdot|E|^2)$ time and space complexity algorithm, where $R$ is the maximal rank of a symbol occurring in $\\Sigma$ and $|E|$ is the size of $E$. In this paper, we give a full description of the algorithm based on the acyclic minimization of Revuz. Our algorithm, which is performed in an $O(|Q|\\cdot|E|)$"},"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":"1401.5951","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-01-23T12:11:52Z","cross_cats_sorted":[],"title_canon_sha256":"960f5314beb09fc4727e0782188b3bd701edac93d789f8f16997e916f8fee830","abstract_canon_sha256":"19e2435c91d516b6d1cc67d937574317bc20acefc2ca23b8e67e1adb70f65247"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:23.315045Z","signature_b64":"E066+ONW/WnzQqZo8ffwVBgLwWAek7kmbneVL9UWMMlUmB5L2SDUQGax/QvPqZOCceZMlM7OpeukQkTprGQWCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4017fbc5b545c7ca708846ed87447f4ee578b72f1c5a5a5aebf6efdda8cf69d1","last_reissued_at":"2026-05-18T03:01:23.314284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:23.314284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Algorithm for the Equation Tree Automaton via the $k$-C-Continuations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Djelloul Ziadi, Ludovic Mignot, Nadia Ouali Sebti","submitted_at":"2014-01-23T12:11:52Z","abstract_excerpt":"Champarnaud and Ziadi, and Khorsi et al. show how to compute the equation automaton of word regular expression $E$ via the $k$-C-Continuations.\n  Kuske and Meinecke extend the computation of the equation automaton to a regular tree expression $E$ over a ranked alphabet $\\Sigma$ and produce a $O(R\\cdot|E|^2)$ time and space complexity algorithm, where $R$ is the maximal rank of a symbol occurring in $\\Sigma$ and $|E|$ is the size of $E$. In this paper, we give a full description of the algorithm based on the acyclic minimization of Revuz. Our algorithm, which is performed in an $O(|Q|\\cdot|E|)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5951","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":"1401.5951","created_at":"2026-05-18T03:01:23.314408+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.5951v1","created_at":"2026-05-18T03:01:23.314408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5951","created_at":"2026-05-18T03:01:23.314408+00:00"},{"alias_kind":"pith_short_12","alias_value":"IAL7XRNVIXD4","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"IAL7XRNVIXD4U4EI","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"IAL7XRNV","created_at":"2026-05-18T12:28:33.132498+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/IAL7XRNVIXD4U4EII3WYORD7J3","json":"https://pith.science/pith/IAL7XRNVIXD4U4EII3WYORD7J3.json","graph_json":"https://pith.science/api/pith-number/IAL7XRNVIXD4U4EII3WYORD7J3/graph.json","events_json":"https://pith.science/api/pith-number/IAL7XRNVIXD4U4EII3WYORD7J3/events.json","paper":"https://pith.science/paper/IAL7XRNV"},"agent_actions":{"view_html":"https://pith.science/pith/IAL7XRNVIXD4U4EII3WYORD7J3","download_json":"https://pith.science/pith/IAL7XRNVIXD4U4EII3WYORD7J3.json","view_paper":"https://pith.science/paper/IAL7XRNV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.5951&json=true","fetch_graph":"https://pith.science/api/pith-number/IAL7XRNVIXD4U4EII3WYORD7J3/graph.json","fetch_events":"https://pith.science/api/pith-number/IAL7XRNVIXD4U4EII3WYORD7J3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IAL7XRNVIXD4U4EII3WYORD7J3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IAL7XRNVIXD4U4EII3WYORD7J3/action/storage_attestation","attest_author":"https://pith.science/pith/IAL7XRNVIXD4U4EII3WYORD7J3/action/author_attestation","sign_citation":"https://pith.science/pith/IAL7XRNVIXD4U4EII3WYORD7J3/action/citation_signature","submit_replication":"https://pith.science/pith/IAL7XRNVIXD4U4EII3WYORD7J3/action/replication_record"}},"created_at":"2026-05-18T03:01:23.314408+00:00","updated_at":"2026-05-18T03:01:23.314408+00:00"}