{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:V7KQKJ3CU2TLFGBFWREG6E7BVI","short_pith_number":"pith:V7KQKJ3C","schema_version":"1.0","canonical_sha256":"afd5052762a6a6b29825b4486f13e1aa1dff83414560482dacf88b9f5caf365a","source":{"kind":"arxiv","id":"2510.08127","version":2},"attestation_state":"computed","paper":{"title":"On the Complexity of Language Membership for Probabilistic Words","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Antoine Amarilli, Mika\\\"el Monet, Paul Rapha\\\"el, Sylvain Salvati","submitted_at":"2025-10-09T12:13:34Z","abstract_excerpt":"We study the membership problem to context-free languages (CFLs) on probabilistic words, that specify for each position a probability distribution on the letters. Our task is to compute, given a probabilistic word, what is the probability that a word drawn according to the distribution belongs to the language $L$. This problem generalizes the problem of counting how many words of length $n$ belong to $L$, or of counting how many completions of a partial word belong to $L$.\n  We show that this problem is in polynomial time for unambiguous context-free languages (uCFLs), but can be #P-hard alrea"},"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":"2510.08127","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2025-10-09T12:13:34Z","cross_cats_sorted":[],"title_canon_sha256":"fd7ea8d5e43b21946b92d4675201ffc01ed935c4b10892c0680b5eb38fca9912","abstract_canon_sha256":"249c7b13a10f57a3940066d2ffccc86c51fd1d3681e8648627ffd7055c625214"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:13:48.708293Z","signature_b64":"zuxulUFKhcIdv5rvKSYkStLUvbY2zpOEvN8AFCmv6fmcpBi9+brW0wfAAZWcThGvUmsHKK/sr+fn1vPpZjitCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"afd5052762a6a6b29825b4486f13e1aa1dff83414560482dacf88b9f5caf365a","last_reissued_at":"2026-06-23T03:13:48.707851Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:13:48.707851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Language Membership for Probabilistic Words","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Antoine Amarilli, Mika\\\"el Monet, Paul Rapha\\\"el, Sylvain Salvati","submitted_at":"2025-10-09T12:13:34Z","abstract_excerpt":"We study the membership problem to context-free languages (CFLs) on probabilistic words, that specify for each position a probability distribution on the letters. Our task is to compute, given a probabilistic word, what is the probability that a word drawn according to the distribution belongs to the language $L$. This problem generalizes the problem of counting how many words of length $n$ belong to $L$, or of counting how many completions of a partial word belong to $L$.\n  We show that this problem is in polynomial time for unambiguous context-free languages (uCFLs), but can be #P-hard alrea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2510.08127","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2510.08127/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2510.08127","created_at":"2026-06-23T03:13:48.707909+00:00"},{"alias_kind":"arxiv_version","alias_value":"2510.08127v2","created_at":"2026-06-23T03:13:48.707909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2510.08127","created_at":"2026-06-23T03:13:48.707909+00:00"},{"alias_kind":"pith_short_12","alias_value":"V7KQKJ3CU2TL","created_at":"2026-06-23T03:13:48.707909+00:00"},{"alias_kind":"pith_short_16","alias_value":"V7KQKJ3CU2TLFGBF","created_at":"2026-06-23T03:13:48.707909+00:00"},{"alias_kind":"pith_short_8","alias_value":"V7KQKJ3C","created_at":"2026-06-23T03:13:48.707909+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/V7KQKJ3CU2TLFGBFWREG6E7BVI","json":"https://pith.science/pith/V7KQKJ3CU2TLFGBFWREG6E7BVI.json","graph_json":"https://pith.science/api/pith-number/V7KQKJ3CU2TLFGBFWREG6E7BVI/graph.json","events_json":"https://pith.science/api/pith-number/V7KQKJ3CU2TLFGBFWREG6E7BVI/events.json","paper":"https://pith.science/paper/V7KQKJ3C"},"agent_actions":{"view_html":"https://pith.science/pith/V7KQKJ3CU2TLFGBFWREG6E7BVI","download_json":"https://pith.science/pith/V7KQKJ3CU2TLFGBFWREG6E7BVI.json","view_paper":"https://pith.science/paper/V7KQKJ3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2510.08127&json=true","fetch_graph":"https://pith.science/api/pith-number/V7KQKJ3CU2TLFGBFWREG6E7BVI/graph.json","fetch_events":"https://pith.science/api/pith-number/V7KQKJ3CU2TLFGBFWREG6E7BVI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V7KQKJ3CU2TLFGBFWREG6E7BVI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V7KQKJ3CU2TLFGBFWREG6E7BVI/action/storage_attestation","attest_author":"https://pith.science/pith/V7KQKJ3CU2TLFGBFWREG6E7BVI/action/author_attestation","sign_citation":"https://pith.science/pith/V7KQKJ3CU2TLFGBFWREG6E7BVI/action/citation_signature","submit_replication":"https://pith.science/pith/V7KQKJ3CU2TLFGBFWREG6E7BVI/action/replication_record"}},"created_at":"2026-06-23T03:13:48.707909+00:00","updated_at":"2026-06-23T03:13:48.707909+00:00"}