{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UWO4DVHJZBRIOCXL3ZXXZDQOQ5","short_pith_number":"pith:UWO4DVHJ","canonical_record":{"source":{"id":"1112.4644","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-12-20T10:47:45Z","cross_cats_sorted":[],"title_canon_sha256":"3f159f2bae93b5f9970e2bc84e8210ced2c2c8fd2f21f411ff056581e30f9e22","abstract_canon_sha256":"0043ea5dfee5817711486fbbb343ebf9d213ca20426a6f6bb57aba6bf50426fb"},"schema_version":"1.0"},"canonical_sha256":"a59dc1d4e9c862870aebde6f7c8e0e877c9f97cbe6cde8f1f3e643ecb2955946","source":{"kind":"arxiv","id":"1112.4644","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.4644","created_at":"2026-05-18T04:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"1112.4644v2","created_at":"2026-05-18T04:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4644","created_at":"2026-05-18T04:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"UWO4DVHJZBRI","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UWO4DVHJZBRIOCXL","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UWO4DVHJ","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UWO4DVHJZBRIOCXL3ZXXZDQOQ5","target":"record","payload":{"canonical_record":{"source":{"id":"1112.4644","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-12-20T10:47:45Z","cross_cats_sorted":[],"title_canon_sha256":"3f159f2bae93b5f9970e2bc84e8210ced2c2c8fd2f21f411ff056581e30f9e22","abstract_canon_sha256":"0043ea5dfee5817711486fbbb343ebf9d213ca20426a6f6bb57aba6bf50426fb"},"schema_version":"1.0"},"canonical_sha256":"a59dc1d4e9c862870aebde6f7c8e0e877c9f97cbe6cde8f1f3e643ecb2955946","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:05:05.017229Z","signature_b64":"MKOw7w6TiiXIedzLLjE3q4Z0aoMqgqgyURHUYlLYj1scYF0zGCvOlw91JGxeTLZSztys0iuUBqv6BCqDRhJJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a59dc1d4e9c862870aebde6f7c8e0e877c9f97cbe6cde8f1f3e643ecb2955946","last_reissued_at":"2026-05-18T04:05:05.016746Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:05:05.016746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.4644","source_version":2,"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:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJrujEwbKmuGtCU3SOAP/o8jM34nH0SiRTurSsa20gCv4GYXMfcdsVZW6MjtFZENvk6uc+s8Jrjop+7GIIxUDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:38:52.718909Z"},"content_sha256":"5e04fb955b306d53041f1d1c3f3632a3ebdda2f33ac741876c19cd0c7c03e1e9","schema_version":"1.0","event_id":"sha256:5e04fb955b306d53041f1d1c3f3632a3ebdda2f33ac741876c19cd0c7c03e1e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UWO4DVHJZBRIOCXL3ZXXZDQOQ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of the Equivalence Problem for Probabilistic Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Andrzej S. Murawski, Bj\\\"orn Wachter, James Worrell, Jo\\\"el Ouaknine, Stefan Kiefer","submitted_at":"2011-12-20T10:47:45Z","abstract_excerpt":"Checking two probabilistic automata for equivalence has been shown to be a key problem for efficiently establishing various behavioural and anonymity properties of probabilistic systems. In recent experiments a randomised equivalence test based on polynomial identity testing outperformed deterministic algorithms. In this paper we show that polynomial identity testing yields efficient algorithms for various generalisations of the equivalence problem. First, we provide a randomized NC procedure that also outputs a counterexample trace in case of inequivalence. Second, we show how to check for eq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4644","kind":"arxiv","version":2},"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:05:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KAifU/s8an5rKjTyB6xVLuN44ESeve2sHsTxiDD/9disOqH30+4eGetYMTI8IDVIznhy3Azuzypep/Gc1BoEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T15:38:52.719289Z"},"content_sha256":"c1dfbcad9952c47906ae8beed50501a66b07976c786df4f090d4dddb4a5fd85b","schema_version":"1.0","event_id":"sha256:c1dfbcad9952c47906ae8beed50501a66b07976c786df4f090d4dddb4a5fd85b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UWO4DVHJZBRIOCXL3ZXXZDQOQ5/bundle.json","state_url":"https://pith.science/pith/UWO4DVHJZBRIOCXL3ZXXZDQOQ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UWO4DVHJZBRIOCXL3ZXXZDQOQ5/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-06-24T15:38:52Z","links":{"resolver":"https://pith.science/pith/UWO4DVHJZBRIOCXL3ZXXZDQOQ5","bundle":"https://pith.science/pith/UWO4DVHJZBRIOCXL3ZXXZDQOQ5/bundle.json","state":"https://pith.science/pith/UWO4DVHJZBRIOCXL3ZXXZDQOQ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UWO4DVHJZBRIOCXL3ZXXZDQOQ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UWO4DVHJZBRIOCXL3ZXXZDQOQ5","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":"0043ea5dfee5817711486fbbb343ebf9d213ca20426a6f6bb57aba6bf50426fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-12-20T10:47:45Z","title_canon_sha256":"3f159f2bae93b5f9970e2bc84e8210ced2c2c8fd2f21f411ff056581e30f9e22"},"schema_version":"1.0","source":{"id":"1112.4644","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.4644","created_at":"2026-05-18T04:05:05Z"},{"alias_kind":"arxiv_version","alias_value":"1112.4644v2","created_at":"2026-05-18T04:05:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.4644","created_at":"2026-05-18T04:05:05Z"},{"alias_kind":"pith_short_12","alias_value":"UWO4DVHJZBRI","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UWO4DVHJZBRIOCXL","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UWO4DVHJ","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:c1dfbcad9952c47906ae8beed50501a66b07976c786df4f090d4dddb4a5fd85b","target":"graph","created_at":"2026-05-18T04:05:05Z","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":"Checking two probabilistic automata for equivalence has been shown to be a key problem for efficiently establishing various behavioural and anonymity properties of probabilistic systems. In recent experiments a randomised equivalence test based on polynomial identity testing outperformed deterministic algorithms. In this paper we show that polynomial identity testing yields efficient algorithms for various generalisations of the equivalence problem. First, we provide a randomized NC procedure that also outputs a counterexample trace in case of inequivalence. Second, we show how to check for eq","authors_text":"Andrzej S. Murawski, Bj\\\"orn Wachter, James Worrell, Jo\\\"el Ouaknine, Stefan Kiefer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-12-20T10:47:45Z","title":"On the Complexity of the Equivalence Problem for Probabilistic Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.4644","kind":"arxiv","version":2},"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:5e04fb955b306d53041f1d1c3f3632a3ebdda2f33ac741876c19cd0c7c03e1e9","target":"record","created_at":"2026-05-18T04:05:05Z","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":"0043ea5dfee5817711486fbbb343ebf9d213ca20426a6f6bb57aba6bf50426fb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-12-20T10:47:45Z","title_canon_sha256":"3f159f2bae93b5f9970e2bc84e8210ced2c2c8fd2f21f411ff056581e30f9e22"},"schema_version":"1.0","source":{"id":"1112.4644","kind":"arxiv","version":2}},"canonical_sha256":"a59dc1d4e9c862870aebde6f7c8e0e877c9f97cbe6cde8f1f3e643ecb2955946","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a59dc1d4e9c862870aebde6f7c8e0e877c9f97cbe6cde8f1f3e643ecb2955946","first_computed_at":"2026-05-18T04:05:05.016746Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:05:05.016746Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MKOw7w6TiiXIedzLLjE3q4Z0aoMqgqgyURHUYlLYj1scYF0zGCvOlw91JGxeTLZSztys0iuUBqv6BCqDRhJJAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:05:05.017229Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.4644","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e04fb955b306d53041f1d1c3f3632a3ebdda2f33ac741876c19cd0c7c03e1e9","sha256:c1dfbcad9952c47906ae8beed50501a66b07976c786df4f090d4dddb4a5fd85b"],"state_sha256":"6403b17515b3ff1eaaf03891f5931455990cdcd8822a897426381ea707dfebd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0GNC7DOp13RvoSJULOWQy/7PKF3DK+dLYyq6T6itNFpQsJTs9vrG1UTFQW8/4p0yg09fed7BUi4NPuAq6ywMAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T15:38:52.721255Z","bundle_sha256":"bab7a2ad416f4bfef8f73784477735cd00c5135f51e3778a126d6f0d547c1c1e"}}