{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XDVUKATFIH23OC2QATQS5KP3UP","short_pith_number":"pith:XDVUKATF","schema_version":"1.0","canonical_sha256":"b8eb45026541f5b70b5004e12ea9fba3c3e452f242f854df79d764efe94e5701","source":{"kind":"arxiv","id":"2505.09963","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.SE","authors_text":"Anthony W. Lin, Chih-Duo Hong, Philipp R\\\"ummer, Rupak Majumdar","submitted_at":"2025-05-15T04:56:53Z","abstract_excerpt":"Bisimulation is crucial for verifying process equivalence in probabilistic systems. This paper presents a novel logical framework for analyzing bisimulation in probabilistic parameterized systems, namely, infinite families of finite-state probabilistic systems. Our framework is built upon the first-order theory of regular structures, which provides a decidable logic for reasoning about these systems. We show that essential properties like anonymity and uniformity can be encoded and verified within this framework in a manner aligning with the principles of deductive software verification, where"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2505.09963","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2025-05-15T04:56:53Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"6c0af48d3d5d79e50cb86e08725c8a8e138b634114e464e4a7f246faac00b81a","abstract_canon_sha256":"fb58b90badf62aad3d47b3237b8c520cf0c47f84f2a59e89dee4937f9e857c4c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:03:31.179771Z","signature_b64":"N4KGDqRUeE797zEwA3dOn6pK4m+k31etKTBkZuoFFAES9mxwA8NUe+d5l63IOyRUVwceZjVBYPTDFGCWYsOYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8eb45026541f5b70b5004e12ea9fba3c3e452f242f854df79d764efe94e5701","last_reissued_at":"2026-07-05T11:03:31.179328Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:03:31.179328Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.SE","authors_text":"Anthony W. Lin, Chih-Duo Hong, Philipp R\\\"ummer, Rupak Majumdar","submitted_at":"2025-05-15T04:56:53Z","abstract_excerpt":"Bisimulation is crucial for verifying process equivalence in probabilistic systems. This paper presents a novel logical framework for analyzing bisimulation in probabilistic parameterized systems, namely, infinite families of finite-state probabilistic systems. Our framework is built upon the first-order theory of regular structures, which provides a decidable logic for reasoning about these systems. We show that essential properties like anonymity and uniformity can be encoded and verified within this framework in a manner aligning with the principles of deductive software verification, where"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.09963","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.09963/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2505.09963","created_at":"2026-07-05T11:03:31.179387+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.09963v1","created_at":"2026-07-05T11:03:31.179387+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.09963","created_at":"2026-07-05T11:03:31.179387+00:00"},{"alias_kind":"pith_short_12","alias_value":"XDVUKATFIH23","created_at":"2026-07-05T11:03:31.179387+00:00"},{"alias_kind":"pith_short_16","alias_value":"XDVUKATFIH23OC2Q","created_at":"2026-07-05T11:03:31.179387+00:00"},{"alias_kind":"pith_short_8","alias_value":"XDVUKATF","created_at":"2026-07-05T11:03:31.179387+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XDVUKATFIH23OC2QATQS5KP3UP","json":"https://pith.science/pith/XDVUKATFIH23OC2QATQS5KP3UP.json","graph_json":"https://pith.science/api/pith-number/XDVUKATFIH23OC2QATQS5KP3UP/graph.json","events_json":"https://pith.science/api/pith-number/XDVUKATFIH23OC2QATQS5KP3UP/events.json","paper":"https://pith.science/paper/XDVUKATF"},"agent_actions":{"view_html":"https://pith.science/pith/XDVUKATFIH23OC2QATQS5KP3UP","download_json":"https://pith.science/pith/XDVUKATFIH23OC2QATQS5KP3UP.json","view_paper":"https://pith.science/paper/XDVUKATF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.09963&json=true","fetch_graph":"https://pith.science/api/pith-number/XDVUKATFIH23OC2QATQS5KP3UP/graph.json","fetch_events":"https://pith.science/api/pith-number/XDVUKATFIH23OC2QATQS5KP3UP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XDVUKATFIH23OC2QATQS5KP3UP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XDVUKATFIH23OC2QATQS5KP3UP/action/storage_attestation","attest_author":"https://pith.science/pith/XDVUKATFIH23OC2QATQS5KP3UP/action/author_attestation","sign_citation":"https://pith.science/pith/XDVUKATFIH23OC2QATQS5KP3UP/action/citation_signature","submit_replication":"https://pith.science/pith/XDVUKATFIH23OC2QATQS5KP3UP/action/replication_record"}},"created_at":"2026-07-05T11:03:31.179387+00:00","updated_at":"2026-07-05T11:03:31.179387+00:00"}