{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:NSPHCM6CIUUQ3JUQHC7LHPQB5A","short_pith_number":"pith:NSPHCM6C","canonical_record":{"source":{"id":"1104.3055","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-04-14T09:49:19Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"3f6f6e5048999ebf7bf66e697eeb9da98d5826d1bc1d1ae8ddd5104a6bf295f6","abstract_canon_sha256":"609af78de959e85cec5d5e85c49da3bb202ac75811bd71c2a4a824b162f38641"},"schema_version":"1.0"},"canonical_sha256":"6c9e7133c245290da69038beb3be01e832c289d8d40c0d0dbbfe26d1c5976d7d","source":{"kind":"arxiv","id":"1104.3055","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3055","created_at":"2026-05-18T04:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3055v5","created_at":"2026-05-18T04:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3055","created_at":"2026-05-18T04:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"NSPHCM6CIUUQ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NSPHCM6CIUUQ3JUQ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NSPHCM6C","created_at":"2026-05-18T12:26:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:NSPHCM6CIUUQ3JUQHC7LHPQB5A","target":"record","payload":{"canonical_record":{"source":{"id":"1104.3055","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-04-14T09:49:19Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"3f6f6e5048999ebf7bf66e697eeb9da98d5826d1bc1d1ae8ddd5104a6bf295f6","abstract_canon_sha256":"609af78de959e85cec5d5e85c49da3bb202ac75811bd71c2a4a824b162f38641"},"schema_version":"1.0"},"canonical_sha256":"6c9e7133c245290da69038beb3be01e832c289d8d40c0d0dbbfe26d1c5976d7d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:54.530590Z","signature_b64":"t22iveuHhrxoJTKg5MuzjNw+2gGmfsds56E1sFwirI4HMzsAkK2gmdFfYv4pvDC43cCukEKEAZgbaTh7mjdsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c9e7133c245290da69038beb3be01e832c289d8d40c0d0dbbfe26d1c5976d7d","last_reissued_at":"2026-05-18T04:03:54.530062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:54.530062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.3055","source_version":5,"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-18T04:03:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zenOYwTgJHLUXrgaCNZ7vs4zTkah5Dj48S2arWEtRoENbKPMDaYONdw2/IgA1fihLy+Z9ap2Uyj+Jrf18jRzBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:38:07.648844Z"},"content_sha256":"dd839d2c09d38eca70e8f7e5c9d88b5c1012401a73b3147dfc7dae872ece3d11","schema_version":"1.0","event_id":"sha256:dd839d2c09d38eca70e8f7e5c9d88b5c1012401a73b3147dfc7dae872ece3d11"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:NSPHCM6CIUUQ3JUQHC7LHPQB5A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deciding the Value 1 Problem of Probabilistic Leaktight Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.FL","authors_text":"Hugo Gimbert (LaBRI), LIAFA), Nathana\\\"el Fijalkow (ENS Cachan, Youssouf Oualhadj (LaBRI)","submitted_at":"2011-04-14T09:49:19Z","abstract_excerpt":"The value 1 problem is a decision problem for probabilistic automata over finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitrarily close to 1? This problem was proved undecidable recently. We sharpen this result, showing that the undecidability result holds even if the probabilistic automata have only one probabilistic transition. Our main contribution is to introduce a new class of probabilistic automata, called leaktight automata, for which the value 1 problem is shown decidable (and PSPACE-complete). We construct an algorithm based on the c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3055","kind":"arxiv","version":5},"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-18T04:03:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F1zUn/KEcLqBLeWQ5dFi9iReIL/cQ988tVAeEwSHNQKaBNFLJpJml1dlzJK/4k2Nfj4Ejoh/c9mnJ92QlfVmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:38:07.649427Z"},"content_sha256":"8421af5981dfe1d3c084273e0725cac1c77e6f29bb21c1cf1a497b46a123ce94","schema_version":"1.0","event_id":"sha256:8421af5981dfe1d3c084273e0725cac1c77e6f29bb21c1cf1a497b46a123ce94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSPHCM6CIUUQ3JUQHC7LHPQB5A/bundle.json","state_url":"https://pith.science/pith/NSPHCM6CIUUQ3JUQHC7LHPQB5A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSPHCM6CIUUQ3JUQHC7LHPQB5A/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-31T16:38:07Z","links":{"resolver":"https://pith.science/pith/NSPHCM6CIUUQ3JUQHC7LHPQB5A","bundle":"https://pith.science/pith/NSPHCM6CIUUQ3JUQHC7LHPQB5A/bundle.json","state":"https://pith.science/pith/NSPHCM6CIUUQ3JUQHC7LHPQB5A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSPHCM6CIUUQ3JUQHC7LHPQB5A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:NSPHCM6CIUUQ3JUQHC7LHPQB5A","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":"609af78de959e85cec5d5e85c49da3bb202ac75811bd71c2a4a824b162f38641","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-04-14T09:49:19Z","title_canon_sha256":"3f6f6e5048999ebf7bf66e697eeb9da98d5826d1bc1d1ae8ddd5104a6bf295f6"},"schema_version":"1.0","source":{"id":"1104.3055","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3055","created_at":"2026-05-18T04:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3055v5","created_at":"2026-05-18T04:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3055","created_at":"2026-05-18T04:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"NSPHCM6CIUUQ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_16","alias_value":"NSPHCM6CIUUQ3JUQ","created_at":"2026-05-18T12:26:37Z"},{"alias_kind":"pith_short_8","alias_value":"NSPHCM6C","created_at":"2026-05-18T12:26:37Z"}],"graph_snapshots":[{"event_id":"sha256:8421af5981dfe1d3c084273e0725cac1c77e6f29bb21c1cf1a497b46a123ce94","target":"graph","created_at":"2026-05-18T04:03:54Z","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 A, are there words accepted by A with probability arbitrarily close to 1? This problem was proved undecidable recently. We sharpen this result, showing that the undecidability result holds even if the probabilistic automata have only one probabilistic transition. Our main contribution is to introduce a new class of probabilistic automata, called leaktight automata, for which the value 1 problem is shown decidable (and PSPACE-complete). We construct an algorithm based on the c","authors_text":"Hugo Gimbert (LaBRI), LIAFA), Nathana\\\"el Fijalkow (ENS Cachan, Youssouf Oualhadj (LaBRI)","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-04-14T09:49:19Z","title":"Deciding the Value 1 Problem of Probabilistic Leaktight Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3055","kind":"arxiv","version":5},"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:dd839d2c09d38eca70e8f7e5c9d88b5c1012401a73b3147dfc7dae872ece3d11","target":"record","created_at":"2026-05-18T04:03:54Z","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":"609af78de959e85cec5d5e85c49da3bb202ac75811bd71c2a4a824b162f38641","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-04-14T09:49:19Z","title_canon_sha256":"3f6f6e5048999ebf7bf66e697eeb9da98d5826d1bc1d1ae8ddd5104a6bf295f6"},"schema_version":"1.0","source":{"id":"1104.3055","kind":"arxiv","version":5}},"canonical_sha256":"6c9e7133c245290da69038beb3be01e832c289d8d40c0d0dbbfe26d1c5976d7d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c9e7133c245290da69038beb3be01e832c289d8d40c0d0dbbfe26d1c5976d7d","first_computed_at":"2026-05-18T04:03:54.530062Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:54.530062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"t22iveuHhrxoJTKg5MuzjNw+2gGmfsds56E1sFwirI4HMzsAkK2gmdFfYv4pvDC43cCukEKEAZgbaTh7mjdsDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:54.530590Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3055","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd839d2c09d38eca70e8f7e5c9d88b5c1012401a73b3147dfc7dae872ece3d11","sha256:8421af5981dfe1d3c084273e0725cac1c77e6f29bb21c1cf1a497b46a123ce94"],"state_sha256":"09d92a629daefa7afc23e17c3f913d85d6f0ec6e03777ba077bb6444d84d3c6d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iN8nM9BGNhbRk0thZPw2FK/sfVyc1Q/hkBmcJUJSc0wE6Pr6g9k+BjwUNpA15OgFGN4B/LhfcvSCvAmKTv5HDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:38:07.653011Z","bundle_sha256":"32cc7ddfdb03e203c24b02c03871faa7a846f4cc49c22113cb7e9071964a4555"}}