{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:A4Z4K6DEUH5GMDM2LYBBPM3KNP","short_pith_number":"pith:A4Z4K6DE","schema_version":"1.0","canonical_sha256":"0733c57864a1fa660d9a5e0217b36a6bcb6995a57f1eba59b98f6bb2d96df730","source":{"kind":"arxiv","id":"1407.1513","version":1},"attestation_state":"computed","paper":{"title":"On the Computation of Distances for Probabilistic Context-Free Grammars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Colin de la Higuera, James Scicluna, Mark-Jan Nederhof","submitted_at":"2014-07-06T16:26:57Z","abstract_excerpt":"Probabilistic context-free grammars (PCFGs) are used to define distributions over strings, and are powerful modelling tools in a number of areas, including natural language processing, software engineering, model checking, bio-informatics, and pattern recognition. A common important question is that of comparing the distributions generated or modelled by these grammars: this is done through checking language equivalence and computing distances. Two PCFGs are language equivalent if every string has identical probability with both grammars. This also means that the distance (whichever norm is us"},"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":"1407.1513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-07-06T16:26:57Z","cross_cats_sorted":[],"title_canon_sha256":"8870fb1fbf6afd8bce818f1bc391ffd95b6717d604156bd11015f6d38cb25633","abstract_canon_sha256":"bb552b16c3957dbb1ccfef9bf4dfc59aa23de713e89f71e180bfb1cb8f2d0c0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:16.369487Z","signature_b64":"TKKyUH3prwyCEFE7Arva7euMKuNc4MOeZjHrCvWaznjaB/yS5tW05YoAcyQ69NMGrYbxPMgbsIrHteQ2rxpaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0733c57864a1fa660d9a5e0217b36a6bcb6995a57f1eba59b98f6bb2d96df730","last_reissued_at":"2026-05-18T02:48:16.368994Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:16.368994Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Computation of Distances for Probabilistic Context-Free Grammars","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Colin de la Higuera, James Scicluna, Mark-Jan Nederhof","submitted_at":"2014-07-06T16:26:57Z","abstract_excerpt":"Probabilistic context-free grammars (PCFGs) are used to define distributions over strings, and are powerful modelling tools in a number of areas, including natural language processing, software engineering, model checking, bio-informatics, and pattern recognition. A common important question is that of comparing the distributions generated or modelled by these grammars: this is done through checking language equivalence and computing distances. Two PCFGs are language equivalent if every string has identical probability with both grammars. This also means that the distance (whichever norm is us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1513","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":"1407.1513","created_at":"2026-05-18T02:48:16.369067+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.1513v1","created_at":"2026-05-18T02:48:16.369067+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1513","created_at":"2026-05-18T02:48:16.369067+00:00"},{"alias_kind":"pith_short_12","alias_value":"A4Z4K6DEUH5G","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"A4Z4K6DEUH5GMDM2","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"A4Z4K6DE","created_at":"2026-05-18T12:28:19.803747+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.23267","citing_title":"Fine-tuning vs. In-context Learning in Large Language Models: A Formal Language Learning Perspective","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2604.23267","citing_title":"Fine-tuning vs. In-context Learning in Large Language Models: A Formal Language Learning Perspective","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A4Z4K6DEUH5GMDM2LYBBPM3KNP","json":"https://pith.science/pith/A4Z4K6DEUH5GMDM2LYBBPM3KNP.json","graph_json":"https://pith.science/api/pith-number/A4Z4K6DEUH5GMDM2LYBBPM3KNP/graph.json","events_json":"https://pith.science/api/pith-number/A4Z4K6DEUH5GMDM2LYBBPM3KNP/events.json","paper":"https://pith.science/paper/A4Z4K6DE"},"agent_actions":{"view_html":"https://pith.science/pith/A4Z4K6DEUH5GMDM2LYBBPM3KNP","download_json":"https://pith.science/pith/A4Z4K6DEUH5GMDM2LYBBPM3KNP.json","view_paper":"https://pith.science/paper/A4Z4K6DE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.1513&json=true","fetch_graph":"https://pith.science/api/pith-number/A4Z4K6DEUH5GMDM2LYBBPM3KNP/graph.json","fetch_events":"https://pith.science/api/pith-number/A4Z4K6DEUH5GMDM2LYBBPM3KNP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A4Z4K6DEUH5GMDM2LYBBPM3KNP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A4Z4K6DEUH5GMDM2LYBBPM3KNP/action/storage_attestation","attest_author":"https://pith.science/pith/A4Z4K6DEUH5GMDM2LYBBPM3KNP/action/author_attestation","sign_citation":"https://pith.science/pith/A4Z4K6DEUH5GMDM2LYBBPM3KNP/action/citation_signature","submit_replication":"https://pith.science/pith/A4Z4K6DEUH5GMDM2LYBBPM3KNP/action/replication_record"}},"created_at":"2026-05-18T02:48:16.369067+00:00","updated_at":"2026-05-18T02:48:16.369067+00:00"}