{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AEDAAPH6ZGS4BKNKLY2NZLUBZV","short_pith_number":"pith:AEDAAPH6","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"},"canonical_sha256":"0106003cfec9a5c0a9aa5e34dcae81cd56d2e322c326bcc71e9aa65b9febfe7e","source":{"kind":"arxiv","id":"1504.04136","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04136","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04136v3","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04136","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"pith_short_12","alias_value":"AEDAAPH6ZGS4","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AEDAAPH6ZGS4BKNK","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AEDAAPH6","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AEDAAPH6ZGS4BKNKLY2NZLUBZV","target":"record","payload":{"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"},"canonical_sha256":"0106003cfec9a5c0a9aa5e34dcae81cd56d2e322c326bcc71e9aa65b9febfe7e","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"},"source_kind":"arxiv","source_id":"1504.04136","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:53:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8LVDyycD8ybch4pz1Zc5joTN41N8NPhid2xhNR5JVf70ipSZhGdyZ53LzQ+5iRBbFuQWvligTZ1nwT2+2OLQBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T00:28:39.236893Z"},"content_sha256":"047b9ad1d9cf3fb8ccf90b14a39cabddc3d75dbb8d9b68c3ab5f9c0b9102fc32","schema_version":"1.0","event_id":"sha256:047b9ad1d9cf3fb8ccf90b14a39cabddc3d75dbb8d9b68c3ab5f9c0b9102fc32"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AEDAAPH6ZGS4BKNKLY2NZLUBZV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:53:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BiilddLz70LM3C8xyIXaSvWtWv24YVuMz/CzgjN/LlfAxN7Cs64GLND8e7tGB92gpehlPJPs4/nlXhfjKLe3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T00:28:39.237604Z"},"content_sha256":"741f9c2936cb79b71420aab545246895389f8d003c891b50425dd83b8c403f8e","schema_version":"1.0","event_id":"sha256:741f9c2936cb79b71420aab545246895389f8d003c891b50425dd83b8c403f8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AEDAAPH6ZGS4BKNKLY2NZLUBZV/bundle.json","state_url":"https://pith.science/pith/AEDAAPH6ZGS4BKNKLY2NZLUBZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AEDAAPH6ZGS4BKNKLY2NZLUBZV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-19T00:28:39Z","links":{"resolver":"https://pith.science/pith/AEDAAPH6ZGS4BKNKLY2NZLUBZV","bundle":"https://pith.science/pith/AEDAAPH6ZGS4BKNKLY2NZLUBZV/bundle.json","state":"https://pith.science/pith/AEDAAPH6ZGS4BKNKLY2NZLUBZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AEDAAPH6ZGS4BKNKLY2NZLUBZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AEDAAPH6ZGS4BKNKLY2NZLUBZV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d152c2201438820bfb54823240d5ea655e8c92da2851510d8b32c8886d7816f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-16T08:28:54Z","title_canon_sha256":"8163f9a560ac999636eb977f120b7f232e10c4f1a25f4c7a6397bf1bb2f0d413"},"schema_version":"1.0","source":{"id":"1504.04136","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04136","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04136v3","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04136","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"pith_short_12","alias_value":"AEDAAPH6ZGS4","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AEDAAPH6ZGS4BKNK","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AEDAAPH6","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:741f9c2936cb79b71420aab545246895389f8d003c891b50425dd83b8c403f8e","target":"graph","created_at":"2026-05-18T00:53:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","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","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-16T08:28:54Z","title":"Deciding the value 1 problem for probabilistic leaktight automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04136","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:047b9ad1d9cf3fb8ccf90b14a39cabddc3d75dbb8d9b68c3ab5f9c0b9102fc32","target":"record","created_at":"2026-05-18T00:53:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d152c2201438820bfb54823240d5ea655e8c92da2851510d8b32c8886d7816f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-04-16T08:28:54Z","title_canon_sha256":"8163f9a560ac999636eb977f120b7f232e10c4f1a25f4c7a6397bf1bb2f0d413"},"schema_version":"1.0","source":{"id":"1504.04136","kind":"arxiv","version":3}},"canonical_sha256":"0106003cfec9a5c0a9aa5e34dcae81cd56d2e322c326bcc71e9aa65b9febfe7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0106003cfec9a5c0a9aa5e34dcae81cd56d2e322c326bcc71e9aa65b9febfe7e","first_computed_at":"2026-05-18T00:53:10.788404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:10.788404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2SXIuK7BwnloszDl2lXNVf5DZ6LGfD2AvMMVD3Wo3KlKHGOsbnTvH4kR4/DyRViKg0sSKxbeduEtYIdLXI1CBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:10.788868Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04136","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:047b9ad1d9cf3fb8ccf90b14a39cabddc3d75dbb8d9b68c3ab5f9c0b9102fc32","sha256:741f9c2936cb79b71420aab545246895389f8d003c891b50425dd83b8c403f8e"],"state_sha256":"7071ed8c4c3439285f15eabc7837d9f220cd88905f23011f92b6414c22fa9ea0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TT+RkcOkfxKoqIPUuBuyvacELo6N1vl0VEDXtu0N9rtUkDNszcKl2tfd0bZ1GttC1pIocacS0EW6ErUk0oLHAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T00:28:39.239716Z","bundle_sha256":"6b37158555148e9a0996e2e9a1f4126884af40e96cc3fa559507e5f6305cf7e0"}}