{"meta":{"query_hash":"347a799fa0ef","filters":{"venue":"Network Science"},"cohort_total":14,"direct_labels_cover":0,"predictions_cover":14,"exported":14,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/347a799fa0ef","api":"https://metacan.xera.ac/api/v1/cohort?venue=Network+Science"},"results":[{"id":"W2310244163","doi":"10.1017/nws.2016.1","title":"Homophily, influence and the decay of segregation in self-organizing networks","year":2016,"lang":"en","type":"article","venue":"Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Arizona; National Science Foundation","keywords":"Homophily; Vertex (graph theory); Similarity (geometry); Preferential attachment; Computer science; Phenomenon; Network model; Complex network; Theoretical computer science; Mathematics; Artificial intelligence; Combinatorics; Epistemology; Graph; World Wide Web","score_opus":0.003198444830000384,"score_gpt":0.21694753273386544,"score_spread":0.21374908790386504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2310244163","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9451699,0.00027506126,0.051297355,0.0003979518,0.000011037583,0.000016170165,0.000024772093,0.00005797179,0.00274981],"genre_scores_gemma":[0.9983897,0.000046192872,0.001355031,0.000011834812,0.00000505293,0.000005312973,0.0000074997915,0.0000037282318,0.0001756481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958354,0.00019178067,0.000017097007,0.000069288784,0.00008425495,0.000054054617],"domain_scores_gemma":[0.9924205,0.004619373,0.0014802928,0.00052138936,0.0004256828,0.0005327916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013905016,0.00016903803,0.00045431615,0.00084429194,0.00061979523,0.0012294175,0.00057904184,0.0006315374,0.0009470008],"category_scores_gemma":[0.01389568,0.0002138741,0.00028449652,0.00044544705,0.0018557637,0.0017529282,0.00093072525,0.0005583296,0.000118860604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000516557,0.00032217195,0.06432629,0.0002634099,0.00025045653,0.0006722624,0.0018159534,0.54658383,0.022488752,0.31814682,0.002004171,0.04260935],"study_design_scores_gemma":[0.000034138335,0.00010147657,0.011869296,0.00002202821,0.000031805805,0.00013340879,0.00026465702,0.884649,0.0023553215,0.099762544,0.000753206,0.00002311837],"about_ca_topic_score_codex":0.0016836663,"about_ca_topic_score_gemma":0.0011681236,"teacher_disagreement_score":0.0016836663,"about_ca_system_score_codex":0.00085070916,"about_ca_system_score_gemma":0.00031753967,"threshold_uncertainty_score":0.0073537827},"labels":[],"label_agreement":null},{"id":"W2402216016","doi":"10.1017/nws.2017.22","title":"The hourglass effect in hierarchical dependency networks","year":2017,"lang":"en","type":"preprint","venue":"Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University; National Science Foundation","keywords":"Hourglass; Traverse; Dependency (UML); Computer science; Modular design; Set (abstract data type); Vertex (graph theory); Property (philosophy); Distributed computing; Topology (electrical circuits); Theoretical computer science; Mathematics; Artificial intelligence; Graph; Physics","score_opus":0.009963911779965395,"score_gpt":0.30165893104311464,"score_spread":0.2916950192631492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402216016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4400734,0.00044823176,0.5525876,0.00043397193,0.000018242346,0.00006337568,0.00040609064,0.00029105198,0.0056779133],"genre_scores_gemma":[0.96675307,0.000215902,0.031174766,0.0000607793,0.000022758637,0.00005553543,0.0001764051,0.000042677653,0.0014981752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994197,0.00018834107,0.000028256347,0.00018668623,0.00008784882,0.00008929345],"domain_scores_gemma":[0.99157953,0.005244994,0.0013280768,0.0010137545,0.00047054468,0.00036308327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010706327,0.00029852544,0.00041535258,0.0012901243,0.0007816513,0.0010231097,0.00055920624,0.0004956635,0.003100064],"category_scores_gemma":[0.007237422,0.00041055903,0.0005087417,0.0009326898,0.0015189664,0.0027486493,0.0009921725,0.0006080049,0.00013997895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003088451,0.00007654855,0.02764366,0.00031310032,0.00018891768,0.0007947158,0.0012640279,0.38916668,0.0133160725,0.49241588,0.0032515582,0.07126001],"study_design_scores_gemma":[0.000021682088,0.00006285645,0.011496116,0.000042902942,0.00007233913,0.00028006855,0.00025804716,0.68735224,0.004695766,0.29124472,0.004445514,0.000027816808],"about_ca_topic_score_codex":0.005806027,"about_ca_topic_score_gemma":0.005586181,"teacher_disagreement_score":0.005806027,"about_ca_system_score_codex":0.0014194868,"about_ca_system_score_gemma":0.00041314398,"threshold_uncertainty_score":0.011544466},"labels":[],"label_agreement":null},{"id":"W2516965256","doi":"10.1017/nws.2016.13","title":"Evolution through bursts: Network structure develops through localized bursts in time and space","year":2016,"lang":"en","type":"article","venue":"Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Assortativity; Homophily; Network formation; Network dynamics; Computer science; Preferential attachment; Network model; Dynamic network analysis; Kuramoto model; Cluster analysis; Statistical physics; Complex network; Physics; Computer network; Mathematics; Artificial intelligence; Synchronization (alternating current)","score_opus":0.008107822286294569,"score_gpt":0.2518100767904448,"score_spread":0.24370225450415026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2516965256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6135176,0.000942113,0.37701643,0.0011169468,0.000045507866,0.000094117226,0.00052086456,0.0005327966,0.0062137544],"genre_scores_gemma":[0.9813192,0.00050497666,0.016177434,0.000084075895,0.000038909886,0.000088898785,0.00018352589,0.00005238095,0.0015506109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992725,0.0002120125,0.000038810213,0.00028037958,0.000120508004,0.00007565452],"domain_scores_gemma":[0.9932535,0.0038019815,0.001568547,0.0007691354,0.0003208301,0.00028598506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001423134,0.00033851262,0.0004792826,0.0017082982,0.00051766116,0.0020172324,0.00087167503,0.0009384767,0.001737318],"category_scores_gemma":[0.011880155,0.000501906,0.00048705447,0.0014777678,0.0016343124,0.005019497,0.0013476541,0.0010145245,0.00031036185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029437718,0.00015926275,0.13375337,0.00044344921,0.00029802992,0.00128193,0.006791136,0.34122065,0.019803926,0.39850533,0.0037353388,0.093713164],"study_design_scores_gemma":[0.000024107689,0.0000983566,0.043623883,0.000084735344,0.00007162792,0.0005721998,0.0011592469,0.65373963,0.0022984587,0.29291868,0.0053408314,0.00006817838],"about_ca_topic_score_codex":0.0023713615,"about_ca_topic_score_gemma":0.0017208306,"teacher_disagreement_score":0.0023713615,"about_ca_system_score_codex":0.0011629493,"about_ca_system_score_gemma":0.0003651938,"threshold_uncertainty_score":0.008437812},"labels":[],"label_agreement":null},{"id":"W2792828486","doi":"10.1017/nws.2017.19","title":"Temporal evolution of the degree distribution of alters in growing networks","year":2018,"lang":"en","type":"article","venue":"Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; James S. McDonnell Foundation","keywords":"Observability; Degree distribution; Preferential attachment; Computer science; Degree (music); Statistical physics; Network topology; Complex network; Synchronization (alternating current); Network dynamics; Evolving networks; Random graph; Interdependent networks; Theoretical computer science; Mathematics; Applied mathematics; Physics; Graph; Discrete mathematics","score_opus":0.017431105289494254,"score_gpt":0.2574856976997779,"score_spread":0.24005459241028365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792828486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8895551,0.00018187113,0.10492511,0.00041271248,0.000022332983,0.000022439322,0.00018508613,0.00009852299,0.0045968024],"genre_scores_gemma":[0.9945779,0.00008546765,0.0042852284,0.000015916869,0.000006206449,0.0000118944745,0.000046726454,0.000011760408,0.0009589155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978405,0.00006152116,0.000008969088,0.00005691639,0.00005191858,0.000036652957],"domain_scores_gemma":[0.99609804,0.0024323899,0.0006461532,0.00024155171,0.0003901908,0.00019161946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008046466,0.0001377711,0.00020647088,0.000961386,0.00045484977,0.0007500476,0.0006027047,0.0004624376,0.0017680186],"category_scores_gemma":[0.008373704,0.0001788125,0.00024995883,0.0005606849,0.00091069576,0.0012447455,0.00056477106,0.00049500837,0.00015109553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000142663,0.00007045782,0.031603713,0.00013113974,0.00005775502,0.0008569117,0.0010343334,0.5922946,0.025097625,0.32371464,0.001572488,0.023423746],"study_design_scores_gemma":[0.0000061217097,0.00002366378,0.00737639,0.000012410485,0.000013471365,0.00023022207,0.00024123707,0.94478285,0.0031105278,0.043291923,0.00088972726,0.000021370046],"about_ca_topic_score_codex":0.002872106,"about_ca_topic_score_gemma":0.0024881149,"teacher_disagreement_score":0.002872106,"about_ca_system_score_codex":0.0007857049,"about_ca_system_score_gemma":0.00031915278,"threshold_uncertainty_score":0.0059146285},"labels":[],"label_agreement":null},{"id":"W2978645537","doi":"10.1017/nws.2019.8","title":"Noting the ties after tying the knot: Photo-based elicitation of retrospective personal network data","year":2019,"lang":"en","type":"article","venue":"Network Science","topic":"Social Capital and Networks","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Tying; Respondent; Knot tying; Data collection; Computer science; Personal network; Knot (papermaking); Psychology; Data science; Artificial intelligence; Statistics; Mathematics; Medicine; Engineering","score_opus":0.02740876028085889,"score_gpt":0.3002532802814959,"score_spread":0.272844520000637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978645537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89541495,0.00022261284,0.07074484,0.0010000879,0.000112855174,0.00262855,0.0034704236,0.0001478356,0.026257839],"genre_scores_gemma":[0.9295355,0.00031611402,0.0584272,0.00033691057,0.000053473083,0.0034060753,0.0013696781,0.00004067668,0.006514228],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.99430895,0.0043447185,0.00015984592,0.0003930434,0.0005836199,0.00020976413],"domain_scores_gemma":[0.97004145,0.01920441,0.0036578039,0.003936545,0.0027152176,0.00044454166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005756703,0.0002863453,0.00018163201,0.0016412007,0.0015910137,0.0009231468,0.000767823,0.0007211575,0.004089905],"category_scores_gemma":[0.022394614,0.0002473701,0.00013351151,0.0013100547,0.0007203371,0.0012075497,0.0015661393,0.00074110494,0.0011083748],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010381344,0.0009958157,0.21996203,0.0018040047,0.00010667411,0.0021686738,0.27919188,0.0031431029,0.08268788,0.0098231435,0.019097727,0.37998092],"study_design_scores_gemma":[0.00008207133,0.0012510023,0.41384727,0.0010817632,0.00010561066,0.0014723283,0.34096098,0.012147697,0.06538339,0.01209801,0.15132406,0.00024574017],"about_ca_topic_score_codex":0.00222587,"about_ca_topic_score_gemma":0.009887522,"teacher_disagreement_score":0.005756703,"about_ca_system_score_codex":0.00061596424,"about_ca_system_score_gemma":0.000677598,"threshold_uncertainty_score":0.030444741},"labels":[],"label_agreement":null},{"id":"W2984649464","doi":"10.1017/nws.2019.28","title":"The networked question in the digital era: How do networked, bounded, and limited individuals connect at different stages in the life course?","year":2019,"lang":"en","type":"article","venue":"Network Science","topic":"Impact of Technology on Adolescents","field":"Social Sciences","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Western University","funders":"","keywords":"Individualism; Digital media; Wonder; Social media; Bounded function; Internet privacy; Face (sociological concept); Set (abstract data type); Life course approach; Population; Psychology; Social psychology; Sociology; Computer science; World Wide Web; Political science; Mathematics; Demography; Social science","score_opus":0.013209948970897998,"score_gpt":0.28416302776144386,"score_spread":0.27095307879054586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984649464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99223936,0.00042335351,0.00020911661,0.0013208991,0.000013750432,0.000022261653,0.000045337903,0.0000014539473,0.0057244864],"genre_scores_gemma":[0.99894065,0.00022087622,0.00008461355,0.0001533434,0.0000036600577,0.00001565577,0.00001744182,0.0000015002437,0.0005621846],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99802375,0.0011661259,0.00005904878,0.00018433791,0.00019518989,0.00037154029],"domain_scores_gemma":[0.99507517,0.0022080252,0.0008613007,0.00014269866,0.00056154566,0.0011512449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042373617,0.00016341281,0.00031035475,0.0012926833,0.003808827,0.0041154427,0.00075332157,0.0008218278,0.0024118526],"category_scores_gemma":[0.008460735,0.00020214198,0.0001721574,0.0012446874,0.007873529,0.0056870235,0.0036266877,0.0014174823,0.0001432536],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027758675,0.00003594131,0.0886223,0.000049269893,0.000009120891,0.0001866679,0.9017672,0.0000405326,0.00019623729,0.003851502,0.00037962134,0.004833836],"study_design_scores_gemma":[0.0000026759205,0.0000151704635,0.041869894,0.000066565495,0.0000044311764,0.00004926512,0.9535815,0.000055021934,0.00005387637,0.0006375569,0.0036572362,0.000006786178],"about_ca_topic_score_codex":0.12324816,"about_ca_topic_score_gemma":0.19376774,"teacher_disagreement_score":0.12324816,"about_ca_system_score_codex":0.005932042,"about_ca_system_score_gemma":0.002726206,"threshold_uncertainty_score":0.24506158},"labels":[],"label_agreement":null},{"id":"W3004293141","doi":"10.1017/nws.2020.45","title":"Artificial Benchmark for Community Detection (ABCD)—Fast random graph model with community structure","year":2021,"lang":"en","type":"article","venue":"Network Science","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Community structure; Benchmark (surveying); Random graph; Scalability; Graph; Theoretical computer science; Artificial intelligence; Complex network; Degree distribution; Algorithm; Machine learning; Mathematics","score_opus":0.020289072426919665,"score_gpt":0.2689334541712341,"score_spread":0.24864438174431444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004293141","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49262208,0.0024795914,0.4795149,0.0040907934,0.00046994304,0.00042017814,0.0061561014,0.0024184554,0.011827873],"genre_scores_gemma":[0.8600265,0.00033557156,0.13254595,0.00039646038,0.00007858099,0.00024144613,0.0043394514,0.00015660368,0.0018794611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981364,0.0010179183,0.000049505517,0.00037493827,0.00029379188,0.00012749323],"domain_scores_gemma":[0.9885925,0.0074896934,0.0007906193,0.0013267495,0.0013752228,0.00042520245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027894366,0.00071182474,0.0008327164,0.0018732803,0.00083848706,0.0010014123,0.0019305199,0.001968822,0.0017516252],"category_scores_gemma":[0.01468115,0.00027208275,0.00087707205,0.0014948295,0.0010050117,0.001614365,0.00092063204,0.0013883528,0.00033250407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002663773,0.00024380063,0.005664933,0.0003320264,0.00010486595,0.0002582817,0.000105457955,0.8955695,0.0023486821,0.04972765,0.015328568,0.030049898],"study_design_scores_gemma":[0.000026589283,0.000034535824,0.0004215723,0.0000097183665,0.0000058482924,0.00006739505,0.000016674652,0.9827718,0.0006941153,0.014838094,0.0011051059,0.0000085638585],"about_ca_topic_score_codex":0.006416522,"about_ca_topic_score_gemma":0.005001914,"teacher_disagreement_score":0.006416522,"about_ca_system_score_codex":0.0015222933,"about_ca_system_score_gemma":0.0007623462,"threshold_uncertainty_score":0.01475215},"labels":[],"label_agreement":null},{"id":"W3134772369","doi":"10.1017/nws.2020.48","title":"Functional disability and the role of children in U.S. older adults’ core discussion networks","year":2021,"lang":"en","type":"article","venue":"Network Science","topic":"Intergenerational Family Dynamics and Caregiving","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Construct (python library); Psychology; Core (optical fiber); Embeddedness; Developmental psychology; Gee; Perspective (graphical); Gerontology; Medicine; Sociology; Generalized estimating equation","score_opus":0.005407935555924417,"score_gpt":0.23657153526029065,"score_spread":0.23116359970436623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134772369","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9981337,0.00015608825,0.00007346907,0.00014847869,0.0000033190684,0.0000068516133,0.00014204667,0.000001819945,0.0013342492],"genre_scores_gemma":[0.999595,0.00008059146,0.000058963888,0.000017482931,0.0000027572887,0.0000050533636,0.00007013503,6.62536e-7,0.00016949007],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99941444,0.00025101443,0.000043629872,0.00009198084,0.00007491051,0.00012404578],"domain_scores_gemma":[0.99541265,0.0012302087,0.0021225838,0.0001518486,0.00030399693,0.000778646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014419091,0.00022559287,0.00017605703,0.0010432622,0.0010732358,0.001119003,0.0003985051,0.00034062512,0.0030155785],"category_scores_gemma":[0.007881276,0.00012174628,0.00013671124,0.00064323976,0.00061394775,0.0014623856,0.0016962278,0.0005507452,0.000097829616],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052414845,0.00006395421,0.96562105,0.000026849302,0.000023442914,0.00012415856,0.024371022,0.00011049391,0.00017199841,0.00070651184,0.0003616576,0.008366393],"study_design_scores_gemma":[0.0000039590273,0.000055282515,0.9652383,0.00004884852,0.00001535462,0.0002509185,0.030943047,0.0003098622,0.00009555643,0.00046605896,0.002561774,0.000011110028],"about_ca_topic_score_codex":0.016767824,"about_ca_topic_score_gemma":0.03183213,"teacher_disagreement_score":0.016767824,"about_ca_system_score_codex":0.0012107412,"about_ca_system_score_gemma":0.00054308,"threshold_uncertainty_score":0.033340454},"labels":[],"label_agreement":null},{"id":"W3157446178","doi":"10.1017/nws.2021.4","title":"A fused mixed-methods approach to thematic analysis of personal networks: Two case studies of caregiver support networks","year":2021,"lang":"en","type":"article","venue":"Network Science","topic":"Community Health and Development","field":"Health Professions","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Trillium Health Centre","funders":"University of Rochester","keywords":"Computer science; Thematic analysis; Typology; Cluster analysis; Coding (social sciences); Artificial intelligence; Data science; Qualitative research; Human–computer interaction; Mathematics; Sociology","score_opus":0.13148311854481365,"score_gpt":0.515090289661629,"score_spread":0.3836071711168153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157446178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88596153,0.0011448814,0.08625498,0.0035444694,0.00010769637,0.0023173504,0.0002998415,0.000046209723,0.020322932],"genre_scores_gemma":[0.9436758,0.00072767766,0.05098307,0.00018149224,0.000021124431,0.0015993557,0.00009100165,0.000029793464,0.002690635],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.97568434,0.021168182,0.00048674492,0.0005873431,0.0012436338,0.0008298256],"domain_scores_gemma":[0.95739806,0.036162708,0.0016154334,0.0016629015,0.0023359836,0.00082492764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.029137325,0.00066147296,0.0006107756,0.0047902246,0.011862507,0.0046430156,0.0029510274,0.0025720287,0.0025831664],"category_scores_gemma":[0.03101923,0.0006687817,0.00060972496,0.0049927076,0.0065480964,0.0056673065,0.0065834476,0.0020627808,0.00023890065],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014905698,0.0003063352,0.013859827,0.00056256494,0.00003596345,0.0069361846,0.9016965,0.0020647978,0.0009227758,0.037405636,0.0015944919,0.034465767],"study_design_scores_gemma":[0.000047277645,0.00014008906,0.0065995916,0.00068653893,0.00003478404,0.0021760166,0.94132304,0.007132043,0.0022035602,0.018339194,0.021261906,0.000055952234],"about_ca_topic_score_codex":0.013760785,"about_ca_topic_score_gemma":0.034445632,"teacher_disagreement_score":0.029137325,"about_ca_system_score_codex":0.008105296,"about_ca_system_score_gemma":0.0041443477,"threshold_uncertainty_score":0.15409476},"labels":[],"label_agreement":null},{"id":"W3208496800","doi":"10.1017/nws.2021.18","title":"Measuring reciprocity: Double sampling, concordance, and network construction","year":2021,"lang":"en","type":"article","venue":"Network Science","topic":"Social Capital and Networks","field":"Social Sciences","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; Max-Planck-Institut für Evolutionäre Anthropologie; National Science Foundation","keywords":"Reciprocity (cultural anthropology); Concordance; Interpersonal ties; Social psychology; Exponential random graph models; Psychology; Computer science; Graph; Theoretical computer science; Random graph","score_opus":0.06435775719973422,"score_gpt":0.30856005783608176,"score_spread":0.24420230063634754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208496800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6359627,0.0005565322,0.35489565,0.0008313503,0.00010256699,0.0009147208,0.0005797722,0.00015186273,0.0060048103],"genre_scores_gemma":[0.93690103,0.00008501894,0.061831586,0.00007846644,0.000044333665,0.00046879568,0.00033042626,0.000022703638,0.0002377086],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.7946937,0.16727734,0.008246368,0.011585318,0.016686037,0.0015112321],"domain_scores_gemma":[0.47090936,0.3904875,0.053453904,0.06579963,0.01750776,0.0018419058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.111961395,0.0005607666,0.0013905327,0.0054681282,0.0022708175,0.0039729867,0.0028709373,0.0014889353,0.0009873501],"category_scores_gemma":[0.40220124,0.00081256096,0.0010810008,0.006534041,0.005546481,0.0044065365,0.0066589066,0.0022298703,0.00018043684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049187365,0.00026838656,0.7975398,0.0008847495,0.0012485974,0.00047854704,0.022325387,0.016488994,0.0021284856,0.057015717,0.0015019148,0.09962755],"study_design_scores_gemma":[0.00009671729,0.00083443575,0.47093973,0.00078436965,0.0007165532,0.0018683862,0.013172202,0.24318774,0.008534568,0.25029558,0.009276076,0.0002935963],"about_ca_topic_score_codex":0.0032813046,"about_ca_topic_score_gemma":0.0035281195,"teacher_disagreement_score":0.111961395,"about_ca_system_score_codex":0.002292701,"about_ca_system_score_gemma":0.0012352954,"threshold_uncertainty_score":0.5921155},"labels":[],"label_agreement":null},{"id":"W3217035451","doi":"10.1017/nws.2022.27","title":"A multi-purposed unsupervised framework for comparing embeddings of undirected and directed graphs","year":2022,"lang":"en","type":"article","venue":"Network Science","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Embedding; Computer science; Scalability; Theoretical computer science; Graph embedding; Graph; Node (physics); Topological graph theory; Set (abstract data type); Representation (politics); Undirected graph; Artificial intelligence; Line graph; Voltage graph","score_opus":0.028061766804376314,"score_gpt":0.283082251646283,"score_spread":0.25502048484190665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217035451","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024857529,0.00024401216,0.97267073,0.00011660954,0.00003087662,0.00010000458,0.0002723025,0.0009384564,0.0007695165],"genre_scores_gemma":[0.4798542,0.00017401978,0.5160235,0.00013308995,0.00008704363,0.00029862564,0.001719969,0.0003695607,0.0013400085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961655,0.0015346804,0.00023744107,0.001094703,0.0007515275,0.00021614514],"domain_scores_gemma":[0.9931075,0.0027140232,0.0012065144,0.0010350716,0.0015804796,0.00035647358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004516106,0.0014327884,0.0012697714,0.0077186725,0.00076422095,0.0025845142,0.0027626809,0.001975305,0.0012760741],"category_scores_gemma":[0.014091251,0.0005870389,0.0011628269,0.0036182886,0.0017095137,0.003863712,0.0030223024,0.0018121506,0.0004062821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006173609,0.0005033527,0.012338803,0.00038183187,0.0005695388,0.0002829428,0.00040599107,0.5079826,0.017248472,0.050966416,0.0064516896,0.40225103],"study_design_scores_gemma":[0.000012005899,0.00006859069,0.0010920358,0.0000213027,0.00002246028,0.00006497779,0.00004528063,0.97332656,0.0018879846,0.02263247,0.000802742,0.000023630997],"about_ca_topic_score_codex":0.0028666542,"about_ca_topic_score_gemma":0.00546873,"teacher_disagreement_score":0.0077186725,"about_ca_system_score_codex":0.0016687901,"about_ca_system_score_gemma":0.0009497775,"threshold_uncertainty_score":0.02388376},"labels":[],"label_agreement":null},{"id":"W4379512678","doi":"10.1017/nws.2023.11","title":"Exact recovery of Granger causality graphs with unconditional pairwise tests","year":2023,"lang":"en","type":"article","venue":"Network Science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pairwise comparison; Granger causality; Causality (physics); Heuristics; Heuristic; Mathematics; Graph; Computer science; Theoretical computer science; Mathematical optimization; Artificial intelligence; Econometrics","score_opus":0.010503109158524485,"score_gpt":0.24564266366614398,"score_spread":0.2351395545076195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379512678","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05602188,0.00011527778,0.9418737,0.0003168007,0.000024034833,0.000052519335,0.00014483901,0.0006186169,0.00083229475],"genre_scores_gemma":[0.7640991,0.000088592744,0.23404442,0.00015522259,0.00004432124,0.00011005187,0.00047943924,0.00015413409,0.00082462427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979631,0.0012345688,0.0000653061,0.0003585039,0.00023546265,0.00014306504],"domain_scores_gemma":[0.9697371,0.025267763,0.0015278795,0.0021595063,0.0008784239,0.00042926046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004264839,0.000852875,0.0010301322,0.0012220454,0.0006689714,0.00097032444,0.0014389243,0.0010279357,0.0028863791],"category_scores_gemma":[0.04024021,0.00044816927,0.0006783883,0.00095783133,0.0016935968,0.0023056166,0.0017497845,0.0020419853,0.0004461558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046328694,0.00017094715,0.0052375845,0.00016341991,0.00011424073,0.00024241475,0.00015349552,0.84414864,0.0034247146,0.049994793,0.0019682467,0.093918204],"study_design_scores_gemma":[0.00002095838,0.00004488719,0.00037861345,0.000007995985,0.0000065169584,0.00003325781,0.000028313289,0.95139366,0.00097034965,0.046894222,0.00021241896,0.0000088333345],"about_ca_topic_score_codex":0.002011141,"about_ca_topic_score_gemma":0.0023155878,"teacher_disagreement_score":0.004264839,"about_ca_system_score_codex":0.00063752354,"about_ca_system_score_gemma":0.0011762567,"threshold_uncertainty_score":0.022554934},"labels":[],"label_agreement":null},{"id":"W4394576516","doi":"10.1017/nws.2024.3","title":"Generating preferential attachment graphs via a Pólya urn with expanding colors","year":2024,"lang":"en","type":"article","venue":"Network Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Computer science","score_opus":0.02093150770126085,"score_gpt":0.31378465379297715,"score_spread":0.2928531460917163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394576516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08601817,0.00016209723,0.9086002,0.00044855574,0.00008369824,0.00013080759,0.00018397214,0.000316235,0.00405623],"genre_scores_gemma":[0.7814117,0.0002830829,0.20688145,0.00021128092,0.0000634003,0.00039714738,0.00025343098,0.00013553648,0.010362966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821585,0.00097179547,0.000047741953,0.00037874287,0.00023881134,0.00014709121],"domain_scores_gemma":[0.99328196,0.0043132124,0.000567308,0.0008427827,0.0005940307,0.0004007213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027570953,0.00061501213,0.0010133532,0.0012800839,0.0010530464,0.0016858694,0.0026200449,0.0016904451,0.0054321294],"category_scores_gemma":[0.0113733215,0.000731381,0.0010849909,0.0013248193,0.0018191646,0.0024392444,0.002031571,0.0019205046,0.0008277521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015461346,0.00011486018,0.0024873384,0.000071907554,0.000054608056,0.00030378127,0.00033341025,0.65895414,0.003085997,0.30902985,0.0022077733,0.023201775],"study_design_scores_gemma":[0.000016494108,0.000019542143,0.0001591779,0.000006372116,0.000008066986,0.00003471833,0.00001842945,0.95960295,0.00029019918,0.038995612,0.0008376276,0.000010878666],"about_ca_topic_score_codex":0.0050105127,"about_ca_topic_score_gemma":0.005373149,"teacher_disagreement_score":0.0054321294,"about_ca_system_score_codex":0.0016301281,"about_ca_system_score_gemma":0.0008269122,"threshold_uncertainty_score":0.018172264},"labels":[],"label_agreement":null},{"id":"W4411500587","doi":"10.1017/nws.2025.6","title":"Accounting for edge uncertainty in stochastic actor-oriented models for dynamic network analysis","year":2025,"lang":"en","type":"article","venue":"Network Science","topic":"Functional Brain Connectivity Studies","field":"Neuroscience","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Institute of Biomedical Imaging and Bioengineering; National Institute of Neurological Disorders and Stroke; National Institute of General Medical Sciences; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health","keywords":"Computer science; Markov chain; Hidden Markov model; Expectation–maximization algorithm; Algorithm; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Theoretical computer science; Machine learning; Mathematics; Maximum likelihood; Statistics","score_opus":0.0264256621298199,"score_gpt":0.30061781989457526,"score_spread":0.27419215776475536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411500587","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008447794,0.00011805977,0.9906632,0.00018846763,0.00002337337,0.000018027828,0.000054750104,0.00008195312,0.00040435087],"genre_scores_gemma":[0.77021015,0.000813611,0.22314788,0.00028661976,0.0001881447,0.0004173975,0.00043247078,0.0001816209,0.00432216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830127,0.0009785893,0.00007606358,0.0003114413,0.00020783793,0.00012484228],"domain_scores_gemma":[0.9874839,0.010616972,0.0007954274,0.0005059356,0.00037402922,0.00022379964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004976342,0.0012232093,0.0015306327,0.0014364772,0.0007723498,0.0016043374,0.0024038693,0.0020865987,0.0015345432],"category_scores_gemma":[0.018701805,0.0013429584,0.0013815226,0.0014089128,0.0020767674,0.0031001875,0.0020590443,0.0024348465,0.00025068055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018547875,0.000009781215,0.00050823484,0.000019339526,0.000027420192,0.00004156384,0.000044572862,0.958632,0.00015620717,0.03666938,0.0001792426,0.0036937655],"study_design_scores_gemma":[0.0000020131151,0.0000031750499,0.00005324314,0.0000030512963,0.0000031247432,0.0000050742324,0.0000033236304,0.97758013,0.000034763896,0.022191163,0.00011714938,0.000003849336],"about_ca_topic_score_codex":0.009632556,"about_ca_topic_score_gemma":0.010924414,"teacher_disagreement_score":0.009632556,"about_ca_system_score_codex":0.0016225985,"about_ca_system_score_gemma":0.0011997112,"threshold_uncertainty_score":0.026317775},"labels":[],"label_agreement":null}]}