{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:QTD7C76CZDXOH2YDX2RLF3KXEZ","short_pith_number":"pith:QTD7C76C","canonical_record":{"source":{"id":"1104.3054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-04-14T09:48:34Z","cross_cats_sorted":[],"title_canon_sha256":"5484ee70e3894f7829fee9ce7dcb2c54d60c5a8006fee4656a2b90220df03282","abstract_canon_sha256":"ea3c59b0558c841846bc18eca3ac25ee97614cb818d3b74f2f4d98f6e3f2a4b4"},"schema_version":"1.0"},"canonical_sha256":"84c7f17fc2c8eee3eb03bea2b2ed5726717186c5c1664c34a207206b817615b2","source":{"kind":"arxiv","id":"1104.3054","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3054","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3054v1","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3054","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"QTD7C76CZDXO","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QTD7C76CZDXOH2YD","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QTD7C76C","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:QTD7C76CZDXOH2YDX2RLF3KXEZ","target":"record","payload":{"canonical_record":{"source":{"id":"1104.3054","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-04-14T09:48:34Z","cross_cats_sorted":[],"title_canon_sha256":"5484ee70e3894f7829fee9ce7dcb2c54d60c5a8006fee4656a2b90220df03282","abstract_canon_sha256":"ea3c59b0558c841846bc18eca3ac25ee97614cb818d3b74f2f4d98f6e3f2a4b4"},"schema_version":"1.0"},"canonical_sha256":"84c7f17fc2c8eee3eb03bea2b2ed5726717186c5c1664c34a207206b817615b2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:06.666307Z","signature_b64":"4te6rOZIMKdgi3uTwjWpfCrTEefL0z+co5EjcGECQJVF6PlRZZj6twU3P5HgG1jBqR3Wv9Blt0SlC700Zl3rDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84c7f17fc2c8eee3eb03bea2b2ed5726717186c5c1664c34a207206b817615b2","last_reissued_at":"2026-05-18T04:24:06.665836Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:06.665836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.3054","source_version":1,"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:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HK7c2EBzxbUGd4Z80vjaxxHB/FjRl4QjduQFEQLzM+rnCg3CvlREMjwpPxGGCHdFFIQ8BIUNMVT0S2uhbRBtDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:52:59.688465Z"},"content_sha256":"1c55e0b523884e4adcf869d97b4ea5111d886d49e500439d0b897b6e48aa748f","schema_version":"1.0","event_id":"sha256:1c55e0b523884e4adcf869d97b4ea5111d886d49e500439d0b897b6e48aa748f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:QTD7C76CZDXOH2YDX2RLF3KXEZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pushing undecidability of the isolation problem for probabilistic automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Hugo Gimbert (LaBRI), LIAFA), Nathana\\\"el Fijalkow (ENS Cachan, Youssouf Oualhadj (LaBRI)","submitted_at":"2011-04-14T09:48:34Z","abstract_excerpt":"This short note aims at proving that the isolation problem is undecidable for probabilistic automata with only one probabilistic transition. This problem is known to be undecidable for general probabilistic automata, without restriction on the number of probabilistic transitions. In this note, we develop a simulation technique that allows to simulate any probabilistic automaton with one having only one probabilistic transition."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3054","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":""},"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:24:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G9uaBtMP/j4Yc8cQmoCCpgyLkLYNybBBG3DRHQq9xygf+ulrtrQOEg7STgOUvpVpk1gXNNsLBYrqAcrAHcj2BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T12:52:59.688828Z"},"content_sha256":"2b37c8501c19cdb885e475047924c4ebf43ae750c31e5fb0b7e8c994538d8ae5","schema_version":"1.0","event_id":"sha256:2b37c8501c19cdb885e475047924c4ebf43ae750c31e5fb0b7e8c994538d8ae5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QTD7C76CZDXOH2YDX2RLF3KXEZ/bundle.json","state_url":"https://pith.science/pith/QTD7C76CZDXOH2YDX2RLF3KXEZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QTD7C76CZDXOH2YDX2RLF3KXEZ/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-31T12:52:59Z","links":{"resolver":"https://pith.science/pith/QTD7C76CZDXOH2YDX2RLF3KXEZ","bundle":"https://pith.science/pith/QTD7C76CZDXOH2YDX2RLF3KXEZ/bundle.json","state":"https://pith.science/pith/QTD7C76CZDXOH2YDX2RLF3KXEZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QTD7C76CZDXOH2YDX2RLF3KXEZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:QTD7C76CZDXOH2YDX2RLF3KXEZ","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":"ea3c59b0558c841846bc18eca3ac25ee97614cb818d3b74f2f4d98f6e3f2a4b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-04-14T09:48:34Z","title_canon_sha256":"5484ee70e3894f7829fee9ce7dcb2c54d60c5a8006fee4656a2b90220df03282"},"schema_version":"1.0","source":{"id":"1104.3054","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.3054","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"arxiv_version","alias_value":"1104.3054v1","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3054","created_at":"2026-05-18T04:24:06Z"},{"alias_kind":"pith_short_12","alias_value":"QTD7C76CZDXO","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"QTD7C76CZDXOH2YD","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"QTD7C76C","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:2b37c8501c19cdb885e475047924c4ebf43ae750c31e5fb0b7e8c994538d8ae5","target":"graph","created_at":"2026-05-18T04:24:06Z","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":"This short note aims at proving that the isolation problem is undecidable for probabilistic automata with only one probabilistic transition. This problem is known to be undecidable for general probabilistic automata, without restriction on the number of probabilistic transitions. In this note, we develop a simulation technique that allows to simulate any probabilistic automaton with one having only one probabilistic transition.","authors_text":"Hugo Gimbert (LaBRI), LIAFA), Nathana\\\"el Fijalkow (ENS Cachan, Youssouf Oualhadj (LaBRI)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-04-14T09:48:34Z","title":"Pushing undecidability of the isolation problem for probabilistic automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3054","kind":"arxiv","version":1},"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:1c55e0b523884e4adcf869d97b4ea5111d886d49e500439d0b897b6e48aa748f","target":"record","created_at":"2026-05-18T04:24:06Z","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":"ea3c59b0558c841846bc18eca3ac25ee97614cb818d3b74f2f4d98f6e3f2a4b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-04-14T09:48:34Z","title_canon_sha256":"5484ee70e3894f7829fee9ce7dcb2c54d60c5a8006fee4656a2b90220df03282"},"schema_version":"1.0","source":{"id":"1104.3054","kind":"arxiv","version":1}},"canonical_sha256":"84c7f17fc2c8eee3eb03bea2b2ed5726717186c5c1664c34a207206b817615b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84c7f17fc2c8eee3eb03bea2b2ed5726717186c5c1664c34a207206b817615b2","first_computed_at":"2026-05-18T04:24:06.665836Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:06.665836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4te6rOZIMKdgi3uTwjWpfCrTEefL0z+co5EjcGECQJVF6PlRZZj6twU3P5HgG1jBqR3Wv9Blt0SlC700Zl3rDg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:06.666307Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.3054","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1c55e0b523884e4adcf869d97b4ea5111d886d49e500439d0b897b6e48aa748f","sha256:2b37c8501c19cdb885e475047924c4ebf43ae750c31e5fb0b7e8c994538d8ae5"],"state_sha256":"e3030c67fcd7d41b26dbf454299c0d3237f6d773de79e238558c96ee3c0c3c63"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Ym0m7/GaRebHqo8HGagXYj71pxR2zJk67vZx7H9G1rQAnxKvqpB4mI3++888pUSmgoctl6Y3edoKS4Zne6eDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T12:52:59.691225Z","bundle_sha256":"d6159db773cc8139bce25477ce425cd43553581ee8eff263f6dcd74dd34c5b2e"}}