{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:IIKFWSQTWX2YUFJXWXOSXKB7OH","short_pith_number":"pith:IIKFWSQT","schema_version":"1.0","canonical_sha256":"42145b4a13b5f58a1537b5dd2ba83f71cbe68ad56e3ee1e407e7a3619dcc1283","source":{"kind":"arxiv","id":"1905.08760","version":1},"attestation_state":"computed","paper":{"title":"Sampling from Stochastic Finite Automata with Applications to CTC Decoding","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.FL","cs.LG"],"primary_cat":"cs.CL","authors_text":"Alexander Gutkin, Martin Jansche","submitted_at":"2019-05-21T17:26:39Z","abstract_excerpt":"Stochastic finite automata arise naturally in many language and speech processing tasks. They include stochastic acceptors, which represent certain probability distributions over random strings. We consider the problem of efficient sampling: drawing random string variates from the probability distribution represented by stochastic automata and transformations of those. We show that path-sampling is effective and can be efficient if the epsilon-graph of a finite automaton is acyclic. We provide an algorithm that ensures this by conflating epsilon-cycles within strongly connected components. Sam"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1905.08760","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CL","submitted_at":"2019-05-21T17:26:39Z","cross_cats_sorted":["cs.FL","cs.LG"],"title_canon_sha256":"2bbfea4893b4389aef9a5bc3b39a5017b044e1df99295e152d9f25f555c47ed1","abstract_canon_sha256":"4b888e3c5069100df04eb0959a1eb7f25fd7095db7907f4e4fe543bfc9b956b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:06:08.462064Z","signature_b64":"j6ErMYucTb+PjVZIYzUByMsoL1Blbe2TkTaOuveN06aMv5qqTldXoxb8CgFSJNWOLSC7XPtzamlVPnKm6SbEDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42145b4a13b5f58a1537b5dd2ba83f71cbe68ad56e3ee1e407e7a3619dcc1283","last_reissued_at":"2026-07-05T00:06:08.461554Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:06:08.461554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sampling from Stochastic Finite Automata with Applications to CTC Decoding","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.FL","cs.LG"],"primary_cat":"cs.CL","authors_text":"Alexander Gutkin, Martin Jansche","submitted_at":"2019-05-21T17:26:39Z","abstract_excerpt":"Stochastic finite automata arise naturally in many language and speech processing tasks. They include stochastic acceptors, which represent certain probability distributions over random strings. We consider the problem of efficient sampling: drawing random string variates from the probability distribution represented by stochastic automata and transformations of those. We show that path-sampling is effective and can be efficient if the epsilon-graph of a finite automaton is acyclic. We provide an algorithm that ensures this by conflating epsilon-cycles within strongly connected components. Sam"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08760","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.08760/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1905.08760","created_at":"2026-07-05T00:06:08.461614+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.08760v1","created_at":"2026-07-05T00:06:08.461614+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08760","created_at":"2026-07-05T00:06:08.461614+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIKFWSQTWX2Y","created_at":"2026-07-05T00:06:08.461614+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIKFWSQTWX2YUFJX","created_at":"2026-07-05T00:06:08.461614+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIKFWSQT","created_at":"2026-07-05T00:06:08.461614+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IIKFWSQTWX2YUFJXWXOSXKB7OH","json":"https://pith.science/pith/IIKFWSQTWX2YUFJXWXOSXKB7OH.json","graph_json":"https://pith.science/api/pith-number/IIKFWSQTWX2YUFJXWXOSXKB7OH/graph.json","events_json":"https://pith.science/api/pith-number/IIKFWSQTWX2YUFJXWXOSXKB7OH/events.json","paper":"https://pith.science/paper/IIKFWSQT"},"agent_actions":{"view_html":"https://pith.science/pith/IIKFWSQTWX2YUFJXWXOSXKB7OH","download_json":"https://pith.science/pith/IIKFWSQTWX2YUFJXWXOSXKB7OH.json","view_paper":"https://pith.science/paper/IIKFWSQT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.08760&json=true","fetch_graph":"https://pith.science/api/pith-number/IIKFWSQTWX2YUFJXWXOSXKB7OH/graph.json","fetch_events":"https://pith.science/api/pith-number/IIKFWSQTWX2YUFJXWXOSXKB7OH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIKFWSQTWX2YUFJXWXOSXKB7OH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIKFWSQTWX2YUFJXWXOSXKB7OH/action/storage_attestation","attest_author":"https://pith.science/pith/IIKFWSQTWX2YUFJXWXOSXKB7OH/action/author_attestation","sign_citation":"https://pith.science/pith/IIKFWSQTWX2YUFJXWXOSXKB7OH/action/citation_signature","submit_replication":"https://pith.science/pith/IIKFWSQTWX2YUFJXWXOSXKB7OH/action/replication_record"}},"created_at":"2026-07-05T00:06:08.461614+00:00","updated_at":"2026-07-05T00:06:08.461614+00:00"}