{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:Q3PFVDE6IAVMWHP2EMWZZN7O3P","short_pith_number":"pith:Q3PFVDE6","schema_version":"1.0","canonical_sha256":"86de5a8c9e402acb1dfa232d9cb7eedbf7416fb39eb63cfc255dc048f44ca1cf","source":{"kind":"arxiv","id":"1404.2409","version":1},"attestation_state":"computed","paper":{"title":"Learning cover context-free grammars from structural data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Gabriel Istrate, Mircea Marin","submitted_at":"2014-04-09T09:41:01Z","abstract_excerpt":"We consider the problem of learning an unknown context-free grammar when the only knowledge available and of interest to the learner is about its structural descriptions with depth at most $\\ell.$ The goal is to learn a cover context-free grammar (CCFG) with respect to $\\ell$, that is, a CFG whose structural descriptions with depth at most $\\ell$ agree with those of the unknown CFG. We propose an algorithm, called $LA^\\ell$, that efficiently learns a CCFG using two types of queries: structural equivalence and structural membership. We show that $LA^\\ell$ runs in time polynomial in the number o"},"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":"1404.2409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-09T09:41:01Z","cross_cats_sorted":[],"title_canon_sha256":"7b268f55f046b0f3f0efd85eee051920aa763a5bd7f3f8449c24a877977ce737","abstract_canon_sha256":"6ed4d07d8a547c26d6c028a79146d6bd7182989e71e8e1a963ca0288668189ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:31.589989Z","signature_b64":"I8HAgfd8pmptvNHhFHcLM+BMN5pPSsvECvBJq8pU/54h/K+IMW7/DEaNQSl1C52AkP48QcZRJQzQX/bQ8M4HDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86de5a8c9e402acb1dfa232d9cb7eedbf7416fb39eb63cfc255dc048f44ca1cf","last_reissued_at":"2026-05-18T02:54:31.589277Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:31.589277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning cover context-free grammars from structural data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Gabriel Istrate, Mircea Marin","submitted_at":"2014-04-09T09:41:01Z","abstract_excerpt":"We consider the problem of learning an unknown context-free grammar when the only knowledge available and of interest to the learner is about its structural descriptions with depth at most $\\ell.$ The goal is to learn a cover context-free grammar (CCFG) with respect to $\\ell$, that is, a CFG whose structural descriptions with depth at most $\\ell$ agree with those of the unknown CFG. We propose an algorithm, called $LA^\\ell$, that efficiently learns a CCFG using two types of queries: structural equivalence and structural membership. We show that $LA^\\ell$ runs in time polynomial in the number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2409","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":"1404.2409","created_at":"2026-05-18T02:54:31.589401+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.2409v1","created_at":"2026-05-18T02:54:31.589401+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2409","created_at":"2026-05-18T02:54:31.589401+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q3PFVDE6IAVM","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q3PFVDE6IAVMWHP2","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q3PFVDE6","created_at":"2026-05-18T12:28:43.426989+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/Q3PFVDE6IAVMWHP2EMWZZN7O3P","json":"https://pith.science/pith/Q3PFVDE6IAVMWHP2EMWZZN7O3P.json","graph_json":"https://pith.science/api/pith-number/Q3PFVDE6IAVMWHP2EMWZZN7O3P/graph.json","events_json":"https://pith.science/api/pith-number/Q3PFVDE6IAVMWHP2EMWZZN7O3P/events.json","paper":"https://pith.science/paper/Q3PFVDE6"},"agent_actions":{"view_html":"https://pith.science/pith/Q3PFVDE6IAVMWHP2EMWZZN7O3P","download_json":"https://pith.science/pith/Q3PFVDE6IAVMWHP2EMWZZN7O3P.json","view_paper":"https://pith.science/paper/Q3PFVDE6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.2409&json=true","fetch_graph":"https://pith.science/api/pith-number/Q3PFVDE6IAVMWHP2EMWZZN7O3P/graph.json","fetch_events":"https://pith.science/api/pith-number/Q3PFVDE6IAVMWHP2EMWZZN7O3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q3PFVDE6IAVMWHP2EMWZZN7O3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q3PFVDE6IAVMWHP2EMWZZN7O3P/action/storage_attestation","attest_author":"https://pith.science/pith/Q3PFVDE6IAVMWHP2EMWZZN7O3P/action/author_attestation","sign_citation":"https://pith.science/pith/Q3PFVDE6IAVMWHP2EMWZZN7O3P/action/citation_signature","submit_replication":"https://pith.science/pith/Q3PFVDE6IAVMWHP2EMWZZN7O3P/action/replication_record"}},"created_at":"2026-05-18T02:54:31.589401+00:00","updated_at":"2026-05-18T02:54:31.589401+00:00"}