{"meta":{"query_hash":"f728de9c9977","filters":{"venue":"Internet Mathematics"},"cohort_total":11,"direct_labels_cover":0,"predictions_cover":11,"exported":11,"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/f728de9c9977","api":"https://metacan.xera.ac/api/v1/cohort?venue=Internet+Mathematics"},"results":[{"id":"W1497626542","doi":"10.1080/15427951.2015.1103339","title":"How to Burn a Graph","year":2015,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":85,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Iterated function; Graph; Combinatorics; Transitive relation; Discrete mathematics; Line graph","score_opus":0.03516612690738674,"score_gpt":0.28078952342868885,"score_spread":0.2456233965213021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497626542","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.08894153,0.003356367,0.78670263,0.01668157,0.0019397255,0.00023611328,0.0011791757,0.0015694111,0.09939342],"genre_scores_gemma":[0.5852064,0.0040984834,0.36000788,0.003185365,0.000738334,0.00034191585,0.001760706,0.0015857472,0.043075114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896944,0.0003002204,0.000055801273,0.0002924765,0.00027120224,0.0001109106],"domain_scores_gemma":[0.9951201,0.0023795122,0.00029694376,0.0011555825,0.0006661823,0.00038160416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012440473,0.0004556984,0.0005273278,0.0010836043,0.0014561178,0.0029581813,0.0012378402,0.0018931491,0.016189719],"category_scores_gemma":[0.01198209,0.00043078847,0.00070354895,0.0010096484,0.0024802904,0.0076667923,0.001616566,0.0020922548,0.0028267752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000065998385,0.000046435445,0.0010921794,0.00023477005,0.000038717724,0.00014035281,0.0003324482,0.026086882,0.003168959,0.86112463,0.021479161,0.0861895],"study_design_scores_gemma":[0.000014403692,0.000029254405,0.00029754243,0.0000917092,0.000017256792,0.00024748972,0.0002703745,0.05424306,0.0016716976,0.90354496,0.039547388,0.000024802097],"about_ca_topic_score_codex":0.002148984,"about_ca_topic_score_gemma":0.002200538,"teacher_disagreement_score":0.016189719,"about_ca_system_score_codex":0.0008310383,"about_ca_system_score_gemma":0.00083064317,"threshold_uncertainty_score":0.05416},"labels":[],"label_agreement":null},{"id":"W2031620091","doi":"10.1080/15427951.2014.977407","title":"Finding Safe Strategies for Competitive Diffusion on Trees","year":2014,"lang":"en","type":"article","venue":"Internet Mathematics","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Tree (set theory); Game tree; Diffusion; Game theory; Mathematical optimization; Mathematical economics; Sequential game; Combinatorics","score_opus":0.021641919489689024,"score_gpt":0.2895912902731283,"score_spread":0.2679493707834393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031620091","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.1561238,0.00024749816,0.8365696,0.00041983457,0.00002323712,0.00014896007,0.00008237002,0.00014289001,0.006241849],"genre_scores_gemma":[0.7903339,0.00032686928,0.20544901,0.00017580367,0.000033338692,0.00022864398,0.00021332703,0.000102312195,0.003136771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998882,0.00054263737,0.000052154875,0.00016148023,0.00021966359,0.0001419773],"domain_scores_gemma":[0.9866138,0.01131169,0.0005922053,0.00039809835,0.00052642304,0.00055775285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017278132,0.00088569726,0.0011216224,0.0013659501,0.0010406942,0.0017664488,0.0011911641,0.0014889905,0.0026416958],"category_scores_gemma":[0.015003737,0.0004996746,0.00093634124,0.0008839993,0.0017098514,0.0024543644,0.0017256539,0.0015897637,0.00039561384],"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.00020391078,0.00018568712,0.0023297395,0.00019012285,0.000110662084,0.00025019865,0.0006410457,0.58712035,0.0055322843,0.35906163,0.0022536388,0.042120848],"study_design_scores_gemma":[0.000028247545,0.0000515666,0.00014853044,0.000012075722,0.000012303856,0.00005374109,0.0000795579,0.76132786,0.00080982497,0.23665495,0.00080997136,0.000011339634],"about_ca_topic_score_codex":0.002047243,"about_ca_topic_score_gemma":0.0020621566,"teacher_disagreement_score":0.0026416958,"about_ca_system_score_codex":0.0010712846,"about_ca_system_score_gemma":0.0010609147,"threshold_uncertainty_score":0.00913769},"labels":[],"label_agreement":null},{"id":"W2034244548","doi":"10.1080/15427951.2007.10129135","title":"Growing Protean Graphs","year":2007,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":18,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Hyperlink; Mathematics; Vertex (graph theory); Random graph; Topological graph; Graph; Web page; Degree distribution; Discrete mathematics; Theoretical computer science; Combinatorics; Computer science; Complex network; World Wide Web","score_opus":0.013733698708369255,"score_gpt":0.2752517246273588,"score_spread":0.26151802591898954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034244548","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.39065215,0.0012062859,0.5570294,0.0021039497,0.00013446798,0.00015038946,0.00066884747,0.0008478508,0.0472066],"genre_scores_gemma":[0.94356424,0.000699784,0.038138166,0.00034122707,0.00012462768,0.00015388658,0.00050595077,0.000107549466,0.016364591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994522,0.00013963737,0.000015615195,0.00015743497,0.0001602892,0.00007494621],"domain_scores_gemma":[0.9978417,0.0009470946,0.00041012792,0.00026261355,0.00028520028,0.00025319253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050444534,0.0003550292,0.000495288,0.001983287,0.0012420565,0.0013579974,0.0008932116,0.0010681734,0.0032143309],"category_scores_gemma":[0.0049205814,0.00047897614,0.0004891591,0.0010261866,0.0011969877,0.002454904,0.0011801949,0.0008981246,0.0005572261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000038123355,0.000029489041,0.0019801115,0.00007685758,0.000036674937,0.0005475439,0.00043541705,0.047005765,0.0039516096,0.92330587,0.004592456,0.018000022],"study_design_scores_gemma":[0.000014216787,0.00002262237,0.0020457325,0.000021326872,0.000017881726,0.0008546371,0.0001406323,0.28880903,0.0009758103,0.6920618,0.015011196,0.000025146695],"about_ca_topic_score_codex":0.0027838158,"about_ca_topic_score_gemma":0.0035933855,"teacher_disagreement_score":0.0032143309,"about_ca_system_score_codex":0.00093714043,"about_ca_system_score_gemma":0.00041215168,"threshold_uncertainty_score":0.010752976},"labels":[],"label_agreement":null},{"id":"W2036362885","doi":"10.1080/15427951.2012.625246","title":"Geometric Protean Graphs","year":2012,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Dimension (graph theory); Link (geometry); Property (philosophy); Ranking (information retrieval); Euclidean space; Space (punctuation); Theoretical computer science; Function (biology); Euclidean geometry; Computer science; Artificial intelligence; Combinatorics","score_opus":0.02043266424877522,"score_gpt":0.2723019065488521,"score_spread":0.2518692423000769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036362885","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.20278841,0.00090961845,0.77024883,0.0023063363,0.0000865961,0.00011589474,0.0007490156,0.00046109175,0.02233429],"genre_scores_gemma":[0.92740774,0.0010240381,0.06157838,0.0004527807,0.00022713568,0.0001847354,0.00091672176,0.00012165758,0.008086818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893683,0.000408974,0.000029480845,0.00026746085,0.00024855696,0.00010869704],"domain_scores_gemma":[0.99568886,0.0018097017,0.0012235926,0.0005449166,0.00038899895,0.00034389592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092582894,0.0007448789,0.0006998138,0.0035357368,0.0018638099,0.0016902761,0.0014412339,0.0012678952,0.0037646752],"category_scores_gemma":[0.007344592,0.0005397466,0.000788678,0.0025895638,0.0024071443,0.0046165,0.0019853634,0.001359814,0.0006196951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000017484348,0.000025510495,0.002332542,0.00004540734,0.000033542507,0.00016733502,0.00029392028,0.071838364,0.00056505227,0.911481,0.0025736226,0.010626156],"study_design_scores_gemma":[0.000007592218,0.000018801102,0.0010405319,0.000016298985,0.000011245725,0.0002315231,0.00011636817,0.2731341,0.00024428632,0.7170782,0.008084369,0.000016771348],"about_ca_topic_score_codex":0.0037907476,"about_ca_topic_score_gemma":0.0037643318,"teacher_disagreement_score":0.0037907476,"about_ca_system_score_codex":0.0017822694,"about_ca_system_score_gemma":0.00061267137,"threshold_uncertainty_score":0.012931347},"labels":[],"label_agreement":null},{"id":"W2044028731","doi":"10.1080/15427951.2012.671149","title":"Model Selection for Social Networks Using Graphlets","year":2012,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Property (philosophy); Selection (genetic algorithm); Model selection; Machine learning; Artificial intelligence; Computer science; Mathematics; Tree (set theory); Data mining; Theoretical computer science","score_opus":0.07055483639277808,"score_gpt":0.3336439917856682,"score_spread":0.26308915539289013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044028731","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.025258081,0.00013268295,0.9728684,0.00034163997,0.000029342807,0.0000734798,0.00019390759,0.0005943242,0.0005081894],"genre_scores_gemma":[0.62905395,0.00033311566,0.36517367,0.00027880294,0.00015714839,0.0005794599,0.0016966331,0.000269131,0.0024581216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998489,0.00097245496,0.000045244346,0.00023744963,0.00016747873,0.000088386994],"domain_scores_gemma":[0.9898233,0.008519899,0.00053770904,0.00043562517,0.00049091823,0.00019262843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040291566,0.0012267078,0.0014189774,0.002764718,0.0008565554,0.0011880214,0.0017490974,0.001572692,0.0018619479],"category_scores_gemma":[0.011366701,0.00088116486,0.0015773681,0.0014009258,0.0009120618,0.0017667548,0.0011615116,0.0020835735,0.00079149194],"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.00007262803,0.00008007816,0.001656658,0.000036359943,0.00007596949,0.000087223554,0.00006649269,0.9554262,0.00043729244,0.010401465,0.0015517474,0.0301078],"study_design_scores_gemma":[0.000004507025,0.0000058416026,0.00004468858,0.0000013833101,0.0000021979693,0.000005215601,0.000002509475,0.9952453,0.00005827406,0.0045493697,0.000079135956,0.0000015801634],"about_ca_topic_score_codex":0.0037621881,"about_ca_topic_score_gemma":0.0044301967,"teacher_disagreement_score":0.0040291566,"about_ca_system_score_codex":0.0011503285,"about_ca_system_score_gemma":0.0008900588,"threshold_uncertainty_score":0.021308482},"labels":[],"label_agreement":null},{"id":"W2059883798","doi":"10.1080/15427951.2011.604289","title":"NAViGaTOR: Large Scalable and Interactive Navigation and Analysis of Large Graphs","year":2011,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Ontario Institute for Cancer Research","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institutes of Health Research","keywords":"Visualization; Computer science; Workflow; Graph drawing; Scalability; Graphical user interface; Data visualization; Graph Layout; Variety (cybernetics); Memory footprint; Interactive visualization; Data mining; Database; Programming language; Artificial intelligence","score_opus":0.014881715529797473,"score_gpt":0.2781225979841873,"score_spread":0.2632408824543898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059883798","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.003945486,0.00035367528,0.5874398,0.0003897967,0.00012339577,0.00030962998,0.01309223,0.38735855,0.0069876043],"genre_scores_gemma":[0.052329082,0.0011050346,0.8347969,0.00036129294,0.00012101614,0.0012745546,0.047582448,0.04992778,0.012501852],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988581,0.00024086863,0.00007378024,0.00021158431,0.0005284069,0.000087135726],"domain_scores_gemma":[0.9970367,0.0014380594,0.00013724125,0.0006840716,0.00042624894,0.00027773934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002076559,0.0022091349,0.001093205,0.003634999,0.00086812535,0.0024158543,0.0032356586,0.0009901498,0.037318338],"category_scores_gemma":[0.0071406523,0.0011188313,0.0012969206,0.0029451626,0.00058280805,0.0043053464,0.0041839024,0.0016611898,0.011287084],"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.0008682596,0.00020851757,0.0026494795,0.00140832,0.00036499838,0.0009166014,0.0011583035,0.015078797,0.028675495,0.023790926,0.57552284,0.34935746],"study_design_scores_gemma":[0.0007932939,0.0002459226,0.004543453,0.00043853282,0.00016768546,0.00096043,0.0003985974,0.3310481,0.03932222,0.090172306,0.53151697,0.00039248148],"about_ca_topic_score_codex":0.0048685446,"about_ca_topic_score_gemma":0.008448343,"teacher_disagreement_score":0.037318338,"about_ca_system_score_codex":0.00055756484,"about_ca_system_score_gemma":0.0014183802,"threshold_uncertainty_score":0.124842286},"labels":[],"label_agreement":null},{"id":"W2080617644","doi":"10.1080/15427951.2006.10129121","title":"Finding (Short) Paths in Social Networks","year":2006,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"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":"Degree (music); Mathematics; Set (abstract data type); Degree distribution; Theoretical computer science; Random graph; Social network (sociolinguistics); Computer science; Complex network; Combinatorics; Graph; Social media","score_opus":0.017565717930368534,"score_gpt":0.2796462541375113,"score_spread":0.2620805362071428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080617644","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.14295807,0.0018092567,0.84994304,0.0012196177,0.000028964025,0.000102025246,0.00031786878,0.0003535058,0.0032676626],"genre_scores_gemma":[0.8370063,0.003247323,0.15539236,0.00019402342,0.00013826785,0.00025700912,0.00055669143,0.00009236221,0.003115666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989724,0.00041837714,0.000040388386,0.00030198673,0.00018334614,0.000083426115],"domain_scores_gemma":[0.9859963,0.010754988,0.0019648501,0.0006619264,0.0003401033,0.00028188183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012952369,0.0005748829,0.0007092468,0.0028862802,0.001046614,0.0016597962,0.0012152687,0.0017146596,0.0021345639],"category_scores_gemma":[0.017174333,0.0006784513,0.0006457,0.0025651897,0.002553221,0.006174429,0.001674468,0.0013167533,0.00032165667],"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.00012650408,0.00009719266,0.005901136,0.00058366894,0.00015210545,0.0003976655,0.0010049421,0.39450252,0.002770934,0.5284058,0.003310152,0.06274743],"study_design_scores_gemma":[0.00001892806,0.000027925238,0.0007800635,0.000031665026,0.000018565162,0.00013734776,0.00014114994,0.28294933,0.00044815964,0.7137813,0.001649494,0.000016197764],"about_ca_topic_score_codex":0.0016315364,"about_ca_topic_score_gemma":0.0017069766,"teacher_disagreement_score":0.0028862802,"about_ca_system_score_codex":0.0009548745,"about_ca_system_score_gemma":0.0006098932,"threshold_uncertainty_score":0.0071408153},"labels":[],"label_agreement":null},{"id":"W2615008404","doi":"10.24166/im.03.2018","title":"Subhypergraphs in non-uniform random hypergraphs","year":2018,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":9,"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":"Hypergraph; Mathematics; Random graph; Generalization; Graph; Cluster analysis; Binomial (polynomial); Focus (optics); Relation (database); Section (typography); Discrete mathematics; Combinatorics; Data mining; Computer science; Statistics","score_opus":0.012693409263658108,"score_gpt":0.24062307456692916,"score_spread":0.22792966530327105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615008404","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.15228042,0.0012531708,0.8404855,0.0011428191,0.00003784558,0.00014910586,0.000506341,0.0004698476,0.0036748373],"genre_scores_gemma":[0.82972944,0.0014660321,0.15895106,0.00086545816,0.00030054088,0.00045354394,0.0015253361,0.000275287,0.0064333426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964964,0.0016199128,0.00012759768,0.0010827541,0.0004480298,0.00022528977],"domain_scores_gemma":[0.9557338,0.034309898,0.0040890668,0.0032555612,0.0015127556,0.0010989778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004515626,0.00062848744,0.0015195255,0.0031194612,0.0010690602,0.0024150617,0.0018613233,0.0020580257,0.004479364],"category_scores_gemma":[0.030519139,0.0012443946,0.0011302248,0.0027750996,0.0031895223,0.007947959,0.0019363075,0.002582536,0.00073174917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00037477366,0.00014832432,0.021783287,0.0005285181,0.00023131252,0.0011688842,0.0012995848,0.22636063,0.00482005,0.69237566,0.0056618447,0.04524719],"study_design_scores_gemma":[0.000036030895,0.000051046492,0.0039297272,0.00005726529,0.000053192707,0.0005164538,0.0002503807,0.3889419,0.001666775,0.6011342,0.0033296463,0.000033405668],"about_ca_topic_score_codex":0.0018258892,"about_ca_topic_score_gemma":0.0021461055,"teacher_disagreement_score":0.004515626,"about_ca_system_score_codex":0.0015668664,"about_ca_system_score_gemma":0.0005941831,"threshold_uncertainty_score":0.023881257},"labels":[],"label_agreement":null},{"id":"W2951957905","doi":"10.1080/15427951.2015.1051674","title":"The Analysis of Kademlia for Random IDs","year":2015,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":7,"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","keywords":"Node (physics); Mathematical proof; Computer science; Random graph; Mathematics; Peer-to-peer; The Internet; Constant (computer programming); Theoretical computer science; Algorithm; Distributed computing; Graph; World Wide Web","score_opus":0.047859743194741615,"score_gpt":0.3008502656100821,"score_spread":0.2529905224153405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951957905","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.1208045,0.007258879,0.7756097,0.00810182,0.0005845244,0.0004801064,0.0008045785,0.001559565,0.08479627],"genre_scores_gemma":[0.9076566,0.0029825093,0.061700933,0.0014216412,0.0006701577,0.00067775993,0.000538331,0.00038424693,0.023967776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99613416,0.0011621639,0.00021073077,0.0007062273,0.0010482597,0.00073838665],"domain_scores_gemma":[0.9734631,0.018070735,0.0024581118,0.0023124793,0.0024221959,0.0012733388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055649406,0.0012620372,0.0022333835,0.004516438,0.0033250025,0.0047966237,0.0043506795,0.0031293181,0.011263821],"category_scores_gemma":[0.047960527,0.0009904479,0.0020248352,0.0023868813,0.00490983,0.012202096,0.003676554,0.0038481457,0.0024707078],"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.000049336708,0.000024542005,0.00046356456,0.00011445317,0.000019292986,0.00011263276,0.00024860314,0.01631203,0.000518605,0.97234523,0.004471433,0.0053202505],"study_design_scores_gemma":[0.000040863728,0.000048100865,0.00032775782,0.00008062988,0.00004464498,0.00027710406,0.0001384047,0.33977315,0.00066865276,0.65257233,0.005959381,0.00006898836],"about_ca_topic_score_codex":0.0045940275,"about_ca_topic_score_gemma":0.0027283463,"teacher_disagreement_score":0.011263821,"about_ca_system_score_codex":0.005408711,"about_ca_system_score_gemma":0.0028038213,"threshold_uncertainty_score":0.039243102},"labels":[],"label_agreement":null},{"id":"W2964317248","doi":"10.24166/im.02.2019","title":"On the discovery of the seed in uniform attachment trees","year":2019,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":15,"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","keywords":"Mathematics; Vertex (graph theory); Tree (set theory); Seeding; Preferential attachment; Combinatorics; Agronomy; Biology; Graph","score_opus":0.03050278479512904,"score_gpt":0.2947375142801615,"score_spread":0.26423472948503246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964317248","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.4181974,0.0010415934,0.5739497,0.0020068001,0.00006170848,0.00013700016,0.00047343844,0.00044234042,0.0036900446],"genre_scores_gemma":[0.93463135,0.0005451715,0.061975274,0.00027250973,0.0001776718,0.00015660547,0.0006188895,0.00016152674,0.0014610307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99551326,0.0021486958,0.00019515211,0.0009703352,0.0007853096,0.00038738045],"domain_scores_gemma":[0.6507219,0.32550102,0.011310195,0.0047293366,0.004256868,0.003480778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015288648,0.0011252027,0.0026283017,0.0026701856,0.0021889743,0.0038883993,0.0045628403,0.0035457755,0.0030448486],"category_scores_gemma":[0.16492589,0.0015117603,0.001323207,0.0019465291,0.0053944187,0.0066054137,0.0034283316,0.0033791135,0.00034549655],"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.0015547274,0.00026553567,0.025070524,0.0005571158,0.00031160004,0.001361562,0.0016935382,0.6400314,0.007047613,0.2736727,0.0054006246,0.043033123],"study_design_scores_gemma":[0.000057154703,0.00008516748,0.0017144565,0.000047890724,0.000045775985,0.00018751425,0.00008479436,0.9038615,0.001410656,0.09208694,0.00038474327,0.000033386405],"about_ca_topic_score_codex":0.004475177,"about_ca_topic_score_gemma":0.0029007155,"teacher_disagreement_score":0.015288648,"about_ca_system_score_codex":0.0022418373,"about_ca_system_score_gemma":0.0010242556,"threshold_uncertainty_score":0.08085507},"labels":[],"label_agreement":null},{"id":"W4248395555","doi":"10.1080/15427951.2012.678140","title":"Special Issue on Algorithms and Models for the Web Graph","year":2013,"lang":"en","type":"article","venue":"Internet Mathematics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"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":"Frieze; Mathematics; Graph; Algorithm; French horn; Theoretical computer science; Discrete mathematics; Computer science; Art history","score_opus":0.029427968311985117,"score_gpt":0.2512374160329353,"score_spread":0.22180944772095018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248395555","genre_codex":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073437924,0.109826155,0.14161006,0.082584195,0.1853304,0.00054002873,0.013436214,0.0036426347,0.4556865],"genre_scores_gemma":[0.047981527,0.088903524,0.04219265,0.010336771,0.20414141,0.00061466155,0.024522018,0.0034296117,0.5778779],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979054,0.0003128094,0.0001472141,0.0006521979,0.00083633617,0.0001460306],"domain_scores_gemma":[0.9950218,0.0019906582,0.00027056702,0.0011701897,0.0009961305,0.0005505869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022635132,0.0020493204,0.0024069909,0.004300684,0.0017232489,0.006846086,0.0020201134,0.0024392584,0.14661181],"category_scores_gemma":[0.0067270696,0.0008413153,0.002128595,0.005238374,0.001465669,0.0073079336,0.0023901851,0.005444263,0.040775772],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00004801688,0.00009380767,0.00046639462,0.00042312135,0.000057032008,0.000086548585,0.0000369368,0.0019786935,0.00035008212,0.0844992,0.8448374,0.06712274],"study_design_scores_gemma":[0.000043397686,0.00005619024,0.001590136,0.00034497268,0.00005464885,0.00044267075,0.000060159568,0.009622012,0.00033570413,0.1840936,0.8033208,0.00003572439],"about_ca_topic_score_codex":0.0032593978,"about_ca_topic_score_gemma":0.0046602213,"teacher_disagreement_score":0.14661181,"about_ca_system_score_codex":0.0050115488,"about_ca_system_score_gemma":0.0024599172,"threshold_uncertainty_score":0.49046534},"labels":[],"label_agreement":null}]}