{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SKWFQ66PTBX7QLXPYFX57V7YUF","short_pith_number":"pith:SKWFQ66P","schema_version":"1.0","canonical_sha256":"92ac587bcf986ff82eefc16fdfd7f8a149c8c23acc856ea2815721c351bbe2e7","source":{"kind":"arxiv","id":"1610.07380","version":2},"attestation_state":"computed","paper":{"title":"A Novel Learning Algorithm for B\\\"uchi Automata based on Family of DFAs and Classification Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Depeng Liu, Lijun Zhang, Yong Li, Yu-Fang Chen","submitted_at":"2016-10-24T12:20:54Z","abstract_excerpt":"In this paper, we propose a novel algorithm to learn a B\\\"uchi automaton from a teacher who knows an $\\omega$-regular language. The algorithm is based on learning a formalism named family of DFAs (FDFAs) recently proposed by Angluin and Fisman[10]. The main catch is that we use a classification tree structure instead of the standard observation table structure. The worst case storage space required by our algorithm is quadratically better than the table-based algorithm proposed in [10]. We implement the first publicly available library ROLL (Regular Omega Language Learning ), which consists of"},"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":"1610.07380","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-10-24T12:20:54Z","cross_cats_sorted":[],"title_canon_sha256":"8f82616cea78b824cdfc3c90ceb69e22a709659009a2a08b7b2e881a9a4807aa","abstract_canon_sha256":"3bca119396935001dbd3787678ace1869a7f5bdcf91e7edfa2e4a9e44bf2543e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:44.051050Z","signature_b64":"uY646jtMv7H1BegeyoQej6rvC+NgYHg3g0HAvn5Vk8kxZaAvme8m4B2uMNVfWePt0K+TxeVPWQNMywap+LY/AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92ac587bcf986ff82eefc16fdfd7f8a149c8c23acc856ea2815721c351bbe2e7","last_reissued_at":"2026-05-18T00:52:44.050474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:44.050474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Learning Algorithm for B\\\"uchi Automata based on Family of DFAs and Classification Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Depeng Liu, Lijun Zhang, Yong Li, Yu-Fang Chen","submitted_at":"2016-10-24T12:20:54Z","abstract_excerpt":"In this paper, we propose a novel algorithm to learn a B\\\"uchi automaton from a teacher who knows an $\\omega$-regular language. The algorithm is based on learning a formalism named family of DFAs (FDFAs) recently proposed by Angluin and Fisman[10]. The main catch is that we use a classification tree structure instead of the standard observation table structure. The worst case storage space required by our algorithm is quadratically better than the table-based algorithm proposed in [10]. We implement the first publicly available library ROLL (Regular Omega Language Learning ), which consists of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07380","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":"1610.07380","created_at":"2026-05-18T00:52:44.050570+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.07380v2","created_at":"2026-05-18T00:52:44.050570+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07380","created_at":"2026-05-18T00:52:44.050570+00:00"},{"alias_kind":"pith_short_12","alias_value":"SKWFQ66PTBX7","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SKWFQ66PTBX7QLXP","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SKWFQ66P","created_at":"2026-05-18T12:30:44.179134+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/SKWFQ66PTBX7QLXPYFX57V7YUF","json":"https://pith.science/pith/SKWFQ66PTBX7QLXPYFX57V7YUF.json","graph_json":"https://pith.science/api/pith-number/SKWFQ66PTBX7QLXPYFX57V7YUF/graph.json","events_json":"https://pith.science/api/pith-number/SKWFQ66PTBX7QLXPYFX57V7YUF/events.json","paper":"https://pith.science/paper/SKWFQ66P"},"agent_actions":{"view_html":"https://pith.science/pith/SKWFQ66PTBX7QLXPYFX57V7YUF","download_json":"https://pith.science/pith/SKWFQ66PTBX7QLXPYFX57V7YUF.json","view_paper":"https://pith.science/paper/SKWFQ66P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.07380&json=true","fetch_graph":"https://pith.science/api/pith-number/SKWFQ66PTBX7QLXPYFX57V7YUF/graph.json","fetch_events":"https://pith.science/api/pith-number/SKWFQ66PTBX7QLXPYFX57V7YUF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SKWFQ66PTBX7QLXPYFX57V7YUF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SKWFQ66PTBX7QLXPYFX57V7YUF/action/storage_attestation","attest_author":"https://pith.science/pith/SKWFQ66PTBX7QLXPYFX57V7YUF/action/author_attestation","sign_citation":"https://pith.science/pith/SKWFQ66PTBX7QLXPYFX57V7YUF/action/citation_signature","submit_replication":"https://pith.science/pith/SKWFQ66PTBX7QLXPYFX57V7YUF/action/replication_record"}},"created_at":"2026-05-18T00:52:44.050570+00:00","updated_at":"2026-05-18T00:52:44.050570+00:00"}