Structure Complexity Entropy: A Principle for Structural Intelligence in AI | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Article Structure Complexity Entropy: A Principle for Structural Intelligence in AI Luan Zhirong, Shaobo Zheng, Yujun Lai, Haoran Ding, Lujuan Dang, and 5 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-8609404/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract Human intelligence excels at decomposing complex information into meaningful hierarchical structures, yet this capability remains a fundamental challenge for artificial intelligence. Current approaches, from manual curation to automated clustering, lack a principled way to quantify and autonomously discover such structures, often resulting in rigid binaries or semantically incoherent groupings. Here, we introduce Structural Complexity Entropy (SCEntropy), a novel metric that quantifies the internal disorder of an information set by measuring the heterogeneity of all pairwise relationships. SCEntropy provides AI with a foundational principle: a low value signifies a coherent concept, whereas a high value signals the need for decomposition. Leveraging this, we develop SCEntropy-driven Hierarchical Clustering (SHC), an algorithm that uses a single complexity threshold to autonomously construct multi-branch, semantically coherent hierarchies from the bottom up. We validate this principle across two core domains. In visual concept discovery, SHC not only recovers known taxonomies in image datasets like CIFAR-100 but also discovers semantically coherent and human-aligned super-categories, demonstrating an ability for autonomous knowledge structuring. Conversely, in natural language generation, we show that SCEntropy-derived hierarchies serve as a scaffold for coherent reasoning. By structurally constraining large language models, we enhance thematic focus and logical flow in multi-turn dialogues, mitigating semantic drift. Our work establishes SCEntropy as a universal framework for structural machine intelligence, enabling AI to not only discover how the world is organized but also to discipline its own internal processes, paving the way for more autonomous and interpretable systems. Physical sciences/Mathematics and computing/Computer science Physical sciences/Physics/Information theory and computation Full Text Additional Declarations There is NO Competing Interest. Supplementary Files Supplementaryinformation.docx Supplementary Information for munuscript Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-8609404","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Article","associatedPublications":[],"authors":[{"id":575594629,"identity":"030d5222-1f67-4a13-8613-1b098f226c75","order_by":0,"name":"Luan Zhirong","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA7UlEQVRIiWNgGAWjYBACPhDB2CABph5ABQ3wamFD0sIMUipBrBYIW4I4LRLJzx7+3GGRzy/dfq2ap+ZwHQN78zYJhpo7eLSkmRtInpGwnDnnTNnNGccOSzDwHCuTYDj2DI+WBDMJwzYJA4MbOWk3PrABtUjkmEkwNhzGoyX9m0QiVEtBwj+gFvk3hLQAzTwI1pJ+jOFjG8gWHgJaeN6USTYCtUjOyGGWnNmXLtnGk1ZskXAMtxZ+9vRtkj/b6gz4JdIffub5Zs3Pz354440PNbi1IAEeSHSAYyqBGA0MDOwPiFM3CkbBKBgFIw4AAJF3SwQFtGnqAAAAAElFTkSuQmCC","orcid":"https://orcid.org/0000-0001-8260-0584","institution":"Xi'an University of Technology","correspondingAuthor":true,"prefix":"","firstName":"Luan","middleName":"","lastName":"Zhirong","suffix":""},{"id":575594630,"identity":"45104d7f-8ca9-4471-ad7d-0843f352d34b","order_by":1,"name":"Shaobo Zheng","email":"","orcid":"","institution":"Xi'an University of Technology","correspondingAuthor":false,"prefix":"","firstName":"Shaobo","middleName":"","lastName":"Zheng","suffix":""},{"id":575594631,"identity":"59f4d7f1-c7bb-4508-b764-993f32918826","order_by":2,"name":"Yujun Lai","email":"","orcid":"","institution":"Xi'an University of Technology","correspondingAuthor":false,"prefix":"","firstName":"Yujun","middleName":"","lastName":"Lai","suffix":""},{"id":575594632,"identity":"e9802e4d-e829-42c7-976c-722e65296de2","order_by":3,"name":"Haoran Ding","email":"","orcid":"","institution":"Xi'an Jiaotong University","correspondingAuthor":false,"prefix":"","firstName":"Haoran","middleName":"","lastName":"Ding","suffix":""},{"id":575594633,"identity":"5160d69f-4079-42ad-aa58-51fb1a1e3f8b","order_by":4,"name":"Lujuan Dang","email":"","orcid":"","institution":"Xi'an Jiaotong University","correspondingAuthor":false,"prefix":"","firstName":"Lujuan","middleName":"","lastName":"Dang","suffix":""},{"id":575594634,"identity":"616f466d-d81f-4041-9582-e611cafd4813","order_by":5,"name":"Lei Xing","email":"","orcid":"","institution":"Xi'an Jiaotong University","correspondingAuthor":false,"prefix":"","firstName":"Lei","middleName":"","lastName":"Xing","suffix":""},{"id":575594635,"identity":"117a24a9-f260-4435-b3e1-328d2194025c","order_by":6,"name":"Kaizhong Zheng","email":"","orcid":"","institution":"Xi'an Jiaotong University","correspondingAuthor":false,"prefix":"","firstName":"Kaizhong","middleName":"","lastName":"Zheng","suffix":""},{"id":575594636,"identity":"cd8d8f73-8fec-4c05-90a9-bf36e8ce84c7","order_by":7,"name":"Liangjun Chen","email":"","orcid":"","institution":"Xi'an Jiaotong University","correspondingAuthor":false,"prefix":"","firstName":"Liangjun","middleName":"","lastName":"Chen","suffix":""},{"id":575594637,"identity":"2374658d-acf2-4c4f-9f1e-b1282d028550","order_by":8,"name":"Xinhu Zheng","email":"","orcid":"","institution":"The Hong Kong University of Science and Techonology (Guangzhou)","correspondingAuthor":false,"prefix":"","firstName":"Xinhu","middleName":"","lastName":"Zheng","suffix":""},{"id":575594638,"identity":"76de266d-8ed5-4d28-a344-fcb207d8e30d","order_by":9,"name":"Badong Chen","email":"","orcid":"","institution":"Xi'an Jiaotong University","correspondingAuthor":false,"prefix":"","firstName":"Badong","middleName":"","lastName":"Chen","suffix":""}],"badges":[],"createdAt":"2026-01-15 10:20:12","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-8609404/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-8609404/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":102963550,"identity":"3d5ee877-05dc-4b89-a3d2-06fb129120d3","added_by":"auto","created_at":"2026-02-19 04:18:57","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1049851,"visible":true,"origin":"","legend":"","description":"","filename":"manuscript0110.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8609404/v1_covered_bc99d63f-d637-4e90-850c-84783aa97d34.pdf"},{"id":100420479,"identity":"6d0815dd-9fff-46da-8f9d-3f88a562861e","added_by":"auto","created_at":"2026-01-16 13:28:48","extension":"docx","order_by":1,"title":"","display":"","copyAsset":false,"role":"supplement","size":1113818,"visible":true,"origin":"","legend":"Supplementary Information for munuscript","description":"","filename":"Supplementaryinformation.docx","url":"https://assets-eu.researchsquare.com/files/rs-8609404/v1/a804428e342b6c84701437cc.docx"}],"financialInterests":"There is \u003cb\u003eNO\u003c/b\u003e Competing Interest.","formattedTitle":"Structure Complexity Entropy: A Principle for Structural Intelligence in AI","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"
[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"","lastPublishedDoi":"10.21203/rs.3.rs-8609404/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-8609404/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"Human intelligence excels at decomposing complex information into meaningful hierarchical structures, yet this capability remains a fundamental challenge for artificial intelligence. Current approaches, from manual curation to automated clustering, lack a principled way to quantify and autonomously discover such structures, often resulting in rigid binaries or semantically incoherent groupings. Here, we introduce Structural Complexity Entropy (SCEntropy), a novel metric that quantifies the internal disorder of an information set by measuring the heterogeneity of all pairwise relationships. SCEntropy provides AI with a foundational principle: a low value signifies a coherent concept, whereas a high value signals the need for decomposition. Leveraging this, we develop SCEntropy-driven Hierarchical Clustering (SHC), an algorithm that uses a single complexity threshold to autonomously construct multi-branch, semantically coherent hierarchies from the bottom up. We validate this principle across two core domains. In visual concept discovery, SHC not only recovers known taxonomies in image datasets like CIFAR-100 but also discovers semantically coherent and human-aligned super-categories, demonstrating an ability for autonomous knowledge structuring. Conversely, in natural language generation, we show that SCEntropy-derived hierarchies serve as a scaffold for coherent reasoning. By structurally constraining large language models, we enhance thematic focus and logical flow in multi-turn dialogues, mitigating semantic drift. Our work establishes SCEntropy as a universal framework for structural machine intelligence, enabling AI to not only discover how the world is organized but also to discipline its own internal processes, paving the way for more autonomous and interpretable systems.","manuscriptTitle":"Structure Complexity Entropy: A Principle for Structural Intelligence in AI","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-01-16 13:19:48","doi":"10.21203/rs.3.rs-8609404/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"
[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"86a95360-1044-4f83-9aa7-ab53d3f6f020","owner":[],"postedDate":"January 16th, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":61246094,"name":"Physical sciences/Mathematics and computing/Computer science"},{"id":61246095,"name":"Physical sciences/Physics/Information theory and computation"}],"tags":[],"updatedAt":"2026-02-18T14:05:26+00:00","versionOfRecord":[],"versionCreatedAt":"2026-01-16 13:19:48","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-8609404","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-8609404","identity":"rs-8609404","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}
Text is read by the "Ask this paper" AI Q&A widget below.
Extraction quality varies by source — PMC NXML preserves structure
cleanly, OA-HTML may include some navigation residue, and OA-PDF can
have broken hyphenation. The publisher copy
(via DOI)
is the canonical version.