{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:M6XC5GKIMFRZTQI3B6YOAMELAO","short_pith_number":"pith:M6XC5GKI","schema_version":"1.0","canonical_sha256":"67ae2e9948616399c11b0fb0e0308b03aaf2d835f0f02b8cfe6235a11677133d","source":{"kind":"arxiv","id":"1611.06703","version":1},"attestation_state":"computed","paper":{"title":"Optimal Test Sets for Context-Free Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Jad Hamza, Mika\\\"el Mayer","submitted_at":"2016-11-21T10:02:02Z","abstract_excerpt":"A test set for a formal language (set of strings) L is a subset T of L such that for any two string homomorphisms f and g defined on L, if the restrictions of f and g on T are identical functions, then f and g are identical on the entire L. Previously, it was shown that there are context-free grammars for which smallest test sets are cubic in the size of the grammar, which gives a lower bound on tests set size. Existing upper bounds were higher degree polynomials; we here give the first algorithm to compute test sets of cubic size for all context-free grammars, settling the gap between the upp"},"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":"1611.06703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-21T10:02:02Z","cross_cats_sorted":[],"title_canon_sha256":"6530410c6974b601f6c79bdc1ad4e38cf405b6bc7e4c4a5f8a62887695c44c78","abstract_canon_sha256":"45ccb439490cb8df6e29acf7f05ccacf62429471362d4ae174d8d76df7c68a4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:33.134617Z","signature_b64":"ZWroRAt6bUOxqCCEeVHl5U99cqnACgC3TprxRBvOhxzSTO0RFbrVNDXKToASllCZ4MioL/EHvjJsuewGTetvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67ae2e9948616399c11b0fb0e0308b03aaf2d835f0f02b8cfe6235a11677133d","last_reissued_at":"2026-05-18T00:57:33.133962Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:33.133962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Test Sets for Context-Free Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Jad Hamza, Mika\\\"el Mayer","submitted_at":"2016-11-21T10:02:02Z","abstract_excerpt":"A test set for a formal language (set of strings) L is a subset T of L such that for any two string homomorphisms f and g defined on L, if the restrictions of f and g on T are identical functions, then f and g are identical on the entire L. Previously, it was shown that there are context-free grammars for which smallest test sets are cubic in the size of the grammar, which gives a lower bound on tests set size. Existing upper bounds were higher degree polynomials; we here give the first algorithm to compute test sets of cubic size for all context-free grammars, settling the gap between the upp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06703","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":"1611.06703","created_at":"2026-05-18T00:57:33.134051+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.06703v1","created_at":"2026-05-18T00:57:33.134051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06703","created_at":"2026-05-18T00:57:33.134051+00:00"},{"alias_kind":"pith_short_12","alias_value":"M6XC5GKIMFRZ","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"M6XC5GKIMFRZTQI3","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"M6XC5GKI","created_at":"2026-05-18T12:30:29.479603+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/M6XC5GKIMFRZTQI3B6YOAMELAO","json":"https://pith.science/pith/M6XC5GKIMFRZTQI3B6YOAMELAO.json","graph_json":"https://pith.science/api/pith-number/M6XC5GKIMFRZTQI3B6YOAMELAO/graph.json","events_json":"https://pith.science/api/pith-number/M6XC5GKIMFRZTQI3B6YOAMELAO/events.json","paper":"https://pith.science/paper/M6XC5GKI"},"agent_actions":{"view_html":"https://pith.science/pith/M6XC5GKIMFRZTQI3B6YOAMELAO","download_json":"https://pith.science/pith/M6XC5GKIMFRZTQI3B6YOAMELAO.json","view_paper":"https://pith.science/paper/M6XC5GKI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.06703&json=true","fetch_graph":"https://pith.science/api/pith-number/M6XC5GKIMFRZTQI3B6YOAMELAO/graph.json","fetch_events":"https://pith.science/api/pith-number/M6XC5GKIMFRZTQI3B6YOAMELAO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M6XC5GKIMFRZTQI3B6YOAMELAO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M6XC5GKIMFRZTQI3B6YOAMELAO/action/storage_attestation","attest_author":"https://pith.science/pith/M6XC5GKIMFRZTQI3B6YOAMELAO/action/author_attestation","sign_citation":"https://pith.science/pith/M6XC5GKIMFRZTQI3B6YOAMELAO/action/citation_signature","submit_replication":"https://pith.science/pith/M6XC5GKIMFRZTQI3B6YOAMELAO/action/replication_record"}},"created_at":"2026-05-18T00:57:33.134051+00:00","updated_at":"2026-05-18T00:57:33.134051+00:00"}