{"as_of":"2026-08-09T15:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0156b8a15071b48f0294483e947f8ae82c8857e9f9b607203d5cf67ab96d9ed6","coverage":[{"denominator":58,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":58,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T03:23:29.461241Z","state":"measured"},{"denominator":58,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":58,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2607.27964/citation-record","integrity":"/paper/2607.27964/integrity","json":"/paper/2607.27964/citation-record.json","paper":"/paper/2607.27964"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T03:23:23.046668Z","title":"Agrawal, Aditya Kanade, Navin Goyal, Shuvendu K","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:23.046668Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:2143b2d1ab371ba5362a6eecb9e4509edc56babbdcd1c0006dec1ac789f4d721","observation_id":"363b8c66-3e81-452d-b8b2-62623e2f9892","resolution":{"observed_at":"2026-08-04T03:23:23.046668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2108.07732","last_updated":"2021-08-16T03:57:30Z","snapshot_observed_at":"2026-08-02T19:23:53.535075Z","submitted_at":"2021-08-16T03:57:30Z","title":"Program Synthesis with Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2108.07732","snapshot_observed_at":"2026-08-04T03:23:23.146416Z","title":"Nye, Maarten Bosma, Henryk Michalewski, David Dohan, Ellen Jiang, Carrie J","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:23.146416Z"},"links":{"cited_paper":"/paper/2108.07732","citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:8eb49fccce3b85e89f9e911cf4401724f1c2c0992956aabf65326b7ec0577ef1","observation_id":"ad127bcb-1791-4640-9b81-b9a9695961b6","resolution":{"observed_at":"2026-08-04T03:23:23.146416Z","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-04T03:23:23.289286Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:23.289286Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:30ecb33feeae00cbde1d70bd6e118048793b04d3b354099de3befb548dfb9652","observation_id":"2a1771de-1d13-4230-90b9-7a495d584d58","resolution":{"observed_at":"2026-08-04T03:23:23.289286Z","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-04T03:23:23.407552Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:23.407552Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:f7bc87f8f940d77715af01068b86a28c1abc7b6636b366926d04d7903e03e6ed","observation_id":"6b345c7c-25d5-44cf-8f1c-0103e0d04014","resolution":{"observed_at":"2026-08-04T03:23:23.407552Z","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-04T03:23:23.514620Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:23.514620Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:de48ca192212a84cf52b4fac21986d5f57be5aac382448b8c2ca0cccd8b41b27","observation_id":"22c46924-5b5f-40b3-b80c-1ce320efb221","resolution":{"observed_at":"2026-08-04T03:23:23.514620Z","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-04T03:23:23.648574Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:23.648574Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:6d77cac6e21b069f1894a42583a89c6e2c4c4fcf4eec7a10ab61ab6608145a7a","observation_id":"23a26fb2-cd34-4844-aa3d-3ad5e6ac0984","resolution":{"observed_at":"2026-08-04T03:23:23.648574Z","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-04T03:23:23.753067Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:23.753067Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:f639d635f3db4f8b09c36a9910feb18a545afe9051398f451ffcc31ec10cff03","observation_id":"7e22d39b-6aca-4a62-be96-0f9d47f237d5","resolution":{"observed_at":"2026-08-04T03:23:23.753067Z","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-04T03:23:23.912260Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:23.912260Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:8e0b573b7f7a12a585f8d6d283f6fc56540055635a15221780c4ba136f7846c1","observation_id":"3b6d6842-52b5-4295-a799-134c7c739996","resolution":{"observed_at":"2026-08-04T03:23:23.912260Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2107.03374","last_updated":"2021-07-14T17:16:02Z","snapshot_observed_at":"2026-08-08T11:58:24.516369Z","submitted_at":"2021-07-07T17:41:24Z","title":"Evaluating Large Language Models Trained on Code","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2107.03374","snapshot_observed_at":"2026-08-04T03:23:24.024961Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:24.024961Z"},"links":{"cited_paper":"/paper/2107.03374","citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:5e324faeb08d0126a1dd8e7e6b628d81f574b1be32cd760b0ba2dce071f6d76c","observation_id":"58630b0d-6e52-4e3b-9acb-bae25f8f6fc3","resolution":{"observed_at":"2026-08-04T03:23:24.024961Z","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-04T03:23:24.114493Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:24.114493Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:444fac0eb33c5af5b3bbb9738a6d985e3b6ab6e4d710c40ec09204b8462100b6","observation_id":"8b0d216d-efd5-4bb8-9c06-1d7ca47e89b2","resolution":{"observed_at":"2026-08-04T03:23:24.114493Z","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-04T03:23:24.287182Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:24.287182Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:23dbf6fee2b87f89a92abfcf6999ff067823445a4d2d2f6ffdd7e38202057346","observation_id":"10087eaf-4f24-402f-a446-9479b5bfbcb6","resolution":{"observed_at":"2026-08-04T03:23:24.287182Z","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-04T03:23:24.396680Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:24.396680Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:7e05b4e1a049a93abc26cb8f184e6332b5d0a73d239056d16577eedeb0188bbb","observation_id":"56807599-d3bb-4e0b-ad17-c8d8a21c0650","resolution":{"observed_at":"2026-08-04T03:23:24.396680Z","resolver_source":null,"status":"malformed_identifier"},"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-04T03:23:24.472808Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:24.472808Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:bfd20726f8cebfe94452576a13da3644d0fbf47b938aacc2d2fae106a5d8bd6c","observation_id":"8f5ec045-17ee-4ea6-bfa6-0e3282730360","resolution":{"observed_at":"2026-08-04T03:23:24.472808Z","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-04T03:23:24.764762Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:24.764762Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:7d670186de3e5b16ae1bfce031cf61c1a42ea48e73cfc22272d3e0dd5ea0dd73","observation_id":"af97909f-8b44-458e-aaf6-582bb2a70635","resolution":{"observed_at":"2026-08-04T03:23:24.764762Z","resolver_source":null,"status":"malformed_identifier"},"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-04T03:23:24.840548Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:24.840548Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:e6d9d91446a1889e4366cbaa11777d93a967d3c2661dc44f1d74fdaf7cbd10ce","observation_id":"12c50934-d21a-4c59-8e4f-0d5d5d60f7bd","resolution":{"observed_at":"2026-08-04T03:23:24.840548Z","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-04T03:23:24.988966Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:24.988966Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:7c2df84c16a11b6ab88f48762cecc2080fce8d69b59030599616aa65b2c0ec72","observation_id":"e0232307-f2e2-438c-ba28-8d91fc400f22","resolution":{"observed_at":"2026-08-04T03:23:24.988966Z","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-04T03:23:25.088268Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:25.088268Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:dbbb9ca2bb55e7081517f930d3288dd53e9f9d629629a7e9cb43ee5a6ec84eac","observation_id":"cc18190a-e608-453e-b6c4-6562e4225df7","resolution":{"observed_at":"2026-08-04T03:23:25.088268Z","resolver_source":null,"status":"malformed_identifier"},"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-04T03:23:25.169013Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:25.169013Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:289c1836c040328b00418a16e10135d1b7595fa1b8515280b290b895da3b6fed","observation_id":"48a2147d-4cce-4052-8854-e8ba312be758","resolution":{"observed_at":"2026-08-04T03:23:25.169013Z","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-04T03:23:25.289965Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:25.289965Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:5ba7bb61cfcb35fa27b137928a3b3e5a936d8c5dc6e88390286e906630d2e8fe","observation_id":"144b6d71-7097-43aa-9480-b83a16edcd1d","resolution":{"observed_at":"2026-08-04T03:23:25.289965Z","resolver_source":null,"status":"malformed_identifier"},"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-04T03:23:25.494810Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:25.494810Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:88da4c181c4febba9a1bb3cdf7e752cb9583dfc15e3d949b8d673654a4398f2f","observation_id":"ebd6e7c4-61db-46c4-a773-7ff7ee2beaf2","resolution":{"observed_at":"2026-08-04T03:23:25.494810Z","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-04T03:23:25.582856Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:25.582856Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:deffcbc95bea452bc8b4e2b7964a6810512cc07f889132b2fe766d0b7f311b1e","observation_id":"9a96504e-edbe-426e-9aa5-30d1de0f6a00","resolution":{"observed_at":"2026-08-04T03:23:25.582856Z","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-04T03:23:25.684622Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:25.684622Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:53f0861ecd35d85a1961d315765ff6aa2ff33376b5063e2cc23275f8f09d7d4e","observation_id":"e948e369-c91a-4cf8-ad4a-c2cfa9c5afb7","resolution":{"observed_at":"2026-08-04T03:23:25.684622Z","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-04T03:23:25.843560Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:25.843560Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:b4e4918de4c71ca5979c210ad4c8ed083fdbe0fbe88d6d88736b8e23212a98a0","observation_id":"60b31027-9e78-47f2-b8f8-dba7546b9709","resolution":{"observed_at":"2026-08-04T03:23:25.843560Z","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-04T03:23:25.952513Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:25.952513Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:c01e40e4fbfef31b8b51c745d32b9b1b3c6cdc79bb729acea61630fd04e6df9a","observation_id":"43a34c1b-ade0-4e5e-b7c7-f842fcbc2a1a","resolution":{"observed_at":"2026-08-04T03:23:25.952513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.12186","last_updated":"2024-11-12T13:24:25Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-09-18T17:57:57Z","title":"Qwen2.5-Coder Technical Report","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.12186","snapshot_observed_at":"2026-08-04T03:23:26.065393Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:26.065393Z"},"links":{"cited_paper":"/paper/2409.12186","citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:4a41a51a15ad74b65671cff79bc810698b1285091b6202095cb029e602e0f9c2","observation_id":"257fafa5-1ba9-41e3-8452-ee24088ca095","resolution":{"observed_at":"2026-08-04T03:23:26.065393Z","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-04T03:23:26.184943Z","title":"Brendan McMahan, Brendan Avent, Aurélien Bellet, Mehdi Bennis, Arjun Nitin Bhagoji, Kallista A","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:26.184943Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:933993b8a11d0f9279946e8a703d51516483431529fa898827679be1db58fa34","observation_id":"72da85e2-7e6f-4aed-9d41-c69cbacebcd6","resolution":{"observed_at":"2026-08-04T03:23:26.184943Z","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-04T03:23:26.368258Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:26.368258Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:bd650cb34f101cb593eb0747c5e8b72124dd53389c256493e5c1995e820a7c75","observation_id":"6c4b1c56-9af6-442b-938a-fe3f557fe48b","resolution":{"observed_at":"2026-08-04T03:23:26.368258Z","resolver_source":null,"status":"malformed_identifier"},"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-04T03:23:26.471409Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:26.471409Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:b89c8c8d15983c7fa8afcbe0d22667c8be7fe14d0550ab391b8ef9692ce0253c","observation_id":"c41e1a62-dd53-4567-baa6-e3cdd35ebcda","resolution":{"observed_at":"2026-08-04T03:23:26.471409Z","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-04T03:23:26.568928Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:26.568928Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:14d0ed8dfa52df6db24e604be9d1c761f7dd56cd88781ea60217e4188b12fc2b","observation_id":"4505936c-1ec7-498f-820c-19c1e1b746e7","resolution":{"observed_at":"2026-08-04T03:23:26.568928Z","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-04T03:23:26.776914Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:26.776914Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:10a935d2bda04db812213dc4a33f2310bb999a5904b7d94b373d7c740b9300d4","observation_id":"94f4e01e-de37-413e-adff-50e20c2198fc","resolution":{"observed_at":"2026-08-04T03:23:26.776914Z","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-04T03:23:26.898335Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:26.898335Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:1cf272b8b2bca71c635da098324189ac932fa6543c170c88247e6fc1ab09caa5","observation_id":"6b35b67a-849c-4e6b-a970-5a7da2207380","resolution":{"observed_at":"2026-08-04T03:23:26.898335Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11905","last_updated":"2024-10-14T23:25:13Z","snapshot_observed_at":"2026-08-07T05:33:39.200301Z","submitted_at":"2024-10-14T23:25:13Z","title":"A Scalable Communication Protocol for Networks of Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11905","snapshot_observed_at":"2026-08-04T03:23:27.036458Z","title":"Wooldridge, and Philip Torr","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:27.036458Z"},"links":{"cited_paper":"/paper/2410.11905","citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:ce6a82ee186c2a8ad21506e768abcb9f572f05b18729f71b8b7b2a650a984770","observation_id":"93f27d46-2273-4ded-89d2-1d803a9e4e5f","resolution":{"observed_at":"2026-08-04T03:23:27.036458Z","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-04T03:23:27.131426Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:27.131426Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:8e7477e3560cc51f539ea84ddbbb7b2b091d87bc2dd3229c04057f3a03e0c56a","observation_id":"7a15956c-c313-472a-8f13-f1845cc76009","resolution":{"observed_at":"2026-08-04T03:23:27.131426Z","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-04T03:23:27.359755Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:27.359755Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:53faec823b7f581418d604030fc525cf394a30729606e901bb2fa4dcd25f3cd5","observation_id":"3ab35bfd-5a83-4e6f-b69c-f11c8aeacacc","resolution":{"observed_at":"2026-08-04T03:23:27.359755Z","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-04T03:23:27.520179Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:27.520179Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:59030390be18e6d6da9aadec8ceeb0fa73904a8fdb0a76165d7550536baa07e5","observation_id":"9f51f80c-17b5-4edd-8c7b-92c2a7f7fe85","resolution":{"observed_at":"2026-08-04T03:23:27.520179Z","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-04T03:23:27.629985Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:27.629985Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:da74825ed6f6d1ec4b446378b404ecd17e3ddb1de6b3b61521360cc83b75a519","observation_id":"36479c23-8087-4ce0-91fb-be6c27e029d1","resolution":{"observed_at":"2026-08-04T03:23:27.629985Z","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-04T03:23:27.680829Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:27.680829Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:627bb8d7359706d3b178682d58a5b1830e514806bde89c4240f6db53b5aa8609","observation_id":"4685a29a-387b-4c10-a9bd-4d75952ab49d","resolution":{"observed_at":"2026-08-04T03:23:27.680829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.05111","last_updated":"2025-07-15T21:10:27Z","snapshot_observed_at":"2026-08-08T20:10:14.429038Z","submitted_at":"2025-02-07T17:35:17Z","title":"Flexible and Efficient Grammar-Constrained Decoding","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.05111","snapshot_observed_at":"2026-08-04T03:23:27.871067Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:27.871067Z"},"links":{"cited_paper":"/paper/2502.05111","citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:e39e506dd8a81ef070a83d537ff88288cf999c0bc33307426dce2937a23067cd","observation_id":"470aa6df-73d9-4478-9ce1-bd98a0ce08b9","resolution":{"observed_at":"2026-08-04T03:23:27.871067Z","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-04T03:23:27.985936Z","title":"Plummer, Zhaoran Wang, and Hongxia Yang","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:27.985936Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:71355341a3d0e09350ccfcbb1d9ed55255a1617a04f36e7ce678f02eeb74428f","observation_id":"062608ad-e2be-42ec-bf1c-f9f8c36ecadf","resolution":{"observed_at":"2026-08-04T03:23:27.985936Z","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-04T03:23:28.196220Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:28.196220Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:8429ee132596d96eaa02500beb73fccbf47b03af154b8bfe993799777fa71500","observation_id":"51933264-556b-4a68-8c89-54c136a4d85a","resolution":{"observed_at":"2026-08-04T03:23:28.196220Z","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-04T03:23:28.312126Z","title":null,"venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:28.312126Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:66de48335e69640bf3c0a881735d265c34e597985550721694ad08f7ba36a8e5","observation_id":"e9f34e88-c879-4da1-be58-044de96c2acc","resolution":{"observed_at":"2026-08-04T03:23:28.312126Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.15115","last_updated":"2025-01-03T02:18:21Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-12-19T17:56:09Z","title":"Qwen2.5 Technical Report","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.15115","snapshot_observed_at":"2026-08-04T03:23:28.379610Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:28.379610Z"},"links":{"cited_paper":"/paper/2412.15115","citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:cea361a8e7cfa06e82616929c644f56755cf2a3c6c801a0e39bccf0d150267da","observation_id":"558a42ad-b9f3-4df0-8c22-af977ccfa5a4","resolution":{"observed_at":"2026-08-04T03:23:28.379610Z","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-04T03:23:28.095904Z","title":"https://openreview.net/forum?id=sehRvaIPQQ","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:28.095904Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:a7adc2a2ba4e91e396c6be533ab7c8ffd8b76effe60772ec7a3629723479447b","observation_id":"6a4c6b5b-7725-4d35-8478-6b6db77cce0c","resolution":{"observed_at":"2026-08-04T03:23:28.095904Z","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-04T03:23:28.513859Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:28.513859Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:bc3fd659a32241fac49e90f63a1cd142cb1d6e48da2c11ece8b07f6af3858bcb","observation_id":"3f6c8778-704f-42d1-b938-21dee6aee0a7","resolution":{"observed_at":"2026-08-04T03:23:28.513859Z","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-04T03:23:28.590393Z","title":"Deshmukh, and Yiannis Kantaros","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:28.590393Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:b92507bf2e77af107749f82d169b88de1a09c6cb00a1d282fbb4d3b38a8ee7c5","observation_id":"ab4b5fcf-3ff1-4b27-9190-7168c8852922","resolution":{"observed_at":"2026-08-04T03:23:28.590393Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.00226","last_updated":"2025-07-16T04:59:12Z","snapshot_observed_at":"2026-07-06T20:15:03.658292Z","submitted_at":"2024-12-31T02:23:10Z","title":"Generative Emergent Communication: Large Language Model is a Collective World Model","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.00226","snapshot_observed_at":"2026-08-04T03:23:28.652563Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:28.652563Z"},"links":{"cited_paper":"/paper/2501.00226","citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:35c4fca113c258dbcfd7050aabda92cc6c675ca713c894328c88646d699e3f1d","observation_id":"d9d21e12-12d9-4e09-bb11-d1c0d3fd5d72","resolution":{"observed_at":"2026-08-04T03:23:28.652563Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2308.12950","last_updated":"2024-01-31T19:47:26Z","snapshot_observed_at":"2026-07-06T16:10:07.931347Z","submitted_at":"2023-08-24T17:39:13Z","title":"Code Llama: Open Foundation Models for Code","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2308.12950","snapshot_observed_at":"2026-08-04T03:23:28.451564Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:28.451564Z"},"links":{"cited_paper":"/paper/2308.12950","citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:c61b65d1ea75e9ed6aee23cd085731221b7226ec435d5afe478b0df0d9727aa2","observation_id":"d86841cd-1a54-472b-83dc-c323c316e3af","resolution":{"observed_at":"2026-08-04T03:23:28.451564Z","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-04T03:23:28.816765Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:28.816765Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:d9e6776366e8d20d0c5a3b926765d99290c16075afc093e13bc23d5edc906979","observation_id":"8b78efab-6c9d-4a63-aaa3-80fd4f14f480","resolution":{"observed_at":"2026-08-04T03:23:28.816765Z","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-04T03:23:28.918599Z","title":"Saurous, and Yoon Kim","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:28.918599Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:73665bbf200ffc60ef08b9987ffbe71c75db425ca9136d0c536b6317b9fc9271","observation_id":"2801f8ff-d757-40ea-8ed7-0bf0fd74712c","resolution":{"observed_at":"2026-08-04T03:23:28.918599Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.14532","last_updated":"2025-08-20T08:40:22Z","snapshot_observed_at":"2026-08-05T18:31:56.621388Z","submitted_at":"2025-08-20T08:40:22Z","title":"Preguss: It Analyzes, It Specifies, It Verifies","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.14532","snapshot_observed_at":"2026-08-04T03:23:29.017176Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:29.017176Z"},"links":{"cited_paper":"/paper/2508.14532","citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:c534d7ee462015c86b4ccee7bfc0071355dbb9875e8705014523af3adca1831b","observation_id":"95b7de63-3804-4c80-ba92-7405b24c874a","resolution":{"observed_at":"2026-08-04T03:23:29.017176Z","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-04T03:23:28.722232Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:28.722232Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:4ec8df69b6cef9986e18ddecf1a60410eb1be26e20229979cef12870e9cae009","observation_id":"c4a6a7f5-a464-4594-b933-c8357cc53f25","resolution":{"observed_at":"2026-08-04T03:23:28.722232Z","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-04T03:23:29.199414Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:29.199414Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:0a7947857c73b13c238ea3f61b7cb3f32867545286a8419bfb8da55955ae3439","observation_id":"bfa5ce8e-7f09-4b35-b594-a33cda66bb38","resolution":{"observed_at":"2026-08-04T03:23:29.199414Z","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-04T03:23:29.298526Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:29.298526Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:1413924af221dc4d7c14bb23d6e3179c03e1cca69ec4b84d818b64bc996176f2","observation_id":"c421cc40-29a7-47fc-bf23-58904b5ba7df","resolution":{"observed_at":"2026-08-04T03:23:29.298526Z","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-04T03:23:29.461241Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:29.461241Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:e1a795786f9d1ab723f8ff8d07ce10cbe6a9f71d318a4c53814727c7820eba9c","observation_id":"1ee05ea0-7e74-4e8c-9dfd-5bc7d16752f1","resolution":{"observed_at":"2026-08-04T03:23:29.461241Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09702","last_updated":"2023-08-19T21:27:51Z","snapshot_observed_at":"2026-08-09T04:46:02.275866Z","submitted_at":"2023-07-19T01:14:49Z","title":"Efficient Guided Generation for Large Language Models","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09702","snapshot_observed_at":"2026-08-04T03:23:29.099459Z","title":"Willard and Rémi Louf","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:29.099459Z"},"links":{"cited_paper":"/paper/2307.09702","citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:8535bb5263d670c6d89eb149baa4490f9a0ac1892b6a822664a1591adc536c99","observation_id":"cf10e6a7-9cff-4f49-be7f-827f45274e41","resolution":{"observed_at":"2026-08-04T03:23:29.099459Z","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-04T03:23:24.613364Z","title":"InProceedings of the 6th Machine Learning for Healthcare Conference (Proceedings of Machine Learning Research, Vol","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:24.613364Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:0a780ac141527f4956a9cb089d62ba764888d9a1cef00ceaeed45e1d53a7d1f8","observation_id":"b518bc8a-d934-48d4-be02-c72712694b5a","resolution":{"observed_at":"2026-08-04T03:23:24.613364Z","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-04T03:23:26.679096Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:26.679096Z"},"links":{"citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:48e3163c9e7536c84647b1a78f4f8739ebab88abfc6d1cc460033cf10bcabd79","observation_id":"6f04ac66-fbb3-43dd-994f-3f7b749421db","resolution":{"observed_at":"2026-08-04T03:23:26.679096Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.17988","last_updated":"2024-09-04T18:50:25Z","snapshot_observed_at":"2026-07-06T17:36:36.437597Z","submitted_at":"2024-02-28T02:12:47Z","title":"Constrained Decoding for Fill-in-the-Middle Code Language Models via Efficient Left and Right Quotienting of Context-Sensitive Grammars","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.17988","snapshot_observed_at":"2026-08-04T03:23:27.230305Z","title":"arXiv:2402.17988 [cs.PL] https://arxiv.org/abs/2402.17988","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-04T03:23:27.230305Z"},"links":{"cited_paper":"/paper/2402.17988","citing_paper":"/paper/2607.27964"},"observation_digest":"sha256:1f76561e60c8b86cd8a87cc6034f44b78cf500f12c847f56bca2210b25ab27d8","observation_id":"be31bb11-4657-403f-a2b3-b38e49f29ef5","resolution":{"observed_at":"2026-08-04T03:23:27.230305Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.27964","last_updated":"2026-08-02T10:30:36Z","latest_version":2,"primary_category":"cs.SE","snapshot_observed_at":"2026-08-09T09:50:05.547325Z","submitted_at":"2026-07-30T10:11:33Z","title":"Specification-Guided Synthesis of Deadlock-Free Communication Protocol Refinements with Large Language Models"},"reference_resolution":{"displayed":58,"state_counts":{"malformed_identifier":7,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":51,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":58},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 58 of 58 outbound references and 0 inbound Pith citation observations for arXiv:2607.27964."}