{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FKKXVVMMF4WAHZEAKCAXR2MKIT","short_pith_number":"pith:FKKXVVMM","schema_version":"1.0","canonical_sha256":"2a957ad58c2f2c03e480508178e98a44e4fefe47910260e75de63195be4d39ee","source":{"kind":"arxiv","id":"1812.08269","version":1},"attestation_state":"computed","paper":{"title":"Learning Unions of k-Testable Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Alexis Linard, Colin de la Higuera, Frits Vaandrager","submitted_at":"2018-12-19T22:09:42Z","abstract_excerpt":"A classical problem in grammatical inference is to identify a language from a set of examples. In this paper, we address the problem of identifying a union of languages from examples that belong to several different unknown languages. Indeed, decomposing a language into smaller pieces that are easier to represent should make learning easier than aiming for a too generalized language. In particular, we consider k-testable languages in the strict sense (k-TSS). These are defined by a set of allowed prefixes, infixes (sub-strings) and suffixes that words in the language may contain. We establish "},"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":"1812.08269","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2018-12-19T22:09:42Z","cross_cats_sorted":[],"title_canon_sha256":"4b815e1b3bdc1dc3335c38b9f9a19412972d78762269c57b339fa63c0560e0cb","abstract_canon_sha256":"94638eff37f93d21913814577a5b712a3a7ffcea0cac6d3d754b62cfd787bb3b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:51.771948Z","signature_b64":"iHm9NW/WPpGqShexeZs+zqtp2Z2F4yTiEWvP8QujfiLQQM7m9D480xGGo61HPkvabDZ0ESr+bYF4fUcvfY1iBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a957ad58c2f2c03e480508178e98a44e4fefe47910260e75de63195be4d39ee","last_reissued_at":"2026-05-17T23:57:51.771357Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:51.771357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Unions of k-Testable Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Alexis Linard, Colin de la Higuera, Frits Vaandrager","submitted_at":"2018-12-19T22:09:42Z","abstract_excerpt":"A classical problem in grammatical inference is to identify a language from a set of examples. In this paper, we address the problem of identifying a union of languages from examples that belong to several different unknown languages. Indeed, decomposing a language into smaller pieces that are easier to represent should make learning easier than aiming for a too generalized language. In particular, we consider k-testable languages in the strict sense (k-TSS). These are defined by a set of allowed prefixes, infixes (sub-strings) and suffixes that words in the language may contain. We establish "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.08269","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":"1812.08269","created_at":"2026-05-17T23:57:51.771432+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.08269v1","created_at":"2026-05-17T23:57:51.771432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.08269","created_at":"2026-05-17T23:57:51.771432+00:00"},{"alias_kind":"pith_short_12","alias_value":"FKKXVVMMF4WA","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FKKXVVMMF4WAHZEA","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FKKXVVMM","created_at":"2026-05-18T12:32:22.470017+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/FKKXVVMMF4WAHZEAKCAXR2MKIT","json":"https://pith.science/pith/FKKXVVMMF4WAHZEAKCAXR2MKIT.json","graph_json":"https://pith.science/api/pith-number/FKKXVVMMF4WAHZEAKCAXR2MKIT/graph.json","events_json":"https://pith.science/api/pith-number/FKKXVVMMF4WAHZEAKCAXR2MKIT/events.json","paper":"https://pith.science/paper/FKKXVVMM"},"agent_actions":{"view_html":"https://pith.science/pith/FKKXVVMMF4WAHZEAKCAXR2MKIT","download_json":"https://pith.science/pith/FKKXVVMMF4WAHZEAKCAXR2MKIT.json","view_paper":"https://pith.science/paper/FKKXVVMM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.08269&json=true","fetch_graph":"https://pith.science/api/pith-number/FKKXVVMMF4WAHZEAKCAXR2MKIT/graph.json","fetch_events":"https://pith.science/api/pith-number/FKKXVVMMF4WAHZEAKCAXR2MKIT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FKKXVVMMF4WAHZEAKCAXR2MKIT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FKKXVVMMF4WAHZEAKCAXR2MKIT/action/storage_attestation","attest_author":"https://pith.science/pith/FKKXVVMMF4WAHZEAKCAXR2MKIT/action/author_attestation","sign_citation":"https://pith.science/pith/FKKXVVMMF4WAHZEAKCAXR2MKIT/action/citation_signature","submit_replication":"https://pith.science/pith/FKKXVVMMF4WAHZEAKCAXR2MKIT/action/replication_record"}},"created_at":"2026-05-17T23:57:51.771432+00:00","updated_at":"2026-05-17T23:57:51.771432+00:00"}