{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T18:40:49Z","timestamp":1776883249631,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":69,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2023YFA1009401;2023YFA1009402"],"award-info":[{"award-number":["2023YFA1009401;2023YFA1009402"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071467"],"award-info":[{"award-number":["12071467"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Institut Henri Poincar\u00e9","doi-asserted-by":"publisher","award":["UAR 839 CNRS-Sorbonne Universit\u00e9"],"award-info":[{"award-number":["UAR 839 CNRS-Sorbonne Universit\u00e9"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"LabEx CARMIN","award":["ANR-10-LABX-59-01"],"award-info":[{"award-number":["ANR-10-LABX-59-01"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,16]]},"DOI":"10.1145\/3666000.3669674","type":"proceedings-article","created":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T13:18:51Z","timestamp":1721049531000},"page":"46-55","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Unlabeled Sensing Using Rank-One Moment Matrix Completion"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-3284-1823","authenticated-orcid":false,"given":"Hao","family":"Liang","sequence":"first","affiliation":[{"name":"Institute of Systems Science, Key Lab of Mathematics Mechanization, AMSS University of Chinese Academy of Sciences, CAS, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3125-3539","authenticated-orcid":false,"given":"Jingyu","family":"Lu","sequence":"additional","affiliation":[{"name":"Key Lab of Mathematics Mechanization, AMSS University of Chinese Academy of Sciences, CAS, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9158-3330","authenticated-orcid":false,"given":"Manolis C.","family":"Tsakiris","sequence":"additional","affiliation":[{"name":"Key Lab of Mathematics Mechanization, AMSS University of Chinese Academy of Sciences, CAS, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9973-2217","authenticated-orcid":false,"given":"Lihong","family":"Zhi","sequence":"additional","affiliation":[{"name":"Key Lab of Mathematics Mechanization, AMSS University of Chinese Academy of Sciences, CAS, China"}]}],"member":"320","published-online":{"date-parts":[[2024,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8635907"},{"key":"e_1_3_2_1_2_1","volume-title":"Annual Allerton Conference on Communication, Control, and Computing. 470\u2013477","author":"Abid A.","unstructured":"A. Abid and J. Zou. 2018. A Stochastic Expectation-Maximization Approach to Shuffled Linear Regression. In Annual Allerton Conference on Communication, Control, and Computing. 470\u2013477."},{"key":"e_1_3_2_1_3_1","volume-title":"Bertini: Software for Numerical Algebraic Geometry.","author":"Bates J.","year":"2019","unstructured":"Daniel\u00a0J. Bates, Jonathan\u00a0D. Hauenstein, Andrew\u00a0J. Sommese, and Charles\u00a0W. Wampler. 2019. Bertini: Software for Numerical Algebraic Geometry. (2019). https:\/\/doi.org\/"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452143.3465545"},{"key":"e_1_3_2_1_5_1","volume-title":"Convex optimization","author":"Boyd P","unstructured":"Stephen\u00a0P Boyd and Lieven Vandenberghe. 2004. Convex optimization. Cambridge university press."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0080378"},{"key":"e_1_3_2_1_7_1","unstructured":"Bruno Buchberger. 1965. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. PhD thesis Innsbruck."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01844169"},{"key":"e_1_3_2_1_9_1","volume-title":"Symbolic and Algebraic Computation","author":"Buchberger B.","unstructured":"B. Buchberger. 1979. A criterion for detecting unnecessary reductions in the construction of Gr\u00f6bner-bases. In Symbolic and Algebraic Computation. Springer Berlin Heidelberg, Berlin, Heidelberg, 3\u201321."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797640"},{"key":"e_1_3_2_1_13_1","volume-title":"International Conference on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes. Springer, 131\u2013151","author":"Caniglia Leandro","year":"1988","unstructured":"Leandro Caniglia, Andr\u00e9 Galligo, and Joos Heintz. 1988. Some new effectivity bounds in computational geometry. In International Conference on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes. Springer, 131\u2013151."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2015.7383723"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-020-09471-y"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2570862"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000025800.10423.1f"},{"key":"e_1_3_2_1_18_1","volume-title":"IEEE International Conference on Acoustics, Speech and Signal Processing. 4566\u20134570","author":"Elhami G.","unstructured":"G. Elhami, A. Scholefield, B.\u00a0B\u00e9jar Haro, and M. Vetterli. 2017. Unlabeled sensing: Reconstruction algorithm and theoretical guarantees. In IEEE International Conference on Acoustics, Speech and Signal Processing. 4566\u20134570."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(99)00005-5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2015.12.001"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2008.5074571"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3849-0"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-019-00396-w"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.9.9.868"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2933650"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062142"},{"key":"e_1_3_2_1_28_1","volume-title":"Effective methods in algebraic geometry","author":"Lakshman N","unstructured":"Yagati\u00a0N Lakshman. 1991. A single exponential bound on the complexity of computing Gr\u00f6bner bases of zero dimensional ideals. In Effective methods in algebraic geometry. Springer, 227\u2013234."},{"key":"e_1_3_2_1_29_1","volume-title":"Effective methods in algebraic geometry","author":"Lakshman N","unstructured":"Yagati\u00a0N Lakshman and Daniel Lazard. 1991. On the complexity of zero-dimensional algebraic systems. In Effective methods in algebraic geometry. Springer, 217\u2013225."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/3115443.3115594"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.03.024"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"J.B. Lasserre M. Laurent and P. Rostalski. 2009. A unified approach to computing real and complex zeros of zero-dimensional ideals. In Emerging applications of algebraic geometry. IMA Vol. Math. Appl. Vol.\u00a0149. Springer New York 125\u2013155.","DOI":"10.1007\/978-0-387-09686-5_6"},{"key":"e_1_3_2_1_33_1","series-title":"SIAM Journal on optimization 11, 3","volume-title":"Global optimization with polynomials and the problem of moments","author":"Lasserre B","year":"2001","unstructured":"Jean\u00a0B Lasserre. 2001. Global optimization with polynomials and the problem of moments. SIAM Journal on optimization 11, 3 (2001), 796\u2013817."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.2307\/4097911"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-008-0015-6"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-022-01709-2"},{"key":"e_1_3_2_1_37_1","volume-title":"Numerical solution of multivariate polynomial systems by homotopy continuation methods. Acta numerica 6","author":"Tien-Yien Li.","year":"1997","unstructured":"Tien-Yien Li. 1997. Numerical solution of multivariate polynomial systems by homotopy continuation methods. Acta numerica 6 (1997), 399\u2013436."},{"key":"e_1_3_2_1_38_1","unstructured":"Hao Liang Jingyu Lu Manolis\u00a0C. Tsakiris and Lihong Zhi. 2023. A Field-Theoretic Approach to Unlabeled Sensing. arxiv:2303.01175"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/asaa082"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2442829.2442866"},{"key":"e_1_3_2_1_41_1","volume-title":"The Algebraic Theory of Modular Systems","author":"Macaulay F.S.","unstructured":"F.S. Macaulay. 1916. The Algebraic Theory of Modular Systems. Cambridge Tracts in Mathematics and Mathematical Physics, Vol.\u00a019. Cambridge."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459318"},{"key":"e_1_3_2_1_43_1","unstructured":"H. Mel\u00e1nov\u00e1 B. Sturmfels and R. Winter. 2022. Recovery from Power Sums. Experimental Mathematics (2022) 1\u201310."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/0096-3003(87)90064-6"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.33"},{"key":"e_1_3_2_1_46_1","volume-title":"2021 IEEE Winter Conference on Applications of Computer Vision (WACV) (2021","author":"Nejatbakhsh Amin","year":"2094","unstructured":"Amin Nejatbakhsh and E. Varol. 2021. Neuron matching in C. elegans with robust approximate linear regression without correspondence. 2021 IEEE Winter Conference on Applications of Computer Vision (WACV) (2021), 2836\u20132845. https:\/\/api.semanticscholar.org\/CorpusID:230102094"},{"key":"e_1_3_2_1_47_1","volume-title":"Interior point polynomial time methods in convex programming. Lecture notes 42, 16","author":"Nemirovski Arkadi","year":"2004","unstructured":"Arkadi Nemirovski. 2004. Interior point polynomial time methods in convex programming. Lecture notes 42, 16 (2004), 3215\u20133224."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2928130"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/130935112"},{"key":"e_1_3_2_1_50_1","volume-title":"Low rank tensor decompositions and approximations. Journal of the Operations Research Society of China","author":"Nie Jiawang","year":"2023","unstructured":"Jiawang Nie, Li Wang, and Zequn Zheng. 2023. Low rank tensor decompositions and approximations. Journal of the Operations Research Society of China (2023), 1\u201327."},{"key":"e_1_3_2_1_51_1","volume-title":"Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization","author":"Parrilo A","unstructured":"Pablo\u00a0A Parrilo. 2000. Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. California Institute of Technology."},{"key":"e_1_3_2_1_52_1","volume-title":"Semidefinite programming relaxations for semialgebraic problems. Mathematical programming 96","author":"Parrilo A","year":"2003","unstructured":"Pablo\u00a0A Parrilo. 2003. Semidefinite programming relaxations for semialgebraic problems. Mathematical programming 96 (2003), 293\u2013320."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2020.3019693"},{"key":"e_1_3_2_1_54_1","series-title":"SIAM review 52, 3","volume-title":"Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization","author":"Recht Benjamin","year":"2010","unstructured":"Benjamin Recht, Maryam Fazel, and Pablo\u00a0A Parrilo. 2010. Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM review 52, 3 (2010), 471\u2013501."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2007.10.013"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875147"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1214\/18-EJS1498"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437552"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556789908805766"},{"key":"e_1_3_2_1_60_1","unstructured":"Defeng Sun Kim-Chuan Toh Yancheng Yuan and Xin-Yuan Zhao. 2019. SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0). arxiv:1710.10604\u00a0[math.OC]"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206879"},{"key":"e_1_3_2_1_62_1","volume-title":"Homomorphic Sensing. In Proceedings of the 36th International Conference on Machine Learning(Proceedings of Machine Learning Research, Vol.\u00a097)","author":"C.","unstructured":"Manolis\u00a0C. Tsakiris and Liangzu Peng. 2019. Homomorphic Sensing. In Proceedings of the 36th International Conference on Machine Learning(Proceedings of Machine Learning Research, Vol.\u00a097), Kamalika Chaudhuri and Ruslan Salakhutdinov (Eds.). PMLR, 6335\u20136344. https:\/\/proceedings.mlr.press\/v97\/tsakiris19a.html"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977166"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447086"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2809002"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1137\/110845768"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/317275.317286"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11424-023-1406-7"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465506.2465951"}],"event":{"name":"ISSAC '24: International Symposium on Symbolic and Algebraic Computation","location":"Raleigh NC USA","acronym":"ISSAC '24","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"]},"container-title":["Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3669674","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3666000.3669674","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:52:40Z","timestamp":1758588760000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3669674"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,16]]},"references-count":69,"alternative-id":["10.1145\/3666000.3669674","10.1145\/3666000"],"URL":"https:\/\/doi.org\/10.1145\/3666000.3669674","relation":{},"subject":[],"published":{"date-parts":[[2024,7,16]]},"assertion":[{"value":"2024-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}