{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T04:21:39Z","timestamp":1744258899138,"version":"3.40.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T00:00:00Z","timestamp":1736899200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T00:00:00Z","timestamp":1736899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62472082","62472082","62472082"],"award-info":[{"award-number":["62472082","62472082","62472082"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s00224-024-10206-7","type":"journal-article","created":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T04:25:49Z","timestamp":1736915149000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dichotomy for Non-negative Valued Holant Problems on 3-Regular Bipartite Graphs"],"prefix":"10.1007","volume":"69","author":[{"given":"Junda","family":"Li","sequence":"first","affiliation":[]},{"given":"Yuan","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Yanlin","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,15]]},"reference":[{"key":"10206_CR1","unstructured":"Backens, M.: The inductive entanglement classification yields ten rather than eight classes of four-qubit entangled states. arXiv:1611.02076 (2016)"},{"key":"10206_CR2","unstructured":"Backens, M.: A new holant dichotomy inspired by quantum computation. In 44th International Colloquium on Automata, Languages, and Programming, p. 16 (2017)"},{"issue":"5","key":"10206_CR3","first-page":"1","volume":"60","author":"A Bulatov","year":"2013","unstructured":"Bulatov, A.: The complexity of the counting constraint satisfaction problem. J. ACM (JACM) 60(5), 1\u201341 (2013)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"10206_CR4","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1016\/j.jcss.2011.12.002","volume":"78","author":"A Bulatov","year":"2012","unstructured":"Bulatov, A., Dyer, M., Goldberg, L.A., Jalsenius, M., Jerrum, M., Richerby, D.: The complexity of weighted and unweighted #csp. J. Comput. Syst. Sci. 78(2), 681\u2013688 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2\u20133","key":"10206_CR5","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.tcs.2005.09.011","volume":"348","author":"A Bulatov","year":"2005","unstructured":"Bulatov, A., Grohe, M.: The complexity of partition functions. Theor. Comput. Sci. 348(2\u20133), 148\u2013186 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"10206_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/9781107477063","volume-title":"Complexity dichotomies for counting problems:","author":"J-Y Cai","year":"2017","unstructured":"Cai, J.-Y., Chen, X.: Complexity dichotomies for counting problems:, vol. 1. Cambridge University Press, Boolean domain (2017)"},{"issue":"3","key":"10206_CR7","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1137\/110840194","volume":"42","author":"J-Y Cai","year":"2013","unstructured":"Cai, J.-Y., Chen, X., Lu, P.: Graph homomorphisms with complex values: A dichotomy theorem. SIAM J. Comput. 42(3), 924\u20131029 (2013)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10206_CR8","doi-asserted-by":"publisher","first-page":"2177","DOI":"10.1137\/15M1032314","volume":"45","author":"J-Y Cai","year":"2016","unstructured":"Cai, J.-Y., Chen, X., Lu, P.: Nonnegative weighted #csp: an effective complexity dichotomy. SIAM J. Comput. 45(6), 2177\u20132198 (2016)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10206_CR9","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s00037-023-00237-w","volume":"32","author":"J-Y Cai","year":"2023","unstructured":"Cai, J.-Y., Fu, Z., Girstmair, K., Kowalczyk, M.: A complexity trichotomy for k-regular asymmetric spin systems using number theory. Comput. Complex. 32(1), 4 (2023)","journal-title":"Comput. Complex."},{"key":"10206_CR10","doi-asserted-by":"crossref","unstructured":"Cai, J.-Y., Guo, H., Williams, T.: A complete dichotomy rises from the capture of vanishing signatures. In Proceedings of the forty-fifth annual ACM symposium on Theory of computing, pp. 635\u2013644 (2013)","DOI":"10.1145\/2488608.2488687"},{"issue":"2","key":"10206_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3305272","volume":"11","author":"J-Y Cai","year":"2019","unstructured":"Cai, J.-Y., Kowalczyk, M., Williams, T.: Gadgets and anti-gadgets leading to a complexity dichotomy. ACM Trans. Comput. Theory 11(2), 1\u201326 (2019)","journal-title":"ACM Trans. Comput. Theory"},{"key":"10206_CR12","doi-asserted-by":"crossref","unstructured":"Cai, J.-Y., Lu, P., Xia, M.: Holant problems and counting csp. In Proceedings of the forty-first annual ACM symposium on Theory of computing, pp. 715\u2013724 (2009)","DOI":"10.1145\/1536414.1536511"},{"issue":"2","key":"10206_CR13","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1016\/j.laa.2011.02.032","volume":"438","author":"J-Y Cai","year":"2013","unstructured":"Cai, J.-Y., Lu, P., Xia, M.: Holographic algorithms by fibonacci gates. Linear Algebra Appl. 438(2), 690\u2013707 (2013)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"10206_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.jcss.2013.07.003","volume":"80","author":"J-Y Cai","year":"2014","unstructured":"Cai, J.-Y., Lu, P., Xia, M.: The complexity of complex weighted boolean #csp. J. Comput. Syst. Sci. 80(1), 217\u2013236 (2014)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"10206_CR15","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1137\/16M1073984","volume":"46","author":"J-Y Cai","year":"2017","unstructured":"Cai, J.-Y., Lu, P., Xia, M.: Holographic algorithms with matchgates capture precisely tractable planar #csp. SIAM J. Comput. 46(3), 853\u2013889 (2017)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"10206_CR16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.61.052306","volume":"61","author":"V Coffman","year":"2000","unstructured":"Coffman, V., Kundu, J., Wootters, W.K.: Distributed entanglement. Phys. Rev. A 61(5), 052306 (2000)","journal-title":"Phys. Rev. A"},{"issue":"5","key":"10206_CR17","doi-asserted-by":"publisher","first-page":"1970","DOI":"10.1137\/070690201","volume":"38","author":"M Dyer","year":"2009","unstructured":"Dyer, M., Goldberg, L.A., Jerrum, M.: The complexity of weighted boolean #csp. SIAM J. Comput. 38(5), 1970\u20131986 (2009)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10206_CR18","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<260::AID-RSA5>3.0.CO;2-W","volume":"17","author":"M Dyer","year":"2000","unstructured":"Dyer, M., Greenhill, C.: The complexity of counting graph homo-morphisms. Random Struct. Algoritm. 17(3), 260\u2013289 (2000)","journal-title":"Random Struct. Algoritm."},{"issue":"3","key":"10206_CR19","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/100811258","volume":"42","author":"M Dyer","year":"2013","unstructured":"Dyer, M., Richerby, D.: An effective dichotomy for the counting constraint satisfaction problem. SIAM J. Comput. 42(3), 1245\u20131274 (2013)","journal-title":"SIAM J. Comput."},{"key":"10206_CR20","doi-asserted-by":"crossref","unstructured":"Fan, A.Z., Cai, J.-Y.: Dichotomy result on 3-regular bipartite nonnegative functions. In 16th International Computer Science Symposium in Russia, pp. 102\u2013115 (2021)","DOI":"10.1007\/978-3-030-79416-3_6"},{"issue":"1","key":"10206_CR21","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1090\/S0894-0347-06-00529-7","volume":"20","author":"M Freedman","year":"2007","unstructured":"Freedman, M., Lov\u00e1sz, L., Schrijver, A.: Reflection positivity, rank connectivity, and homomorphism of graphs. J. Am. Math. Soc. 20(1), 37\u201351 (2007)","journal-title":"J. Am. Math. Soc."},{"key":"10206_CR22","doi-asserted-by":"crossref","unstructured":"Kaiser, G.: Mathematical modelling and applications in education. Encyclopedia of mathematics education, pp. 553\u2013561 (2020)","DOI":"10.1007\/978-3-030-15789-0_101"},{"issue":"1","key":"10206_CR23","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s00224-016-9671-7","volume":"59","author":"M Kowalczyk","year":"2016","unstructured":"Kowalczyk, M., Cai, J.-Y.: Holant problems for 3-regular graphs with complex edge functions. Theory Comput. Syst. 59(1), 133\u2013158 (2016)","journal-title":"Theory Comput. Syst."},{"issue":"5","key":"10206_CR24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.74.052336","volume":"74","author":"L Lamata","year":"2006","unstructured":"Lamata, L., Le\u00f3n, J., Salgado, D., Solano, E.: Inductive classification of multipartite entanglement under stochastic local operations and classical communication. Phys. Rev. A 74(5), 052336 (2006)","journal-title":"Phys. Rev. A"},{"issue":"2","key":"10206_CR25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.75.022318","volume":"75","author":"L Lamata","year":"2007","unstructured":"Lamata, L., Le\u00f3n, J., Salgado, D., Solano, E.: Inductive entanglement classification of four qubits under stochastic local operations and classical communication. Phys. Rev. A 75(2), 022318 (2007)","journal-title":"Phys. Rev. A"},{"key":"10206_CR26","doi-asserted-by":"crossref","unstructured":"Lin, J.: On the complexity of #csp$$^{\\wedge }$$d. Theory Comput. Syst. 5, 1\u201313 (2021)","DOI":"10.1007\/s00224-021-10060-x"},{"key":"10206_CR27","unstructured":"Lin, J., Wang, H.: The complexity of holant problems over boolean domain with nonnegative weights. In 44th International Colloquium on Automata, Languages, and Programming, pp. 29:1\u201329:14 (2017)"},{"key":"10206_CR28","doi-asserted-by":"crossref","unstructured":"Shao, S., Cai, J.-Y., A dichotomy for real boolean holant problems. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 1091\u20131102 (2020)","DOI":"10.1109\/FOCS46700.2020.00105"},{"key":"10206_CR29","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Quantum computers that can be simulated classically in polynomial time. In Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp. 114\u2013123 (2001)","DOI":"10.1145\/380752.380785"},{"key":"10206_CR30","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Accidental algorthims. In 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906), pp. 509\u2013517 (2006)","DOI":"10.1109\/FOCS.2006.7"},{"issue":"5","key":"10206_CR31","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.1137\/070682575","volume":"37","author":"LG Valiant","year":"2008","unstructured":"Valiant, L.G.: Holographic algorithms. SIAM J. Comput. 37(5), 1565\u20131594 (2008)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"10206_CR32","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.65.052112","volume":"65","author":"F Verstraete","year":"2002","unstructured":"Verstraete, F., Dehaene, J., De Moor, B., Verschelde, H.: Four qubits can be entangled in nine different ways. Phys. Rev. A 65(5), 052112 (2002)","journal-title":"Phys. Rev. A"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10206-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-024-10206-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10206-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T16:49:13Z","timestamp":1744217353000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-024-10206-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,15]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["10206"],"URL":"https:\/\/doi.org\/10.1007\/s00224-024-10206-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2025,1,15]]},"assertion":[{"value":"6 November 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"4"}}