{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:Q3PFVDE6IAVMWHP2EMWZZN7O3P","short_pith_number":"pith:Q3PFVDE6","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"},"canonical_sha256":"86de5a8c9e402acb1dfa232d9cb7eedbf7416fb39eb63cfc255dc048f44ca1cf","source":{"kind":"arxiv","id":"1404.2409","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2409","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2409v1","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2409","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"pith_short_12","alias_value":"Q3PFVDE6IAVM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q3PFVDE6IAVMWHP2","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q3PFVDE6","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:Q3PFVDE6IAVMWHP2EMWZZN7O3P","target":"record","payload":{"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"},"canonical_sha256":"86de5a8c9e402acb1dfa232d9cb7eedbf7416fb39eb63cfc255dc048f44ca1cf","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"},"source_kind":"arxiv","source_id":"1404.2409","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-18T02:54:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vj4eQW6ZuHK4a2qwbPPxIK9KEq2lRNdMIDg63fQtfEN7fMk6uwMr52cmLluH9vqxG6dcPl0uzgogSalyMkbtCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:47:01.503351Z"},"content_sha256":"431826a5b39aec1d638e11c97e3ba6e97740cb2c1725ed60059dfbd8ee245e84","schema_version":"1.0","event_id":"sha256:431826a5b39aec1d638e11c97e3ba6e97740cb2c1725ed60059dfbd8ee245e84"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:Q3PFVDE6IAVMWHP2EMWZZN7O3P","target":"graph","payload":{"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"},"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-18T02:54:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aatNiLJ+VMGegQ/Yg/lUuL1wZK3T4+G43Vct/XBIq+WMX8EfPW1ZJgbNcF05TSU02TYoXalBm8MCKTynAboPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T08:47:01.503696Z"},"content_sha256":"5346019e265b760c0db1b0a570b62e030f79211e422bade004c8227490cff89e","schema_version":"1.0","event_id":"sha256:5346019e265b760c0db1b0a570b62e030f79211e422bade004c8227490cff89e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q3PFVDE6IAVMWHP2EMWZZN7O3P/bundle.json","state_url":"https://pith.science/pith/Q3PFVDE6IAVMWHP2EMWZZN7O3P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q3PFVDE6IAVMWHP2EMWZZN7O3P/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-20T08:47:01Z","links":{"resolver":"https://pith.science/pith/Q3PFVDE6IAVMWHP2EMWZZN7O3P","bundle":"https://pith.science/pith/Q3PFVDE6IAVMWHP2EMWZZN7O3P/bundle.json","state":"https://pith.science/pith/Q3PFVDE6IAVMWHP2EMWZZN7O3P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q3PFVDE6IAVMWHP2EMWZZN7O3P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:Q3PFVDE6IAVMWHP2EMWZZN7O3P","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":"6ed4d07d8a547c26d6c028a79146d6bd7182989e71e8e1a963ca0288668189ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-09T09:41:01Z","title_canon_sha256":"7b268f55f046b0f3f0efd85eee051920aa763a5bd7f3f8449c24a877977ce737"},"schema_version":"1.0","source":{"id":"1404.2409","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2409","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2409v1","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2409","created_at":"2026-05-18T02:54:31Z"},{"alias_kind":"pith_short_12","alias_value":"Q3PFVDE6IAVM","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"Q3PFVDE6IAVMWHP2","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"Q3PFVDE6","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:5346019e265b760c0db1b0a570b62e030f79211e422bade004c8227490cff89e","target":"graph","created_at":"2026-05-18T02:54:31Z","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":"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","authors_text":"Gabriel Istrate, Mircea Marin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-09T09:41:01Z","title":"Learning cover context-free grammars from structural data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2409","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:431826a5b39aec1d638e11c97e3ba6e97740cb2c1725ed60059dfbd8ee245e84","target":"record","created_at":"2026-05-18T02:54:31Z","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":"6ed4d07d8a547c26d6c028a79146d6bd7182989e71e8e1a963ca0288668189ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-09T09:41:01Z","title_canon_sha256":"7b268f55f046b0f3f0efd85eee051920aa763a5bd7f3f8449c24a877977ce737"},"schema_version":"1.0","source":{"id":"1404.2409","kind":"arxiv","version":1}},"canonical_sha256":"86de5a8c9e402acb1dfa232d9cb7eedbf7416fb39eb63cfc255dc048f44ca1cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86de5a8c9e402acb1dfa232d9cb7eedbf7416fb39eb63cfc255dc048f44ca1cf","first_computed_at":"2026-05-18T02:54:31.589277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:31.589277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I8HAgfd8pmptvNHhFHcLM+BMN5pPSsvECvBJq8pU/54h/K+IMW7/DEaNQSl1C52AkP48QcZRJQzQX/bQ8M4HDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:31.589989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.2409","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:431826a5b39aec1d638e11c97e3ba6e97740cb2c1725ed60059dfbd8ee245e84","sha256:5346019e265b760c0db1b0a570b62e030f79211e422bade004c8227490cff89e"],"state_sha256":"a43872a75e551e9013e2e69ad4ac6425d936bae60b25fc7b0e4e5bd267761f9d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jBEo+CSS8h6xwT+Edm7RWFQqL3XgzfKWFeW/yqDB0Re997gGxM997IL5OPrMo3vMdDuy2nR0Ct1NV81nuHmpCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T08:47:01.505552Z","bundle_sha256":"03dbdb494874f8a84ba170d81e155b868584f1b7dfbd5ecaa2b6bf84bf3629e7"}}