{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:G5ZAJXIVSPXEF6ZPW4VNTUHGMV","short_pith_number":"pith:G5ZAJXIV","schema_version":"1.0","canonical_sha256":"377204dd1593ee42fb2fb72ad9d0e6656545f0190fbc38df80267fab9f645bb0","source":{"kind":"arxiv","id":"1302.6411","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Context-Free Grammars, Regular Languages, and Newton's Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"Alistair Stewart, Kousha Etessami, Mihalis Yannakakis","submitted_at":"2013-02-26T12:19:51Z","abstract_excerpt":"We study the problem of computing the probability that a given stochastic context-free grammar (SCFG), G, generates a string in a given regular language L(D) (given by a DFA, D). This basic problem has a number of applications in statistical natural language processing, and it is also a key necessary step towards quantitative \\omega-regular model checking of stochastic context-free processes (equivalently, 1-exit recursive Markov chains, or stateless probabilistic pushdown processes).\n  We show that the probability that G generates a string in L(D) can be computed to within arbitrary desired p"},"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":"1302.6411","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-02-26T12:19:51Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5b0c985444f88593cd6ace46ef1993b89845d054e953ca5d381e574ebab2c4b8","abstract_canon_sha256":"8d04749ba347fb97c81e4214c59c4a076d9ea73456eb9112b718a2d8e27c2e87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:29.333134Z","signature_b64":"JmBY0nyLUUaY1BR65rZq/9JORnbR8SRidUw5iaCe69I9kYoRJG6s61SRgXtmCa9DmOcaSKUhoK5mGIBqJGieDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"377204dd1593ee42fb2fb72ad9d0e6656545f0190fbc38df80267fab9f645bb0","last_reissued_at":"2026-05-18T03:32:29.332615Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:29.332615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Context-Free Grammars, Regular Languages, and Newton's Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.FL","authors_text":"Alistair Stewart, Kousha Etessami, Mihalis Yannakakis","submitted_at":"2013-02-26T12:19:51Z","abstract_excerpt":"We study the problem of computing the probability that a given stochastic context-free grammar (SCFG), G, generates a string in a given regular language L(D) (given by a DFA, D). This basic problem has a number of applications in statistical natural language processing, and it is also a key necessary step towards quantitative \\omega-regular model checking of stochastic context-free processes (equivalently, 1-exit recursive Markov chains, or stateless probabilistic pushdown processes).\n  We show that the probability that G generates a string in L(D) can be computed to within arbitrary desired p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6411","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":"1302.6411","created_at":"2026-05-18T03:32:29.332693+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.6411v1","created_at":"2026-05-18T03:32:29.332693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6411","created_at":"2026-05-18T03:32:29.332693+00:00"},{"alias_kind":"pith_short_12","alias_value":"G5ZAJXIVSPXE","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"G5ZAJXIVSPXEF6ZP","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"G5ZAJXIV","created_at":"2026-05-18T12:27:45.050594+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/G5ZAJXIVSPXEF6ZPW4VNTUHGMV","json":"https://pith.science/pith/G5ZAJXIVSPXEF6ZPW4VNTUHGMV.json","graph_json":"https://pith.science/api/pith-number/G5ZAJXIVSPXEF6ZPW4VNTUHGMV/graph.json","events_json":"https://pith.science/api/pith-number/G5ZAJXIVSPXEF6ZPW4VNTUHGMV/events.json","paper":"https://pith.science/paper/G5ZAJXIV"},"agent_actions":{"view_html":"https://pith.science/pith/G5ZAJXIVSPXEF6ZPW4VNTUHGMV","download_json":"https://pith.science/pith/G5ZAJXIVSPXEF6ZPW4VNTUHGMV.json","view_paper":"https://pith.science/paper/G5ZAJXIV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.6411&json=true","fetch_graph":"https://pith.science/api/pith-number/G5ZAJXIVSPXEF6ZPW4VNTUHGMV/graph.json","fetch_events":"https://pith.science/api/pith-number/G5ZAJXIVSPXEF6ZPW4VNTUHGMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G5ZAJXIVSPXEF6ZPW4VNTUHGMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G5ZAJXIVSPXEF6ZPW4VNTUHGMV/action/storage_attestation","attest_author":"https://pith.science/pith/G5ZAJXIVSPXEF6ZPW4VNTUHGMV/action/author_attestation","sign_citation":"https://pith.science/pith/G5ZAJXIVSPXEF6ZPW4VNTUHGMV/action/citation_signature","submit_replication":"https://pith.science/pith/G5ZAJXIVSPXEF6ZPW4VNTUHGMV/action/replication_record"}},"created_at":"2026-05-18T03:32:29.332693+00:00","updated_at":"2026-05-18T03:32:29.332693+00:00"}