{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001399419,0.0001224495,0.0001979812,0.00008225057,0.00001125797,0.0001418335,0.0002745301,0.00001792185,0.0001459852],"category_scores_gemma":[0.00001478003,0.0001051039,0.0001022341,0.0001837936,0.0000170138,0.00005996404,0.0001346926,0.00007505564,0.000157891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001971053,"about_ca_system_score_gemma":0.00001163968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005915998,"about_ca_topic_score_gemma":0.000009914426,"domain_scores_codex":[0.9993477,0.00001413309,0.000164233,0.0001403078,0.0001646402,0.000168955],"domain_scores_gemma":[0.9993474,0.00003159803,0.00007444749,0.0003136219,0.00009145864,0.0001414704],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000009461271,0.0006404297,0.005091248,0.00002705089,0.0003297445,0.000006667792,0.006547718,0.00006827843,0.0003016807,0.4477665,0.5259867,0.01322458],"study_design_scores_gemma":[0.0004218212,0.0002647567,0.00004954776,0.0001709503,0.0001292773,0.000006467472,0.002690768,0.01928067,0.008519023,0.7643899,0.2034271,0.000649726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09724002,0.00001703852,0.8664687,0.0005108509,0.00006518576,0.0001806664,0.000004491149,0.00013713,0.03537592],"genre_scores_gemma":[0.9407586,1.357016e-7,0.05145479,0.00005909354,0.0001883332,0.00003229773,0.000006243838,0.00001817747,0.007482364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8435186,"threshold_uncertainty_score":0.4286013,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001734683,0.0001246481,0.0001896676,0.00005295015,0.00007245738,0.00003966063,0.0001130455,0.00004124319,0.00009491669],"category_scores_gemma":[0.000002348365,0.0001215488,0.0001818447,0.0001091511,0.00001950991,0.000106423,0.00004612212,0.00008753907,0.000003966511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003141175,"about_ca_system_score_gemma":0.000007850858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002461929,"about_ca_topic_score_gemma":0.000003527925,"domain_scores_codex":[0.9993036,0.00001233444,0.0002273401,0.00009845047,0.00008100145,0.0002772073],"domain_scores_gemma":[0.9996276,0.00004354862,0.0001418904,0.00008942734,0.00005757669,0.00003990347],"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.00002228917,0.001327791,0.02044445,0.00008931824,0.0007221205,7.10671e-8,0.004133742,0.02202664,0.001372239,0.8896957,0.0502402,0.009925439],"study_design_scores_gemma":[0.00008003233,0.000009519049,0.00001408914,0.00001577798,0.00009414223,6.848032e-7,0.00004710341,0.961096,0.0005499045,0.03753561,0.0004316057,0.0001254824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1285037,0.00001394533,0.8697917,0.000008226784,0.00004615047,0.0001596861,0.000003320979,0.00006500661,0.001408264],"genre_scores_gemma":[0.9009362,2.326257e-7,0.09795486,0.00001841821,0.0007070472,0.00003721658,0.00001358579,0.00002574444,0.0003067307],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9390694,"threshold_uncertainty_score":0.4956617,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002189081,0.0001303373,0.0001916453,0.0001737551,0.00002315513,0.00004050179,0.0002257982,0.00002264816,0.001863703],"category_scores_gemma":[0.000008904674,0.0001111584,0.0001412883,0.0003858059,0.00002588499,0.0001072672,0.0001043248,0.0001126177,0.0003100841],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001594863,"about_ca_system_score_gemma":0.000004815973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004843059,"about_ca_topic_score_gemma":9.378711e-7,"domain_scores_codex":[0.9992094,0.00001770685,0.0002478077,0.0000998519,0.0001477327,0.0002775029],"domain_scores_gemma":[0.9994054,0.00006295797,0.0001246258,0.0002907174,0.00003452463,0.00008176111],"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.000003139196,0.001777066,0.1418003,0.00006758632,0.0004018902,8.237205e-7,0.002007592,0.000004972438,0.0002230165,0.759357,0.06649924,0.02785738],"study_design_scores_gemma":[0.0009687908,0.0003037993,0.008384778,0.0004298041,0.0006678061,0.00002448794,0.001541773,0.02116157,0.06258971,0.7360878,0.1655876,0.002252136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.456766,0.0001178723,0.449229,0.00003270982,0.0001181949,0.0003806235,0.000005642989,0.00022579,0.09312412],"genre_scores_gemma":[0.9744539,7.056158e-7,0.02316604,0.00001753481,0.0002090045,0.00004889256,0.000009118598,0.00002072535,0.002074036],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5176879,"threshold_uncertainty_score":0.9990487,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003612356,0.0001254552,0.0001761295,0.0000908376,0.00002765153,0.00004511094,0.0002323233,0.0000230468,0.0006619173],"category_scores_gemma":[0.000005462673,0.0001123531,0.0001440071,0.0001601406,0.00002999471,0.00008807301,0.00008589569,0.0001240065,0.00008827056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001602653,"about_ca_system_score_gemma":0.000005658366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006677799,"about_ca_topic_score_gemma":0.000008695089,"domain_scores_codex":[0.9991705,0.000009669566,0.0003124111,0.0001379055,0.0001423104,0.0002271539],"domain_scores_gemma":[0.9994583,0.00007431918,0.0001144454,0.0002600203,0.00003872533,0.00005425153],"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.000004677056,0.000383855,0.01020989,0.00003454871,0.0001961366,0.000006721958,0.001283908,0.000005816514,0.001312039,0.953258,0.00841036,0.02489407],"study_design_scores_gemma":[0.0003429653,0.0001082409,0.0005927926,0.0002871257,0.0001313372,0.000008168308,0.001378343,0.01199123,0.08120783,0.8811632,0.022135,0.0006537326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.334086,0.00001159143,0.5987685,0.0000276034,0.00004338018,0.0001833252,0.000001303792,0.0001514774,0.06672684],"genre_scores_gemma":[0.9584434,2.040383e-7,0.03996262,0.00003393585,0.000130326,0.00001284843,0.000006374371,0.00002028255,0.001389996],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6243574,"threshold_uncertainty_score":0.724753,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003483105,0.0001560469,0.0002826857,0.00003653979,0.00001683519,0.00003437863,0.0005270732,0.00005760415,0.0001439937],"category_scores_gemma":[0.001046326,0.00007406308,0.00009500268,0.000152803,0.00005069059,0.00004667068,0.0001674223,0.000196723,0.00007008924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005581482,"about_ca_system_score_gemma":0.00002931379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001171405,"about_ca_topic_score_gemma":0.00004850275,"domain_scores_codex":[0.9988161,0.00003040189,0.0004538671,0.0001417401,0.0003675178,0.0001903376],"domain_scores_gemma":[0.9968224,0.002364801,0.0002214247,0.0005309702,0.00003963215,0.00002074112],"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.00001529945,0.0002932775,0.0001009567,0.0002295093,0.00002462042,0.000001060373,0.001213285,0.00001736362,0.0001546349,0.9973595,0.0005242535,0.00006625974],"study_design_scores_gemma":[0.000297094,0.0001712556,0.0002160793,0.0007400406,0.00002709074,0.000005617,0.0007799551,0.03348932,0.002969291,0.961134,0.00005478129,0.0001154693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8350677,0.00001483315,0.1515893,0.0005171367,0.0003148436,0.0008542642,0.00003007116,0.00002415316,0.01158771],"genre_scores_gemma":[0.992927,0.000002065123,0.003316588,0.0001324751,0.00001239343,0.00002507441,6.675658e-7,0.00002119527,0.003562513],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1578593,"threshold_uncertainty_score":0.3020205,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002251652,0.0001353051,0.0003819211,0.0001809188,0.00002808465,0.00002714673,0.0001127456,0.00003216607,0.0005161034],"category_scores_gemma":[0.000005423367,0.0001220871,0.0001299553,0.000351574,0.00005280663,0.000121743,0.0001527772,0.0001033776,0.000003839695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008865471,"about_ca_system_score_gemma":0.000004821706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001654806,"about_ca_topic_score_gemma":0.00002208029,"domain_scores_codex":[0.9991878,0.00002942195,0.0003350056,0.0001837075,0.0001052656,0.0001587637],"domain_scores_gemma":[0.9993121,0.00007658362,0.0002535758,0.0002216436,0.00008243015,0.00005364184],"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.00002609745,0.001439999,0.4387688,0.0001344472,0.005403196,0.000002916001,0.02267537,0.000001684058,0.0005171234,0.5261449,0.001194018,0.003691477],"study_design_scores_gemma":[0.001592311,0.000434902,0.04500354,0.001050907,0.009147755,0.000008741807,0.009794952,0.5065194,0.04246745,0.3801103,0.002603068,0.001266689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8914179,0.00004770668,0.1047129,0.000003656193,0.0000134286,0.0001026786,0.00005859213,0.00003017194,0.003612884],"genre_scores_gemma":[0.9908721,0.00000419238,0.008845278,0.00001008907,0.0000107788,0.00001313701,0.0000585378,0.00001234552,0.0001735285],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5065177,"threshold_uncertainty_score":0.5650971,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004068184,0.0001617012,0.0002232297,0.0002868775,0.00002999429,0.0002249428,0.00145233,0.00004718358,0.00006834164],"category_scores_gemma":[0.00003751354,0.0001351386,0.00007502914,0.0005245308,0.00008563303,0.000562279,0.0004779884,0.0001021879,0.0006160617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001972417,"about_ca_system_score_gemma":0.00001051491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004539295,"about_ca_topic_score_gemma":0.00007971174,"domain_scores_codex":[0.9988118,0.00001593389,0.0003397684,0.0002858134,0.0002430227,0.0003037021],"domain_scores_gemma":[0.9990531,0.00006864408,0.00009103445,0.0006755907,0.00005196751,0.00005966702],"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.00004902563,0.001874627,0.00247582,0.0003494337,0.000218963,0.0002397933,0.0161391,0.00001599181,0.0006092775,0.8217826,0.07001061,0.0862347],"study_design_scores_gemma":[0.002655476,0.000348672,0.0006542438,0.0002714128,0.00001891883,0.00003777616,0.0002318366,0.8917422,0.003015248,0.07801739,0.02240849,0.0005983143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04534509,0.00002283125,0.8979446,0.0002404819,0.0006187771,0.0002680597,0.000002540311,0.0001636417,0.05539401],"genre_scores_gemma":[0.7789767,0.00002435107,0.2168916,0.0003116748,0.0001132849,0.00002586692,0.000005749935,0.00001841724,0.003632245],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8917263,"threshold_uncertainty_score":0.7918432,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008820571,0.0001054112,0.0003103892,0.0001757426,0.00002444981,0.000105866,0.001930117,0.0000571803,0.000001735253],"category_scores_gemma":[0.0007863361,0.00006747647,0.0001519159,0.0008123965,0.0000650804,0.00008014687,0.0004433415,0.00006540506,0.00002286606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003491645,"about_ca_system_score_gemma":0.00002500179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009317472,"about_ca_topic_score_gemma":0.00003984596,"domain_scores_codex":[0.9989576,0.00001994001,0.000363976,0.0001715086,0.0002754094,0.0002115829],"domain_scores_gemma":[0.9981422,0.0006230685,0.0001658677,0.0008099457,0.0001995239,0.0000593627],"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.00006594756,0.000265514,0.000390682,0.00006600094,0.002138714,0.000004917757,0.0111742,0.003480968,0.0001791226,0.68458,0.2537315,0.04392234],"study_design_scores_gemma":[0.0005234817,0.0001545615,0.00006417747,0.00002837394,0.0002164866,0.000003653286,0.000260596,0.8771107,0.00336097,0.09140556,0.02671959,0.00015184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02223365,0.000112201,0.9747078,0.001385536,0.0001795124,0.0002493867,0.000004004169,0.0001802691,0.0009475939],"genre_scores_gemma":[0.6617534,0.000005202507,0.336018,0.00009862547,0.00002490542,0.00007427795,0.000001843108,0.000009960734,0.002013827],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8736297,"threshold_uncertainty_score":0.358667,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001395849,0.0001462525,0.0002413385,0.00006192045,0.00004587849,0.00009868824,0.0001928159,0.00002478055,0.0003712256],"category_scores_gemma":[0.00001029197,0.0001220913,0.0001419688,0.00005294305,0.00003074579,0.00005171545,0.00005795374,0.00007918346,0.00004721184],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000180096,"about_ca_system_score_gemma":0.000008025429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002382235,"about_ca_topic_score_gemma":0.00002131028,"domain_scores_codex":[0.9993151,0.00002215799,0.0002333509,0.0001587816,0.0001072439,0.000163351],"domain_scores_gemma":[0.999189,0.0003831829,0.0001382014,0.0002134093,0.00004403977,0.00003222196],"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.000006374879,0.0001910988,0.0002873088,0.00001923277,0.00005296566,1.05504e-7,0.0006590511,0.00005136127,0.0003510158,0.9905355,0.003486154,0.004359853],"study_design_scores_gemma":[0.0005210622,0.0004368984,0.0003003773,0.0004706854,0.00009744659,6.693954e-7,0.002333954,0.2444952,0.005786655,0.7142056,0.03094622,0.0004052782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1599278,0.000002687978,0.7391004,0.0000478967,0.00004664269,0.0002033286,0.00001077316,0.00007470551,0.1005858],"genre_scores_gemma":[0.9802743,3.86944e-7,0.01791319,0.0000344759,0.0002163662,0.0000484901,0.00002984078,0.00002014595,0.001462787],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8203466,"threshold_uncertainty_score":0.4978738,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001623196,0.0001440805,0.000252857,0.00008726093,0.00003503677,0.00006554424,0.000205156,0.00004350484,0.0003916624],"category_scores_gemma":[0.000001942334,0.0001417371,0.0001288065,0.0001966114,0.00002775027,0.00005156334,0.00009443555,0.0001718593,0.0000237079],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004089992,"about_ca_system_score_gemma":0.000007315393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002216371,"about_ca_topic_score_gemma":0.00007235061,"domain_scores_codex":[0.9990695,0.0000228625,0.0003844661,0.0001571148,0.0001165761,0.0002494643],"domain_scores_gemma":[0.9996452,0.00006699037,0.0000931043,0.0001520991,0.00002336797,0.00001923544],"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.000006575785,0.001075927,0.1029815,0.00003414278,0.0001169767,0.0000159394,0.001096509,0.001745446,0.0001637634,0.7973441,0.079189,0.01623006],"study_design_scores_gemma":[0.0004046093,0.00004603466,0.005472601,0.0002271211,0.00009200605,0.000002993455,0.0004045322,0.6272045,0.001534473,0.3547047,0.009163081,0.0007433383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4186734,0.00003158821,0.4843661,0.00003592135,0.00006209039,0.0001869174,0.000004069905,0.0001220672,0.09651792],"genre_scores_gemma":[0.9933563,3.806904e-7,0.004624003,0.00001183463,0.0005910801,0.00002598697,0.0000291126,0.00002238334,0.001338855],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6254591,"threshold_uncertainty_score":0.577987,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001865725,0.0001246153,0.0001222127,0.0000599062,0.00005306987,0.0005183218,0.0009153594,0.00002843138,0.00009464759],"category_scores_gemma":[0.00002051437,0.00007813962,0.00004878423,0.00008980009,0.00004524452,0.0005043559,0.0003271324,0.00006723418,0.0002454458],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008221814,"about_ca_system_score_gemma":0.000005233585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001402632,"about_ca_topic_score_gemma":0.000003686036,"domain_scores_codex":[0.9992299,0.0000089479,0.0001788358,0.0002153364,0.0001801673,0.0001868039],"domain_scores_gemma":[0.9991772,0.0002200309,0.00006763209,0.0004520596,0.00004079229,0.00004230372],"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.000001126155,0.0001035248,0.000001113676,0.00004099645,0.00004385576,0.000001658172,0.001121151,0.00004310571,0.000003459767,0.3254002,0.4575502,0.2156896],"study_design_scores_gemma":[0.0001646232,0.00007674879,0.000007125424,0.00002430039,0.000008566512,0.000003136262,0.00008267877,0.807357,0.00005623765,0.1103918,0.08173065,0.00009720103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004081994,0.00002936279,0.9780398,0.001921406,0.0008333419,0.0006033547,0.000008778083,0.00008164746,0.01807411],"genre_scores_gemma":[0.02220403,0.0002528125,0.9197792,0.002683451,0.008899318,0.0005382433,0.00001306941,0.0000670981,0.04556276],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8073139,"threshold_uncertainty_score":0.4998189,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}