{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T19:06:47Z","timestamp":1779131207038,"version":"3.51.4"},"reference-count":61,"publisher":"Association for Computing Machinery (ACM)","issue":"3","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62572303"],"award-info":[{"award-number":["62572303"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Research Foundation, Singapore and Infocomm Media Development Authority under its Trust Tech Funding Initiative","award":["A-8002332-00-00"],"award-info":[{"award-number":["A-8002332-00-00"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2026,5,18]]},"abstract":"<jats:p>\n                    We study the problem of optimal routing on financial exchange graphs. Given a directed graph\n                    <jats:italic toggle=\"yes\">G<\/jats:italic>\n                    = (\n                    <jats:italic toggle=\"yes\">V<\/jats:italic>\n                    ,\n                    <jats:italic toggle=\"yes\">E<\/jats:italic>\n                    ) where vertices represent assets and edges encode tradable pairs with effective exchange rates and capacities, the goal is to find a sequence of routes from a source asset to a target asset that maximizes the delivered output. This problem is data-intensive and time-critical, requiring real-time decisions under fragmented liquidity, size-dependent prices, heterogeneous fees, and tight capacity limits. To address the challenges, we present ORDER:\n                    <jats:bold>O<\/jats:bold>\n                    ptimal\n                    <jats:bold>R<\/jats:bold>\n                    outing with path in\n                    <jats:bold>D<\/jats:bold>\n                    exing in\n                    <jats:bold>E<\/jats:bold>\n                    xchange g\n                    <jats:bold>R<\/jats:bold>\n                    aphs, a high-efficiency routing solution for fast, iterative execution in financial exchange graphs. ORDER introduces a hierarchical bucket path index that localizes maintenance to impacted candidates and eliminates expensive global rescans. It further incorporates lazy computation and an adaptive controller for active-bucket sizing to stabilize update cost under discrete tier shifts and heterogeneous market depths. On real-world DeFi datasets, ORDER achieves up to\n                    <jats:bold>114\u00d7<\/jats:bold>\n                    speedup over state-of-the-art routers while preserving execution quality.We also demonstrate robustness across market regimes and token pairs, enabling timely, high-quality routing.\n                  <\/jats:p>","DOI":"10.1145\/3802097","type":"journal-article","created":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T18:19:16Z","timestamp":1779128356000},"page":"1-27","source":"Crossref","is-referenced-by-count":0,"title":["ORDER: Optimal Routing with Path Indexing in Exchange Graph [Data-Intensive &amp; Data Science Application]"],"prefix":"10.1145","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7083-6311","authenticated-orcid":false,"given":"Bingqiao","family":"Luo","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2301-4244","authenticated-orcid":false,"given":"Yuhang","family":"Chen","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-7323-6791","authenticated-orcid":false,"given":"Yuheng","family":"Cong","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-5800-6808","authenticated-orcid":false,"given":"Ziyu","family":"He","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8748-3225","authenticated-orcid":false,"given":"Jiaxin","family":"Jiang","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4060-9438","authenticated-orcid":false,"given":"Shixuan","family":"Sun","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8618-4581","authenticated-orcid":false,"given":"Bingsheng","family":"He","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-6520-1423","authenticated-orcid":false,"given":"Wee Howe","family":"Ang","sequence":"additional","affiliation":[{"name":"Tokka Labs, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,5,18]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Ethereum Average Block Time Chart. https:\/\/etherscan.io\/chart\/blocktime Accessed","year":"2024","unstructured":"[n.d.]. Ethereum Average Block Time Chart. https:\/\/etherscan.io\/chart\/blocktime Accessed: December 8, 2024."},{"key":"e_1_2_1_2_1","unstructured":"2025. 1inch. https:\/\/1inch.io\/. Accessed: 2025-10-13."},{"key":"e_1_2_1_3_1","unstructured":"1inch Network. 2023. 1inch Network Router v5. https:\/\/1inch.io\/. Accessed: 2025-08-25."},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Ittai Abraham Daniel Delling Andrew V Goldberg and Renato F Werneck. 2010. A hub-based labeling algorithm for shortest paths on road networks. Technical Report MSR-TR-2010-165. Microsoft Research.","DOI":"10.1007\/978-3-642-20662-7_20"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 23rd International World Wide Web Conference (WWW). 237-248","author":"Akiba Takuya","year":"2014","unstructured":"Takuya Akiba, Yoichi Iwata, and Yuichi Yoshida. 2014. Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. In Proceedings of the 23rd International World Wide Web Conference (WWW). 237-248."},{"key":"e_1_2_1_6_1","first-page":"14","article-title":"On polynomial-time combinatorial algorithms for maximum l-bounded flow. In Algorithms and Data Structures (WADS 2019)","author":"Altmanov\u00e1 K.","year":"2019","unstructured":"K. Altmanov\u00e1, P. Kolman, and J. Voborn\u00edk. 2019. On polynomial-time combinatorial algorithms for maximum l-bounded flow. In Algorithms and Data Structures (WADS 2019). Springer, 14-27.","journal-title":"Springer"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3490486.3538336"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1868237.1868241"},{"key":"e_1_2_1_9_1","volume-title":"Algorithm engineering: Selected results and surveys","author":"Bast Hannah","unstructured":"Hannah Bast, Daniel Delling, Andrew Goldberg, Matthias M\u00fcller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F Werneck. 2016. Route planning in transportation networks. In Algorithm engineering: Selected results and surveys. Springer, 19-80."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 46-55","author":"Bast Hannah","year":"2007","unstructured":"Hannah Bast, Stefan Funke, Dennis Matijevic, Peter Sanders, and Dominik Schultes. 2007. In transit to constant time shortest-path queries in road networks. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 46-55."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/102435"},{"key":"e_1_2_1_12_1","volume-title":"International Conference on Financial Cryptography and Data Security. Springer, 238-249","author":"Berg Jan Arvid","year":"2022","unstructured":"Jan Arvid Berg, Robin Fritsch, Lioba Heimbach, and RogerWattenhofer. 2022. An empirical study of market inefficiencies in uniswap and sushiswap. In International Conference on Financial Cryptography and Data Security. Springer, 238-249."},{"key":"e_1_2_1_13_1","volume-title":"Integer Programming and Combinatorial Optimization (IPCO","author":"Bley Andreas","year":"2010","unstructured":"Andreas Bley and Jo\u00e3o Neto. 2010. Approximability of 3-and 4-hop bounded disjoint paths problems. In Integer Programming and Combinatorial Optimization (IPCO 2010). Springer, 205-218."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.07.009"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_2_1_16_1","unstructured":"Coinsutra. [n.d.]. Best Crypto DEX Aggregators. https:\/\/coinsutra.com\/best-crypto-dex-aggregator\/. Accessed: 2026-02-04."},{"key":"e_1_2_1_17_1","volume-title":"International Conference on Financial Cryptography and Data Security. Springer, 207-226","author":"Danos Vincent","year":"2021","unstructured":"Vincent Danos, Hamza El Khalloufi, and Julien Prat. 2021. Global order routing on exchange networks. In International Conference on Financial Cryptography and Data Security. Springer, 207-226."},{"key":"e_1_2_1_18_1","volume-title":"Hamza El Khalloufi, and Santiago Valencia.","author":"Danos Vincent","year":"2024","unstructured":"Vincent Danos, Leo Murao Watson, Hamza El Khalloufi, and Santiago Valencia. 2024. On-chain optimal aggregation of Uniswap v3 clones. (2024)."},{"key":"e_1_2_1_19_1","volume-title":"International Conference on Financial Cryptography and Data Security. Springer, 128-145","author":"Diamandis Theo","year":"2023","unstructured":"Theo Diamandis, Max Resnick, Tarun Chitra, and Guillermo Angeris. 2023. An efficient algorithm for optimal routing through constant function market makers. In International Conference on Financial Cryptography and Data Security. Springer, 128-145."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_1_21_1","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in a network with power estimation","volume":"11","author":"Dinic E. A.","year":"1970","unstructured":"E. A. Dinic. 1970. Algorithm for solution of a problem of maximum flow in a network with power estimation. In Soviet Mathematics Doklady, Vol. 11. 1277-1280.","journal-title":"Soviet Mathematics Doklady"},{"key":"e_1_2_1_22_1","unstructured":"DODO Research. 2025. Reveal the Secrets of the Aggregator Problem: Analysis and Model Building. https:\/\/blog.dodoex.io\/dodo-research-reveal-the-secrets-of-the-aggregator-problem-analysis-and-model-building-ba0ead85948c. Accessed: 2026-03-15."},{"key":"e_1_2_1_23_1","doi-asserted-by":"crossref","first-page":"2405","DOI":"10.1111\/1540-6261.00501","article-title":"FX trading and exchange rate dynamics","volume":"57","author":"Evans Martin DD","year":"2002","unstructured":"Martin DD Evans. 2002. FX trading and exchange rate dynamics. The Journal of Finance 57, 6 (2002), 2405-2447.","journal-title":"The Journal of Finance"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1540-6261.2008.01312.x"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585202"},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the 25th ACM International Conference on Information and Knowledge Management (CIKM). 1533-1542","author":"Hayashi Takanori","year":"2016","unstructured":"Takanori Hayashi, Takuya Akiba, and Ken-ichi Kawarabayashi. 2016. Fully dynamic shortest-path distance query acceleration on massive networks. In Proceedings of the 25th ACM International Conference on Information and Knowledge Management (CIKM). 1533-1542."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1080.0524"},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Oleg Itskhoki and Dmitry Mukhin. 2023. Optimal exchange rate policy. Technical Report. National Bureau of Economic Research.","DOI":"10.3386\/w31933"},{"key":"e_1_2_1_32_1","volume-title":"Monte carlo methods","author":"Kalos Malvin H","unstructured":"Malvin H Kalos and Paula A Whitlock. 2008. Monte carlo methods. John Wiley & Sons."},{"key":"e_1_2_1_33_1","first-page":"71","article-title":"Optimal quantile approximation in streams. In 2016 ieee 57th annual symposium on foundations of computer science (focs)","author":"Karnin Zohar","year":"2016","unstructured":"Zohar Karnin, Kevin Lang, and Edo Liberty. 2016. Optimal quantile approximation in streams. In 2016 ieee 57th annual symposium on foundations of computer science (focs). IEEE, 71-78.","journal-title":"IEEE"},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s11403-009-0047-9","article-title":"Analysis of a network structure of the foreign currency exchange market","volume":"4","author":"Kwapie\u0144 Jaros\u0142aw","year":"2009","unstructured":"Jaros\u0142aw Kwapie\u0144, Sylwia Gworek, Stanis\u0142aw Dro\u017cd\u017c, and Andrzej G\u00f3rski. 2009. Analysis of a network structure of the foreign currency exchange market. Journal of economic interaction and coordination 4, 1 (2009), 55-72.","journal-title":"Journal of economic interaction and coordination"},{"key":"e_1_2_1_35_1","unstructured":"Zhetao Li Young-June Choi Hiroo Sekiya Qingyong Deng et al. 2025. Location and Reward Privacy-Preserving based Secure Task Allocation in Mobile Crowdsensing. IEEE Transactions on Mobile Computing (2025)."},{"key":"e_1_2_1_36_1","unstructured":"Bingqiao Luo Yuhang Chen Yuheng Cong et al. 2026. ORDER: Optimal Routing with Path Indexing in Exchange Graph. Technical Report. Technical Report. https:\/\/github.com\/Xtra-Computing\/ORDER\/blob\/main\/technical_report\/ORDER_Technique_Report.pdf Accessed: 2026-03-12."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/3749646.3749678"},{"key":"e_1_2_1_38_1","first-page":"28490","article-title":"Multi-Chain Graphs of Graphs: A New Approach to Analyzing Blockchain Datasets","volume":"37","author":"Luo Bingqiao","year":"2024","unstructured":"Bingqiao Luo, Zhen Zhang, Qian Wang, and Bingsheng He. 2024. Multi-Chain Graphs of Graphs: A New Approach to Analyzing Blockchain Datasets. Advances in Neural Information Processing Systems 37 (2024), 28490-28514.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_39_1","first-page":"1","article-title":"Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation","volume":"124","author":"Mahjoub Ali Ridha","year":"2010","unstructured":"Ali Ridha Mahjoub and S. Thomas McCormick. 2010. Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation. Mathematical Programming 124, 1-2 (2010), 271-284.","journal-title":"Mathematical Programming"},{"key":"e_1_2_1_40_1","first-page":"3295","volume-title":"32nd USENIX Security Symposium (USENIX Security 23)","author":"McLaughlin Robert","year":"2023","unstructured":"Robert McLaughlin, Christopher Kruegel, and Giovanni Vigna. 2023. A large scale study of the ethereum arbitrage ecosystem. In 32nd USENIX Security Symposium (USENIX Security 23). 3295-3312."},{"key":"e_1_2_1_41_1","first-page":"285","volume-title":"Proceedings of an International Symposium on the Theory of Switching","author":"Moore Edward F.","year":"1959","unstructured":"Edward F. Moore. 1959. The shortest path through a maze. Proceedings of an International Symposium on the Theory of Switching (1959), 285-292."},{"key":"e_1_2_1_42_1","unstructured":"Odos. 2025. Odos (The Optimal Order Routing Solution). https:\/\/www.odos.xyz\/."},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.2.338"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02614365"},{"key":"e_1_2_1_45_1","first-page":"938","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"34","author":"Tao Binglin","year":"2020","unstructured":"Binglin Tao, Mingyu Xiao, and jingyang Zhao. 2020. Finding minimum-weight link-disjoint paths with a few common nodes. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 34. 938-945."},{"key":"e_1_2_1_46_1","volume-title":"Proceedings of the 20th ACM International Conference on Information and Knowledge Management (CIKM). 1785-1794","author":"Tretyakov Konstantin","year":"2011","unstructured":"Konstantin Tretyakov, Abel Armas-Cervantes, Luciano Garc\u00eda-Ba\u00f1uelos, Jaak Vilo, and Marlon Dumas. 2011. Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs. In Proceedings of the 20th ACM International Conference on Information and Knowledge Management (CIKM). 1785-1794."},{"key":"e_1_2_1_47_1","unstructured":"Uniswap. 2023. Uniswap V3: Decentralized Exchange and Smart Order Router. https:\/\/app.uniswap.org\/. Accessed: 2025-08-25."},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2021.3088799"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOTEH.2018.8345547"},{"key":"e_1_2_1_50_1","volume-title":"0x: An open protocol for decentralized exchange on the Ethereum blockchain. URL: https:\/\/github.com\/0xProject\/whitepaper","author":"Warren Will","year":"2017","unstructured":"Will Warren and Amir Bandeali. 2017. 0x: An open protocol for decentralized exchange on the Ethereum blockchain. URL: https:\/\/github.com\/0xProject\/whitepaper (2017), 04-18."},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3709737"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00194"},{"key":"e_1_2_1_53_1","first-page":"20","volume-title":"2020 Conf. System Dynamics Society","author":"Yamaguchi Yokei","year":"2020","unstructured":"Yokei Yamaguchi and Kaoru Yamaguchi. 2020. Modeling cross-border payments and foreign exchange dynamics. In 2020 Conf. System Dynamics Society. University of Bergen, 20-24."},{"key":"e_1_2_1_54_1","volume-title":"BriDe Arbitrager: Enhancing Arbitrage in Ethereum 2.0 via Bribery-enabled Delayed Block Production. arXiv preprint arXiv:2407.08537","author":"Yang Hulin","year":"2024","unstructured":"Hulin Yang, Mingzhe Li, Jin Zhang, Alia Asheralieva, Qingsong Wei, and Siow Mong Rick Goh. 2024. BriDe Arbitrager: Enhancing Arbitrage in Ethereum 2.0 via Bribery-enabled Delayed Block Production. arXiv preprint arXiv:2407.08537 (2024)."},{"key":"e_1_2_1_55_1","volume-title":"Binance Smart Chain Average Block Time (I: BSCABT). https:\/\/ycharts.com\/indicators\/binance_smart_ chain_average_block_time Source: BscScan. Last updated","year":"2025","unstructured":"YCharts. 2025. Binance Smart Chain Average Block Time (I: BSCABT). https:\/\/ycharts.com\/indicators\/binance_smart_ chain_average_block_time Source: BscScan. Last updated Oct 14, 2025."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551820"},{"key":"e_1_2_1_57_1","volume-title":"A Line Graph-Based Framework for Identifying Optimal Routing Paths in Decentralized Exchanges. arXiv preprint arXiv:2504.15809","author":"Zhang Yu","year":"2025","unstructured":"Yu Zhang, Yafei Li, and Claudio Tessone. 2025. A Line Graph-Based Framework for Identifying Optimal Routing Paths in Decentralized Exchanges. arXiv preprint arXiv:2504.15809 (2025)."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICBC59979.2024.10634351"},{"key":"e_1_2_1_59_1","first-page":"18769","article-title":"Live graph lab: Towards open, dynamic and real transaction graphs with NFT","volume":"36","author":"Zhang Zhen","year":"2023","unstructured":"Zhen Zhang, Bingqiao Luo, Shengliang Lu, and Bingsheng He. 2023. Live graph lab: Towards open, dynamic and real transaction graphs with NFT. Advances in Neural Information Processing Systems 36 (2023), 18769-18793.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00113"},{"key":"e_1_2_1_61_1","volume-title":"IEEE International Conference on Data Engineering. IEEE, 405-416","author":"Zhu A. D.","unstructured":"A. D. Zhu, H. Ma, X. Xiao, S. Luo, Y. Tang, and S. Zhou. 2013. Shortest path and distance queries on road networks: towards bridging theory and practice. In IEEE International Conference on Data Engineering. IEEE, 405-416."}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3802097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T18:28:25Z","timestamp":1779128905000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3802097"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":61,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,5,18]]}},"alternative-id":["10.1145\/3802097"],"URL":"https:\/\/doi.org\/10.1145\/3802097","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,18]]}}}