{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SKWFQ66PTBX7QLXPYFX57V7YUF","short_pith_number":"pith:SKWFQ66P","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"},"canonical_sha256":"92ac587bcf986ff82eefc16fdfd7f8a149c8c23acc856ea2815721c351bbe2e7","source":{"kind":"arxiv","id":"1610.07380","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07380","created_at":"2026-05-18T00:52:44Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07380v2","created_at":"2026-05-18T00:52:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07380","created_at":"2026-05-18T00:52:44Z"},{"alias_kind":"pith_short_12","alias_value":"SKWFQ66PTBX7","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SKWFQ66PTBX7QLXP","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SKWFQ66P","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SKWFQ66PTBX7QLXPYFX57V7YUF","target":"record","payload":{"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"},"canonical_sha256":"92ac587bcf986ff82eefc16fdfd7f8a149c8c23acc856ea2815721c351bbe2e7","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"},"source_kind":"arxiv","source_id":"1610.07380","source_version":2,"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:52:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oIae0u56z3uwN0UCIC1wuzQutZ+7vPY5QH5hDeatHaTxyaQSsfYqyvM0gebvgyTukma2x1nsJmZEj2Lxs/JOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:27:36.896398Z"},"content_sha256":"32fa6553b0bdbf13d418ea817ed612a602d1e19d573bf08aa6666ecd26d08fd2","schema_version":"1.0","event_id":"sha256:32fa6553b0bdbf13d418ea817ed612a602d1e19d573bf08aa6666ecd26d08fd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SKWFQ66PTBX7QLXPYFX57V7YUF","target":"graph","payload":{"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"},"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:52:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MtjXOH43MwYJkyfMy9Z82+PNVsviFKqfszZiC+it3nb1w8NwZiBzNbilOIZGgymSI8EZd4HG1HVlnAVUsWNoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T15:27:36.897153Z"},"content_sha256":"f35b562e93353d014ee11e7a65843e30e3b8f4a4ba147008ee0f73b4ec5b27ae","schema_version":"1.0","event_id":"sha256:f35b562e93353d014ee11e7a65843e30e3b8f4a4ba147008ee0f73b4ec5b27ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SKWFQ66PTBX7QLXPYFX57V7YUF/bundle.json","state_url":"https://pith.science/pith/SKWFQ66PTBX7QLXPYFX57V7YUF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SKWFQ66PTBX7QLXPYFX57V7YUF/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-06-11T15:27:36Z","links":{"resolver":"https://pith.science/pith/SKWFQ66PTBX7QLXPYFX57V7YUF","bundle":"https://pith.science/pith/SKWFQ66PTBX7QLXPYFX57V7YUF/bundle.json","state":"https://pith.science/pith/SKWFQ66PTBX7QLXPYFX57V7YUF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SKWFQ66PTBX7QLXPYFX57V7YUF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SKWFQ66PTBX7QLXPYFX57V7YUF","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":"3bca119396935001dbd3787678ace1869a7f5bdcf91e7edfa2e4a9e44bf2543e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-10-24T12:20:54Z","title_canon_sha256":"8f82616cea78b824cdfc3c90ceb69e22a709659009a2a08b7b2e881a9a4807aa"},"schema_version":"1.0","source":{"id":"1610.07380","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.07380","created_at":"2026-05-18T00:52:44Z"},{"alias_kind":"arxiv_version","alias_value":"1610.07380v2","created_at":"2026-05-18T00:52:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07380","created_at":"2026-05-18T00:52:44Z"},{"alias_kind":"pith_short_12","alias_value":"SKWFQ66PTBX7","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SKWFQ66PTBX7QLXP","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SKWFQ66P","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:f35b562e93353d014ee11e7a65843e30e3b8f4a4ba147008ee0f73b4ec5b27ae","target":"graph","created_at":"2026-05-18T00:52:44Z","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":"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","authors_text":"Depeng Liu, Lijun Zhang, Yong Li, Yu-Fang Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-10-24T12:20:54Z","title":"A Novel Learning Algorithm for B\\\"uchi Automata based on Family of DFAs and Classification Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07380","kind":"arxiv","version":2},"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:32fa6553b0bdbf13d418ea817ed612a602d1e19d573bf08aa6666ecd26d08fd2","target":"record","created_at":"2026-05-18T00:52:44Z","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":"3bca119396935001dbd3787678ace1869a7f5bdcf91e7edfa2e4a9e44bf2543e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-10-24T12:20:54Z","title_canon_sha256":"8f82616cea78b824cdfc3c90ceb69e22a709659009a2a08b7b2e881a9a4807aa"},"schema_version":"1.0","source":{"id":"1610.07380","kind":"arxiv","version":2}},"canonical_sha256":"92ac587bcf986ff82eefc16fdfd7f8a149c8c23acc856ea2815721c351bbe2e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92ac587bcf986ff82eefc16fdfd7f8a149c8c23acc856ea2815721c351bbe2e7","first_computed_at":"2026-05-18T00:52:44.050474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:44.050474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uY646jtMv7H1BegeyoQej6rvC+NgYHg3g0HAvn5Vk8kxZaAvme8m4B2uMNVfWePt0K+TxeVPWQNMywap+LY/AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:44.051050Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.07380","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32fa6553b0bdbf13d418ea817ed612a602d1e19d573bf08aa6666ecd26d08fd2","sha256:f35b562e93353d014ee11e7a65843e30e3b8f4a4ba147008ee0f73b4ec5b27ae"],"state_sha256":"b975dc3c1faf571d2c9c5d22f9dc0d9ad0055a57e6e1aad281c16b6eaefcbaf9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0MCGygtWYn2+ZfrtT7AYkDFpQuL2FPj5rE3qW78s/fntXRJtZkJ94mqNgrkLM2ORHNujF/7hN/iIKvrgpH4iAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T15:27:36.900700Z","bundle_sha256":"b42dbc67beb17413a5748e7607641e6a75cf84c6d16ab66063f414e2fdbcd2be"}}