{"as_of":"2026-08-08T02:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7702b1243a7dc4b763e0544016ce00d0f09c6673c5d94c31acaa89e4abcb2797","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T05:24:14.843108Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2506.10026/citation-record","integrity":"/paper/2506.10026/integrity","json":"/paper/2506.10026/citation-record.json","paper":"/paper/2506.10026"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:24:08.921825Z","title":"Gay, Nils Gesbert, Elena Giachino, Raymond Hu, Einar Broch Johnsen, Francisco Martins, Viviana Mascardi, Fabrizio Montesi, Rumyana Neykova, Nicholas Ng, Luca Padovani, Vasco T","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:08.921825Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:ffa2dfb746a442c166a501b4b0ae819f43f5449e5e23222b657ad50e988788de","observation_id":"cc70e99b-2738-4445-bd4a-745e28a60d16","resolution":{"observed_at":"2026-08-07T05:24:08.921825Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2309.00192","last_updated":"2026-04-14T03:04:46Z","snapshot_observed_at":"2026-07-06T16:13:03.112430Z","submitted_at":"2023-09-01T01:13:42Z","title":"Logical Relations for Session-Typed Concurrency","version":2},"cited_work":{"arxiv_id":"2309.00192","doi":"10.48550/arxiv.2309.00192","metadata_source":"pith","pith_arxiv_id":"2309.00192","snapshot_observed_at":"2026-08-07T06:16:28.064256Z","title":"Logical Relations for Session-Typed Concurrency","venue":"cs.PL","work_id":"6926fee8-880f-486b-9192-54b51002e2dc","year":2023},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:08.989961Z"},"links":{"cited_paper":"/paper/2309.00192","citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:f4b13a65aea43a0a913a01ed4811e62165bc051b655e546a46d22a492a3229ea","observation_id":"e73c634d-b300-456a-b852-3ba4006514c1","resolution":{"observed_at":"2026-08-07T05:24:17.023589Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:09.177291Z","title":"Biorthogonality, step-indexing and compiler correctness","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:09.177291Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:69bc899141bcd0bdb7ca1f3c02bc476e4e52640a26c5b3b9ccc365b09b44cd89","observation_id":"971c4d10-894b-4a07-9ba0-bec9415ce058","resolution":{"observed_at":"2026-08-07T05:24:09.177291Z","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-07T05:24:09.480002Z","title":"Session types as intuitionistic linear propositions","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:09.480002Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:c19be323e40bd8478342cc99da949a40f60d861e1e0e19547b7af0244f6e0e34","observation_id":"9e7af7c2-f346-4156-804f-ae1f0519f3aa","resolution":{"observed_at":"2026-08-07T05:24:09.480002Z","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-07T05:24:09.608514Z","title":"A certified type-preserving compiler from lambda calculus to assembly language","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:09.608514Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:7ca58933fdf355f3e3e286038f768afc7f13c932465ecd42026c15aee41a775a","observation_id":"7bdce444-602e-413f-ac49-be66ed0ab270","resolution":{"observed_at":"2026-08-07T05:24:09.608514Z","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-07T05:24:21.513078Z","title":"Constable, Stuart F","venue":null,"work_id":"7ab86445-de60-478d-8e20-c95f2dd9036b","year":1986},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:09.752277Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:0e2201f9c5876c4fb899ae1c4f245ceafbbe9321dc690c874d718c11ada9bb8b","observation_id":"7d64e5e7-8e42-48a4-9496-2d5dad566697","resolution":{"observed_at":"2026-08-07T05:24:21.640249Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:09.882200Z","title":"Session logical relations for noninterference","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:09.882200Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:3ca39c713923ac3408a7c3bc1630ac1673c0555489a1442a241c7c81ad3a1c4a","observation_id":"93a43880-da82-449d-94be-07586918a492","resolution":{"observed_at":"2026-08-07T05:24:09.882200Z","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.4230/lipics.ecoop.2024.11","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:24:16.604102Z","title":"Regrading policies for flexible information flow control in session-typed concurrency","venue":null,"work_id":"f2eec83b-ea5a-4260-9c94-c658dfbad658","year":2024},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:10.058065Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:adf8b8a3b407d3ae7f0d302ed35bc46201a6e58af5de49ed591c86d12a4bad30","observation_id":"6ff0a2f2-2868-4728-aa9e-d50695ef7fa3","resolution":{"observed_at":"2026-08-07T05:24:16.680184Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:10.179510Z","title":"Semi-axiomatic sequent calculus","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:10.179510Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:af59c523a204b46ec983d8124fa147181c11300ccaa35fe741c301a69fe2e726","observation_id":"434e0880-f5d5-4cb4-a297-d2b041ef1ed8","resolution":{"observed_at":"2026-08-07T05:24:10.179510Z","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-07T05:24:21.218571Z","title":"Gay and Ant \\' o nio Ravara","venue":null,"work_id":"f4a37123-c90c-4380-afbd-7a8696dd7adc","year":2017},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:10.344957Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:8996136697bf0f56da3b2ead19c968cf8984f0a8ec0cbb748e4ce75c5cc1d126","observation_id":"3245b781-7cd6-47c1-a03e-9d09606c7235","resolution":{"observed_at":"2026-08-07T05:24:21.385511Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:20.975634Z","title":"Interpr\\' e tation fonctionelle et \\' e limination des coupures de l'arithm\\' e tique d'ordre sup\\' e rieur","venue":null,"work_id":"e8cfc98f-9ab4-43fe-ada1-7721fe9479cc","year":1972},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:10.533240Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:a16b637cd6a7576f1bbf2c25f0361da940dd239f8cdfaf01cfd78ea76cd43187","observation_id":"5005238c-635e-4951-a2a5-2817a2114361","resolution":{"observed_at":"2026-08-07T05:24:21.082789Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:20.661902Z","title":"A semantic logical relation for termination of intuitionistic linear logic session types","venue":null,"work_id":"b65a83bc-b9f6-482f-b263-01a6f8dde8fd","year":2025},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:10.637660Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:b18046dc94e6f1efcbd549ac9cddadd65c11da5cc35d2cb6dbed1a8672ea51c7","observation_id":"2b258eec-0443-46f0-b26d-557f5c5d0eec","resolution":{"observed_at":"2026-08-07T05:24:20.818528Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:10.777775Z","title":"Types for dyadic interaction","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:10.777775Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:c3b7198db4062968ae2a5a476122604c7119938b98eb7002cdbee669bf9c18b8","observation_id":"c5507cea-4473-43c2-bcd0-7047c32075b0","resolution":{"observed_at":"2026-08-07T05:24:10.777775Z","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-07T05:24:10.908547Z","title":"Language primitives and type discipline for structured communication-based programming","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:10.908547Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:0e198b0df4574ea7e603479e76d0a48b80de796f1da677b2495bdd790bddf666","observation_id":"2fc0dc3f-c07b-4bfa-b9cc-1cce637a47da","resolution":{"observed_at":"2026-08-07T05:24:10.908547Z","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-07T05:24:11.037389Z","title":"Multiparty asynchronous session types","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:11.037389Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:f5aa7342a49128ab561fdfd4e022876818c2a2e343e3fd4732c9dd1ea5da8d27","observation_id":"6fb4bcff-0a05-46a9-8172-fbf276436d79","resolution":{"observed_at":"2026-08-07T05:24:11.037389Z","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.1145/3290337","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:24:16.216733Z","title":"Better late than never: A fully-abstract semantics for classical processes","venue":null,"work_id":"b6091fee-06ef-4e1a-af90-073ea4661457","year":2019},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:11.166466Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:724fd4854e2694d0baec3d9f7310ca703c33d164217c7c0537a761036692c299","observation_id":"fc380a2f-fa98-4444-85f9-e0cbd5746dab","resolution":{"observed_at":"2026-08-07T05:24:16.381730Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:20.337124Z","title":"Efficient, extensional, and generic finite maps in coq-std++","venue":null,"work_id":"99952aee-bfab-47a1-b30a-f9a240e0840c","year":2023},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:11.294732Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:20e20a5f173849d17b962fce807e22b171106fba5c75ce4574cf78c73fe249d5","observation_id":"3b3ff7db-d393-4366-b9f3-30783d3f728a","resolution":{"observed_at":"2026-08-07T05:24:20.504336Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/978-3-662-46669-8","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:24:15.934514Z","title":"Garrett Morris","venue":null,"work_id":"db3f12cf-680f-443b-999c-1a6bc99ca3a3","year":2015},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:11.457161Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:63f5eaa84a942e59c7986c436b673c9b540ff9d1fceab4a696e12816a254f379","observation_id":"9b99e67c-178d-4ea8-bdbc-35297d2dad1e","resolution":{"observed_at":"2026-08-07T05:24:16.076326Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:11.625003Z","title":"Constructive mathematics and computer programming","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:11.625003Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:161c09addfd1e749964efb8d8c60b2535b39f3d0e0cd5ef91abd68d4e48657db","observation_id":"3b8716c6-1963-4232-b43d-06f47baf3548","resolution":{"observed_at":"2026-08-07T05:24:11.625003Z","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-07T05:24:20.049156Z","title":"Intuitionistic Type Theory , volume 1 of Studies in Proof Theory","venue":null,"work_id":"bc79f29e-4274-49e1-80ab-d99df42ae789","year":1984},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:11.749388Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:8955a165e8830b58f01dd2ce17ea52441fa9854cf50a9d8f748b2f434b314bef","observation_id":"f27a0e44-f6ab-4653-81cc-396254b7b3ed","resolution":{"observed_at":"2026-08-07T05:24:20.154446Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:11.873915Z","title":"A Calculus of Communicating Systems , volume 92 of Lecture Notes in Computer Science","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:11.873915Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:0c7b06c5efbf1438c0e83b5923727552510fbd7fa3a137039a44c0e2ad569e81","observation_id":"d1fe55ef-ca1b-4bce-9d3e-d8ec45743e52","resolution":{"observed_at":"2026-08-07T05:24:11.873915Z","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-07T05:24:19.813555Z","title":"Communicating and Mobile Systems: the -calculus","venue":null,"work_id":"17c8cb03-1c37-43d2-bbe5-5449f92d7329","year":1999},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:12.034643Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:3085ad47331d64ff3dc77de2b6dacd84e640dc694710c5105bdf27ccff27627c","observation_id":"de1ef4fb-683e-48ba-8aa6-03aae695068b","resolution":{"observed_at":"2026-08-07T05:24:19.928079Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:12.194941Z","title":"Typed closure conversion","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:12.194941Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:ec918d1bcc633242b2b79252b2dfa0ac5fcd1ffe6dec3a2118ad44751b08a3ce","observation_id":"f96bf04c-d87a-4409-84f0-820e15be3fab","resolution":{"observed_at":"2026-08-07T05:24:12.194941Z","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-07T05:24:12.369449Z","title":"Semantic soundness for language interoperability","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:12.369449Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:5e57d060117f41ecfb98a5c4548d1da993032bf64a047cff06f45c5d486cc1d0","observation_id":"143ff08b-1521-4dbb-9b20-d7a3f5ad889d","resolution":{"observed_at":"2026-08-07T05:24:12.369449Z","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-642-28869-2","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-08T00:03:56.115653Z","title":"P \\' e rez, Lu \\' s Caires, Frank Pfenning, and Bernardo Toninho","venue":"Lecture notes in computer science","work_id":"a572d8ec-d3a9-4b9c-8d4b-5f814c9cebd7","year":2012},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:12.548825Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:38c0aa1c6df8401c61b3ed9480a86ae75228dd585b5457feaf380fb508dae31c","observation_id":"7b323315-cb94-4ecc-b4a3-bfd2d943310c","resolution":{"observed_at":"2026-08-07T05:24:15.781913Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:12.735051Z","title":"P \\' e rez, Lu \\' s Caires, Frank Pfenning, and Bernardo Toninho","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:12.735051Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:1e9d59bb9129a213b9b4c5f08e96d595ee0f450f3ccac4d1addd4d8c3fe1a389","observation_id":"38925ede-8328-4940-9b9d-87899e4036ac","resolution":{"observed_at":"2026-08-07T05:24:12.735051Z","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-07T05:24:19.514471Z","title":"Pitts and Ian Stark","venue":null,"work_id":"454b1089-6398-4191-a93f-1b1010a29fa5","year":1998},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:12.910894Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:df9bf711e68f1c18ebf4ae831e16721a4907db3cabd611c93322305e647c233c","observation_id":"aed482a2-4c98-408f-9e64-46ca92852ebc","resolution":{"observed_at":"2026-08-07T05:24:19.684056Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:19.150180Z","title":null,"venue":null,"work_id":"86293956-aa6b-45ff-b0ad-034f58294698","year":1973},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:13.091798Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:f806fb21af7815a5332de4538cc38ef8c90640c64c8a6f9007c92e46f84e46f4","observation_id":"1b7a68f5-8e84-4352-ba49-b76972ce4864","resolution":{"observed_at":"2026-08-07T05:24:19.334240Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:13.227892Z","title":"Safe session-based concurrency with shared linear state","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:13.227892Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:a54d4f13afe6aee5d5125af2b3189e1adabce015f12e83942371bbfe6b4b670a","observation_id":"5bc101ed-f1b4-4bca-a8cc-de8538fef9a8","resolution":{"observed_at":"2026-08-07T05:24:13.227892Z","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-07T05:24:13.405931Z","title":"Dimsum: A decentralized approach to multi-language semantics and verification","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:13.405931Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:2c39fb28d346909bb5ac2e3e6c72f6a410d0425768c448840a8fbb0d52f510e2","observation_id":"e505157b-cf46-4ffc-8e50-f6dff626eec5","resolution":{"observed_at":"2026-08-07T05:24:13.405931Z","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-07T05:24:18.895335Z","title":"The -calculus: a Theory of Mobile Processes","venue":null,"work_id":"829e3de4-0887-429d-8622-926a8a2f2102","year":2001},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:13.580923Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:314cfa826a926d513f07dc375033684930a26faedc6d17b449d905fe63457d39","observation_id":"19e1a4a2-8e79-46ba-a0ba-2f858fa3132b","resolution":{"observed_at":"2026-08-07T05:24:18.984171Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:13.713621Z","title":"Logical relations and the typed -calculus","venue":null,"work_id":null,"year":1985},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:13.713621Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:705f4c7a2bbaf1a6bb05152a6fbdb687c17a00c9308c0b0577191c7a8333b510","observation_id":"9c77e9fe-8563-45d6-bda3-5debf27cd3e8","resolution":{"observed_at":"2026-08-07T05:24:13.713621Z","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-07T05:24:13.870131Z","title":null,"venue":null,"work_id":null,"year":1967},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:13.870131Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:0f6587cb33b3023d838b6f1920e562d714bfc4b0c19d1745358320cbdf2cd314","observation_id":"7810e217-6c09-4211-9e82-84ef1bb86f14","resolution":{"observed_at":"2026-08-07T05:24:13.870131Z","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-07T05:24:18.664666Z","title":"Standard Library","venue":null,"work_id":"de199f6e-dc0f-467d-a148-2a12aa52f715","year":2024},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:13.985115Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:c7f5741aac66564a257e6fc000673753c063c198747a11968fda2fef7499e232","observation_id":"35a9c572-484f-481c-b27b-d5a6a6260684","resolution":{"observed_at":"2026-08-07T05:24:18.772213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:18.330986Z","title":"A logical approach to type soundness","venue":null,"work_id":"c02b4a3e-3867-4306-aca2-22831aca1ae1","year":2024},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:14.111993Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:98501f1579feba882fac11226f9f09b9aa414eca9e6fee2b220079fe7bd317e4","observation_id":"54d9f4c0-ada9-402a-8c10-551fb52b3417","resolution":{"observed_at":"2026-08-07T05:24:18.510510Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:18.032841Z","title":"A Logical Foundation for Session-Based Concurrent Computation","venue":null,"work_id":"0ff71e4f-3311-44f3-8e6c-0a8187f67fc0","year":2015},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:14.229898Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:c34fe7f24305cee6100141967cbbcd230490cce45cacd4fa3c4e8ddb35f914ac","observation_id":"97a64d1c-90b8-4bf6-b2a0-1bca39153b63","resolution":{"observed_at":"2026-08-07T05:24:18.154860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:14.376426Z","title":"Higher-order processes, functions, and sessions: A monadic integration","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:14.376426Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:b88fa99068d6561857947eb00e5ec4ad0d7128db812e1f9b7e52a448726c4d66","observation_id":"d90e9461-5084-4b66-bc75-d1fafbc34193","resolution":{"observed_at":"2026-08-07T05:24:14.376426Z","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.4230/lipics.ecoop.2024.40","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:24:15.258401Z","title":"Information flow control in cyclic process networks","venue":null,"work_id":"4efc47b4-7224-4d1a-b99d-e29333669ed9","year":2024},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:14.525110Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:f0234837c9ec87f442a5773c01bb530cd07f9c38df0191f616d48f749f408762","observation_id":"9cef0096-6f94-4f18-87fa-87e520d9520e","resolution":{"observed_at":"2026-08-07T05:24:15.425376Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+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-07T05:24:14.669677Z","title":"Propositions as sessions","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:14.669677Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:325103f7e59a15b27582376173e9a57b9617e94fe5c131cce3103fbba1c87b13","observation_id":"4d66caea-8be7-48b8-8eac-6a10d6d7702e","resolution":{"observed_at":"2026-08-07T05:24:14.669677Z","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.1145/3704895","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T05:24:14.993830Z","title":"Semantic logical relations for timed message-passing protocols","venue":null,"work_id":"d23db3be-cc03-4b6e-82a5-1f27a4d6286e","year":2025},"citing_paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-07T05:24:14.843108Z"},"links":{"citing_paper":"/paper/2506.10026"},"observation_digest":"sha256:73c8f9c06ce06a8eda7343563077c5c0a4b87204621eb6a13e38ceb35d78dcdb","observation_id":"a90c8fec-a289-404b-ab6d-e81112290e37","resolution":{"observed_at":"2026-08-07T05:24:15.097707Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.10026","last_updated":"2025-06-10T00:50:08Z","latest_version":1,"primary_category":"cs.PL","snapshot_observed_at":"2026-08-07T05:11:19.155917Z","submitted_at":"2025-06-10T00:50:08Z","title":"A Language-Agnostic Logical Relation for Message-Passing Protocols"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":21,"verified_exact":7,"verified_fuzzy":12},"total_outbound_references":40},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2506.10026."}