{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AEDAAPH6ZGS4BKNKLY2NZLUBZV","short_pith_number":"pith:AEDAAPH6","schema_version":"1.0","canonical_sha256":"0106003cfec9a5c0a9aa5e34dcae81cd56d2e322c326bcc71e9aa65b9febfe7e","source":{"kind":"arxiv","id":"1504.04136","version":3},"attestation_state":"computed","paper":{"title":"Deciding the value 1 problem for probabilistic leaktight automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Bordeaux), CNRS, Edon Kelmendi (LaBRI, Hugo Gimbert (LaBRI, Marseille), Nathana\\\"el Fijalkow (LIAFA, Universit\\'e Paris 7 - Denis Diderot, University of Warsaw), Youssouf Oualhadj (LIF","submitted_at":"2015-04-16T08:28:54Z","abstract_excerpt":"The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close to 1? This problem was proved undecidable recently; to overcome this, several classes of probabilistic automata of different nature were proposed, for which the value 1 problem has been shown decidable. In this paper, we introduce yet another class of probabilistic automata, called leaktight automata, which strictly subsumes all classes of probabilistic automata whose value 1 problem is known to be decidable. We pro"},"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":"1504.04136","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-16T08:28:54Z","cross_cats_sorted":[],"title_canon_sha256":"8163f9a560ac999636eb977f120b7f232e10c4f1a25f4c7a6397bf1bb2f0d413","abstract_canon_sha256":"d152c2201438820bfb54823240d5ea655e8c92da2851510d8b32c8886d7816f4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:10.788868Z","signature_b64":"2SXIuK7BwnloszDl2lXNVf5DZ6LGfD2AvMMVD3Wo3KlKHGOsbnTvH4kR4/DyRViKg0sSKxbeduEtYIdLXI1CBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0106003cfec9a5c0a9aa5e34dcae81cd56d2e322c326bcc71e9aa65b9febfe7e","last_reissued_at":"2026-05-18T00:53:10.788404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:10.788404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deciding the value 1 problem for probabilistic leaktight automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Bordeaux), CNRS, Edon Kelmendi (LaBRI, Hugo Gimbert (LaBRI, Marseille), Nathana\\\"el Fijalkow (LIAFA, Universit\\'e Paris 7 - Denis Diderot, University of Warsaw), Youssouf Oualhadj (LIF","submitted_at":"2015-04-16T08:28:54Z","abstract_excerpt":"The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton, are there words accepted with probability arbitrarily close to 1? This problem was proved undecidable recently; to overcome this, several classes of probabilistic automata of different nature were proposed, for which the value 1 problem has been shown decidable. In this paper, we introduce yet another class of probabilistic automata, called leaktight automata, which strictly subsumes all classes of probabilistic automata whose value 1 problem is known to be decidable. We pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04136","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.04136","created_at":"2026-05-18T00:53:10.788478+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04136v3","created_at":"2026-05-18T00:53:10.788478+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04136","created_at":"2026-05-18T00:53:10.788478+00:00"},{"alias_kind":"pith_short_12","alias_value":"AEDAAPH6ZGS4","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AEDAAPH6ZGS4BKNK","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AEDAAPH6","created_at":"2026-05-18T12:29:10.953037+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/AEDAAPH6ZGS4BKNKLY2NZLUBZV","json":"https://pith.science/pith/AEDAAPH6ZGS4BKNKLY2NZLUBZV.json","graph_json":"https://pith.science/api/pith-number/AEDAAPH6ZGS4BKNKLY2NZLUBZV/graph.json","events_json":"https://pith.science/api/pith-number/AEDAAPH6ZGS4BKNKLY2NZLUBZV/events.json","paper":"https://pith.science/paper/AEDAAPH6"},"agent_actions":{"view_html":"https://pith.science/pith/AEDAAPH6ZGS4BKNKLY2NZLUBZV","download_json":"https://pith.science/pith/AEDAAPH6ZGS4BKNKLY2NZLUBZV.json","view_paper":"https://pith.science/paper/AEDAAPH6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04136&json=true","fetch_graph":"https://pith.science/api/pith-number/AEDAAPH6ZGS4BKNKLY2NZLUBZV/graph.json","fetch_events":"https://pith.science/api/pith-number/AEDAAPH6ZGS4BKNKLY2NZLUBZV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AEDAAPH6ZGS4BKNKLY2NZLUBZV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AEDAAPH6ZGS4BKNKLY2NZLUBZV/action/storage_attestation","attest_author":"https://pith.science/pith/AEDAAPH6ZGS4BKNKLY2NZLUBZV/action/author_attestation","sign_citation":"https://pith.science/pith/AEDAAPH6ZGS4BKNKLY2NZLUBZV/action/citation_signature","submit_replication":"https://pith.science/pith/AEDAAPH6ZGS4BKNKLY2NZLUBZV/action/replication_record"}},"created_at":"2026-05-18T00:53:10.788478+00:00","updated_at":"2026-05-18T00:53:10.788478+00:00"}