{"work":{"id":"acb48d7e-3d8c-4d4b-aa78-4fbb2d027427","openalex_id":null,"doi":"10.1137/s003614450342480","arxiv_id":null,"raw_key":"raw:b0f18d59ab5fbabce8829677","title":"The Structure and Function of Complex Networks","authors":[{"given":"M. E. J.","family":"Newman","sequence":"first","affiliation":[{"name":"Department of Physics and Center for the Study of Complex Systems, University of Michigan, Ann Arbor, MI 48109."}]}],"authors_text":"M","year":2003,"venue":"SIAM Review","abstract":null,"external_url":"https://doi.org/10.1137/s003614450342480","cited_by_count":13819,"metadata_source":"doi_reference","metadata_fetched_at":"2026-06-30T03:24:11.970684+00:00","pith_arxiv_id":null,"created_at":"2026-05-08T16:53:28.843188+00:00","updated_at":"2026-06-30T03:24:11.970684+00:00","title_quality_ok":true,"display_title":"The Structure and Function of Complex Networks","render_title":"The Structure and Function of Complex Networks"},"hub":{"state":{"work_id":"acb48d7e-3d8c-4d4b-aa78-4fbb2d027427","tier":"super_hub","tier_reason":"100+ Pith inbound or 10,000+ external citations","pith_inbound_count":11,"external_cited_by_count":13819,"distinct_field_count":11,"first_pith_cited_at":"2026-04-09T22:08:56+00:00","last_pith_cited_at":"2026-06-29T13:17:52+00:00","author_build_status":"needed","summary_status":"needed","contexts_status":"needed","graph_status":"needed","ask_index_status":"needed","reader_status":"not_needed","recognition_status":"not_needed","updated_at":"2026-06-30T06:09:33.592819+00:00","tier_text":"super_hub"},"tier":"super_hub","role_counts":[{"context_role":"method","n":1}],"polarity_counts":[{"context_polarity":"use_method","n":1}],"runs":{"ask_index":{"job_type":"ask_index","status":"succeeded","result":{"title":"The Structure and Function of Complex Networks","claims":[{"claim_text":"are present), as well as centrality measures (degree [22], betweenness [23], closeness [22] for each node). We averaged these across nodes to compare overall connectedness. We also calculated clustering coefficients (local and global) and counted simple motifs (triangles) [25, 26, 27]. To see how factors were grouped, we ran three community detection algorithms - Leiden [28], Girvan-Newman [29], and Infomap [30], on each graph. We analyzed whether communities contained nodes of the same 5P categ","claim_type":"method","confidence":0.85,"evidence_strength":"citation_context"}],"why_cited":"Pith tracks The Structure and Function of Complex Networks because it crossed a citation-hub threshold. Current citing contexts most often use it as method evidence (1 contexts).","role_counts":[{"n":1,"context_role":"method"}]},"error":null,"updated_at":"2026-06-30T03:29:29.375866+00:00"},"author_expand":{"job_type":"author_expand","status":"succeeded","result":{"authors_linked":[{"id":"b2514f4f-d98e-42e6-b883-03714e360b6b","orcid":null,"display_name":"M. E. J. Newman"}]},"error":null,"updated_at":"2026-06-30T03:29:29.546000+00:00"},"context_extract":{"job_type":"context_extract","status":"succeeded","result":{"enqueued_papers":25},"error":null,"updated_at":"2026-06-30T03:29:34.299088+00:00"},"graph_features":{"job_type":"graph_features","status":"succeeded","result":{"co_cited":[{"title":"Statistical mechanics of complex networks","work_id":"0090d899-71aa-49bb-ad88-6237497a66ce","shared_citers":3},{"title":"10 Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze, Marcel Radermacher, and Lasse Wulf","work_id":"17e3b0c7-e9c9-45d1-8ce5-e62b689bd132","shared_citers":1},{"title":"1965 , publisher=","work_id":"9dd8dc56-72ae-4608-ae1b-7b62fd01e41a","shared_citers":1},{"title":"1979 , issn =","work_id":"a99c0f55-5258-49b3-a6cd-63385ce86ce8","shared_citers":1},{"title":"1991 , journal =","work_id":"284d4a89-7f86-4457-aad0-65fb56bf73ae","shared_citers":1},{"title":"1993 , publisher=","work_id":"7170148a-15a9-41ab-a06b-bee2b652ffd0","shared_citers":1},{"title":"1998 , publisher=","work_id":"3357c5d6-65b0-497f-acf0-ce874315541f","shared_citers":1},{"title":"2000 , journal =","work_id":"836d11fa-6d70-4807-83bd-89eef8a68762","shared_citers":1},{"title":"2005 , journal =","work_id":"86a0733d-a7bb-4dfa-a122-a69c9e4e5c3a","shared_citers":1},{"title":"2010.194274","work_id":"ddecc9f6-029b-4f75-a3e6-16099399c35c","shared_citers":1},{"title":"2010 , publisher=","work_id":"be2edf46-7e95-4846-8451-1c1d5c353c9d","shared_citers":1},{"title":"2010 , publisher=","work_id":"4cb29216-35f1-4381-b012-b94a9dca26e5","shared_citers":1},{"title":"2014 , journal =","work_id":"72cde755-08d2-4fa2-8d85-323d2c88492e","shared_citers":1},{"title":"2017 , month=","work_id":"7756ede5-652f-45f6-898f-96aa91f6c5a2","shared_citers":1},{"title":"2020 , howpublished =","work_id":"51c571f1-9da3-465b-87b8-2a0fc050c0ea","shared_citers":1},{"title":"2020 , howpublished =","work_id":"8730fbd7-57e1-4448-bd94-f3ac37c8ae64","shared_citers":1},{"title":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages =","work_id":"c016149e-231e-40ae-a771-6cdae0f78587","shared_citers":1},{"title":"2020 , issn =","work_id":"68aa02ef-6c1c-4d9c-b225-32fd5b20bb8c","shared_citers":1},{"title":"2023 , url =","work_id":"fba7e464-94b6-4f4c-95c0-f01354cf0450","shared_citers":1},{"title":"2024.doi:10.48550/ARXIV.2406.19108","work_id":"e01d0f6e-1ce0-4bd9-8478-5c59829bca05","shared_citers":1},{"title":"2025 , publisher =","work_id":"29660133-ed4a-4b77-97e6-b9c6482156da","shared_citers":1},{"title":"Acar, Daniel Anderson, Guy E","work_id":"aac71688-ed3e-43d8-9a69-d0b581c830b6","shared_citers":1},{"title":"A definition , author =","work_id":"1d2ef2a8-c3e9-41e8-9c5b-69313233df08","shared_citers":1},{"title":"A generalized convolution model and estimation for non-stationary random functions , volume=","work_id":"87de5236-7aca-463a-a596-5a71c3181fcf","shared_citers":1}],"time_series":[{"n":11,"year":2026}],"dependency_candidates":[{"n":1,"role":"method","polarity":"use_method","paper_title":"InsightFlow: LLM-Driven Synthesis of Patient Narratives for Mental Health into Causal Models","primary_cat":"cs.CL","context_text":"are present), as well as centrality measures (degree [22], betweenness [23], closeness [22] for each node). We averaged these across nodes to compare overall connectedness. We also calculated clustering coefficients (local and global) and counted simple motifs (triangles) [25, 26, 27]. To see how factors were grouped, we ran three community detection algorithms - Leiden [28], Girvan-Newman [29], and Infomap [30], on each graph. We analyzed whether communities contained nodes of the same 5P category or related categories. Finally, we computed","citing_arxiv_id":"2604.12721"}]},"error":null,"updated_at":"2026-06-30T03:29:29.390224+00:00"},"identity_refresh":{"job_type":"identity_refresh","status":"succeeded","result":{"items":[{"title":"Qwen3 Technical Report","outcome":"unchanged","work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e","resolver":"local_arxiv","confidence":0.98,"old_work_id":"25a4e30c-1232-48e7-9925-02fa12ba7c9e"}],"counts":{"fixed":0,"merged":0,"unchanged":1,"quarantined":0,"needs_external_resolution":0},"errors":[],"attempted":1},"error":null,"updated_at":"2026-06-30T03:29:46.763371+00:00"},"role_polarity":{"job_type":"role_polarity","status":"succeeded","result":{"title":"The Structure and Function of Complex Networks","claims":[{"claim_text":"are present), as well as centrality measures (degree [22], betweenness [23], closeness [22] for each node). We averaged these across nodes to compare overall connectedness. We also calculated clustering coefficients (local and global) and counted simple motifs (triangles) [25, 26, 27]. To see how factors were grouped, we ran three community detection algorithms - Leiden [28], Girvan-Newman [29], and Infomap [30], on each graph. We analyzed whether communities contained nodes of the same 5P categ","claim_type":"method","confidence":0.85,"evidence_strength":"citation_context"}],"why_cited":"Pith tracks The Structure and Function of Complex Networks because it crossed a citation-hub threshold. Current citing contexts most often use it as method evidence (1 contexts).","role_counts":[{"n":1,"context_role":"method"}]},"error":null,"updated_at":"2026-06-30T03:29:29.549001+00:00"},"summary_claims":{"job_type":"summary_claims","status":"succeeded","result":{"title":"The Structure and Function of Complex Networks","claims":[{"claim_text":"are present), as well as centrality measures (degree [22], betweenness [23], closeness [22] for each node). We averaged these across nodes to compare overall connectedness. We also calculated clustering coefficients (local and global) and counted simple motifs (triangles) [25, 26, 27]. To see how factors were grouped, we ran three community detection algorithms - Leiden [28], Girvan-Newman [29], and Infomap [30], on each graph. We analyzed whether communities contained nodes of the same 5P categ","claim_type":"method","confidence":0.85,"evidence_strength":"citation_context"}],"why_cited":"Pith tracks The Structure and Function of Complex Networks because it crossed a citation-hub threshold. Current citing contexts most often use it as method evidence (1 contexts).","role_counts":[{"n":1,"context_role":"method"}]},"error":null,"updated_at":"2026-06-30T03:29:29.551279+00:00"}},"summary":{"title":"The Structure and Function of Complex Networks","claims":[{"claim_text":"are present), as well as centrality measures (degree [22], betweenness [23], closeness [22] for each node). We averaged these across nodes to compare overall connectedness. We also calculated clustering coefficients (local and global) and counted simple motifs (triangles) [25, 26, 27]. To see how factors were grouped, we ran three community detection algorithms - Leiden [28], Girvan-Newman [29], and Infomap [30], on each graph. We analyzed whether communities contained nodes of the same 5P categ","claim_type":"method","confidence":0.85,"evidence_strength":"citation_context"}],"why_cited":"Pith tracks The Structure and Function of Complex Networks because it crossed a citation-hub threshold. Current citing contexts most often use it as method evidence (1 contexts).","role_counts":[{"n":1,"context_role":"method"}]},"graph":{"co_cited":[{"title":"Statistical mechanics of complex networks","work_id":"0090d899-71aa-49bb-ad88-6237497a66ce","shared_citers":3},{"title":"10 Almut Demel, Dominik Dürrschnabel, Tamara Mchedlidze, Marcel Radermacher, and Lasse Wulf","work_id":"17e3b0c7-e9c9-45d1-8ce5-e62b689bd132","shared_citers":1},{"title":"1965 , publisher=","work_id":"9dd8dc56-72ae-4608-ae1b-7b62fd01e41a","shared_citers":1},{"title":"1979 , issn =","work_id":"a99c0f55-5258-49b3-a6cd-63385ce86ce8","shared_citers":1},{"title":"1991 , journal =","work_id":"284d4a89-7f86-4457-aad0-65fb56bf73ae","shared_citers":1},{"title":"1993 , publisher=","work_id":"7170148a-15a9-41ab-a06b-bee2b652ffd0","shared_citers":1},{"title":"1998 , publisher=","work_id":"3357c5d6-65b0-497f-acf0-ce874315541f","shared_citers":1},{"title":"2000 , journal =","work_id":"836d11fa-6d70-4807-83bd-89eef8a68762","shared_citers":1},{"title":"2005 , journal =","work_id":"86a0733d-a7bb-4dfa-a122-a69c9e4e5c3a","shared_citers":1},{"title":"2010.194274","work_id":"ddecc9f6-029b-4f75-a3e6-16099399c35c","shared_citers":1},{"title":"2010 , publisher=","work_id":"be2edf46-7e95-4846-8451-1c1d5c353c9d","shared_citers":1},{"title":"2010 , publisher=","work_id":"4cb29216-35f1-4381-b012-b94a9dca26e5","shared_citers":1},{"title":"2014 , journal =","work_id":"72cde755-08d2-4fa2-8d85-323d2c88492e","shared_citers":1},{"title":"2017 , month=","work_id":"7756ede5-652f-45f6-898f-96aa91f6c5a2","shared_citers":1},{"title":"2020 , howpublished =","work_id":"51c571f1-9da3-465b-87b8-2a0fc050c0ea","shared_citers":1},{"title":"2020 , howpublished =","work_id":"8730fbd7-57e1-4448-bd94-f3ac37c8ae64","shared_citers":1},{"title":"2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) , pages =","work_id":"c016149e-231e-40ae-a771-6cdae0f78587","shared_citers":1},{"title":"2020 , issn =","work_id":"68aa02ef-6c1c-4d9c-b225-32fd5b20bb8c","shared_citers":1},{"title":"2023 , url =","work_id":"fba7e464-94b6-4f4c-95c0-f01354cf0450","shared_citers":1},{"title":"2024.doi:10.48550/ARXIV.2406.19108","work_id":"e01d0f6e-1ce0-4bd9-8478-5c59829bca05","shared_citers":1},{"title":"2025 , publisher =","work_id":"29660133-ed4a-4b77-97e6-b9c6482156da","shared_citers":1},{"title":"Acar, Daniel Anderson, Guy E","work_id":"aac71688-ed3e-43d8-9a69-d0b581c830b6","shared_citers":1},{"title":"A definition , author =","work_id":"1d2ef2a8-c3e9-41e8-9c5b-69313233df08","shared_citers":1},{"title":"A generalized convolution model and estimation for non-stationary random functions , volume=","work_id":"87de5236-7aca-463a-a596-5a71c3181fcf","shared_citers":1}],"time_series":[{"n":11,"year":2026}],"dependency_candidates":[{"n":1,"role":"method","polarity":"use_method","paper_title":"InsightFlow: LLM-Driven Synthesis of Patient Narratives for Mental Health into Causal Models","primary_cat":"cs.CL","context_text":"are present), as well as centrality measures (degree [22], betweenness [23], closeness [22] for each node). We averaged these across nodes to compare overall connectedness. We also calculated clustering coefficients (local and global) and counted simple motifs (triangles) [25, 26, 27]. To see how factors were grouped, we ran three community detection algorithms - Leiden [28], Girvan-Newman [29], and Infomap [30], on each graph. We analyzed whether communities contained nodes of the same 5P category or related categories. Finally, we computed","citing_arxiv_id":"2604.12721"}]},"authors":[{"id":"b2514f4f-d98e-42e6-b883-03714e360b6b","orcid":null,"display_name":"M. E. J. Newman","source":"manual","import_confidence":0.72}]}}