{"as_of":"2026-08-13T01:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7e78b6d240771a3bdde908656203979d0121de44dbd02f45ced3e2e5404526d7","coverage":[{"denominator":86,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":86,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T10:57:33.053632Z","state":"measured"},{"denominator":86,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":86,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2510.08127/citation-record","integrity":"/paper/2510.08127/integrity","json":"/paper/2510.08127/citation-record.json","paper":"/paper/2510.08127"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:23.678326Z","title":"If the current clique algorithms are optimal, so is V aliant's parser","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:23.678326Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:5b96beb542507e813e256cb22af3076d9f44b7d1e763b5459ecfa3d511dc75bb","observation_id":"102b2ff1-4dcb-4d6c-82e3-3f704d677391","resolution":{"observed_at":"2026-08-04T10:57:23.678326Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:23.749927Z","title":"A very hard log-space counting class","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:23.749927Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:c94fc0216af226eea8793a10617c2bad3c576b786148388d672d26276cf2e23d","observation_id":"73321dae-e494-4d56-903e-7a74cb280f2b","resolution":{"observed_at":"2026-08-04T10:57:23.749927Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:23.835756Z","title":"Context-free grammars where every word has exactly two derivation trees","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:23.835756Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:3d6aab4759414371abf625f4269309be2a41c296657505ec4f206610f16e71e4","observation_id":"bd251001-0dbe-4d13-9a1e-56e67e9546ea","resolution":{"observed_at":"2026-08-04T10:57:23.835756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:23.974945Z","title":"Tractable circuits in database theory","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:23.974945Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:fbb1033697f11b6640a254fd88a1503605880a62330b87adced3da52152d223c","observation_id":"ef01f5c5-8e63-413d-bc35-786f6a32e0d4","resolution":{"observed_at":"2026-08-04T10:57:23.974945Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2201.00549","last_updated":"2022-05-17T16:00:55Z","snapshot_observed_at":"2026-08-12T13:59:09.228445Z","submitted_at":"2022-01-03T09:41:09Z","title":"Efficient Enumeration Algorithms for Annotated Grammars","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2201.00549","snapshot_observed_at":"2026-08-04T10:57:24.087188Z","title":"https://arxiv.org/abs/2201.00549 Efficient enumeration algorithms for annotated grammars","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:24.087188Z"},"links":{"cited_paper":"/paper/2201.00549","citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:4717db5e412c08207fc36db9a57feeddb6e9a696b99a16d40de05884ada52fe2","observation_id":"4482c865-2296-470e-8f6c-88b21e409ce7","resolution":{"observed_at":"2026-08-04T10:57:24.087188Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.16210","last_updated":"2024-01-29T15:03:23Z","snapshot_observed_at":"2026-08-07T00:49:59.954763Z","submitted_at":"2024-01-29T15:03:23Z","title":"The Non-Cancelling Intersections Conjecture","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.16210","snapshot_observed_at":"2026-08-04T10:57:24.203090Z","title":"https://arxiv.org/abs/2401.16210 The non-cancelling intersections conjecture","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:24.203090Z"},"links":{"cited_paper":"/paper/2401.16210","citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:0d0bfd7f3ac5e5f12f96af8103caca5a734f39b782ce0ccdb5ca1adb920ec029","observation_id":"bbb0e49a-0a22-458f-a156-59052d57ca82","resolution":{"observed_at":"2026-08-04T10:57:24.203090Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:24.303300Z","title":"\\# NFA admits an FPRAS : E fficient enumeration, counting, and uniform generation for logspace classes","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:24.303300Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:a028529eb8f6c005c8a825186ee2198ed977badf386bf13d3aa168b41fc86bc9","observation_id":"29d6789b-3408-47fa-a715-1b47c881fa95","resolution":{"observed_at":"2026-08-04T10:57:24.303300Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:24.413207Z","title":"Baker and Ronald V","venue":null,"work_id":null,"year":1974},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:24.413207Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:0b2f513cb99cf792551ee78be7c03e0736a310fb82d053b022fc3db44fd26f7a","observation_id":"a6d6b634-69a2-4dd2-8ae2-0a43b504e640","resolution":{"observed_at":"2026-08-04T10:57:24.413207Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:24.492684Z","title":"Berstel and L","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:24.492684Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:832170d00780a680214348f53e427ce4c387c047429ddb7e4b47256bcf99517b","observation_id":"8990cf20-837b-4d7f-876d-21852826678f","resolution":{"observed_at":"2026-08-04T10:57:24.492684Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:24.554450Z","title":"Partial words and a theorem of F ine and W ilf","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:24.554450Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:6beb81a487033d59fd4a4be2459162a5b0f0a7afff87d07f2259d2d404a4e7c2","observation_id":"04364c66-3075-4c44-8731-2f9a057555ee","resolution":{"observed_at":"2026-08-04T10:57:24.554450Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:24.664829Z","title":"Ranking and formal power series","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:24.664829Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:04f057579a29b89a588702ed38ee712fa4587ba33c99e53637160b9f9ae6793c","observation_id":"4d15d98b-a7dd-41c1-b08f-d3d2f67838a5","resolution":{"observed_at":"2026-08-04T10:57:24.664829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:24.737833Z","title":"The complexity of computing the number of strings of given length in context-free languages","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:24.737833Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:84dbb74b54630017fbc916f3bdc1194d1a7605c32058073e9fe6a8883d6f094f","observation_id":"276247f8-9ea7-4ffc-bc89-4f2f608d319a","resolution":{"observed_at":"2026-08-04T10:57:24.737833Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:24.853432Z","title":"Random generation for finitely ambiguous context-free languages","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:24.853432Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:c7de11694eedee6d936d69b8c85497b57828c014e1576ad64f5d43e3bf55ad1f","observation_id":"dc680765-3aee-4223-9fa1-a58ddd6fbda5","resolution":{"observed_at":"2026-08-04T10:57:24.853432Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:24.890756Z","title":"Counting distinct squares in partial words","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:24.890756Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:ad8058510f8f781ef12bbcb47fecb776ba6bc8f30ad4bd4697eaf180c62ed65f","observation_id":"1b2bad43-9c2c-47a4-95d7-3f9565bf0a43","resolution":{"observed_at":"2026-08-04T10:57:24.890756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:24.966305Z","title":"Words with many palindrome pair factors","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:24.966305Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:5fb1299ed5fe841afecce81cedb7ecd679477fd8aac260b2680ec20d93f1261e","observation_id":"3b81bd10-0543-44d8-80f2-e76620214681","resolution":{"observed_at":"2026-08-04T10:57:24.966305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:25.045972Z","title":"On the palindromic complexity of infinite words","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:25.045972Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:e88f8237716a6a8409b2e63403d34a69e625b07fd97728f6315367e7add5372d","observation_id":"95fb52e3-945f-4493-b32f-f9e4960437ba","resolution":{"observed_at":"2026-08-04T10:57:25.045972Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:25.187265Z","title":null,"venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:25.187265Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:6eb9cd4ec8ae5c9a166d112edf1daf90fba67b68b32025f6d6d48176445355c5","observation_id":"bb1f40e5-763e-4c3f-bc7f-fd90d84cad6b","resolution":{"observed_at":"2026-08-04T10:57:25.187265Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:25.291533Z","title":"P \\'e rez, and Ritam Raha","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:25.291533Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:e1be7400873f8762ed84bf87324b7a8458898888a994d06d96ee8cc024b5384b","observation_id":"57627dd7-4e1c-48af-9a23-95fd42677db1","resolution":{"observed_at":"2026-08-04T10:57:25.291533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.04667","last_updated":"2020-08-07T01:22:41Z","snapshot_observed_at":"2026-08-05T13:23:32.974911Z","submitted_at":"2020-08-07T01:22:41Z","title":"On the Complexity of the Universality and Inclusion Problems for Unambiguous Context-Free Grammars","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.04667","snapshot_observed_at":"2026-08-04T10:57:25.336561Z","title":"On the complexity of the universality and inclusion problems for unambiguous context-free grammars, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:25.336561Z"},"links":{"cited_paper":"/paper/2008.04667","citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:a64b35a148499b322a3c43105a79d4b7e9791b2e01a1f27383929e680460e4b0","observation_id":"5996fad0-a4b6-488e-b5be-47a903bea3c4","resolution":{"observed_at":"2026-08-04T10:57:25.336561Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:25.356246Z","title":"Separability of reachability sets of vector addition systems","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:25.356246Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:20df44555300aa217ab0dfc40f4f2edfb9df3b5b349db0f8322ed0be09b66837","observation_id":"a84c4a7e-b167-47c1-8823-2f7fa01f65b1","resolution":{"observed_at":"2026-08-04T10:57:25.356246Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:25.369334Z","title":"Unambiguity in automata theory","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:25.369334Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:e05655c3043a4fcd5752cb8c1b9d6f366cbf570e23dc7ffccadadbd57579dfde","observation_id":"34b12622-680d-458c-8d9f-69aeb6d4b366","resolution":{"observed_at":"2026-08-04T10:57:25.369334Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:25.491175Z","title":"Naive infinite enumeration of context-free languages in incremental polynomial time","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:25.491175Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:e94e93bce0ef4d859af9632240fa7ed29efe27a7fbf32aa948769e69b9a164aa","observation_id":"585fdf26-24a0-4a21-ad42-d12a31e4e0fd","resolution":{"observed_at":"2026-08-04T10:57:25.491175Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:25.631290Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:25.631290Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:f1c42a7c0d2725053111ca4ea54fa9bb347f7961df604eccdd7fe55166c8b6c8","observation_id":"27fa56d9-b5a2-45de-b2f4-7d3d948bbf96","resolution":{"observed_at":"2026-08-04T10:57:25.631290Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:25.710068Z","title":"An approach to regular separability in vector addition systems","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:25.710068Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:6b036ea9d7af2fdc253ae8ee288e34a62ea7a9e9b052c0344743c9caf51fd782","observation_id":"0cac8ef9-073b-4bc9-984d-819b3c97ad90","resolution":{"observed_at":"2026-08-04T10:57:25.710068Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:25.750518Z","title":"On the tractable counting of theory models and its application to truth maintenance and belief revision","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:25.750518Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:35414fe2fe6cc505ba3334f9e77be12407b9993634114e6d551457b23534ec29","observation_id":"a947b19a-d10c-4efa-9264-fa8341bc9e86","resolution":{"observed_at":"2026-08-04T10:57:25.750518Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:25.863726Z","title":"A knowledge compilation map","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:25.863726Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:cf4c01228edb2c6aa6d8795cc4c13feaedf21c61087aa047fccbb104b1d8a5ae","observation_id":"b5736a61-3a10-43c9-a833-0d41d0489e23","resolution":{"observed_at":"2026-08-04T10:57:25.863726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:25.963830Z","title":"On some combinatorial problems in free monoids","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:25.963830Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:f0c45b7187ebd46bbfee06bd143cfcaa6e5168a8fd35cc85beba049483f55674","observation_id":"e78f954d-f6bd-43fc-a551-04e6fb2600e3","resolution":{"observed_at":"2026-08-04T10:57:25.963830Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:26.107331Z","title":"Some combinatorial properties of sturmian words","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:26.107331Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:8300eb943f727d8e7e9956c3f289abecb8b0e72726294be672205551ab89d12e","observation_id":"ce59efa3-d8b1-4826-9ac4-bc012a631f4b","resolution":{"observed_at":"2026-08-04T10:57:26.107331Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:26.151355Z","title":"Unusual algorithms for lexicographical enumeration","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:26.151355Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:32714b5a5b30166acb5c09a3ca3ddf777bb07a685fdb6579161f37727bbe649d","observation_id":"d8b491ca-c77d-431a-baee-ca4bb77117a7","resolution":{"observed_at":"2026-08-04T10:57:26.151355Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:26.200751Z","title":"An efficient context-free parsing algorithm","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:26.200751Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:eb7c2f55eeb1b852f78c313293363c2fa1f485dbd4a1f970faf9fb20746b6a6b","observation_id":"7d9ffc3a-279c-4d71-a780-8c1068856be4","resolution":{"observed_at":"2026-08-04T10:57:26.200751Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10567","last_updated":"2024-07-15T09:30:31Z","snapshot_observed_at":"2026-08-12T23:22:10.938191Z","submitted_at":"2024-07-15T09:30:31Z","title":"PULPo: Probabilistic Unsupervised Laplacian Pyramid Registration","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10567","snapshot_observed_at":"2026-08-04T10:57:26.309993Z","title":"Some remarks on palindromic periodicities","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:26.309993Z"},"links":{"cited_paper":"/paper/2407.10567","citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:fa13020e8daf0b0d52f8a528f653a13d273711209616f03224693b32485773a3","observation_id":"998dae9c-9452-450b-97a4-596a25474ce3","resolution":{"observed_at":"2026-08-04T10:57:26.309993Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:26.389167Z","title":"Fischer, Albert R","venue":null,"work_id":null,"year":1968},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:26.389167Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:d8f1d144a86232d597d3f430353f7077edf643f5d229a8ebcdcb4e946b42c75a","observation_id":"02cf43b4-3d59-4d6d-88d1-7d728d66a9ae","resolution":{"observed_at":"2026-08-04T10:57:26.389167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:26.471532Z","title":"Frid, Svetlana Puzynina, and Luca Q","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:26.471532Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:317ebed13e3a5aa5d90f96568a664f66b94a291b3a51891a960b99422f561123","observation_id":"79cf9636-9848-4830-a6a2-0fce14801e9f","resolution":{"observed_at":"2026-08-04T10:57:26.471532Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:26.554990Z","title":"Deterministic context free languages","venue":null,"work_id":null,"year":1965},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:26.554990Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:01629bdab39d6f41468b5360405f964c7aa6119f5cd5d4a9889287be4f6d4a8f","observation_id":"be523167-7d5c-44f1-913a-8d26738dee39","resolution":{"observed_at":"2026-08-04T10:57:26.554990Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:26.613603Z","title":"Bounded algol-like languages","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:26.613603Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:15c21f80606b9e03506f936f4eadd7ad6379ff42588874290f235116c907c60b","observation_id":"44b578bb-ba59-4e99-a373-404abaf6ec20","resolution":{"observed_at":"2026-08-04T10:57:26.613603Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:26.662811Z","title":"Sweedyk, and Steve Mahaney","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:26.662811Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:ccbd9bd0900c97f5b724c7493a35a70abf5be1b93b560bed3d8d2b739d47168b","observation_id":"292a3ac7-2be0-4e9d-845f-f176618dfb34","resolution":{"observed_at":"2026-08-04T10:57:26.662811Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/bf01691341","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"A note on undecidable properties of formal languages https://doi.org/10.1007/BF01691341","venue":"Theory of Computing Systems","work_id":"15f4df8b-9630-4f09-8e6b-8b14b04f6a76","year":1968},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:26.798037Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:b42d78747140d8f59094de1eaca47b43bc696daf1aa1092b46926b5ff0aab346","observation_id":"f27a8673-86fd-4d4e-b768-22108d426ba9","resolution":{"observed_at":"2026-08-04T10:58:19.024265Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:26.928443Z","title":"Greibach","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:26.928443Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:cb8dc1b4f04ed43026b05ced0f1e4d0f1d2109df86c1fc488f33aa36856bb0a5","observation_id":"672f39ca-9d17-4cad-95ac-16f25d81836d","resolution":{"observed_at":"2026-08-04T10:57:26.928443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1503.09112","last_updated":"2015-03-31T16:26:13Z","snapshot_observed_at":"2026-07-06T04:13:42.631628Z","submitted_at":"2015-03-31T16:26:13Z","title":"On the Combinatorics of Palindromes and Antipalindromes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1503.09112","snapshot_observed_at":"2026-08-04T10:57:27.037818Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:27.037818Z"},"links":{"cited_paper":"/paper/1503.09112","citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:7513b53801d087b48d06aa6e661eb8f11e1d5111d8950f9e1a93eb2b05c861aa","observation_id":"682159a4-60c3-4cde-ab80-1b4499345bea","resolution":{"observed_at":"2026-08-04T10:57:27.037818Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:27.166938Z","title":"Hartmanis","venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:27.166938Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:5de3cd3e582fc4af746a0b821c1d9bae44c8f5561cbce793e399b3c8d391ecdc","observation_id":"f17d5209-e48b-48db-956a-301b5278904e","resolution":{"observed_at":"2026-08-04T10:57:27.166938Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:27.275606Z","title":"Hibbard and Joseph Ullian","venue":null,"work_id":null,"year":1966},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:27.275606Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:a7a6055bebc4333bd8ccec3e6c444cf12ec659b04705ec7d9f7796112c0e4115","observation_id":"70f41431-dca0-41ac-b36b-12d235cc06ff","resolution":{"observed_at":"2026-08-04T10:57:27.275606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:27.408298Z","title":"Uniform random generation of strings in a context-free language","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:27.408298Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:1803d2c97d21f02953083884bdb15944ead3db4399f2a1c8efeb8eb31369d85c","observation_id":"07196bff-a41a-414b-a708-62c5ff1e8df8","resolution":{"observed_at":"2026-08-04T10:57:27.408298Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1012.0023","last_updated":"2010-11-30T21:26:58Z","snapshot_observed_at":"2026-08-05T16:40:06.245493Z","submitted_at":"2010-11-30T21:26:58Z","title":"Pumping lemmas for linear and nonlinear context-free languages","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1012.0023","snapshot_observed_at":"2026-08-04T10:57:27.550913Z","title":"Pumping lemmas for linear and nonlinear context-free languages","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:27.550913Z"},"links":{"cited_paper":"/paper/1012.0023","citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:f67802026e317fcd81765fb26f5dbe9fb04bed8dcc01f4cc88612d05e58a7734","observation_id":"a29657f4-53b4-4142-b788-bf14cd9d09a4","resolution":{"observed_at":"2026-08-04T10:57:27.550913Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:27.823704Z","title":"Strong interchangeability and nonlinearity of primitive words","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:27.823704Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:4fd8d6ef6c58a3c63e4620ad1332a73172f1899470f80fa9afe3db758545a9c7","observation_id":"430013e8-6841-47a5-9eb3-90fd4f5df651","resolution":{"observed_at":"2026-08-04T10:57:27.823704Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:28.106023Z","title":null,"venue":null,"work_id":null,"year":1988},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:28.106023Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:cf1b381812d4ea8eb40c8f33ff7eca78bef2219234c8f01eeb32f90c7e8000c3","observation_id":"d08f2642-7618-4ca1-8359-9a08c1c722b6","resolution":{"observed_at":"2026-08-04T10:57:28.106023Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:28.211696Z","title":null,"venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:28.211696Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:d9579c9490f6b4c2407f19962eed3f0c122cf2cd7ecfca2399d7ba807a6f6d82","observation_id":"13fb5049-8e52-41a6-b115-92bfafd32252","resolution":{"observed_at":"2026-08-04T10:57:28.211696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:28.344514Z","title":"A characterization of poly-slender context-free languages","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:28.344514Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:b2bd82ab753195d99ad3cc2da2ff54d734ce29723ba9d0fbced8b9d07997cd9e","observation_id":"bad7203c-acf0-4cce-b09a-462526295a96","resolution":{"observed_at":"2026-08-04T10:57:28.344514Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:28.475300Z","title":"Context-free languages and primitive words","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:28.475300Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:5009d9b696be9b75a7e0c62f054642443951d18a422b195739b3b2e32d47a953","observation_id":"700a7208-956c-49f9-a9dd-cb055f425f59","resolution":{"observed_at":"2026-08-04T10:57:28.475300Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:28.591034Z","title":"Knowledge compilation meets database theory: Compiling queries to decision diagrams","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:28.591034Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:233e345a81b3570f040ff68892bd166c88d3206dca2e3d4864e68c6608010ad0","observation_id":"8490cb37-b985-4c63-b168-2600e453bdb5","resolution":{"observed_at":"2026-08-04T10:57:28.591034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:28.724385Z","title":"Multidimensional trees and a C homsky- S ch \\\" u tzenberger- W eir representation theorem for simple context-free tree grammars","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:28.724385Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:a26fcc8fef5c1a374ba3a2a42821f37332b014006e18191250d2fe9bd5bd439e","observation_id":"3193ed5d-4b1e-44a3-8138-4fd57d7ca227","resolution":{"observed_at":"2026-08-04T10:57:28.724385Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:28.863868Z","title":"Kobele, Jens Michaelis, Sylvain Salvati, and Ryo Yoshinaka","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:28.863868Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:605882ae31179cb0f68e33ba37fdcfdf28009adc1e06c68bc55010cd8b4941be","observation_id":"9ecea083-4b5a-4426-90fc-93e85168bf09","resolution":{"observed_at":"2026-08-04T10:57:28.863868Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:28.976964Z","title":"Karp and Raymond E","venue":null,"work_id":null,"year":1969},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:28.976964Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:11fc90d6139c065a3209601a340f70d13539e305dc4c5db9721a879817c7bdba","observation_id":"46815bdd-8dcb-4ab0-9593-fd8187889157","resolution":{"observed_at":"2026-08-04T10:57:28.976964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:29.106892Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:29.106892Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:312fba19e1613c55fb83b8287b2349977950aae8490665ffcf78189c54d551af","observation_id":"2153c322-a3be-4ee4-b606-41c9931d88ec","resolution":{"observed_at":"2026-08-04T10:57:29.106892Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:29.247185Z","title":"A formal language perspective on factorized representations","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:29.247185Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:023aae56bd232a65114cee62c922ef74ca7ec71e760bcf5c984b306b99a51512","observation_id":"3cd83ece-6d25-417d-ad84-849beca681c7","resolution":{"observed_at":"2026-08-04T10:57:29.247185Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:29.414703Z","title":"Monadic second-order logics with cardinalities","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:29.414703Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:34c9857def86b8b5136456793cbfd3bc1678ae8147a187ed99492b3650dc29d0","observation_id":"8ac1aa66-9328-4cb3-9677-6c0b1c64b748","resolution":{"observed_at":"2026-08-04T10:57:29.414703Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:29.576745Z","title":"Knuth, James H","venue":null,"work_id":null,"year":1977},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:29.576745Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:b8e7575c698a3811e10d7a158d38be4dd9b62869f2fbf44cee0ea1364b3afd7d","observation_id":"73cff5a3-ff5a-4fc5-a567-12ac5e788562","resolution":{"observed_at":"2026-08-04T10:57:29.576745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:29.773942Z","title":"New analytic techniques for proving the inherent ambiguity of context-free languages","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:29.773942Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:b1681145987e1adc0c3fdb64432c6756b4c534390f6cca2296b2c2e26c56b10d","observation_id":"fbcad8f5-eddb-44ca-b64c-bc4786047545","resolution":{"observed_at":"2026-08-04T10:57:29.773942Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:29.949823Z","title":"An operational and denotational approach to non-context-freeness","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:29.949823Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:448b459f8750da68737bef23442879edcbf23d1d276479932daf5c8de477af9c","observation_id":"15228241-cf15-46e0-916f-ac5bcb5167f6","resolution":{"observed_at":"2026-08-04T10:57:29.949823Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:30.065379Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:30.065379Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:20ddbe0b9fbd81a4c9b46a4b0f3d9732d14eeae3d8ac138d58558c15055400d9","observation_id":"19885355-d0d9-45db-98b7-74b92085c6f6","resolution":{"observed_at":"2026-08-04T10:57:30.065379Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:30.210077Z","title":"https://www.informaticadidactica.de/uploads/Artikel/LangeLeiss2009/LangeLeiss2009.pdf To CNF or not to CNF ? An efficient yet presentable version of the CYK algorithm","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:30.210077Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:24b0ac4845677e0104ed346e852b31cbcfdf9a94c5f3d7f277781c89f47494dd","observation_id":"7a04363e-765e-47de-9033-e843d1d949b6","resolution":{"observed_at":"2026-08-04T10:57:30.210077Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:30.372477Z","title":null,"venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:30.372477Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:fc2efc7692a1940bca00ebf5333fad248d83da998d7028570583ab8821f557a4","observation_id":"6c773efe-4fdc-4090-b8d8-d856efdf519c","resolution":{"observed_at":"2026-08-04T10:57:30.372477Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:30.519551Z","title":"On lexicographic enumeration of regular and context-free languages","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:30.519551Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:d4ecb38ca0902bce1b9623fc883555dc6c4b90e5c4c15e77dd362d80b5f9a851","observation_id":"db5988ea-e1bc-4ae2-adba-b6c36004b313","resolution":{"observed_at":"2026-08-04T10:57:30.519551Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:30.572446Z","title":"Hard counting problems for partial words","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:30.572446Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:69fe84e5548b147942a6321b35e082412a17ee68fe21a452ffbb323fdd8f658c","observation_id":"4716a907-f897-4078-8c4c-bfc4b79549b2","resolution":{"observed_at":"2026-08-04T10:57:30.572446Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.18224","last_updated":"2026-05-14T20:12:37Z","snapshot_observed_at":"2026-08-05T10:43:48.425233Z","submitted_at":"2024-06-26T10:13:50Z","title":"#CFG and #DNNF admit FPRAS","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.18224","snapshot_observed_at":"2026-08-04T10:57:30.705538Z","title":"Meel and Alexis de Colnet","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:30.705538Z"},"links":{"cited_paper":"/paper/2406.18224","citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:919694fbb874648e4b15905b5ecf22d0eb3d0caca5ab4d51eefa7dcee0fe1ff7","observation_id":"506bd300-a964-4c81-ada8-0abc409601ba","resolution":{"observed_at":"2026-08-04T10:57:30.705538Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:30.810364Z","title":"A lower bound on unambiguous context free grammars via communication complexity","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:30.810364Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:2a62bb31a43f3412a5cad28cc2df7ff80671949a53a2380035d366a216d5eadc","observation_id":"195df2bc-4b75-42e1-9fad-7dd5b7f5e982","resolution":{"observed_at":"2026-08-04T10:57:30.810364Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:30.901474Z","title":"Solving a special case of the intensional vs extensional conjecture in probabilistic databases","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:30.901474Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:a9e4492250106b926049c932cd1ebeb1dce18a2e8d9dfea9442d6c970fdf1b1b","observation_id":"f35237af-f672-44b3-a582-39d1f8f5a3d2","resolution":{"observed_at":"2026-08-04T10:57:30.901474Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:30.932509Z","title":"Lecture notes on automata, languages, and grammars, 2012","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:30.932509Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:8dee483a60b47e96ed5ffbb41051283c1a15aa867266ecc55a2d95fae595a360","observation_id":"c12e5f92-5dc3-4684-a20e-9d95294ff351","resolution":{"observed_at":"2026-08-04T10:57:30.932509Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:30.989598Z","title":"Unambiguous boolean grammars","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:30.989598Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:fd2996585ddab05adc00f5bfcc74e358d0a312657f3967438e8099d34381addb","observation_id":"7fd5dfeb-a480-4f8c-a9cd-01a04cdef38a","resolution":{"observed_at":"2026-08-04T10:57:30.989598Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:31.054454Z","title":"Conjunctive and boolean grammars: T he true general case of the context-free grammars","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:31.054454Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:6a01c32ed0eeb5a3ebe4c8b87afa409b33ebefe33099c60fff6b0abbc7e419a4","observation_id":"d3541250-4492-4e17-bffd-3e5214879a56","resolution":{"observed_at":"2026-08-04T10:57:31.054454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:31.128777Z","title":"The ambiguity of primitive words","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:31.128777Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:234031222a25cc53e26c1362228013e59d22e0cd4313d0fdcaf5a29ed3508cd9","observation_id":"1df4fd2f-8515-45aa-bebf-d7fedbff84ee","resolution":{"observed_at":"2026-08-04T10:57:31.128777Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:31.206427Z","title":"New compilation languages based on structured decomposability","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:31.206427Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:010830af10eaff66069722d00748a93f89dc8f6392efaabbaee3da76a5c713a5","observation_id":"869f1e10-b529-46fc-819b-53c0b09f8885","resolution":{"observed_at":"2026-08-04T10:57:31.206427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:31.295317Z","title":"e l Fijalkow. The universality problem for automata with bounded ambiguity. “Games Automata Play","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:31.295317Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:f81b0909984e81331d3670131f027695072c34b0900be5bb7e7b3f4eb6135b8e","observation_id":"80399a0a-80df-4e79-a20e-e8f530525fa8","resolution":{"observed_at":"2026-08-04T10:57:31.295317Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:31.329475Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:31.329475Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:74a1325c8d0bed432e58f0b078cee404759db1a9d2bb1f18f82f14b030b2d228","observation_id":"c719c079-1472-42a7-b7b3-14f3794dd693","resolution":{"observed_at":"2026-08-04T10:57:31.329475Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:31.484541Z","title":"Deciding equivalence of finite tree automata","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:31.484541Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:00d3ba1d08433e381e377e51761849117bf13d0e24c4057db46e2cdf0a28fb2f","observation_id":"34be34c1-6015-4b37-a7f8-639d71f7fea7","resolution":{"observed_at":"2026-08-04T10:57:31.484541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:31.559397Z","title":"On multiple context-free grammars","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:31.559397Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:431f12aaf9ac7725e61874bdc5bb4e1a1ce7c4d81515771b977e85fc1ab39c37","observation_id":"74c96db5-69ff-414c-9dac-005a2affff56","resolution":{"observed_at":"2026-08-04T10:57:31.559397Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:31.691932Z","title":"Generation of all the balanced parenthesis strings in lexicographical order","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:31.691932Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:6c50f18fc422a87c0c980db8e690c363467bede85feb06022dcb82255077a32c","observation_id":"656a670e-b492-419d-a063-c4dee77b14d2","resolution":{"observed_at":"2026-08-04T10:57:31.691932Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:31.760810Z","title":"A second course in formal languages and automata theory","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:31.760810Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:7448892a50940c34ff8ae974f99d62f6bdf009b7ea0ff2429b872806390d3717","observation_id":"11f28125-be25-4465-83f1-0119ed5e14a5","resolution":{"observed_at":"2026-08-04T10:57:31.760810Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:31.881771Z","title":"Some inherently ambiguous context-free languages","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:31.881771Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:848dbf1c65b1e57d0a9aa65b8fcdfbda3a35f6ad8e0abb47b38c42f1b77a0cf8","observation_id":"234dd14c-011b-484e-9ffd-0da2553d7bd9","resolution":{"observed_at":"2026-08-04T10:57:31.881771Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:32.066693Z","title":"Hunt III","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:32.066693Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:78683f49a8f68dd0bbfcbb8b1d50ca9eb7b768a54b127287a96ceb9e81f5c33e","observation_id":"90273acf-846b-4e9a-a0ae-de11f1e8eeab","resolution":{"observed_at":"2026-08-04T10:57:32.066693Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:32.211315Z","title":"Suciu, D","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:32.211315Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:11ac329d05d6093752ceea63ab23e8c611de0db4de690c5103008fb2b4c38c88","observation_id":"f1584c0c-04d8-4a13-9767-fb9a7eae3d1c","resolution":{"observed_at":"2026-08-04T10:57:32.211315Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:32.368723Z","title":null,"venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:32.368723Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:0a8302356fbd7d972b64768be887d65d011bdbe488e5f736cdb14948c998501b","observation_id":"c84f5d45-e9ae-4d89-bf14-42c5e9b420ce","resolution":{"observed_at":"2026-08-04T10:57:32.368723Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:32.533568Z","title":null,"venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:32.533568Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:8abfc250c9908555c640629c8d397cc592a3084ee4a5a08307faf7c58536e656","observation_id":"f0065bfb-e23c-4dc0-b378-f7867df2bb65","resolution":{"observed_at":"2026-08-04T10:57:32.533568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:32.682870Z","title":"Valiant and Michael S","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:32.682870Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:3b00bc23c4d653ae8fbedbe9d5cb421907da6706288498b00eb353a86580e7c0","observation_id":"667ab384-027e-47bc-8139-fcd52803bf60","resolution":{"observed_at":"2026-08-04T10:57:32.682870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:32.817890Z","title":null,"venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:32.817890Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:48b63f04384a81f4c5a8877f5b6ea054e557a5bd83686e305071b02b3820922c","observation_id":"91a2c136-5b23-45e0-b160-1dd28fe7a11a","resolution":{"observed_at":"2026-08-04T10:57:32.817890Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:32.937763Z","title":"Structured d-DNNF is not closed under negation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:32.937763Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:c985d0d840f1a6b99443d759615fadb0a66edfa643e7edbef3088b6d2ee0b0d3","observation_id":"2f702df9-b703-41ae-9357-91b656f25c4c","resolution":{"observed_at":"2026-08-04T10:57:32.937763Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T10:57:33.053632Z","title":"Ambiguity functions of context-free grammars and languages","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words","version":2},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-04T10:57:33.053632Z"},"links":{"citing_paper":"/paper/2510.08127"},"observation_digest":"sha256:ee15354499dac0296f54e76b144aa4b96b597c8d085a1e77e098495cd199b8a7","observation_id":"dbe2db4f-f7a0-4c62-b80d-b142a6b15f70","resolution":{"observed_at":"2026-08-04T10:57:33.053632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2510.08127","last_updated":"2026-06-22T08:56:09Z","latest_version":2,"primary_category":"cs.FL","snapshot_observed_at":"2026-08-10T19:43:29.828396Z","submitted_at":"2025-10-09T12:13:34Z","title":"On the Complexity of Language Membership for Probabilistic Words"},"reference_resolution":{"displayed":86,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":85,"verified_exact":1,"verified_fuzzy":0},"total_outbound_references":86},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 13 August 2026, this Paper Citation Record lists 86 of 86 outbound references and 0 inbound Pith citation observations for arXiv:2510.08127."}