{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":11,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":11,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"f728de9c9977","filters":{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Iterated function; Graph; Combinatorics; Transitive relation; Discrete mathematics; Line graph","authors":[{"name":"Anthony Bonato","is_ca":true},{"name":"Jeannette Janssen","is_ca":true},{"name":"Elham Roshanbin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03516612690738674,"gpt":0.2807895234286888,"spread":0.2456233965213021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001244047,0.0004556984,0.0005273278,0.001083604,0.001456118,0.002958181,0.00123784,0.001893149,0.01618972],"category_scores_gemma":[0.01198209,0.0004307885,0.000703549,0.001009648,0.00248029,0.007666792,0.001616566,0.002092255,0.002826775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008310383,"about_ca_system_score_gemma":0.0008306432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002148984,"about_ca_topic_score_gemma":0.002200538,"domain_scores_codex":[0.9989694,0.0003002204,0.00005580127,0.0002924765,0.0002712022,0.0001109106],"domain_scores_gemma":[0.9951201,0.002379512,0.0002969438,0.001155582,0.0006661823,0.0003816042],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006599839,0.00004643545,0.001092179,0.0002347701,0.00003871772,0.0001403528,0.0003324482,0.02608688,0.003168959,0.8611246,0.02147916,0.0861895],"study_design_scores_gemma":[0.00001440369,0.0000292544,0.0002975424,0.0000917092,0.00001725679,0.0002474897,0.0002703745,0.05424306,0.001671698,0.903545,0.03954739,0.0000248021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08894153,0.003356367,0.7867026,0.01668157,0.001939725,0.0002361133,0.001179176,0.001569411,0.09939342],"genre_scores_gemma":[0.5852064,0.004098483,0.3600079,0.003185365,0.000738334,0.0003419158,0.001760706,0.001585747,0.04307511],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01618972,"threshold_uncertainty_score":0.05416,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Jeannette Janssen","is_ca":true},{"name":"Matthew Hurshman","is_ca":true},{"name":"Nauzer Kalyaniwalla","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07055483639277808,"gpt":0.3336439917856682,"spread":0.2630891553928901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004029157,0.001226708,0.001418977,0.002764718,0.0008565554,0.001188021,0.001749097,0.001572692,0.001861948],"category_scores_gemma":[0.0113667,0.0008811649,0.001577368,0.001400926,0.0009120618,0.001766755,0.001161512,0.002083573,0.0007914919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001150329,"about_ca_system_score_gemma":0.0008900588,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003762188,"about_ca_topic_score_gemma":0.004430197,"domain_scores_codex":[0.998489,0.000972455,0.00004524435,0.0002374496,0.0001674787,0.00008838699],"domain_scores_gemma":[0.9898233,0.008519899,0.000537709,0.0004356252,0.0004909182,0.0001926284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007262803,0.00008007816,0.001656658,0.00003635994,0.00007596949,0.00008722355,0.00006649269,0.9554262,0.0004372924,0.01040146,0.001551747,0.0301078],"study_design_scores_gemma":[0.000004507025,0.000005841603,0.00004468858,0.00000138331,0.000002197969,0.000005215601,0.000002509475,0.9952453,0.00005827406,0.00454937,0.00007913596,0.000001580163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02525808,0.000132683,0.9728684,0.00034164,0.00002934281,0.0000734798,0.0001939076,0.0005943242,0.0005081894],"genre_scores_gemma":[0.629054,0.0003331157,0.3651737,0.0002788029,0.0001571484,0.0005794599,0.001696633,0.000269131,0.002458122],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004029157,"threshold_uncertainty_score":0.02130848,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Anthony Bonato","is_ca":true},{"name":"Jeannette Janssen","is_ca":true},{"name":"Paweł Prałat","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02043266424877522,"gpt":0.2723019065488521,"spread":0.2518692423000769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009258289,0.0007448789,0.0006998138,0.003535737,0.00186381,0.001690276,0.001441234,0.001267895,0.003764675],"category_scores_gemma":[0.007344592,0.0005397466,0.000788678,0.002589564,0.002407144,0.0046165,0.001985363,0.001359814,0.0006196951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001782269,"about_ca_system_score_gemma":0.0006126714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003790748,"about_ca_topic_score_gemma":0.003764332,"domain_scores_codex":[0.9989368,0.000408974,0.00002948085,0.0002674609,0.000248557,0.000108697],"domain_scores_gemma":[0.9956889,0.001809702,0.001223593,0.0005449166,0.0003889989,0.0003438959],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001748435,0.0000255105,0.002332542,0.00004540734,0.00003354251,0.000167335,0.0002939203,0.07183836,0.0005650523,0.911481,0.002573623,0.01062616],"study_design_scores_gemma":[0.000007592218,0.0000188011,0.001040532,0.00001629899,0.00001124572,0.0002315231,0.0001163682,0.2731341,0.0002442863,0.7170782,0.008084369,0.00001677135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2027884,0.0009096185,0.7702488,0.002306336,0.0000865961,0.0001158947,0.0007490156,0.0004610918,0.02233429],"genre_scores_gemma":[0.9274077,0.001024038,0.06157838,0.0004527807,0.0002271357,0.0001847354,0.0009167218,0.0001216576,0.008086818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003790748,"threshold_uncertainty_score":0.01293135,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Paweł Prałat","is_ca":true},{"name":"Nicholas Wormald","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01373369870836925,"gpt":0.2752517246273588,"spread":0.2615180259189895,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005044453,0.0003550292,0.000495288,0.001983287,0.001242056,0.001357997,0.0008932116,0.001068173,0.003214331],"category_scores_gemma":[0.004920581,0.0004789761,0.0004891591,0.001026187,0.001196988,0.002454904,0.001180195,0.0008981246,0.0005572261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009371404,"about_ca_system_score_gemma":0.0004121517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002783816,"about_ca_topic_score_gemma":0.003593385,"domain_scores_codex":[0.9994522,0.0001396374,0.00001561519,0.000157435,0.0001602892,0.00007494621],"domain_scores_gemma":[0.9978417,0.0009470946,0.0004101279,0.0002626136,0.0002852003,0.0002531925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003812335,0.00002948904,0.001980111,0.00007685758,0.00003667494,0.0005475439,0.0004354171,0.04700577,0.00395161,0.9233059,0.004592456,0.01800002],"study_design_scores_gemma":[0.00001421679,0.00002262237,0.002045732,0.00002132687,0.00001788173,0.0008546371,0.0001406323,0.288809,0.0009758103,0.6920618,0.0150112,0.0000251467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3906521,0.001206286,0.5570294,0.00210395,0.000134468,0.0001503895,0.0006688475,0.0008478508,0.0472066],"genre_scores_gemma":[0.9435642,0.000699784,0.03813817,0.0003412271,0.0001246277,0.0001538866,0.0005059508,0.0001075495,0.01636459],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003214331,"threshold_uncertainty_score":0.01075298,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Tommy Reddad","is_ca":true},{"name":"Luc Devroye","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03050278479512904,"gpt":0.2947375142801615,"spread":0.2642347294850325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01528865,0.001125203,0.002628302,0.002670186,0.002188974,0.003888399,0.00456284,0.003545776,0.003044849],"category_scores_gemma":[0.1649259,0.00151176,0.001323207,0.001946529,0.005394419,0.006605414,0.003428332,0.003379114,0.0003454965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002241837,"about_ca_system_score_gemma":0.001024256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004475177,"about_ca_topic_score_gemma":0.002900715,"domain_scores_codex":[0.9955133,0.002148696,0.0001951521,0.0009703352,0.0007853096,0.0003873805],"domain_scores_gemma":[0.6507219,0.325501,0.01131019,0.004729337,0.004256868,0.003480778],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001554727,0.0002655357,0.02507052,0.0005571158,0.0003116,0.001361562,0.001693538,0.6400314,0.007047613,0.2736727,0.005400625,0.04303312],"study_design_scores_gemma":[0.0000571547,0.00008516748,0.001714456,0.00004789072,0.00004577599,0.0001875142,0.00008479436,0.9038615,0.001410656,0.09208694,0.0003847433,0.0000333864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4181974,0.001041593,0.5739497,0.0020068,0.00006170848,0.0001370002,0.0004734384,0.0004423404,0.003690045],"genre_scores_gemma":[0.9346313,0.0005451715,0.06197527,0.0002725097,0.0001776718,0.0001566055,0.0006188895,0.0001615267,0.001461031],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01528865,"threshold_uncertainty_score":0.08085507,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Amira Djebbari","is_ca":true},{"name":"Muhammad Ali","is_ca":true},{"name":"David Otasek","is_ca":true},{"name":"Max Kotlyar","is_ca":true},{"name":"Kristen Fortney","is_ca":true},{"name":"Serene Wong","is_ca":true},{"name":"Anthony Hrvojic","is_ca":true},{"name":"Igor Jurišica","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01488171552979747,"gpt":0.2781225979841873,"spread":0.2632408824543898,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002076559,0.002209135,0.001093205,0.003634999,0.0008681254,0.002415854,0.003235659,0.0009901498,0.03731834],"category_scores_gemma":[0.007140652,0.001118831,0.001296921,0.002945163,0.000582808,0.004305346,0.004183902,0.00166119,0.01128708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005575648,"about_ca_system_score_gemma":0.00141838,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004868545,"about_ca_topic_score_gemma":0.008448343,"domain_scores_codex":[0.9988581,0.0002408686,0.00007378024,0.0002115843,0.0005284069,0.00008713573],"domain_scores_gemma":[0.9970367,0.001438059,0.0001372413,0.0006840716,0.0004262489,0.0002777393],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008682596,0.0002085176,0.00264948,0.00140832,0.0003649984,0.0009166014,0.001158303,0.0150788,0.02867549,0.02379093,0.5755228,0.3493575],"study_design_scores_gemma":[0.0007932939,0.0002459226,0.004543453,0.0004385328,0.0001676855,0.00096043,0.0003985974,0.3310481,0.03932222,0.09017231,0.531517,0.0003924815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003945486,0.0003536753,0.5874398,0.0003897967,0.0001233958,0.00030963,0.01309223,0.3873585,0.006987604],"genre_scores_gemma":[0.05232908,0.001105035,0.8347969,0.0003612929,0.0001210161,0.001274555,0.04758245,0.04992778,0.01250185],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03731834,"threshold_uncertainty_score":0.1248423,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Megan Dewar","is_ca":false},{"name":"John J. Healy","is_ca":false},{"name":"Xavier Pérez‐Giménez","is_ca":false},{"name":"Paweł Prałat","is_ca":false},{"name":"John Proos","is_ca":false},{"name":"Benjamin Reiniger","is_ca":false},{"name":"Kirill Ternovsky","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01269340926365811,"gpt":0.2406230745669292,"spread":0.2279296653032711,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004515626,0.0006284874,0.001519526,0.003119461,0.00106906,0.002415062,0.001861323,0.002058026,0.004479364],"category_scores_gemma":[0.03051914,0.001244395,0.001130225,0.0027751,0.003189522,0.007947959,0.001936308,0.002582536,0.0007317492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001566866,"about_ca_system_score_gemma":0.0005941831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001825889,"about_ca_topic_score_gemma":0.002146106,"domain_scores_codex":[0.9964964,0.001619913,0.0001275977,0.001082754,0.0004480298,0.0002252898],"domain_scores_gemma":[0.9557338,0.0343099,0.004089067,0.003255561,0.001512756,0.001098978],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003747737,0.0001483243,0.02178329,0.0005285181,0.0002313125,0.001168884,0.001299585,0.2263606,0.00482005,0.6923757,0.005661845,0.04524719],"study_design_scores_gemma":[0.00003603089,0.00005104649,0.003929727,0.00005726529,0.00005319271,0.0005164538,0.0002503807,0.3889419,0.001666775,0.6011342,0.003329646,0.00003340567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1522804,0.001253171,0.8404855,0.001142819,0.00003784558,0.0001491059,0.000506341,0.0004698476,0.003674837],"genre_scores_gemma":[0.8297294,0.001466032,0.1589511,0.0008654582,0.0003005409,0.0004535439,0.001525336,0.000275287,0.006433343],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004515626,"threshold_uncertainty_score":0.02388126,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Xing Shi Cai","is_ca":true},{"name":"Luc Devroye","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04785974319474161,"gpt":0.3008502656100821,"spread":0.2529905224153405,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005564941,0.001262037,0.002233383,0.004516438,0.003325003,0.004796624,0.004350679,0.003129318,0.01126382],"category_scores_gemma":[0.04796053,0.0009904479,0.002024835,0.002386881,0.00490983,0.0122021,0.003676554,0.003848146,0.002470708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005408711,"about_ca_system_score_gemma":0.002803821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004594028,"about_ca_topic_score_gemma":0.002728346,"domain_scores_codex":[0.9961342,0.001162164,0.0002107308,0.0007062273,0.00104826,0.0007383866],"domain_scores_gemma":[0.9734631,0.01807074,0.002458112,0.002312479,0.002422196,0.001273339],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004933671,0.00002454201,0.0004635646,0.0001144532,0.00001929299,0.0001126328,0.0002486031,0.01631203,0.000518605,0.9723452,0.004471433,0.005320251],"study_design_scores_gemma":[0.00004086373,0.00004810086,0.0003277578,0.00008062988,0.00004464498,0.0002771041,0.0001384047,0.3397731,0.0006686528,0.6525723,0.005959381,0.00006898836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","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.002982509,0.06170093,0.001421641,0.0006701577,0.0006777599,0.000538331,0.0003842469,0.02396778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01126382,"threshold_uncertainty_score":0.0392431,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jeannette Janssen","is_ca":true},{"name":"Celeste Vautour","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02164191948968902,"gpt":0.2895912902731283,"spread":0.2679493707834393,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001727813,0.0008856973,0.001121622,0.00136595,0.001040694,0.001766449,0.001191164,0.00148899,0.002641696],"category_scores_gemma":[0.01500374,0.0004996746,0.0009363412,0.0008839993,0.001709851,0.002454364,0.001725654,0.001589764,0.0003956138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001071285,"about_ca_system_score_gemma":0.001060915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002047243,"about_ca_topic_score_gemma":0.002062157,"domain_scores_codex":[0.998882,0.0005426374,0.00005215488,0.0001614802,0.0002196636,0.0001419773],"domain_scores_gemma":[0.9866138,0.01131169,0.0005922053,0.0003980983,0.000526423,0.0005577528],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002039108,0.0001856871,0.00232974,0.0001901229,0.0001106621,0.0002501986,0.0006410457,0.5871204,0.005532284,0.3590616,0.002253639,0.04212085],"study_design_scores_gemma":[0.00002824754,0.0000515666,0.0001485304,0.00001207572,0.00001230386,0.00005374109,0.0000795579,0.7613279,0.000809825,0.236655,0.0008099714,0.00001133963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1561238,0.0002474982,0.8365696,0.0004198346,0.00002323712,0.0001489601,0.00008237002,0.00014289,0.006241849],"genre_scores_gemma":[0.7903339,0.0003268693,0.205449,0.0001758037,0.00003333869,0.000228644,0.000213327,0.0001023122,0.003136771],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002641696,"threshold_uncertainty_score":0.00913769,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"André Allavena","is_ca":true},{"name":"Anirban Dasgupta","is_ca":false},{"name":"John E. Hopcroft","is_ca":false},{"name":"Ravi Kumar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01756571793036853,"gpt":0.2796462541375113,"spread":0.2620805362071428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001295237,0.0005748829,0.0007092468,0.00288628,0.001046614,0.001659796,0.001215269,0.00171466,0.002134564],"category_scores_gemma":[0.01717433,0.0006784513,0.0006457,0.00256519,0.002553221,0.006174429,0.001674468,0.001316753,0.0003216567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009548745,"about_ca_system_score_gemma":0.0006098932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001631536,"about_ca_topic_score_gemma":0.001706977,"domain_scores_codex":[0.9989724,0.0004183771,0.00004038839,0.0003019867,0.0001833461,0.00008342612],"domain_scores_gemma":[0.9859963,0.01075499,0.00196485,0.0006619264,0.0003401033,0.0002818818],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001265041,0.00009719266,0.005901136,0.0005836689,0.0001521055,0.0003976655,0.001004942,0.3945025,0.002770934,0.5284058,0.003310152,0.06274743],"study_design_scores_gemma":[0.00001892806,0.00002792524,0.0007800635,0.00003166503,0.00001856516,0.0001373478,0.0001411499,0.2829493,0.0004481596,0.7137813,0.001649494,0.00001619776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1429581,0.001809257,0.849943,0.001219618,0.00002896402,0.0001020252,0.0003178688,0.0003535058,0.003267663],"genre_scores_gemma":[0.8370063,0.003247323,0.1553924,0.0001940234,0.0001382678,0.0002570091,0.0005566914,0.00009236221,0.003115666],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00288628,"threshold_uncertainty_score":0.007140815,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Alan Frieze","is_ca":true},{"name":"Paul Horn","is_ca":true},{"name":"Paweł Prałat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02942796831198512,"gpt":0.2512374160329353,"spread":0.2218094477209502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002263513,0.00204932,0.002406991,0.004300684,0.001723249,0.006846086,0.002020113,0.002439258,0.1466118],"category_scores_gemma":[0.00672707,0.0008413153,0.002128595,0.005238374,0.001465669,0.007307934,0.002390185,0.005444263,0.04077577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005011549,"about_ca_system_score_gemma":0.002459917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003259398,"about_ca_topic_score_gemma":0.004660221,"domain_scores_codex":[0.9979054,0.0003128094,0.0001472141,0.0006521979,0.0008363362,0.0001460306],"domain_scores_gemma":[0.9950218,0.001990658,0.000270567,0.00117019,0.0009961305,0.0005505869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004801688,0.00009380767,0.0004663946,0.0004231214,0.00005703201,0.00008654859,0.0000369368,0.001978694,0.0003500821,0.0844992,0.8448374,0.06712274],"study_design_scores_gemma":[0.00004339769,0.00005619024,0.001590136,0.0003449727,0.00005464885,0.0004426707,0.00006015957,0.009622012,0.0003357041,0.1840936,0.8033208,0.00003572439],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"editorial","genre_scores_codex":[0.007343792,0.1098262,0.1416101,0.08258419,0.1853304,0.0005400287,0.01343621,0.003642635,0.4556865],"genre_scores_gemma":[0.04798153,0.08890352,0.04219265,0.01033677,0.2041414,0.0006146615,0.02452202,0.003429612,0.5778779],"genre_candidate":"editorial","genre_consensus":null,"teacher_disagreement_score":0.1466118,"threshold_uncertainty_score":0.4904653,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}