{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CEVDXG7LFOWOSPHZNPTOIQP22X","short_pith_number":"pith:CEVDXG7L","canonical_record":{"source":{"id":"1710.10756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-10-30T03:33:46Z","cross_cats_sorted":["cs.DC","cs.FL"],"title_canon_sha256":"fb6a66c5519b898ab39f68c1721ac827dff4e6dad4d3f78636ae92b483f4575b","abstract_canon_sha256":"fe7f7b8e1a27608f6829b827aea9556b3e0e6d9e7441aef7ce0f62a54f36bc8e"},"schema_version":"1.0"},"canonical_sha256":"112a3b9beb2bace93cf96be6e441fad5cd6c514e757b08bc36a8d11cda58a77a","source":{"kind":"arxiv","id":"1710.10756","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10756","created_at":"2026-05-18T00:31:46Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10756v1","created_at":"2026-05-18T00:31:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10756","created_at":"2026-05-18T00:31:46Z"},{"alias_kind":"pith_short_12","alias_value":"CEVDXG7LFOWO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CEVDXG7LFOWOSPHZ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CEVDXG7L","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CEVDXG7LFOWOSPHZNPTOIQP22X","target":"record","payload":{"canonical_record":{"source":{"id":"1710.10756","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-10-30T03:33:46Z","cross_cats_sorted":["cs.DC","cs.FL"],"title_canon_sha256":"fb6a66c5519b898ab39f68c1721ac827dff4e6dad4d3f78636ae92b483f4575b","abstract_canon_sha256":"fe7f7b8e1a27608f6829b827aea9556b3e0e6d9e7441aef7ce0f62a54f36bc8e"},"schema_version":"1.0"},"canonical_sha256":"112a3b9beb2bace93cf96be6e441fad5cd6c514e757b08bc36a8d11cda58a77a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:46.576853Z","signature_b64":"iq5iYy1HMQq6i7L8JimyGipjwrJS/zaaZCp8Ln2EUv3BIWQoOGXTH4pMHW9n81/xrJBXB9cLp+9dZ3jfjSgKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"112a3b9beb2bace93cf96be6e441fad5cd6c514e757b08bc36a8d11cda58a77a","last_reissued_at":"2026-05-18T00:31:46.576242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:46.576242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.10756","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-18T00:31:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gaU5GpaQSFzLfZ+PfwRPH1ILDDUOzt9VNuswJE15JoqyBHfaloWqjViT4i6mkswJDOVW9NcHcCrMGRXjuDd+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:07:26.738732Z"},"content_sha256":"e150007c1f410b026852bd0f928daba62012d49df9e7045eaa3f5142af520be9","schema_version":"1.0","event_id":"sha256:e150007c1f410b026852bd0f928daba62012d49df9e7045eaa3f5142af520be9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CEVDXG7LFOWOSPHZNPTOIQP22X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.FL"],"primary_cat":"cs.LO","authors_text":"Anthony W. Lin, Ondrej Lengal, Philipp Ruemmer, Rupak Majumdar","submitted_at":"2017-10-30T03:33:46Z","abstract_excerpt":"We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversarial schedulers. A parameterized family defines an infinite-state system: for each number n, the family consists of an instance with n finite-state processes. In contrast to safety, the parameterized verification of liveness is currently still considered extremely challenging especially in the presence of probabilities in the model. One major challenge is to provide a sufficiently powerful symbolic framework. One wel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10756","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-18T00:31:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jcbwoK6OzUFpVVRUXe6WzTUjyHFzE3aqhDKcCd2gKJuJfl+HPnjmwBWd61ByldyZ3dT/fzI1MJ31qH0CfVieAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:07:26.739456Z"},"content_sha256":"afef6cba2edf4a0c94ef5a4e279bcdfe79361c16eae7fe36c54c3b02a29f59a3","schema_version":"1.0","event_id":"sha256:afef6cba2edf4a0c94ef5a4e279bcdfe79361c16eae7fe36c54c3b02a29f59a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CEVDXG7LFOWOSPHZNPTOIQP22X/bundle.json","state_url":"https://pith.science/pith/CEVDXG7LFOWOSPHZNPTOIQP22X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CEVDXG7LFOWOSPHZNPTOIQP22X/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-07T14:07:26Z","links":{"resolver":"https://pith.science/pith/CEVDXG7LFOWOSPHZNPTOIQP22X","bundle":"https://pith.science/pith/CEVDXG7LFOWOSPHZNPTOIQP22X/bundle.json","state":"https://pith.science/pith/CEVDXG7LFOWOSPHZNPTOIQP22X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CEVDXG7LFOWOSPHZNPTOIQP22X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CEVDXG7LFOWOSPHZNPTOIQP22X","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":"fe7f7b8e1a27608f6829b827aea9556b3e0e6d9e7441aef7ce0f62a54f36bc8e","cross_cats_sorted":["cs.DC","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-10-30T03:33:46Z","title_canon_sha256":"fb6a66c5519b898ab39f68c1721ac827dff4e6dad4d3f78636ae92b483f4575b"},"schema_version":"1.0","source":{"id":"1710.10756","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10756","created_at":"2026-05-18T00:31:46Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10756v1","created_at":"2026-05-18T00:31:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10756","created_at":"2026-05-18T00:31:46Z"},{"alias_kind":"pith_short_12","alias_value":"CEVDXG7LFOWO","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CEVDXG7LFOWOSPHZ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CEVDXG7L","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:afef6cba2edf4a0c94ef5a4e279bcdfe79361c16eae7fe36c54c3b02a29f59a3","target":"graph","created_at":"2026-05-18T00:31:46Z","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":"We consider the problem of automatically verifying that a parameterized family of probabilistic concurrent systems terminates with probability one for all instances against adversarial schedulers. A parameterized family defines an infinite-state system: for each number n, the family consists of an instance with n finite-state processes. In contrast to safety, the parameterized verification of liveness is currently still considered extremely challenging especially in the presence of probabilities in the model. One major challenge is to provide a sufficiently powerful symbolic framework. One wel","authors_text":"Anthony W. Lin, Ondrej Lengal, Philipp Ruemmer, Rupak Majumdar","cross_cats":["cs.DC","cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-10-30T03:33:46Z","title":"Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10756","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:e150007c1f410b026852bd0f928daba62012d49df9e7045eaa3f5142af520be9","target":"record","created_at":"2026-05-18T00:31:46Z","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":"fe7f7b8e1a27608f6829b827aea9556b3e0e6d9e7441aef7ce0f62a54f36bc8e","cross_cats_sorted":["cs.DC","cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-10-30T03:33:46Z","title_canon_sha256":"fb6a66c5519b898ab39f68c1721ac827dff4e6dad4d3f78636ae92b483f4575b"},"schema_version":"1.0","source":{"id":"1710.10756","kind":"arxiv","version":1}},"canonical_sha256":"112a3b9beb2bace93cf96be6e441fad5cd6c514e757b08bc36a8d11cda58a77a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"112a3b9beb2bace93cf96be6e441fad5cd6c514e757b08bc36a8d11cda58a77a","first_computed_at":"2026-05-18T00:31:46.576242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:46.576242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iq5iYy1HMQq6i7L8JimyGipjwrJS/zaaZCp8Ln2EUv3BIWQoOGXTH4pMHW9n81/xrJBXB9cLp+9dZ3jfjSgKAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:46.576853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.10756","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e150007c1f410b026852bd0f928daba62012d49df9e7045eaa3f5142af520be9","sha256:afef6cba2edf4a0c94ef5a4e279bcdfe79361c16eae7fe36c54c3b02a29f59a3"],"state_sha256":"3ed6a2b1955db5547bd1d91daade73286d24158349d297f82fbb21636ba565cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFvdil9Kk+6nYMJP+77O+uaYlhID4SIBZbXn6Baz4K2JcC7IN1tWGPbFMRdb64bmLqLBh9/gw1Kl5Q0PJTEwAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:07:26.747027Z","bundle_sha256":"359a4bdc43d60272180ecce2eeb83e219dfed86dd2e5529afaab8f1df5afbe46"}}