{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:E37PDCVPANPIFWNDEEEY6BISBT","short_pith_number":"pith:E37PDCVP","schema_version":"1.0","canonical_sha256":"26fef18aaf035e82d9a321098f05120cf1d6be0755751c21875e5e4747adef7e","source":{"kind":"arxiv","id":"1511.03595","version":2},"attestation_state":"computed","paper":{"title":"Optimised determinisation and completion of finite tree automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Bishoksan Kafle, John P. Gallagher, Mai Ajspur","submitted_at":"2015-11-11T18:25:00Z","abstract_excerpt":"Determinisation and completion of finite tree automata are important operations with applications in program analysis and verification. However, the complexity of the classical procedures for determinisation and completion is high. They are not practical procedures for manipulating tree automata beyond very small ones. In this paper we develop an algorithm for determinisation and completion of finite tree automata, whose worst-case complexity remains unchanged, but which performs far better than existing algorithms in practice. The critical aspect of the algorithm is that the transitions of th"},"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":"1511.03595","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-11-11T18:25:00Z","cross_cats_sorted":[],"title_canon_sha256":"aed2c92a33a3a4dca7411a9c04137f2a0a9b4e7a13cf644531cfe5826f155c73","abstract_canon_sha256":"86ad053ef0f74f3ccb773b34c58d62c9c5783f08737b24dcc61524019683ffd2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:36.504834Z","signature_b64":"reKhwAKaBKHeXbRAiHqdiI5YJzB6qlsEx4aXsFJFXuovRWeAqRWtiT1Dtzb3xl3+2PM6QA2cmvW/7BUyZ92HBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26fef18aaf035e82d9a321098f05120cf1d6be0755751c21875e5e4747adef7e","last_reissued_at":"2026-05-18T00:31:36.504429Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:36.504429Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimised determinisation and completion of finite tree automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Bishoksan Kafle, John P. Gallagher, Mai Ajspur","submitted_at":"2015-11-11T18:25:00Z","abstract_excerpt":"Determinisation and completion of finite tree automata are important operations with applications in program analysis and verification. However, the complexity of the classical procedures for determinisation and completion is high. They are not practical procedures for manipulating tree automata beyond very small ones. In this paper we develop an algorithm for determinisation and completion of finite tree automata, whose worst-case complexity remains unchanged, but which performs far better than existing algorithms in practice. The critical aspect of the algorithm is that the transitions of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.03595","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":"1511.03595","created_at":"2026-05-18T00:31:36.504486+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.03595v2","created_at":"2026-05-18T00:31:36.504486+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.03595","created_at":"2026-05-18T00:31:36.504486+00:00"},{"alias_kind":"pith_short_12","alias_value":"E37PDCVPANPI","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"E37PDCVPANPIFWND","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"E37PDCVP","created_at":"2026-05-18T12:29:17.054201+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/E37PDCVPANPIFWNDEEEY6BISBT","json":"https://pith.science/pith/E37PDCVPANPIFWNDEEEY6BISBT.json","graph_json":"https://pith.science/api/pith-number/E37PDCVPANPIFWNDEEEY6BISBT/graph.json","events_json":"https://pith.science/api/pith-number/E37PDCVPANPIFWNDEEEY6BISBT/events.json","paper":"https://pith.science/paper/E37PDCVP"},"agent_actions":{"view_html":"https://pith.science/pith/E37PDCVPANPIFWNDEEEY6BISBT","download_json":"https://pith.science/pith/E37PDCVPANPIFWNDEEEY6BISBT.json","view_paper":"https://pith.science/paper/E37PDCVP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.03595&json=true","fetch_graph":"https://pith.science/api/pith-number/E37PDCVPANPIFWNDEEEY6BISBT/graph.json","fetch_events":"https://pith.science/api/pith-number/E37PDCVPANPIFWNDEEEY6BISBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E37PDCVPANPIFWNDEEEY6BISBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E37PDCVPANPIFWNDEEEY6BISBT/action/storage_attestation","attest_author":"https://pith.science/pith/E37PDCVPANPIFWNDEEEY6BISBT/action/author_attestation","sign_citation":"https://pith.science/pith/E37PDCVPANPIFWNDEEEY6BISBT/action/citation_signature","submit_replication":"https://pith.science/pith/E37PDCVPANPIFWNDEEEY6BISBT/action/replication_record"}},"created_at":"2026-05-18T00:31:36.504486+00:00","updated_at":"2026-05-18T00:31:36.504486+00:00"}