{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:M6XC5GKIMFRZTQI3B6YOAMELAO","short_pith_number":"pith:M6XC5GKI","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"},"canonical_sha256":"67ae2e9948616399c11b0fb0e0308b03aaf2d835f0f02b8cfe6235a11677133d","source":{"kind":"arxiv","id":"1611.06703","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06703","created_at":"2026-05-18T00:57:33Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06703v1","created_at":"2026-05-18T00:57:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06703","created_at":"2026-05-18T00:57:33Z"},{"alias_kind":"pith_short_12","alias_value":"M6XC5GKIMFRZ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"M6XC5GKIMFRZTQI3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"M6XC5GKI","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:M6XC5GKIMFRZTQI3B6YOAMELAO","target":"record","payload":{"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"},"canonical_sha256":"67ae2e9948616399c11b0fb0e0308b03aaf2d835f0f02b8cfe6235a11677133d","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"},"source_kind":"arxiv","source_id":"1611.06703","source_version":1,"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:57:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kJLrPwouR14tSakKjfo5GBU+M/CCsUU6UvB7/AdWham5BEQJwSnaIs2UBBI+T90yx+DlZB350kzWpbBISi/aCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T06:20:33.280209Z"},"content_sha256":"724248bfd014e7deee68edd710da61875c5d2e2e7bd7e3658f9bd042ec1cfb0b","schema_version":"1.0","event_id":"sha256:724248bfd014e7deee68edd710da61875c5d2e2e7bd7e3658f9bd042ec1cfb0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:M6XC5GKIMFRZTQI3B6YOAMELAO","target":"graph","payload":{"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"},"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:57:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TmDkuKQXeaE5Fm8CzISaasRXLPTmPI45UV5++II3iTgDaK+yFFRcDn9is0kXOkpndf7iJXkVan9EspE8YyrdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T06:20:33.280574Z"},"content_sha256":"f149edd6e49b16fe00322a23fac3754d16981e26e2329f0d7374a6d53afc494b","schema_version":"1.0","event_id":"sha256:f149edd6e49b16fe00322a23fac3754d16981e26e2329f0d7374a6d53afc494b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M6XC5GKIMFRZTQI3B6YOAMELAO/bundle.json","state_url":"https://pith.science/pith/M6XC5GKIMFRZTQI3B6YOAMELAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M6XC5GKIMFRZTQI3B6YOAMELAO/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-23T06:20:33Z","links":{"resolver":"https://pith.science/pith/M6XC5GKIMFRZTQI3B6YOAMELAO","bundle":"https://pith.science/pith/M6XC5GKIMFRZTQI3B6YOAMELAO/bundle.json","state":"https://pith.science/pith/M6XC5GKIMFRZTQI3B6YOAMELAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M6XC5GKIMFRZTQI3B6YOAMELAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:M6XC5GKIMFRZTQI3B6YOAMELAO","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":"45ccb439490cb8df6e29acf7f05ccacf62429471362d4ae174d8d76df7c68a4d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-21T10:02:02Z","title_canon_sha256":"6530410c6974b601f6c79bdc1ad4e38cf405b6bc7e4c4a5f8a62887695c44c78"},"schema_version":"1.0","source":{"id":"1611.06703","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06703","created_at":"2026-05-18T00:57:33Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06703v1","created_at":"2026-05-18T00:57:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06703","created_at":"2026-05-18T00:57:33Z"},{"alias_kind":"pith_short_12","alias_value":"M6XC5GKIMFRZ","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"M6XC5GKIMFRZTQI3","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"M6XC5GKI","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:f149edd6e49b16fe00322a23fac3754d16981e26e2329f0d7374a6d53afc494b","target":"graph","created_at":"2026-05-18T00:57:33Z","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":"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","authors_text":"Jad Hamza, Mika\\\"el Mayer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-21T10:02:02Z","title":"Optimal Test Sets for Context-Free Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06703","kind":"arxiv","version":1},"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:724248bfd014e7deee68edd710da61875c5d2e2e7bd7e3658f9bd042ec1cfb0b","target":"record","created_at":"2026-05-18T00:57:33Z","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":"45ccb439490cb8df6e29acf7f05ccacf62429471362d4ae174d8d76df7c68a4d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-11-21T10:02:02Z","title_canon_sha256":"6530410c6974b601f6c79bdc1ad4e38cf405b6bc7e4c4a5f8a62887695c44c78"},"schema_version":"1.0","source":{"id":"1611.06703","kind":"arxiv","version":1}},"canonical_sha256":"67ae2e9948616399c11b0fb0e0308b03aaf2d835f0f02b8cfe6235a11677133d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67ae2e9948616399c11b0fb0e0308b03aaf2d835f0f02b8cfe6235a11677133d","first_computed_at":"2026-05-18T00:57:33.133962Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:33.133962Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZWroRAt6bUOxqCCEeVHl5U99cqnACgC3TprxRBvOhxzSTO0RFbrVNDXKToASllCZ4MioL/EHvjJsuewGTetvDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:33.134617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.06703","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:724248bfd014e7deee68edd710da61875c5d2e2e7bd7e3658f9bd042ec1cfb0b","sha256:f149edd6e49b16fe00322a23fac3754d16981e26e2329f0d7374a6d53afc494b"],"state_sha256":"80479d776e5d5013201636282d720c6059ef8af0e3eb45f4cbf394f17fdf3e51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qj+JPRvvEHOSS8l8QQRAEnBahzLIYxekYim+3XBVyqq75pqIfQ7hdmcN3ez7ByajIisZhmtf2EGagOI9vjVJAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T06:20:33.282479Z","bundle_sha256":"2b8f21eb20f6d9223c4351db4c1818f047bda33ba2579a5b40b4bfbb0bbf887d"}}