{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6ISICEWWANG45EBWBEM7E4GXE4","short_pith_number":"pith:6ISICEWW","canonical_record":{"source":{"id":"1307.7442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-07-29T02:10:27Z","cross_cats_sorted":[],"title_canon_sha256":"bc1051b81d32143db1003117423c18193b6ba12bfc649c1a1b6a7d26293563ea","abstract_canon_sha256":"bc862fb6da8dcef97df10455d1cfafc38fa6534ba264941d2c0fba8e6b585e39"},"schema_version":"1.0"},"canonical_sha256":"f2248112d6034dce90360919f270d7270ddc1ff865a54a2de599f3a7f80eb8e4","source":{"kind":"arxiv","id":"1307.7442","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7442","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7442v1","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7442","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"pith_short_12","alias_value":"6ISICEWWANG4","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6ISICEWWANG45EBW","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6ISICEWW","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6ISICEWWANG45EBWBEM7E4GXE4","target":"record","payload":{"canonical_record":{"source":{"id":"1307.7442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-07-29T02:10:27Z","cross_cats_sorted":[],"title_canon_sha256":"bc1051b81d32143db1003117423c18193b6ba12bfc649c1a1b6a7d26293563ea","abstract_canon_sha256":"bc862fb6da8dcef97df10455d1cfafc38fa6534ba264941d2c0fba8e6b585e39"},"schema_version":"1.0"},"canonical_sha256":"f2248112d6034dce90360919f270d7270ddc1ff865a54a2de599f3a7f80eb8e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:23.283821Z","signature_b64":"qBGcziTsvG93Ht5LLxqDJplm4P7+8SXlbAhbF3ivnBeOcApQfyh+bYEGVHB/AhdDfdYjVPfqCcNXL78iZfvmCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2248112d6034dce90360919f270d7270ddc1ff865a54a2de599f3a7f80eb8e4","last_reissued_at":"2026-05-18T03:17:23.283371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:23.283371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1307.7442","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-18T03:17:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rCE6rz1a1TBOfZjmmRtheHJmqEmlD/rU/R8lTOHaI3TunEzeYs7bwun2OuqtaCok2hWhzrpZzOAOGQA8rpaWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:17:27.368928Z"},"content_sha256":"f84a5fdf7328b98fbf2151ac7accf39aa74d31bafe8ec7ee79c51f84aba65b08","schema_version":"1.0","event_id":"sha256:f84a5fdf7328b98fbf2151ac7accf39aa74d31bafe8ec7ee79c51f84aba65b08"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6ISICEWWANG45EBWBEM7E4GXE4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compositionality of Approximate Bisimulation for Probabilistic Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Daniel Gebler (Department of Computer Science, Simone Tini (Department of Scienza e Alta Tecnologia, University of Insubria), VU University Amsterdam)","submitted_at":"2013-07-29T02:10:27Z","abstract_excerpt":"Probabilistic transition system specifications using the rule format ntmuft-ntmuxt provide structural operational semantics for Segala-type systems and guarantee that probabilistic bisimilarity is a congruence. Probabilistic bisimilarity is for many applications too sensitive to the exact probabilities of transitions. Approximate bisimulation provides a robust semantics that is stable with respect to implementation and measurement errors of probabilistic behavior. We provide a general method to quantify how much a process combinator  expands the approximate bisimulation distance. As a direct a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7442","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-18T03:17:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vi/UGud7o33+XKpRWwCihPv2zUSOkX7dDsE/wibO9BfumbJZzc9v7s98kQHw2+ZRHjX925zSxbiP0Munt9IlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:17:27.369270Z"},"content_sha256":"1f8accc88cd478780b3b71d1604e277e94fa8a1393237d9f98c9039dc0562c0c","schema_version":"1.0","event_id":"sha256:1f8accc88cd478780b3b71d1604e277e94fa8a1393237d9f98c9039dc0562c0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6ISICEWWANG45EBWBEM7E4GXE4/bundle.json","state_url":"https://pith.science/pith/6ISICEWWANG45EBWBEM7E4GXE4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6ISICEWWANG45EBWBEM7E4GXE4/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-03T17:17:27Z","links":{"resolver":"https://pith.science/pith/6ISICEWWANG45EBWBEM7E4GXE4","bundle":"https://pith.science/pith/6ISICEWWANG45EBWBEM7E4GXE4/bundle.json","state":"https://pith.science/pith/6ISICEWWANG45EBWBEM7E4GXE4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6ISICEWWANG45EBWBEM7E4GXE4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6ISICEWWANG45EBWBEM7E4GXE4","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":"bc862fb6da8dcef97df10455d1cfafc38fa6534ba264941d2c0fba8e6b585e39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-07-29T02:10:27Z","title_canon_sha256":"bc1051b81d32143db1003117423c18193b6ba12bfc649c1a1b6a7d26293563ea"},"schema_version":"1.0","source":{"id":"1307.7442","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.7442","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"arxiv_version","alias_value":"1307.7442v1","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.7442","created_at":"2026-05-18T03:17:23Z"},{"alias_kind":"pith_short_12","alias_value":"6ISICEWWANG4","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6ISICEWWANG45EBW","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6ISICEWW","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:1f8accc88cd478780b3b71d1604e277e94fa8a1393237d9f98c9039dc0562c0c","target":"graph","created_at":"2026-05-18T03:17:23Z","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 transition system specifications using the rule format ntmuft-ntmuxt provide structural operational semantics for Segala-type systems and guarantee that probabilistic bisimilarity is a congruence. Probabilistic bisimilarity is for many applications too sensitive to the exact probabilities of transitions. Approximate bisimulation provides a robust semantics that is stable with respect to implementation and measurement errors of probabilistic behavior. We provide a general method to quantify how much a process combinator  expands the approximate bisimulation distance. As a direct a","authors_text":"Daniel Gebler (Department of Computer Science, Simone Tini (Department of Scienza e Alta Tecnologia, University of Insubria), VU University Amsterdam)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-07-29T02:10:27Z","title":"Compositionality of Approximate Bisimulation for Probabilistic Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.7442","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:f84a5fdf7328b98fbf2151ac7accf39aa74d31bafe8ec7ee79c51f84aba65b08","target":"record","created_at":"2026-05-18T03:17:23Z","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":"bc862fb6da8dcef97df10455d1cfafc38fa6534ba264941d2c0fba8e6b585e39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2013-07-29T02:10:27Z","title_canon_sha256":"bc1051b81d32143db1003117423c18193b6ba12bfc649c1a1b6a7d26293563ea"},"schema_version":"1.0","source":{"id":"1307.7442","kind":"arxiv","version":1}},"canonical_sha256":"f2248112d6034dce90360919f270d7270ddc1ff865a54a2de599f3a7f80eb8e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2248112d6034dce90360919f270d7270ddc1ff865a54a2de599f3a7f80eb8e4","first_computed_at":"2026-05-18T03:17:23.283371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:17:23.283371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qBGcziTsvG93Ht5LLxqDJplm4P7+8SXlbAhbF3ivnBeOcApQfyh+bYEGVHB/AhdDfdYjVPfqCcNXL78iZfvmCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:17:23.283821Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.7442","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f84a5fdf7328b98fbf2151ac7accf39aa74d31bafe8ec7ee79c51f84aba65b08","sha256:1f8accc88cd478780b3b71d1604e277e94fa8a1393237d9f98c9039dc0562c0c"],"state_sha256":"ee043060501b12fc202718761c52953b3b81f10dc2ef046a88f14d4b61b1755a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v7igmiduHkHjMU/iS50rNUqXbJ5qENewVOxPlxqUbsXm4uGZfYot9z2aUIY5WlIst+x1Bx2Z9bRRs29mqfohAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:17:27.371205Z","bundle_sha256":"0a9dba731466bcc92c4f27306ac4249116f57485deeaa9a1d307827dfd2820bf"}}