{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T03:20:16Z","timestamp":1783135216203,"version":"3.54.6"},"reference-count":49,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100014988","name":"Program for the Scientific Activities of Selected Returned Overseas Professionals in Shaanxi Province","doi-asserted-by":"publisher","award":["20220002"],"award-info":[{"award-number":["20220002"]}],"id":[{"id":"10.13039\/501100014988","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21A20473"],"award-info":[{"award-number":["U21A20473"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172370"],"award-info":[{"award-number":["62172370"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62476157"],"award-info":[{"award-number":["62476157"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62472270"],"award-info":[{"award-number":["62472270"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62536006"],"award-info":[{"award-number":["62536006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62106131"],"award-info":[{"award-number":["62106131"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003398","name":"Shanxi Scholarship Council of China","doi-asserted-by":"publisher","award":["2022-007"],"award-info":[{"award-number":["2022-007"]}],"id":[{"id":"10.13039\/501100003398","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP200102611"],"award-info":[{"award-number":["DP200102611"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["LP180100114"],"award-info":[{"award-number":["LP180100114"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.patcog.2026.113879","type":"journal-article","created":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T15:59:32Z","timestamp":1778169572000},"page":"113879","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PD","title":["Affinity maximization learning for unsupervised deep visual graph matching"],"prefix":"10.1016","volume":"179","author":[{"given":"Yu","family":"Xie","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yiming","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhe","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenjian","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A.K.","family":"Qin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1218-2804","authenticated-orcid":false,"given":"Ming","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.patcog.2026.113879_b1","article-title":"Generalizing graph matching beyond quadratic assignment model","volume":"31","author":"Yu","year":"2018","journal-title":"Adv. Neural Inf. Proc. Syst."},{"key":"10.1016\/j.patcog.2026.113879_b2","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/S0377-2217(97)00063-5","article-title":"A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method","author":"Hahn","year":"1998","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.patcog.2026.113879_b3","doi-asserted-by":"crossref","unstructured":"L. Torresani, V. Kolmogorov, C. Rother, Feature correspondence via graph matching: models and global optimization, in: Proc. Eur. Conf. Comput. Vision, 2008, pp. 596\u2013609.","DOI":"10.1007\/978-3-540-88688-4_44"},{"key":"10.1016\/j.patcog.2026.113879_b4","doi-asserted-by":"crossref","unstructured":"J. Qu, H. Ling, C. Zhang, X. Lyu, Z. Tang, Adaptive edge attention for graph matching with outliers, in: Proc. Int. Joint Conf. Artif. Intell., 2021, pp. 966\u2013972.","DOI":"10.24963\/ijcai.2021\/134"},{"key":"10.1016\/j.patcog.2026.113879_b5","doi-asserted-by":"crossref","unstructured":"Y. Lin Y, M. Yang, J. Yu, P. Hu, C. Zhang, X. Peng, Graph matching with bi-level noisy correspondence, in: Proc. IEEE Int. Conf. Comput. Vision, 2023, pp. 23362\u201323371.","DOI":"10.1109\/ICCV51070.2023.02135"},{"issue":"2","key":"10.1016\/j.patcog.2026.113879_b6","doi-asserted-by":"crossref","DOI":"10.1007\/s11432-024-4467-3","article-title":"Multi-topology contrastive graph representation learning","volume":"69","author":"Xie","year":"2026","journal-title":"Sci. China Inf. Sci."},{"issue":"2","key":"10.1016\/j.patcog.2026.113879_b7","doi-asserted-by":"crossref","first-page":"1707","DOI":"10.1109\/TPAMI.2025.3616350","article-title":"Deeper insights into deep graph convolutional networks: Stability and generalization","volume":"48","author":"Yang","year":"2026","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"10","key":"10.1016\/j.patcog.2026.113879_b8","doi-asserted-by":"crossref","first-page":"10411","DOI":"10.1109\/TKDE.2022.3221084","article-title":"Random deep graph matching","volume":"35","author":"Xie","year":"2022","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"9","key":"10.1016\/j.patcog.2026.113879_b9","first-page":"5261","article-title":"Neural graph matching network: Learning lawler\u2019s quadratic assignment problem with extension to hypergraph and multiple-graph matching","volume":"44","author":"Wang","year":"2021","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.patcog.2026.113879_b10","doi-asserted-by":"crossref","DOI":"10.1016\/j.patcog.2025.111943","article-title":"Multi-graph graph matching for coronary artery semantic labeling in invasive coronary angiograms","volume":"169","author":"Zhao","year":"2026","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.patcog.2026.113879_b11","article-title":"Generalizable egocentric task verification via cross-modal hybrid hypergraph matching","author":"Jiang","year":"2026","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.patcog.2026.113879_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.cviu.2025.104433","article-title":"Cross-graph meta matching correction for noisy graph matching","volume":"259","author":"Li","year":"2025","journal-title":"Comput. Vis. Image Underst."},{"key":"10.1016\/j.patcog.2026.113879_b13","doi-asserted-by":"crossref","DOI":"10.1109\/TPAMI.2026.3670236","article-title":"Learning with partial and noisy correspondence in graph matching","author":"Lin","year":"2026","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"8","key":"10.1016\/j.patcog.2026.113879_b14","doi-asserted-by":"crossref","first-page":"10500","DOI":"10.1109\/TPAMI.2023.3257830","article-title":"Unsupervised learning of graph matching with mixture of modes via discrepancy minimization","volume":"45","author":"Wang","year":"2023","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.patcog.2026.113879_b15","series-title":"Proc. Eur. Conf. Comput. Vision","first-page":"370","article-title":"Self-supervised learning of visual graph matching","author":"Liu","year":"2022"},{"key":"10.1016\/j.patcog.2026.113879_b16","doi-asserted-by":"crossref","unstructured":"K. Zhao, S. Tu, L. Xu, IA-GM: A deep bidirectional learning method for graph matching, in: Proc. AAAI Conf. Artif. Intell., 2021, pp. 3474\u20133482.","DOI":"10.1609\/aaai.v35i4.16461"},{"key":"10.1016\/j.patcog.2026.113879_b17","doi-asserted-by":"crossref","unstructured":"Q. Gao, F. Wang, N. Xue, J.-G. Yu, G.-S. Xia, Deep graph matching under quadratic constraint, in: Proc. IEEE\/CVF Conf. Comput. Vision Pattern Recognit., 2021, pp. 5069\u20135078.","DOI":"10.1109\/CVPR46437.2021.00503"},{"key":"10.1016\/j.patcog.2026.113879_b18","doi-asserted-by":"crossref","unstructured":"P.-E. Sarlin, D. DeTone, T. Malisiewicz, A. Rabinovich, SuperGlue: Learning feature matching with graph neural networks, in: Proc. IEEE\/CVF Conf. Comput. Vision Pattern Recognit., 2020, pp. 4938\u20134947.","DOI":"10.1109\/CVPR42600.2020.00499"},{"key":"10.1016\/j.patcog.2026.113879_b19","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/s11263-011-0442-2","article-title":"Unsupervised learning for graph matching","author":"Leordeanu","year":"2012","journal-title":"Int. J. Comput. Vis."},{"key":"10.1016\/j.patcog.2026.113879_b20","doi-asserted-by":"crossref","first-page":"1258","DOI":"10.1109\/TPAMI.2013.223","article-title":"GNCCP\u2014graduated NonConvexity and concavity procedure","author":"Liu","year":"2014","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"10.1016\/j.patcog.2026.113879_b21","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/TPAMI.2012.51","article-title":"A probabilistic approach to spectral graph matching","volume":"35","author":"Egozi","year":"2012","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.patcog.2026.113879_b22","doi-asserted-by":"crossref","unstructured":"A. Zanfir, C. Sminchisescu, Deep learning of graph matching, in: Proc. Comput. Vision Pattern Recognit., 2018, pp. 2684\u20132693.","DOI":"10.1109\/CVPR.2018.00284"},{"key":"10.1016\/j.patcog.2026.113879_b23","doi-asserted-by":"crossref","unstructured":"R. Wang, J. Yan, X. Yang, Learning combinatorial embedding networks for deep graph matching, in: Proc. IEEE\/CVF Int. Conf. Comput. Vision, 2019, pp. 3056\u20133065.","DOI":"10.1109\/ICCV.2019.00315"},{"key":"10.1016\/j.patcog.2026.113879_b24","article-title":"Segmn: a structure-enhanced graph matching network for graph similarity learning","author":"Wang","year":"2025","journal-title":"Pattern Recognit."},{"issue":"1","key":"10.1016\/j.patcog.2026.113879_b25","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1109\/TCSVT.2024.3457575","article-title":"Contrastive learning network for unsupervised graph matching","volume":"35","author":"Xie","year":"2025","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"10.1016\/j.patcog.2026.113879_b26","article-title":"Attention is all you need","volume":"30","author":"Vaswani","year":"2017","journal-title":"Adv. Neural Inf. Proc. Syst."},{"key":"10.1016\/j.patcog.2026.113879_b27","doi-asserted-by":"crossref","unstructured":"J. Guo, S. Zhang, R. Wang, C. Liu, J. Yan, GMTR: Graph Matching Transformers, in: ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP, 2024, pp. 6535\u20136539.","DOI":"10.1109\/ICASSP48485.2024.10448294"},{"key":"10.1016\/j.patcog.2026.113879_b28","series-title":"Normalized matching transformer","author":"Pourhadi","year":"2025"},{"key":"10.1016\/j.patcog.2026.113879_b29","doi-asserted-by":"crossref","unstructured":"P. Swoboda, A. Mokarian, C. Theobalt, F. Bernard, et al., A convex relaxation for multi-graph matching, in: Proc. IEEE\/CVF Conf. Comput. Vision Pattern Recognit., 2019, pp. 11156\u201311165.","DOI":"10.1109\/CVPR.2019.01141"},{"key":"10.1016\/j.patcog.2026.113879_b30","doi-asserted-by":"crossref","unstructured":"J. Yan, Y. Tian, H. Zha, X. Yang, Y. Zhang, S.M. Chu, Joint Optimization for Consistent Multiple Graph Matching, in: 2013 Proc. IEEE Int. Conf. Comput. Vision, 2013, pp. 1649\u20131656.","DOI":"10.1109\/ICCV.2013.207"},{"key":"10.1016\/j.patcog.2026.113879_b31","doi-asserted-by":"crossref","first-page":"3648","DOI":"10.1109\/TPAMI.2020.2989928","article-title":"Unifying offline and online multi-graph matching via finding shortest paths on supergraph","author":"Jiang","year":"2021","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.patcog.2026.113879_b32","article-title":"Solving the multi-way matching problem by permutation synchronization","volume":"26","author":"Pachauri","year":"2013","journal-title":"Adv. Neural Inf. Process. Syst."},{"issue":"35","key":"10.1016\/j.patcog.2026.113879_b33","doi-asserted-by":"crossref","first-page":"12763","DOI":"10.1073\/pnas.0806627105","article-title":"Global alignment of multiple protein interaction networks with application to functional orthology detection","volume":"105","author":"Singh","year":"2008","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"10.1016\/j.patcog.2026.113879_b34","first-page":"19908","article-title":"Graduated assignment for joint multi-graph matching and clustering with application to unsupervised graph matching network learning","volume":"33","author":"Wang","year":"2020","journal-title":"Adv. Neural Inf. Proc. Syst."},{"key":"10.1016\/j.patcog.2026.113879_b35","doi-asserted-by":"crossref","unstructured":"Z. Nurlanov, F.R. Schmidt, F. Bernard, Universe points representation learning for partial multi-graph matching, in: Proc. AAAI Conf. Artif. Intell., 2023, pp. 1984\u20131992.","DOI":"10.1609\/aaai.v37i2.25290"},{"key":"10.1016\/j.patcog.2026.113879_b36","doi-asserted-by":"crossref","DOI":"10.1109\/TKDE.2024.3401050","article-title":"Deep hierarchy-aware proxy hashing with self-paced learning for cross-modal retrieval","author":"Huo","year":"2024","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"10.1016\/j.patcog.2026.113879_b37","first-page":"1223","article-title":"Tensor multi-elastic kernel self-paced learning for time series clustering","volume":"33","author":"Tang","year":"2019","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"10.1016\/j.patcog.2026.113879_b38","doi-asserted-by":"crossref","first-page":"9234","DOI":"10.1109\/TNNLS.2022.3157688","article-title":"Self-paced co-training of graph neural networks for semi-supervised node classification","volume":"34","author":"Gong","year":"2023","journal-title":"IEEE Trans. Neural Networks Learn. Syst."},{"issue":"1","key":"10.1016\/j.patcog.2026.113879_b39","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1002\/nav.20053","article-title":"The Hungarian method for the assignment problem","volume":"52","author":"Kuhn","year":"2004","journal-title":"Nav. Res. Logist. Q."},{"key":"10.1016\/j.patcog.2026.113879_b40","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s11263-009-0275-4","article-title":"The Pascal visual object classes (VOC) challenge","volume":"88","author":"Everingham","year":"2010","journal-title":"Int. J. Comput. Vis."},{"key":"10.1016\/j.patcog.2026.113879_b41","doi-asserted-by":"crossref","unstructured":"M. Cho, K. Alahari, J. Ponce, Learning graphs to match, in: Proc. IEEE Int. Conf. Comput. Vision, 2013, pp. 25\u201332.","DOI":"10.1109\/ICCV.2013.11"},{"key":"10.1016\/j.patcog.2026.113879_b42","series-title":"The Caltech-UCSD birds-200\u20132011 dataset","author":"Wah","year":"2011"},{"key":"10.1016\/j.patcog.2026.113879_b43","doi-asserted-by":"crossref","unstructured":"R. Wang, Z. Guo, S. Jiang, X. Yang, J. Yan, Deep learning of partial graph matching via differentiable Top-K, in: Proc. Comput. Vision Pattern Recognit., 2023, pp. 6272\u20136281.","DOI":"10.1109\/CVPR52729.2023.00607"},{"key":"10.1016\/j.patcog.2026.113879_b44","doi-asserted-by":"crossref","unstructured":"M. Cho, J. Lee, K.M. Lee, Reweighted random walks for graph matching, in: Proc. Eur. Conf. Comput. Vision, 2010, pp. 492\u2013505.","DOI":"10.1007\/978-3-642-15555-0_36"},{"key":"10.1016\/j.patcog.2026.113879_b45","series-title":"Proc. Eur. Conf. Comput. Vision","first-page":"407","article-title":"Deep graph matching via blackbox differentiation of combinatorial solvers","author":"Rol\u00ednek","year":"2020"},{"key":"10.1016\/j.patcog.2026.113879_b46","doi-asserted-by":"crossref","first-page":"2587","DOI":"10.1109\/TIP.2024.3374221","article-title":"Cross-modal retrieval with noisy correspondence via consistency refining and mining","volume":"33","author":"Ma","year":"2024","journal-title":"IEEE Trans. Image Process."},{"key":"10.1016\/j.patcog.2026.113879_b47","doi-asserted-by":"crossref","unstructured":"F. Bernard, J. Thunberg, P. Swoboda, C. Theobalt, HiPPI: Higher-Order Projected Power Iterations for Scalable Multi-Matching, in: IEEE\/CVF Int. Conf. Comput. Vision, ICCV, 2019, pp. 10284\u201310293.","DOI":"10.1109\/ICCV.2019.01038"},{"key":"10.1016\/j.patcog.2026.113879_b48","unstructured":"T. Yu, R. Wang, J. Yan, B. Li, Learning deep graph matching with channel-independent embedding and Hungarian attention, in: Int. Conf. Learn. Represent., 2019."},{"issue":"9","key":"10.1016\/j.patcog.2026.113879_b49","doi-asserted-by":"crossref","first-page":"9019","DOI":"10.1109\/TKDE.2022.3220789","article-title":"Dual feature interaction-based graph convolutional network","volume":"35","author":"Zhao","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320326008447?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320326008447?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T03:00:54Z","timestamp":1783134054000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320326008447"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":49,"alternative-id":["S0031320326008447"],"URL":"https:\/\/doi.org\/10.1016\/j.patcog.2026.113879","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Affinity maximization learning for unsupervised deep visual graph matching","name":"articletitle","label":"Article Title"},{"value":"Pattern Recognition","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.patcog.2026.113879","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"113879"}}