{"as_of":"2026-08-22T02:41:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f1b5eddc655601ffa94827b07bac8277fad9c12e812f29ba0dfc6e87214fce7f","coverage":[{"denominator":103,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:27:29.358753Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.09963/citation-record","integrity":"/paper/2505.09963/integrity","json":"/paper/2505.09963/citation-record.json","paper":"/paper/2505.09963"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.008276Z","title":"Milner, A calculus of communicating systems","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.008276Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:0f8af4e02703ad56e7e0a227692d400deb30f14268cda8d043dce322fb5b6042","observation_id":"6c8a0b4c-7bbd-43ef-ac70-fcca9d83e55c","resolution":{"observed_at":"2026-08-15T21:27:29.008276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.012567Z","title":"Prentice hall Englewood Cliffs, 1989, vol","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.012567Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:575420bbec29b9615735d5516b78f87c1dcf18788df59ca101ae5ab4fac07190","observation_id":"4656445c-32a9-4088-b049-a9e0323a126e","resolution":{"observed_at":"2026-08-15T21:27:29.012567Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.016402Z","title":"Model-driven software verification,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.016402Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:b83604553bced83ee5cfe6afd0b14dcdbc22f462c39ef64c0a9ed374602cda70","observation_id":"539f875a-8d75-44ba-86d5-4c634124c6a3","resolution":{"observed_at":"2026-08-15T21:27:29.016402Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.019864Z","title":"Deriving bisimulation rela- tions from path extension based equivalence checkers,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.019864Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:8e22bee1db6ac76c1ef1d654174702bb462ca2aa3d36341ccb8cd9f3b6cf04c9","observation_id":"5084bb5c-71c8-4973-b52b-638f3040c397","resolution":{"observed_at":"2026-08-15T21:27:29.019864Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.023415Z","title":"A core calculus for equational proofs of cryptographic protocols,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.023415Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:98a0dbb48caad4fb7882d7a3376836a3cbc8845be011fc1dec86deb911ae67e6","observation_id":"d70efff4-3b12-489c-9f0d-1d04b592055c","resolution":{"observed_at":"2026-08-15T21:27:29.023415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.026961Z","title":"Probabilistic bisimulation and equivalence for security analysis of network proto- cols,","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.026961Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:01dd522f57acee318a8599370f45b3f7e59dbc5671a0b46af8a1d1c5657b3b13","observation_id":"c5edf79f-eb68-479a-895a-1f7ecc24d1ef","resolution":{"observed_at":"2026-08-15T21:27:29.026961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.030877Z","title":"A logical char- acterization of differential privacy,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.030877Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:c5a262ffa67f735a695018d3624b8b405c0f995fd6026368bba46db062074104","observation_id":"e2b6b924-2c50-439d-b9a6-1bafcb6a2f7f","resolution":{"observed_at":"2026-08-15T21:27:29.030877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.034464Z","title":"Bisimulation for secure information flow analysis of multi-threaded programs,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.034464Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:6bc8bbb8ce25f9f873a44bedf547a22bbc65e951080041981a065fed817e0aed","observation_id":"acf2efc2-7dbf-4787-803b-43b09a84a43f","resolution":{"observed_at":"2026-08-15T21:27:29.034464Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.037756Z","title":"Refinement-based verification of device-to-device information flow,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.037756Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:2bcdb3f70f4c240c289c7f5743661e5ce0655831782f3e959e02910e6c948cdc","observation_id":"054babae-f1d4-4307-9f26-ceb0c59183e1","resolution":{"observed_at":"2026-08-15T21:27:29.037756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.041154Z","title":"An automated quantitative information flow analysis for concurrent programs,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.041154Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:530acf4275e9feb2ef2e5eea679a1490b1798507a6cf3854831438a487f0a409","observation_id":"1e1f16bc-4eb7-426c-99ee-50b1f60cb548","resolution":{"observed_at":"2026-08-15T21:27:29.041154Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.044681Z","title":"Quantifying over information change with common knowledge,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.044681Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:f4a3c976fcaf402c252b5d1a98e00ff7c8bb4606cd74f5828d97d2f09edab8bf","observation_id":"45e08e5c-f1e6-4ab2-8019-c3af000cce22","resolution":{"observed_at":"2026-08-15T21:27:29.044681Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.048225Z","title":"Bisimulation-based concept learning in description logics,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.048225Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:6c43cac0e0ec4be070690b22cf53359a1a6691eb1fc8cc480e32fd07abb967dc","observation_id":"8788672f-da0f-4818-89bc-45004700ff3f","resolution":{"observed_at":"2026-08-15T21:27:29.048225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.051657Z","title":"Bisimulations for knowing how logics,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.051657Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:8ed4fcc5d73d807d97dd446de74e015dba268cacfefcee85787fda817acd1acd","observation_id":"064eb78b-fc65-42a9-88c8-edcdfdc7b5c7","resolution":{"observed_at":"2026-08-15T21:27:29.051657Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.054894Z","title":"Trustworthy runtime verification via bisimulation (experience report),","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.054894Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:c15cb60bfba606ce882fca572aa2eee5d19d885a34a095577baf9b48db346dc2","observation_id":"ae67df91-ced2-496f-8d79-2f493f8c470d","resolution":{"observed_at":"2026-08-15T21:27:29.054894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.058339Z","title":"Checking NFA equivalence with bisimulations up to congruence,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.058339Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:def275a0e8a4816cf946fa6988206510a4761d4b2ce5f4fa592eeda0e32afed0","observation_id":"4238721c-55c1-4eb0-96c3-4c4e5201cd57","resolution":{"observed_at":"2026-08-15T21:27:29.058339Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.061595Z","title":"Coinductive algorithms for büchi automata,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.061595Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:f8210a940cd38df2a6f01c78c6b781163f1dfb62cc6abdf4f6ca39ec5cdd3789","observation_id":"f2dac237-9119-44f7-a9d9-bc8ef7456f34","resolution":{"observed_at":"2026-08-15T21:27:29.061595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.065178Z","title":"Fast coalgebraic bisimilarity minimiza- tion,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.065178Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:26ff96d2e32829d2c0af2b296eb9a62386f5c76e8b3cf8ebdf804812080ab86e","observation_id":"980bfb4a-45d0-4778-b38c-01cf0d10eff2","resolution":{"observed_at":"2026-08-15T21:27:29.065178Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.068427Z","title":"SMT-based bisimulation minimisation of Markov models,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.068427Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:c0c8010177c25dc8d045951b4959faeee0a8889aa5bcc5128d8c1b62c6f4eb14","observation_id":"40b25460-4b3c-4c71-9619-c014a7159aff","resolution":{"observed_at":"2026-08-15T21:27:29.068427Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.071911Z","title":"A bisimulation-based foundation for scale reductions of continuous-time markov chains,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.071911Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:b4d29c56934ba4eb65c34867bf4a8bf27205ba0d3391d87d290ca61f05ece25b","observation_id":"9c64090b-6006-4a12-a1ef-b27028ffe499","resolution":{"observed_at":"2026-08-15T21:27:29.071911Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.075252Z","title":"Bq-nco: Bisimulation quotienting for efficient neural combinatorial optimiza- tion,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.075252Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:45ca4c5caa508b67e0073a2ac0dee565b46877c6ef9b5215b9f411166db31d44","observation_id":"de1536ef-10dd-4e63-954b-686045e9afec","resolution":{"observed_at":"2026-08-15T21:27:29.075252Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.078641Z","title":"Backward bisimulation in markov chain model checking,","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.078641Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:1e6cd88b107fb417890083ef9186042d497fb6466854c6472c2caa24fa54005d","observation_id":"396adb72-4b8f-447f-a14c-c9d5e674bef5","resolution":{"observed_at":"2026-08-15T21:27:29.078641Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.082042Z","title":"Polynomial time algorithms for testing probabilistic bisimu- lation and simulation,","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.082042Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:c58056ab5d60772c6170843fbc7488ec6fedf9ac5c62870dc2aadd48969c6883","observation_id":"cc71b48b-c864-4bed-8bb1-dcba1b829839","resolution":{"observed_at":"2026-08-15T21:27:29.082042Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.085214Z","title":"Simple O(m log n) time markov chain lumping,","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.085214Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:72f139d5e43af535c220fe13384fbb407dd8be625211c399cb854cf2b505dda0","observation_id":"4546e47f-b6f7-4ddd-918e-48d480836939","resolution":{"observed_at":"2026-08-15T21:27:29.085214Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.264887Z","title":"On the complexity of computing probabilistic bisimilarity,","venue":null,"work_id":"555a35d2-abbf-437c-8811-d5a44344ff5e","year":2012},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.088751Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:1e096f5517cebc51c7861a8b06546899de92d0d8b9eed494ab7aa8235499bb7d","observation_id":"452ea74a-9c11-4c96-8ff5-cdb8915ed587","resolution":{"observed_at":"2026-08-15T21:27:30.368568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.254894Z","title":"Infinite results,","venue":null,"work_id":"739edd59-e7ef-42ad-94fb-3d83218fd62a","year":1996},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.092130Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:4839a4031b2f31403866cdfa80dae3170dd109091ca30ce6018251005fe1f910","observation_id":"d324a80c-70a2-4aa6-89df-b73d996ad7d4","resolution":{"observed_at":"2026-08-15T21:27:30.258424Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.244136Z","title":"Finite bisimulation of reactive untimed infinite state systems modeled as automata with variables,","venue":null,"work_id":"9a96b72d-53c3-4308-b92c-52317af2336c","year":2006},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.095356Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:437adbee93aeedda7ae70fcb1fc2f440f12e97d67129cca734e871b90e2d1fac","observation_id":"bcceae69-c93d-4d52-9846-f06951fbbb01","resolution":{"observed_at":"2026-08-15T21:27:30.247896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.233951Z","title":"Probabilistic bisimulation for parameterised systems,","venue":null,"work_id":"86b688c4-6497-4b5a-b22d-52f10ba9a38b","year":2019},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.098737Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:ee3b295698e8107a55851f6c3088aa2902470a2648d1dc2ceac046b47874333c","observation_id":"eb19962a-020d-4ec8-9161-0ed23784b1d6","resolution":{"observed_at":"2026-08-15T21:27:30.237354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.224308Z","title":"Bisimulation learning,","venue":null,"work_id":"70a4fbca-c4c6-4614-9420-10359baeea2d","year":2024},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.101939Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:942269524aad33a882bf19459daf07d44c294273e149d8354683c0baa4d9302e","observation_id":"51eb77d7-f3b4-4435-b8f7-9934fb951cfa","resolution":{"observed_at":"2026-08-15T21:27:30.227435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.214486Z","title":"Roadmap of infinite results,","venue":null,"work_id":"8dbee6a5-7b3c-4271-9b3a-39886b02971f","year":2004},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.105388Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:b30c6133be98d86caf9b906446730b5c95b7af90bd7699ce71fef99a21df46e7","observation_id":"887a90df-1e97-40b2-aa13-d897dd70bf4e","resolution":{"observed_at":"2026-08-15T21:27:30.217807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.204537Z","title":"The bisimulation problem for equational graphs of finite out-degree,","venue":null,"work_id":"de4aa7e3-82fd-4296-922a-e6713e99a7b8","year":2005},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.108756Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:4a6da03768eb66290bb7e98cfc224da287dd1c0a4d224330bc4b03f4e2f9e228","observation_id":"9aae0582-da13-4c6f-83eb-ffe6273468eb","resolution":{"observed_at":"2026-08-15T21:27:30.207835Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.194990Z","title":"Game characterization of probabilistic bisimilarity, and applications to pushdown automata,","venue":null,"work_id":"675d1b6c-8b75-4289-a3fa-c570784b2568","year":2018},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.111937Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:b0416ce00810c2132d7081560d49e1b745cf9f450d3c1d7cc3856cf403caddec","observation_id":"73cc41bf-5e9d-41a7-ae4d-a296abc783a2","resolution":{"observed_at":"2026-08-15T21:27:30.198516Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.185022Z","title":"Pushdown normal-form bisimulation: A nominal context-free approach to program equiva- lence,","venue":null,"work_id":"56957239-e814-4406-a543-074b53eea2dd","year":2024},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.115188Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:8ff70045bf3e860adbcb503f1b60148096bd45f3063b084439ac23693c78ab01","observation_id":"da034b5a-e274-4f47-badf-3a49000541a4","resolution":{"observed_at":"2026-08-15T21:27:30.188648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.175220Z","title":"Equivalence checking 40 years after: a review of bisimulation tools,","venue":null,"work_id":"49582f90-6444-409e-b0d3-3a9de1f26b01","year":2022},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.118915Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:c38c4e45ecfeb1ce17582659076bd91ec4a4929f6a786d7a9738305c4e8a282f","observation_id":"132a9979-1084-4c61-9ee9-0d9e202f40ba","resolution":{"observed_at":"2026-08-15T21:27:30.178650Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.165247Z","title":"Ahrendt, B","venue":null,"work_id":"679765e1-bef9-4ef2-ab06-560c5ca57f56","year":2016},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.122285Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:f34e140ef824861b656f68513735081351b9c5aca5be92816a091462ac7b765d","observation_id":"2778c3d8-ff8f-4ce5-bc95-f52650541930","resolution":{"observed_at":"2026-08-15T21:27:30.168712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.154932Z","title":"Deductive software verification: from pen-and-paper proofs to industrial tools,","venue":null,"work_id":"ac1af790-c83f-437f-a0de-dc06996a5bb9","year":2019},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.125945Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:73ea93d4bfad7fccb7ff27a0079a41f34da8d318d2ea805533d297fa090c506e","observation_id":"ddda838a-8e6f-4389-a025-b9154843c820","resolution":{"observed_at":"2026-08-15T21:27:30.158366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.144448Z","title":"Loop invariants: Analysis, clas- sification, and examples,","venue":null,"work_id":"f15f227b-8479-4247-b8fd-15dc399f995e","year":2014},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.129025Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:9a46e37a6bbc86f4a98e5f225e7161ea97465f4c98c164af5af1057b4491267d","observation_id":"cf9999a2-0ce2-42fc-8402-a2cde8a48947","resolution":{"observed_at":"2026-08-15T21:27:30.148141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.134217Z","title":"Finite presentations of infinite struc- tures: Automata and interpretations,","venue":null,"work_id":"e774e91d-fa2c-4151-bbdb-10861b15e1f8","year":2004},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.132360Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:697fc3de16e0fed817a83f3c87760f0dd8138cbed51958cfc060dd112f5e99a7","observation_id":"45a83de9-9b2e-49dd-8810-edb5cd1d1fa6","resolution":{"observed_at":"2026-08-15T21:27:30.137869Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.123738Z","title":"Transforming structures by set interpre- tations,","venue":null,"work_id":"96d7a8b7-e05f-407c-a350-9e16cafe3be3","year":2007},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.135715Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:6df915da6734e2eac223b86ccbb0e138e13172638273a62a210caf6bd9f8c224","observation_id":"526e7906-7856-4676-b185-55fb33b95bb7","resolution":{"observed_at":"2026-08-15T21:27:30.127171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.113407Z","title":"Regular model checking revisited,","venue":null,"work_id":"cb18c38c-6a75-4431-95ca-b33b0b6a2fe3","year":2022},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.139365Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:e8d8ac5f89bf0b614aa88fa6eaa0a741f28595d585a0cb711e99dec902049b40","observation_id":"4fe33d63-25e0-48e8-9452-073e34fb002e","resolution":{"observed_at":"2026-08-15T21:27:30.116911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.102633Z","title":"Probabilistic and nondeterministic aspects of anonymity,","venue":null,"work_id":"9a459989-1d55-4c91-b01f-b38769534745","year":2009},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.142774Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:45998e8aa24bdd5508885859093828aa2957bd16d538c34a8629b2f2712ca45f","observation_id":"aa682d5d-7442-4173-ab1e-8c4cf1485c82","resolution":{"observed_at":"2026-08-15T21:27:30.106676Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.091954Z","title":"Probabilistic anonymity,","venue":null,"work_id":"0ef7a3bd-1657-4ff0-9b37-b9d33be647bc","year":2005},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.146120Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:a56626555f78962d887b292b14a55f679d827efed92f5f8e4547a7a243c1e212","observation_id":"892ff4a9-2570-45c8-9ba6-78624f7f7ca1","resolution":{"observed_at":"2026-08-15T21:27:30.095700Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.081511Z","title":"Anonymity and information hiding in multiagent systems,","venue":null,"work_id":"98114292-b143-4c86-a3a8-8db65583fe60","year":2005},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.149332Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:a6106446b81653b78ac55ef629a2992c8b615a68cb237a39c181137464ecfa09","observation_id":"dbe694ea-6e67-4297-8d68-e75bc5975f53","resolution":{"observed_at":"2026-08-15T21:27:30.085019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1701.06477","last_updated":"2017-04-01T20:51:43Z","snapshot_observed_at":"2026-08-14T21:19:57.508784Z","submitted_at":"2017-01-23T16:23:29Z","title":"Proving uniformity and independence by self-composition and coupling","version":2},"cited_work":{"arxiv_id":"1701.06477","doi":null,"metadata_source":"pith","pith_arxiv_id":"1701.06477","snapshot_observed_at":"2026-08-15T21:27:29.470727Z","title":"Proving uniformity and independence by self-composition and coupling","venue":"cs.PL","work_id":"08a41948-5b03-43a8-9901-29de7d1fe8a9","year":2017},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.152933Z"},"links":{"cited_paper":"/paper/1701.06477","citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:a1619a3582602f6d7bb2866f651deb2ca41b8da950c073c27295290f08e3e660","observation_id":"663af989-582a-4799-8470-70dc8726348f","resolution":{"observed_at":"2026-08-15T21:27:29.474983Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.071768Z","title":"Barthe, J.-P","venue":null,"work_id":"51c70f12-f64f-4415-88fc-9d23d892f221","year":2020},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.157051Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:ce68079278b89149869fe74f08aba4ddaf6f1534ebf84f6514f0347b0e1d6b35","observation_id":"d698af71-1f39-43f0-b69f-a107ed09db03","resolution":{"observed_at":"2026-08-15T21:27:30.074870Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.061213Z","title":"The dining cryptographers problem: Unconditional sender and recipient untraceability,","venue":null,"work_id":"3347068e-3ac9-4c6d-8188-033914ad3776","year":1988},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.160370Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:6ee79a936ef63cdab175746cce6e2f4bf78dc7a3fb08fda5f39e2e2077d05aa6","observation_id":"408d9109-8234-480c-acc8-3a7bdea950b0","resolution":{"observed_at":"2026-08-15T21:27:30.064730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.050710Z","title":"Model checking param- eterized systems,","venue":null,"work_id":"356a979d-e75f-41a9-96b4-706bcdc24059","year":2018},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.163688Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:ec1d4d84ab9aaf40b6e7892e66dc68c918493f5ea7ca1cc419d2ca6d23d828d1","observation_id":"c9af94ef-f836-4fe9-8e49-84815f1acf44","resolution":{"observed_at":"2026-08-15T21:27:30.054090Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.039618Z","title":"Parameterized verification of leader/follower systems via arithmetic constraints,","venue":null,"work_id":"c54b263d-e3c7-4b9a-8f7f-3c08b7c6a245","year":2024},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.167001Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:f000bf34526890e2381540405602438a036f4eab6c59f8bd3cd76e083c6ba028","observation_id":"f58a9540-d993-45aa-b547-f46c58aa81f8","resolution":{"observed_at":"2026-08-15T21:27:30.042913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.028479Z","title":"Liveness of randomised parameterised systems under arbitrary schedulers,","venue":null,"work_id":"00817ea8-7982-4827-8abb-0dae1e2c9cc5","year":2016},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.170459Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:984c9b00238cc07fe4eaa5c9d96625a7bd875363e1191c9249f4aedbd9ad3f7f","observation_id":"be169cb9-8764-4d49-88ee-232f8372123c","resolution":{"observed_at":"2026-08-15T21:27:30.032762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.014234Z","title":"APEX: an analyzer for open probabilistic programs,","venue":null,"work_id":"c21cf3f2-b884-4bb4-a220-2ee57be3d37f","year":2012},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.173935Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:4ba81466b32c96d07651e1ed93101e553d87b416c7fb49ba504f53d7562b04b4","observation_id":"c6bea48c-65cd-4e3a-bb43-9e5431fd4cef","resolution":{"observed_at":"2026-08-15T21:27:30.019504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:30.002570Z","title":"Crowds: Anonymity for web transac- tions,","venue":null,"work_id":"74f7f80c-e68d-4b22-b3e2-e601cfa58ecd","year":1998},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.177247Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:7f135836ebf2dd84aaac4b661d0970de0c2cc999ef77d69e63581009dac37787","observation_id":"6365dde2-31f6-4d74-8ef6-e8a5f3f380b8","resolution":{"observed_at":"2026-08-15T21:27:30.006508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.991920Z","title":"The complexity of nonuniform random number generation,","venue":null,"work_id":"067a969d-dbcb-4b88-bc5e-c3e8026c216d","year":1976},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.181317Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:10aba33b29162a8b02a5c625cf95a7122b0db329211daae9e76473ac6d40cbdc","observation_id":"163badce-a674-49ee-8caa-b4f0479105c3","resolution":{"observed_at":"2026-08-15T21:27:29.995976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.980690Z","title":"Feller, An introduction to probability theory and its applications","venue":null,"work_id":"8284c2b2-5d47-41d7-b060-9f8d80158634","year":1991},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.184691Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:a88b2810b051702bd74800fb17d6a293ecad472a4addd2b1fef3d41d1651a181","observation_id":"792bf04c-cbec-4c7e-a336-9efa7c7c527f","resolution":{"observed_at":"2026-08-15T21:27:29.984860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.968300Z","title":"Learning to prove safety over parameterised concurrent systems,","venue":null,"work_id":"d23ce762-2b56-4cbb-98bb-57a51c4b2c66","year":2017},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.188168Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:4009bb788a27a6951b6de9514c25f9a487d53cae4f8b73e0f10b0d94cf1b4400","observation_id":"fdf6cc1a-d50f-4eb7-9109-142616ba1bfc","resolution":{"observed_at":"2026-08-15T21:27:29.972048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.956489Z","title":"Parameterized synthesis with safety properties,","venue":null,"work_id":"282ba9dd-4594-499a-b70d-b93ad4eb2a58","year":2020},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.191639Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:0955a1ef968b48185a7f23e4281d06a673b3dab647ce5ce9d07b55204d90097d","observation_id":"85be9585-8392-4bb1-8ef6-389773ee4dfd","resolution":{"observed_at":"2026-08-15T21:27:29.960317Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.945081Z","title":"ICE: A robust framework for learning invariants,","venue":null,"work_id":"8692e464-17bc-4208-86d9-c1709bc82295","year":2014},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.195016Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:c36b9f5171d35327d1d28c0047cbbd064a5c21d8becab1b838f51d8cf810932d","observation_id":"ce3d95c5-fc60-4658-ab5c-80484738cfd4","resolution":{"observed_at":"2026-08-15T21:27:29.948964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.935310Z","title":"Bisimulation through probabilistic testing,","venue":null,"work_id":"49c7b1d0-9b00-46ec-ac16-4fc5ddf21b30","year":1991},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.198294Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:26c28794e1b43aa472475f48f7863c0bbf11b098f5b77b5ef11dd8a76154c130","observation_id":"7a1dcba2-28e5-4f22-8778-8b644fdabf6e","resolution":{"observed_at":"2026-08-15T21:27:29.938532Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.925497Z","title":"Klarlund and A","venue":null,"work_id":"25a95c0c-49c2-48e6-bd6f-3ee66dce671e","year":2001},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.201653Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:240f0168226a7e3e82091cb2b37e9d3e8b96060ce16817b53dfb135742968123","observation_id":"45ab7a13-7c70-4606-8e2c-086c5001c418","resolution":{"observed_at":"2026-08-15T21:27:29.929141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.915800Z","title":"Lazy automata techniques for WS1S,","venue":null,"work_id":"7e65893c-7018-42f8-8e13-ff1927887e55","year":2017},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.205223Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:3752c02f2fde73392772c42198e8c4adec4ffce6b0de2b41fae68b9293cb816e","observation_id":"4ac1a75b-36ca-4cf8-9b50-e6434508dcc4","resolution":{"observed_at":"2026-08-15T21:27:29.919163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.906001Z","title":"Learning regular sets from queries and counterexamples,","venue":null,"work_id":"ee8238a1-f948-4d1d-ae65-a853d8a2cde7","year":1987},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.209199Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:49821025f776ca14b3ea2529ca100049daf4ab098391435943716cc558141a5b","observation_id":"ed600b48-4af8-4933-9394-0fab6bd151ed","resolution":{"observed_at":"2026-08-15T21:27:29.909350Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.895923Z","title":"Inference of finite automata using homing sequences,","venue":null,"work_id":"1fe4c71f-c548-4412-8e1b-e12f0e3bf7a7","year":1993},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.212898Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:b081ac0948adc67c96cf0d485713cfe0dd9e7f1376c3b41cd331d425d1ea5505","observation_id":"000ab97b-c32e-42a5-92f6-7cab7709f090","resolution":{"observed_at":"2026-08-15T21:27:29.899348Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.885360Z","title":null,"venue":null,"work_id":"b75ef9d3-05fa-4bf2-aa41-6ad47b502546","year":1994},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.216826Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:4793c5c5d34d13c84fe40ad0a5259efa9fbb8921ae39a2323427b9baaed8f7bb","observation_id":"acdcad67-6b98-4ae5-93bb-99edca01673d","resolution":{"observed_at":"2026-08-15T21:27:29.888730Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.873967Z","title":"Recursive markov chains, stochastic grammars, and monotone systems of nonlinear equations,","venue":null,"work_id":"c7529ac3-b370-4c83-a75b-33b622d40eaf","year":2009},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.220306Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:9489a853b9e43ce1d33d2b6f0c66f07fb8f7973d78591a2a5e8ae47b4d5c4647","observation_id":"4f76619e-ebe4-4a58-a7f2-122171103362","resolution":{"observed_at":"2026-08-15T21:27:29.878141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.862987Z","title":"Model checking of probabilistic and nondeterministic systems,","venue":null,"work_id":"d60253bb-decd-48f2-b8c5-381d59d29224","year":1995},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.223538Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:65ff0e78f49a2dff2498df9a0f4c3d82d680d8028f8a6b6ffd53aa7d5da11626","observation_id":"91e98c96-e82e-4208-bf9d-88ea13f98218","resolution":{"observed_at":"2026-08-15T21:27:29.866587Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.853136Z","title":"Expressiveness of probabilistic modal logics: A gradual approach,","venue":null,"work_id":"4ade239d-9c5c-4731-b567-e8452c5b73a2","year":2019},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.226852Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:8fdd22bf1cde2d30784df1ff6eee7eb6d92fe9207422f18a89a85fb56f520bf6","observation_id":"9bb93fa1-3f1e-4c2f-a615-3dc8e5499229","resolution":{"observed_at":"2026-08-15T21:27:29.856603Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.842129Z","title":"Symbolic techniques for parameterised verification,","venue":null,"work_id":"359bd2d5-f6eb-4fbc-8fdf-f435e2ac63c1","year":2022},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.230293Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:6fca493c064cbb7977f44e6f7eb1b43d80da16d986d429ab3961771e6bde737f","observation_id":"493720c7-d916-47ea-a440-6900ffe5aa3c","resolution":{"observed_at":"2026-08-15T21:27:29.845793Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.832087Z","title":"Automatic presentations of infinite structures","venue":null,"work_id":"87da1bc3-37c6-480e-bda0-eba4f20a2740","year":2007},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.233847Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:fbb010449dddcdee2cc48faac0b6566dafcd15215d5228f9bd888c5988cb2207","observation_id":"acff2d85-7a00-43f9-8a82-c4efbcfadd9b","resolution":{"observed_at":"2026-08-15T21:27:29.835403Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.822492Z","title":"Proving termination of probabilis- tic programs using patterns,","venue":null,"work_id":"a8fe8c54-27ab-41ad-a126-6a3b9f6db981","year":2012},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.237466Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:cad282baa794d766c0d715612b15190f326bd0ab293c6d9515d62cbf70b69bdb","observation_id":"7b953db3-e5a1-44df-ba24-81b37ae65d2e","resolution":{"observed_at":"2026-08-15T21:27:29.826106Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.813031Z","title":"Linear automaton transformations,","venue":null,"work_id":"18fcd610-5a0b-4646-b31d-0130e2e6abfb","year":1958},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.240939Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:ddb6a798756f4fb3f6b807230de80ae17bf8502591b437539a11311777dc6340","observation_id":"740ec5e6-fe5d-4842-901a-af67d883e7a1","resolution":{"observed_at":"2026-08-15T21:27:29.816235Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.803203Z","title":"Woess, Denumerable Markov chains","venue":null,"work_id":"a9a3d2bf-178b-4501-8564-9393a3ad90e8","year":2009},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.244491Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:d69f93b61cd2cb9e578e2f3f2dcb44ff62a2e9b44c31470043e0972f1528a3d5","observation_id":"deae4d53-100e-4f8c-951b-770645005cdc","resolution":{"observed_at":"2026-08-15T21:27:29.806730Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.793364Z","title":"Learning probabilistic ter- mination proofs,","venue":null,"work_id":"bd08c52b-41d8-4444-a2e9-c9606bc79a03","year":2021},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.247972Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:8f53dac20bc684e169c45598de8cd2920a3ad5dec90bae42f23812d390527be0","observation_id":"87858d82-3178-460c-a0d6-f30480ee1806","resolution":{"observed_at":"2026-08-15T21:27:29.796989Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.782329Z","title":"Algorithmic probabilistic game semantics,","venue":null,"work_id":"3f31e4d8-0fa1-437d-ae46-2de9e5f830fd","year":2013},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.251183Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:e08dd75191092423beb71e358f2f0a2f873fc0f8328568f29c98f81ed59d2fb8","observation_id":"1a08da5d-19a6-4c96-904b-f99a86b1ed9c","resolution":{"observed_at":"2026-08-15T21:27:29.786204Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.772524Z","title":"Constraint-based synthesis of coupling proofs,","venue":null,"work_id":"88e4ab48-d455-4545-ba5c-7eb8c7a9110d","year":2018},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.254630Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:fc485bfb07b2e372992db93afdb7ab3d81b7d06ff9f08a2b3de9a223a79f5a5b","observation_id":"f8182a62-47d7-4c64-9247-f15aeda7cea5","resolution":{"observed_at":"2026-08-15T21:27:29.776249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.761162Z","title":"The Armoise language,","venue":null,"work_id":"ed95a3ec-024a-45be-8518-f3e252473429","year":2010},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.257931Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:1fb99d9f278bd662a3bba6d5b3a9de20908c764c6d9f8c58eecdfc3c8c37eaa5","observation_id":"b30f19e1-d0d1-401f-9758-7c1e9b57f383","resolution":{"observed_at":"2026-08-15T21:27:29.765482Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.750870Z","title":"Tapas: The talence presburger arithmetic suite,","venue":null,"work_id":"548dbb17-4a47-4e98-b7f2-2b106ddabf73","year":2009},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.261526Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:e62f5d5b4fc6970ca71cf431740c520a9eeaf2ca2cb19edc2ab7ebb568fb765c","observation_id":"f5bf617f-6ed2-4a3d-8f50-335af255d728","resolution":{"observed_at":"2026-08-15T21:27:29.754568Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.740416Z","title":"Software model synthesis using satisfi- ability solvers,","venue":null,"work_id":"61a9b2cd-2dd5-4a59-8538-0fa2c2615a0e","year":2013},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.265196Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:a779da193ccb670e9fb274bd80a62b0fd13628cab6a6baafe0e0d83af80fec52","observation_id":"e69642a0-f5a0-433b-9302-ad80b5d03b0b","resolution":{"observed_at":"2026-08-15T21:27:29.744133Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.730191Z","title":"The thousand-and-one cryptographers,","venue":null,"work_id":"fecfa927-c7a8-4799-8fc2-da6ffec8d6f5","year":2019},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.268669Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:f07ef2d35e7d3b1cf3eb5c80cb8df4f6f85952193b2c6f52fc643280726513e1","observation_id":"6d2f7293-9162-43f9-a591-41d257eb1188","resolution":{"observed_at":"2026-08-15T21:27:29.733738Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.719994Z","title":"Formal certification of code-based cryptographic proofs,","venue":null,"work_id":"a0386ca1-6d5e-4b17-80b6-adb91f03c948","year":2009},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.271969Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:436d2949cec5c7fea3718fd7f70d54e4f5a626b06b2af73711d97a9dc5912e4f","observation_id":"8385f3c9-6f4f-4f95-b79e-26532fab298e","resolution":{"observed_at":"2026-08-15T21:27:29.723623Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.17127","last_updated":"2025-01-08T06:47:38Z","snapshot_observed_at":"2026-08-18T07:27:01.871895Z","submitted_at":"2024-07-24T09:58:21Z","title":"A quantitative probabilistic relational Hoare logic","version":2},"cited_work":{"arxiv_id":"2407.17127","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.17127","snapshot_observed_at":"2026-08-15T21:27:29.446686Z","title":"A quantitative probabilistic relational Hoare logic","venue":"cs.LO","work_id":"4aa0a620-700f-45db-aa16-09fe3f1c9b03","year":2024},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.275275Z"},"links":{"cited_paper":"/paper/2407.17127","citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:5668c26a2a4c020fe1933a20c1db0d2f7ebd86348d6da567d71ec14ab6d94c62","observation_id":"cb5c2932-9579-4f10-bd20-edf270c8b44b","resolution":{"observed_at":"2026-08-15T21:27:29.451865Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.709776Z","title":"Abstraction for epistemic model checking of dining cryptographers-based protocols,","venue":null,"work_id":"86af8c08-517d-4776-9408-9187606bcd26","year":2011},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.279148Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:46003363d1a7dad98df61f9cd1f0d54457a4017e1b4a63c5c41951a19c13f5bf","observation_id":"aa300d57-5b7b-4bc3-b162-b2e615c293b4","resolution":{"observed_at":"2026-08-15T21:27:29.713488Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.699483Z","title":"MCMAS: an open-source model checker for the verification of multi-agent systems,","venue":null,"work_id":"bf73c013-1494-48c1-ad8e-0d646c868a59","year":2017},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.282681Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:f0683603351dd221119280126a9cf7527a7f9d3e49552cad045f3b7176a959da","observation_id":"0aa39e33-754f-4c6f-ada7-ab6eb7fc1f74","resolution":{"observed_at":"2026-08-15T21:27:29.703126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.689912Z","title":"Parametric model checking with ver ics,","venue":null,"work_id":"c9b49586-774f-41fd-9a5c-eddf14a123b8","year":2010},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.286081Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:27cb05ff1481c78b65f69a7fc420c4fdc01ee5fe60ef4734b94f5288033b78e3","observation_id":"8963dc4e-6c78-4332-b021-6c182dd84820","resolution":{"observed_at":"2026-08-15T21:27:29.693260Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.680006Z","title":"Apte: an algorithm for proving trace equivalence,","venue":null,"work_id":"05c0770f-190e-4743-84fe-44d3c4479ff2","year":2014},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.289263Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:114467e813251ef19856285f9b0e556e3f2dca3816a2fc377bceaa8acf953ca6","observation_id":"2bb76d03-8116-4cca-b3d3-e9b16c085619","resolution":{"observed_at":"2026-08-15T21:27:29.683756Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.670319Z","title":"Automating open bisimulation checking for the spi calculus,","venue":null,"work_id":"ac604107-45fe-4661-b601-c322c69d85d9","year":2010},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.292814Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:89d25aef4e6a5856b24873da0c7c10d8834aa0c3069023672201b5a20af78a8b","observation_id":"3cd8d406-9824-4b60-af0c-63b263cf0f51","resolution":{"observed_at":"2026-08-15T21:27:29.673664Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.660786Z","title":"A survey of symbolic methods in computational analysis of cryptographic systems,","venue":null,"work_id":"143ba36b-5080-4211-b91a-01f61fd1fcbe","year":2011},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.296369Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:7d4bca356f10fc5e909be56540966a2e125d5d41022ee9ecde4d52beffc77986","observation_id":"f12b5147-658c-4ffd-b45c-86fe3fcd71a2","resolution":{"observed_at":"2026-08-15T21:27:29.663972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.650967Z","title":"The modest toolset: An integrated environment for quantitative modeling and verification,","venue":null,"work_id":"4a1c7df7-614e-4476-aaa3-6f5e29e26b59","year":2014},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.299839Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:593c1d7d91397e3cbe4f064e3dfaa670bd6636f96213f895ed9f205ebab70e49","observation_id":"f4267cca-50d6-4bbb-a34a-2f3c6065983e","resolution":{"observed_at":"2026-08-15T21:27:29.654595Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.641163Z","title":"Probabilistic analysis of an anonymity system,","venue":null,"work_id":"f89743cf-f452-47b9-8dae-e14735d69921","year":2004},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.303168Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:0965ab8a86c127166a4e11ba8ede702501dc2ec1e5538faf44adb00ebe82fc1a","observation_id":"ebe6437d-8f74-4558-9e7d-2add44aca39b","resolution":{"observed_at":"2026-08-15T21:27:29.644635Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.631391Z","title":"PRISM 4.0: Verification of probabilistic real-time systems,","venue":null,"work_id":"7b68bf91-35f1-4083-bb1e-7748da515e48","year":2011},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.306966Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:1963cc0d729e696629e8789f2944076ca51b82481f98a4b0662c4022889d2332","observation_id":"1166253d-0a84-4927-825f-2599a78d88fa","resolution":{"observed_at":"2026-08-15T21:27:29.634857Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.621416Z","title":"The probabilistic model checker Storm,","venue":null,"work_id":"3b898294-024f-4bf4-b675-1765a44d8e15","year":2022},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":88,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.310750Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:a5dd22c4ce22a6e662cac4d36474755e4ed86b5ed9636e9e11d22e3ca6c2725a","observation_id":"1b4a58d0-6c24-4c11-bab2-177f8bd65212","resolution":{"observed_at":"2026-08-15T21:27:29.624891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.611239Z","title":null,"venue":null,"work_id":"9e214630-3bd0-499d-8b73-1977d26522c7","year":2004},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":89,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.314463Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:530e56cdb82780ddf454f41fc2d64ade7a9629a23bb527242d594e9ec798225a","observation_id":"7c031eec-2254-4715-b3db-0ae8f747cb16","resolution":{"observed_at":"2026-08-15T21:27:29.614801Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.601249Z","title":"Model checking indistinguishability of randomized security proto- cols,","venue":null,"work_id":"5d86dffb-4846-4592-93c4-d0fdc392fde2","year":2018},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":90,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.318391Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:8d925c0066025d42729c6f69562a7e374de0eb60aad0f09ca49024ea01e7580c","observation_id":"9a1d7d77-7d7d-4ccf-ae19-e1f3669b1bcd","resolution":{"observed_at":"2026-08-15T21:27:29.604980Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.591186Z","title":"Symbolic protocol verification with dice: process equivalences in the presence of probabilities,","venue":null,"work_id":"5bde8789-399a-4b76-a5f6-010e055b1e4e","year":2022},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":91,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.323274Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:bf6f66130b198df7eabfe6473105930a97247a4618c059423719e9c36f67a702","observation_id":"4022ad6b-154f-4e89-bc7d-30e9459b6721","resolution":{"observed_at":"2026-08-15T21:27:29.594991Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.580807Z","title":"Psi: Exact symbolic inference for probabilistic programs,","venue":null,"work_id":"b903ab73-b524-48b0-85c3-b1d35bcca96b","year":2016},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":92,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.327001Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:f227b8ec77f25366fb694aea9e511ac7b1d6c806a6600e551775869607b8350b","observation_id":"78fe88c5-4760-4dbe-92b6-d338ad3fc225","resolution":{"observed_at":"2026-08-15T21:27:29.584555Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.569917Z","title":"Incremental inference for probabilistic programs,","venue":null,"work_id":"91cee92d-ab53-4f05-9359-897424cf14fb","year":2018},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":93,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.330970Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:3d655643b599bc5f35aa298284cad9dace1ac2ee3a4b3a7f4758e08c245ae55e","observation_id":"15bb8a9a-db22-4687-b139-61e4e644fc69","resolution":{"observed_at":"2026-08-15T21:27:29.573367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.559507Z","title":"Symbolic execution for randomized programs,","venue":null,"work_id":"b617cccb-6b51-49f9-9d29-73e21353f0e3","year":2022},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":94,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.334899Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:36932d9ee9a083070e3fcbff0b0658cba51daa37b3e04f5190e463404672b5e1","observation_id":"06a98d07-3d80-44af-9eb3-bb252f393efb","resolution":{"observed_at":"2026-08-15T21:27:29.563205Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.549015Z","title":"Exploring probabilistic bisimulations, part i,","venue":null,"work_id":"e7d6ca0a-69a7-4cd8-9e93-7ebb3d4e121e","year":2012},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":95,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.338796Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:5e19f10cb9328e5883f50a7d8c8728af1c20da7a9d48ac924a92fc23d5790a13","observation_id":"917b3e8a-0175-43e1-9154-6c94f423521f","resolution":{"observed_at":"2026-08-15T21:27:29.552511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.538614Z","title":"Weak bisimulation for fully probabilistic processes,","venue":null,"work_id":"1da722fd-99f7-4b7e-87b3-5c2fbc493234","year":1997},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":96,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.343431Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:5a422873e77c4c900d992d400f11d2e3571528f9939c1283a50965036f022a61","observation_id":"fd6c28d1-b19b-48be-b1fd-8cf47cb8269e","resolution":{"observed_at":"2026-08-15T21:27:29.542077Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.528321Z","title":"Weak bisimulation for proba- bilistic systems,","venue":null,"work_id":"a956ca2b-065d-4dcb-b247-58b7bcc69283","year":2000},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":97,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.347415Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:a520d60d1fb81be5d4ec5c3a09ff749510023f9d14af2ae7e049325b158848f8","observation_id":"44273d4a-c5d4-48a4-be78-5b3997019c7d","resolution":{"observed_at":"2026-08-15T21:27:29.531909Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.517655Z","title":"Branching bisimulation for probabilis- tic systems: Characteristics and decidability,","venue":null,"work_id":"adde8a3c-ea29-45bc-be4f-05faf588d5c4","year":2006},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.351249Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:1f8011ffbd79cfb22d1ba8a7a4f3dca09bab6acd78c28ea1fa616b489cfcaa0a","observation_id":"45153bfe-7197-44c7-9055-ba9fb7dd0d0d","resolution":{"observed_at":"2026-08-15T21:27:29.521696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2407.07584","last_updated":"2024-07-10T12:17:33Z","snapshot_observed_at":"2026-08-21T08:15:32.254470Z","submitted_at":"2024-07-10T12:17:33Z","title":"A Spectrum of Approximate Probabilistic Bisimulations","version":1},"cited_work":{"arxiv_id":"2407.07584","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.07584","snapshot_observed_at":"2026-08-15T21:27:29.427512Z","title":"A Spectrum of Approximate Probabilistic Bisimulations","venue":"cs.LO","work_id":"41e49186-61c4-434a-a811-fb8413a11d21","year":2024},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":99,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.354934Z"},"links":{"cited_paper":"/paper/2407.07584","citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:37e6ea520a815c534af768cbbe3ccfd0f36f6b4cd4a2cc78bb3c8e47651ee14a","observation_id":"9f8e0402-5d81-4ed1-871b-0dad8b1465a0","resolution":{"observed_at":"2026-08-15T21:27:29.432529Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:27:29.506137Z","title":"The algorithmics of bisimi- larity","venue":null,"work_id":"bf3b2d27-5563-472c-b142-a37e02d82b3b","year":2012},"citing_paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification","version":1},"reference_index":100,"source":"pdf_text","source_observed_at":"2026-08-15T21:27:29.358753Z"},"links":{"citing_paper":"/paper/2505.09963"},"observation_digest":"sha256:911d6f8c90a5abf3f3c6c22a2a1d67919347f63c06b18aa005b9922724cf7dfe","observation_id":"f1712ddd-556a-4e6e-9e3f-8debfff01823","resolution":{"observed_at":"2026-08-15T21:27:29.509719Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.09963","last_updated":"2025-05-15T04:56:53Z","latest_version":1,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-21T20:50:35.720733Z","submitted_at":"2025-05-15T04:56:53Z","title":"Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":25,"verified_exact":3,"verified_fuzzy":72},"total_outbound_references":103},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 100 of 103 outbound references and 0 inbound Pith citation observations for arXiv:2505.09963."}