{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097240016,0.000017038517,0.8664687,0.00051085086,0.000065185755,0.00018066644,0.0000044911494,0.00013713003,0.03537592],"genre_scores_gemma":[0.9407586,1.3570163e-7,0.05145479,0.00005909354,0.00018833316,0.00003229773,0.0000062438376,0.000018177467,0.0074823643],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934775,0.000014133088,0.00016423305,0.00014030779,0.00016464018,0.00016895498],"domain_scores_gemma":[0.9993474,0.00003159803,0.00007444749,0.00031362195,0.00009145864,0.00014147043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001399419,0.00012244952,0.0001979812,0.00008225057,0.000011257973,0.00014183353,0.00027453015,0.000017921853,0.0001459852],"category_scores_gemma":[0.000014780026,0.0001051039,0.000102234095,0.00018379356,0.0000170138,0.000059964037,0.00013469264,0.00007505564,0.000157891],"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.0000094612715,0.00064042973,0.005091248,0.000027050894,0.0003297445,0.000006667792,0.0065477183,0.00006827843,0.00030168067,0.44776645,0.5259867,0.013224584],"study_design_scores_gemma":[0.00042182123,0.00026475673,0.000049547758,0.00017095033,0.00012927725,0.000006467472,0.002690768,0.019280674,0.008519023,0.7643899,0.20342709,0.00064972596],"about_ca_topic_score_codex":0.000059159982,"about_ca_topic_score_gemma":0.000009914426,"teacher_disagreement_score":0.84351856,"about_ca_system_score_codex":0.00001971053,"about_ca_system_score_gemma":0.000011639681,"threshold_uncertainty_score":0.42860126},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15992776,0.0000026879777,0.7391004,0.0000478967,0.000046642686,0.00020332856,0.000010773163,0.00007470551,0.10058584],"genre_scores_gemma":[0.9802743,3.8694395e-7,0.017913185,0.0000344759,0.00021636623,0.000048490096,0.00002984078,0.000020145948,0.0014627873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931514,0.000022157992,0.00023335092,0.0001587816,0.000107243904,0.000163351],"domain_scores_gemma":[0.99918896,0.0003831829,0.00013820139,0.00021340934,0.000044039774,0.00003222196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001395849,0.00014625248,0.00024133854,0.00006192045,0.000045878485,0.00009868824,0.0001928159,0.000024780551,0.00037122564],"category_scores_gemma":[0.000010291971,0.00012209128,0.00014196883,0.00005294305,0.000030745792,0.00005171545,0.00005795374,0.00007918346,0.00004721184],"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.0000063748794,0.0001910988,0.00028730877,0.000019232768,0.000052965665,1.0550404e-7,0.00065905106,0.000051361272,0.00035101577,0.9905355,0.0034861541,0.0043598525],"study_design_scores_gemma":[0.00052106223,0.00043689838,0.00030037735,0.0004706854,0.00009744659,6.693954e-7,0.0023339544,0.24449515,0.0057866555,0.7142056,0.030946217,0.00040527817],"about_ca_topic_score_codex":0.000023822351,"about_ca_topic_score_gemma":0.00002131028,"teacher_disagreement_score":0.8203466,"about_ca_system_score_codex":0.000018009603,"about_ca_system_score_gemma":0.0000080254285,"threshold_uncertainty_score":0.49787378},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.334086,0.000011591426,0.5987685,0.000027603399,0.000043380176,0.0001833252,0.0000013037924,0.0001514774,0.06672684],"genre_scores_gemma":[0.9584434,2.0403832e-7,0.03996262,0.000033935852,0.00013032604,0.000012848427,0.0000063743705,0.000020282547,0.001389996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917054,0.000009669566,0.00031241105,0.00013790547,0.00014231037,0.00022715387],"domain_scores_gemma":[0.99945825,0.000074319185,0.00011444544,0.00026002034,0.00003872533,0.00005425153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036123564,0.00012545523,0.00017612953,0.000090837595,0.000027651531,0.000045110944,0.00023232329,0.000023046798,0.0006619173],"category_scores_gemma":[0.0000054626735,0.0001123531,0.00014400706,0.00016014063,0.000029994706,0.00008807301,0.00008589569,0.00012400652,0.000088270564],"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.000004677056,0.00038385505,0.010209886,0.000034548713,0.00019613656,0.000006721958,0.0012839084,0.000005816514,0.0013120389,0.953258,0.00841036,0.024894068],"study_design_scores_gemma":[0.0003429653,0.000108240914,0.0005927926,0.0002871257,0.00013133716,0.000008168308,0.0013783425,0.011991232,0.081207834,0.88116324,0.022135003,0.0006537326],"about_ca_topic_score_codex":0.00006677799,"about_ca_topic_score_gemma":0.0000086950895,"teacher_disagreement_score":0.6243574,"about_ca_system_score_codex":0.000016026532,"about_ca_system_score_gemma":0.0000056583663,"threshold_uncertainty_score":0.724753},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45676604,0.00011787225,0.449229,0.000032709817,0.00011819492,0.00038062353,0.0000056429885,0.00022579003,0.09312412],"genre_scores_gemma":[0.9744539,7.0561583e-7,0.023166036,0.000017534809,0.00020900452,0.00004889256,0.0000091185975,0.000020725352,0.0020740358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992094,0.000017706852,0.0002478077,0.000099851895,0.00014773267,0.0002775029],"domain_scores_gemma":[0.9994054,0.00006295797,0.00012462585,0.0002907174,0.000034524634,0.000081761114],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021890814,0.00013033734,0.00019164529,0.00017375514,0.000023155126,0.000040501793,0.0002257982,0.000022648155,0.0018637031],"category_scores_gemma":[0.000008904674,0.00011115841,0.00014128826,0.00038580594,0.000025884989,0.00010726721,0.00010432485,0.00011261768,0.0003100841],"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.0000031391962,0.0017770665,0.1418003,0.00006758632,0.00040189023,8.2372054e-7,0.0020075925,0.0000049724376,0.00022301645,0.759357,0.06649924,0.027857378],"study_design_scores_gemma":[0.0009687908,0.0003037993,0.008384778,0.00042980415,0.0006678061,0.000024487937,0.0015417727,0.02116157,0.06258971,0.7360878,0.16558756,0.002252136],"about_ca_topic_score_codex":0.00004843059,"about_ca_topic_score_gemma":9.378711e-7,"teacher_disagreement_score":0.5176879,"about_ca_system_score_codex":0.000015948632,"about_ca_system_score_gemma":0.0000048159727,"threshold_uncertainty_score":0.9990487},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1285037,0.000013945333,0.8697917,0.000008226784,0.000046150468,0.00015968611,0.000003320979,0.00006500661,0.0014082643],"genre_scores_gemma":[0.9009362,2.3262565e-7,0.09795486,0.00001841821,0.0007070472,0.00003721658,0.000013585786,0.000025744439,0.00030673074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930364,0.000012334443,0.00022734015,0.000098450466,0.000081001446,0.00027720732],"domain_scores_gemma":[0.99962765,0.00004354862,0.00014189041,0.00008942734,0.00005757669,0.000039903472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017346829,0.00012464813,0.00018966761,0.000052950152,0.000072457384,0.00003966063,0.000113045506,0.000041243187,0.000094916686],"category_scores_gemma":[0.0000023483653,0.000121548816,0.00018184469,0.00010915114,0.000019509915,0.00010642298,0.00004612212,0.00008753907,0.0000039665106],"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.000022289172,0.0013277909,0.02044445,0.000089318244,0.00072212046,7.10671e-8,0.0041337423,0.022026638,0.0013722394,0.8896957,0.050240204,0.009925439],"study_design_scores_gemma":[0.000080032325,0.000009519049,0.000014089135,0.00001577798,0.000094142226,6.848032e-7,0.00004710341,0.96109605,0.00054990454,0.037535608,0.0004316057,0.00012548245],"about_ca_topic_score_codex":0.000024619289,"about_ca_topic_score_gemma":0.000003527925,"teacher_disagreement_score":0.9390694,"about_ca_system_score_codex":0.000031411746,"about_ca_system_score_gemma":0.000007850858,"threshold_uncertainty_score":0.49566168},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8914179,0.00004770668,0.10471294,0.0000036561926,0.000013428596,0.00010267856,0.000058592133,0.000030171945,0.003612884],"genre_scores_gemma":[0.9908721,0.0000041923804,0.008845278,0.00001008907,0.000010778804,0.000013137005,0.0000585378,0.00001234552,0.00017352853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991878,0.000029421948,0.00033500564,0.00018370753,0.00010526556,0.00015876365],"domain_scores_gemma":[0.9993121,0.000076583616,0.00025357577,0.0002216436,0.000082430146,0.000053641845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022516516,0.0001353051,0.0003819211,0.00018091884,0.000028084653,0.000027146734,0.000112745554,0.000032166066,0.0005161034],"category_scores_gemma":[0.000005423367,0.00012208713,0.00012995527,0.00035157404,0.00005280663,0.000121742996,0.00015277724,0.00010337761,0.0000038396947],"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.00002609745,0.0014399993,0.43876883,0.0001344472,0.005403196,0.0000029160012,0.022675369,0.0000016840577,0.0005171234,0.52614486,0.0011940178,0.0036914772],"study_design_scores_gemma":[0.001592311,0.00043490197,0.045003545,0.0010509068,0.009147755,0.000008741807,0.009794952,0.5065194,0.042467445,0.38011032,0.0026030682,0.0012666888],"about_ca_topic_score_codex":0.00016548058,"about_ca_topic_score_gemma":0.000022080289,"teacher_disagreement_score":0.5065177,"about_ca_system_score_codex":0.000008865471,"about_ca_system_score_gemma":0.0000048217057,"threshold_uncertainty_score":0.5650971},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41867337,0.000031588206,0.48436606,0.00003592135,0.00006209039,0.00018691736,0.0000040699047,0.00012206724,0.09651792],"genre_scores_gemma":[0.99335635,3.806904e-7,0.004624003,0.000011834625,0.00059108005,0.000025986972,0.000029112598,0.000022383343,0.0013388549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990695,0.000022862501,0.0003844661,0.00015711485,0.00011657607,0.00024946433],"domain_scores_gemma":[0.9996452,0.00006699037,0.0000931043,0.00015209906,0.000023367975,0.000019235436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016231957,0.0001440805,0.00025285702,0.00008726093,0.000035036774,0.00006554424,0.00020515599,0.000043504835,0.0003916624],"category_scores_gemma":[0.0000019423342,0.00014173708,0.00012880653,0.0001966114,0.000027750275,0.000051563336,0.00009443555,0.0001718593,0.000023707902],"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.000006575785,0.0010759268,0.10298148,0.000034142777,0.00011697671,0.000015939397,0.0010965087,0.0017454458,0.0001637634,0.79734415,0.079189,0.016230062],"study_design_scores_gemma":[0.00040460925,0.000046034664,0.0054726014,0.00022712114,0.00009200605,0.000002993455,0.0004045322,0.62720454,0.0015344727,0.35470468,0.009163081,0.00074333826],"about_ca_topic_score_codex":0.00022163708,"about_ca_topic_score_gemma":0.00007235061,"teacher_disagreement_score":0.6254591,"about_ca_system_score_codex":0.00004089992,"about_ca_system_score_gemma":0.0000073153933,"threshold_uncertainty_score":0.577987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045345087,0.000022831246,0.89794457,0.00024048191,0.00061877706,0.00026805967,0.000002540311,0.00016364174,0.055394012],"genre_scores_gemma":[0.77897674,0.00002435107,0.21689165,0.00031167478,0.00011328491,0.00002586692,0.0000057499346,0.000018417239,0.0036322454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988118,0.00001593389,0.0003397684,0.0002858134,0.00024302272,0.00030370205],"domain_scores_gemma":[0.9990531,0.00006864408,0.000091034446,0.00067559065,0.000051967512,0.00005966702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040681838,0.00016170122,0.00022322968,0.0002868775,0.000029994286,0.00022494279,0.0014523298,0.00004718358,0.000068341644],"category_scores_gemma":[0.000037513542,0.00013513865,0.000075029144,0.0005245308,0.00008563303,0.00056227896,0.0004779884,0.00010218792,0.00061606173],"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.000049025628,0.0018746268,0.0024758205,0.00034943374,0.00021896296,0.00023979333,0.0161391,0.000015991809,0.00060927746,0.82178265,0.07001061,0.0862347],"study_design_scores_gemma":[0.0026554756,0.00034867198,0.0006542438,0.00027141283,0.000018918834,0.00003777616,0.00023183663,0.8917422,0.0030152479,0.07801739,0.022408485,0.0005983143],"about_ca_topic_score_codex":0.00004539295,"about_ca_topic_score_gemma":0.00007971174,"teacher_disagreement_score":0.89172626,"about_ca_system_score_codex":0.00001972417,"about_ca_system_score_gemma":0.0000105149065,"threshold_uncertainty_score":0.79184324},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022233648,0.00011220098,0.97470784,0.0013855358,0.00017951237,0.00024938668,0.0000040041687,0.00018026905,0.00094759394],"genre_scores_gemma":[0.6617534,0.0000052025066,0.33601797,0.00009862547,0.000024905416,0.00007427795,0.0000018431076,0.000009960734,0.0020138274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989576,0.000019940011,0.00036397597,0.00017150858,0.0002754094,0.00021158285],"domain_scores_gemma":[0.99814224,0.00062306854,0.00016586769,0.00080994575,0.00019952387,0.000059362697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008820571,0.00010541118,0.00031038918,0.00017574258,0.00002444981,0.00010586598,0.0019301171,0.000057180296,0.0000017352535],"category_scores_gemma":[0.0007863361,0.000067476474,0.00015191591,0.0008123965,0.0000650804,0.00008014687,0.00044334153,0.00006540506,0.000022866065],"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.00006594756,0.00026551404,0.00039068205,0.00006600094,0.0021387136,0.0000049177575,0.011174196,0.003480968,0.00017912258,0.68458,0.25373155,0.043922342],"study_design_scores_gemma":[0.0005234817,0.0001545615,0.00006417747,0.000028373941,0.00021648662,0.0000036532856,0.00026059605,0.8771107,0.0033609697,0.091405556,0.026719593,0.00015183998],"about_ca_topic_score_codex":0.000009317472,"about_ca_topic_score_gemma":0.000039845956,"teacher_disagreement_score":0.87362975,"about_ca_system_score_codex":0.00003491645,"about_ca_system_score_gemma":0.00002500179,"threshold_uncertainty_score":0.358667},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83506775,0.000014833149,0.15158926,0.0005171367,0.00031484358,0.00085426425,0.000030071164,0.000024153162,0.011587713],"genre_scores_gemma":[0.992927,0.0000020651232,0.0033165885,0.0001324751,0.000012393429,0.000025074412,6.675658e-7,0.00002119527,0.0035625133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881613,0.000030401889,0.0004538671,0.0001417401,0.00036751785,0.00019033764],"domain_scores_gemma":[0.9968224,0.0023648015,0.0002214247,0.0005309702,0.00003963215,0.00002074112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034831054,0.00015604694,0.00028268568,0.000036539794,0.000016835185,0.000034378627,0.00052707316,0.000057604153,0.00014399366],"category_scores_gemma":[0.0010463259,0.00007406308,0.00009500268,0.00015280301,0.000050690585,0.000046670684,0.00016742227,0.00019672303,0.00007008924],"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.000015299449,0.00029327747,0.000100956684,0.00022950933,0.000024620416,0.000001060373,0.001213285,0.00001736362,0.00015463488,0.99735945,0.00052425347,0.000066259745],"study_design_scores_gemma":[0.00029709397,0.00017125561,0.00021607926,0.0007400406,0.000027090737,0.0000056169997,0.00077995507,0.033489317,0.0029692906,0.961134,0.000054781292,0.000115469295],"about_ca_topic_score_codex":0.000011714053,"about_ca_topic_score_gemma":0.000048502752,"teacher_disagreement_score":0.15785931,"about_ca_system_score_codex":0.00005581482,"about_ca_system_score_gemma":0.000029313785,"threshold_uncertainty_score":0.30202046},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040819938,0.000029362795,0.9780398,0.0019214056,0.0008333419,0.0006033547,0.000008778083,0.000081647464,0.018074112],"genre_scores_gemma":[0.02220403,0.00025281246,0.91977924,0.002683451,0.008899318,0.0005382433,0.000013069407,0.0000670981,0.045562755],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992299,0.0000089479,0.00017883576,0.00021533637,0.00018016726,0.00018680388],"domain_scores_gemma":[0.99917716,0.00022003085,0.000067632085,0.00045205964,0.00004079229,0.00004230372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001865725,0.00012461528,0.00012221269,0.000059906204,0.000053069874,0.0005183218,0.0009153594,0.000028431376,0.00009464759],"category_scores_gemma":[0.000020514373,0.000078139616,0.000048784234,0.00008980009,0.000045244517,0.00050435594,0.00032713244,0.000067234185,0.0002454458],"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.0000011261552,0.000103524755,0.0000011136759,0.000040996452,0.00004385576,0.0000016581719,0.0011211506,0.000043105712,0.0000034597667,0.32540023,0.45755023,0.21568955],"study_design_scores_gemma":[0.00016462324,0.00007674879,0.000007125424,0.000024300392,0.000008566512,0.0000031362615,0.00008267877,0.80735695,0.000056237648,0.11039176,0.08173065,0.00009720103],"about_ca_topic_score_codex":0.0000140263155,"about_ca_topic_score_gemma":0.000003686036,"teacher_disagreement_score":0.80731386,"about_ca_system_score_codex":0.000008221814,"about_ca_system_score_gemma":0.000005233585,"threshold_uncertainty_score":0.49981892},"labels":[],"label_agreement":null}]}