{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SCBT3F6K2U5CVOY6EHU7ZPBGU7","short_pith_number":"pith:SCBT3F6K","schema_version":"1.0","canonical_sha256":"90833d97cad53a2abb1e21e9fcbc26a7c9d3fbaa768a14cffbfbd5963d3b773d","source":{"kind":"arxiv","id":"1510.04748","version":1},"attestation_state":"computed","paper":{"title":"Formalization of the pumping lemma for context-free languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Jos\\'e Carlos Bacelar Almeida, Marcus V. M. Ramos, Nelma Moreira, Ruy J. G. B. de Queiroz","submitted_at":"2015-10-16T00:02:47Z","abstract_excerpt":"Context-free languages (CFLs) are highly important in computer language processing technology as well as in formal language theory. The Pumping Lemma is a property that is valid for all context-free languages, and is used to show the existence of non context-free languages. This paper presents a formalization, using the Coq proof assistant, of the Pumping Lemma for context-free languages."},"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":"1510.04748","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-10-16T00:02:47Z","cross_cats_sorted":[],"title_canon_sha256":"cd260b4ef43d0d01f5ec7acd08699359a62d5e783ac6e9eb6ca8b0e9a0f71916","abstract_canon_sha256":"3bce7e4f96a29615c94507e231e6990dd2d5bd711c57d29bad57807be17e695a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:01.570237Z","signature_b64":"fSrcmAHkUaN/s9Vix++Ka4ksYEdAw49hQWa7BiLomo859ZWpS11pgEp9PYTcEza9hyXdxj5u/U9h7wCqoYw6DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90833d97cad53a2abb1e21e9fcbc26a7c9d3fbaa768a14cffbfbd5963d3b773d","last_reissued_at":"2026-05-18T01:30:01.569611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:01.569611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formalization of the pumping lemma for context-free languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Jos\\'e Carlos Bacelar Almeida, Marcus V. M. Ramos, Nelma Moreira, Ruy J. G. B. de Queiroz","submitted_at":"2015-10-16T00:02:47Z","abstract_excerpt":"Context-free languages (CFLs) are highly important in computer language processing technology as well as in formal language theory. The Pumping Lemma is a property that is valid for all context-free languages, and is used to show the existence of non context-free languages. This paper presents a formalization, using the Coq proof assistant, of the Pumping Lemma for context-free languages."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.04748","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":"1510.04748","created_at":"2026-05-18T01:30:01.569694+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.04748v1","created_at":"2026-05-18T01:30:01.569694+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.04748","created_at":"2026-05-18T01:30:01.569694+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCBT3F6K2U5C","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCBT3F6K2U5CVOY6","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCBT3F6K","created_at":"2026-05-18T12:29:39.896362+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/SCBT3F6K2U5CVOY6EHU7ZPBGU7","json":"https://pith.science/pith/SCBT3F6K2U5CVOY6EHU7ZPBGU7.json","graph_json":"https://pith.science/api/pith-number/SCBT3F6K2U5CVOY6EHU7ZPBGU7/graph.json","events_json":"https://pith.science/api/pith-number/SCBT3F6K2U5CVOY6EHU7ZPBGU7/events.json","paper":"https://pith.science/paper/SCBT3F6K"},"agent_actions":{"view_html":"https://pith.science/pith/SCBT3F6K2U5CVOY6EHU7ZPBGU7","download_json":"https://pith.science/pith/SCBT3F6K2U5CVOY6EHU7ZPBGU7.json","view_paper":"https://pith.science/paper/SCBT3F6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.04748&json=true","fetch_graph":"https://pith.science/api/pith-number/SCBT3F6K2U5CVOY6EHU7ZPBGU7/graph.json","fetch_events":"https://pith.science/api/pith-number/SCBT3F6K2U5CVOY6EHU7ZPBGU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCBT3F6K2U5CVOY6EHU7ZPBGU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCBT3F6K2U5CVOY6EHU7ZPBGU7/action/storage_attestation","attest_author":"https://pith.science/pith/SCBT3F6K2U5CVOY6EHU7ZPBGU7/action/author_attestation","sign_citation":"https://pith.science/pith/SCBT3F6K2U5CVOY6EHU7ZPBGU7/action/citation_signature","submit_replication":"https://pith.science/pith/SCBT3F6K2U5CVOY6EHU7ZPBGU7/action/replication_record"}},"created_at":"2026-05-18T01:30:01.569694+00:00","updated_at":"2026-05-18T01:30:01.569694+00:00"}