{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HMQLTONTUF4MA3QTZYV5V2GTCK","short_pith_number":"pith:HMQLTONT","canonical_record":{"source":{"id":"1805.04003","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.FL","submitted_at":"2018-05-10T14:33:02Z","cross_cats_sorted":[],"title_canon_sha256":"ab1537715e1d8dabc8f208a3ad4cd1d749db7767ec4da7ef925642199c6dc9cb","abstract_canon_sha256":"6f7c39449a9b307acbdf80ca267763c71f51edbea2ca87ff74ead617a97e916b"},"schema_version":"1.0"},"canonical_sha256":"3b20b9b9b3a178c06e13ce2bdae8d312833474256be5c79ecef64b1ec9e1704f","source":{"kind":"arxiv","id":"1805.04003","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04003","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04003v1","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04003","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"pith_short_12","alias_value":"HMQLTONTUF4M","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HMQLTONTUF4MA3QT","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HMQLTONT","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HMQLTONTUF4MA3QTZYV5V2GTCK","target":"record","payload":{"canonical_record":{"source":{"id":"1805.04003","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.FL","submitted_at":"2018-05-10T14:33:02Z","cross_cats_sorted":[],"title_canon_sha256":"ab1537715e1d8dabc8f208a3ad4cd1d749db7767ec4da7ef925642199c6dc9cb","abstract_canon_sha256":"6f7c39449a9b307acbdf80ca267763c71f51edbea2ca87ff74ead617a97e916b"},"schema_version":"1.0"},"canonical_sha256":"3b20b9b9b3a178c06e13ce2bdae8d312833474256be5c79ecef64b1ec9e1704f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:15.281387Z","signature_b64":"qnH6snn1K4boYUQs3TY1TerQApRwot1bWRE7E9bi/jhLvGq7aDuTysSXqg6kRi6RloZsVVLxrONm/XGcWwDjCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b20b9b9b3a178c06e13ce2bdae8d312833474256be5c79ecef64b1ec9e1704f","last_reissued_at":"2026-05-18T00:16:15.280815Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:15.280815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.04003","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:16:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oPgEQXTqMZ/wl/kUGy49u8iv2LtWIyd+siAjHfKfruDE/Y31yk3dbpDldeSeaS1y3GTrTK/yPv10bMvnLeBZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:34:05.311416Z"},"content_sha256":"3b9b6e293e3f50bcd9029186a25380467db4d82d6fdcf786cb41556bed61a333","schema_version":"1.0","event_id":"sha256:3b9b6e293e3f50bcd9029186a25380467db4d82d6fdcf786cb41556bed61a333"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HMQLTONTUF4MA3QTZYV5V2GTCK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Non-erasing Chomsky-Sch{\\\"u}tzenberger theorem with grammar-independent alphabet","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Pierluigi San Pietro, Stefano Crespi Reghizzi","submitted_at":"2018-05-10T14:33:02Z","abstract_excerpt":"The famous theorem by Chomsky and Sch\\\"utzenberger (CST) says that every context-free language $L$ over an alphabet $\\Sigma$ is representable as $h(D \\cap R)$, where $D$ is a Dyck language over a set $\\Omega$ of brackets, $R$ is a local language and $h$ is an alphabetic homomorphism that erases unboundedly many symbols. Berstel found that the number of erasures can be linearly limited if the grammar is in Greibach normal form; Berstel and Boasson (and later, independently, Okhotin) proved a non-erasing variant of CST for grammars in Double Greibach Normal Form. In all these CST statements, how"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04003","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:16:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VlH9efVJ8ARp5XFsFYEnNOUD1gJhCwvTzxIZdUAlrLmW+KEZESZDxTMWX8J2fkDPcYblTdyAv34bEjNEAk9BBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T12:34:05.311764Z"},"content_sha256":"2cae32534c25ad1d6ee7fa51a842530610688290116b8d8826451dfbb17b2cae","schema_version":"1.0","event_id":"sha256:2cae32534c25ad1d6ee7fa51a842530610688290116b8d8826451dfbb17b2cae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMQLTONTUF4MA3QTZYV5V2GTCK/bundle.json","state_url":"https://pith.science/pith/HMQLTONTUF4MA3QTZYV5V2GTCK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMQLTONTUF4MA3QTZYV5V2GTCK/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-04T12:34:05Z","links":{"resolver":"https://pith.science/pith/HMQLTONTUF4MA3QTZYV5V2GTCK","bundle":"https://pith.science/pith/HMQLTONTUF4MA3QTZYV5V2GTCK/bundle.json","state":"https://pith.science/pith/HMQLTONTUF4MA3QTZYV5V2GTCK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMQLTONTUF4MA3QTZYV5V2GTCK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HMQLTONTUF4MA3QTZYV5V2GTCK","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":"6f7c39449a9b307acbdf80ca267763c71f51edbea2ca87ff74ead617a97e916b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.FL","submitted_at":"2018-05-10T14:33:02Z","title_canon_sha256":"ab1537715e1d8dabc8f208a3ad4cd1d749db7767ec4da7ef925642199c6dc9cb"},"schema_version":"1.0","source":{"id":"1805.04003","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.04003","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"arxiv_version","alias_value":"1805.04003v1","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04003","created_at":"2026-05-18T00:16:15Z"},{"alias_kind":"pith_short_12","alias_value":"HMQLTONTUF4M","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HMQLTONTUF4MA3QT","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HMQLTONT","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:2cae32534c25ad1d6ee7fa51a842530610688290116b8d8826451dfbb17b2cae","target":"graph","created_at":"2026-05-18T00:16:15Z","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":"The famous theorem by Chomsky and Sch\\\"utzenberger (CST) says that every context-free language $L$ over an alphabet $\\Sigma$ is representable as $h(D \\cap R)$, where $D$ is a Dyck language over a set $\\Omega$ of brackets, $R$ is a local language and $h$ is an alphabetic homomorphism that erases unboundedly many symbols. Berstel found that the number of erasures can be linearly limited if the grammar is in Greibach normal form; Berstel and Boasson (and later, independently, Okhotin) proved a non-erasing variant of CST for grammars in Double Greibach Normal Form. In all these CST statements, how","authors_text":"Pierluigi San Pietro, Stefano Crespi Reghizzi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.FL","submitted_at":"2018-05-10T14:33:02Z","title":"Non-erasing Chomsky-Sch{\\\"u}tzenberger theorem with grammar-independent alphabet"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04003","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:3b9b6e293e3f50bcd9029186a25380467db4d82d6fdcf786cb41556bed61a333","target":"record","created_at":"2026-05-18T00:16:15Z","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":"6f7c39449a9b307acbdf80ca267763c71f51edbea2ca87ff74ead617a97e916b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.FL","submitted_at":"2018-05-10T14:33:02Z","title_canon_sha256":"ab1537715e1d8dabc8f208a3ad4cd1d749db7767ec4da7ef925642199c6dc9cb"},"schema_version":"1.0","source":{"id":"1805.04003","kind":"arxiv","version":1}},"canonical_sha256":"3b20b9b9b3a178c06e13ce2bdae8d312833474256be5c79ecef64b1ec9e1704f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b20b9b9b3a178c06e13ce2bdae8d312833474256be5c79ecef64b1ec9e1704f","first_computed_at":"2026-05-18T00:16:15.280815Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:15.280815Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qnH6snn1K4boYUQs3TY1TerQApRwot1bWRE7E9bi/jhLvGq7aDuTysSXqg6kRi6RloZsVVLxrONm/XGcWwDjCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:15.281387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.04003","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3b9b6e293e3f50bcd9029186a25380467db4d82d6fdcf786cb41556bed61a333","sha256:2cae32534c25ad1d6ee7fa51a842530610688290116b8d8826451dfbb17b2cae"],"state_sha256":"e8df53db4e7ac54d7086cf572cf657e864b79907db9b592f04189a595e5cab07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"khqhLEfZqmvA8NKm7URi5YADXQf3Brb5DJ4fAwFBerC+wjhj8fNb3Af45dNlRks9G4iWviZecQifRycHlfdbDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T12:34:05.313681Z","bundle_sha256":"cbae0595966ad1efff403e516e8530b2b7a3a435c6605956ace1d84527b543a8"}}