{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T05:45:04Z","timestamp":1782798304464,"version":"3.54.5"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,18]]},"DOI":"10.1109\/infocom59046.2026.11571310","type":"proceedings-article","created":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T19:38:15Z","timestamp":1782761895000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["PASS-Aided Over-the-Air Computation via A Graph-based Proximal Policy Optimization Approach"],"prefix":"10.1109","author":[{"given":"Meng","family":"Zhang","sequence":"first","affiliation":[{"name":"Queen Mary University of London,London,UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruikang","family":"Zhong","sequence":"additional","affiliation":[{"name":"Xi’an Jiaotong University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yixuan","family":"Zou","sequence":"additional","affiliation":[{"name":"Queen Mary University of London,London,UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hyundong","family":"Shin","sequence":"additional","affiliation":[{"name":"Kyung Hee University,Republic of Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuanwei","family":"Liu","sequence":"additional","affiliation":[{"name":"The University of Hong Kong,Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2023.3343086"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2025.3626724"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2023.3264649"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2024.3500775"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.2500037"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2025.3601439"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2025.3621049"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2025.3530003"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2023.3321667"},{"key":"ref10","article-title":"Proximal policy optimization algorithms","author":"Schulman","year":"2017"}],"event":{"name":"IEEE INFOCOM 2026 - IEEE Conference on Computer Communications","location":"Tokyo, Japan","start":{"date-parts":[[2026,5,18]]},"end":{"date-parts":[[2026,5,21]]}},"container-title":["IEEE INFOCOM 2026 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11571071\/11571169\/11571310.pdf?arnumber=11571310","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T05:18:58Z","timestamp":1782796738000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11571310\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/infocom59046.2026.11571310","relation":{},"subject":[],"published":{"date-parts":[[2026,5,18]]}}}