{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7ZZ6C3X7567T7PLVLPGHXJR4IL","short_pith_number":"pith:7ZZ6C3X7","canonical_record":{"source":{"id":"1106.2181","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-06-10T22:03:53Z","cross_cats_sorted":[],"title_canon_sha256":"ebd92c8d55642ffa5fcc2332f45da696b0b85357b9c7fd2fa2051e83af5ae9f5","abstract_canon_sha256":"734a39be02091699cf4009a71212243890e383d160bc626cfe062f8ba3177efb"},"schema_version":"1.0"},"canonical_sha256":"fe73e16effefbf3fbd755bcc7ba63c42f138f0599eb1087fcb4401bc114bae2a","source":{"kind":"arxiv","id":"1106.2181","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2181","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2181v5","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2181","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"7ZZ6C3X7567T","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7ZZ6C3X7567T7PLV","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7ZZ6C3X7","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7ZZ6C3X7567T7PLVLPGHXJR4IL","target":"record","payload":{"canonical_record":{"source":{"id":"1106.2181","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-06-10T22:03:53Z","cross_cats_sorted":[],"title_canon_sha256":"ebd92c8d55642ffa5fcc2332f45da696b0b85357b9c7fd2fa2051e83af5ae9f5","abstract_canon_sha256":"734a39be02091699cf4009a71212243890e383d160bc626cfe062f8ba3177efb"},"schema_version":"1.0"},"canonical_sha256":"fe73e16effefbf3fbd755bcc7ba63c42f138f0599eb1087fcb4401bc114bae2a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:39.431854Z","signature_b64":"1zwRFRuSm92Lbvhp1DAN9Lo75wvRboEMmqPBKbaKgR36+wD3w/JmaqYHTLFZuA25BDIMynIOQSr54LffhVJsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe73e16effefbf3fbd755bcc7ba63c42f138f0599eb1087fcb4401bc114bae2a","last_reissued_at":"2026-05-18T01:37:39.431108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:39.431108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.2181","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-18T01:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tW5PopOgp6bvLO3sYfll4Q2JuojmAzt8A++QRhygDCvruSJzuty82uH8EhPHwIJ/8AxvO7o/3pThviZoLMi4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:17:56.206187Z"},"content_sha256":"c73e890e3ac5f2bcf2b431361ccd9695c9e3d068d35b6359ff6cf330ac1d8f66","schema_version":"1.0","event_id":"sha256:c73e890e3ac5f2bcf2b431361ccd9695c9e3d068d35b6359ff6cf330ac1d8f66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7ZZ6C3X7567T7PLVLPGHXJR4IL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bisimulations Meet PCTL Equivalences for Probabilistic Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Denmark), Flemming Nielson (DTU Compute, Jens Chr. Godskesen (IT University of Copenhagen, Lei Song (IT University of Copenhagen, Lijun Zhang (DTU Informatics, Technical University of Denmark)","submitted_at":"2011-06-10T22:03:53Z","abstract_excerpt":"Probabilistic automata (PAs) have been successfully applied in formal verification of concurrent and stochastic systems. Efficient model checking algorithms have been studied, where the most often used logics for expressing properties are based on probabilistic computation tree logic (PCTL) and its extension PCTL^*. Various behavioral equivalences are proposed, as a powerful tool for abstraction and compositional minimization for PAs. Unfortunately, the equivalences are well-known to be sound, but not complete with respect to the logical equivalences induced by PCTL or PCTL*. The desire of a b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2181","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-18T01:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EENK++oWx6YHs7liDvD1wL9a/CI9GUu3tkwW+jFYSY3FyDTRu6UMPAJUrRnX9H6oUxmw3a0F+MHzFeQ2mQnmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:17:56.206910Z"},"content_sha256":"fc4fc375a119dc37db14d73907f6496925d5faf9cee2cd418bd9d804051c1606","schema_version":"1.0","event_id":"sha256:fc4fc375a119dc37db14d73907f6496925d5faf9cee2cd418bd9d804051c1606"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7ZZ6C3X7567T7PLVLPGHXJR4IL/bundle.json","state_url":"https://pith.science/pith/7ZZ6C3X7567T7PLVLPGHXJR4IL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7ZZ6C3X7567T7PLVLPGHXJR4IL/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-06T21:17:56Z","links":{"resolver":"https://pith.science/pith/7ZZ6C3X7567T7PLVLPGHXJR4IL","bundle":"https://pith.science/pith/7ZZ6C3X7567T7PLVLPGHXJR4IL/bundle.json","state":"https://pith.science/pith/7ZZ6C3X7567T7PLVLPGHXJR4IL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7ZZ6C3X7567T7PLVLPGHXJR4IL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7ZZ6C3X7567T7PLVLPGHXJR4IL","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":"734a39be02091699cf4009a71212243890e383d160bc626cfe062f8ba3177efb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-06-10T22:03:53Z","title_canon_sha256":"ebd92c8d55642ffa5fcc2332f45da696b0b85357b9c7fd2fa2051e83af5ae9f5"},"schema_version":"1.0","source":{"id":"1106.2181","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.2181","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"1106.2181v5","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.2181","created_at":"2026-05-18T01:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"7ZZ6C3X7567T","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7ZZ6C3X7567T7PLV","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7ZZ6C3X7","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:fc4fc375a119dc37db14d73907f6496925d5faf9cee2cd418bd9d804051c1606","target":"graph","created_at":"2026-05-18T01:37:39Z","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":"Probabilistic automata (PAs) have been successfully applied in formal verification of concurrent and stochastic systems. Efficient model checking algorithms have been studied, where the most often used logics for expressing properties are based on probabilistic computation tree logic (PCTL) and its extension PCTL^*. Various behavioral equivalences are proposed, as a powerful tool for abstraction and compositional minimization for PAs. Unfortunately, the equivalences are well-known to be sound, but not complete with respect to the logical equivalences induced by PCTL or PCTL*. The desire of a b","authors_text":"Denmark), Flemming Nielson (DTU Compute, Jens Chr. Godskesen (IT University of Copenhagen, Lei Song (IT University of Copenhagen, Lijun Zhang (DTU Informatics, Technical University of Denmark)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-06-10T22:03:53Z","title":"Bisimulations Meet PCTL Equivalences for Probabilistic Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.2181","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:c73e890e3ac5f2bcf2b431361ccd9695c9e3d068d35b6359ff6cf330ac1d8f66","target":"record","created_at":"2026-05-18T01:37:39Z","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":"734a39be02091699cf4009a71212243890e383d160bc626cfe062f8ba3177efb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-06-10T22:03:53Z","title_canon_sha256":"ebd92c8d55642ffa5fcc2332f45da696b0b85357b9c7fd2fa2051e83af5ae9f5"},"schema_version":"1.0","source":{"id":"1106.2181","kind":"arxiv","version":5}},"canonical_sha256":"fe73e16effefbf3fbd755bcc7ba63c42f138f0599eb1087fcb4401bc114bae2a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe73e16effefbf3fbd755bcc7ba63c42f138f0599eb1087fcb4401bc114bae2a","first_computed_at":"2026-05-18T01:37:39.431108Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:39.431108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1zwRFRuSm92Lbvhp1DAN9Lo75wvRboEMmqPBKbaKgR36+wD3w/JmaqYHTLFZuA25BDIMynIOQSr54LffhVJsDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:39.431854Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.2181","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c73e890e3ac5f2bcf2b431361ccd9695c9e3d068d35b6359ff6cf330ac1d8f66","sha256:fc4fc375a119dc37db14d73907f6496925d5faf9cee2cd418bd9d804051c1606"],"state_sha256":"4f476888546603169ef903790ebef72c81acde3dca3feb338f7e86f78ffb789f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vZNgVazw4IgmbBaH4miU7/0pTNM3+DkWRK8ZVmgeRjUtoXA1JyQV631IBm6fsCen2C36G+fAoqsTy4BzODm2Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:17:56.210470Z","bundle_sha256":"96a5c446470b665092f6ffe3caafdab8231701db619565f22184c548c5013617"}}