{"as_of":"2026-08-10T14:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cf5c19408d8c015fccb6f870a9fadddfdb09f51d3dd0994859bfb5d6143ac73f","coverage":[{"denominator":73,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":73,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T15:22:07.882719Z","state":"measured"},{"denominator":73,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":73,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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.15587/citation-record","integrity":"/paper/2505.15587/integrity","json":"/paper/2505.15587/citation-record.json","paper":"/paper/2505.15587"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:02.810547Z","title":"Electronic Notes in Theoretical Computer Science297, 3–25 (2013).https://doi.org/10.1016/j.entcs.2013.12.002, pro- ceedings of the first workshop on Hybrid Autonomous Systems","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:02.810547Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:a9b77a326944794a3061ecfef794c65ae008cf5e89f59f479d64c7f4b4c8067f","observation_id":"1a64f569-a61d-4fa9-9367-4409ccab34c2","resolution":{"observed_at":"2026-08-07T15:22:02.810547Z","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":"10.1007/978-3-319-21690-4_12","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"In: Kroening, D., Păsăreanu, C.S","venue":"Lecture notes in computer science","work_id":"c1d36acd-74d9-4540-b6f7-eff47889e639","year":2015},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:02.909150Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:b5f0582d0325b49c7a313ecdc8a905c12835ea167099df29ff5c903b1b64f111","observation_id":"ed909e68-ed9c-42da-aa8a-ec15665cbc4e","resolution":{"observed_at":"2026-08-07T15:22:14.266887Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-068","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:13.783424Z","title":"In: van Breugel, F., Kashefi, E., Palamidessi, C., Rutten, J","venue":null,"work_id":"69fbb535-0cb8-4a7f-8b66-fd3774e93561","year":2014},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:02.940547Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:101834cbf50f65ab2562c86e1fa0a5cdacca7a21349a30ebb082dbdd46023cf2","observation_id":"b44433a1-10b0-4029-95bd-e7a7e24228c7","resolution":{"observed_at":"2026-08-07T15:22:13.896440Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:20.279533Z","title":"PLoS ONE9(4), e94553 (Apr 2014).https://doi.org/10","venue":null,"work_id":"1c97bea8-6444-4f12-873a-0390c5fea914","year":2014},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:02.998810Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:42d2020488dc3ddf607298a0a1b6bed9cdb90a0085538f92edca421da384dfed","observation_id":"88705173-24a7-45a8-ac7d-caa351458f5d","resolution":{"observed_at":"2026-08-07T15:22:20.386305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:20.180723Z","title":null,"venue":null,"work_id":"cc1d84d3-cdb1-41eb-9243-3711250a7b44","year":2009},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:03.072952Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:08f4ac2d9bf13e0ec68464ebd849ea457cd0c55429d6cfd14e1712cdf2483730","observation_id":"ec2c5609-324b-4e59-9fda-9fbd18170946","resolution":{"observed_at":"2026-08-07T15:22:20.234698Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-319-07734-5_19","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"In: Petri Nets","venue":"Lecture notes in computer science","work_id":"d7fa5866-8231-49d7-b0e8-ab22e1339f9e","year":2014},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:03.123439Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:479619e0aa5ce4b81c501031cc28c1c523cbbcf06fa53cf8f9fd73b6dbb8bedf","observation_id":"09ada68e-c36e-4d3a-bf75-3ddbf99a3b18","resolution":{"observed_at":"2026-08-07T15:22:13.663069Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:20.102270Z","title":null,"venue":null,"work_id":"d2bc8ba7-585b-43a7-a9b1-df1d1199d22a","year":2018},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:03.195859Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:bc3cc448d83c38b2f0f200ca6996562567c36a66408651b5a8c627a16212c0bd","observation_id":"5bd8649f-cd32-45df-ac1c-8b7d7588e628","resolution":{"observed_at":"2026-08-07T15:22:20.124143Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:19.981400Z","title":"In: SAFECOMP","venue":null,"work_id":"010677a2-8dd7-4fa9-bbc1-e062fc910d9a","year":2013},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:03.239585Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:e4fe286e256b88afc3d96aa8cf1119307f260016a42d34c3dc7ea8280798e717","observation_id":"48297050-6a21-474d-bddb-b99398cb72d7","resolution":{"observed_at":"2026-08-07T15:22:20.055135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"3369.34340","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:15.753484Z","title":"ACM Trans","venue":null,"work_id":"7ac3b77b-2fc7-4782-bb9d-e21927a035f4","year":2000},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:03.277356Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:66f0e02f9e2d988c4ff3e2fd829393aec32279089bf7d15cf966f9d12ae8ca7a","observation_id":"30245ce9-4a88-476b-aab5-9f869329f997","resolution":{"observed_at":"2026-08-07T15:22:15.829684Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-61474-5_57","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"In: Alur, R., Henzinger, T.A","venue":"Lecture notes in computer science","work_id":"7b562887-9bcf-46e7-aa73-d1a04fe2324f","year":1996},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:03.395986Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:871074064b5354a8344189ef31197fb5ae5ff46b06fb4138b6479f12580f669c","observation_id":"7c47dc56-d3cd-4a8d-86fe-1a4a57a49182","resolution":{"observed_at":"2026-08-07T15:22:13.293618Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/tse.2007.36","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"IEEE Trans","venue":"IEEE Transactions on Software Engineering","work_id":"87f2ff12-8fdf-4762-adbc-309c113ba6eb","year":2007},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:03.441507Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:0b53413a056ff2ebe8bcd3fc749c3716fb90c9b7a98d2a4445acbd54605c6bba","observation_id":"9c9db0f1-d449-4f26-b506-7ade702cae7a","resolution":{"observed_at":"2026-08-07T15:22:13.049913Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-45022-x_65","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"In: Montanari, U., Rolim, J.D.P., Welzl, E","venue":"Lecture notes in computer science","work_id":"db3156ff-7a37-4bfc-9ee0-22e5f1b0bdd0","year":2000},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:03.482042Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:a0531250ecb646297def59a5f938f52dd736d3e2e97edb2f858a97e217681c2d","observation_id":"97b232a1-a91a-41b0-89c6-874417aacbf2","resolution":{"observed_at":"2026-08-07T15:22:12.784039Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2003.12051","last_updated":"2021-02-14T00:23:08Z","snapshot_observed_at":"2026-08-08T21:10:41.004583Z","submitted_at":"2020-03-26T17:39:46Z","title":"Ab initio properties of the NaLi molecule in the $a^3\\Sigma^+$ electronic state","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.12051","snapshot_observed_at":"2026-08-07T15:22:03.541441Z","title":"IEEE Trans","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:03.541441Z"},"links":{"cited_paper":"/paper/2003.12051","citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:d96be93f380675845924ff9406b9650ce69877523cd149b83b110ad5f4f035bd","observation_id":"cc709568-7895-45c7-b044-ddc3335594df","resolution":{"observed_at":"2026-08-07T15:22:03.541441Z","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-07T15:22:03.639185Z","title":"The MIT Press (2008)","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:03.639185Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:5a0707427343f3c4aa4cb01b3219ffc9f43795f1a185dafc5dd2a7e1618aa839","observation_id":"149d4af1-adde-405f-89d0-751204520a95","resolution":{"observed_at":"2026-08-07T15:22:03.639185Z","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":"10.1016/j.ic.2005.03.001","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Information and Computation200(2), 149–214 (2005)","venue":"Information and Computation","work_id":"e115be8f-6e70-4c5d-a114-f24976fc7881","year":2005},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:03.679957Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:2e7e62fad81f6f7fe892195ebb4a21ecf851c0a659771ebb0c8bfee6b5e8c678","observation_id":"7218b990-ee94-42d0-90a5-9b9eb5d8e7cf","resolution":{"observed_at":"2026-08-07T15:22:12.521323Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.46298/lmcs-19(1:22)2023","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Logical Methods in Computer Science19(1) (2023).https://doi.org/10.46298/lmcs-19(1:22)2023","venue":"Logical Methods in Computer Science","work_id":"aabbdea2-e780-4914-8130-6dfab7c2a55b","year":2023},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:03.731842Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:baf044313eedc865b16cb0d223f61081f14c5075730e4359216424ca83623d5b","observation_id":"f47e7d1b-4f30-4ab2-8349-bde34fcd4d02","resolution":{"observed_at":"2026-08-07T15:22:12.299090Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:03.793542Z","title":"IEEE Transactions on ComputersC-27(6), 540–547 (1978).https://doi.org/ 10.1109/TC.1978.1675145","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:03.793542Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:096494bfcfe5c3a47583ae341fd77c07e2ecd1ba853098366a49872897a12368","observation_id":"a7153c9f-b9c6-4016-973d-841563cc7f3f","resolution":{"observed_at":"2026-08-07T15:22:03.793542Z","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":"10.1007/978-3-662-54458-7_19","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T00:03:45.533247Z","title":"In: Esparza, J., Murawski, A.S","venue":"Lecture notes in computer science","work_id":"c30f5f59-6291-4182-bfb5-9e2850fed0dd","year":2017},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:03.869453Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:6765465914cd280cdad310bfcca7e0f421db59dfa71fc75dad0d6a78455be2e2","observation_id":"20a00056-ac8c-4222-aff3-170cbce4427b","resolution":{"observed_at":"2026-08-07T15:22:11.970730Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.2307/3215235","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Journal of Applied Probability31(1), 59–75 (1994).https://doi.org/10.2307/3215235","venue":"Journal of Applied Probability","work_id":"e5947b93-e61f-4c48-941d-40c9f63d51f9","year":1994},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:03.977166Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:d45fb6e1c8339f6dc60677dad853937d7139e92a4efc7e1beb95a1cc7cbe0a0d","observation_id":"bce66339-2d16-45cf-9b44-76f14a9d00f4","resolution":{"observed_at":"2026-08-07T15:22:11.716222Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-85172-9_21","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"In: Abate, A., Marin, A","venue":"Lecture notes in computer science","work_id":"e1ef5b25-640d-4a06-9015-ad093d83b98f","year":2021},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:04.028834Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:616b7f3d5b5a3c218bc6e56b2fe38917624adb9bf54cbe58981295eca15050f8","observation_id":"79e42826-521d-4f0b-8ad0-0e1a09227b36","resolution":{"observed_at":"2026-08-07T15:22:11.493593Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:04.078248Z","title":"IEEE Transactions on Automatic Control68(11), 6557–6572 (Nov 2023).https://doi","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:04.078248Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:2b31f8f5602125bcc713c9c3c1143b1ac2507c1c1592197138c16967956949d4","observation_id":"90b06d15-1952-45d7-b741-343c7743a887","resolution":{"observed_at":"2026-08-07T15:22:04.078248Z","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":"10.1109/lics.2009.21","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"In: 24th IEEE Symposium on Logic In Computer Science (LICS)","venue":null,"work_id":"df8b52ce-a70a-4070-8e00-584709bc421f","year":2009},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:04.151206Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:d09a1e8fe32b6a6384d8ec7999525cfd5397a2183518ad8490babee7d1284e11","observation_id":"72129aa4-69dd-47b0-aad6-1e6aeb27dfbd","resolution":{"observed_at":"2026-08-07T15:22:11.283688Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1998.70568","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:15.344057Z","title":"In: Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science (LiCS)","venue":null,"work_id":"3e37a792-0279-4dd3-830f-3cdd6ddff048","year":1998},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:04.245063Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:20f7f0fae8c8d88aa19ec9f382b24bd7cf97ded3ec4ca6743a046fc55dd92a06","observation_id":"cae40302-0d6c-4ab9-bea4-fd7b1aa6a3f9","resolution":{"observed_at":"2026-08-07T15:22:15.417295Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:04.289033Z","title":"Information and Computation179(2), 163–193 (2002).https://doi.org/ 10.1006/inco.2001.2962","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:04.289033Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:fea50029690b4bbe786b2bd9e35c8e05259db17a3befde4a4d15f8d3fabec203","observation_id":"d6615110-b091-42ea-bf4c-566b4d64a881","resolution":{"observed_at":"2026-08-07T15:22:04.289033Z","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":"10.1109/qest.2008.42","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"In: Fifth International Conference on Quantitative Evaluation of Systems (QEST 2008)","venue":null,"work_id":"6395c684-5986-4cd4-82cf-6a8b1eb2a60e","year":2008},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:04.331317Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:4dbb2371b19512e7f4d3a22dea1880582d0d9dc85ea51b67a1cd8609221cffe6","observation_id":"1efe152c-24bc-4405-8232-50c57f1af3e8","resolution":{"observed_at":"2026-08-07T15:22:10.931329Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.itcs.2023.42","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"In: Tauman Kalai, Y","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"98480de5-2843-44b0-9b62-1c9db31d716c","year":2023},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:04.376624Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:ab20039ef21962b73ec328f0be17222afc7dc166289cb3e53ec138e41a1f1afb","observation_id":"051a952d-13b8-4f4b-882c-a1b7872ebb4c","resolution":{"observed_at":"2026-08-07T15:22:10.636392Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:04.463286Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:04.463286Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:0fd4f622491a386228049d97ca9cd44a2d5a55a435f413e3bad59a7cfd13c8a5","observation_id":"0d81f31d-24dc-41fb-aef4-5862212662a4","resolution":{"observed_at":"2026-08-07T15:22:04.463286Z","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-07T15:22:19.736670Z","title":"The Post Office Electrical Engineer’s Jour- nal pp","venue":null,"work_id":"da773ffa-2920-474e-b8a1-3f461cb7f34c","year":1917},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:04.512758Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:c86a021c2a623ac5a20b8e4a250bd04122a5ce0f117e48e5eba4dbac69504ba8","observation_id":"095d0965-5a6c-4817-a3fd-e71c1bff2b85","resolution":{"observed_at":"2026-08-07T15:22:19.877831Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:19.540419Z","title":"Performance Evaluation20(1), 223–243 (1994).https://doi.org/10.1016/ 0166-5316(94)90015-9","venue":null,"work_id":"04abe21d-e355-4161-997e-e2d50854a67a","year":1994},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:04.555405Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:8001b5d0be03199eb4672265ff65ef7a9f5c3c7356d3aff00a1010aeeb279c0a","observation_id":"8a13a238-8c4b-400c-8a3d-16dd6058c32e","resolution":{"observed_at":"2026-08-07T15:22:19.626022Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1109/32.297940","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"IEEE Transactions on Software Engi- neering20(7), 516–525 (1994).https://doi.org/10.1109/32.297940","venue":"IEEE Transactions on Software Engineering","work_id":"195bd5d2-9aeb-4b3b-9c2a-3018c4e5364f","year":1994},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:04.631018Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:3331ee19dd9068efc47a159f37d8e171a12298b81a4510f0076552bc7dbc4958","observation_id":"0603bc8d-cfee-4e9f-9d76-9cd8ed9cf16b","resolution":{"observed_at":"2026-08-07T15:22:10.328646Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:04.718220Z","title":"In: Remke, A., Stoelinga, M","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:04.718220Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:119346522f5a1cff7364f506280ae220740e3f19662a823dd7cc83035d16019d","observation_id":"4007915b-1b64-4f3b-80dd-60e582e8c5cc","resolution":{"observed_at":"2026-08-07T15:22:04.718220Z","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-07T15:22:19.422653Z","title":"Com- puters & Operations Research4(1), 47–53 (1977).https://doi.org/10.1016/ 0305-0548(77)90007-7","venue":null,"work_id":"3ac1a037-3dc9-44e5-b26a-6da0a4e810db","year":1977},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:04.798557Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:7688664068a135d7bce4745c3696094a8e8585b1a899c1089f24d6586609759f","observation_id":"47414a64-5012-4a77-8080-2412fa1813be","resolution":{"observed_at":"2026-08-07T15:22:19.457091Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:04.833530Z","title":"In: 2021 American Control Conference (ACC)","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:04.833530Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:919a751051007438bb96cc66ffdc23e6136246e3bd49b22f60d8ce04036c5b70","observation_id":"5c84e8b5-2329-4c5c-b13e-fc06241b6814","resolution":{"observed_at":"2026-08-07T15:22:04.833530Z","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-07T15:22:04.852779Z","title":"International Journal on Software Tools for Technology Transfer (STTT)24, 589–610 (2022).https://doi.org/10.1007/s10009-021-00633-z","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:04.852779Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:6a650d2fe0727fd2a44930ed22fcbd066ec2f9e198ff72dba0a6a626920ec218","observation_id":"a8d8d5ad-4c57-4a4c-812b-ebc133ec5188","resolution":{"observed_at":"2026-08-07T15:22:04.852779Z","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":"1238.1953","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:14.829538Z","title":"Scandi- navian Actuarial Journal1953(sup1), 87–91 (1953).https://doi.org/10.1080/ 03461238.1953.10419459","venue":null,"work_id":"c4e894b7-7db6-4334-8839-a57d2208f75a","year":1953},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:04.919485Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:220a0c2166bcf6b299be31ce32eabfdf35a6e6c0c73736c7523913643179f551","observation_id":"36d013b4-2b17-49da-84de-6f6d6c7a53e4","resolution":{"observed_at":"2026-08-07T15:22:14.910474Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:19.239171Z","title":"Undergraduate Texts in Mathe- matics (UTM), Springer New York (1976)","venue":null,"work_id":"965bec4a-50ae-4c3f-bf3c-f4bf36138886","year":1976},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:04.993794Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:e360da4d8417438618f16ca4a06480fa632d4cd3c9f40d9920cf965f10d772bf","observation_id":"a5f04aa2-1cd5-4557-9134-f327490f5aab","resolution":{"observed_at":"2026-08-07T15:22:19.318414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.fsttcs.2021.48","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:10.065444Z","title":"In: Bojańczy, M., Chekuri, C","venue":null,"work_id":"1ee00617-77e6-4071-9cf4-306cf8824d03","year":2021},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:05.075038Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:bd8faa283eff101dd201585eacf2ca536b08764779a413da9c59e15fd5429868","observation_id":"565b1a40-4030-440a-9427-4db1cc95a7fc","resolution":{"observed_at":"2026-08-07T15:22:10.156550Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:19.129012Z","title":"Mathematische Annalen104, 415–458 (1931).https://doi.org/10","venue":null,"work_id":"41c6d48d-2d5c-4749-9d01-771586690aa9","year":1931},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:05.147460Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:1912f9d689ac822c04c85311d4f693f682f4f3b9068f843d35b0d8f9010400f3","observation_id":"66eec0ca-e507-428f-8237-7b5f29b7733d","resolution":{"observed_at":"2026-08-07T15:22:19.175147Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-1-4419-1772-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Springer Texts in Statistics (STS), Springer New York (2010).https://doi.org/ 10.1007/978-1-4419-1772-0","venue":"Springer texts in statistics","work_id":"bf2079df-794b-41c9-94f2-3c5d91dd76a7","year":2010},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:05.218279Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:9b9b402c5739f3c7b9a17d62ec8a5d6cdcd4219f5ae771b1546a593ceb874db7","observation_id":"532a29eb-aa4e-4f52-b59c-1f7a8461f435","resolution":{"observed_at":"2026-08-07T15:22:09.928254Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:05.289495Z","title":"In: Gopalakrishnan, G., Qadeer, S","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:05.289495Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:6978a7f0cf835096276a0e70404ce724af92270705da9a069dbed50df196c775","observation_id":"4d6ddcf6-c0e7-4f34-96fd-fbfe7c9f8fc5","resolution":{"observed_at":"2026-08-07T15:22:05.289495Z","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-07T15:22:19.015511Z","title":null,"venue":null,"work_id":"015ce5b3-b90a-46eb-98b9-a427a032bc95","year":2014},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:05.348093Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:3566a30fd823319180df5db3471337b4356a0d2457caae908d34379e85cdee5f","observation_id":"f29cbc73-ef3b-4f2e-ada4-fd3537b00cad","resolution":{"observed_at":"2026-08-07T15:22:19.046402Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/0890-5401(91","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:09.650152Z","title":"Information and Computation94(1), 1–28 (1991).https://doi.org/10.1016/0890-5401(91) 90030-6","venue":null,"work_id":"6c9a7a30-bb74-44a4-9868-5755aa3be671","year":1991},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:05.421952Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:9bbee7bb99972f2edd2cb9dfdd51c20896bf3db5d1ed57d7bd7c0dfcd881321d","observation_id":"0126e7b6-b9ed-40a8-87e7-db4421d2f8ab","resolution":{"observed_at":"2026-08-07T15:22:09.749300Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/jpr.2024.20","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Journal of Applied Probability61(4), 1278–1300 (2024).https://doi.org/ 10.1017/jpr.2024.20","venue":"Journal of Applied Probability","work_id":"fa29ab73-0a95-4924-8ee7-a2e4791d518f","year":2024},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:05.481844Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:778aa6630ae4e099258203a8dfe10fb9e0bd3121a8ce13c329627fa79e854220","observation_id":"6bcd0c00-0258-4b3d-bba5-008800e275c1","resolution":{"observed_at":"2026-08-07T15:22:09.541664Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:18.821084Z","title":"Sci- ence China Mathematics58(2), 2633–2642 (2015).https://doi.org/10.1007/ s11425-015-5019-z","venue":null,"work_id":"a0ca95c3-8ed5-42c3-80ce-20357fbffb1e","year":2015},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:05.535444Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:8d787aa554ab4e920486f874bc0f282710ebe15e56b68c1a8f1b4ec80f898470","observation_id":"9a8561b6-98c3-4db0-9af1-7d1332966dcd","resolution":{"observed_at":"2026-08-07T15:22:18.909956Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1017/apr.2018.28","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Advances in Applied Probability50(2), 645–669 (2018).https://doi.org/10.1017/apr.2018.28","venue":"Advances in Applied Probability","work_id":"2ca076fe-d7e4-464a-8895-d1add18c213f","year":2018},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:05.583087Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:3f9892accc27ded86dda46272343e65db3ff2ae70ecf25c23acfae6297f2c036","observation_id":"80849075-1e0e-44b5-8dbd-96d5cae78495","resolution":{"observed_at":"2026-08-07T15:22:09.388326Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/2644817","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"ACM Journal on Emerging Technologies in Computing Systems","work_id":"5390ebc2-38e1-42c3-b138-d26432086e75","year":2014},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:05.619454Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:d5ffe7e980854db24a1af805ef637eaad4bc4f270632724b7b5b8088bd613101","observation_id":"2c1df902-1808-450f-84e1-d38e76d0c3df","resolution":{"observed_at":"2026-08-07T15:22:09.221288Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:18.626375Z","title":"Performance Evaluation7(3), 175–194 (1987).https://doi.org/10.1016/ 0166-5316(87)90039-3","venue":null,"work_id":"8ae25716-ae79-429a-b308-8d232c2e4320","year":1987},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:05.645137Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:98dff8f55d5a012a4d4cf37c6e41c4b27372cd61b4953ce1215e13128f6925f8","observation_id":"f75317bc-66f4-4745-9e2a-2d0e7641d7ce","resolution":{"observed_at":"2026-08-07T15:22:18.706729Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-29662-9_","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:08.994519Z","title":"In: André, É., Stoelinga, M.(eds.)FormalModelingandAnalysisofTimedSystems(FORMATS)2019.Lec- ture Notes in Computer Science (LNCS), vol","venue":null,"work_id":"73132a1a-0453-4e7a-9a72-2293b4ee8fb4","year":2019},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:05.698495Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:e218019b31ea5d16abf802325d2f50efe4d9c5c8f0a574926c945c173598aba5","observation_id":"9fbdaa96-f6fe-43a9-8f16-7f133f1e5b8d","resolution":{"observed_at":"2026-08-07T15:22:09.092486Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:18.476415Z","title":"Acta Inf.59(2–3), 211–244 (Jun 2022).https://doi.org/10.1007/ s00236-021-00404-y","venue":null,"work_id":"98a1bae4-5dae-415c-bd3b-fb6ddc45cc81","year":2022},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:05.773705Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:bfee00fd663a80c8a0311bc29e5639dcf83dc277089acc1e75f4c55a1304c0f9","observation_id":"92412537-4aec-476c-af61-57c4a6065120","resolution":{"observed_at":"2026-08-07T15:22:18.537829Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:18.365066Z","title":"Society for Industrial and Applied Mathematics, Philadelphia, PA (2000)","venue":null,"work_id":"f0d5f5d0-530d-4915-9389-7e021430a657","year":2000},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:05.850284Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:92c163e4c55f9bea255f0e4b7460a55d44be52a02537548956f84674c20cc895","observation_id":"94158851-d26a-4103-bf6b-bf3d50a2e6ae","resolution":{"observed_at":"2026-08-07T15:22:18.412828Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:18.199817Z","title":"Journal of Applied Probability42(4), 1003–1014 (2005)","venue":null,"work_id":"4c7eebee-4df7-49a3-bf27-b1c184f13024","year":2005},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:05.905645Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:45518d1b656f21904893c894efa75ce87c7e09350e046e32a9d11376e0b5c2c5","observation_id":"d9fab9f5-9f06-4b33-995d-2d6f353dcdf9","resolution":{"observed_at":"2026-08-07T15:22:18.319553Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:18.076047Z","title":"Mathematics12(11) (2024).https://doi.org/10","venue":null,"work_id":"070ddb1e-d645-4754-9a28-cc5728a6502c","year":2024},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:05.952475Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:dc55c2d16ec5280906445eb75059e525eacfbe114fca6281e74639f36ef8167e","observation_id":"d932fb2a-4644-4b28-a7d6-d325913a694d","resolution":{"observed_at":"2026-08-07T15:22:18.115943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:06.022721Z","title":"SIAM Review45(1), 3–49 (Jan 2003).https: //doi.org/10.1137/S00361445024180","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:06.022721Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:d595e0f1109ea2f8f5e0b5b0773766ab4f051adfc04bcab8fd19a581763b7683","observation_id":"f0c24a24-3565-4b30-9135-2d5bfb6521cf","resolution":{"observed_at":"2026-08-07T15:22:06.022721Z","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-07T15:22:17.930863Z","title":null,"venue":null,"work_id":"f22283f0-7b1c-45f3-85b7-4dcb1dad9674","year":null},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:06.148779Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:5484f82193b92b2c7c7fd97c0a45e698a4ebb39da2f2a94c4ad9c94356acea9a","observation_id":"da6e0cd0-fec4-4519-9115-efb4b00cb2ec","resolution":{"observed_at":"2026-08-07T15:22:18.009345Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-030-85172-9_20","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"In: Abate, A., Marin, A","venue":"Lecture notes in computer science","work_id":"e2064842-f374-4bc9-89f5-035b5edf8d92","year":2021},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:06.284621Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:901edfd252b83d41052114b57645f6c0fb445899e6f392657de9453fcd296d35","observation_id":"b43ce2e2-5eec-45b6-b42f-d03ec42fb275","resolution":{"observed_at":"2026-08-07T15:22:08.618549Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.3390/a17040159","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"https://doi.org/10.3390/a17040159","venue":"Algorithms","work_id":"45f5f361-fa9e-4214-b35f-d2a5126c3da6","year":2024},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:06.376700Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:bdfe1a514582e49f8f55dd03cf3eeb2d7d3197134e352b8f3cefbfc70c86329d","observation_id":"1790d645-91b4-4b99-ae0b-37fdcd62ba1f","resolution":{"observed_at":"2026-08-07T15:22:08.464091Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:06.452218Z","title":"In: Jon- sson, B., Parrow, J","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:06.452218Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:dd67f3c7abe04e698a444cf0794259d3a19493cbb9252f9f623640014474f64b","observation_id":"3225cc54-8307-46d0-a5c8-a4f02475e1c3","resolution":{"observed_at":"2026-08-07T15:22:06.452218Z","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":"10.1137/s0036142998337235","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"SIAM Journal on Numerical Analysis 37(4), 1120–1137 (2000).https://doi.org/10.1137/S0036142998337235","venue":"SIAM Journal on Numerical Analysis","work_id":"891ffc73-4026-4b43-8ce5-f97adb281339","year":2000},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:06.584215Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:f799f4574732e1c2fad58e3a7eb17438c1553e908fcdd2370a09333035ffa84e","observation_id":"9c3c01c3-57c2-44a9-a668-fa920cbabb48","resolution":{"observed_at":"2026-08-07T15:22:08.281383Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:06.636100Z","title":"In: Majumdar, R., Silva, A","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:06.636100Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:2e412fe58b99cabc8d2fbb2a51d89fa277b0db99e4d00ffc7f632f0cdc50969a","observation_id":"dab47512-6ce4-40a1-8703-acd3f840ecdc","resolution":{"observed_at":"2026-08-07T15:22:06.636100Z","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":"10.4204/eptcs.57.11","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"In: Massink, M., Norman, G","venue":"Electronic Proceedings in Theoretical Computer Science","work_id":"114a19d9-d2ad-4881-bd7e-d309e0e748a0","year":2011},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:06.716463Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:23e5ffeb2b6eca86f5f135b5765021e0f216997da57336c510607651e69438ba","observation_id":"a09cb084-1500-4b28-be5c-c2b266d7ef9e","resolution":{"observed_at":"2026-08-07T15:22:08.095445Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2017.27103","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:14.514903Z","title":"IEEE Trans","venue":null,"work_id":"e0c429b5-0672-4288-b6ce-46fac0306e43","year":2018},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:06.817876Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:91fe1acee4202909599956aaa3e0b30ec2894f9019520453eb19f5f2414494a8","observation_id":"688b5de3-72d0-442e-a213-61bee259cc03","resolution":{"observed_at":"2026-08-07T15:22:14.624082Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T15:22:06.903803Z","title":"The Annals of Mathematical Statistics32(3), 716–729 (Sep 1961).https://doi.org/ 10.1214/aoms/1177704967","venue":null,"work_id":null,"year":1961},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:06.903803Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:9e3bb30fbd4297154cde59e6496cd9a8856610f92e39ea9f4b9280461bd8e89e","observation_id":"ecb8427d-d852-4459-a8e2-a926034fc02d","resolution":{"observed_at":"2026-08-07T15:22:06.903803Z","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-07T15:22:17.711585Z","title":null,"venue":null,"work_id":"5c776653-f182-41a9-9590-50d748267517","year":2011},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:07.006280Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:678d803ef67c693438d5c74abb12df93988b611c41903c1546591daa2a92d655","observation_id":"06dd5a59-087e-4aad-b997-621779160651","resolution":{"observed_at":"2026-08-07T15:22:17.795934Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:17.558935Z","title":"3.s∼s ′ iffs∼ 0,0 s′","venue":null,"work_id":"534c368b-45b9-4c0c-ab79-c63d89ff1c89","year":null},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:07.102801Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:29f271e194481c66afb8d76d0cd36a62882842aaae0ba979e4342dc1d9c0c823","observation_id":"9ccb102e-9610-44a9-bd7b-92a1bb3076c7","resolution":{"observed_at":"2026-08-07T15:22:17.612443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:17.346072Z","title":"Define R={(x, z)∈S×S| ∃y∈S:x∼ ε1,δ1 yandy∼ ε2,δ2 z}","venue":null,"work_id":"cfcc4b65-8daa-4382-8e06-0f720f88fb14","year":null},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:07.230474Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:670ed2b664c19f52e8ae2abbbbe9fd5a3fd7a0ad1cbb3cf4869fb9742dab2855","observation_id":"f4920eb9-4ce3-4453-b3f2-69d8c41be53d","resolution":{"observed_at":"2026-08-07T15:22:17.436976Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:17.167530Z","title":"To see this, lets∼0,0 s′ and s′ ∼0,0 s′′","venue":null,"work_id":"10402131-e6d6-47e0-8f1f-b922a9f256ae","year":null},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:07.304289Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:81b829512f4dae104b0289ae62c7982d5d9ca03fc4a4f6cd4fb0537948672aea","observation_id":"d5dc1b48-9c1b-488c-a12a-f17956dcfac2","resolution":{"observed_at":"2026-08-07T15:22:17.202948Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:16.966205Z","title":"Theorem 17.Letθ∈[0,1),t >0, andq= max p∈S E(p)","venue":null,"work_id":"6c35254a-da48-4473-ab2d-049e6ba40671","year":null},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:07.413303Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:e03d9574ae23207854c9df9c62080f9619a57169f985529ff6ec3a09a2f9c262","observation_id":"ddfdc3a0-2d04-4fae-9c08-84de2a1fd178","resolution":{"observed_at":"2026-08-07T15:22:17.083159Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:16.833504Z","title":"EachJi with corresponding eigenvalueλ i is anr i ×r i matrix of the form Ji =   λi 1 0 0","venue":null,"work_id":"6a4b6afc-3dc7-4d63-bf49-67a742708196","year":null},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:07.485918Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:6cb6bb04e72b947009320836c8573514020edd4268a90532f0c6a10e9af15f88","observation_id":"98689a8d-ee14-4581-8c78-65a5123277b2","resolution":{"observed_at":"2026-08-07T15:22:16.891995Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:16.593298Z","title":null,"venue":null,"work_id":"8ae23f93-c4b8-4210-a853-ee90ef00c55e","year":null},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:07.594276Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:e21821e4666385fcada19d8f830a16e7a997b916cefe53fc45e8608b8bdd161a","observation_id":"f6b0ae6b-bcde-46d7-b623-ab50a786cde9","resolution":{"observed_at":"2026-08-07T15:22:16.752326Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:16.404858Z","title":"Spork et al","venue":null,"work_id":"b70bba16-c810-410f-bd9c-1d3a56542b51","year":null},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:07.669023Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:7153683fde9091b5f19f16bbe761569b4b2a62e4489bd7d516e1ed553f5525db","observation_id":"bbedd51e-b4c5-42cf-9293-6c379feebcdb","resolution":{"observed_at":"2026-08-07T15:22:16.497935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:16.149694Z","title":null,"venue":null,"work_id":"e65cc6e6-3562-4af3-ad7f-521546e2f0ec","year":null},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:07.808759Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:d0e793b5893873a167170d886420ad68e9724bf8166efb86abd8fa4a4b1776a0","observation_id":"2eb5ec16-3aae-47ff-b9a0-6982b40ff855","resolution":{"observed_at":"2026-08-07T15:22:16.243569Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-07T15:22:15.910546Z","title":null,"venue":null,"work_id":"26ff568c-0610-4474-9f8e-cac156fefb62","year":null},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:07.882719Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:5c9c3d0d0d902205732ebe437048c52e4b79891fd134c1e15d758e04dd7d59f9","observation_id":"cc3131fd-8d1d-43f3-b7d0-54b494950fda","resolution":{"observed_at":"2026-08-07T15:22:16.033477Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/301250","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":null,"work_id":"283467a9-23dd-403f-9884-8e38b239bc7c","year":1999},"citing_paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains","version":2},"reference_index":516,"source":"pdf_text","source_observed_at":"2026-08-07T15:22:06.236683Z"},"links":{"citing_paper":"/paper/2505.15587"},"observation_digest":"sha256:eeb293611bab2a80a2ae4291a8f7b935ece0cf931a5533cd17a36f6b071d239f","observation_id":"e94f157d-66c2-4b1a-b90f-96ca487c935b","resolution":{"observed_at":"2026-08-07T15:22:08.844440Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.15587","last_updated":"2025-05-22T14:10:22Z","latest_version":2,"primary_category":"cs.LO","snapshot_observed_at":"2026-08-07T15:12:09.392320Z","submitted_at":"2025-05-21T14:44:13Z","title":"Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains"},"reference_resolution":{"displayed":73,"state_counts":{"malformed_identifier":9,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":21,"verified_exact":27,"verified_fuzzy":13},"total_outbound_references":73},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 73 of 73 outbound references and 0 inbound Pith citation observations for arXiv:2505.15587."}