{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:40:50Z","timestamp":1773376850680,"version":"3.50.1"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"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":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619388","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"3456-3461","source":"Crossref","is-referenced-by-count":0,"title":["Subgraph Matching via Partial Optimal Transport"],"prefix":"10.1109","author":[{"given":"Wen-Xin","family":"Pan","sequence":"first","affiliation":[{"name":"EPFL,Signal Processing Laboratory (LTS4)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isabel","family":"Haasler","sequence":"additional","affiliation":[{"name":"EPFL,Signal Processing Laboratory (LTS4)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Frossard","sequence":"additional","affiliation":[{"name":"EPFL,Signal Processing Laboratory (LTS4)"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-014-0365-y"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW55543.2023.10161615"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487602"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-020-0360-y"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CISP-BMEI51763.2020.9263681"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl571"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM49781.2020.9381293"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/11585978_12"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.9.4.586"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/2535569.2448952"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9006525"},{"key":"ref12","first-page":"6275","article-title":"Optimal trans-port for structured data with application on graphs","volume-title":"International Conference on Machine Learning","author":"Titouan","year":"2019"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3390\/a13090212"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/058"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1561\/2200000073"},{"key":"ref16","first-page":"6275","article-title":"Optimal transport for structured data with application on graphs","volume-title":"Proceedings of the 36th International Conference on Machine Learning","author":"Titouan"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2010.171.673"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00205-008-0212-7"},{"key":"ref19","first-page":"2903","article-title":"Partial optimal tranport with applications on positive-unlabeled learning","volume":"33","author":"Chapel","year":"2020","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026543900054"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459199"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00499"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9093-5"},{"key":"ref24","first-page":"2664","article-title":"Gromov-Wasserstein averaging of kernel and distance matrices","volume-title":"International Conference on Machine Learning","author":"Peyre","year":"2016"},{"key":"ref25","first-page":"6932","article-title":"Gromov-Wasserstein learning for graph matching and node embedding","volume-title":"International Conference on Machine Learning","author":"Xu","year":"2019"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/91.917123"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/34.491619"},{"key":"ref28","first-page":"2664","article-title":"Gromov-Wasserstein averaging of kernel and distance matrices","volume-title":"International Conference on Machine Learning","author":"Peyre"},{"issue":"78","key":"ref29","first-page":"1","article-title":"POT: Python Optimal Transport","volume":"22","author":"Flamary","year":"2021","journal-title":"Journal of Machine Learning Research"},{"key":"ref30","article-title":"Subgraph matching via partial optimal transport","author":"Pan","year":"2024","journal-title":"ar Xiv preprint"},{"key":"ref31","author":"Kersting","year":"2016","journal-title":"Benchmark data sets for graph kernels"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411866"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619388.pdf?arnumber=10619388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:43Z","timestamp":1773347323000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619388\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619388","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}