{"meta":{"query_hash":"6aa74f43c8e5","filters":{"topic":"Graph Theory and Algorithms"},"cohort_total":423,"direct_labels_cover":2,"predictions_cover":423,"exported":423,"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/6aa74f43c8e5","api":"https://metacan.xera.ac/api/v1/cohort?topic=Graph+Theory+and+Algorithms"},"results":[{"id":"W11851375","doi":"10.1007/978-3-319-10596-3_6","title":"WGB: Towards a Universal Graph Benchmark","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Graph; Theoretical computer science; Graph database; RDF; Benchmark (surveying); Database; Artificial intelligence; Semantic Web","score_opus":0.009328611411771322,"score_gpt":0.21340468001322607,"score_spread":0.20407606860145475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W11851375","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.00008994073,0.00024316623,0.98248523,0.000580708,0.002743158,0.00025924007,0.000005927295,0.00024235793,0.013350282],"genre_scores_gemma":[0.2953308,0.00008764894,0.69733953,0.0039650793,0.0012284128,0.00001140501,0.000014333436,0.00008325798,0.0019395347],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99575526,0.000072929644,0.00045788364,0.0017959658,0.001071527,0.00084641454],"domain_scores_gemma":[0.99707556,0.00035291808,0.00027252446,0.0017814947,0.00022942261,0.00028805924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012642411,0.000651509,0.00061323517,0.0012966533,0.00036724273,0.0005497445,0.005344713,0.0003811438,0.000049632894],"category_scores_gemma":[0.000059566122,0.0005938884,0.00027178842,0.0010065313,0.0011712201,0.000556666,0.0016222742,0.0009689104,0.0000738248],"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.0000043325645,0.000024226223,0.000009867433,0.000020653368,0.0000133240665,0.00010786395,0.00047509657,0.0038301267,0.000035277182,0.31910935,0.000033826796,0.67633605],"study_design_scores_gemma":[0.00042769453,0.0003690346,0.00008481291,0.00028910843,0.000011988692,0.000103240556,2.0409071e-7,0.17772949,0.0006177095,0.8141798,0.0052219806,0.0009649469],"about_ca_topic_score_codex":0.000021141592,"about_ca_topic_score_gemma":0.000025453366,"teacher_disagreement_score":0.6753711,"about_ca_system_score_codex":0.00017231693,"about_ca_system_score_gemma":0.0004978191,"threshold_uncertainty_score":0.99965125},"labels":[],"label_agreement":null},{"id":"W135963718","doi":"10.1007/978-3-642-38868-2_32","title":"Diffeomorphic Spectral Matching of Cortical Surfaces","year":2013,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Villum Fonden","keywords":"Computer science; Polygon mesh; Diffeomorphism; Atlas (anatomy); Vertex (graph theory); Algorithm; Graph; Theoretical computer science; Computer graphics (images); Mathematics; Pure mathematics","score_opus":0.009230270406521118,"score_gpt":0.22561396494366145,"score_spread":0.21638369453714035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135963718","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.4461074,0.00003169805,0.55299175,0.00034484643,0.00037859348,0.000089637986,3.0172882e-7,0.000044447064,0.000011381115],"genre_scores_gemma":[0.73199326,0.000001772075,0.26770616,0.00024748113,0.000043775242,0.0000033253168,1.3773119e-7,0.0000036137737,5.0125755e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806464,0.0000979767,0.00029878152,0.00055635086,0.00047240147,0.0005098806],"domain_scores_gemma":[0.9986332,0.0004620442,0.00008902319,0.0005939882,0.00009737396,0.00012438555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068180705,0.00016664845,0.00023488444,0.0002554106,0.00016349634,0.00027097293,0.0019208943,0.000054190863,0.000023982506],"category_scores_gemma":[0.00007241254,0.00013275597,0.00006072725,0.0015530849,0.0005894588,0.00086820277,0.00050151284,0.00029922227,0.00002760984],"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.000011193295,0.00040956592,0.019629013,0.00006588752,0.000018577732,0.00007057465,0.007856832,0.1523804,0.11609113,0.064956464,0.000008988801,0.63850135],"study_design_scores_gemma":[0.00015027774,0.00012519075,0.037537143,0.000037005495,0.0000011782477,0.00003201019,0.0000012599644,0.6626872,0.037887584,0.26136634,9.639342e-7,0.00017384908],"about_ca_topic_score_codex":0.000072365576,"about_ca_topic_score_gemma":0.000011199145,"teacher_disagreement_score":0.63832754,"about_ca_system_score_codex":0.000029897301,"about_ca_system_score_gemma":0.000084495376,"threshold_uncertainty_score":0.5413632},"labels":[],"label_agreement":null},{"id":"W1481730931","doi":"10.1007/3-540-45028-9_20","title":"A New Median Graph Algorithm","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Graph; Cluster analysis; Algorithm; Simplex graph; Strength of a graph; Graph bandwidth; Theoretical computer science; Line graph; Voltage graph; Artificial intelligence","score_opus":0.01051008868913729,"score_gpt":0.2209969182802593,"score_spread":0.21048682959112203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481730931","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.000002139358,0.0007412716,0.98814815,0.0012177271,0.0042729424,0.00032615077,0.0000058767505,0.00023332563,0.0050524045],"genre_scores_gemma":[0.0007079459,0.000069778005,0.99369,0.0035116025,0.0006259992,0.0000060880984,0.0000043117934,0.00004442711,0.0013398628],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99520594,0.000061660845,0.00056218274,0.0019607823,0.0012190132,0.0009903953],"domain_scores_gemma":[0.9967954,0.00035889682,0.000270741,0.0018670093,0.00018127105,0.00052669324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010776448,0.00073148205,0.00064330385,0.0013965466,0.00032821545,0.0006547943,0.0047913752,0.00043261115,0.000078928955],"category_scores_gemma":[0.000058081172,0.00066991,0.0002672187,0.0013447593,0.0007065758,0.0007614724,0.0009121226,0.0011053924,0.00011100613],"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.0000011171267,0.0000141226865,0.000003932916,0.000008516953,0.000011672132,0.00015490594,0.0004210198,0.0010485626,0.000015269294,0.06500584,0.00012064535,0.9331944],"study_design_scores_gemma":[0.00031073214,0.00015025133,0.000013080876,0.00018836092,0.000008504978,0.00018310966,1.2128993e-7,0.091550484,0.00076063,0.9004456,0.005556386,0.0008327823],"about_ca_topic_score_codex":0.00002204973,"about_ca_topic_score_gemma":0.00002963849,"teacher_disagreement_score":0.9323616,"about_ca_system_score_codex":0.0001534781,"about_ca_system_score_gemma":0.0007132425,"threshold_uncertainty_score":0.9995752},"labels":[],"label_agreement":null},{"id":"W1502107550","doi":"10.1007/978-3-540-31988-7_24","title":"Asymmetric Inexact Matching of Spatially-Attributed Graphs","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Vertex (graph theory); Matching (statistics); Graph; Algorithm; Theoretical computer science; Mathematics","score_opus":0.012461472487726164,"score_gpt":0.23159854235415794,"score_spread":0.21913706986643178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502107550","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.00022104771,0.0007094218,0.9941859,0.00028552997,0.0014671664,0.00031377477,0.000013620758,0.00016309149,0.0026404273],"genre_scores_gemma":[0.42898542,0.000111562025,0.56944704,0.00088851835,0.00032865768,0.000005837297,0.000010174021,0.00004577039,0.00017702207],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99578977,0.000072905714,0.00079392485,0.0014052271,0.0012081303,0.00073006755],"domain_scores_gemma":[0.99668145,0.00072524225,0.0005452627,0.0015319004,0.00031738804,0.00019874261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016137534,0.0006049874,0.0007990714,0.0026675763,0.0002224489,0.00030326477,0.004501231,0.00035447063,0.00002672209],"category_scores_gemma":[0.000108876404,0.00055015116,0.00027596825,0.0023593246,0.00069725316,0.00076707476,0.0013378101,0.00094253675,0.000028234148],"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.0000052692103,0.000052747266,0.000041305153,0.000037059268,0.000022895865,0.00005383774,0.00039402838,0.040710296,0.000162516,0.12494832,0.0000060065263,0.8335657],"study_design_scores_gemma":[0.0004180893,0.0002488998,0.0002687844,0.00040498213,0.000016094178,0.000078983576,1.0223323e-7,0.20524837,0.003997357,0.7877284,0.00074773,0.00084219],"about_ca_topic_score_codex":0.000035784407,"about_ca_topic_score_gemma":0.00003908176,"teacher_disagreement_score":0.8327235,"about_ca_system_score_codex":0.000140725,"about_ca_system_score_gemma":0.0003812559,"threshold_uncertainty_score":0.999695},"labels":[],"label_agreement":null},{"id":"W1509049977","doi":"","title":"CONCUR 2008 - Concurrency Theory: 19th International Conference, CONCUR 2008, Toronto, Canada, August 19-22, 2008, Proceedings","year":2008,"lang":"en","type":"book","venue":"CERN Document Server (European Organization for Nuclear Research)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Concurrency; Bisimulation; Computer science; Process calculus; Programming language; Library science","score_opus":0.02301145535778053,"score_gpt":0.24912588220401044,"score_spread":0.2261144268462299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509049977","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027224587,0.002597747,0.001146784,0.002595058,0.0058778743,0.0041796104,0.00040488417,0.0018738791,0.9786017],"genre_scores_gemma":[0.14738725,0.0023320562,0.00012922879,0.0011950155,0.00121164,0.0000102419845,0.002469866,0.0008649919,0.8443997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99391043,0.0004715863,0.00094483205,0.0015545931,0.002020232,0.0010983308],"domain_scores_gemma":[0.99463546,0.0001486468,0.00068267353,0.00094194984,0.0028316355,0.0007596228],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016091671,0.00078131096,0.00066389324,0.00035965012,0.0016319073,0.0017121088,0.0058133,0.00030609904,0.018449072],"category_scores_gemma":[0.0004552401,0.00081720995,0.00021214374,0.00057461485,0.0006342126,0.0019948906,0.0024592993,0.0010061441,0.0013033696],"study_design_candidate":"not_applicable","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.000028632987,0.00006641251,0.000011744506,0.00007896129,0.00016192609,0.00006755047,0.0006063181,0.0000034435106,0.000004713897,0.58808994,0.41010585,0.0007745053],"study_design_scores_gemma":[0.001724646,0.0003214891,0.00016461869,0.00027772642,0.000048681304,0.0001834433,0.00031952895,0.00009846825,0.00008727642,0.05060464,0.9450523,0.0011171293],"about_ca_topic_score_codex":0.005503292,"about_ca_topic_score_gemma":0.0014313862,"teacher_disagreement_score":0.5374853,"about_ca_system_score_codex":0.002038775,"about_ca_system_score_gemma":0.0013710103,"threshold_uncertainty_score":0.9996678},"labels":[],"label_agreement":null},{"id":"W1538503321","doi":"10.1007/978-1-4757-3145-3_25","title":"Continuous-based Heuristics for Graph and Tree Isomorphisms, with Application to Computer Vision","year":2000,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Heuristics; Clique; Quadratic programming; Computer science; Quadratic equation; Theoretical computer science; Clique problem; Graph; Mathematics; Mathematical optimization; Combinatorics; Line graph; Pathwidth","score_opus":0.0065908144910859345,"score_gpt":0.2189472659255289,"score_spread":0.21235645143444298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538503321","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.000003720334,0.00024626675,0.98751616,0.0009716154,0.000039214847,0.0024134142,0.00012931148,0.00018104157,0.008499267],"genre_scores_gemma":[0.004475737,0.0010183434,0.97161925,0.0035794612,0.00035112054,0.0018347978,0.00096088846,0.00014523492,0.016015183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840295,0.000017460567,0.0003615058,0.00081668806,0.00019697547,0.00020443574],"domain_scores_gemma":[0.9985197,0.00017360212,0.00023125093,0.00053128076,0.000314882,0.00022924758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012044636,0.00035259384,0.0003545952,0.0002898613,0.00035767144,0.00020843768,0.0003594116,0.00022564379,0.000026911552],"category_scores_gemma":[0.0000031903708,0.00033168742,0.000060636743,0.00017980038,0.00010645252,0.00017526654,0.00006933584,0.0001466295,0.000020002115],"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.000049977058,0.0000746636,0.0000022034876,0.00006835811,0.000036374884,9.575942e-7,0.000087767876,0.029665679,0.000020406438,0.8157183,0.0006569796,0.1536183],"study_design_scores_gemma":[0.0009676127,0.00053215947,0.000013102847,0.000089996785,0.000078837686,0.000015495023,0.0000033456456,0.7919625,0.00004887458,0.02374096,0.18196192,0.00058520236],"about_ca_topic_score_codex":0.0000011614508,"about_ca_topic_score_gemma":0.0000034363816,"teacher_disagreement_score":0.79197735,"about_ca_system_score_codex":0.000020331487,"about_ca_system_score_gemma":0.000061092185,"threshold_uncertainty_score":0.9999135},"labels":[],"label_agreement":null},{"id":"W1561697759","doi":"10.1007/978-3-642-12139-5_11","title":"Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Heuristics; Greedy algorithm; Computer science; Vertex (graph theory); Matching (statistics); Algorithm; Similarity (geometry); Similarity measure; Exploit; Combinatorics; Graph; Mathematics; Mathematical optimization; Theoretical computer science; Artificial intelligence","score_opus":0.017381246323120266,"score_gpt":0.24699092596909517,"score_spread":0.2296096796459749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1561697759","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.00014584354,0.0004904451,0.99517494,0.00015209314,0.0028472368,0.0007407743,0.000048285056,0.0002544833,0.0001459216],"genre_scores_gemma":[0.0073907753,0.00002021657,0.9910739,0.0008715534,0.00048321445,0.000021790307,0.000010674357,0.00006202338,0.000065827524],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949478,0.000061447354,0.00070169766,0.0020646837,0.0010935882,0.0011308078],"domain_scores_gemma":[0.9968438,0.00063909066,0.00045410098,0.0014245168,0.00036524332,0.00027324626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026530183,0.0008009283,0.0007863881,0.0008928267,0.00096023857,0.0010280097,0.0038418327,0.00059760624,0.0000076140864],"category_scores_gemma":[0.00008369388,0.00075458403,0.00032472407,0.00069351285,0.0008487841,0.0009900986,0.0011139472,0.001539491,0.000004208995],"study_design_candidate":"design_other","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.0000058103897,0.000055754965,0.000002834795,0.00008198664,0.000031069823,0.000035473506,0.0012121461,0.004472139,0.016579902,0.013011133,0.000004978538,0.96450675],"study_design_scores_gemma":[0.00023855617,0.00007194505,9.849905e-7,0.00024243852,0.0000142040135,0.0000674639,3.7841212e-7,0.41714782,0.02673991,0.55448776,0.00029036377,0.0006981956],"about_ca_topic_score_codex":0.000035380173,"about_ca_topic_score_gemma":0.000056031597,"teacher_disagreement_score":0.9638086,"about_ca_system_score_codex":0.00015320371,"about_ca_system_score_gemma":0.00041112365,"threshold_uncertainty_score":0.9994905},"labels":[],"label_agreement":null},{"id":"W1568489636","doi":"10.1007/978-3-540-24595-7_48","title":"GLuskap: Visualization and Manipulation of Graph Drawings in 3-Dimensions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph drawing; Visualization; Computer graphics (images); Graph; Engineering drawing; Theoretical computer science; Artificial intelligence","score_opus":0.012635708927529249,"score_gpt":0.24246090299937778,"score_spread":0.22982519407184854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568489636","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.004153777,0.00029272627,0.99428296,0.00011021915,0.0005053484,0.0002477057,0.0000016490258,0.000054071636,0.0003515383],"genre_scores_gemma":[0.8987259,0.00004691783,0.100865655,0.00026612164,0.000050941013,0.0000027981998,0.0000042265297,0.000015100463,0.000022343753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786454,0.000033601616,0.0004500861,0.00084544666,0.0004984977,0.00030780767],"domain_scores_gemma":[0.9988218,0.00019082612,0.00023647716,0.0005444408,0.00012747924,0.00007900364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066571066,0.0002860721,0.00035083463,0.0012700799,0.00012746903,0.00013647538,0.0008927056,0.00020732504,0.000005639328],"category_scores_gemma":[0.00004111584,0.0002754503,0.0000638797,0.0009056044,0.0005142279,0.000562676,0.00051077583,0.00031183276,0.0000024213016],"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.00000500038,0.000039018098,0.00031055487,0.000053882377,0.0000051043025,0.000036223344,0.0022539722,0.04804215,0.00050577347,0.8254649,6.0120055e-7,0.12328281],"study_design_scores_gemma":[0.00026325695,0.00009733662,0.0010572141,0.00046501175,0.000003818726,0.000022650112,2.850139e-7,0.20782374,0.0014853355,0.7884885,0.000014461479,0.0002783613],"about_ca_topic_score_codex":0.000035709636,"about_ca_topic_score_gemma":0.000048042453,"teacher_disagreement_score":0.89457214,"about_ca_system_score_codex":0.00009325498,"about_ca_system_score_gemma":0.0001774663,"threshold_uncertainty_score":0.9999698},"labels":[],"label_agreement":null},{"id":"W1600072790","doi":"","title":"Algorithms and Models for the Web-Graph: Fourth International Workshop, WAW 2006, Banff, Canada, November 30 - December 1, 2006. Revised Papers","year":2007,"lang":"en","type":"book","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"PageRank; Computer science; Information retrieval; Graph; Data mining; Clustering coefficient; Cluster analysis; Link analysis; Heuristics; Theoretical computer science; Machine learning","score_opus":0.016873357480758876,"score_gpt":0.23295521843242706,"score_spread":0.21608186095166818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600072790","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003426577,0.0017627883,0.5687956,0.0020632436,0.002514929,0.00087739906,0.00027431373,0.00012512134,0.42358315],"genre_scores_gemma":[0.00028750766,0.00078868633,0.03984534,0.005963807,0.000836064,0.00012081212,0.00011980224,0.000091323716,0.9519467],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964571,0.00005938641,0.0006620352,0.0010927567,0.0009560622,0.0007726628],"domain_scores_gemma":[0.99677056,0.001198906,0.0003189824,0.001039145,0.0003598773,0.0003125406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009892103,0.0006867903,0.0005522928,0.0002694959,0.00042352668,0.0004176751,0.0021768555,0.00039785734,0.00058851857],"category_scores_gemma":[0.00004570457,0.00049315125,0.00034536485,0.0002673875,0.00026141436,0.00037744487,0.00046016005,0.00064143084,0.000013603547],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003385681,0.000039103703,0.000005191244,0.00003985984,0.0004338133,0.000048624457,0.00011414849,0.0014226768,0.0000030753,0.29429054,0.62879795,0.07477114],"study_design_scores_gemma":[0.00091270666,0.00003164549,0.000012825419,0.00015527997,0.00008634705,0.00005184034,0.000036403915,0.20028469,0.000010339264,0.061169475,0.73646736,0.0007811052],"about_ca_topic_score_codex":0.004927985,"about_ca_topic_score_gemma":0.08325196,"teacher_disagreement_score":0.5289503,"about_ca_system_score_codex":0.00020979534,"about_ca_system_score_gemma":0.0011368158,"threshold_uncertainty_score":0.999752},"labels":[],"label_agreement":null},{"id":"W1601544768","doi":"10.1007/978-3-540-27868-9_34","title":"A Comparison of Least Squares and Spectral Methods for Attributed Graph Matching","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Least-squares function approximation; Graph; Matching (statistics); Computer science; Algorithm; Non-linear least squares; Permutation (music); Mathematics; Theoretical computer science; Statistics; Estimation theory","score_opus":0.031221583596837552,"score_gpt":0.33534794986363287,"score_spread":0.3041263662667953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601544768","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.00032975452,0.0010283237,0.996611,0.0002512727,0.0009347496,0.00048680045,0.000014350998,0.00009863182,0.0002450924],"genre_scores_gemma":[0.17780697,0.00001441269,0.8218745,0.00015285675,0.000098251934,0.000007648468,0.0000042310144,0.000019968273,0.000021131083],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708825,0.00007471154,0.0006198773,0.0011941916,0.00043946883,0.00058347965],"domain_scores_gemma":[0.99750394,0.0009589611,0.00039050687,0.0007948354,0.00019831433,0.000153473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016174746,0.00047275014,0.0008594081,0.00084448786,0.0002828121,0.00029230633,0.0020493409,0.00025285312,0.000005714253],"category_scores_gemma":[0.00007522014,0.00042769354,0.00020705466,0.00060050713,0.00092136406,0.00042532233,0.00069870724,0.0005696855,0.0000012791714],"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.000015379159,0.000053078442,0.00006128213,0.00012938172,0.000026657764,0.000009304401,0.002167989,0.030287463,0.0010674506,0.36570334,0.0000016918162,0.600477],"study_design_scores_gemma":[0.00039132356,0.00032331364,0.00015728646,0.00036526757,0.000015213385,0.00004445457,9.435691e-7,0.11902023,0.007768233,0.87140495,0.00006536271,0.0004434156],"about_ca_topic_score_codex":0.00002004199,"about_ca_topic_score_gemma":0.0000148253985,"teacher_disagreement_score":0.6000336,"about_ca_system_score_codex":0.000089647605,"about_ca_system_score_gemma":0.00029451068,"threshold_uncertainty_score":0.9998175},"labels":[],"label_agreement":null},{"id":"W1601799968","doi":"10.1007/978-3-540-39924-7_20","title":"CGMgraph/CGMlib: Implementing and Testing CGM Graph Algorithms on PC Clusters","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Implementation; Bipartite graph; Graph; Graph algorithms; Parallel computing; Algorithm; Theoretical computer science; Programming language","score_opus":0.021437050904723785,"score_gpt":0.24369033423032746,"score_spread":0.22225328332560368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1601799968","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.00043300778,0.000376746,0.99191713,0.00056726957,0.0017272109,0.00046389198,0.000008796442,0.00026348396,0.0042424533],"genre_scores_gemma":[0.07855859,0.00008678233,0.91271645,0.0075655244,0.0006029975,0.000027539161,0.0000081969665,0.000121345125,0.00031258215],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99429375,0.000102655904,0.0007190738,0.002356411,0.0010781961,0.001449898],"domain_scores_gemma":[0.9964975,0.0011036479,0.00044212682,0.001405544,0.0002307914,0.000320357],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024294376,0.00084845064,0.00067421,0.001605894,0.0009977068,0.0011406299,0.0026704904,0.0003184173,0.000010125815],"category_scores_gemma":[0.00016386627,0.0007818984,0.00019181076,0.0014883124,0.0009724107,0.0007026659,0.0015264256,0.0011573685,0.000014288],"study_design_candidate":"design_other","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.00000455409,0.000035609854,0.00014069639,0.00004509021,0.00002549167,0.0001431234,0.0006329804,0.0037887027,0.000096363015,0.06466253,0.000017695038,0.93040717],"study_design_scores_gemma":[0.0007035473,0.0005497813,0.00014578394,0.00075514725,0.000022048285,0.00027063664,0.0000015112788,0.2752013,0.0014051928,0.71782804,0.0015997214,0.0015173331],"about_ca_topic_score_codex":0.000016157477,"about_ca_topic_score_gemma":0.000013875355,"teacher_disagreement_score":0.9288898,"about_ca_system_score_codex":0.000114778624,"about_ca_system_score_gemma":0.00018798374,"threshold_uncertainty_score":0.9998963},"labels":[],"label_agreement":null},{"id":"W1607308244","doi":"10.1007/978-3-540-27868-9_16","title":"An Optimal Probabilistic Graphical Model for Point Set Matching","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Graphical model; Computer science; Probabilistic logic; Algorithm; Graph; Pairwise comparison; Theoretical computer science; Artificial intelligence","score_opus":0.019095337313483104,"score_gpt":0.25746983457008327,"score_spread":0.23837449725660015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607308244","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.00035998542,0.0000791409,0.99695677,0.00049253023,0.0008898931,0.00073911593,0.000026409463,0.00025590012,0.00020026258],"genre_scores_gemma":[0.29568967,0.0000046371765,0.70311856,0.00085123134,0.00022738513,0.000026963433,0.000010833131,0.000035465382,0.000035236302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582285,0.000037990372,0.00054641825,0.0019626454,0.00077232806,0.0008577759],"domain_scores_gemma":[0.9973276,0.0003677208,0.0002262083,0.0015368769,0.00023926875,0.00030232407],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014168672,0.0006175642,0.00056238513,0.0007466593,0.00044800172,0.00071981526,0.004111448,0.00036810484,0.000008170758],"category_scores_gemma":[0.000055597484,0.0005542688,0.00024869357,0.00047491,0.0008512259,0.0010134975,0.00071781414,0.0008413267,0.000007381335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009474412,0.000033313743,6.9118727e-7,0.000035763267,0.000005303717,0.000022859005,0.0011980891,0.6136825,0.00004296307,0.3334084,0.0000011047913,0.051559553],"study_design_scores_gemma":[0.00017464787,0.00016660603,0.0000027485185,0.00012646023,0.000005266393,0.00003626707,1.375085e-7,0.50353044,0.0001014025,0.49549216,0.000006882415,0.00035698456],"about_ca_topic_score_codex":0.0000056963427,"about_ca_topic_score_gemma":0.000016558777,"teacher_disagreement_score":0.2953297,"about_ca_system_score_codex":0.00021237548,"about_ca_system_score_gemma":0.00069035566,"threshold_uncertainty_score":0.9996909},"labels":[],"label_agreement":null},{"id":"W1704319585","doi":"10.1145/2714568","title":"A Distributed Algorithm for Large-Scale Graph Partitioning","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Autonomous and Adaptive Systems","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Stiftelsen för Strategisk Forskning","keywords":"Computer science; Graph partition; Distributed algorithm; Algorithm; Vertex (graph theory); Graph; Theoretical computer science; Distributed computing","score_opus":0.028595173439524713,"score_gpt":0.24579197994502552,"score_spread":0.2171968065055008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1704319585","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.00056233734,0.00024289092,0.9970406,0.00024242856,0.0007326475,0.00043124336,0.00040144403,0.00022707946,0.00011930277],"genre_scores_gemma":[0.8637525,0.00001468064,0.13511099,0.00010618218,0.00009488642,0.00039765675,0.000029197497,0.000020931107,0.0004729675],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987304,0.000095451964,0.00025099333,0.0004216392,0.00015922174,0.00034225607],"domain_scores_gemma":[0.9989612,0.0001339035,0.00008691531,0.00043977745,0.00014811665,0.00023005159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046825266,0.00018445132,0.00023735665,0.00012573405,0.00043645097,0.0001932287,0.00035890075,0.00007945804,0.0000025149611],"category_scores_gemma":[0.000010436611,0.00016771923,0.00011265873,0.00031068752,0.00004981708,0.00038600827,0.000013972033,0.00013529096,0.0000120459545],"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.00012725049,0.0014343156,0.0000663325,0.000086953,0.0005466339,0.00004345993,0.008109953,0.025117455,0.0001387293,0.32724944,0.0008876836,0.6361918],"study_design_scores_gemma":[0.0023776018,0.001073851,0.00012083424,0.0001016023,0.000052243122,0.00009167944,0.003388238,0.93353844,0.0005836462,0.037395295,0.020713337,0.0005632432],"about_ca_topic_score_codex":0.00003869158,"about_ca_topic_score_gemma":0.000011387366,"teacher_disagreement_score":0.908421,"about_ca_system_score_codex":0.00004901057,"about_ca_system_score_gemma":0.00006318537,"threshold_uncertainty_score":0.6839392},"labels":[],"label_agreement":null},{"id":"W1736267627","doi":"","title":"Conditional Fault Hamiltonicity of the Star Graph","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Star (game theory); Mathematics; Graph; Combinatorics","score_opus":0.006745557873233054,"score_gpt":0.20725412931379278,"score_spread":0.20050857144055972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1736267627","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.977791,0.00003460923,0.016651433,0.0004546375,0.0023594582,0.00011908587,0.000008430525,0.00007762367,0.002503724],"genre_scores_gemma":[0.99862266,0.0000016357601,0.0010366298,0.00025752894,0.0000052168925,0.0000051590287,0.0000018488012,0.000004182423,0.000065135006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902815,0.00016677508,0.00016483135,0.0001939631,0.00027856644,0.00016773965],"domain_scores_gemma":[0.9990317,0.0001512247,0.00010205322,0.0005734938,0.00009177428,0.000049711012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040856865,0.000092419745,0.00012410463,0.000043995686,0.00016229681,0.000029435581,0.0010124665,0.00004410565,0.000012827204],"category_scores_gemma":[0.000060367343,0.000067195826,0.00011157025,0.00037195854,0.00015828009,0.0001808433,0.00020063405,0.00013111524,0.000016222128],"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.0000014906803,0.00005820013,0.0007570729,0.0000042870843,0.000010985981,4.4075335e-7,0.0001084726,0.00002671575,0.00034994405,0.99785244,0.00038900212,0.0004409368],"study_design_scores_gemma":[0.00036079026,0.00005250063,0.018761275,0.000009862883,0.0000039238057,0.0000031059308,0.0000070363717,0.0036125346,0.0064178845,0.96972865,0.00095659285,0.00008585],"about_ca_topic_score_codex":0.000009372044,"about_ca_topic_score_gemma":0.0000010694444,"teacher_disagreement_score":0.028123807,"about_ca_system_score_codex":0.000009734746,"about_ca_system_score_gemma":0.000030982577,"threshold_uncertainty_score":0.27401662},"labels":[],"label_agreement":null},{"id":"W1800611079","doi":"10.48550/arxiv.0904.0471","title":"Holographic algorithms without matchgates","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bipartite graph; Algorithm; Time complexity; Counting problem; Pfaffian; Computer science; Context (archaeology); Mathematics; Algebraic number; Theoretical computer science; Graph; Combinatorics","score_opus":0.03414086393585864,"score_gpt":0.2697213165234733,"score_spread":0.23558045258761467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1800611079","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.70006806,0.0013838931,0.2891484,0.0016536964,0.0031372048,0.0005385875,0.000018383951,0.0012978071,0.0027539798],"genre_scores_gemma":[0.9484675,0.0002916129,0.04891229,0.0011942419,0.0004824499,0.00006781571,0.00003212971,0.00004216577,0.0005097966],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664724,0.00026663614,0.0005207147,0.0014144911,0.00041336048,0.0007375628],"domain_scores_gemma":[0.9970074,0.00008799027,0.0003394044,0.0021626984,0.00015190111,0.00025054923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007433045,0.0006193748,0.00065026607,0.00042653832,0.00025408424,0.00030126248,0.0032446482,0.0005090026,0.000027858903],"category_scores_gemma":[0.000040903607,0.00056861766,0.0004399032,0.0006725491,0.00022407132,0.00036446174,0.0016621328,0.0012636774,0.0003537171],"study_design_candidate":"observational","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.00005911536,0.0015234903,0.6756895,0.00046077668,0.0009642626,0.0013051298,0.0042176675,0.0024033398,0.0016463626,0.114767924,0.003628318,0.19333412],"study_design_scores_gemma":[0.0008076748,0.0002997027,0.28629375,0.0004296323,0.000100621684,0.00012720472,0.00005459829,0.01660459,0.0036836087,0.68689114,0.0026686678,0.0020387971],"about_ca_topic_score_codex":0.00003936337,"about_ca_topic_score_gemma":0.0000033406302,"teacher_disagreement_score":0.5721232,"about_ca_system_score_codex":0.000031739615,"about_ca_system_score_gemma":0.00010330365,"threshold_uncertainty_score":0.9996765},"labels":[],"label_agreement":null},{"id":"W1824139226","doi":"10.1007/978-3-540-74126-8_14","title":"A Graph Clustering Approach to Weak Motif Recognition","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Motif (music); Cluster analysis; Computer science; Artificial intelligence; Pattern recognition (psychology); Art; Aesthetics","score_opus":0.03318239396176013,"score_gpt":0.24489424534870285,"score_spread":0.21171185138694273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1824139226","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.000055586654,0.00012706095,0.9705759,0.00016504568,0.0019256298,0.0005159293,0.000006110807,0.00025627782,0.026372435],"genre_scores_gemma":[0.021955254,0.000015614023,0.9750874,0.002011679,0.00053732673,0.000016388956,0.000009480655,0.000043111304,0.00032376574],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956494,0.000044644767,0.0005450627,0.0018992069,0.0009703546,0.000891346],"domain_scores_gemma":[0.9976203,0.00027684093,0.00020647616,0.0013278592,0.00023152446,0.00033703793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017735575,0.0005898226,0.0005040637,0.0019582831,0.0003332572,0.00059819163,0.003435782,0.0003499294,0.0000114690365],"category_scores_gemma":[0.000062017,0.000563118,0.00019262616,0.0014630463,0.00044463028,0.0006388396,0.0014733108,0.00088364247,0.00010623122],"study_design_candidate":"design_other","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.00000738607,0.0000423314,0.000004602378,0.00003569405,0.000009518776,0.000035543435,0.00084111065,0.01574951,0.000066081826,0.013908321,0.0000094805355,0.96929044],"study_design_scores_gemma":[0.00031508956,0.0002560046,0.00008125796,0.00052101235,0.000010672324,0.00023375308,7.608387e-7,0.46419442,0.00096959656,0.5313061,0.0008711706,0.001240203],"about_ca_topic_score_codex":0.000012104369,"about_ca_topic_score_gemma":0.000027007982,"teacher_disagreement_score":0.96805024,"about_ca_system_score_codex":0.00016995562,"about_ca_system_score_gemma":0.00016226589,"threshold_uncertainty_score":0.999682},"labels":[],"label_agreement":null},{"id":"W1831273253","doi":"10.1007/978-3-642-12200-2_17","title":"Compact Rich-Functional Binary Relation Representations","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Binary relation; Binary number; Redundancy (engineering); Relation (database); Theoretical computer science; Data structure; Set operations; Binary data; Abstraction; Representation (politics); Set (abstract data type); Algorithm; Data mining; Mathematics; Arithmetic; Discrete mathematics; Programming language","score_opus":0.018980754201399917,"score_gpt":0.25070494378175323,"score_spread":0.23172418958035332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1831273253","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.00038537814,0.0001261656,0.98716044,0.0011105926,0.003641487,0.0002743994,0.000006579433,0.00021678227,0.0070782006],"genre_scores_gemma":[0.4423233,0.000031007618,0.5521997,0.0016948013,0.0013886967,0.000012731716,0.000054211527,0.00006088839,0.0022346394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967385,0.000052573156,0.00046025123,0.0013417151,0.0009272313,0.00047971905],"domain_scores_gemma":[0.9972471,0.0006437019,0.00028541582,0.0013951816,0.00025057743,0.00017800959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088041235,0.00041714724,0.00034938313,0.0010327372,0.0005846906,0.0004508878,0.0020580336,0.00036361304,0.000095282834],"category_scores_gemma":[0.00009931253,0.0003887469,0.00015609013,0.00084333756,0.0008411598,0.0010186633,0.00058546255,0.0013794723,0.00012906412],"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.000021590666,0.00015010845,0.0006816902,0.00003697284,0.00004564994,0.00021680028,0.0018609659,0.14965945,0.003930511,0.55170745,0.0001544985,0.2915343],"study_design_scores_gemma":[0.00024653893,0.00010935935,0.004400619,0.00011367485,0.000009235258,0.00012293585,1.808714e-7,0.2679859,0.001366891,0.7240794,0.0010088636,0.0005564493],"about_ca_topic_score_codex":0.000010679984,"about_ca_topic_score_gemma":0.000017957407,"teacher_disagreement_score":0.44193792,"about_ca_system_score_codex":0.00012530119,"about_ca_system_score_gemma":0.0003832912,"threshold_uncertainty_score":0.9998565},"labels":[],"label_agreement":null},{"id":"W1842941715","doi":"10.1007/3-540-70659-3_30","title":"A New Algorithm for Graph Matching with Application to Content-Based Image Retrieval","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Matching (statistics); Blossom algorithm; Graph; Image retrieval; Algorithm; 3-dimensional matching; Image (mathematics); Content-based image retrieval; Process (computing); Optimal matching; Pattern recognition (psychology); Artificial intelligence; Theoretical computer science; Mathematics; Bipartite graph","score_opus":0.014888319704092864,"score_gpt":0.23069296074358528,"score_spread":0.21580464103949243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1842941715","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.000016266093,0.00009453737,0.9966219,0.00095255155,0.00063191465,0.0012456428,0.000018020699,0.00022203852,0.00019711065],"genre_scores_gemma":[0.0013237661,0.0000033271685,0.9959627,0.0019535348,0.00034028,0.000027880464,0.000008434013,0.00004289663,0.00033722213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962481,0.000026896198,0.00043979738,0.0017143633,0.00086050667,0.0007103155],"domain_scores_gemma":[0.99729383,0.00043655562,0.00027089074,0.00129975,0.00034416624,0.00035482485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075839274,0.0005654534,0.00051923835,0.0009296633,0.00033594752,0.0006433914,0.0028808631,0.0002198475,0.000009901286],"category_scores_gemma":[0.000030329615,0.0004812455,0.0001752248,0.0010600945,0.0003184125,0.00054454914,0.0003828879,0.00050351926,0.000030091365],"study_design_candidate":"design_other","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.000025666159,0.000029332796,0.0000019330098,0.00002707504,0.000013788291,0.00002967777,0.00042143403,0.0068155294,0.0009723866,0.021201337,0.000014068158,0.9704478],"study_design_scores_gemma":[0.0011133512,0.00080997474,0.000019775338,0.0004567246,0.000021581598,0.00006492327,5.3994876e-7,0.5856315,0.014627278,0.3953218,0.0007813873,0.0011511649],"about_ca_topic_score_codex":0.00002386526,"about_ca_topic_score_gemma":0.000015381796,"teacher_disagreement_score":0.96929663,"about_ca_system_score_codex":0.00015064084,"about_ca_system_score_gemma":0.00032824487,"threshold_uncertainty_score":0.9997639},"labels":[],"label_agreement":null},{"id":"W1876649195","doi":"10.1007/978-3-030-63416-2_775","title":"Many-to-Many Graph Matching","year":2021,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Matching (statistics); Computer science; Graph; Theoretical computer science; Mathematics; Statistics","score_opus":0.014042545678282397,"score_gpt":0.2193379846512718,"score_spread":0.2052954389729894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1876649195","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009672976,0.00016129726,0.5104888,0.00033853028,0.00065332255,0.00008958532,0.0000039020533,0.00019257417,0.4880623],"genre_scores_gemma":[0.00060935743,0.000054135933,0.07127753,0.0024434894,0.00020310844,0.0000076234273,0.000009354252,0.00004120676,0.9253542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822694,0.000023526392,0.00029054852,0.00076548726,0.00036583346,0.0003276751],"domain_scores_gemma":[0.9984829,0.00007212762,0.00008965726,0.0010682893,0.00008132669,0.00020574177],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025805316,0.00035824755,0.00036437655,0.00031225057,0.00015661224,0.00029593005,0.0013560829,0.0002018547,0.00077525084],"category_scores_gemma":[0.000004627779,0.00032998424,0.00031269478,0.0001161146,0.000038963313,0.00021402934,0.0007598533,0.00040281028,0.0009391762],"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":[8.6489854e-7,0.0000074445647,2.7321124e-7,0.000013137738,0.000040726492,0.00017268646,0.00014423302,0.000015244258,0.000028110162,0.9800223,0.0011667362,0.018388217],"study_design_scores_gemma":[0.00007979222,0.00003562749,0.00000809072,0.00014579872,0.000012463808,0.000053823536,0.000012234055,0.00018754858,0.00013379163,0.90801793,0.09081527,0.0004976267],"about_ca_topic_score_codex":0.0000073303436,"about_ca_topic_score_gemma":0.0000049734685,"teacher_disagreement_score":0.43921128,"about_ca_system_score_codex":0.00001974643,"about_ca_system_score_gemma":0.000048176116,"threshold_uncertainty_score":0.99991524},"labels":[],"label_agreement":null},{"id":"W1964700291","doi":"10.1007/s00283-012-9275-2","title":"Sketchy Tweets: Ten Minute Conjectures in Graph Theory","year":2012,"lang":"en","type":"article","venue":"The Mathematical Intelligencer","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"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":"Conjecture; Computer science; Ambiguity; Point (geometry); Sketch; Mathematics; Epistemology; Combinatorics; Algorithm; Philosophy","score_opus":0.024937020151586616,"score_gpt":0.2741477669491068,"score_spread":0.2492107467975202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964700291","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.036115438,0.001044406,0.9497269,0.00075497985,0.00040768023,0.00030943583,0.000001940051,0.00014244765,0.011496804],"genre_scores_gemma":[0.98941284,0.000024430605,0.008931525,0.0008783426,0.000117201525,0.000051613602,5.1400383e-7,0.000014134847,0.0005694165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819696,0.0003410764,0.0003669302,0.00023836957,0.0002870149,0.0005696497],"domain_scores_gemma":[0.9977692,0.0012403048,0.00007266798,0.0007479682,0.000034048982,0.00013585799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023355852,0.00020882301,0.000245023,0.00013228999,0.00011763762,0.000100977406,0.0014338463,0.000085081614,0.00042880635],"category_scores_gemma":[0.00021177504,0.000115914176,0.00013975379,0.0005908807,0.00032951878,0.00036575695,0.00029054086,0.00030450255,0.0006056927],"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.000009078708,0.00014140463,0.0001276442,0.000017946648,0.000022027592,0.0000037219677,0.0074021537,0.000017438733,0.000062012536,0.97822195,0.00018553644,0.0137890745],"study_design_scores_gemma":[0.00005923755,0.000032580283,0.0003113001,0.000047218222,0.000011719344,0.000039137027,0.0004973956,0.002344756,0.0053848377,0.99064463,0.00044036782,0.000186787],"about_ca_topic_score_codex":0.0000049379305,"about_ca_topic_score_gemma":0.0000014839023,"teacher_disagreement_score":0.9532974,"about_ca_system_score_codex":0.000020150848,"about_ca_system_score_gemma":0.000016544285,"threshold_uncertainty_score":0.7785156},"labels":[],"label_agreement":null},{"id":"W1970477105","doi":"10.1145/2351476.2351503","title":"<i>ECTree</i>","year":2012,"lang":"en","type":"article","venue":"","topic":"Graph Theory 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":"Concordia University","funders":"","keywords":"Computer science; Search engine indexing; Graph; Realm; Theoretical computer science; Graph theory; Data mining; Information retrieval; Mathematics; Combinatorics","score_opus":0.008183093748277746,"score_gpt":0.20632297427550597,"score_spread":0.19813988052722822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970477105","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.0064558457,0.00010308001,0.87691313,0.0002616884,0.00042029977,0.00001917351,8.495075e-8,0.0001784031,0.11564831],"genre_scores_gemma":[0.95437205,0.0000012414151,0.043425262,0.00085323496,0.00006909989,0.0000016943499,1.04594264e-7,0.0000013920137,0.0012759239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967563,0.000015392365,0.000035508245,0.000058482376,0.00005421606,0.00016076647],"domain_scores_gemma":[0.99971646,0.000020403928,0.00000725335,0.00018791771,0.0000059672197,0.00006197355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014637598,0.00003199146,0.000028252356,0.000018545292,0.000035701152,0.000021760126,0.0002571079,0.000010871612,0.000056339602],"category_scores_gemma":[0.000003475114,0.000023959135,0.000021473359,0.00012760893,0.0000090566255,0.00041362335,0.000060492202,0.000026260024,0.00037214995],"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":[1.2757269e-7,0.000017651246,0.00075690117,3.3061852e-7,0.0000013693036,3.3288674e-7,0.000116489435,2.994566e-7,0.00021774757,0.97426516,0.00093276694,0.023690823],"study_design_scores_gemma":[0.0007231032,0.00013547612,0.026574394,0.000009352188,0.000008467663,0.00016411398,0.00012631252,0.012259711,0.13238099,0.51047677,0.31622264,0.0009186482],"about_ca_topic_score_codex":0.000001179103,"about_ca_topic_score_gemma":1.2018945e-7,"teacher_disagreement_score":0.9479162,"about_ca_system_score_codex":0.0000019932334,"about_ca_system_score_gemma":0.0000027884148,"threshold_uncertainty_score":0.4783359},"labels":[],"label_agreement":null},{"id":"W1975143768","doi":"10.1145/2764947.2764955","title":"Constructing Bisimulation Summaries on a Multi-Core Graph Processing Framework","year":2015,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Bisimulation; Scalability; Theoretical computer science; Graph; Computation; Graph database; Distributed computing; Parallel computing; Programming language; Database","score_opus":0.0744695342873075,"score_gpt":0.3055218454920984,"score_spread":0.23105231120479086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975143768","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.047867604,0.000045997935,0.9490582,0.00020699066,0.00036305079,0.00008426784,0.0000011374955,0.00031474847,0.0020580378],"genre_scores_gemma":[0.6798521,3.5296986e-7,0.3198231,0.00022303395,0.000038003116,0.0000028830411,0.0000016865051,0.0000043825235,0.000054411834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914366,0.000039931754,0.00015041196,0.00026720468,0.000203583,0.00019521247],"domain_scores_gemma":[0.9993231,0.00013301922,0.00007338233,0.0002550402,0.0001135148,0.00010190373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032214343,0.00011103202,0.000105749474,0.00012462302,0.00016126028,0.0002305458,0.00029698477,0.00006900601,0.00000453562],"category_scores_gemma":[0.00019420832,0.00008971352,0.000038541875,0.0005304308,0.00008497689,0.0004990964,0.000084499705,0.00015528651,0.00002186526],"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.000008166766,0.000041423285,0.006913166,0.000007423678,0.0000056072067,0.0000063788707,0.0015576268,0.00079715205,0.000012240902,0.8371215,0.00003356572,0.15349576],"study_design_scores_gemma":[0.00044841846,0.00008266066,0.000551134,0.00009666124,0.0000037570849,0.000012755537,0.001070173,0.45356086,0.0010428516,0.54270244,0.00018784413,0.00024042674],"about_ca_topic_score_codex":0.0000068292493,"about_ca_topic_score_gemma":0.0000037567386,"teacher_disagreement_score":0.63198453,"about_ca_system_score_codex":0.000017688573,"about_ca_system_score_gemma":0.00004734551,"threshold_uncertainty_score":0.3658411},"labels":[],"label_agreement":null},{"id":"W1976692187","doi":"10.1109/hpec.2014.7040962","title":"GasCL: A vertex-centric graph model for GPUs","year":2014,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Computer science; Parallel computing; Vertex (graph theory); Graph; Theoretical computer science","score_opus":0.012873160534595262,"score_gpt":0.21889935385472925,"score_spread":0.206026193320134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976692187","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.002717892,0.000019473831,0.9919749,0.00027955262,0.0002673875,0.00012283251,0.0000012041038,0.0001856223,0.004431128],"genre_scores_gemma":[0.84684074,0.0000041422063,0.15017544,0.0009811653,0.000026585374,0.000025312624,0.0000011174944,0.0000070748533,0.001938452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924356,0.000026642745,0.000106634645,0.0002577339,0.0001078013,0.000257631],"domain_scores_gemma":[0.9993679,0.000097483506,0.000026724474,0.000378476,0.000042722135,0.000086722685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028392498,0.0000894023,0.00009908899,0.00009814343,0.00010784576,0.000071490955,0.0005913317,0.00003364301,0.000008792636],"category_scores_gemma":[0.000027461665,0.00007188528,0.00010074845,0.00026213814,0.000022150016,0.00021370224,0.00007831783,0.000043447453,0.00004156635],"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.000002997654,0.00004177972,0.000015889877,0.0000049234663,0.0000054569623,3.4896215e-7,0.00010765622,0.0011617321,0.00007084763,0.95933443,0.0013110001,0.03794292],"study_design_scores_gemma":[0.00023589842,0.000031079784,0.00002476941,0.0000019263302,0.0000021248895,0.0000020185657,0.0000018929271,0.613866,0.00033848075,0.38475606,0.0006679472,0.00007181339],"about_ca_topic_score_codex":0.000002445067,"about_ca_topic_score_gemma":0.0000017562122,"teacher_disagreement_score":0.8441228,"about_ca_system_score_codex":0.000005152861,"about_ca_system_score_gemma":0.00001489903,"threshold_uncertainty_score":0.29313967},"labels":[],"label_agreement":null},{"id":"W1981357720","doi":"10.1109/isie.2006.295535","title":"Graph-Theoretic Registration of 3D Terrain Elevation Data","year":2006,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Terrain; Elevation (ballistics); Computer science; Digital elevation model; Graph; Artificial intelligence; Computer vision; Geodesy; Remote sensing; Geology; Cartography; Mathematics; Geography; Theoretical computer science; Geometry","score_opus":0.016499419039586374,"score_gpt":0.23920045052336125,"score_spread":0.22270103148377488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981357720","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.017097224,0.000020565312,0.96588635,0.00035525733,0.00009380801,0.00006723922,0.000004598651,0.0000755033,0.016399447],"genre_scores_gemma":[0.9326783,0.0000021327476,0.06674136,0.00006786675,0.000033762626,0.0000017587973,0.00005144159,0.000002585836,0.0004207955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927545,0.000052409483,0.00019601415,0.00022375329,0.00015547157,0.000096899224],"domain_scores_gemma":[0.9989832,0.00004522915,0.00009147193,0.0008268562,0.000037935257,0.000015287053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053489825,0.000058532467,0.000065405824,0.00007766209,0.000043382177,0.000040933417,0.0007607085,0.000027327156,0.000022436203],"category_scores_gemma":[0.000021966356,0.00004986565,0.00001828081,0.0003148451,0.00006706214,0.0005193354,0.000102187885,0.000036193927,0.0000069750454],"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.0000013343498,0.000031809817,0.00011029576,0.000005249696,0.0000021432518,7.9769006e-7,0.000039656286,0.000033192304,0.0018222854,0.9893675,0.0007168387,0.0078689335],"study_design_scores_gemma":[0.00018351851,0.000051174244,0.0028108924,0.00001027001,0.000004833807,0.000006683116,0.000019304009,0.0931817,0.0059022713,0.89713997,0.0005757963,0.00011358134],"about_ca_topic_score_codex":0.00006893883,"about_ca_topic_score_gemma":0.000020078836,"teacher_disagreement_score":0.91558105,"about_ca_system_score_codex":0.0000033524311,"about_ca_system_score_gemma":0.000016106076,"threshold_uncertainty_score":0.20334624},"labels":[],"label_agreement":null},{"id":"W2000777924","doi":"10.1145/2309996.2310026","title":"Graph data partition models for online social networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"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":"Computer science; Scalability; Partition (number theory); Graph database; Graph; Graph partition; Theoretical computer science; Overhead (engineering); Social graph; Architecture; Distributed computing; Database; World Wide Web; Social media","score_opus":0.10849674585391406,"score_gpt":0.30702717784845196,"score_spread":0.1985304319945379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000777924","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.0010603681,0.00008810693,0.99720806,0.00042723992,0.0004310141,0.00009625413,0.000029918036,0.0001170827,0.0005419738],"genre_scores_gemma":[0.8401233,0.000009303843,0.15803559,0.0007078016,0.0007478899,0.000012853594,0.00019391347,0.000006110203,0.0001632549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993377,0.00003051776,0.000102327605,0.00017911018,0.000077929115,0.00027245778],"domain_scores_gemma":[0.9994393,0.00004716714,0.000031214106,0.0003949589,0.000026613,0.00006074859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039381563,0.00006563829,0.000072699135,0.000029795568,0.00015473049,0.00004775448,0.0007024934,0.000041888048,0.000008691672],"category_scores_gemma":[0.0000050435556,0.00005532826,0.000041436007,0.00015872515,0.000024449908,0.0014482224,0.00023016571,0.000051312414,0.0000040862665],"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.0000033105212,0.00011005296,0.000020382751,0.0000024962267,0.000009684071,1.284682e-7,0.00011503907,0.0008242579,0.000007467733,0.94629633,0.0053144856,0.04729637],"study_design_scores_gemma":[0.00013156325,0.00001278697,0.00013282115,0.0000014954505,0.0000049998644,0.0000012562808,0.000013138714,0.79033995,0.00002159408,0.20727836,0.0019817983,0.00008023482],"about_ca_topic_score_codex":0.0000031005725,"about_ca_topic_score_gemma":0.0000040812542,"teacher_disagreement_score":0.8391725,"about_ca_system_score_codex":0.0000033821877,"about_ca_system_score_gemma":0.0000068233453,"threshold_uncertainty_score":0.22562209},"labels":[],"label_agreement":null},{"id":"W2002544979","doi":"10.1016/j.dam.2014.08.033","title":"On the continuity of graph parameters","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Metric space; Metric dimension; Combinatorics; Discrete mathematics; Graph isomorphism; Split graph; Cograph; Graph; Metric (unit); Isomorphism (crystallography); Graph product; Pathwidth; Line graph","score_opus":0.011238758772614373,"score_gpt":0.21444103943760193,"score_spread":0.20320228066498755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002544979","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.09253209,0.0000035622047,0.87839776,0.00016742152,0.00006733858,0.00020623967,0.0000025545155,0.00006806763,0.028554952],"genre_scores_gemma":[0.9230568,0.000001255567,0.07661277,0.00026415655,0.0000079718675,0.000023385708,7.583028e-7,0.000007638195,0.000025275504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914014,0.00003642034,0.00022725778,0.00017938657,0.00023865169,0.00017815708],"domain_scores_gemma":[0.998165,0.0008044516,0.00016368413,0.00080078136,0.000022924423,0.00004312654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069652806,0.00012649938,0.00019954536,0.000048488364,0.00008620908,0.000049992992,0.0008611978,0.000037105227,0.000007778665],"category_scores_gemma":[0.00007488485,0.00007563011,0.00009659123,0.00023658815,0.00014101475,0.000046196532,0.000116031886,0.000109114495,0.00003534729],"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.000002093928,0.000038927108,0.0000016813763,0.00002078198,0.000013941038,1.8052137e-7,0.0009137817,0.000041784755,0.00068926765,0.99551433,0.000080862876,0.0026823748],"study_design_scores_gemma":[0.0001391392,0.00004346481,0.000033223143,0.000021539634,0.000008649308,0.0000010882129,0.00013692243,0.011324669,0.013589901,0.9745276,0.000068105546,0.00010572779],"about_ca_topic_score_codex":7.910626e-7,"about_ca_topic_score_gemma":2.712683e-7,"teacher_disagreement_score":0.8305247,"about_ca_system_score_codex":0.0000034723805,"about_ca_system_score_gemma":0.0000057822567,"threshold_uncertainty_score":0.3084106},"labels":[],"label_agreement":null},{"id":"W2012165244","doi":"10.1007/s00500-005-0464-1","title":"Median graph computation for graph clustering","year":2005,"lang":"en","type":"article","venue":"Soft Computing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Cluster analysis; Computer science; Clustering coefficient; Graph; Computation; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.015668779392883008,"score_gpt":0.2595915060603086,"score_spread":0.24392272666742562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012165244","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.023587095,0.000080921054,0.97372925,0.00080045743,0.00080398016,0.00022863378,0.000001982971,0.0004617373,0.00030591668],"genre_scores_gemma":[0.6726243,9.834582e-7,0.326609,0.00041780758,0.0003071013,0.0000052356904,0.0000054152415,0.0000115598,0.000018585404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856,0.00006278978,0.00031389002,0.00042763073,0.00019605523,0.00043959517],"domain_scores_gemma":[0.9990288,0.00036396098,0.00013492293,0.00025675385,0.000097555756,0.00011802664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065055303,0.00017538456,0.00018510582,0.0002270741,0.00043499173,0.00018492473,0.00061969337,0.00006162553,0.0000023274931],"category_scores_gemma":[0.00004415139,0.00018067993,0.00015538414,0.00043259884,0.00005233602,0.00040101577,0.0002060453,0.00013593692,0.000019405537],"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.0000071740155,0.000059936097,0.00021574608,0.000042765492,0.000033204367,0.000004449957,0.002118816,0.07527062,0.0003406339,0.058895342,0.00028153273,0.8627298],"study_design_scores_gemma":[0.0004792069,0.000054959175,0.00040573938,0.00003919508,0.0000056188246,0.000019338733,0.00003856757,0.89778656,0.00042618494,0.09997844,0.00053070846,0.00023549201],"about_ca_topic_score_codex":0.0000039705756,"about_ca_topic_score_gemma":0.0000071633262,"teacher_disagreement_score":0.8624943,"about_ca_system_score_codex":0.000022950266,"about_ca_system_score_gemma":0.000024764759,"threshold_uncertainty_score":0.7367913},"labels":[],"label_agreement":null},{"id":"W2012399061","doi":"10.1007/s00500-013-1065-z","title":"A Granular Computing approach to the design of optimized graph classification systems","year":2013,"lang":"en","type":"article","venue":"Soft Computing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Benchmarking; Theoretical computer science; Embedding; Graph; Granular computing; Graph rewriting; ENCODE; Graph embedding; Data mining; Artificial intelligence; Rough set","score_opus":0.03306315459036092,"score_gpt":0.23137818694817142,"score_spread":0.1983150323578105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012399061","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.010317983,0.00014380044,0.9871152,0.00021035266,0.00049588765,0.0009758514,6.234123e-7,0.00023271138,0.0005075664],"genre_scores_gemma":[0.70898217,7.1844124e-7,0.29078504,0.00010974032,0.000080979036,0.000016352069,0.0000016209312,0.000010495477,0.000012858323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769825,0.0005671985,0.00050744216,0.00047451156,0.00034500455,0.00040756896],"domain_scores_gemma":[0.998045,0.00058297964,0.00029113435,0.0007411349,0.00023080464,0.000108924505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001935391,0.00019981383,0.00030539796,0.0001776449,0.0004281171,0.00031510298,0.0015112854,0.00006530007,0.0000011166619],"category_scores_gemma":[0.0000867319,0.00014542247,0.000115519106,0.0010568347,0.00007794389,0.0002286076,0.00033360382,0.00019834186,0.000037327613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006017205,0.00012059179,0.0002457589,0.00006070578,0.000034929097,9.500345e-7,0.0035341498,0.8218281,0.001199832,0.14229499,0.00046573626,0.030208208],"study_design_scores_gemma":[0.0002644209,0.00004325056,0.0013628583,0.0000630684,0.000008013139,0.00001717388,0.0004185479,0.9944523,0.00012447525,0.0030173962,0.00004901051,0.00017950477],"about_ca_topic_score_codex":0.00006319295,"about_ca_topic_score_gemma":5.1219175e-8,"teacher_disagreement_score":0.6986642,"about_ca_system_score_codex":0.000019576471,"about_ca_system_score_gemma":0.000033854016,"threshold_uncertainty_score":0.5930156},"labels":[],"label_agreement":null},{"id":"W2014871820","doi":"10.1007/s00778-011-0238-6","title":"Answering pattern match queries in large graph databases via graph embedding","year":2011,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Reachability; Graph database; Graph; Factor-critical graph; Theoretical computer science; Web search query; Data mining; Information retrieval; Line graph; Search engine; Voltage graph","score_opus":0.03072226293727882,"score_gpt":0.25766782772861585,"score_spread":0.22694556479133704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014871820","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.28127044,0.0004303626,0.71723217,0.00014898788,0.00058656465,0.00005330385,0.0000045296338,0.000052415235,0.00022123315],"genre_scores_gemma":[0.98839575,0.00021026454,0.010952051,0.00029782354,0.000108180844,0.0000046365994,8.603423e-7,0.00001241388,0.000018026098],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985435,0.0002206235,0.00030735,0.00021209521,0.00023946022,0.00047696923],"domain_scores_gemma":[0.9991695,0.000072328505,0.00014242306,0.00047293046,0.000039456034,0.000103306185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014369392,0.00016421141,0.00016922649,0.0002682276,0.00042509093,0.00015938941,0.0012010998,0.00002903884,0.000104076214],"category_scores_gemma":[0.000012803408,0.00011116882,0.000113000366,0.00053754164,0.00008510495,0.0010070733,0.00029186194,0.00046656444,0.000023358582],"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.00018887228,0.0013283946,0.20464101,0.0001246022,0.00041278717,0.003212361,0.110624574,0.0006128268,0.010794843,0.28420898,0.0015292353,0.3823215],"study_design_scores_gemma":[0.0031248145,0.00042836668,0.14694874,0.00091110106,0.00005420244,0.006062472,0.005205266,0.02442066,0.024662767,0.7824022,0.003936718,0.0018426861],"about_ca_topic_score_codex":0.000054186003,"about_ca_topic_score_gemma":0.000044582626,"teacher_disagreement_score":0.7071253,"about_ca_system_score_codex":0.000012049156,"about_ca_system_score_gemma":0.000018831253,"threshold_uncertainty_score":0.45333326},"labels":[],"label_agreement":null},{"id":"W2030488300","doi":"10.1007/s11263-006-6993-y","title":"Object Recognition as Many-to-Many Feature Matching","year":2006,"lang":"en","type":"article","venue":"International Journal of Computer Vision","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Pattern recognition (psychology); Artificial intelligence; Embedding; Feature vector; Mathematics; Cognitive neuroscience of visual object recognition; Matching (statistics); Computer science; Feature extraction","score_opus":0.0067165344347500655,"score_gpt":0.2619409834550265,"score_spread":0.2552244490202764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030488300","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.18463318,0.00005079479,0.8085292,0.002687603,0.0032977634,0.000055872286,0.00000274128,0.000040016574,0.0007028269],"genre_scores_gemma":[0.8118745,0.000009972769,0.18499522,0.001273435,0.0016764019,9.684294e-7,0.0000059791023,0.000010280296,0.00015325513],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983357,0.000099669225,0.00040753023,0.0002183256,0.0007664352,0.00017230786],"domain_scores_gemma":[0.9987253,0.000114050934,0.00031755617,0.00016885721,0.0005749357,0.000099310804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005111942,0.00014778122,0.00017426112,0.0004953267,0.00007928398,0.00047098118,0.0013387799,0.00006293285,0.000024645782],"category_scores_gemma":[0.000010751793,0.00012555446,0.00019152682,0.00022304169,0.000018869856,0.0009945761,0.00027361204,0.00027571525,0.00013948162],"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.00022726443,0.00044133843,0.00019280278,0.000010062589,0.00015908726,0.0013854606,0.00084890623,0.005879484,0.0074799075,0.06375423,0.016165838,0.9034556],"study_design_scores_gemma":[0.0025636596,0.0016980604,0.026311738,0.0011148363,0.00002805807,0.0063712946,0.000039171453,0.072154395,0.011607718,0.8528182,0.024548437,0.0007444553],"about_ca_topic_score_codex":0.000013302862,"about_ca_topic_score_gemma":0.00000105549,"teacher_disagreement_score":0.90271115,"about_ca_system_score_codex":0.00006553161,"about_ca_system_score_gemma":0.000041081545,"threshold_uncertainty_score":0.51199627},"labels":[],"label_agreement":null},{"id":"W2031219522","doi":"10.2991/cse.2013.26","title":"Task Level Parallelization of All Pair Shortest Path Algorithm in OpenMP 3.0","year":2013,"lang":"en","type":"article","venue":"","topic":"Graph Theory 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":"University of Manitoba","funders":"","keywords":"Computer science; Parallel computing; Task (project management); Shortest path problem; Path (computing); Algorithm; Theoretical computer science; Operating system; Graph; Engineering","score_opus":0.024439550770988593,"score_gpt":0.2332819620227585,"score_spread":0.20884241125176992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031219522","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.015578756,0.000037480146,0.9811448,0.0004671656,0.00013168283,0.0002556998,0.0000038909548,0.000072423565,0.002308126],"genre_scores_gemma":[0.81675965,0.00001113133,0.18216667,0.0004062982,0.000017682596,0.000029701627,0.000008273729,0.000006103487,0.0005945134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989752,0.00007961775,0.00027732807,0.00026868467,0.00017669996,0.0002224386],"domain_scores_gemma":[0.99935865,0.000058454578,0.0000637772,0.00036924827,0.000081439175,0.00006841646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030864027,0.000111583024,0.00015555421,0.000113482056,0.000028234936,0.0000631198,0.00063807366,0.00005332023,0.00011306445],"category_scores_gemma":[0.000017232396,0.00009215042,0.000044872824,0.00038862808,0.000037502483,0.0007139312,0.0001640312,0.00007594672,0.00008963567],"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.0000030482543,0.0005952026,0.0092055,0.000018090868,0.000037864756,0.000028056713,0.0023673798,0.0010823958,0.0028712421,0.34760138,0.0036902388,0.6324996],"study_design_scores_gemma":[0.0006230299,0.00015808055,0.048876412,0.000034392462,0.0000038412513,0.000011717327,0.00015506995,0.8297681,0.0027340641,0.11653268,0.00075332884,0.00034924253],"about_ca_topic_score_codex":0.00033697058,"about_ca_topic_score_gemma":0.000017436978,"teacher_disagreement_score":0.82868576,"about_ca_system_score_codex":0.000011022274,"about_ca_system_score_gemma":0.00002619979,"threshold_uncertainty_score":0.3757785},"labels":[],"label_agreement":null},{"id":"W2040080630","doi":"10.1142/s0218001415500111","title":"Estimating Graph Edit Distance Using Lower and Upper Bounds of Bipartite Approximations","year":2014,"lang":"en","type":"article","venue":"International Journal of Pattern Recognition and Artificial Intelligence","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computation; Bipartite graph; Edit distance; Matching (statistics); Upper and lower bounds; Graph; Mathematics; Exponential function; Exponential growth; Computer science; Algorithm; Discrete mathematics","score_opus":0.05183151763930641,"score_gpt":0.2969443134733721,"score_spread":0.24511279583406567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040080630","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.32146445,0.00003581451,0.6771761,0.00024402204,0.0010004136,0.000027751756,0.000009148028,0.000006838745,0.000035404268],"genre_scores_gemma":[0.9539568,0.000024330877,0.0455474,0.00014963947,0.0003104725,0.0000011979472,0.0000023621162,0.0000048131838,0.0000030271385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988253,0.000076272096,0.000543118,0.00015314254,0.00029194495,0.00011019728],"domain_scores_gemma":[0.9987866,0.00016057408,0.00042827099,0.00008431703,0.00046532383,0.00007489221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005648615,0.000097971286,0.0001477262,0.0002405053,0.000087180044,0.00019263617,0.0002992302,0.00003565594,0.000029122644],"category_scores_gemma":[0.00014073454,0.00008880964,0.00007066441,0.00014085634,0.00015022054,0.0006348199,0.00007123612,0.00012923982,0.0000042739166],"study_design_candidate":"design_other","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.000028555583,0.00013878992,0.0011993988,0.000022256863,0.0000566584,0.000011352082,0.0011396564,0.00066290563,0.0032089578,0.013739264,0.0000065750514,0.9797856],"study_design_scores_gemma":[0.000097962184,0.00015435144,0.0004664966,0.00039877213,0.000016882828,0.00019908787,0.00020527841,0.5372966,0.014155452,0.44675654,0.000077755605,0.00017483816],"about_ca_topic_score_codex":0.000009135736,"about_ca_topic_score_gemma":0.000004179994,"teacher_disagreement_score":0.9796108,"about_ca_system_score_codex":0.000010912774,"about_ca_system_score_gemma":0.000017972705,"threshold_uncertainty_score":0.3621552},"labels":[],"label_agreement":null},{"id":"W2042145470","doi":"10.1109/tsmca.2011.2159587","title":"Efficient Role Transfer Based on Kuhn–Munkres Algorithm","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Computer science; Algorithm; Mathematical optimization; Transfer (computing); Efficient algorithm; Mathematics; Parallel computing","score_opus":0.020435768214500473,"score_gpt":0.20621828062170136,"score_spread":0.1857825124072009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042145470","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.054661527,0.00075647776,0.9368472,0.000027075723,0.0021268062,0.0007533795,0.00008269399,0.00025518652,0.0044896496],"genre_scores_gemma":[0.9977273,0.000045087243,0.00040145757,0.00007860523,0.000104634266,0.0001648354,0.0000018251632,0.000032952863,0.0014433063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976041,0.00027071973,0.00052459765,0.00071562437,0.00042728125,0.00045767584],"domain_scores_gemma":[0.9987994,0.00009124731,0.00008068508,0.0006614498,0.0000769628,0.0002902812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005030635,0.00040050966,0.00044571862,0.00031537114,0.00057068426,0.00036298443,0.00036826063,0.00017279272,0.000021239623],"category_scores_gemma":[7.5404665e-7,0.00034481985,0.00014232677,0.00021591906,0.00017097869,0.000099224766,0.00000403609,0.00028797812,0.000041346557],"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.00049018534,0.0073747397,0.00019322762,0.0021324793,0.0012926876,0.00069304404,0.11484634,0.169104,0.0016752243,0.58387786,0.0009009806,0.11741924],"study_design_scores_gemma":[0.0018231467,0.001396188,0.0002709528,0.00069302303,0.00011570212,0.00015197457,0.0025838078,0.98393387,0.0009004691,0.00042205013,0.0067381915,0.000970639],"about_ca_topic_score_codex":0.00029919803,"about_ca_topic_score_gemma":0.000026830277,"teacher_disagreement_score":0.94306576,"about_ca_system_score_codex":0.000027911337,"about_ca_system_score_gemma":0.00002852994,"threshold_uncertainty_score":0.9999004},"labels":[],"label_agreement":null},{"id":"W2052745835","doi":"10.3166/isi.19.3.73-92","title":"Big data. Mise en perspective et enjeux pour les entreprises","year":2014,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Humanities; Political science; Philosophy","score_opus":0.05062646434569461,"score_gpt":0.27503205684168497,"score_spread":0.22440559249599035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052745835","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.015079192,0.00198231,0.9407153,0.004417037,0.0031370167,0.00037181724,0.00016911444,0.0002917775,0.033836417],"genre_scores_gemma":[0.97205085,0.00044110217,0.023808382,0.00091284036,0.0008737002,0.000025926303,0.00018468812,0.000022020442,0.0016804799],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724215,0.0007489163,0.00067131565,0.00040674894,0.00040566357,0.0005251775],"domain_scores_gemma":[0.9969137,0.00055658486,0.00045199785,0.0012253722,0.00067500165,0.00017735694],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021321424,0.0003464763,0.00032195912,0.0003161116,0.00047178174,0.0010648477,0.0014874814,0.00022459104,0.000109582914],"category_scores_gemma":[0.0018439944,0.00035297967,0.00012013705,0.00057783857,0.00036455953,0.0090910625,0.000776885,0.00035349678,0.00078625436],"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.000015132207,0.00005631904,0.00021731021,0.00022246817,0.000054232816,0.0000037974103,0.036782928,0.00040868495,0.000026413678,0.43989757,0.0014919628,0.5208232],"study_design_scores_gemma":[0.0012965911,0.0002877279,0.006194874,0.0011192217,0.00010315798,0.00029140353,0.02030479,0.2630558,0.0010885621,0.48337787,0.22183795,0.0010420298],"about_ca_topic_score_codex":0.0005595991,"about_ca_topic_score_gemma":0.00003181369,"teacher_disagreement_score":0.95697165,"about_ca_system_score_codex":0.0002686583,"about_ca_system_score_gemma":0.00030911455,"threshold_uncertainty_score":0.9999918},"labels":[],"label_agreement":null},{"id":"W2054042055","doi":"10.1115/1.1564574","title":"A New Method for Detection of Graph Isomorphism Based on the Quadratic Form","year":2003,"lang":"en","type":"article","venue":"Journal of Mechanical Design","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":36,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quadric; Quadratic equation; Eigenvalues and eigenvectors; Isomorphism (crystallography); Mathematics; Kinematics; Graph isomorphism; Quadratic programming; Combinatorics; Graph; Quadratic function; Discrete mathematics; Mathematical optimization; Geometry; Line graph","score_opus":0.03585004642022476,"score_gpt":0.27393773025083656,"score_spread":0.2380876838306118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054042055","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.00019561488,0.000035490008,0.9984095,0.0007016059,0.0004083147,0.00021221187,4.4461308e-7,0.000009147716,0.000027651475],"genre_scores_gemma":[0.33011976,0.0000028880363,0.6693944,0.00041998166,0.000036970145,0.0000048534366,2.3917568e-8,0.000005947144,0.0000152242155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983951,0.0006056111,0.00040638188,0.0001187242,0.0003130877,0.00016109267],"domain_scores_gemma":[0.99713403,0.0019863467,0.00038170558,0.00024719624,0.00014303344,0.00010768978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038580603,0.00010168866,0.00022513872,0.00014125649,0.000093559436,0.00003784659,0.00051244645,0.00006499998,0.000016599091],"category_scores_gemma":[0.00064442935,0.00006060656,0.00028158913,0.00036387323,0.0000125332335,0.00015795961,0.000010889436,0.00019478989,0.0000015123272],"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.00021707967,0.00016766306,2.945393e-7,0.000013257208,0.000054517906,0.000008215666,0.000113320646,0.0018319336,0.09609296,0.84416205,0.00041689852,0.056921784],"study_design_scores_gemma":[0.0005312648,0.0013597087,0.0000019366535,0.000031009295,0.00002210654,0.00003964858,0.000018695722,0.17117886,0.27422842,0.5524159,0.000118272714,0.00005418816],"about_ca_topic_score_codex":0.0000016251048,"about_ca_topic_score_gemma":5.484506e-7,"teacher_disagreement_score":0.32992414,"about_ca_system_score_codex":0.000018786746,"about_ca_system_score_gemma":0.00012423036,"threshold_uncertainty_score":0.24714637},"labels":[],"label_agreement":null},{"id":"W2069543418","doi":"10.1016/j.dam.2012.01.019","title":"Using local similarity measures to efficiently address approximate graph matching","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Heuristics; Tabu search; Local search (optimization); Initialization; Computation; Algorithm; Graph; Similarity (geometry); Matching (statistics); Path (computing); Mathematical optimization; Theoretical computer science; Combinatorics; Computer science; Artificial intelligence","score_opus":0.042613035051992015,"score_gpt":0.28219360824365386,"score_spread":0.23958057319166184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069543418","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.044149894,0.00005834161,0.9506939,0.00004343278,0.00024839636,0.00044760943,0.000010126524,0.00026731036,0.004080972],"genre_scores_gemma":[0.6244075,0.0000011297739,0.3752813,0.00018820257,0.000057396355,0.000029113455,0.000002507294,0.00002423189,0.000008614901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978046,0.00004575841,0.00040232897,0.0003853431,0.00057893514,0.00078303757],"domain_scores_gemma":[0.9984789,0.00012621174,0.00015110966,0.0008424335,0.000051693747,0.00034965228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011548151,0.00031916538,0.00036583765,0.00018271193,0.00034310692,0.00021133783,0.0010193924,0.0001008574,0.000009606716],"category_scores_gemma":[0.000023453162,0.00027434793,0.00013008332,0.00065040577,0.00010518825,0.00034659676,0.0005171307,0.00023071322,0.00006481393],"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.0000106204125,0.0002331044,0.000009995435,0.00014375671,0.000040029965,0.000003142269,0.0096297655,0.0059881355,0.0065405006,0.97320276,0.000035044224,0.004163166],"study_design_scores_gemma":[0.0007136,0.00006495079,0.00007840712,0.00020356243,0.00010875809,0.00006933996,0.0036373786,0.12133732,0.057277076,0.81482846,0.00025098992,0.0014301458],"about_ca_topic_score_codex":0.00000502322,"about_ca_topic_score_gemma":9.645536e-7,"teacher_disagreement_score":0.5802576,"about_ca_system_score_codex":0.000039934566,"about_ca_system_score_gemma":0.000022346678,"threshold_uncertainty_score":0.99997085},"labels":[],"label_agreement":null},{"id":"W2071731534","doi":"10.1111/j.1541-0420.2007.0786_1.x","title":"Correction to “A Note on One‐Sided Tests with Multiple Endpoints,” by M. D. Perlman and L. Wu; 60, 276–280, March 2004","year":2007,"lang":"en","type":"article","venue":"Biometrics","topic":"Graph Theory and Algorithms","field":"Computer Science","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 British Columbia","funders":"","keywords":"Paragraph; Section (typography); Code (set theory); Statistics; Computer science; Mathematics; Arithmetic; Programming language; World Wide Web; Operating system","score_opus":0.015241263736670842,"score_gpt":0.2546162972626174,"score_spread":0.23937503352594658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071731534","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.21528183,0.00022120745,0.7812195,0.00032989858,0.0013961769,0.0003610425,0.00001822956,0.00021865925,0.00095349987],"genre_scores_gemma":[0.9483465,0.000020879752,0.05006115,0.00047035154,0.00009053857,0.000008347268,0.000008479642,0.000019740022,0.0009740161],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9982846,0.00005546678,0.00020844284,0.00054058933,0.00047467076,0.00043624235],"domain_scores_gemma":[0.9980691,0.0010159393,0.000079806996,0.00043612483,0.000119350785,0.00027967745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092321006,0.00018980351,0.00017689838,0.0018804815,0.00020034655,0.00015285047,0.0004166352,0.000080686565,0.0000062477443],"category_scores_gemma":[0.0006452991,0.00016708093,0.000038341273,0.006966664,0.000065457825,0.00021862915,0.0001366096,0.0001904559,0.00006280821],"study_design_candidate":"design_other","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.0002942233,0.0009543414,0.011648095,0.00003739379,0.00005126854,0.00012411995,0.0011627876,0.0000763067,0.0335561,0.0025818592,0.016149014,0.9333645],"study_design_scores_gemma":[0.0071601328,0.010611806,0.55590534,0.00053719175,0.00007337675,0.00032778174,0.00037832913,0.04363149,0.28873512,0.003447567,0.0858857,0.0033061795],"about_ca_topic_score_codex":0.00008092264,"about_ca_topic_score_gemma":0.00004182069,"teacher_disagreement_score":0.9300583,"about_ca_system_score_codex":0.00008599497,"about_ca_system_score_gemma":0.000030024967,"threshold_uncertainty_score":0.6813363},"labels":[],"label_agreement":null},{"id":"W2075824405","doi":"10.1145/2535753.2535755","title":"The energy case for graph processing on hybrid CPU and GPU systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":34,"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 British Columbia","funders":"","keywords":"Computer science; Energy consumption; Graph; Parallel computing; Efficient energy use; Central processing unit; General-purpose computing on graphics processing units; Power consumption; Theoretical computer science; Power (physics); Operating system; Graphics","score_opus":0.010156184585126399,"score_gpt":0.21102561776291512,"score_spread":0.20086943317778871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075824405","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.04539602,0.000617885,0.95119137,0.00070848654,0.00036762794,0.00024388946,0.000001337177,0.00012369826,0.0013497132],"genre_scores_gemma":[0.9961814,0.000010156758,0.0024612267,0.00029862215,0.000046496276,0.00010067655,2.9828334e-7,0.000004757927,0.00089634187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939704,0.000039668314,0.00010453831,0.00019774365,0.00007594137,0.00018508163],"domain_scores_gemma":[0.99942863,0.00019029541,0.000038723112,0.00022226588,0.000059008067,0.000061074796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022458259,0.00008032827,0.000068675574,0.00003878334,0.000469113,0.0005526244,0.00024674955,0.000015575357,0.0000011987386],"category_scores_gemma":[0.000010472134,0.000044698525,0.000028929737,0.00010267456,0.000050829,0.0002775781,0.00005080941,0.000033281052,0.000003833705],"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.0000028574702,0.00001924101,0.0000063888674,0.00002013558,0.000009093495,0.00003931447,0.000117466014,0.000027911605,0.00009525177,0.6763351,0.0017752746,0.32155198],"study_design_scores_gemma":[0.00053962815,0.00031559778,0.000039747618,0.0000574349,0.000008159414,0.0023558948,0.00050975254,0.7456927,0.0061155814,0.22928548,0.014703229,0.00037681762],"about_ca_topic_score_codex":0.00008714311,"about_ca_topic_score_gemma":0.000004607958,"teacher_disagreement_score":0.9507854,"about_ca_system_score_codex":0.0000035647686,"about_ca_system_score_gemma":0.000010234096,"threshold_uncertainty_score":0.532897},"labels":[],"label_agreement":null},{"id":"W207932846","doi":"","title":"On clique graph recognition.","year":2002,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Clique; Clique number; Combinatorics; Graph","score_opus":0.01806779878322305,"score_gpt":0.21572844312336514,"score_spread":0.1976606443401421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W207932846","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.8922311,0.00034071004,0.014828705,0.0022706727,0.009690589,0.00041505782,0.000008993243,0.0011081494,0.07910602],"genre_scores_gemma":[0.9970149,0.000028597415,0.0017276068,0.0008684907,0.000007913584,0.000018016139,0.0000018097039,0.000008873625,0.00032384024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999025,0.000103616614,0.00014468358,0.00030392516,0.00018399529,0.00023876598],"domain_scores_gemma":[0.9991608,0.00015825257,0.000051093866,0.0004757728,0.000054587897,0.00009944547],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021145541,0.00012365199,0.00011320082,0.00012477659,0.00015916389,0.000086169224,0.0005724262,0.000062754785,0.00014162126],"category_scores_gemma":[0.00004793129,0.000118190655,0.00008505985,0.0004900061,0.00004274206,0.00029619568,0.00007064064,0.00017790665,0.0010892408],"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.0000018162684,0.0001485004,0.000028814873,0.0000022533638,0.000008512134,0.000021058713,0.00015849978,0.0000023090167,0.000027029348,0.97772956,0.0038716805,0.017999968],"study_design_scores_gemma":[0.000421988,0.00017857068,0.00018186358,0.000017347606,0.0000025316508,0.00001030293,0.00000539562,0.0014701121,0.0012038975,0.9955781,0.0007612869,0.0001686129],"about_ca_topic_score_codex":0.0000020943721,"about_ca_topic_score_gemma":2.179968e-7,"teacher_disagreement_score":0.10478374,"about_ca_system_score_codex":0.000014115001,"about_ca_system_score_gemma":0.000005406637,"threshold_uncertainty_score":0.9996885},"labels":[],"label_agreement":null},{"id":"W2100910553","doi":"10.1109/icdar.1995.599026","title":"Mathematics recognition using graph rewriting","year":2002,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Rewriting; Computer science; Graph; Graph rewriting; Graph theory; Theoretical computer science; Programming language; Mathematics; Combinatorics","score_opus":0.07381043941321488,"score_gpt":0.23755146925433263,"score_spread":0.16374102984111774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100910553","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.043815583,0.000036977835,0.9340862,0.00009755557,0.0001532236,0.000048478476,3.9568732e-7,0.00020226957,0.02155932],"genre_scores_gemma":[0.2701893,0.00000893641,0.72929996,0.0002241129,0.000043175667,0.000001951591,4.054408e-7,0.000005309087,0.0002268317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994501,0.000025268837,0.00012926018,0.0001440133,0.0001027744,0.00014861718],"domain_scores_gemma":[0.99963194,0.00005064332,0.000041444655,0.00020237599,0.000033950724,0.000039637347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019039166,0.000062898274,0.00006542968,0.00008032697,0.00012219689,0.00009029947,0.00022932714,0.00002618308,0.00015213514],"category_scores_gemma":[0.000020461126,0.00005641355,0.00004556689,0.00032645272,0.000019358033,0.0003708254,0.00005277049,0.000057017565,0.00013205627],"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":[6.894826e-7,0.0003157504,0.00008164167,0.00005836348,0.000028947012,0.00004867623,0.0029343548,0.000073116906,0.003718435,0.4441305,0.0006310091,0.5479785],"study_design_scores_gemma":[0.00011681097,0.000019098585,0.000010892284,0.00003811806,0.000004103225,0.00007915133,0.00013381754,0.6509986,0.0027624262,0.34561148,0.0000750089,0.00015048987],"about_ca_topic_score_codex":0.0000024074777,"about_ca_topic_score_gemma":3.4364177e-7,"teacher_disagreement_score":0.6509255,"about_ca_system_score_codex":0.000005483979,"about_ca_system_score_gemma":0.0000017133643,"threshold_uncertainty_score":0.23004778},"labels":[],"label_agreement":null},{"id":"W2108205548","doi":"10.1109/icmlc.2003.1259799","title":"A graph clustering algorithm with applications to content-based image retrieval","year":2004,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; Computer science; Graph; Algorithm; Pattern recognition (psychology); Theoretical computer science; Artificial intelligence","score_opus":0.018078913132957685,"score_gpt":0.23813355373793052,"score_spread":0.22005464060497285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108205548","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.0018897733,0.00001111208,0.99530196,0.0013071953,0.00005955193,0.00040427464,0.000004940152,0.00032808745,0.00069307897],"genre_scores_gemma":[0.04313681,6.531165e-7,0.9552149,0.0013853785,0.000032794327,0.00006353466,0.0000026349155,0.000010156776,0.00015310188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989567,0.000020816251,0.00014841015,0.00038234887,0.00021522035,0.0002765093],"domain_scores_gemma":[0.99909776,0.000031185577,0.000037830672,0.0005370127,0.0001120468,0.00018415354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018038541,0.00013671826,0.00012215838,0.00015749784,0.00017046358,0.00016126983,0.0006214391,0.00003073167,0.000010414514],"category_scores_gemma":[0.000005830631,0.00010677085,0.000057703128,0.0009598766,0.00006258193,0.0002945691,0.00010230988,0.000090481706,0.00009219342],"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.00016380363,0.0009112169,0.00010967574,0.000059299124,0.00012180564,0.00018987372,0.0012973209,0.004888823,0.07272421,0.7488093,0.0000691799,0.17065552],"study_design_scores_gemma":[0.011465569,0.0027404823,0.002278215,0.00025828017,0.000066171684,0.00030841737,0.0010382348,0.0700661,0.7855142,0.11836883,0.0050797677,0.0028157302],"about_ca_topic_score_codex":0.000027382697,"about_ca_topic_score_gemma":0.0000122406145,"teacher_disagreement_score":0.71279,"about_ca_system_score_codex":0.000028171127,"about_ca_system_score_gemma":0.000058350648,"threshold_uncertainty_score":0.4353989},"labels":[],"label_agreement":null},{"id":"W2111157038","doi":"10.1109/icpr.2002.1047427","title":"A new algorithm for inexact graph matching","year":2003,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Subgraph isomorphism problem; Matching (statistics); Factor-critical graph; Blossom algorithm; Algorithm; Graph isomorphism; 3-dimensional matching; Computer science; Graph; Distance-hereditary graph; Optimal matching; Mathematics; Line graph; Theoretical computer science; Voltage graph","score_opus":0.01168720470694194,"score_gpt":0.23642126287953028,"score_spread":0.22473405817258835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111157038","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.00016815285,0.00006214632,0.99213535,0.00016265122,0.0004239905,0.00013723776,0.0000010821124,0.00018240929,0.006726988],"genre_scores_gemma":[0.009303198,0.0000030987653,0.98735183,0.00051400316,0.000048868365,0.000011151333,7.7802054e-7,0.0000074766126,0.0027596145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922216,0.000037165635,0.00012542792,0.0002564619,0.000106037965,0.00025277375],"domain_scores_gemma":[0.99942535,0.00009588184,0.00003154181,0.00030024096,0.000028023143,0.00011896836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031316048,0.0001052457,0.00010508925,0.000091253096,0.00012074007,0.00012320875,0.00042632173,0.000034879555,0.000050911985],"category_scores_gemma":[0.000014502923,0.00008694613,0.000103617975,0.00032843708,0.0000109299535,0.00036381933,0.000037792164,0.00006226175,0.000028659584],"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":[4.3429876e-7,0.000014317132,0.000004037485,0.0000017984744,0.000008601927,0.0000020593793,0.00015278651,0.000021943108,0.0000690483,0.7563819,0.00093550596,0.24240755],"study_design_scores_gemma":[0.00041388941,0.00006140968,0.00002058882,0.000005405418,0.0000033087679,0.000024180925,0.000039766168,0.010863357,0.0030784456,0.975619,0.009698173,0.00017247406],"about_ca_topic_score_codex":0.000015879197,"about_ca_topic_score_gemma":0.0000016562528,"teacher_disagreement_score":0.24223508,"about_ca_system_score_codex":0.000006036872,"about_ca_system_score_gemma":0.000046239755,"threshold_uncertainty_score":0.35455602},"labels":[],"label_agreement":null},{"id":"W2111607365","doi":"10.14778/1687627.1687727","title":"Distance-join","year":2009,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":207,"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":"Computer science; Reachability; Join (topology); Graph; Theoretical computer science; Query optimization; Shortest path problem; Data mining; Mathematics; Combinatorics","score_opus":0.006708040847259433,"score_gpt":0.20173282838343293,"score_spread":0.1950247875361735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111607365","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.5986049,0.0014454274,0.10718113,0.039101478,0.0027340315,0.0021768238,0.000010968722,0.0009812367,0.24776398],"genre_scores_gemma":[0.9914644,0.000011976216,0.007607733,0.0004128946,0.000037236226,0.00000730535,7.754238e-8,0.0000028923212,0.00045551403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916536,0.0000041380795,0.00016758917,0.0002033222,0.00025977186,0.00019981344],"domain_scores_gemma":[0.9995786,0.000012441799,0.00012316788,0.00016776772,0.00007104229,0.00004697769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023805257,0.000099689954,0.0001139967,0.00004226512,0.000102507205,0.00006288253,0.0011506444,0.000022353019,0.000005090124],"category_scores_gemma":[0.000023767769,0.000063898886,0.00009797885,0.00035160925,0.000044101747,0.00027688776,0.00015503821,0.00008518712,0.0000069998323],"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.0000055839955,0.00008432592,0.0002975663,0.000009975845,0.000007881727,3.3853192e-7,0.0005244343,0.0000044277626,0.016565433,0.96046174,0.0010176725,0.021020636],"study_design_scores_gemma":[0.00045836464,0.00019047677,0.006579966,0.000086866494,0.000011245677,0.000016583928,0.000100645564,0.001393803,0.30702424,0.6775364,0.0063936226,0.00020773437],"about_ca_topic_score_codex":0.000001856344,"about_ca_topic_score_gemma":1.2209364e-7,"teacher_disagreement_score":0.39285943,"about_ca_system_score_codex":0.000022003263,"about_ca_system_score_gemma":0.00000958292,"threshold_uncertainty_score":0.26057208},"labels":[],"label_agreement":null},{"id":"W2113894747","doi":"10.1109/tpami.2006.207","title":"Graphical Models and Point Pattern Matching","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":131,"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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Australian Government; National ICT Australia","keywords":"Euclidean geometry; 3-dimensional matching; Matching (statistics); Algorithm; Time complexity; Graphical model; Mathematics; Graph; Euclidean distance; Point (geometry); Mathematical optimization; Polynomial; Dimension (graph theory); Blossom algorithm; Computer science; Artificial intelligence; Combinatorics","score_opus":0.014186891864550345,"score_gpt":0.241652290326984,"score_spread":0.22746539846243363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113894747","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.021427218,0.00013551068,0.97755975,0.00047792261,0.000109687586,0.00008140492,0.000026103604,0.00009912279,0.000083304534],"genre_scores_gemma":[0.99728507,0.00018266648,0.0019721454,0.0004373973,0.000019146002,0.0000134008005,0.000003343224,0.00001035461,0.00007646642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998429,0.00010479157,0.00036006884,0.0005955256,0.00024187834,0.00026874978],"domain_scores_gemma":[0.9992176,0.00012271895,0.000078309924,0.00041367795,0.000041279825,0.00012638653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029639137,0.00024447002,0.00030652081,0.0005580909,0.00028370158,0.0002242419,0.00034150528,0.00007020831,0.000041636107],"category_scores_gemma":[6.6708856e-7,0.00020826005,0.00023365703,0.000826817,0.00010091702,0.00040806294,0.000009696412,0.00029727397,0.000009589849],"study_design_candidate":"design_other","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.0000066467787,0.0002125579,0.00063954626,0.000017486112,0.00028711616,0.0000286072,0.0004811337,0.056656294,0.00024654125,0.004590978,0.0000033538379,0.93682975],"study_design_scores_gemma":[0.00013431422,0.00010550183,0.0016008607,0.000027457814,0.00030197366,0.000046883535,0.00005536658,0.8776383,0.01769035,0.10196868,0.000011140017,0.0004191611],"about_ca_topic_score_codex":0.0019216492,"about_ca_topic_score_gemma":0.0010799664,"teacher_disagreement_score":0.97585785,"about_ca_system_score_codex":0.000010638664,"about_ca_system_score_gemma":0.0000064585597,"threshold_uncertainty_score":0.84925985},"labels":[],"label_agreement":null},{"id":"W2115139257","doi":"10.1109/tpami.2004.1265866","title":"An eigenspace projection clustering method for inexact graph matching","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Pattern Analysis and Machine Intelligence","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":208,"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 Alberta","funders":"","keywords":"Cluster analysis; Computer science; Eigenvalues and eigenvectors; Matching (statistics); Combinatorics; Graph homomorphism; Projection method; Graph; Theoretical computer science; Algorithm; Mathematics; Line graph; Artificial intelligence; Graph power; Dykstra's projection algorithm","score_opus":0.02158284435524615,"score_gpt":0.304401850513753,"score_spread":0.28281900615850686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115139257","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.0029434494,0.000027763515,0.9960901,0.00024421982,0.0002518717,0.00023767886,0.000034066597,0.00015699699,0.000013860551],"genre_scores_gemma":[0.89851886,0.00006499442,0.10101804,0.00027471423,0.000024544499,0.00005198726,0.0000046479554,0.000013547484,0.000028650107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984656,0.00011534953,0.00032077855,0.0006337934,0.00018837815,0.00027608444],"domain_scores_gemma":[0.9990897,0.000112526184,0.000106584055,0.00048334172,0.00007222587,0.0001355888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005698864,0.00024018242,0.0002933635,0.00072784815,0.00042496744,0.00021990723,0.00042126531,0.000070652066,0.000013710927],"category_scores_gemma":[0.0000023909079,0.000213145,0.00031110234,0.0012044867,0.000036340105,0.0005043312,0.0000043859186,0.00022758005,0.00000412681],"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.00001590247,0.00015172099,0.00002614527,0.00001824367,0.00025675513,0.0000032865348,0.0010823242,0.44453314,0.0013756693,0.0006121147,1.7190825e-7,0.5519245],"study_design_scores_gemma":[0.00023650345,0.00044540685,0.000190459,0.00003375323,0.00040279297,0.000035945603,0.00023942947,0.8053698,0.1676376,0.024975391,0.000010913193,0.00042202233],"about_ca_topic_score_codex":0.0016477936,"about_ca_topic_score_gemma":0.0027390171,"teacher_disagreement_score":0.8955754,"about_ca_system_score_codex":0.000033081615,"about_ca_system_score_gemma":0.000018674953,"threshold_uncertainty_score":0.8691801},"labels":[],"label_agreement":null},{"id":"W2116063286","doi":"10.1109/iv.2004.1320123","title":"Strahler based graph clustering using convolution","year":2004,"lang":"en","type":"article","venue":"Proceedings. Eighth International Conference on Information Visualisation, 2004. IV 2004.","topic":"Graph Theory and Algorithms","field":"Computer Science","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science; Cluster analysis; Convolution (computer science); Graph; Theoretical computer science; Artificial intelligence; Artificial neural network","score_opus":0.04784909218101415,"score_gpt":0.2953178587110025,"score_spread":0.24746876652998837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116063286","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.025899576,0.000018631981,0.9537842,0.0012165173,0.0013543334,0.00045294003,0.000040884584,0.00044119346,0.016791688],"genre_scores_gemma":[0.9709188,0.000012796583,0.02686102,0.0016992538,0.00019910891,0.000054143697,0.0001447725,0.000017378095,0.00009274511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711674,0.000029417262,0.000893383,0.00043597416,0.0010737428,0.0004507408],"domain_scores_gemma":[0.9972503,0.000028541159,0.0006460286,0.00024496106,0.0016338663,0.00019626207],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00067540735,0.00038932022,0.00025060074,0.000948461,0.00046247453,0.0010963599,0.0010684035,0.00018452136,0.0002566198],"category_scores_gemma":[0.000124468,0.00038965652,0.0001399198,0.00079851464,0.00012400225,0.007313586,0.000104333296,0.00031012777,0.0002184615],"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.00005603301,0.00012471217,0.00034272744,0.000048624577,0.00004566059,0.0000014963657,0.0018146816,0.019521743,0.00079632294,0.9748297,0.00036066666,0.0020576383],"study_design_scores_gemma":[0.0026525748,0.00024940743,0.0018300177,0.0003650112,0.000020168092,0.000046249246,0.00059265376,0.90030205,0.0055150366,0.08584587,0.0017985885,0.00078237016],"about_ca_topic_score_codex":0.000045777597,"about_ca_topic_score_gemma":0.0000032716675,"teacher_disagreement_score":0.9450192,"about_ca_system_score_codex":0.00047667985,"about_ca_system_score_gemma":0.00034871526,"threshold_uncertainty_score":0.9999406},"labels":[],"label_agreement":null},{"id":"W2118975867","doi":"10.1007/s13042-013-0210-4","title":"EM-type method for measuring graph dissimilarity","year":2013,"lang":"en","type":"article","venue":"International Journal of Machine Learning and Cybernetics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Université de Sherbrooke","keywords":"Adjacency matrix; Bipartite graph; Similarity measure; Computer science; Pairwise comparison; Distance matrix; Measure (data warehouse); Graph; Mathematics; Algorithm; Pattern recognition (psychology); Artificial intelligence; Theoretical computer science; Data mining","score_opus":0.014220490175747197,"score_gpt":0.2833475307028529,"score_spread":0.2691270405271057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118975867","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.05788255,0.0006671123,0.93884313,0.0014673023,0.0008069504,0.000058007998,0.0000015526423,0.000023543615,0.00024985676],"genre_scores_gemma":[0.81304353,0.00012835127,0.18617696,0.00017125123,0.00017500234,0.0000016802288,0.0000015337332,0.0000080041455,0.00029368632],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990728,0.00011556848,0.000264868,0.0001219446,0.00030072173,0.00012412808],"domain_scores_gemma":[0.998786,0.00026206908,0.00023539555,0.00006861369,0.0005567932,0.00009116506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000729808,0.00009448732,0.00013798571,0.00014542346,0.00008289666,0.00024162662,0.0005300921,0.00003927955,0.00002370223],"category_scores_gemma":[0.00028959333,0.000076596465,0.00009516365,0.000087594286,0.000022763626,0.00025091157,0.00010584404,0.0003062236,0.0000026078126],"study_design_candidate":"design_other","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.00007518184,0.00015792677,0.017800454,0.0000197016,0.00037442573,0.000033088105,0.002004607,0.003547821,0.0021961648,0.056141045,0.00037774837,0.91727185],"study_design_scores_gemma":[0.002013885,0.0008751892,0.023836255,0.00015269766,0.000056593148,0.0008520082,0.00024847858,0.59983635,0.0023239711,0.34851167,0.020860182,0.00043270426],"about_ca_topic_score_codex":0.000026192005,"about_ca_topic_score_gemma":0.0000031993868,"teacher_disagreement_score":0.9168391,"about_ca_system_score_codex":0.000011798839,"about_ca_system_score_gemma":0.000017809478,"threshold_uncertainty_score":0.31235132},"labels":[],"label_agreement":null},{"id":"W2129423489","doi":"10.1109/wcre.2009.49","title":"Approximate Graph Matching in Software Engineering","year":2009,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Graph; Theoretical computer science; Matching (statistics); Software; Software engineering; Programming language; Mathematics","score_opus":0.005741452150948093,"score_gpt":0.1976688734706863,"score_spread":0.1919274213197382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129423489","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.05041754,0.000034140197,0.9484483,0.00013419711,0.000094530245,0.000042376116,1.5278086e-7,0.00030856347,0.000520204],"genre_scores_gemma":[0.6905979,0.0000021861676,0.3090815,0.00025647588,0.000011925969,0.0000020604814,3.2181242e-7,0.0000025868287,0.000045049663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994406,0.000011563796,0.00010152642,0.00016911993,0.00008042125,0.0001967336],"domain_scores_gemma":[0.9997056,0.000029357203,0.000013443631,0.00020462017,0.000007267901,0.000039683768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018211258,0.00007552983,0.00007730245,0.00014042371,0.0000299783,0.0000666113,0.00037469712,0.000024048199,0.0000052906953],"category_scores_gemma":[0.000011346995,0.000067062334,0.000034026067,0.0003827231,0.0000044726976,0.00034394374,0.000042139996,0.000090570036,0.0000102807235],"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.0000012570305,0.00004893954,0.00026316498,0.000008037812,0.0000028520917,0.000040441122,0.0007670818,0.007134171,0.0008679107,0.9426499,0.000020866008,0.0481954],"study_design_scores_gemma":[0.0003654785,0.0000596552,0.012845765,0.000051706586,0.0000012639524,0.00003248262,0.000038692408,0.09593913,0.0034072187,0.88679355,0.000090360925,0.00037472037],"about_ca_topic_score_codex":0.0000036654073,"about_ca_topic_score_gemma":6.7462e-7,"teacher_disagreement_score":0.64018035,"about_ca_system_score_codex":0.0000062732315,"about_ca_system_score_gemma":0.0000046543296,"threshold_uncertainty_score":0.27347228},"labels":[],"label_agreement":null},{"id":"W2129793745","doi":"","title":"Compressing pattern databases","year":2004,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":30,"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 Alberta","funders":"","keywords":"Computer science; Table (database); Database; Uncompressed video; Tile; Heuristic; Pattern search; Function (biology); Data mining; Algorithm; Artificial intelligence","score_opus":0.02648172879963302,"score_gpt":0.2554887542560906,"score_spread":0.22900702545645757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129793745","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.011990283,0.000031745793,0.9839091,0.00037176895,0.00016276873,0.000022469418,0.0000011472436,0.00016730068,0.0033434706],"genre_scores_gemma":[0.9204235,0.0000013175539,0.07870778,0.0007645128,0.000026309386,0.000001188547,0.0000015140173,0.0000020734951,0.000071825125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995763,0.0000139465465,0.000061502964,0.00014846245,0.00008132798,0.00011848627],"domain_scores_gemma":[0.99960583,0.000028984401,0.000014809719,0.00029941538,0.000010956766,0.00004002666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007000198,0.000049454284,0.000046153775,0.000030436791,0.000079956844,0.00007156122,0.0003642824,0.000007326286,0.000025148945],"category_scores_gemma":[0.0000050521744,0.000039247992,0.000021868118,0.00010751641,0.00002277506,0.0004110432,0.00014188755,0.000040294395,0.00009270671],"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":[4.978322e-7,0.000071639355,0.00040147893,0.00000474448,0.0000061312408,0.00004222881,0.00028500997,0.0005499296,0.001064356,0.8115147,0.000106750726,0.18595257],"study_design_scores_gemma":[0.0034099547,0.00019907638,0.012907859,0.0002560061,0.000014583709,0.00020370628,0.00025241708,0.0848834,0.21777855,0.65761065,0.020987844,0.0014959304],"about_ca_topic_score_codex":0.000037048278,"about_ca_topic_score_gemma":0.0000042719325,"teacher_disagreement_score":0.9084332,"about_ca_system_score_codex":0.0000046026075,"about_ca_system_score_gemma":0.000011087265,"threshold_uncertainty_score":0.16004866},"labels":[],"label_agreement":null},{"id":"W2138333931","doi":"10.1007/s10766-007-0066-x","title":"Analyzing the Effects of Hyperthreading on the Performance of Data Management Systems","year":2008,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Pentium; Multithreading; Operating system; Benchmark (surveying); Parallel computing; Computer architecture; Embedded system","score_opus":0.03246800490371323,"score_gpt":0.27333945681580585,"score_spread":0.2408714519120926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138333931","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.70177853,0.0012840572,0.29432738,0.00061783503,0.0014274446,0.0002659098,0.0000015611577,0.000013167757,0.00028411404],"genre_scores_gemma":[0.9863571,0.00030985073,0.013155836,0.00002886733,0.00010503016,0.0000039423776,7.746883e-7,0.0000041799894,0.000034423276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986699,0.000106352796,0.00042692875,0.000119369535,0.0005540619,0.00012337232],"domain_scores_gemma":[0.9983607,0.00043638414,0.0005700436,0.0004004092,0.0002053447,0.000027136848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010527651,0.0000864321,0.00015298382,0.00014594066,0.000108639564,0.000059021622,0.0030015255,0.000017552828,0.0000011838463],"category_scores_gemma":[0.000060605533,0.000046221532,0.00009029879,0.00019985714,0.0001005759,0.00045540213,0.00031773536,0.00015867614,0.0000015538583],"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.0002415263,0.00073967694,0.017995728,0.00037647857,0.0027963303,0.0005852806,0.0040338007,0.01952721,0.0014573415,0.33647007,0.00050099764,0.61527556],"study_design_scores_gemma":[0.007206644,0.004216247,0.040631514,0.009799872,0.0004624088,0.0048320275,0.002537546,0.8828821,0.016182464,0.00768977,0.022281608,0.0012777754],"about_ca_topic_score_codex":0.000005631536,"about_ca_topic_score_gemma":2.1157692e-7,"teacher_disagreement_score":0.8633549,"about_ca_system_score_codex":0.000017990302,"about_ca_system_score_gemma":0.000021917052,"threshold_uncertainty_score":0.5577631},"labels":[],"label_agreement":null},{"id":"W2141151760","doi":"10.1016/j.laa.2008.12.010","title":"Superstochastic matrices and magic Markov chains","year":2009,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Markov chain; Mathematics; MAGIC (telescope); Examples of Markov chains; Algebra over a field; Balance equation; Mathematical economics; Markov model; Pure mathematics; Statistics","score_opus":0.007191342446645483,"score_gpt":0.22854037711978392,"score_spread":0.22134903467313843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141151760","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.06734825,0.0031998432,0.92258203,0.0041431095,0.00004820665,0.0004608984,0.000012907561,0.00021781088,0.001986926],"genre_scores_gemma":[0.98327756,0.00031353164,0.015088603,0.00071030593,0.00011168139,0.000030209958,0.0000053440817,0.0000052080086,0.0004575766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993608,0.000016125838,0.00011328954,0.00027631377,0.000078177756,0.00015528456],"domain_scores_gemma":[0.9995503,0.000059256057,0.000030427927,0.00022134242,0.00003128211,0.00010741707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000979591,0.00009702273,0.00009302504,0.00007914962,0.00019718672,0.00008441796,0.00023863773,0.00003833826,0.000008395626],"category_scores_gemma":[0.000007981401,0.000086106775,0.000022155267,0.0003120784,0.000035982648,0.0002120922,0.000058979447,0.00007892975,0.00003595156],"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.0000013580084,0.000038327995,0.000019801333,0.000007907151,0.000004659586,9.838492e-7,0.00023733538,0.0000037180687,0.0006344138,0.9452825,0.000039281094,0.053729694],"study_design_scores_gemma":[0.00116548,0.00046456757,0.0125889005,0.00004562459,0.00006938702,0.0002082608,0.00021204473,0.4148213,0.0017644644,0.54431355,0.023337333,0.0010090708],"about_ca_topic_score_codex":0.0000010209432,"about_ca_topic_score_gemma":3.4262527e-7,"teacher_disagreement_score":0.9159293,"about_ca_system_score_codex":0.0000031570187,"about_ca_system_score_gemma":0.000010064974,"threshold_uncertainty_score":0.35113323},"labels":[],"label_agreement":null},{"id":"W2142955537","doi":"10.1145/2063576.2063747","title":"Practical representations for web and social graphs","year":2011,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":36,"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; Ministerio de Ciencia e Innovación","keywords":"Computer science; Theoretical computer science; Search engine indexing; Graph; Focus (optics); Artificial intelligence","score_opus":0.07751962445504977,"score_gpt":0.323755814836158,"score_spread":0.24623619038110822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142955537","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.010237333,0.000003868115,0.97123784,0.0018467465,0.00014209448,0.00011788556,0.0000020417644,0.000100433106,0.016311735],"genre_scores_gemma":[0.68111014,0.0000011503653,0.31830806,0.00026671236,0.000019040122,0.00001817468,4.88911e-7,0.0000020633831,0.00027414536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963593,0.000024533038,0.000059706686,0.0001408874,0.00004565963,0.000093285424],"domain_scores_gemma":[0.99974006,0.00008593303,0.000018192712,0.000098625474,0.000028903494,0.000028281382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013951391,0.000035765333,0.00004165744,0.000034745026,0.00014372941,0.000036889905,0.00010809024,0.000021008842,0.000022753717],"category_scores_gemma":[0.000018690233,0.000029880455,0.000031149826,0.00008586591,0.00004996448,0.00029529497,0.000051420902,0.00003067602,0.0000058549435],"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.0000027873837,0.000021749373,0.00015092231,0.0000015418507,0.0000054666416,0.0000016416647,0.0006739862,9.141012e-9,0.000093278664,0.99510163,0.0013241062,0.002622854],"study_design_scores_gemma":[0.00031384328,0.00006654711,0.006613153,8.1685147e-7,0.0000076173183,0.000025885805,0.00022678445,0.0059080636,0.0011012087,0.9839354,0.0017005431,0.00010014619],"about_ca_topic_score_codex":0.0000035728494,"about_ca_topic_score_gemma":0.0000022929419,"teacher_disagreement_score":0.6708728,"about_ca_system_score_codex":0.0000010565037,"about_ca_system_score_gemma":0.000014311892,"threshold_uncertainty_score":0.12184896},"labels":[],"label_agreement":null},{"id":"W2148778401","doi":"10.1111/cgf.12744","title":"Procedural Tree Modeling with Guiding Vectors","year":2015,"lang":"en","type":"article","venue":"Computer Graphics Forum","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Graph; Tree (set theory); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.04156342106086449,"score_gpt":0.2319898529603861,"score_spread":0.1904264318995216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148778401","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.0483487,0.000117548225,0.9488755,0.0008612622,0.0007238732,0.00015006479,8.9869394e-7,0.00041748633,0.00050466787],"genre_scores_gemma":[0.9139946,0.000003711521,0.0847765,0.0010160443,0.000148398,0.000013474393,0.00000366676,0.000021248585,0.000022368851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822766,0.000060241757,0.00024451927,0.00051219173,0.00040160347,0.0005537709],"domain_scores_gemma":[0.9987785,0.000036531754,0.000079800346,0.00059668237,0.00022327517,0.00028519792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040790622,0.0002515037,0.00022042765,0.0002902428,0.00022463266,0.00026937012,0.0011453159,0.000076329336,6.268782e-7],"category_scores_gemma":[0.000010158979,0.00020035027,0.00010451645,0.0009470397,0.00007670023,0.00080383715,0.0003801944,0.00016809185,0.000013938327],"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.000018974037,0.00007193746,0.0014894516,0.000013790313,0.000052481326,0.000046312274,0.0011167404,0.008082481,0.000014727966,0.9773042,0.0014073193,0.010381546],"study_design_scores_gemma":[0.00051782397,0.00029409307,0.00006318355,0.00004523484,0.00000731929,0.000089724024,0.00006358002,0.90388495,0.00013682623,0.09399535,0.00059239654,0.00030951932],"about_ca_topic_score_codex":0.000009380675,"about_ca_topic_score_gemma":0.000013199753,"teacher_disagreement_score":0.89580244,"about_ca_system_score_codex":0.000024001347,"about_ca_system_score_gemma":0.00010475441,"threshold_uncertainty_score":0.81700474},"labels":[],"label_agreement":null},{"id":"W2149071703","doi":"10.1145/2600212.2600233","title":"Computation and communication efficient graph processing with distributed immutable view","year":2014,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Program for New Century Excellent Talents in University; Ministry of Education, Science and Technology; Foundation for the Author of National Excellent Doctoral Dissertation of the People's Republic of China; Ministry of Education of the People's Republic of China; Shanghai Science and Technology Development Foundation","keywords":"Computer science; Computation; Vertex (graph theory); Parallel computing; Multi-core processor; Theoretical computer science; Graph partition; Graph; Cyclops; Algorithm","score_opus":0.006113506646535271,"score_gpt":0.2129358644929133,"score_spread":0.20682235784637804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149071703","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.037451193,0.00022229952,0.9609345,0.00031966885,0.000016049555,0.000088634326,5.8270535e-7,0.00013136356,0.00083568034],"genre_scores_gemma":[0.91096556,0.0000065676363,0.08889684,0.00009735276,0.0000034995908,0.000005932197,0.00000990718,0.000003071155,0.000011290624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940056,0.00009117918,0.00010586598,0.00017412871,0.00010751036,0.00012075278],"domain_scores_gemma":[0.99953014,0.000060617793,0.000060674975,0.00023076667,0.00007355287,0.000044258893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035496207,0.00007598542,0.000089643414,0.000046291298,0.0002497,0.00018017816,0.00024055039,0.000019012206,0.0000014413891],"category_scores_gemma":[0.0000067915294,0.000054870638,0.000012110975,0.00037954206,0.000070585025,0.00021962203,0.00008630757,0.000058357346,0.000003315686],"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.000012849275,0.0001692653,0.00059425447,0.000086941094,0.000016625921,0.0000011516801,0.0011199181,0.021632217,0.00028418654,0.5132827,0.000053849282,0.46274602],"study_design_scores_gemma":[0.00034563546,0.00007286819,0.002936137,0.000067724075,0.000005917024,0.000017644072,0.000051392424,0.96877515,0.0004964898,0.026812492,0.00028456596,0.0001339686],"about_ca_topic_score_codex":0.000008073648,"about_ca_topic_score_gemma":0.000002000758,"teacher_disagreement_score":0.94714296,"about_ca_system_score_codex":0.000005931422,"about_ca_system_score_gemma":0.000010830189,"threshold_uncertainty_score":0.22375597},"labels":[],"label_agreement":null},{"id":"W2156519507","doi":"10.1109/ipdps.2013.37","title":"On Graphs, GPUs, and Blind Dating: A Workload to Processor Matchmaking Quest","year":2013,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":56,"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 British Columbia","funders":"Nvidia","keywords":"Computer science; Workload; Graph partition; Partition (number theory); Parallel computing; Implementation; Distributed computing; Graph; Supercomputer; Theoretical computer science; Operating system","score_opus":0.011576607918463279,"score_gpt":0.24096854713722363,"score_spread":0.22939193921876036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156519507","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.76995474,0.000119108496,0.2081306,0.0025264178,0.00030154243,0.00062490505,9.544018e-7,0.00039774238,0.01794397],"genre_scores_gemma":[0.9470363,0.0000042280176,0.050274752,0.0018279407,0.000027061376,0.000051165774,4.018669e-7,0.0000070777787,0.00077103754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990361,0.00003366397,0.00014170245,0.00037733026,0.00015692276,0.00025431975],"domain_scores_gemma":[0.99933887,0.00009132335,0.000041112067,0.000326273,0.000054164742,0.00014825117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021255005,0.00012702377,0.00011136365,0.00014252194,0.00014094004,0.00040850622,0.00047146383,0.000037079248,0.000060469287],"category_scores_gemma":[0.00003716108,0.00009818935,0.00002417874,0.0004988991,0.000029545838,0.0004669941,0.00018741118,0.00009949517,0.00019945411],"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.0000088706365,0.00007980053,0.00046427496,0.000019030942,0.000011632381,0.0000063245066,0.0009343326,0.000024142257,0.0006120722,0.85763246,0.0013404588,0.1388666],"study_design_scores_gemma":[0.000921709,0.0004833294,0.0056599164,0.0003401792,0.000006952456,0.0000381892,0.00026222738,0.014925427,0.006325213,0.9689008,0.0014016092,0.0007344773],"about_ca_topic_score_codex":0.000031626143,"about_ca_topic_score_gemma":0.000005640173,"teacher_disagreement_score":0.17708158,"about_ca_system_score_codex":0.0000050590875,"about_ca_system_score_gemma":0.000012107427,"threshold_uncertainty_score":0.40040457},"labels":[],"label_agreement":null},{"id":"W2157149375","doi":"10.1142/s0218001404003186","title":"INEXACT GRAPH MATCHING USING EIGEN-SUBSPACE PROJECTION CLUSTERING","year":2004,"lang":"en","type":"article","venue":"International Journal of Pattern Recognition and Artificial Intelligence","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":36,"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 Alberta","funders":"","keywords":"Vertex (graph theory); Subspace topology; Combinatorics; Cluster analysis; Mathematics; Matching (statistics); Graph; Pattern recognition (psychology); Computer science; Artificial intelligence","score_opus":0.08839100040127454,"score_gpt":0.3158971288049581,"score_spread":0.2275061284036836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157149375","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.3061132,0.000037528334,0.6919987,0.0004446726,0.0012894485,0.000049349306,0.000004177219,0.000020328109,0.00004256922],"genre_scores_gemma":[0.9781075,0.0000935957,0.021097861,0.00030106617,0.00038462016,0.0000015076769,0.0000024113983,0.000008354251,0.0000030726555],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868345,0.000068028836,0.00052166585,0.00019656698,0.00037154905,0.0001587284],"domain_scores_gemma":[0.99896944,0.00005557601,0.00038211554,0.000086077336,0.00041767888,0.000089111214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004947439,0.00013291935,0.0001405038,0.0004184382,0.0001203963,0.00034338515,0.00044036453,0.000051808707,0.000027370308],"category_scores_gemma":[0.00004309209,0.00012404946,0.000109271845,0.0002134299,0.000058251066,0.0010264743,0.00010142752,0.00023471384,0.000020149955],"study_design_candidate":"design_other","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.000055259577,0.00017486775,0.00012263986,0.000012907335,0.000093011775,0.0001709657,0.0030783848,0.009287976,0.012874416,0.0037428928,0.0000013957031,0.9703853],"study_design_scores_gemma":[0.00026028627,0.00027222486,0.00024371294,0.00063620927,0.000025383351,0.002157284,0.0015647641,0.038400207,0.08226121,0.87375474,0.000033729142,0.0003902338],"about_ca_topic_score_codex":0.000080130936,"about_ca_topic_score_gemma":0.000034527005,"teacher_disagreement_score":0.969995,"about_ca_system_score_codex":0.00006327239,"about_ca_system_score_gemma":0.000051412073,"threshold_uncertainty_score":0.505859},"labels":[],"label_agreement":null},{"id":"W2157427457","doi":"10.1145/2370816.2370866","title":"A yoke of oxen and a thousand chickens for heavy lifting graph processing","year":2012,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":134,"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 British Columbia","funders":"","keywords":"Locality; Computer science; Parallel computing; Memory footprint; Graph; Load balancing (electrical power); Footprint; Theoretical computer science; Mathematics; Programming language; Geography","score_opus":0.015949486251581872,"score_gpt":0.25184021614436575,"score_spread":0.23589072989278387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157427457","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.30180433,0.0006372885,0.6954016,0.00015935909,0.00009249926,0.00014858562,0.0000011314589,0.000075196636,0.0016799828],"genre_scores_gemma":[0.88081807,0.0000037092611,0.11893031,0.000118586846,0.000047116082,0.000008932398,3.2470632e-7,0.0000043627806,0.00006859617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994227,0.000020977857,0.00012264076,0.0001366502,0.00007287953,0.00022412183],"domain_scores_gemma":[0.9996223,0.00007545297,0.000057293993,0.00013465068,0.00003760025,0.00007270379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045784705,0.00007141505,0.000108973145,0.00006583746,0.00012139721,0.000048441547,0.00017212209,0.000027949225,0.0000024764101],"category_scores_gemma":[0.000026008922,0.000054534714,0.0000381873,0.00019472226,0.000048689966,0.0004406963,0.000079712874,0.000039832485,5.9090127e-7],"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.000035342484,0.00028371575,0.04682463,0.00037625342,0.000045496316,0.0000010767337,0.015278172,0.0000070016554,0.0038300029,0.613251,0.00020029605,0.319867],"study_design_scores_gemma":[0.004499132,0.0010486176,0.06360689,0.00049092056,0.0001141535,0.00025184854,0.002778337,0.14358403,0.13376175,0.6425092,0.0054947445,0.0018603423],"about_ca_topic_score_codex":0.0000030897222,"about_ca_topic_score_gemma":0.0000012724375,"teacher_disagreement_score":0.5790137,"about_ca_system_score_codex":0.0000018950126,"about_ca_system_score_gemma":0.00001248984,"threshold_uncertainty_score":0.2223861},"labels":[],"label_agreement":null},{"id":"W2157788896","doi":"10.1109/robot.1990.126278","title":"Heuristic relaxation approaches for 3-D object recognition","year":2002,"lang":"en","type":"article","venue":"","topic":"Graph Theory 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":"University of Alberta","funders":"","keywords":"Heuristic; Object (grammar); Computer science; Relaxation (psychology); Cognitive neuroscience of visual object recognition; Representation (politics); Artificial intelligence; Tree (set theory); Theoretical computer science; Machine learning; Algorithm; Pattern recognition (psychology); Mathematics; Combinatorics; Psychology","score_opus":0.08661393962803618,"score_gpt":0.22222010199987421,"score_spread":0.13560616237183803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157788896","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.0030509827,0.00004318034,0.9806993,0.00031108232,0.0001794857,0.00015816906,0.0000018483179,0.00016440138,0.015391576],"genre_scores_gemma":[0.8676318,0.0000066569887,0.1305097,0.00016852608,0.000064990556,0.000053196476,0.0000072917255,0.0000048162296,0.0015530254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995006,0.00003156029,0.00009419742,0.00018719805,0.000068087575,0.00011841325],"domain_scores_gemma":[0.9996371,0.0001010018,0.00003814941,0.00016562121,0.000028094972,0.000030017702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018591773,0.00005730393,0.00005432163,0.00005364496,0.00010122792,0.00006326361,0.00017714851,0.000030056355,0.000048196667],"category_scores_gemma":[0.0000564771,0.000049207043,0.000045769386,0.000163045,0.000015160154,0.00028568596,0.000020772288,0.000036118512,0.00012864704],"study_design_candidate":"design_other","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.000002848823,0.000081520615,0.000020654372,0.000014392955,0.00000858469,0.0000010330036,0.00047408728,0.00003464582,0.000046883863,0.27609056,0.001413711,0.72181106],"study_design_scores_gemma":[0.0002812327,0.00010958285,0.00023173275,0.0000070941355,0.000005436276,0.000010690163,0.00003373985,0.59134763,0.0015356629,0.40542656,0.0008660808,0.00014458699],"about_ca_topic_score_codex":0.00000101891,"about_ca_topic_score_gemma":6.3490546e-7,"teacher_disagreement_score":0.8645808,"about_ca_system_score_codex":0.0000071198933,"about_ca_system_score_gemma":0.0000025821378,"threshold_uncertainty_score":0.2006605},"labels":[],"label_agreement":null},{"id":"W2165971212","doi":"10.1145/1835804.1835873","title":"Neighbor query friendly compression of social networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Social network (sociolinguistics); Theoretical computer science; Benchmark (surveying); Data mining; Sublinear function; Data compression; k-nearest neighbors algorithm; Compression (physics); Algorithm; Social media; Artificial intelligence; World Wide Web; Mathematics; Discrete mathematics","score_opus":0.004371475453233396,"score_gpt":0.2207293016155749,"score_spread":0.2163578261623415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165971212","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.07083888,0.000011390166,0.911992,0.00022710585,0.0009732559,0.000049162558,8.6045384e-7,0.00010590292,0.015801454],"genre_scores_gemma":[0.9770422,6.82259e-7,0.022462917,0.00011989956,0.00012832209,0.0000019148229,8.932757e-7,0.000003162257,0.00024003671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994199,0.000036616628,0.00012709037,0.0001555729,0.00011283553,0.0001479526],"domain_scores_gemma":[0.99956673,0.000058534646,0.00005705132,0.00023102015,0.000042173044,0.0000444605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019374136,0.00006655828,0.00009995981,0.00003796078,0.000108019834,0.000032314347,0.00052198424,0.00007013447,0.00011866823],"category_scores_gemma":[0.000006829692,0.000051326446,0.000060568946,0.00018047103,0.00007135059,0.00021356846,0.00015690865,0.00017686316,0.000009523798],"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.00000349545,0.000045272252,0.00017843921,0.000002280834,0.000004436041,0.0000017765692,0.00018587474,0.000031231077,0.005862469,0.9609212,0.00105104,0.031712435],"study_design_scores_gemma":[0.0013047073,0.00024793774,0.035886716,0.000025164727,0.000013831083,0.000023798335,0.00014076453,0.7331586,0.04458891,0.16372384,0.020160673,0.0007250762],"about_ca_topic_score_codex":0.0000069907715,"about_ca_topic_score_gemma":0.000004665118,"teacher_disagreement_score":0.90620327,"about_ca_system_score_codex":0.0000013831318,"about_ca_system_score_gemma":0.00001364289,"threshold_uncertainty_score":0.20930317},"labels":[],"label_agreement":null},{"id":"W2169658931","doi":"10.1177/1094342005051196","title":"CGMGRAPH/CGMLIB: Implementing and Testing CGM Graph Algorithms on PC Clusters and Shared Memory Machines","year":2005,"lang":"en","type":"article","venue":"The International Journal of High Performance Computing Applications","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Scalability; Gigabit Ethernet; Speedup; Graph; Algorithm; Ethernet; Theoretical computer science; Operating system","score_opus":0.014685999202683315,"score_gpt":0.2610724801576682,"score_spread":0.2463864809549849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169658931","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.7909834,0.000229478,0.20374312,0.004327819,0.00025192197,0.00015924088,0.000006339007,0.00006274497,0.000235971],"genre_scores_gemma":[0.93953776,0.00007410849,0.0591522,0.0006374752,0.0005580941,0.000008235816,0.0000025301588,0.000010489871,0.000019112194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854064,0.000051654435,0.00049838173,0.0002362799,0.00041817038,0.0002548826],"domain_scores_gemma":[0.9984188,0.0004528151,0.00049365096,0.00023488593,0.00031787655,0.00008196477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012044016,0.00016163394,0.00016528653,0.00028543544,0.00065534166,0.00035624948,0.0012080129,0.000030165189,0.0000035295584],"category_scores_gemma":[0.000034726796,0.0001196108,0.00005751693,0.00032594497,0.000115554285,0.00050409697,0.00044391816,0.00031214766,0.0000039766296],"study_design_candidate":"design_other","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.000016726068,0.000076731514,0.0020736433,0.000011534335,0.00011104798,0.0000035065398,0.0010441751,0.0077707693,0.00053761306,0.018528512,0.00011292017,0.9697128],"study_design_scores_gemma":[0.0015693742,0.0002466298,0.038815055,0.00027781393,0.000046425794,0.0011975644,0.00022573184,0.9331126,0.0024614746,0.01879658,0.002840133,0.00041058077],"about_ca_topic_score_codex":0.000014320611,"about_ca_topic_score_gemma":0.0000019837928,"teacher_disagreement_score":0.96930224,"about_ca_system_score_codex":0.00003107019,"about_ca_system_score_gemma":0.000032397977,"threshold_uncertainty_score":0.50404245},"labels":[],"label_agreement":null},{"id":"W2174092017","doi":"10.1007/978-3-540-78808-9_13","title":"Characterization of Graphs Using Degree Cores","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Dalhousie University","funders":"","keywords":"Computer science; Degree (music); Characterization (materials science); Physics; Optics","score_opus":0.03173046588125576,"score_gpt":0.23717080196243975,"score_spread":0.205440336081184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174092017","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.0075938115,0.00016807494,0.9900017,0.000051186827,0.001324097,0.00022750265,0.000008962743,0.00008285872,0.00054185634],"genre_scores_gemma":[0.54892486,0.00018936294,0.44979665,0.00060170685,0.00029682255,0.0000039505926,0.00001405524,0.000045639394,0.00012695865],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733317,0.00003810411,0.0005051422,0.0009582878,0.0007363236,0.0004289929],"domain_scores_gemma":[0.99801505,0.00017314954,0.00043471996,0.0010149586,0.00025358427,0.000108539774],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046342527,0.00039155572,0.00048281814,0.0010504365,0.0002309144,0.00013882494,0.0024271288,0.0002366068,0.000010285359],"category_scores_gemma":[0.00003208923,0.0003623404,0.00015657337,0.00084431446,0.0009890264,0.0006435637,0.00070327934,0.00042165635,0.000006347931],"study_design_candidate":"design_other","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.000011994469,0.00006750396,0.0002256358,0.000076717624,0.000027315404,0.00015699217,0.002046277,0.008670108,0.026773173,0.07967835,0.000002638756,0.8822633],"study_design_scores_gemma":[0.00037551054,0.00025631598,0.0013815232,0.0007294856,0.000015343103,0.00031950904,1.3185229e-7,0.63880676,0.034522567,0.32224828,0.00028609607,0.0010584595],"about_ca_topic_score_codex":0.000009492126,"about_ca_topic_score_gemma":0.0000059897284,"teacher_disagreement_score":0.88120484,"about_ca_system_score_codex":0.00007271041,"about_ca_system_score_gemma":0.00031754788,"threshold_uncertainty_score":0.9998829},"labels":[],"label_agreement":null},{"id":"W2177559317","doi":"10.1109/3dv.2015.14","title":"Graph Edit Distance Based on Triangle-Stars Decomposition for Deformable 3D Objects Recognition","year":2015,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"National Research Council Canada; Agence Nationale de la Recherche","keywords":"Computer science; Stars; Artificial intelligence; Graph; Decomposition; Computer vision; Theoretical computer science","score_opus":0.031005320265919983,"score_gpt":0.2587241162740677,"score_spread":0.22771879600814773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177559317","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.004497256,0.000018039145,0.9866795,0.00033805319,0.0010483891,0.00036073098,0.000023847286,0.00022779142,0.006806397],"genre_scores_gemma":[0.7367432,0.000002659712,0.260807,0.0016132782,0.00024554602,0.00014491491,0.000111410525,0.000015433634,0.0003165393],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988954,0.00007551196,0.00019551466,0.0003182075,0.0002304807,0.000284858],"domain_scores_gemma":[0.9991144,0.00017003075,0.000084031504,0.00031971626,0.0001572143,0.00015461176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067894935,0.00013901033,0.00014613672,0.00016758013,0.00015858903,0.00012477014,0.00032820285,0.00005848467,0.000011480403],"category_scores_gemma":[0.000054677017,0.000118552714,0.00010888658,0.000385651,0.000029060011,0.00067600724,0.000025564566,0.000075193006,0.000055449014],"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.003133903,0.0023390988,0.0002561449,0.0002447709,0.00012951845,0.00006969586,0.002565498,0.025699722,0.0017095248,0.27861047,0.042997304,0.64224434],"study_design_scores_gemma":[0.0033001236,0.0010416443,0.00005477355,0.00007131715,0.000014597797,0.0000067824176,0.00007803832,0.77858216,0.012506956,0.20055483,0.00340858,0.00038019597],"about_ca_topic_score_codex":0.0000064995465,"about_ca_topic_score_gemma":0.000012465307,"teacher_disagreement_score":0.7528824,"about_ca_system_score_codex":0.0000490452,"about_ca_system_score_gemma":0.00006113564,"threshold_uncertainty_score":0.48344395},"labels":[],"label_agreement":null},{"id":"W2201528536","doi":"10.1109/bigdata.2015.7363737","title":"Practical message-passing framework for large-scale combinatorial optimization","year":2015,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Message passing; Scale (ratio); Distributed computing; Theoretical computer science; Parallel computing","score_opus":0.03431269215473889,"score_gpt":0.3134040908394302,"score_spread":0.27909139868469135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2201528536","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.0000960081,0.00001040355,0.99252486,0.0022146367,0.00229741,0.00015870453,0.0000016068423,0.00019854787,0.0024978335],"genre_scores_gemma":[0.049716704,7.9626017e-7,0.9495505,0.00034991768,0.00022328059,0.000018366465,0.0000037497398,0.000007950549,0.00012872477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990468,0.000086184606,0.0001451538,0.00025722678,0.00021194355,0.00025269194],"domain_scores_gemma":[0.9990471,0.00028786616,0.000060006772,0.0003008788,0.0001495556,0.00015458699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078141916,0.00009183449,0.000116032,0.00004502615,0.00015153487,0.00023413303,0.00029863865,0.00010648167,0.000019878944],"category_scores_gemma":[0.00037004772,0.00007984461,0.00005381072,0.0002543632,0.00002260158,0.0007059584,0.00011926287,0.00012476166,0.000016383397],"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.000013302931,0.000107886946,0.000020684067,0.0000026044509,0.0000058204755,0.0000022034394,0.00032155114,0.001102244,0.000002437044,0.9959852,0.0017917821,0.00064426253],"study_design_scores_gemma":[0.0005322673,0.000079931095,0.0000039497136,0.000006682961,0.000005009089,0.000005255203,0.000119175405,0.5087056,0.00038330353,0.4872897,0.0027690039,0.00010011336],"about_ca_topic_score_codex":8.845649e-7,"about_ca_topic_score_gemma":2.2455623e-7,"teacher_disagreement_score":0.50869554,"about_ca_system_score_codex":0.000021164467,"about_ca_system_score_gemma":0.00008534451,"threshold_uncertainty_score":0.3255969},"labels":[],"label_agreement":null},{"id":"W2215786255","doi":"10.1109/besc.2015.7365980","title":"Balanced Graph Partitioning: Optimizing graph cut based on Label Swapping","year":2015,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph partition; Computer science; Graph; Partition (number theory); Graph bandwidth; Strength of a graph; Algorithm; Theoretical computer science; Mathematics; Voltage graph; Line graph; Combinatorics","score_opus":0.03737230654060093,"score_gpt":0.25441815517782235,"score_spread":0.21704584863722143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2215786255","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.006207316,0.000031973384,0.95740706,0.00093148,0.0005577095,0.00011844507,0.0000014665238,0.0005125711,0.03423196],"genre_scores_gemma":[0.80608684,0.0000032223127,0.19105195,0.0023886291,0.000060011498,0.000027879118,0.0000053281956,0.00001228266,0.00036384337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855465,0.000110783374,0.00020150343,0.00041890336,0.00033814207,0.00037602225],"domain_scores_gemma":[0.99893993,0.00010192177,0.00007120338,0.0005492312,0.00010234255,0.00023534428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006102825,0.0001727094,0.00016557839,0.00023814078,0.00019865867,0.00020495962,0.00062103354,0.0000587794,0.000029709568],"category_scores_gemma":[0.000047716967,0.00015089045,0.00008946493,0.0008301039,0.000061353545,0.0004593648,0.000086164764,0.00015666499,0.00011063225],"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.000051467065,0.00046600125,0.0011720876,0.00002042896,0.000048641992,0.00007328692,0.00096470024,0.039501235,0.0010749387,0.9416078,0.006468976,0.008550458],"study_design_scores_gemma":[0.002296615,0.00040346952,0.00029942766,0.00011019332,0.000010531322,0.000012016467,0.00019106183,0.79482305,0.011087078,0.18891709,0.0012322278,0.0006172343],"about_ca_topic_score_codex":0.0000101035885,"about_ca_topic_score_gemma":0.0000027244516,"teacher_disagreement_score":0.79987955,"about_ca_system_score_codex":0.000019519754,"about_ca_system_score_gemma":0.000053592525,"threshold_uncertainty_score":0.6153134},"labels":[],"label_agreement":null},{"id":"W2218076943","doi":"10.1109/bigdata.2015.7363954","title":"DISTINGER: A distributed graph data structure for massive dynamic graph processing","year":2015,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":30,"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":"Computer science; Scalability; Graph database; Theoretical computer science; Graph; Analytics; Data mining; Database","score_opus":0.03507818747675246,"score_gpt":0.2836490339052459,"score_spread":0.24857084642849342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218076943","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.0059380666,0.00017864823,0.99152863,0.000670541,0.00031665748,0.0002811918,0.0005955448,0.00030657797,0.0001841346],"genre_scores_gemma":[0.8442775,0.0000014770304,0.15464273,0.0001637449,0.000050827315,0.00001637423,0.0007463522,0.000013208059,0.00008775909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845046,0.00004986188,0.00021978267,0.0006574863,0.00024246915,0.00037995822],"domain_scores_gemma":[0.9983097,0.00007674181,0.00012717798,0.0010863524,0.00019960433,0.00020044805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035474953,0.00019627092,0.00019106048,0.00010872827,0.00022853284,0.00030959505,0.0021217945,0.000072932,0.000005776965],"category_scores_gemma":[0.00015551486,0.00015149848,0.000059019854,0.0007739172,0.000101326514,0.000993666,0.0005628625,0.0001286003,0.0000030742788],"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.00015906779,0.00043084458,0.0028005228,0.00035247483,0.0002581496,0.00009607299,0.0032952593,0.0013520301,0.00155273,0.53802544,0.023989368,0.42768806],"study_design_scores_gemma":[0.0007465732,0.0000923681,0.00038854388,0.000025140253,0.000022900866,0.00002473878,0.00028422673,0.43951,0.00019757745,0.5567953,0.0015587367,0.0003538841],"about_ca_topic_score_codex":0.000006151766,"about_ca_topic_score_gemma":0.000024921046,"teacher_disagreement_score":0.83833945,"about_ca_system_score_codex":0.000023147659,"about_ca_system_score_gemma":0.00010349531,"threshold_uncertainty_score":0.61779284},"labels":[],"label_agreement":null},{"id":"W2235825999","doi":"10.1007/978-3-662-44415-3_9","title":"A Hausdorff Heuristic for Efficient Computation of Graph Edit Distance","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Hasler Stiftung; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Edit distance; Hausdorff distance; Computer science; Computation; Heuristic; Matching (statistics); Algorithm; Graph; Theoretical computer science; Computational complexity theory; Mathematics; Artificial intelligence","score_opus":0.009986013772851765,"score_gpt":0.23346017793738658,"score_spread":0.2234741641645348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235825999","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.00009392786,0.00034292982,0.99524075,0.00020235188,0.0029468834,0.00061387167,0.000019371657,0.00010996343,0.00042994547],"genre_scores_gemma":[0.58386177,0.000009497439,0.41512007,0.00037332444,0.00045369897,0.000021536596,0.000010632366,0.000034457607,0.00011503082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964982,0.00004920285,0.0006784776,0.001346451,0.0008445078,0.0005831293],"domain_scores_gemma":[0.9969114,0.00097425625,0.0005390119,0.0009881789,0.00043740528,0.00014972476],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013513999,0.00048179962,0.0006654782,0.00082029845,0.0002583976,0.0002194595,0.0024937561,0.00022508037,0.000003253099],"category_scores_gemma":[0.00013909896,0.0004420438,0.0002515369,0.00068679295,0.0009977531,0.00016083944,0.0005124592,0.00040331343,0.0000078734465],"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.000018830488,0.000051845203,0.000008104214,0.00019517669,0.000015868349,0.000012718576,0.0006537073,0.288893,0.00007867664,0.30683097,0.000028241824,0.40321285],"study_design_scores_gemma":[0.00029783908,0.00020874305,0.00002775609,0.00035624637,0.000009362402,0.000013550685,1.17914276e-7,0.61117256,0.00054667966,0.38669643,0.00031771167,0.00035302422],"about_ca_topic_score_codex":0.000004182849,"about_ca_topic_score_gemma":0.000008424907,"teacher_disagreement_score":0.58376783,"about_ca_system_score_codex":0.00009960325,"about_ca_system_score_gemma":0.00023209068,"threshold_uncertainty_score":0.9998031},"labels":[],"label_agreement":null},{"id":"W2245035960","doi":"10.1109/smc.2015.66","title":"Multi-task Assignment in Information Technology Companies Based on the E-CARGO Model","year":2015,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Task (project management); Computer science; Process (computing); Class (philosophy); Object (grammar); Distributed computing; Artificial intelligence; Engineering; Systems engineering","score_opus":0.033170601104856735,"score_gpt":0.2361843534751432,"score_spread":0.20301375237028646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245035960","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.0065395483,0.0000048798565,0.9867603,0.0034003465,0.000075097516,0.00013524135,0.0000010860222,0.00012566533,0.0029578046],"genre_scores_gemma":[0.94322884,3.4014678e-7,0.05542486,0.001270368,0.0000026405314,0.000025221601,0.0000010441015,0.0000014698543,0.000045221583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994169,0.000044050335,0.00013421188,0.00009813132,0.0001668857,0.00013981732],"domain_scores_gemma":[0.99949723,0.00004714332,0.000037929927,0.00034518537,0.00003970946,0.000032773783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044922775,0.00007333289,0.00006958308,0.00019391686,0.000049030365,0.0000624224,0.0005580121,0.00004422076,0.0000028349164],"category_scores_gemma":[0.00003813907,0.000044763383,0.00001894542,0.00035736506,0.00004578604,0.00038517272,0.00009821223,0.00011166729,0.00007640311],"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.0000065434847,0.000097775715,0.00024383403,0.0000019420138,0.0000028099676,0.0000011861753,0.001075219,0.37229684,0.00007008718,0.6181449,0.00042407663,0.007634774],"study_design_scores_gemma":[0.00036004462,0.00004770016,0.00009815808,0.0000058230103,5.042166e-7,6.6789465e-7,0.00027465605,0.96237606,0.0007572243,0.035786122,0.00022972187,0.00006332507],"about_ca_topic_score_codex":0.0000059550293,"about_ca_topic_score_gemma":0.000004528526,"teacher_disagreement_score":0.93668926,"about_ca_system_score_codex":0.000032463944,"about_ca_system_score_gemma":0.000043184697,"threshold_uncertainty_score":0.18253978},"labels":[],"label_agreement":null},{"id":"W2263157912","doi":"10.14778/2777598.2777604","title":"Giraph unchained","year":2015,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":145,"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":"Asynchronous communication; Computer science; Scalability; Computation; Synchronization (alternating current); Distributed computing; Bulk synchronous parallel; Graph; Parallel computing; Model of computation; Theoretical computer science; Algorithm; Computer network; Operating system","score_opus":0.01784287209176177,"score_gpt":0.2045423580511298,"score_spread":0.18669948595936803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263157912","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.782061,0.00088793505,0.029292163,0.016403556,0.00435679,0.0017244632,0.000009095242,0.0008121827,0.16445282],"genre_scores_gemma":[0.99002445,0.0000040409936,0.00901067,0.0002543683,0.000050227412,0.000018863573,1.0705394e-7,0.000005529686,0.00063175923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905723,0.0000071876366,0.00017110538,0.00020340644,0.00035938306,0.00020165698],"domain_scores_gemma":[0.99939,0.000016322278,0.00013217864,0.00018034816,0.00018320176,0.00009794727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005284773,0.00010494823,0.000120482284,0.00006554927,0.00006842081,0.000057898946,0.0012945564,0.00002751794,0.0000035929856],"category_scores_gemma":[0.00006864707,0.000066444074,0.00008978057,0.00044708466,0.00006702289,0.00027584442,0.00046472927,0.00008348611,0.000012215428],"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.000013105319,0.000109908055,0.001106457,0.00002251225,0.000030219144,6.090736e-7,0.0022528814,0.000025057376,0.010060721,0.9759554,0.004424277,0.0059988378],"study_design_scores_gemma":[0.0013123702,0.00028311697,0.00089011935,0.00007830159,0.000021077658,0.00003574569,0.0006269273,0.0051900353,0.31245232,0.6690939,0.009709193,0.0003068535],"about_ca_topic_score_codex":0.0000075723387,"about_ca_topic_score_gemma":1.9534805e-7,"teacher_disagreement_score":0.3068615,"about_ca_system_score_codex":0.000028638226,"about_ca_system_score_gemma":0.000027523747,"threshold_uncertainty_score":0.27095106},"labels":[],"label_agreement":null},{"id":"W2266577329","doi":"10.14778/2904483.2904488","title":"A general-purpose query-centric framework for querying big graphs","year":2016,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":45,"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":"Computer science; Scalability; Graph database; Workload; Theoretical computer science; Graph; Analytics; Big data; Computation; Vertex (graph theory); Database; Data mining; Programming language; Operating system","score_opus":0.016580142920986043,"score_gpt":0.2329751982869722,"score_spread":0.21639505536598613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2266577329","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.34963214,0.00079576485,0.6331053,0.008730476,0.0031750614,0.0023042422,0.000029954574,0.0004067703,0.0018203382],"genre_scores_gemma":[0.90761656,0.00010774913,0.09089976,0.00044509437,0.0001818642,0.00021556947,1.9575852e-7,0.000020489259,0.0005127399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984252,0.000012931019,0.00032733718,0.00043085625,0.00034687537,0.00045680697],"domain_scores_gemma":[0.9989212,0.00018226393,0.000293419,0.0002955759,0.00020450399,0.00010302433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005411391,0.0002048414,0.0002284467,0.00017343392,0.0002193481,0.000095611744,0.0015276691,0.00007951395,0.000005463524],"category_scores_gemma":[0.00021598376,0.00011126787,0.00027783492,0.0006635526,0.00010011114,0.00032339976,0.00043382501,0.000106020976,0.0000062864715],"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.000018304208,0.00008463498,0.0009963693,0.00004429554,0.000036072917,2.9659878e-7,0.0003173446,0.0000014725252,0.034433812,0.9042671,0.0003815838,0.059418734],"study_design_scores_gemma":[0.00059635786,0.00010812207,0.00036009715,0.00023105882,0.000020245436,0.000010371752,0.000036568636,0.00028851652,0.2323498,0.7627926,0.003009588,0.00019666793],"about_ca_topic_score_codex":0.0000073260444,"about_ca_topic_score_gemma":3.4906088e-7,"teacher_disagreement_score":0.5579844,"about_ca_system_score_codex":0.000052964144,"about_ca_system_score_gemma":0.00003205448,"threshold_uncertainty_score":0.45373723},"labels":[],"label_agreement":null},{"id":"W2268506948","doi":"10.14778/2824032.2824128","title":"S+EPPs","year":2015,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"SPARQL; Computer science; Component (thermodynamics); Graph; Theoretical computer science; Information retrieval; RDF; Semantic Web","score_opus":0.0193053903847535,"score_gpt":0.20903259207919872,"score_spread":0.18972720169444524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2268506948","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.7289942,0.00083128235,0.021608507,0.015232095,0.0039899084,0.0013618338,0.0000066563834,0.0006412276,0.22733432],"genre_scores_gemma":[0.9897546,0.000003915908,0.009400987,0.00021033693,0.00004669523,0.000014937402,6.478766e-8,0.000004478742,0.0005639916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918914,0.0000053871504,0.00014425565,0.00017313511,0.00031582222,0.00017223893],"domain_scores_gemma":[0.999488,0.000012906769,0.00011000348,0.00015616653,0.00014866605,0.0000842545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044140624,0.00008550421,0.00009932996,0.00004534445,0.00005797815,0.00005600574,0.0012229076,0.000022659538,0.0000029617981],"category_scores_gemma":[0.00005638969,0.00005365784,0.00007159053,0.00032060943,0.00005462693,0.00028650145,0.0004654459,0.0000754636,0.000018560157],"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.0000078039,0.00009238796,0.0013397904,0.000018065688,0.000020846757,4.57407e-7,0.001877356,0.000012880943,0.0076179206,0.9761877,0.0047945147,0.008030276],"study_design_scores_gemma":[0.0008791683,0.00019561374,0.0011998207,0.00006480868,0.00001610537,0.00003912973,0.0004969937,0.002624215,0.37220138,0.60743314,0.014607201,0.00024245618],"about_ca_topic_score_codex":0.000006373683,"about_ca_topic_score_gemma":1.4419844e-7,"teacher_disagreement_score":0.3687546,"about_ca_system_score_codex":0.000025549838,"about_ca_system_score_gemma":0.000023216835,"threshold_uncertainty_score":0.2272487},"labels":[],"label_agreement":null},{"id":"W2274838074","doi":"10.1088/1757-899x/114/1/012143","title":"The One Universal Graph — a free and open graph database","year":2016,"lang":"en","type":"article","venue":"IOP Conference Series Materials Science and Engineering","topic":"Graph Theory 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":"Mohawk College","funders":"","keywords":"Computer science; Graph database; Android (operating system); Programmer; Big data; Documentation; Software; Graph; Cloud computing; Debugging; The Internet; World Wide Web; Programming language; Operating system; Theoretical computer science","score_opus":0.017071329952374883,"score_gpt":0.20684748301875117,"score_spread":0.1897761530663763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274838074","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.88624537,0.00015178561,0.10823145,0.0033106185,0.0010548588,0.00032625196,0.000059121223,0.00019230595,0.00042824022],"genre_scores_gemma":[0.9913192,0.0005237842,0.007978258,0.000044161723,0.000029753071,0.000017157627,5.3074814e-7,0.0000062266954,0.000080971346],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986975,0.000031578893,0.00016573342,0.0004313207,0.00025975204,0.00041409067],"domain_scores_gemma":[0.9989352,0.00009136488,0.000054788587,0.0006302069,0.0001268847,0.00016153386],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012678807,0.00015673762,0.00016908138,0.00012285683,0.00060816697,0.001746746,0.0022262526,0.000029405746,0.000012731545],"category_scores_gemma":[0.00017730899,0.0000952887,0.000011643796,0.00045941427,0.00080894143,0.003615634,0.0018625823,0.000048216178,0.000003249986],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000009393583,0.0000041377207,0.000005977953,0.000008393887,0.0000044669546,0.0000042093266,0.0001839574,0.0000012355812,0.52580154,0.46899572,0.000012319922,0.004968652],"study_design_scores_gemma":[0.001087645,0.0003041558,0.004623707,0.0003801061,0.000016157868,0.0001278465,0.00048160428,0.0008082611,0.8609249,0.1274522,0.0029800057,0.0008133925],"about_ca_topic_score_codex":0.000041222826,"about_ca_topic_score_gemma":0.000012610448,"teacher_disagreement_score":0.34154356,"about_ca_system_score_codex":0.000012675784,"about_ca_system_score_gemma":0.00010638659,"threshold_uncertainty_score":0.9992895},"labels":[],"label_agreement":null},{"id":"W2281494333","doi":"10.14778/2732977.2732980","title":"An experimental comparison of pregel-like graph processing systems","year":2014,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":194,"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":"Computer science; PageRank; Graph; Global Positioning System; Theoretical computer science; Operating system","score_opus":0.014468431683686635,"score_gpt":0.2619565896032245,"score_spread":0.24748815791953785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2281494333","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.9746047,0.0010036724,0.019689692,0.00009614123,0.0007305464,0.0006141273,0.0000023964783,0.00014280285,0.0031159187],"genre_scores_gemma":[0.9953004,0.000002031,0.0045354897,0.000028429447,0.000044438573,0.000042085758,3.5116784e-7,0.000010077922,0.000036669855],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985229,0.000025963396,0.00042139913,0.00031843412,0.00046880174,0.00024250934],"domain_scores_gemma":[0.9990125,0.000023452838,0.00046599552,0.0002550271,0.00016292225,0.00008010418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054045673,0.00016613302,0.00029487783,0.00010396065,0.00015907388,0.00011374676,0.0014886064,0.000046019388,0.0000018747517],"category_scores_gemma":[0.000014245865,0.00011540042,0.000104330684,0.000378179,0.00013562465,0.00053775316,0.0002542168,0.00010479143,0.0000012906137],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000038786915,0.001202476,0.009021328,0.00048138437,0.00004875325,1.468379e-7,0.011263991,0.00048601534,0.5828564,0.38394213,0.00028638917,0.010372172],"study_design_scores_gemma":[0.00050985464,0.0004999023,0.00060721923,0.00027450858,0.000019006893,0.000009795583,0.0019054175,0.06426916,0.9246236,0.0067856084,0.00028669523,0.00020920251],"about_ca_topic_score_codex":0.000017060764,"about_ca_topic_score_gemma":2.42743e-7,"teacher_disagreement_score":0.37715653,"about_ca_system_score_codex":0.000023219203,"about_ca_system_score_gemma":0.000016256396,"threshold_uncertainty_score":0.47058925},"labels":[],"label_agreement":null},{"id":"W2291620117","doi":"10.14778/2850469.2850471","title":"K-core decomposition of large networks on a single PC","year":2015,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":214,"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 Victoria","funders":"","keywords":"Computer science; Decomposition; Implementation; Core (optical fiber); Metric (unit); Graph; Multi-core processor; Vertex (graph theory); Theoretical computer science; Parallel computing; Algorithm","score_opus":0.03872705365176489,"score_gpt":0.26743815820515754,"score_spread":0.22871110455339266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291620117","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.9472895,0.00023702887,0.033182878,0.0011546283,0.0010514866,0.00061568833,0.0000071263125,0.00012917057,0.016332446],"genre_scores_gemma":[0.99581593,0.000003565747,0.0038843877,0.000171841,0.000048739574,0.0000119162705,4.9317805e-7,0.000005771841,0.00005734892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999089,0.000008435948,0.00020712036,0.00018820592,0.0003082777,0.000198966],"domain_scores_gemma":[0.9993529,0.000027160462,0.00021952347,0.00016027859,0.00017224732,0.00006793695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048543222,0.00010431635,0.00014762967,0.00006495639,0.00006162973,0.00003066371,0.0007489573,0.00003748217,0.00000230686],"category_scores_gemma":[0.000032537115,0.00007150745,0.00009612005,0.00032565187,0.000044765507,0.00019161007,0.00029174864,0.00009273659,0.0000030846863],"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.00009773434,0.001020113,0.0019155865,0.000058924372,0.00006399117,0.0000010284303,0.0026835252,0.0009016492,0.039658867,0.9423572,0.0027537255,0.008487668],"study_design_scores_gemma":[0.0021253896,0.0014751757,0.0015594936,0.00043795773,0.00004336684,0.000030175348,0.0004968683,0.05340236,0.72513217,0.21349053,0.0014474926,0.00035901656],"about_ca_topic_score_codex":0.0000040216364,"about_ca_topic_score_gemma":3.4152757e-7,"teacher_disagreement_score":0.72886664,"about_ca_system_score_codex":0.000037422942,"about_ca_system_score_gemma":0.000012286922,"threshold_uncertainty_score":0.29159892},"labels":[],"label_agreement":null},{"id":"W2299020861","doi":"10.1007/s10619-017-7196-y","title":"TAPER: query-aware, partition-enhancement for large, heterogenous graphs","year":2017,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Newcastle University","keywords":"Computer science; Graph partition; Scalability; Partition (number theory); Workload; Space partitioning; Hash function; Parallel computing; USable; Theoretical computer science; Graph; Algorithm; Database; Mathematics","score_opus":0.03487313379500431,"score_gpt":0.29416619769974,"score_spread":0.2592930639047357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299020861","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.02767796,0.00039358353,0.96474254,0.0004053062,0.00030387347,0.0002937017,0.006024629,0.00009002161,0.00006835607],"genre_scores_gemma":[0.9866313,0.00033988003,0.009311448,0.00023323174,0.000058386602,0.00015765785,0.0032006106,0.000008539234,0.000058942955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987404,0.000040326744,0.00020430032,0.00044916707,0.00014081702,0.00042501124],"domain_scores_gemma":[0.99857146,0.000092327304,0.00014682561,0.00096573954,0.00007530998,0.00014835793],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00026278492,0.00018509409,0.00020208559,0.00004058781,0.0014042129,0.00035336072,0.0006869503,0.00003620269,0.00002072851],"category_scores_gemma":[0.00004905297,0.00016358994,0.000095837,0.00006422812,0.00009230076,0.0007954099,0.000292699,0.00007497862,0.000014584275],"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.00008698239,0.00063397817,0.0065004295,0.00011578082,0.00015095192,0.000057692163,0.00021561205,0.000029908842,0.00029476586,0.9666251,0.010623931,0.014664858],"study_design_scores_gemma":[0.012564576,0.0014416905,0.038242906,0.0005400495,0.00026392366,0.00023940504,0.0005690995,0.09932504,0.019208131,0.33005345,0.4938019,0.0037498418],"about_ca_topic_score_codex":0.00003903067,"about_ca_topic_score_gemma":0.000046791967,"teacher_disagreement_score":0.9589533,"about_ca_system_score_codex":0.000007326878,"about_ca_system_score_gemma":0.000024841058,"threshold_uncertainty_score":0.9998958},"labels":[],"label_agreement":null},{"id":"W231720905","doi":"10.1016/j.knosys.2015.05.012","title":"Approximating the maximum common subgraph isomorphism problem with a weighted graph","year":2015,"lang":"en","type":"article","venue":"Knowledge-Based Systems","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Induced subgraph isomorphism problem; Subgraph isomorphism problem; Graph isomorphism; Mathematics; Combinatorics; Graph homomorphism; Distance-hereditary graph; Isomorphism (crystallography); Discrete mathematics; Induced subgraph; Graph factorization; Factor-critical graph; Graph; Cograph; Line graph; Pathwidth; Voltage graph","score_opus":0.022099903616062462,"score_gpt":0.229079896000099,"score_spread":0.20697999238403655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W231720905","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.028108321,0.0029614838,0.9481011,0.0007498618,0.0015392308,0.0017480886,0.000013024932,0.0009461558,0.01583272],"genre_scores_gemma":[0.9859299,0.0000013972406,0.013100902,0.00011526518,0.00017314973,0.00034724595,0.000012122252,0.000040716288,0.00027927777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966859,0.000883703,0.00059354835,0.0006358697,0.00056491885,0.00063603965],"domain_scores_gemma":[0.99723476,0.00032119636,0.0003616076,0.0013356613,0.00042776356,0.0003189999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023936268,0.00040675228,0.00048756352,0.0003241425,0.00049448834,0.00050649856,0.0017658761,0.00012668052,0.000002849571],"category_scores_gemma":[0.000018190896,0.00024399773,0.00015766516,0.002020753,0.00028142196,0.00038696302,0.00016108305,0.00038450854,0.00012876501],"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.00033376884,0.0022602582,0.015379777,0.0014119592,0.00061808276,0.00032121458,0.026917547,0.0038480654,0.00094569445,0.8953719,0.012331858,0.040259834],"study_design_scores_gemma":[0.006485092,0.0014902361,0.00027960222,0.0014010569,0.00012197419,0.00042391184,0.002484558,0.8538526,0.0029542742,0.10529834,0.02332995,0.0018783513],"about_ca_topic_score_codex":0.00011546007,"about_ca_topic_score_gemma":0.000049485458,"teacher_disagreement_score":0.9578216,"about_ca_system_score_codex":0.00006715245,"about_ca_system_score_gemma":0.00027529983,"threshold_uncertainty_score":0.9949938},"labels":[],"label_agreement":null},{"id":"W2328826103","doi":"10.2316/journal.211.2012.1.211-1056","title":"APPROXIMATION ALGORITHMS FOR SP-MULTICAST TREES IN 2D GRIDS1","year":2012,"lang":"en","type":"article","venue":"Parallel and Distributed Computing and Networks","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multicast; Computer science; Protocol Independent Multicast; Algorithm; Computer network","score_opus":0.019647432898477316,"score_gpt":0.25912727150880427,"score_spread":0.23947983861032696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328826103","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.067585275,0.0015833493,0.93010587,0.00014165133,0.0002499785,0.00019083191,0.000010412661,0.000086834494,0.000045799505],"genre_scores_gemma":[0.9578514,0.000058129317,0.04169135,0.00007020936,0.00023461726,0.000014849493,0.00006505593,0.0000061584174,0.000008217389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988267,0.00007267828,0.00023997322,0.00029357825,0.000081263715,0.00048580964],"domain_scores_gemma":[0.99929625,0.0002810075,0.00007895034,0.00015576713,0.00003048076,0.00015755091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059278664,0.00016588096,0.00021225869,0.000059315455,0.00023603515,0.0001315557,0.00017517182,0.000091827096,7.176467e-7],"category_scores_gemma":[0.000025271494,0.0001466643,0.000043121796,0.00024881813,0.00006170095,0.00026540956,0.00014206296,0.00014142113,9.2410625e-7],"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.00010152143,0.00048964954,0.034010224,0.00007748226,0.00006926255,0.000007607108,0.0024525742,0.09385393,0.000043654312,0.18235764,0.0005787169,0.68595773],"study_design_scores_gemma":[0.00082164677,0.000049611906,0.035041317,0.000036213893,0.000008059695,0.000021780377,0.00008529424,0.9582262,0.000008486313,0.0052563534,0.00024691864,0.00019809433],"about_ca_topic_score_codex":0.0000087415,"about_ca_topic_score_gemma":0.0000016406264,"teacher_disagreement_score":0.8902661,"about_ca_system_score_codex":0.000010598095,"about_ca_system_score_gemma":0.0000062273566,"threshold_uncertainty_score":0.5980796},"labels":[],"label_agreement":null},{"id":"W2336110187","doi":"10.9790/0661-1434249","title":"Analysis of Rayleigh Quotient in Extrapolation Method to Accelerate the Computation Speed of PageRank","year":2013,"lang":"en","type":"article","venue":"IOSR Journal of Computer Engineering","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Extrapolation; Computer science; Computation; PageRank; Quotient; Speedup; Algorithm; Parallel computing; Statistics; Theoretical computer science; Mathematics","score_opus":0.010922497175882718,"score_gpt":0.24730306221646015,"score_spread":0.23638056504057742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336110187","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.34906414,0.000043173823,0.65048856,0.00012598952,0.00019460368,0.000072143994,3.851408e-7,0.0000064619967,0.0000045410466],"genre_scores_gemma":[0.73813236,0.0000024231438,0.2617864,0.000033323468,0.000039682905,6.5361326e-7,3.430889e-7,0.0000039200854,8.6283603e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867266,0.0001317516,0.0006680574,0.00011409993,0.0002715889,0.00014183894],"domain_scores_gemma":[0.99887216,0.0003134375,0.0003223327,0.00017298022,0.00025653208,0.00006256343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009886677,0.00010840033,0.0003612721,0.00093318906,0.000019359568,0.00006250029,0.00052033184,0.000030078501,0.0000057176794],"category_scores_gemma":[0.000013748335,0.000080646765,0.00018075513,0.0016647445,0.000010143467,0.0004198572,0.00007538247,0.00014918555,8.8898787e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044213384,0.000033298063,0.0006016744,0.000012103282,0.00017676588,0.0000025053141,0.0014937624,0.9628296,0.00813972,0.0018144165,0.000010611803,0.024881113],"study_design_scores_gemma":[0.00022138278,0.000088811335,0.083283186,0.000056666093,0.000041279785,0.000008446495,0.0000138658,0.911228,0.0044276593,0.00054599455,0.000012302328,0.0000723877],"about_ca_topic_score_codex":0.000013802197,"about_ca_topic_score_gemma":5.591853e-7,"teacher_disagreement_score":0.38906825,"about_ca_system_score_codex":0.000021885453,"about_ca_system_score_gemma":0.000016764723,"threshold_uncertainty_score":0.32886797},"labels":[],"label_agreement":null},{"id":"W2396107515","doi":"","title":"Graph Models and their Efficient Implementation for Sparse Jacobian Matrix Determination.","year":2010,"lang":"en","type":"article","venue":"Cologne Twente Workshop on Graphs and Combinatorial Optimization","topic":"Graph Theory 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":"University of Lethbridge","funders":"","keywords":"Sparse matrix; Computer science; Jacobian matrix and determinant; Theoretical computer science; Algorithm; Graph; Matrix (chemical analysis); Adjacency matrix; Mathematics; Applied mathematics","score_opus":0.012163610641859116,"score_gpt":0.26497738696290196,"score_spread":0.25281377632104285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396107515","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.17861451,0.00009328746,0.8163972,0.00038341264,0.0033688622,0.0008921557,0.000016744421,0.00014305054,0.00009080519],"genre_scores_gemma":[0.9737185,0.0001130717,0.025746513,0.00012391155,0.000061503044,0.00015146218,0.00004210164,0.000018102233,0.000024821926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864507,0.00008275382,0.00030643854,0.00051282434,0.000153072,0.00029983826],"domain_scores_gemma":[0.998932,0.00026740917,0.00018364737,0.00029269574,0.00018444758,0.00013979248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053377484,0.00024149833,0.000223926,0.00031588407,0.00049713126,0.00028624665,0.00029003134,0.00015752856,0.0000079944975],"category_scores_gemma":[0.00003633233,0.00021453811,0.00008929953,0.0005023472,0.00011788009,0.00037783233,0.000109869135,0.00018933597,4.7449217e-7],"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.00008345642,0.00018188158,0.00006315533,0.000014161241,0.00002111374,0.0000012020136,0.00059524825,0.033430204,0.00028251926,0.9306818,0.0000924971,0.03455272],"study_design_scores_gemma":[0.0020198156,0.00030531455,0.00011550122,0.000016909973,0.000019821917,0.000006144967,0.00018626498,0.73895526,0.00043305982,0.25756645,0.0001252804,0.00025016986],"about_ca_topic_score_codex":0.0000029117596,"about_ca_topic_score_gemma":0.000006271502,"teacher_disagreement_score":0.795104,"about_ca_system_score_codex":0.000013309642,"about_ca_system_score_gemma":0.000028224633,"threshold_uncertainty_score":0.874861},"labels":[],"label_agreement":null},{"id":"W2397618262","doi":"","title":"Graph Eigenvalues Under a Graph Transformation.","year":2012,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Graph; Eigenvalues and eigenvectors; Combinatorics; Transformation (genetics); Voltage graph; Line graph; Discrete mathematics; Chemistry; Physics","score_opus":0.014570428681345298,"score_gpt":0.23588335988175202,"score_spread":0.2213129312004067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397618262","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.75822794,0.0014498337,0.22015116,0.0009215249,0.007970611,0.00037792948,0.000004964256,0.00072627625,0.0101697575],"genre_scores_gemma":[0.99712306,0.00003184133,0.0023732178,0.00036050478,0.00001458505,0.0000217019,0.00000361167,0.000010955265,0.00006052762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986658,0.00012576907,0.00022722613,0.00020672107,0.00029153752,0.0004829522],"domain_scores_gemma":[0.9991119,0.0000802433,0.000063352825,0.0004865028,0.000057780006,0.00020025359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056705374,0.00017275724,0.00015861195,0.0001881065,0.00025791745,0.00010213118,0.0006968194,0.00007793932,0.000025182115],"category_scores_gemma":[0.000010050775,0.00015794997,0.00014559204,0.0007673321,0.00007593964,0.0015629389,0.00007022437,0.00015804419,0.00015068201],"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.0000022994777,0.00012907053,0.00053615175,0.0000066530165,0.00002479176,0.0000010722474,0.0017586638,0.000011376623,0.00014219194,0.9948023,0.00028698787,0.0022984664],"study_design_scores_gemma":[0.00044677907,0.000051197752,0.0047164243,0.0000095939295,0.000010191495,0.0000147912,0.00012418242,0.00029890655,0.0032081776,0.9899672,0.00092356524,0.0002289598],"about_ca_topic_score_codex":0.00000723109,"about_ca_topic_score_gemma":3.4694747e-7,"teacher_disagreement_score":0.23889512,"about_ca_system_score_codex":0.000018824765,"about_ca_system_score_gemma":0.000022395068,"threshold_uncertainty_score":0.64410126},"labels":[],"label_agreement":null},{"id":"W2397721975","doi":"","title":"Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability.","year":2014,"lang":"en","type":"article","venue":"Mathematical Foundations of Computer Science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Reachability; Planar graph; Computer science; Directed graph; Planar; Algorithm; Time complexity; Graph; Polynomial; Combinatorics; Mathematics; Discrete mathematics; Computer graphics (images)","score_opus":0.00982317101792221,"score_gpt":0.24447553559354215,"score_spread":0.23465236457561994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397721975","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.0058075152,0.000008561251,0.9920061,0.0006877918,0.0002021104,0.0003189955,0.000006304068,0.00019392997,0.0007686478],"genre_scores_gemma":[0.056446765,0.0000010370026,0.9433044,0.00007867289,0.00005658689,0.00002457809,0.0000024170472,0.0000070104697,0.00007849838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825937,0.00008349414,0.00037192376,0.0005609098,0.00037528278,0.00034904882],"domain_scores_gemma":[0.99759805,0.0010518963,0.0001349357,0.0007704081,0.0002584297,0.0001862989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018830734,0.00016585832,0.0003056077,0.00030578766,0.00042624908,0.00030289913,0.0012491741,0.000045588953,0.0000083752175],"category_scores_gemma":[0.00027146208,0.00014316507,0.00008739376,0.00096839166,0.0010112092,0.00075267704,0.00028115857,0.00007735888,0.000021319802],"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.0000020588518,0.00014220209,0.000008428121,0.000036527526,0.000010387201,2.4015384e-7,0.00047836732,0.00002024306,0.0014820823,0.77845484,0.00012951429,0.2192351],"study_design_scores_gemma":[0.00019263019,0.00013894805,0.00018395693,0.000025789415,0.000006148222,0.000013025969,0.0000035361602,0.63124883,0.0011277882,0.36665496,0.00027891123,0.00012546612],"about_ca_topic_score_codex":0.0000035904698,"about_ca_topic_score_gemma":2.9100784e-7,"teacher_disagreement_score":0.6312286,"about_ca_system_score_codex":0.000017969804,"about_ca_system_score_gemma":0.000075688695,"threshold_uncertainty_score":0.58381027},"labels":[],"label_agreement":null},{"id":"W2401936605","doi":"","title":"On constructing graphs with the same status sequence.","year":2014,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Sequence (biology); Combinatorics; Genetics; Biology","score_opus":0.009778228132760717,"score_gpt":0.21883322792015747,"score_spread":0.20905499978739675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401936605","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.98228383,0.00002400885,0.0080307,0.00080649904,0.0015114737,0.0001482742,0.000001526816,0.00021018375,0.006983525],"genre_scores_gemma":[0.99662465,0.0000023147272,0.0025959895,0.00070441107,0.000005623944,0.000010416252,8.9294e-7,0.000008977227,0.00004669868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987468,0.00018576503,0.000117192314,0.0003106828,0.00027403393,0.0003655368],"domain_scores_gemma":[0.99863535,0.00046890206,0.0000925366,0.00064022787,0.00006421936,0.000098750555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047333326,0.00014854819,0.00013602794,0.00006438269,0.00030005784,0.00015859914,0.0007407134,0.00003795053,0.000007756236],"category_scores_gemma":[0.000056853503,0.000091514354,0.000047706173,0.0004802139,0.00021605521,0.0002265631,0.000096395794,0.00023500176,0.00003900152],"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.000005542099,0.000019659838,0.00081144326,0.0000023935818,0.000012746737,0.0000052778605,0.00039157082,0.000019920848,0.00008036328,0.9889899,0.0001411242,0.009520065],"study_design_scores_gemma":[0.00049087335,0.00026965054,0.00056109537,0.000021060025,0.0000049243044,0.000020757521,0.00011520219,0.0016352441,0.0009238197,0.9949912,0.0008052275,0.0001609734],"about_ca_topic_score_codex":0.000013402047,"about_ca_topic_score_gemma":0.0000022048448,"teacher_disagreement_score":0.014340866,"about_ca_system_score_codex":0.000017430679,"about_ca_system_score_gemma":0.000038287275,"threshold_uncertainty_score":0.37318468},"labels":[],"label_agreement":null},{"id":"W2405736458","doi":"10.5441/002/edbt.2016.10","title":"Providing Serializability for Pregel-like Graph Processing Systems","year":2016,"lang":"en","type":"article","venue":"Movebank","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Serializability; Computer science; Two-phase locking; Correctness; Distributed computing; Graph; Theoretical computer science; Parallel computing; Transaction processing; Algorithm; Online transaction processing; Programming language; Distributed transaction; Database transaction","score_opus":0.016299894915378678,"score_gpt":0.2334018277599278,"score_spread":0.21710193284454912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405736458","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.03189821,0.0002672276,0.96492267,0.00027204058,0.0013546672,0.0005812913,0.000011888021,0.00032368838,0.00036831884],"genre_scores_gemma":[0.98920304,0.0000027351527,0.009440985,0.00008596661,0.0001770869,0.00019498914,0.0000010962308,0.000014391482,0.0008797208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986305,0.000090300346,0.00025254875,0.00049280404,0.00017719039,0.000356636],"domain_scores_gemma":[0.9990147,0.00014458522,0.00011773538,0.0005065136,0.00013093655,0.00008557377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078698853,0.00014940549,0.00017483483,0.00007552815,0.00022800265,0.00027235117,0.00067445735,0.000068929796,0.000004509346],"category_scores_gemma":[0.000082696424,0.00009726695,0.00009992282,0.00025749955,0.00007381043,0.0008828472,0.00011448803,0.000041257856,0.000009401653],"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.00009498318,0.00023403882,0.0041882037,0.00081818,0.00005925615,0.000009735706,0.001280568,0.0001589851,0.030954808,0.6542698,0.00087039196,0.30706105],"study_design_scores_gemma":[0.0055139363,0.0008483432,0.005304574,0.0014139798,0.000057346402,0.00008664593,0.00013493972,0.11167381,0.06882282,0.7525063,0.051377706,0.0022595827],"about_ca_topic_score_codex":0.0000065673717,"about_ca_topic_score_gemma":8.444371e-7,"teacher_disagreement_score":0.95730484,"about_ca_system_score_codex":0.000035403034,"about_ca_system_score_gemma":0.000058135858,"threshold_uncertainty_score":0.3966431},"labels":[],"label_agreement":null},{"id":"W2405965731","doi":"10.1109/wacv.2016.7477730","title":"Graph matching with low-rank regularization","year":2016,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"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 Calgary","funders":"","keywords":"Matching (statistics); Rank (graph theory); Mathematical optimization; Quadratic programming; Robustness (evolution); Computer science; Graph; Regularization (linguistics); Regular polygon; Quadratic equation; Blossom algorithm; Semidefinite programming; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence; Combinatorics","score_opus":0.0043662779594159165,"score_gpt":0.18672088736959386,"score_spread":0.18235460941017795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405965731","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.020900404,0.0000057124253,0.9738001,0.00087936595,0.00009067798,0.000046153873,3.2595852e-7,0.00018780009,0.0040894584],"genre_scores_gemma":[0.92308706,0.0000033631156,0.073936865,0.00027857808,0.000025649902,0.0000042831857,3.8582448e-7,0.000005461377,0.0026583367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945,0.000030922758,0.000071315255,0.00018997998,0.00012365241,0.00013412525],"domain_scores_gemma":[0.9995658,0.000036673133,0.000027417957,0.0002960038,0.000030926818,0.00004320565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001441359,0.00006520164,0.000054751403,0.000064007974,0.000079862446,0.000058440954,0.0003183591,0.000020929017,0.000030494122],"category_scores_gemma":[0.0000036943707,0.000032637763,0.000023176633,0.00025817796,0.000033329034,0.00053154136,0.000048061935,0.000024694422,0.000046197983],"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.0000033633476,0.000014296069,0.00011624447,0.0000023761395,0.0000061303103,0.000005112926,0.00013544667,0.000020527981,0.0037950815,0.9653879,0.000040675917,0.030472891],"study_design_scores_gemma":[0.00046133428,0.00006920882,0.0012539767,0.00006289293,0.0000027192066,0.00002288756,0.000017246102,0.0007271655,0.021109443,0.9758979,0.00019137337,0.00018385497],"about_ca_topic_score_codex":0.000002428827,"about_ca_topic_score_gemma":0.0000018196822,"teacher_disagreement_score":0.9021867,"about_ca_system_score_codex":0.0000045857455,"about_ca_system_score_gemma":0.000010962356,"threshold_uncertainty_score":0.13309294},"labels":[],"label_agreement":null},{"id":"W2405974128","doi":"","title":"Extraconnectivity of Cartesian product graphs of paths.","year":2010,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Mathematics; Product (mathematics); Cartesian coordinate system; Combinatorics; Geometry","score_opus":0.006517413491374454,"score_gpt":0.21628948675238846,"score_spread":0.20977207326101402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405974128","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.994899,0.0000577434,0.00087608356,0.000099649405,0.002693692,0.00013407902,0.0000033286012,0.000060237657,0.0011762026],"genre_scores_gemma":[0.9968571,0.000002518601,0.0030885388,0.000011516133,0.0000053473664,0.000006352811,6.5449825e-7,0.0000066382217,0.000021329994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989819,0.000084132815,0.00023377541,0.00029445774,0.00021312363,0.00019259492],"domain_scores_gemma":[0.99866104,0.00012234297,0.00016504619,0.00082746433,0.00015315636,0.000070927825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006128175,0.000116254276,0.00022627828,0.00011812562,0.00005974669,0.00001671348,0.0007465149,0.000055180295,0.000010555178],"category_scores_gemma":[0.00011147546,0.00010875052,0.000107231754,0.00054840423,0.00015094878,0.0003040751,0.00011780975,0.00021347075,0.0000039611627],"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.0000032023333,0.00020614204,0.004691861,0.000018473034,0.000013201318,0.000003656659,0.00039531043,8.7482385e-7,0.05191845,0.933276,0.000040042738,0.009432798],"study_design_scores_gemma":[0.00027267923,0.00010192867,0.018002814,0.000009656512,0.000005503583,0.000007165528,0.0000124268945,0.00027023465,0.17022227,0.8109166,0.00007045102,0.00010829641],"about_ca_topic_score_codex":0.00002843704,"about_ca_topic_score_gemma":0.000005983913,"teacher_disagreement_score":0.12235941,"about_ca_system_score_codex":0.000003454745,"about_ca_system_score_gemma":0.00005029383,"threshold_uncertainty_score":0.44347176},"labels":[],"label_agreement":null},{"id":"W2407981822","doi":"","title":"Stratified sampling for even workload partitioning applied to single source shortest path algorithm","year":2015,"lang":"en","type":"article","venue":"Computer Science and Software Engineering","topic":"Graph Theory 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":"University of Alberta","funders":"","keywords":"Computer science; Workload; Shortest path problem; Algorithm; Scheduling (production processes); Parallel computing; Sampling (signal processing); Graph; Graph algorithms; Graph partition; Theoretical computer science; Distributed computing; Mathematical optimization; Mathematics","score_opus":0.02804920754298108,"score_gpt":0.2293140820036398,"score_spread":0.20126487446065874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407981822","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.016107583,0.00008281223,0.9823508,0.00006458874,0.0006989087,0.00025653196,0.000002525615,0.00042634446,0.000009907313],"genre_scores_gemma":[0.2919976,6.8797937e-7,0.7075873,0.0001765207,0.00018178043,0.000037662623,0.0000014162317,0.000010191316,0.0000068327295],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982432,0.000010741936,0.00021771605,0.00061274454,0.00038717457,0.0005283815],"domain_scores_gemma":[0.99872714,0.00021184825,0.00004212044,0.00036736688,0.00021966235,0.00043184814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012295246,0.0001928079,0.00019288909,0.00021807874,0.0003282992,0.0007042747,0.0007832902,0.000045077864,3.6930396e-7],"category_scores_gemma":[0.00019093152,0.00019436596,0.00003700953,0.00092635193,0.00007341603,0.0006532372,0.00036991196,0.00010956092,0.000005013457],"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.000003067888,0.00004216676,0.00012230292,0.000014011981,0.000009258686,0.0000042117576,0.0025243582,0.17168239,0.0012605673,0.0065098866,0.00007862802,0.81774914],"study_design_scores_gemma":[0.00029140216,0.0001870501,0.0006067531,0.000100721634,0.0000048956626,0.000022134942,0.000051904102,0.9928761,0.0016716754,0.0023090898,0.0014631638,0.0004151093],"about_ca_topic_score_codex":0.0000024419473,"about_ca_topic_score_gemma":4.724807e-7,"teacher_disagreement_score":0.8211937,"about_ca_system_score_codex":0.000060625865,"about_ca_system_score_gemma":0.000111235946,"threshold_uncertainty_score":0.79260135},"labels":[],"label_agreement":null},{"id":"W2429068280","doi":"10.1145/2926693.2929897","title":"Techniques and Systems for Large Dynamic Graphs","year":2016,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; International Business Machines Corporation","keywords":"Computer science; Graph; Theoretical computer science; Computation; Analytics; Graph theory; Distributed computing; Algorithm; Data mining; Mathematics","score_opus":0.007535354874100953,"score_gpt":0.23738835810962264,"score_spread":0.22985300323552169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2429068280","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.0039757486,0.00019262546,0.99383,0.00033508817,0.00014554542,0.00018271028,0.000007316783,0.00028017903,0.0010507875],"genre_scores_gemma":[0.97398514,0.000070929345,0.023859007,0.000064641616,0.000014643834,0.000059951115,2.8248272e-7,0.0000046896544,0.0019406911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952924,0.000020069743,0.00007531952,0.00017332708,0.00004937881,0.0001526686],"domain_scores_gemma":[0.9996306,0.00008585394,0.000021206324,0.00019618022,0.00002783245,0.00003834773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002836022,0.000057632416,0.000068207824,0.00006118898,0.00006900587,0.00005301956,0.00022524063,0.000028537039,0.0000020574064],"category_scores_gemma":[0.0000062744457,0.000031980326,0.000028306928,0.00007895533,0.000018941499,0.00022861532,0.00006433776,0.000014396636,0.0000037162836],"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.0000011631811,0.0000073097735,0.000054279615,0.000007799664,0.0000037184468,0.0000016500225,0.000019870946,1.15134196e-8,0.00083388924,0.96534777,0.00016669855,0.033555843],"study_design_scores_gemma":[0.00094326393,0.00032374996,0.00029128834,0.000109710476,0.0000065023446,0.00012802148,0.000045634457,0.029869292,0.007964204,0.9050291,0.05489051,0.00039872757],"about_ca_topic_score_codex":0.0000015711734,"about_ca_topic_score_gemma":0.0000011525822,"teacher_disagreement_score":0.9700094,"about_ca_system_score_codex":0.0000042163656,"about_ca_system_score_gemma":0.0000047908748,"threshold_uncertainty_score":0.13041198},"labels":[],"label_agreement":null},{"id":"W2485298192","doi":"10.1109/infocom.2016.7524627","title":"Sketch-based data placement among geo-distributed datacenters for cloud storages","year":2016,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":28,"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 Victoria","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Overhead (engineering); Cloud computing; Distributed computing; Scheme (mathematics); Sketch; Big data; Variety (cybernetics); Data mining; Algorithm; Artificial intelligence","score_opus":0.03447830499677029,"score_gpt":0.26544120531447074,"score_spread":0.23096290031770045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2485298192","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.009046618,0.000019785153,0.986625,0.0019261145,0.0006943857,0.0003125092,0.0010619448,0.00022984941,0.00008375761],"genre_scores_gemma":[0.9142791,0.0000088986035,0.08240747,0.00085770973,0.00021301805,0.00006695364,0.0009043414,0.000022724034,0.0012398051],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985331,0.00007006732,0.00020449152,0.00061696285,0.00020471313,0.00037066452],"domain_scores_gemma":[0.99758404,0.00028462382,0.00008390061,0.0018617077,0.00005469844,0.00013100539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068043853,0.00015624371,0.00014142467,0.000064088425,0.00014495155,0.00012848484,0.002449949,0.00004305865,0.000067567344],"category_scores_gemma":[0.000077237375,0.00009975242,0.00005189986,0.00016834792,0.00009605333,0.00087306666,0.0006435478,0.000045614946,0.000033015196],"study_design_candidate":"not_applicable","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.0003482653,0.0011085424,0.008701299,0.00014228647,0.00036603565,0.00006353517,0.00026214498,0.00055451796,0.004091932,0.36137405,0.4893729,0.13361447],"study_design_scores_gemma":[0.012392068,0.00090220786,0.0072183893,0.0003312255,0.00009227858,0.000010404949,0.00025731281,0.5526252,0.03552865,0.022291826,0.3663491,0.002001369],"about_ca_topic_score_codex":0.000010106106,"about_ca_topic_score_gemma":0.000015162002,"teacher_disagreement_score":0.9052325,"about_ca_system_score_codex":0.000032105378,"about_ca_system_score_gemma":0.00005046336,"threshold_uncertainty_score":0.45526555},"labels":[],"label_agreement":null},{"id":"W2488454791","doi":"10.1090/fim/027/06","title":"Geometric representations of graphs","year":2010,"lang":"en","type":"book-chapter","venue":"American Mathematical Society eBooks","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Computer science; Combinatorics","score_opus":0.01410708171177255,"score_gpt":0.2494827266668503,"score_spread":0.23537564495507776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2488454791","genre_codex":"other","genre_gemma":"methods","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.0001363836,0.000041559546,0.35807914,0.000107949796,0.000118260235,0.0002762501,0.000020917223,0.0001712237,0.6410483],"genre_scores_gemma":[0.016998144,0.000077575765,0.66266763,0.0007955602,0.00015205459,0.000064877015,0.000014403735,0.00012627366,0.31910345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979781,0.000026398659,0.00057533087,0.00053020864,0.00057068525,0.00031930054],"domain_scores_gemma":[0.9971703,0.0006618091,0.00060556823,0.0012234559,0.0001509088,0.00018794133],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003749442,0.00034256402,0.00070898875,0.00018230839,0.0001525175,0.000063232634,0.0011892309,0.00022035437,0.00016670961],"category_scores_gemma":[0.00006169021,0.00030344457,0.0009579632,0.00020790745,0.001604506,0.00007085053,0.0003799094,0.00070656114,0.00010148062],"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":[8.9061825e-7,0.000030390558,0.0000015317174,0.000056852085,0.00013344923,0.0000035418923,0.00066277175,3.327612e-7,0.00018053789,0.97557753,0.00029891898,0.023053242],"study_design_scores_gemma":[0.00010856136,0.00009933819,0.000009999347,0.00006184567,0.00006401017,0.000018051245,0.00006947032,0.00034825274,0.000655981,0.99389493,0.004334815,0.0003347475],"about_ca_topic_score_codex":0.000007770889,"about_ca_topic_score_gemma":5.860473e-7,"teacher_disagreement_score":0.32194486,"about_ca_system_score_codex":0.000018504988,"about_ca_system_score_gemma":0.0000774225,"threshold_uncertainty_score":0.99994177},"labels":[],"label_agreement":null},{"id":"W2500828208","doi":"10.1109/ccgrid.2016.107","title":"Management of Distributed Big Data for Social Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":17,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Big data; Computer science; Data science; Cloud computing; Data management; Analytics; Variety (cybernetics); External Data Representation; Data mining; Artificial intelligence","score_opus":0.052238567226230076,"score_gpt":0.26774708358366056,"score_spread":0.21550851635743049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2500828208","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.00021761637,0.00001209404,0.99791646,0.00081030524,0.00030039105,0.00008955237,0.0000774611,0.000044251035,0.0005318831],"genre_scores_gemma":[0.95517534,0.000012540125,0.04378712,0.000069119305,0.00016176335,0.000011078256,0.000039458737,0.0000039121596,0.00073963805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995046,0.000014834048,0.00009723376,0.00018554548,0.000066256645,0.00013148022],"domain_scores_gemma":[0.99937975,0.000051825475,0.00003587479,0.0004860575,0.000025917685,0.000020598778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023880196,0.000045146524,0.00006547267,0.000015675134,0.00005479915,0.000016264823,0.001049922,0.000019244546,0.000006410747],"category_scores_gemma":[0.000003605918,0.000027273718,0.000028862209,0.0001287644,0.00003194915,0.00014463467,0.00049148046,0.00001177452,0.0000027470296],"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.000003644911,0.00001861852,0.000010521329,0.000005127871,0.000021390224,9.596109e-7,0.0000059599633,0.000002550113,0.000015186256,0.553236,0.0028943715,0.44378567],"study_design_scores_gemma":[0.00445699,0.00024062808,0.00829084,0.0001364306,0.000077649696,0.00000437026,0.00012055759,0.22424997,0.002414572,0.63457304,0.124667205,0.0007677293],"about_ca_topic_score_codex":7.434432e-7,"about_ca_topic_score_gemma":5.438811e-7,"teacher_disagreement_score":0.9549577,"about_ca_system_score_codex":0.0000043604878,"about_ca_system_score_gemma":0.000004712612,"threshold_uncertainty_score":0.19510336},"labels":[],"label_agreement":null},{"id":"W2508783029","doi":"10.5555/3192424.3192612","title":"An experimental evaluation of Giraph and GraphCHI","year":2016,"lang":"en","type":"article","venue":"Advances in Social Networks Analysis and Mining","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"PageRank; Computer science; Implementation; Computation; Graph; Theoretical computer science; Parallel computing; Computer cluster; Distributed computing; Algorithm; Programming language","score_opus":0.013547422374541639,"score_gpt":0.3138315747550336,"score_spread":0.30028415238049194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508783029","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.75882727,0.005175052,0.23573048,0.000017271988,0.000050692113,0.0000366255,6.811067e-7,0.000009091728,0.00015281001],"genre_scores_gemma":[0.9959334,0.0003527557,0.0036334917,0.00001864035,0.000048913327,0.000007454341,0.0000010160861,0.0000022229078,0.0000021159578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991688,0.00015703595,0.00016416192,0.00022861022,0.00015984054,0.00012152318],"domain_scores_gemma":[0.9996558,0.00007322136,0.000099331075,0.000099687924,0.000039832295,0.000032140728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007932651,0.000070341666,0.00017861922,0.00015853428,0.00011697169,0.000025284751,0.000120318866,0.000034308094,0.000005383878],"category_scores_gemma":[0.0000072069565,0.000052310785,0.00005181452,0.0006949225,0.00011660798,0.00062207715,0.00004197659,0.000027246164,3.062741e-8],"study_design_candidate":"design_other","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.0000090975145,0.000049730876,0.067193575,0.0000018784516,0.000082288745,8.778918e-7,0.0026618578,0.0030098266,0.00051346177,0.031749878,0.000001453282,0.8947261],"study_design_scores_gemma":[0.0017003994,0.00024157893,0.09701031,0.00006541735,0.00040816283,0.0000018007588,0.0034812065,0.8493085,0.000967346,0.04627407,0.000094914016,0.00044632104],"about_ca_topic_score_codex":0.0000032820305,"about_ca_topic_score_gemma":0.000030368668,"teacher_disagreement_score":0.8942798,"about_ca_system_score_codex":0.000006880579,"about_ca_system_score_gemma":0.000005588512,"threshold_uncertainty_score":0.21331719},"labels":[],"label_agreement":null},{"id":"W2518178976","doi":"10.1002/cpe.3896","title":"BRGP: a balanced RDF graph partitioning algorithm for cloud storage","year":2016,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"RDF; Computer science; Graph partition; Partition (number theory); Algorithm; Graph; Cluster analysis; Theoretical computer science; Mathematics; Semantic Web; Information retrieval; Artificial intelligence; Combinatorics","score_opus":0.01815302016986699,"score_gpt":0.2989604839171414,"score_spread":0.28080746374727444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518178976","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.024035532,0.0008261797,0.9730537,0.00096652843,0.0006727459,0.00018172771,0.000008854569,0.00009695725,0.00015779013],"genre_scores_gemma":[0.92596877,0.00032253313,0.072851,0.00057730696,0.00010380801,0.00011491012,0.0000037051889,0.0000062150048,0.0000517382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884117,0.000109691224,0.00022288573,0.00044525656,0.00014361957,0.00023736124],"domain_scores_gemma":[0.99858564,0.0008176459,0.0001641921,0.00015199507,0.0001611825,0.00011932705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035131563,0.00014130623,0.00014326657,0.00006676937,0.00041181035,0.00020729408,0.00018860115,0.000046916954,0.000005704808],"category_scores_gemma":[0.00019530361,0.000110040106,0.000036398593,0.00022178868,0.00017086428,0.0021153633,0.000082194325,0.00006954812,0.000005210788],"study_design_candidate":"design_other","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.000014564786,0.000046253488,0.00006810619,0.000011330993,0.00001255234,0.0000065388263,0.005281419,0.000009434844,0.00039317977,0.09385214,0.00013658199,0.9001679],"study_design_scores_gemma":[0.008097011,0.0019411923,0.002824674,0.00057457114,0.00010373989,0.00067964545,0.009652026,0.5106973,0.005666957,0.3873683,0.07016824,0.0022263317],"about_ca_topic_score_codex":0.0000039507463,"about_ca_topic_score_gemma":2.9489058e-7,"teacher_disagreement_score":0.90193325,"about_ca_system_score_codex":0.000008462003,"about_ca_system_score_gemma":0.000033034743,"threshold_uncertainty_score":0.44873053},"labels":[],"label_agreement":null},{"id":"W2520718782","doi":"10.1145/2938503.2938554","title":"Improving GraphChi for Large Graph Processing","year":2016,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph; Locality; PageRank; Sliding window protocol; Process (computing); Theoretical computer science; Window (computing); Operating system","score_opus":0.00950367020382678,"score_gpt":0.22890551647020052,"score_spread":0.21940184626637374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520718782","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.0036998638,0.000060925173,0.99366957,0.0005222737,0.00016820125,0.000134457,0.0000033830386,0.00027802464,0.0014633166],"genre_scores_gemma":[0.8663169,0.000002262757,0.13241844,0.00039374887,0.000073057476,0.000037922346,4.912576e-7,0.000008881988,0.00074824755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991412,0.000018417157,0.00012166341,0.00029651594,0.00009566082,0.00032650577],"domain_scores_gemma":[0.9994716,0.000076130775,0.00005034022,0.00027345328,0.00006122688,0.00006723803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037645522,0.00009307125,0.000084666084,0.00010801577,0.00021011032,0.00009449992,0.0005123159,0.000033348675,0.00001203141],"category_scores_gemma":[0.000031716674,0.000053145475,0.00009123864,0.00026415035,0.000023218088,0.00066689897,0.000101617785,0.000029045988,0.000011808493],"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.0000028093305,0.000026994703,0.0002796134,0.0000127372095,0.0000039753513,9.747006e-7,0.00008321343,9.880767e-8,0.0043812185,0.58357984,0.0001727669,0.41145578],"study_design_scores_gemma":[0.00149902,0.0001513647,0.00064017077,0.00004611597,0.000007586404,0.000012761477,0.000059358772,0.011511597,0.020646976,0.9607345,0.0042788987,0.00041166323],"about_ca_topic_score_codex":0.0000010404268,"about_ca_topic_score_gemma":0.000002636165,"teacher_disagreement_score":0.8626171,"about_ca_system_score_codex":0.0000057169154,"about_ca_system_score_gemma":0.000022986662,"threshold_uncertainty_score":0.21672095},"labels":[],"label_agreement":null},{"id":"W2529794174","doi":"10.1109/bigdatacongress.2016.22","title":"Analytics Toolkit for Business Big Data","year":2016,"lang":"en","type":"article","venue":"","topic":"Graph Theory 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":"University of New Brunswick","funders":"","keywords":"Computer science; Big data; Scalability; Executable; Workflow; Analytics; Graph; Data mining; Data science; Business analytics; Reuse; Data modeling; Database; Theoretical computer science; Business model; Business analysis","score_opus":0.1062482427747063,"score_gpt":0.2730183590526398,"score_spread":0.16677011627793353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529794174","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.0004224993,0.000012672038,0.99485683,0.002659949,0.0005776913,0.000063418476,0.000023232978,0.00009099605,0.0012927351],"genre_scores_gemma":[0.656569,0.00003496812,0.32333714,0.0014753474,0.00078269216,0.000015747628,0.00001986149,0.000017423426,0.017747823],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938244,0.000011581459,0.000092842274,0.00027461135,0.000081109574,0.00015742636],"domain_scores_gemma":[0.9986023,0.00015184165,0.000024947638,0.0010943599,0.00008425488,0.000042353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027671322,0.000060350718,0.000070594906,0.000047480586,0.000057151865,0.00006932649,0.0015572504,0.000021977126,0.000014168058],"category_scores_gemma":[0.00008706812,0.000033379933,0.000020815716,0.00029078015,0.000029974271,0.00047534268,0.00041793517,0.00001375901,0.000035566118],"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.0000027147003,0.000023731465,0.00009685845,0.0000047226586,0.000011154474,0.0000018078476,0.000012048365,0.0000030482581,0.00029638768,0.42126337,0.004909474,0.5733747],"study_design_scores_gemma":[0.0016267392,0.00010185535,0.004058365,0.000053770375,0.000026310678,0.00002264936,0.000018555356,0.1167063,0.004438322,0.5079408,0.36436802,0.0006383175],"about_ca_topic_score_codex":0.0000024960323,"about_ca_topic_score_gemma":0.0000043318337,"teacher_disagreement_score":0.6715197,"about_ca_system_score_codex":0.0000042873367,"about_ca_system_score_gemma":0.000032262014,"threshold_uncertainty_score":0.28937843},"labels":[],"label_agreement":null},{"id":"W2549764709","doi":"10.1109/asonam.2016.7752208","title":"Streaming METIS partitioning","year":2016,"lang":"en","type":"preprint","venue":"2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Metis; Computer science; World Wide Web","score_opus":0.02902060170990805,"score_gpt":0.31877364606897796,"score_spread":0.2897530443590699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549764709","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.021300133,0.001721755,0.9565886,0.001623894,0.0030423575,0.00020059367,0.0000978129,0.00013343213,0.015291406],"genre_scores_gemma":[0.984193,0.004775357,0.00896888,0.00020204615,0.0009813594,0.000086306,0.00007255157,0.000019742509,0.00070071284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969294,0.00025819486,0.0006558752,0.0011107957,0.00055732083,0.00048842316],"domain_scores_gemma":[0.99796295,0.0004357423,0.00065965916,0.00053628185,0.00028228934,0.00012306253],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007701852,0.00044305687,0.000728464,0.0005094968,0.00034110274,0.0005423203,0.0017450314,0.0003092586,0.00015972058],"category_scores_gemma":[0.0001107593,0.00038607154,0.00036841288,0.0005922905,0.00021913799,0.0006361209,0.00089873985,0.00059011555,0.000009124695],"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.00006668678,0.00015882835,0.013327635,0.000031964842,0.0013819218,0.000058383095,0.0017064693,0.01941068,0.000033392516,0.49435538,0.0004338014,0.46903485],"study_design_scores_gemma":[0.0009596056,0.00010488522,0.010648295,0.001599689,0.00035131813,0.000004524405,0.00054715207,0.6629407,0.000062266045,0.31881192,0.0025707693,0.0013989216],"about_ca_topic_score_codex":0.00003359824,"about_ca_topic_score_gemma":0.00015586066,"teacher_disagreement_score":0.9628929,"about_ca_system_score_codex":0.00012342952,"about_ca_system_score_gemma":0.0000985633,"threshold_uncertainty_score":0.9998591},"labels":[],"label_agreement":null},{"id":"W2563324989","doi":"10.5555/3014904.3014945","title":"Graph colouring as a challenge problem for dynamic graph processing on distributed systems","year":2016,"lang":"en","type":"article","venue":"IEEE International Conference on High Performance Computing, Data, and Analytics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":19,"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 British Columbia","funders":"","keywords":"Computer science; Granularity; Graph; Analytics; Distributed computing; Graph database; Theoretical computer science; Data mining","score_opus":0.048517928316412294,"score_gpt":0.30488250537036143,"score_spread":0.25636457705394916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563324989","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.20846517,0.00006026714,0.78767174,0.001374854,0.0010209056,0.0003294307,0.00044448473,0.00016947558,0.00046364803],"genre_scores_gemma":[0.99660796,0.0003446845,0.0024259558,0.00011613352,0.0001577528,0.000018199975,0.00013404034,0.000015263082,0.00017998528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790496,0.000044463526,0.00042917396,0.00077382196,0.0004468158,0.00040074502],"domain_scores_gemma":[0.9984172,0.00017271258,0.0003321064,0.0005790865,0.00037146718,0.00012741625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054095575,0.00029025867,0.00028426756,0.00030483716,0.00036886902,0.00044063086,0.0017629394,0.00009023428,0.000004382456],"category_scores_gemma":[0.000035682435,0.00021468385,0.00005524104,0.00023725607,0.00014195236,0.0007168491,0.00026833886,0.00018786086,0.000016277281],"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.00022755805,0.00055827276,0.0013456675,0.0004042615,0.00030391218,0.000031358257,0.00055476534,0.0066010337,0.0005513425,0.8002327,0.000671441,0.18851769],"study_design_scores_gemma":[0.0009424219,0.0005394284,0.0007001087,0.0010170578,0.000018832825,0.000022554339,0.000054901222,0.9778014,0.00018397381,0.017613221,0.0007372345,0.00036889425],"about_ca_topic_score_codex":0.000009170894,"about_ca_topic_score_gemma":0.0000042819247,"teacher_disagreement_score":0.97120035,"about_ca_system_score_codex":0.000059182756,"about_ca_system_score_gemma":0.00009710981,"threshold_uncertainty_score":0.8754554},"labels":[],"label_agreement":null},{"id":"W2564000433","doi":"10.1145/2996913.2996956","title":"Enhancing scene parsing by transferring structures via efficient low-rank graph matching","year":2016,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","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 Calgary","funders":"","keywords":"Parsing; Computer science; Graph; Rank (graph theory); Matching (statistics); Artificial intelligence; Theoretical computer science; Mathematics; Combinatorics; Statistics","score_opus":0.0048613708042787316,"score_gpt":0.20379923096092314,"score_spread":0.1989378601566444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564000433","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.31744483,0.00008522097,0.68133944,0.00021360806,0.00035636793,0.00007447687,0.00000180955,0.00020907792,0.00027515396],"genre_scores_gemma":[0.970511,0.00000737946,0.029139234,0.00021249692,0.000045517627,0.000003978535,5.1725766e-7,0.000013256834,0.00006660795],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99836475,0.000087818706,0.00027782423,0.00048713156,0.00029062096,0.00049185776],"domain_scores_gemma":[0.9992281,0.00014257639,0.000044962402,0.00040953179,0.00003259856,0.00014219596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004166828,0.00020675635,0.0001859886,0.00013995208,0.0003065009,0.00014212534,0.00067138945,0.000060127313,0.000054518936],"category_scores_gemma":[0.000008581927,0.00013397032,0.00012022222,0.00032144398,0.00006549499,0.00035405887,0.00008966552,0.000111011475,0.000021617465],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00000809812,0.00004414125,0.00003006685,0.000023123008,0.000022950808,0.000011267891,0.0011618921,0.00060395745,0.811357,0.05960499,0.000025278152,0.12710722],"study_design_scores_gemma":[0.0005651954,0.00004581688,0.00023709219,0.00017676003,0.000007570891,0.000031202428,0.000060566534,0.0056061335,0.8503098,0.14250629,0.000043906195,0.000409662],"about_ca_topic_score_codex":0.000024815057,"about_ca_topic_score_gemma":0.000006242826,"teacher_disagreement_score":0.65306616,"about_ca_system_score_codex":0.000026718562,"about_ca_system_score_gemma":0.000016873704,"threshold_uncertainty_score":0.5463151},"labels":[],"label_agreement":null},{"id":"W2572108386","doi":"","title":"On Indidence Energy of Tree.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Tree (set theory); Energy (signal processing); Forestry; Statistics; Combinatorics; Geography","score_opus":0.007500015027557068,"score_gpt":0.20943162718954364,"score_spread":0.20193161216198657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572108386","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.8507881,0.00014269,0.12761995,0.001223607,0.005079394,0.0001078848,0.0000037661123,0.00026477536,0.014769838],"genre_scores_gemma":[0.9988967,0.00001073755,0.00052552676,0.00011909502,0.0000032304438,0.0000049517466,1.5071494e-7,0.0000046195155,0.00043499886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992026,0.00006947636,0.00014174789,0.00021860791,0.0002003853,0.00016718764],"domain_scores_gemma":[0.9990526,0.0002722279,0.000077748584,0.0004896014,0.00004628103,0.00006154233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018436948,0.00008753631,0.00011750777,0.00008688316,0.000044049666,0.000015511463,0.0007477856,0.000041220817,0.000014117744],"category_scores_gemma":[0.00005471362,0.000058408372,0.000055176442,0.00027063445,0.00006657878,0.00023692974,0.00011477805,0.000037705067,0.000033982844],"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.000004641787,0.000058948426,0.00017655829,0.0000013897853,0.0000063060493,0.000006215707,0.000060056307,4.9079864e-7,0.0015905837,0.9582534,0.0002747215,0.039566733],"study_design_scores_gemma":[0.00040364533,0.00019191741,0.0011247031,0.000040828185,0.0000013828144,0.0000024461156,0.0000022480217,0.000104744126,0.039712533,0.95802665,0.00030009044,0.0000888066],"about_ca_topic_score_codex":0.0000051290426,"about_ca_topic_score_gemma":7.2734986e-7,"teacher_disagreement_score":0.1481086,"about_ca_system_score_codex":0.000013417969,"about_ca_system_score_gemma":0.000024547891,"threshold_uncertainty_score":0.23818243},"labels":[],"label_agreement":null},{"id":"W2575543966","doi":"","title":"A New Characterization of Disk Graphs and its Application.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Characterization (materials science); Mathematics; Nanotechnology; Materials science","score_opus":0.0057976404057718065,"score_gpt":0.20354795934248932,"score_spread":0.19775031893671752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575543966","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.896428,0.000056526897,0.102253534,0.00050210336,0.0004185672,0.00013353543,0.000003524398,0.00007617843,0.00012802756],"genre_scores_gemma":[0.9990919,0.00003715285,0.0006680324,0.00003041892,0.0000027210187,0.000008441342,0.0000012503167,0.000004042923,0.0001560023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947196,0.000028607603,0.00012090635,0.00018234045,0.0000979053,0.00009830091],"domain_scores_gemma":[0.99951607,0.000043391872,0.000080210215,0.0002433691,0.000047620622,0.00006930951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011020583,0.00006615634,0.000088308836,0.00005860111,0.000042664462,0.000016800455,0.00028926937,0.000030880787,0.000005059722],"category_scores_gemma":[0.0000137131765,0.000048229216,0.000023919423,0.0002577262,0.000020802348,0.000355252,0.00008257355,0.00002416947,0.000013491585],"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.0000018618015,0.000016660051,0.0006723987,0.000003528912,0.0000047117637,2.7652652e-7,0.00008981974,1.4798507e-8,0.08007907,0.8784264,0.000010907341,0.04069435],"study_design_scores_gemma":[0.00039052547,0.00004160721,0.017762735,0.000016521466,0.0000030007893,0.0000021343383,0.000001326589,0.00026220008,0.036402836,0.9447313,0.0003079218,0.00007790259],"about_ca_topic_score_codex":0.0000019009173,"about_ca_topic_score_gemma":1.1953226e-7,"teacher_disagreement_score":0.102663934,"about_ca_system_score_codex":0.000004524929,"about_ca_system_score_gemma":0.00001793063,"threshold_uncertainty_score":0.19667304},"labels":[],"label_agreement":null},{"id":"W2579031575","doi":"10.1090/noti1471","title":"Report on Bridges 2016—In Memory of Our Founder, Reza Sarhangi (1952–2016)","year":2017,"lang":"en","type":"article","venue":"Notices of the American Mathematical Society","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Founder effect; Biology; Genetics","score_opus":0.025748630854166538,"score_gpt":0.2993830584797167,"score_spread":0.2736344276255501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579031575","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.93851,0.000079759346,0.04026592,0.008243176,0.00064541225,0.00046877435,0.000010790785,0.00008343181,0.011692703],"genre_scores_gemma":[0.9632878,0.000013050513,0.035499666,0.00030631246,0.00006875531,0.000008025293,2.996748e-7,0.000013138947,0.0008029703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814785,0.00012376336,0.0005125423,0.0003643085,0.000533141,0.00031838054],"domain_scores_gemma":[0.9960161,0.0003856778,0.0013234655,0.002111795,0.000083868435,0.00007908861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013360245,0.00018632138,0.0005453815,0.000030775576,0.00022696107,0.00008235411,0.0024695352,0.00005463144,0.000007395413],"category_scores_gemma":[0.0005730482,0.0001225242,0.0004883489,0.0002051512,0.0007718858,0.00027796716,0.00060226396,0.00021604853,0.000020930092],"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.0003608704,0.008993123,0.021152789,0.0033430194,0.0018227932,0.00028554164,0.029102344,0.003553763,0.011382562,0.7182571,0.030524932,0.17122115],"study_design_scores_gemma":[0.0028164196,0.0012015024,0.14453915,0.0025940663,0.00025744972,0.000111624526,0.007136162,0.12718162,0.036408752,0.67535454,0.0007319331,0.0016668072],"about_ca_topic_score_codex":0.00012615754,"about_ca_topic_score_gemma":0.0000030400238,"teacher_disagreement_score":0.16955435,"about_ca_system_score_codex":0.000032261873,"about_ca_system_score_gemma":0.000075214055,"threshold_uncertainty_score":0.4996392},"labels":[],"label_agreement":null},{"id":"W2579550659","doi":"10.1090/dimacs/069/11","title":"How far is, should and could be conjecture-making in graph theory an automated process?","year":2007,"lang":"en","type":"book-chapter","venue":"DIMACS series in discrete mathematics and theoretical computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Process (computing); Conjecture; Graph; Graph theory; Mathematics; Theoretical computer science; Combinatorics; Programming language","score_opus":0.02330091641513424,"score_gpt":0.29565991565204797,"score_spread":0.2723589992369137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2579550659","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.0065899924,0.0008310701,0.95602787,0.001331441,0.0004892957,0.0010038243,0.00005255427,0.0005472901,0.03312668],"genre_scores_gemma":[0.82698506,0.00029434988,0.17041066,0.0014820803,0.000101453414,0.000027096681,0.000011430389,0.000099927005,0.00058792863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961138,0.00007862588,0.00066699093,0.001405971,0.0009049309,0.0008296763],"domain_scores_gemma":[0.99781996,0.00043738086,0.0002905334,0.0009929155,0.00015292485,0.00030628082],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029775805,0.00072329916,0.00083862455,0.0008250354,0.00038524985,0.0015232628,0.0019430239,0.00039017253,0.000019007248],"category_scores_gemma":[0.000094360614,0.00057939294,0.00009512642,0.0005958669,0.0063643274,0.0013458404,0.0012333344,0.0008337875,0.0000011182362],"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.000018890802,0.000045356457,0.000008923223,0.00020592901,0.000014195395,0.00010696171,0.0050830897,0.00001903197,0.000013418595,0.9878453,0.0000020655839,0.0066368594],"study_design_scores_gemma":[0.0002509897,0.00024350981,0.000022170165,0.0004889229,0.000014912052,0.0001568219,0.00017405134,0.20112069,0.0001523241,0.7966199,0.00013852856,0.0006171865],"about_ca_topic_score_codex":9.410183e-7,"about_ca_topic_score_gemma":0.000007652429,"teacher_disagreement_score":0.82039505,"about_ca_system_score_codex":0.000043268996,"about_ca_system_score_gemma":0.00010230045,"threshold_uncertainty_score":0.99966574},"labels":[],"label_agreement":null},{"id":"W2591798008","doi":"","title":"Firefighting on Geometric Graphs with Density Bounds.","year":2017,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012368162314488852,"score_gpt":0.2283409469996578,"score_spread":0.21597278468516895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591798008","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.98708975,0.00003855692,0.0023845541,0.0002923624,0.0019157446,0.000105952866,9.0197824e-7,0.00017250536,0.007999691],"genre_scores_gemma":[0.9980752,0.00000645412,0.0015426032,0.0001576603,0.000008062386,0.0000070562323,8.5252464e-7,0.000010690884,0.00019144814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869365,0.00005440844,0.00013252089,0.0004295337,0.00034073892,0.0003491436],"domain_scores_gemma":[0.99802357,0.00012318355,0.00018692594,0.0014450963,0.00009386701,0.00012737804],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004318033,0.00017426454,0.00018720815,0.00021058907,0.0013127429,0.0006155595,0.001575634,0.000061359046,0.000005197413],"category_scores_gemma":[0.000118100485,0.00013967037,0.000071728,0.00045326783,0.00012884843,0.00061497453,0.00027957483,0.00022111252,0.000082581675],"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.000009454873,0.00008422991,0.0095453495,0.0000044282133,0.000020323449,0.00006664094,0.00009151456,0.0000022337779,0.00002458023,0.9791631,0.00018875388,0.010799387],"study_design_scores_gemma":[0.0008120542,0.00032145166,0.084271915,0.000039084236,0.000007901817,0.000020237185,0.000007857435,0.00075697096,0.00323787,0.90971935,0.0005304345,0.00027487375],"about_ca_topic_score_codex":0.000031363816,"about_ca_topic_score_gemma":0.0000026646956,"teacher_disagreement_score":0.07472656,"about_ca_system_score_codex":0.000024826251,"about_ca_system_score_gemma":0.00003310903,"threshold_uncertainty_score":0.9999874},"labels":[],"label_agreement":null},{"id":"W2591988823","doi":"","title":"TGDB: towards a benchmark for graph databases","year":2016,"lang":"en","type":"article","venue":"Computer Science and Software Engineering","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer science; Graph database; Wait-for graph; Graph; Theoretical computer science; Data mining; Database","score_opus":0.013223646050187294,"score_gpt":0.2217163676464122,"score_spread":0.2084927215962249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591988823","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.016131423,0.00014245424,0.98211706,0.00019300503,0.00094550784,0.00013032355,0.000010123464,0.00032417625,0.000005930298],"genre_scores_gemma":[0.2356519,0.000022134765,0.7639236,0.00019671327,0.00015217025,0.000027664857,9.517843e-7,0.000008626116,0.000016233635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985439,0.000010789697,0.00015002345,0.0005600529,0.00029256567,0.00044266402],"domain_scores_gemma":[0.99883115,0.00031062737,0.00003277336,0.00047913037,0.00015630007,0.00019000012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009405194,0.00015854993,0.00014631037,0.00027064802,0.0002580357,0.00020658551,0.0009789782,0.000023743934,0.0000019100632],"category_scores_gemma":[0.00030034134,0.00011042673,0.00005175005,0.00068195554,0.00017447991,0.0014398964,0.0004799968,0.000049779897,0.0000030498118],"study_design_candidate":"design_other","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.0000024949184,0.00002315059,0.00049440004,0.0000385922,0.000011038792,0.00000963266,0.00030786422,0.0002676735,0.0018302386,0.10584481,0.0003088768,0.8908612],"study_design_scores_gemma":[0.0026512647,0.0007919981,0.033551566,0.0008459975,0.000029023693,0.00029098743,0.000019377236,0.85183465,0.030722838,0.037620753,0.0390842,0.0025573426],"about_ca_topic_score_codex":0.000002012273,"about_ca_topic_score_gemma":2.643883e-7,"teacher_disagreement_score":0.8883039,"about_ca_system_score_codex":0.00002381112,"about_ca_system_score_gemma":0.000091208145,"threshold_uncertainty_score":0.45030713},"labels":[],"label_agreement":null},{"id":"W2600673011","doi":"","title":"Inexact graph matching : application to 2D and 3D Pattern Recognition","year":2016,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council Canada","keywords":"Modular decomposition; Computer science; Lattice graph; Matching (statistics); Kite; Theoretical computer science; Pattern recognition (psychology); Graph; Algorithm; Artificial intelligence; Line graph; Mathematics; Pathwidth; Voltage graph","score_opus":0.014894289166847955,"score_gpt":0.2226947104241731,"score_spread":0.20780042125732515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600673011","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.048631035,0.0005637944,0.915343,0.023597464,0.00049982825,0.00078743475,0.00013019159,0.00027266174,0.010174582],"genre_scores_gemma":[0.84834176,0.0007976561,0.1451904,0.0006731002,0.00011170151,0.00030606138,0.00031151483,0.000077245866,0.0041905213],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907567,0.0058029573,0.00074711675,0.0015821436,0.0005009262,0.0006101428],"domain_scores_gemma":[0.9929211,0.0017058845,0.00062727614,0.002518285,0.0017575134,0.0004699271],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0071992977,0.0005449337,0.0004712394,0.00038238833,0.0007042332,0.00094953,0.0018763664,0.00036039285,0.00010055422],"category_scores_gemma":[0.00046808124,0.0005530083,0.00021222592,0.00067030074,0.00031862198,0.00061484065,0.002322188,0.00065180217,0.0003514974],"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.00000852086,0.0002850156,0.00053676177,0.00014726781,0.000046842288,0.0000048721836,0.010801895,0.00005326976,0.0025674303,0.13074379,0.00011941028,0.85468495],"study_design_scores_gemma":[0.0015143424,0.000004370068,0.016009644,0.009692121,0.00015198199,0.00013424965,0.00025890974,0.05612888,0.029851602,0.8626571,0.021252513,0.0023442784],"about_ca_topic_score_codex":0.0011171584,"about_ca_topic_score_gemma":0.00066255906,"teacher_disagreement_score":0.85234064,"about_ca_system_score_codex":0.000107580694,"about_ca_system_score_gemma":0.0001431845,"threshold_uncertainty_score":0.99969214},"labels":[],"label_agreement":null},{"id":"W2612186437","doi":"10.1145/3035918.3056445","title":"Graphflow","year":2017,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":125,"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":"Computer science; Graph database; Join (topology); Graph; Induced subgraph isomorphism problem; Subgraph isomorphism problem; Theoretical computer science; Base (topology); Combinatorics; Mathematics; Line graph","score_opus":0.013159876591893844,"score_gpt":0.2454575349116648,"score_spread":0.23229765831977095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612186437","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.0105208075,0.0000133133,0.8360302,0.0012320934,0.00049664325,0.000025280237,1.7664657e-7,0.00013559977,0.15154593],"genre_scores_gemma":[0.96059567,0.0000020583857,0.037135612,0.00021314454,0.000024604191,0.0000013979296,5.2348728e-8,0.0000011729122,0.002026264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971044,0.000007381269,0.000033268647,0.00010681559,0.00005423529,0.00008787856],"domain_scores_gemma":[0.9991736,0.000008608691,0.000021819566,0.00074977044,0.000011728465,0.00003448414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010621967,0.000032278567,0.000032977678,0.000020424526,0.0003308903,0.00026406712,0.0011383513,0.000011888083,0.000027423106],"category_scores_gemma":[0.00001230509,0.000024471521,0.000030902393,0.000023249173,0.000037115053,0.0004328212,0.00015630633,0.000027412969,0.00012523553],"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":[1.7065248e-7,0.000005980244,0.0004677623,3.6202212e-7,0.0000018040414,0.0000048551797,0.00002741765,3.6229733e-7,0.00007886035,0.94312114,0.0003543172,0.055936966],"study_design_scores_gemma":[0.00020391736,0.000029675648,0.033826225,0.0000038723597,0.0000011265988,0.000010761706,0.0000062618155,0.01227977,0.0060771275,0.9382281,0.009184833,0.00014838035],"about_ca_topic_score_codex":0.0000053525177,"about_ca_topic_score_gemma":0.0000014866927,"teacher_disagreement_score":0.9500749,"about_ca_system_score_codex":8.742254e-7,"about_ca_system_score_gemma":0.000004222327,"threshold_uncertainty_score":0.25464052},"labels":[],"label_agreement":null},{"id":"W2618417782","doi":"","title":"AutoGraphiX: A Survey","year":2005,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Graph Theory 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":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"","keywords":"Geography","score_opus":0.019389482831308306,"score_gpt":0.22547142741063506,"score_spread":0.20608194457932674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618417782","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.26389998,0.022452442,0.66178656,0.02968079,0.0080384035,0.00042616585,0.0001426157,0.0006070008,0.012966055],"genre_scores_gemma":[0.85617346,0.0009820913,0.100376226,0.004028867,0.0016170254,0.000021897124,0.000028236993,0.000055635657,0.03671659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970338,0.0007959297,0.00037448198,0.0006581269,0.00034427576,0.0007934068],"domain_scores_gemma":[0.99824464,0.000400969,0.00013579708,0.0007452221,0.0001460992,0.00032726975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015371204,0.00035072066,0.0003255561,0.0002541326,0.00059627625,0.00039688702,0.0010727654,0.00034752022,0.00039206562],"category_scores_gemma":[0.00012253992,0.00037330936,0.00028101352,0.0013344883,0.00097246224,0.0008501949,0.00014282472,0.00065880496,0.00056601124],"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.000011742587,0.00016325417,0.002532475,0.000018359697,0.000061830586,0.000068078465,0.003512308,0.00008363328,0.000025535945,0.6462616,0.0052518034,0.34200943],"study_design_scores_gemma":[0.0013882417,0.00030614968,0.13639775,0.000082031525,0.000062093655,0.00037456973,0.00015949765,0.044180393,0.00066684873,0.15376048,0.66123277,0.0013891611],"about_ca_topic_score_codex":0.0004361387,"about_ca_topic_score_gemma":0.00028888695,"teacher_disagreement_score":0.655981,"about_ca_system_score_codex":0.000088730514,"about_ca_system_score_gemma":0.000093788,"threshold_uncertainty_score":0.9998719},"labels":[],"label_agreement":null},{"id":"W2623997153","doi":"10.1109/confluence.2017.7943203","title":"Tree structured data processing on GPUs","year":2017,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Tree (set theory); Data structure; Segment tree; Parallel computing; Interval tree; Binary tree; Fractal tree index; Copying; Tree structure; Overhead (engineering); Theoretical computer science; Graphics; Algorithm; Programming language; Computer graphics (images); Mathematics","score_opus":0.051913940832353934,"score_gpt":0.30169600844386346,"score_spread":0.24978206761150953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623997153","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.024625571,0.00006786667,0.82347894,0.0028520976,0.0012328448,0.00015777054,0.000011245201,0.0003952445,0.14717841],"genre_scores_gemma":[0.95607376,9.924781e-7,0.042690635,0.00024990898,0.00007329127,8.829977e-7,0.0000026050845,0.0000032993817,0.00090461335],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993354,0.000015519798,0.00006672071,0.0003175702,0.00012692448,0.0001378782],"domain_scores_gemma":[0.9976332,0.000014938533,0.00006281288,0.0022250905,0.000017390006,0.00004656511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017199037,0.00007016896,0.00006637254,0.000028453054,0.00046838733,0.00062251877,0.0036462992,0.00002459233,0.00001921199],"category_scores_gemma":[0.000043455086,0.000050114082,0.00001469602,0.000039577837,0.000048617945,0.0009815887,0.0006462399,0.000069060494,0.000032062784],"study_design_candidate":"design_other","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.0000024451554,0.000013459343,0.00010764892,0.0000032372218,0.0000033527324,0.0000102408185,0.00008106104,0.0000019736146,0.00019461526,0.12703943,0.00065996434,0.87188256],"study_design_scores_gemma":[0.0010737599,0.00016400022,0.042144913,0.00007198157,0.000010822061,0.00004011158,0.00006386241,0.45893434,0.018419007,0.46819386,0.010254238,0.0006290928],"about_ca_topic_score_codex":0.000006061219,"about_ca_topic_score_gemma":0.000013276594,"teacher_disagreement_score":0.9314482,"about_ca_system_score_codex":0.0000023951843,"about_ca_system_score_gemma":0.000021636613,"threshold_uncertainty_score":0.67757916},"labels":[],"label_agreement":null},{"id":"W2624082338","doi":"10.1145/3078447.3078459","title":"Do We Need Specialized Graph Databases?","year":2017,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":26,"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","keywords":"Computer science; Graph database; Benchmarking; RDF; Wait-for graph; Graph; Architecture; Workload; Relational database management system; Database; Relational database; Theoretical computer science; Distributed computing; Information retrieval; Semantic Web; Operating system","score_opus":0.04281900210434345,"score_gpt":0.2929908326249927,"score_spread":0.25017183052064923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624082338","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.006484997,0.00017371307,0.89899635,0.004081578,0.0017245912,0.00014017306,0.000008132302,0.00028393182,0.088106535],"genre_scores_gemma":[0.80928016,0.0002558094,0.18225566,0.0006796474,0.0005235923,0.000014032041,0.0000041068115,0.00001592053,0.006971093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991441,0.00004068526,0.00011769561,0.00030446195,0.00017157817,0.00022152787],"domain_scores_gemma":[0.99800897,0.000042718028,0.000085607986,0.0017329127,0.000031428473,0.00009838336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030585926,0.00010402164,0.00012229673,0.00008008493,0.00052190135,0.0005464666,0.0018330191,0.000022573498,0.0002529867],"category_scores_gemma":[0.000048195714,0.0000819151,0.00008226771,0.00010749505,0.00010175501,0.0009773186,0.00049373973,0.000078327954,0.00023600987],"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.0000034917211,0.000026227572,0.0002787426,0.000002208991,0.000008404935,0.000020646366,0.000084791754,6.4741886e-7,0.00022629801,0.9516867,0.0022959185,0.04536593],"study_design_scores_gemma":[0.0014723712,0.000060306793,0.006593189,0.000047858568,0.000011105141,0.000028954644,0.00009102744,0.0035987871,0.00830243,0.81115043,0.16809186,0.0005516594],"about_ca_topic_score_codex":0.000036551166,"about_ca_topic_score_gemma":0.000009459306,"teacher_disagreement_score":0.8027951,"about_ca_system_score_codex":0.0000037820298,"about_ca_system_score_gemma":0.0000176759,"threshold_uncertainty_score":0.526959},"labels":[],"label_agreement":null},{"id":"W2730004797","doi":"","title":"Sequential Graph Matching with Sequential Monte Carlo.","year":2017,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Monte Carlo method; Matching (statistics); Algorithm; Artificial intelligence; Theoretical computer science; Mathematics; Statistics","score_opus":0.10435547367041688,"score_gpt":0.34068691526000244,"score_spread":0.23633144158958558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730004797","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.013352236,0.000007311546,0.9792838,0.00116271,0.0010960787,0.000111180925,0.00013075415,0.000056682526,0.004799245],"genre_scores_gemma":[0.9538495,0.000058333517,0.045511477,0.0001627209,0.00013844941,0.000011126774,0.000008991617,0.000009683926,0.00024972463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846035,0.000068844456,0.00030113992,0.00045786463,0.0004480131,0.0002638089],"domain_scores_gemma":[0.9987346,0.00011153506,0.00023067242,0.00047817072,0.00031841308,0.0001266091],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00031450932,0.0002069788,0.00017289403,0.00013451793,0.00063815684,0.0015992384,0.0012391511,0.000060124185,0.00010679894],"category_scores_gemma":[0.00009753989,0.0001786121,0.00004162448,0.000056358975,0.00039097847,0.00061864126,0.0002248015,0.00023435848,0.000058114503],"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.000072763636,0.000046806428,0.000045604538,0.0000041856797,0.000039906237,0.000106470754,0.0005743417,0.0004728353,0.00043229904,0.9019616,0.000025291105,0.096217886],"study_design_scores_gemma":[0.000069470785,0.00022159211,0.00028855455,0.00007006201,0.000011964884,0.000043374006,0.00030980277,0.13221222,0.0029699407,0.8634265,0.00008821336,0.00028827714],"about_ca_topic_score_codex":0.00022926564,"about_ca_topic_score_gemma":0.00027650542,"teacher_disagreement_score":0.9404973,"about_ca_system_score_codex":0.000022344982,"about_ca_system_score_gemma":0.000082502,"threshold_uncertainty_score":0.9994372},"labels":[],"label_agreement":null},{"id":"W2732621197","doi":"10.1109/tpds.2017.2720174","title":"Combining Vertex-Centric Graph Processing with SPARQL for Large-Scale RDF Data Analytics","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":25,"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":"SPARQL; Named graph; Computer science; RDF; Analytics; RDF Schema; Graph; Graph database; Linked data; Theoretical computer science; PageRank; Information retrieval; Database; Semantic Web","score_opus":0.04261578362629414,"score_gpt":0.2699335214137163,"score_spread":0.22731773778742215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732621197","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.0024545752,0.00018470216,0.99498934,0.00022301546,0.0005532744,0.0004021085,0.0009867029,0.00012578839,0.0000805136],"genre_scores_gemma":[0.99557865,0.00003748251,0.0040119183,0.000028084401,0.000027277174,0.000058566653,0.000092770184,0.000013425207,0.00015182582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839765,0.000055510052,0.00028224575,0.0006025385,0.00024185979,0.0004202048],"domain_scores_gemma":[0.9980755,0.00009337427,0.00022306945,0.0013067507,0.00011803158,0.00018331391],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00042178482,0.0002267755,0.00032089488,0.00011397026,0.0017531943,0.0008751891,0.0011751213,0.00009281411,0.0000015278138],"category_scores_gemma":[0.000007651618,0.00018279826,0.000064408436,0.00025439568,0.00009599673,0.0009120394,0.00001416639,0.00017613516,0.0000045957713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019426238,0.006657136,0.004545533,0.0027207334,0.0020563689,0.0003057203,0.0042223674,0.816183,0.00041638748,0.07407738,0.0054666656,0.081406094],"study_design_scores_gemma":[0.0023846424,0.00018272283,0.0004008893,0.00019012463,0.000100722435,0.000060046932,0.0003290993,0.9935406,0.000050962062,0.00095571927,0.0014556721,0.00034883711],"about_ca_topic_score_codex":0.000031442367,"about_ca_topic_score_gemma":0.000045864723,"teacher_disagreement_score":0.99312407,"about_ca_system_score_codex":0.000018266073,"about_ca_system_score_gemma":0.000063023035,"threshold_uncertainty_score":0.9995464},"labels":[],"label_agreement":null},{"id":"W2746601043","doi":"10.1007/978-3-319-65636-6_24","title":"k-core Decomposition on Giraph and GraphChi","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes on data engineering and communications technologies","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Decomposition; Graph; Analytics; Graph algorithms; Theoretical computer science; Power graph analysis; Core (optical fiber); Distributed computing; Data mining","score_opus":0.05610330495523382,"score_gpt":0.28303480687371163,"score_spread":0.2269315019184778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2746601043","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.00064474484,0.05178941,0.8801484,0.023994505,0.00071585574,0.0013480814,0.0013208324,0.009853861,0.0301843],"genre_scores_gemma":[0.73202556,0.032946464,0.23269886,0.00032943892,0.00006604559,0.00007584132,0.0010563435,0.00010787293,0.00069359946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990159,0.000009563598,0.00016344555,0.0005242778,0.00011907386,0.00016770457],"domain_scores_gemma":[0.9916282,0.0004508078,0.00012926939,0.0077304165,0.000029123628,0.000032134685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001501633,0.00033479524,0.0002681053,0.00041677136,0.00048567462,0.0002520052,0.0046446705,0.000370103,7.829289e-7],"category_scores_gemma":[0.00016816366,0.00029037416,0.000042918462,0.00005001929,0.00030164723,0.00020932472,0.0025821407,0.00089863164,0.0000058817677],"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.0000025924871,0.000013364843,0.0000026507369,0.000024144372,0.000043524327,0.000003399274,0.00002906848,0.00010487637,0.000064460146,0.68828094,0.000055840927,0.3113751],"study_design_scores_gemma":[0.00033526696,0.00043370514,0.00014109943,0.0013066732,0.00009015406,0.00009664155,0.000009450841,0.05563908,0.00084142794,0.8477209,0.09220221,0.0011833535],"about_ca_topic_score_codex":0.000002873112,"about_ca_topic_score_gemma":0.000006890954,"teacher_disagreement_score":0.7313808,"about_ca_system_score_codex":0.000012254179,"about_ca_system_score_gemma":0.000010589894,"threshold_uncertainty_score":0.9999548},"labels":[],"label_agreement":null},{"id":"W2755658662","doi":"10.1007/s00778-019-00548-x","title":"The ubiquity of large graphs and surprising challenges of graph processing: extended survey","year":2019,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"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","keywords":"Suite; Graph; Scalability; Graph drawing; Visualization; Call graph; Data visualization","score_opus":0.02115508178165599,"score_gpt":0.263779211117652,"score_spread":0.24262412933599603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755658662","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.97707313,0.010872157,0.01053594,0.0006123199,0.00033721482,0.00010351246,0.0000034475877,0.000017381304,0.00044487312],"genre_scores_gemma":[0.99787635,0.0015956026,0.00045531598,0.000024503575,0.000015209698,6.114546e-7,1.1724429e-7,0.000005328564,0.00002697661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998464,0.0005570263,0.00028938596,0.00013960875,0.00030292151,0.0002470809],"domain_scores_gemma":[0.9985958,0.00042138866,0.00036021325,0.00037201797,0.00019453108,0.000056075187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00607511,0.000102001664,0.00018986834,0.00008984667,0.00037550429,0.00010300818,0.00094073947,0.00003630782,0.0000032411062],"category_scores_gemma":[0.00006336103,0.000051677114,0.00008557205,0.00033507758,0.00019087331,0.00027276704,0.00018134832,0.0002671097,9.784143e-7],"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.00016533502,0.00030480957,0.015720204,0.00015055858,0.00019535318,0.000009244594,0.011057681,0.000034266897,0.0042524203,0.69050604,0.00008848106,0.27751562],"study_design_scores_gemma":[0.00078861014,0.00028353062,0.37315848,0.00018092996,0.000018981309,0.00025713403,0.0011980322,0.0020374642,0.0047164536,0.6170143,0.00015453479,0.00019152297],"about_ca_topic_score_codex":0.000007987756,"about_ca_topic_score_gemma":0.000022604152,"teacher_disagreement_score":0.3574383,"about_ca_system_score_codex":0.0000035692722,"about_ca_system_score_gemma":0.00005263678,"threshold_uncertainty_score":0.28881133},"labels":[],"label_agreement":null},{"id":"W2756194846","doi":"10.1109/compsac.2017.128","title":"Finding All Breadth First Full Spanning Trees in a Directed Graph","year":2017,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","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":"Carleton University","funders":"","keywords":"Tree traversal; Spanning tree; Graph traversal; Computer science; Graph; Combinatorics; Directed graph; Breadth-first search; Kruskal's algorithm; Depth-first search; Algorithm; Minimum spanning tree; Mathematics; Theoretical computer science; Discrete mathematics; Search algorithm","score_opus":0.027900822312562627,"score_gpt":0.2650167553155515,"score_spread":0.2371159330029889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756194846","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.68976593,0.00013050786,0.2646527,0.0028405553,0.0010297039,0.0002617255,0.0000032724072,0.00086930586,0.040446296],"genre_scores_gemma":[0.97693807,0.000009302366,0.022320304,0.00011271873,0.0000324421,0.000008393558,8.8805723e-7,0.000006061007,0.0005718167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99901456,0.00003790403,0.00015342863,0.00033584048,0.00013412914,0.00032416283],"domain_scores_gemma":[0.9989962,0.00008730369,0.000091035414,0.0007287294,0.000020476027,0.00007624812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003441698,0.00012606732,0.0001492013,0.00018349644,0.00039749805,0.00042154698,0.0013123248,0.000048970112,0.000029737397],"category_scores_gemma":[0.00006341207,0.000107795226,0.00006917527,0.00018552596,0.00006345799,0.0007221589,0.00030360598,0.00012317792,0.000033486893],"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.00006984931,0.0005458382,0.11184702,0.000046041994,0.00014982995,0.0007922317,0.013400973,0.00080374663,0.005554121,0.6573327,0.0022545622,0.20720306],"study_design_scores_gemma":[0.0019858298,0.00021588786,0.61868364,0.00027413404,0.000013577385,0.000076892036,0.00020214346,0.24311319,0.004233271,0.12627536,0.0038904343,0.0010356673],"about_ca_topic_score_codex":0.00022383065,"about_ca_topic_score_gemma":0.0008637176,"teacher_disagreement_score":0.53105736,"about_ca_system_score_codex":0.000012073289,"about_ca_system_score_gemma":0.000012084498,"threshold_uncertainty_score":0.43957618},"labels":[],"label_agreement":null},{"id":"W2765269579","doi":"10.1145/3125644","title":"Communication Steps for Parallel Query Processing","year":2017,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alberta Innovates - Technology Futures; Wisconsin Alumni Research Foundation; National Science Foundation","keywords":"Computer science; Skew; Joins; Upper and lower bounds; Parallel computing; Matching (statistics); Binary logarithm; Communication complexity; Simple (philosophy); Graph; Algorithm; Theoretical computer science; Combinatorics; Mathematics","score_opus":0.037609609778980244,"score_gpt":0.3058304111590551,"score_spread":0.26822080138007487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765269579","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.11801729,0.0013533386,0.8148931,0.06307626,0.0013457884,0.00023765347,0.000001310479,0.000019275392,0.0010559701],"genre_scores_gemma":[0.8377529,0.00001994161,0.16176395,0.00020402907,0.00008343023,0.0000014864706,3.5332263e-8,0.0000027516564,0.00017148658],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995686,0.000051436447,0.0001486013,0.00004451535,0.00011029805,0.00007658151],"domain_scores_gemma":[0.9975039,0.00008132352,0.0005688457,0.0016995929,0.00012094326,0.000025430205],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0007938588,0.000039668797,0.00007815321,0.000022010374,0.0006218582,0.00026597598,0.0069751837,0.000019697723,6.3539306e-7],"category_scores_gemma":[0.00061774626,0.000023185396,0.000098137185,0.00002832853,0.00005196342,0.00068648654,0.0007119059,0.000116490824,9.931789e-7],"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.00019272095,0.00042941666,0.0070456187,0.00012639171,0.00018272207,0.000013513354,0.006832731,0.0010717453,0.005712233,0.22132349,0.020370508,0.7366989],"study_design_scores_gemma":[0.00061177363,0.00006597264,0.018201446,0.00017627544,0.000016494843,0.00009024875,0.00006617589,0.008426005,0.0018263505,0.96530706,0.005127762,0.00008443273],"about_ca_topic_score_codex":0.0000010796194,"about_ca_topic_score_gemma":0.0000010729777,"teacher_disagreement_score":0.74398357,"about_ca_system_score_codex":0.000009407018,"about_ca_system_score_gemma":0.000042430715,"threshold_uncertainty_score":0.9983975},"labels":[],"label_agreement":null},{"id":"W2766773547","doi":"10.1007/s10766-017-0532-z","title":"BlockGraphChi: Enabling Block Update in Out-of-Core Graph Processing","year":2017,"lang":"en","type":"article","venue":"International Journal of Parallel Programming","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Theory of computation; Graph; Block (permutation group theory); Core (optical fiber); Parallel computing; Theoretical computer science; Distributed computing; Programming language; Mathematics; Telecommunications","score_opus":0.03523848755230249,"score_gpt":0.3201289732414859,"score_spread":0.28489048568918346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766773547","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.48802042,0.0013820195,0.50370616,0.0023137708,0.0037685225,0.00024180107,0.000002730522,0.00005451202,0.00051007175],"genre_scores_gemma":[0.89141273,0.000066294124,0.10823653,0.000053275937,0.00019947023,0.0000035876328,6.8306815e-7,0.000008822197,0.000018572904],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981058,0.000045236924,0.00072564645,0.00021770805,0.000632533,0.0002730633],"domain_scores_gemma":[0.9976993,0.000050936607,0.0012962493,0.0003186298,0.0005391074,0.000095786134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010423202,0.00015840204,0.000274674,0.0005741033,0.00017571122,0.00053932454,0.0029734802,0.000063282736,0.000003679319],"category_scores_gemma":[0.00015439936,0.00013839692,0.00022778362,0.00015706017,0.000144316,0.0013070923,0.00029175644,0.0003410715,0.000002698076],"study_design_candidate":"design_other","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.00015234732,0.00052938896,0.033209637,0.000046693258,0.00027447072,0.0009098909,0.0032905808,0.002348268,0.0016296427,0.039676405,0.000035138026,0.9178975],"study_design_scores_gemma":[0.018381782,0.0015927805,0.061263032,0.0065948484,0.00019890122,0.0027585526,0.0022104157,0.09261358,0.0143179605,0.76172,0.035407946,0.0029401754],"about_ca_topic_score_codex":0.000012794938,"about_ca_topic_score_gemma":0.00001661978,"teacher_disagreement_score":0.91495734,"about_ca_system_score_codex":0.000027298707,"about_ca_system_score_gemma":0.000095853735,"threshold_uncertainty_score":0.5643662},"labels":[],"label_agreement":null},{"id":"W2774770728","doi":"10.1016/b978-0-08-101107-2.00044-0","title":"Graph Matching, System Design and Knowledge Modeling","year":2005,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Systems modeling; Matching (statistics); Graph; Software; Software system; Software engineering; Theoretical computer science; Artificial intelligence; Programming language; Mathematics","score_opus":0.02090635705127567,"score_gpt":0.22698923437182472,"score_spread":0.20608287732054906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774770728","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007276597,0.0034802402,0.37538204,0.0000115462335,0.00037357656,0.00033059545,0.000003055534,0.0002654281,0.6201463],"genre_scores_gemma":[0.0043838006,0.00012255882,0.065677315,0.00011545115,0.00043026416,0.0000402091,0.0000026515488,0.00009221702,0.9291355],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801505,0.000105312,0.00046179013,0.00078283314,0.000257002,0.00037798836],"domain_scores_gemma":[0.99860394,0.000095212374,0.00018233985,0.00082099915,0.000094077055,0.0002034389],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008174896,0.0005219612,0.0005473029,0.00032854895,0.00028837682,0.00022822688,0.0009376915,0.00031007538,0.000007971896],"category_scores_gemma":[0.0000025445527,0.00048174095,0.00022031722,0.000026725853,0.00009368664,0.0001646317,0.00041008892,0.0005002202,0.00013663758],"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.0000024119038,0.0000035123167,2.8985127e-8,0.00008237801,0.000041357187,0.000022116114,0.00059829187,0.0002609219,0.0000038199,0.3730719,0.000008069347,0.62590516],"study_design_scores_gemma":[0.00044904757,0.00009932877,2.3025329e-7,0.00191032,0.000120647004,0.00028075048,0.000028332852,0.14858568,0.00003303264,0.69027156,0.15692715,0.0012939452],"about_ca_topic_score_codex":2.6414497e-7,"about_ca_topic_score_gemma":0.000001748371,"teacher_disagreement_score":0.62461126,"about_ca_system_score_codex":0.000056368102,"about_ca_system_score_gemma":0.000101171274,"threshold_uncertainty_score":0.9997634},"labels":[],"label_agreement":null},{"id":"W2783397217","doi":"10.46430/phen0074","title":"Dealing with Big Data and Network Analysis Using Neo4j","year":2018,"lang":"en","type":"article","venue":"The Programming Historian","topic":"Graph Theory and Algorithms","field":"Computer Science","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":"Computer science; Graph database; Graph; Focus (optics); Big data; Power graph analysis; Data science; Information retrieval; Theoretical computer science; Data mining; Physics","score_opus":0.044197295334680226,"score_gpt":0.2586589628975906,"score_spread":0.21446166756291038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783397217","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.008243568,0.00051973894,0.9895267,0.00014274228,0.00066650746,0.000117747346,0.000001085786,0.0001396317,0.0006422963],"genre_scores_gemma":[0.7178707,0.0000035391895,0.2804309,0.000082482286,0.001279897,0.0000030678937,0.000003977484,0.0000129307,0.0003124818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897,0.00006322183,0.00012974524,0.00038476166,0.00016282506,0.00028945727],"domain_scores_gemma":[0.9985106,0.000057422414,0.00010238527,0.0011945913,0.00005572364,0.00007924989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008671383,0.000117230826,0.0001521073,0.000083724,0.0006977117,0.00019870744,0.0011002497,0.000030068375,0.0000020986213],"category_scores_gemma":[0.000012234442,0.00007812516,0.000031654163,0.0009603534,0.00024736355,0.0002015738,0.00040150946,0.000100805686,0.000003064172],"study_design_candidate":"design_other","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.000022590983,0.0000243666,0.0015513031,0.0000068456898,0.00045360526,0.000017093644,0.004900503,0.00034857166,0.00003818607,0.07377509,0.000050898296,0.91881096],"study_design_scores_gemma":[0.0005176943,0.00040333046,0.00039181986,0.00007067137,0.0012735495,0.000099804296,0.00021622531,0.51319337,0.000054093005,0.032445837,0.45056874,0.00076488056],"about_ca_topic_score_codex":0.000063705214,"about_ca_topic_score_gemma":0.00019376625,"teacher_disagreement_score":0.91804606,"about_ca_system_score_codex":0.000028837894,"about_ca_system_score_gemma":0.000034794266,"threshold_uncertainty_score":0.5366305},"labels":[],"label_agreement":null},{"id":"W2783503111","doi":"10.1109/bigdata.2017.8258245","title":"Towards online graph processing with spark streaming","year":2017,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"SPARK (programming language); Computer science; Graph; Theoretical computer science; Programming language","score_opus":0.019432556392070508,"score_gpt":0.2617929591568703,"score_spread":0.24236040276479978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783503111","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.125569,0.000046160618,0.8544587,0.0008663343,0.00013084487,0.00006784707,0.0000016212497,0.00020530848,0.018654171],"genre_scores_gemma":[0.8443194,0.0000028407624,0.15505096,0.00012327729,0.00004843309,0.0000022569816,8.565507e-7,0.0000048734264,0.00044711167],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926883,0.000013795628,0.000085953565,0.00026239717,0.00016321681,0.00020582815],"domain_scores_gemma":[0.99912286,0.000009552708,0.00009016732,0.0006485499,0.00005653296,0.00007232757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014471539,0.0001033965,0.00010074346,0.00005501148,0.00055547385,0.00053139695,0.0010800515,0.000025342442,0.00000892913],"category_scores_gemma":[0.000014527919,0.00006884047,0.000030646992,0.00010331758,0.000098556666,0.0008794492,0.00017922811,0.00008490463,0.000005973226],"study_design_candidate":"design_other","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.000006656345,0.0001038945,0.002663426,0.000017380029,0.000014857545,0.00005132335,0.00039024264,0.00002634012,0.0001632328,0.11143746,0.00003602359,0.88508916],"study_design_scores_gemma":[0.0034007502,0.0010073755,0.33939448,0.0007023024,0.00005879902,0.00031644604,0.00097140257,0.21358569,0.026298625,0.40799445,0.004029454,0.0022402287],"about_ca_topic_score_codex":0.00003862185,"about_ca_topic_score_gemma":0.00003872413,"teacher_disagreement_score":0.8828489,"about_ca_system_score_codex":0.0000046883297,"about_ca_system_score_gemma":0.000047770754,"threshold_uncertainty_score":0.51242733},"labels":[],"label_agreement":null},{"id":"W2786851308","doi":"10.14778/3199517.3199520","title":"Distributed evaluation of subgraph queries using worst-case optimal low-memory dataflows","year":2018,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":19,"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":"Dataflow; Computer science; Computation; Memory footprint; Joins; Massively parallel; Graph; Parallel computing; Theoretical computer science; Distributed computing; Algorithm","score_opus":0.03065908720145722,"score_gpt":0.27186278200001407,"score_spread":0.24120369479855686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786851308","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.98613364,0.00008773525,0.012356245,0.000111252804,0.00039636865,0.00045277833,0.000035123343,0.000042837142,0.00038399763],"genre_scores_gemma":[0.98560834,0.000003871512,0.014248506,0.000026869846,0.00007127653,0.000019624753,0.0000024565963,0.000007867031,0.00001118666],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983817,0.000035348367,0.00036556873,0.0003188536,0.0006482508,0.000250301],"domain_scores_gemma":[0.998414,0.00003438453,0.00038440115,0.0003204366,0.00078540726,0.000061384664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015750446,0.00016035767,0.0001999588,0.00012113631,0.00022023726,0.000068327536,0.00092900306,0.000045620254,0.000020900527],"category_scores_gemma":[0.00014801974,0.00011771552,0.000118366515,0.0007308742,0.00033408141,0.00062423415,0.0005400721,0.000092781665,0.0000021552642],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00046898215,0.0020768119,0.006718559,0.00089523976,0.00079708116,0.000026470825,0.02174058,0.0044213226,0.6214676,0.2684966,0.0018572331,0.07103355],"study_design_scores_gemma":[0.0010403418,0.00021481366,0.0007748189,0.00023167336,0.0001559275,0.00021844373,0.0010272999,0.20445865,0.77310735,0.018426128,0.00007391285,0.00027063125],"about_ca_topic_score_codex":0.00004552956,"about_ca_topic_score_gemma":0.0000027716414,"teacher_disagreement_score":0.25007048,"about_ca_system_score_codex":0.00005499443,"about_ca_system_score_gemma":0.00006536766,"threshold_uncertainty_score":0.48002994},"labels":[],"label_agreement":null},{"id":"W2793122650","doi":"10.1109/infocom.2018.8486361","title":"A Hierarchical Synchronous Parallel Model for Wide-Area Graph Analytics","year":2018,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Correctness; Bulk synchronous parallel; Distributed computing; Graph; Graph database; Analytics; Power graph analysis; Data analysis; Parallel computing; Theoretical computer science; Data mining; Parallel algorithm; Algorithm","score_opus":0.026276396186488256,"score_gpt":0.25694451867874524,"score_spread":0.230668122492257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793122650","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.0033768408,0.000017583521,0.9921518,0.00081592996,0.00016131529,0.00017639974,0.0000047586664,0.00019948321,0.0030959195],"genre_scores_gemma":[0.60332257,0.0000034560103,0.39467913,0.00097561383,0.000042543972,0.000020175647,0.0000018677146,0.000006845555,0.00094782474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988593,0.000027143738,0.00019054022,0.00038821143,0.00015884168,0.00037599215],"domain_scores_gemma":[0.99899477,0.00016215212,0.000040288527,0.0005412164,0.00011296239,0.00014862102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028311997,0.00014089761,0.00016057557,0.0001247508,0.00022087316,0.00010718864,0.0008246559,0.00006499186,0.000020742084],"category_scores_gemma":[0.000041229614,0.00011278566,0.00014598163,0.0003234077,0.00019191255,0.00025839874,0.00015502544,0.00008997976,0.000033602475],"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.000020311725,0.00009571777,0.00008266094,0.0000072690164,0.000034730063,0.0000037145678,0.0005150265,0.0031684553,0.000043617238,0.9843381,0.0027471504,0.00894322],"study_design_scores_gemma":[0.00020035652,0.00012380621,0.00004034904,0.0000033902859,0.0000051544503,0.0000046466653,0.000005400322,0.6049813,0.000090536756,0.39419997,0.00023638045,0.00010870206],"about_ca_topic_score_codex":0.0000033716797,"about_ca_topic_score_gemma":0.00001227297,"teacher_disagreement_score":0.60181284,"about_ca_system_score_codex":0.000011836096,"about_ca_system_score_gemma":0.00006404771,"threshold_uncertainty_score":0.45992658},"labels":[],"label_agreement":null},{"id":"W2802495635","doi":"10.18559/soep.2017.12.1","title":"Benchmarking of Databases for Big Data Exploration in the Social Graph Analysis","year":2017,"lang":"en","type":"article","venue":"Studia Oeconomica Posnaniensia","topic":"Graph Theory 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":"Bausch Health (Canada)","funders":"","keywords":"Benchmarking; Computer science; Big data; Graph database; Database; Data science; Graph; World Wide Web; Information retrieval; Data mining; Theoretical computer science; Business","score_opus":0.1643903670792844,"score_gpt":0.3430815658101746,"score_spread":0.17869119873089023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802495635","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.64344096,0.00014625848,0.34788135,0.0033804185,0.0019123678,0.0008644472,0.00065932126,0.000045388777,0.0016694805],"genre_scores_gemma":[0.99424076,0.000021466967,0.0052650683,0.000085850406,0.00025319375,0.00002516533,0.00010062075,0.0000045634392,0.0000033202618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99885553,0.000095954165,0.00030134452,0.0004525736,0.00008512415,0.00020949644],"domain_scores_gemma":[0.9976005,0.00023764918,0.00034249626,0.0017557475,0.00004221318,0.000021369891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012881487,0.00011393065,0.00027839138,0.00019787253,0.00065752113,0.0001828121,0.0025084058,0.000025731695,0.0000018633251],"category_scores_gemma":[0.00008307827,0.00009157374,0.000120956625,0.00023040514,0.00013505814,0.0010873236,0.00064274314,0.000072170595,0.0000021494495],"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.000077928875,0.00044036796,0.03315739,0.000047811955,0.0013191582,0.000012627134,0.016150458,0.00029261585,0.00037570036,0.81875914,0.003649615,0.12571721],"study_design_scores_gemma":[0.0032101958,0.00031031173,0.8103635,0.000045361317,0.0009910539,0.0000055055802,0.004991691,0.077677295,0.0009014248,0.08797607,0.012344147,0.0011834727],"about_ca_topic_score_codex":0.000088794106,"about_ca_topic_score_gemma":0.00079829054,"teacher_disagreement_score":0.77720606,"about_ca_system_score_codex":0.000010115534,"about_ca_system_score_gemma":0.000050405633,"threshold_uncertainty_score":0.50571877},"labels":[],"label_agreement":null},{"id":"W2808727532","doi":"","title":"Pre-processing Road Networks for Graph Partitioning Using Edge-Betweenness Centrality","year":2017,"lang":"en","type":"dissertation","venue":"Utrecht University Repository (Utrecht University)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Betweenness centrality; Centrality; Computer science; Enhanced Data Rates for GSM Evolution; Graph; Theoretical computer science; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.017512839363141717,"score_gpt":0.2296191157800906,"score_spread":0.21210627641694887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808727532","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.15210481,0.00071743294,0.75102335,0.00009204095,0.008570427,0.0017055478,0.00011565811,0.001296805,0.08437392],"genre_scores_gemma":[0.72534645,0.00028852708,0.016432773,0.000040970746,0.0010332878,0.0000025979843,0.00085988786,0.00013455407,0.25586095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963554,0.0004168187,0.00037897847,0.001490286,0.00043779204,0.0009206876],"domain_scores_gemma":[0.9963575,0.00016571408,0.0011735914,0.0013256433,0.00056826405,0.00040930786],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0004640747,0.0006812076,0.0007818385,0.0009069821,0.004327672,0.00049708516,0.0030995077,0.0009222645,0.000014358473],"category_scores_gemma":[0.000032049178,0.00089094514,0.00069932506,0.0009875823,0.0002718835,0.0022812341,0.00029012447,0.0008084938,0.0000030978272],"study_design_candidate":"design_other","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.004796768,0.0025683136,0.0116113275,0.0039123567,0.004648083,0.007876452,0.017301891,0.01869024,0.0039207,0.19638439,0.003079322,0.7252102],"study_design_scores_gemma":[0.026793664,0.0019836526,0.048058614,0.015933909,0.0132369725,0.0007339399,0.039348792,0.46728182,0.043816317,0.025981119,0.29398277,0.022848416],"about_ca_topic_score_codex":0.0004890281,"about_ca_topic_score_gemma":0.00015344695,"teacher_disagreement_score":0.7345906,"about_ca_system_score_codex":0.0006340435,"about_ca_system_score_gemma":0.0006592561,"threshold_uncertainty_score":0.9993541},"labels":[],"label_agreement":null},{"id":"W2809683060","doi":"10.14778/3231751.3231764","title":"Experimental analysis of distributed graph systems","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"PageRank; Computer science; Scalability; Heuristics; Graph; Usability; SPARK (programming language); Distributed computing; Power graph analysis; Theoretical computer science; Database; Human–computer interaction; Operating system","score_opus":0.014885829664977758,"score_gpt":0.24282909842498754,"score_spread":0.22794326876000978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809683060","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.9565686,0.0017117566,0.034013223,0.00023904386,0.0029190998,0.0014662282,0.00040287236,0.00019145805,0.002487735],"genre_scores_gemma":[0.99772805,0.00001914695,0.0019949204,0.000016594833,0.000060039303,0.0001058357,0.000013055375,0.000010951805,0.000051415107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99767405,0.000027621209,0.0006973741,0.00061063736,0.0006958036,0.00029450498],"domain_scores_gemma":[0.99774426,0.000039373488,0.0011014165,0.0006117761,0.0004182372,0.000084918094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006656767,0.00031629286,0.0007323844,0.0004651828,0.00010859247,0.00013845837,0.00307182,0.00014743416,0.000010440048],"category_scores_gemma":[0.00003487631,0.00022270196,0.0007460807,0.0015334983,0.00025331418,0.00015331325,0.0029665425,0.00024017291,0.0000017280812],"study_design_candidate":"bench_or_experimental","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.0001464017,0.0025333976,0.013433425,0.001937929,0.017008852,0.0000033723368,0.011383017,0.007049278,0.15051423,0.79046935,0.004559375,0.00096140837],"study_design_scores_gemma":[0.00066342345,0.00029703983,0.004588625,0.00073431944,0.0017676094,0.000008480704,0.0010800234,0.05232437,0.9011002,0.036410734,0.00027485474,0.0007502815],"about_ca_topic_score_codex":0.000089875226,"about_ca_topic_score_gemma":3.820164e-7,"teacher_disagreement_score":0.7540586,"about_ca_system_score_codex":0.00008163501,"about_ca_system_score_gemma":0.00004052169,"threshold_uncertainty_score":0.9081522},"labels":[],"label_agreement":null},{"id":"W2885457307","doi":"10.1007/978-3-319-98812-2_28","title":"Sprouter: Dynamic Graph Processing over Data Streams at Scale","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Scalability; Graph; Online transaction processing; Data stream mining; Graph database; Analytics; Search engine indexing; Distributed computing; Theoretical computer science; Big data; Dynamic data; Data mining; Transaction processing; Database; Information retrieval; Database transaction","score_opus":0.015271571799185467,"score_gpt":0.2542480205316143,"score_spread":0.23897644873242885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885457307","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.0009584557,0.0008806548,0.9936116,0.00021494989,0.0019700646,0.00036517347,0.00004645991,0.0002747443,0.0016779508],"genre_scores_gemma":[0.15606207,0.00012172646,0.8384437,0.0019436104,0.0011283506,0.000014061997,0.00011616134,0.00012678132,0.0020435653],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99422383,0.00005045912,0.0005838935,0.0029822737,0.0012029042,0.00095664005],"domain_scores_gemma":[0.9953562,0.00021293627,0.00040061807,0.003561008,0.0002129156,0.00025630067],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012288386,0.00073125935,0.0006011011,0.0008754991,0.0006340424,0.0009427643,0.009211449,0.00037481062,0.00009588838],"category_scores_gemma":[0.000035441393,0.00064073736,0.00014099943,0.0009676128,0.001802138,0.0016644823,0.007035418,0.000743476,0.00011205362],"study_design_candidate":"design_other","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.00000878873,0.00004173576,0.00010462003,0.000061076986,0.000013680072,0.000085981,0.0007938034,0.0004218,0.00014268453,0.0017546059,0.0000459155,0.9965253],"study_design_scores_gemma":[0.00029952353,0.00015903347,0.00016542802,0.00058080733,0.00001619474,0.00014485251,2.2669498e-7,0.69113207,0.0005398802,0.3039448,0.0020576308,0.0009595749],"about_ca_topic_score_codex":0.000012490877,"about_ca_topic_score_gemma":0.00024101032,"teacher_disagreement_score":0.9955657,"about_ca_system_score_codex":0.00025789702,"about_ca_system_score_gemma":0.00035303255,"threshold_uncertainty_score":0.9996044},"labels":[],"label_agreement":null},{"id":"W2886224427","doi":"10.1109/ipdpsw.2018.00082","title":"How Well do CPU, GPU and Hybrid Graph Processing Frameworks Perform?","year":2018,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scalability; Parallel computing; Graph; PageRank; Theoretical computer science; Programming paradigm; Operating system; Programming language","score_opus":0.006672889102751423,"score_gpt":0.2117468841138478,"score_spread":0.20507399501109635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886224427","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.13124341,0.00025004448,0.8579535,0.0011148631,0.00029417608,0.00008181854,5.0061306e-7,0.00019933625,0.008862363],"genre_scores_gemma":[0.94641423,0.000015122275,0.051881503,0.0006407004,0.0001644677,0.0000039730535,3.695614e-7,0.0000068523814,0.0008727609],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990521,0.000029509298,0.00009619515,0.00037525737,0.00016053335,0.00028638347],"domain_scores_gemma":[0.9993777,0.000034238397,0.00004594145,0.000343295,0.000085961496,0.00011284212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025263452,0.00013434088,0.000113873335,0.00010131138,0.00033031238,0.00080425065,0.00048940117,0.00008172277,0.000049051538],"category_scores_gemma":[0.000011978772,0.00010229246,0.000039999362,0.00031979906,0.0002173383,0.0008629282,0.00018784509,0.00025188923,0.00003109555],"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.000009247343,0.00006280846,0.0015131158,0.000036111967,0.000017034974,0.000019586718,0.0011911043,0.0000015868407,0.00027145405,0.19268635,0.0012724348,0.80291915],"study_design_scores_gemma":[0.00072594866,0.00057362823,0.0030998283,0.00015749718,0.000018726729,0.0002506462,0.00052984094,0.19574915,0.021430483,0.7564052,0.020109324,0.0009497292],"about_ca_topic_score_codex":0.0000022144893,"about_ca_topic_score_gemma":0.0000012157639,"teacher_disagreement_score":0.8151708,"about_ca_system_score_codex":0.000004358548,"about_ca_system_score_gemma":0.000018343431,"threshold_uncertainty_score":0.77554077},"labels":[],"label_agreement":null},{"id":"W2889323670","doi":"10.2316/journal.206.2005.1.206-2771","title":"Matching Graphs with Fuzzy Attributes in Machine Vision","year":2005,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"Université Laval","funders":"","keywords":"Matching (statistics); Computer science; Fuzzy logic; Artificial intelligence; Computer vision; Machine learning; Pattern recognition (psychology); Mathematics; Statistics","score_opus":0.006879808686139658,"score_gpt":0.24700504443315444,"score_spread":0.24012523574701478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889323670","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.2843209,0.0001823643,0.71019626,0.0048846956,0.0002613573,0.00003223605,0.0000014259779,0.00001718494,0.000103584476],"genre_scores_gemma":[0.88393617,0.000052421063,0.115824215,0.00011646815,0.000056473913,3.0427665e-7,0.0000016668174,0.0000028623124,0.000009427704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992418,0.000033282653,0.00026637383,0.00008185372,0.00030014053,0.00007649766],"domain_scores_gemma":[0.99946845,0.000059157413,0.00021401349,0.000058327485,0.0001622154,0.000037849466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003704421,0.00006739831,0.00009530711,0.00028797507,0.000034384237,0.00015617203,0.00030281354,0.000023423325,0.0000026686937],"category_scores_gemma":[0.0000104793535,0.00005022947,0.000031266045,0.00013309711,0.00001877995,0.0009079658,0.000048977246,0.000114064955,0.0000016776845],"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.00006195036,0.00022544865,0.0045516766,0.00000918705,0.000076133816,0.00009981945,0.0014644758,0.27857113,0.0012140011,0.48183975,0.000040907264,0.23184553],"study_design_scores_gemma":[0.0019137274,0.0003244424,0.06632429,0.0003675771,0.000011991124,0.0008709699,0.00008014307,0.6573615,0.0009138298,0.27131763,0.0002917299,0.00022217295],"about_ca_topic_score_codex":0.0000043214886,"about_ca_topic_score_gemma":0.000010218514,"teacher_disagreement_score":0.5996153,"about_ca_system_score_codex":0.000027231408,"about_ca_system_score_gemma":0.000018991677,"threshold_uncertainty_score":0.20482984},"labels":[],"label_agreement":null},{"id":"W2895492593","doi":"10.1145/3237191","title":"Enumerating Trillion Subgraphs On Distributed Systems","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Knowledge Discovery from Data","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"Chongqing Research Program of Basic Research and Frontier Technology","keywords":"Enumeration; Computer science; Scalability; Theoretical computer science; Graph; Algorithm; Combinatorics; Mathematics; Database","score_opus":0.04566446021945211,"score_gpt":0.28904636755667584,"score_spread":0.24338190733722373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895492593","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.017828893,0.00027661942,0.97283804,0.000190587,0.0032855356,0.00024379957,0.004623828,0.00025867517,0.00045402208],"genre_scores_gemma":[0.99477166,0.000047079186,0.0033720993,0.000081624574,0.00035195856,0.000030686697,0.0010525424,0.000022456,0.00026991242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976575,0.00026649202,0.00037296058,0.0010337858,0.0002839442,0.0003853411],"domain_scores_gemma":[0.9947031,0.0006028771,0.00010947441,0.004350277,0.00009966771,0.0001345708],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041730353,0.00029926957,0.00028228312,0.00022963036,0.0006710373,0.0006479366,0.0036279818,0.000116821764,0.000039398477],"category_scores_gemma":[0.000082560975,0.000264526,0.00011429503,0.0009657373,0.00015003623,0.002271482,0.0001264033,0.00031853118,0.0005212574],"study_design_candidate":"design_other","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.00092153146,0.0076232622,0.0005006992,0.00017961426,0.0017410117,0.00012511271,0.0067781066,0.0031335116,0.008384954,0.1452656,0.018827645,0.806519],"study_design_scores_gemma":[0.008786706,0.004692369,0.0055746017,0.0024832857,0.00064244855,0.000094770854,0.0021226776,0.6988614,0.07799484,0.09197768,0.101272285,0.0054969494],"about_ca_topic_score_codex":0.000102552556,"about_ca_topic_score_gemma":0.00007370039,"teacher_disagreement_score":0.9769428,"about_ca_system_score_codex":0.000048944945,"about_ca_system_score_gemma":0.000078823,"threshold_uncertainty_score":0.9999807},"labels":[],"label_agreement":null},{"id":"W2898304968","doi":"10.1109/asonam.2018.8508642","title":"K-Truss Decomposition of Large Networks on a Single Consumer-Grade Machine","year":2018,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":11,"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 Victoria","funders":"","keywords":"Truss; Computer science; Asynchronous communication; Focus (optics); Computation; Theoretical computer science; Graph; Parallel computing; Algorithm; Engineering; Structural engineering; Computer network","score_opus":0.01127455158807124,"score_gpt":0.26313268187394645,"score_spread":0.2518581302858752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898304968","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.06261828,0.000063137624,0.9302547,0.00023714702,0.0004002401,0.00007600124,0.0000035944986,0.00011385413,0.006233054],"genre_scores_gemma":[0.9812502,0.000003067828,0.017931037,0.00063302723,0.00006301944,0.0000020200582,0.0000033723013,0.0000045255665,0.000109684726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992628,0.000070624934,0.00014677,0.00020152237,0.000116407544,0.00020184102],"domain_scores_gemma":[0.9994298,0.00007715066,0.000060803643,0.00033048395,0.00004500873,0.000056728615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002229943,0.0000882747,0.000111228874,0.00007302848,0.000105116895,0.00003394927,0.00035739408,0.000041767435,0.00007483521],"category_scores_gemma":[0.00000661324,0.000070689486,0.000053548076,0.00026573104,0.00007608792,0.00014224346,0.00009350281,0.00007101434,0.000043869015],"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.000030997944,0.0006552041,0.0006098923,0.000006780329,0.00003176653,0.0000077759205,0.00030205768,0.00009708669,0.0036315003,0.9651337,0.0008579001,0.028635327],"study_design_scores_gemma":[0.0014081076,0.0016568046,0.0030609132,0.00007927984,0.000015276044,0.000037324837,0.000025581974,0.8203102,0.11096983,0.057748266,0.004269771,0.00041868127],"about_ca_topic_score_codex":0.000009151231,"about_ca_topic_score_gemma":0.000013129544,"teacher_disagreement_score":0.918632,"about_ca_system_score_codex":0.000007601883,"about_ca_system_score_gemma":0.0000065255754,"threshold_uncertainty_score":0.28826335},"labels":[],"label_agreement":null},{"id":"W2898877291","doi":"","title":"Prometheus : Directly Learning Acyclic Directed Graph Structures for Sum-Product Networks","year":2018,"lang":"en","type":"article","venue":"Probabilistic Graphical Models","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Directed acyclic graph; Directed graph; Theoretical computer science; Graph; Product (mathematics); Graph theory; Artificial intelligence; Algorithm; Mathematics; Combinatorics","score_opus":0.022079408785830146,"score_gpt":0.25352163056128996,"score_spread":0.2314422217754598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898877291","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.05027007,0.0004007735,0.94487906,0.0004005648,0.0009103027,0.0011962308,0.000007981363,0.0012179568,0.00071707263],"genre_scores_gemma":[0.93262726,0.000023509505,0.06639113,0.00015716645,0.00037150466,0.00029485836,0.000013930232,0.00004021941,0.00008044043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963272,0.0004024032,0.00054613553,0.0013390839,0.0004201017,0.0009650512],"domain_scores_gemma":[0.99725664,0.00073926133,0.00020000251,0.00097567705,0.0005147148,0.0003137348],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011421342,0.00044780035,0.0005182233,0.00036027725,0.00075167266,0.0002890561,0.0014487936,0.00019965328,0.000012748242],"category_scores_gemma":[0.0008810455,0.00037002433,0.00033069574,0.0019389631,0.0006998782,0.00054475793,0.00030338095,0.0005585772,0.0000048303395],"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.00009038093,0.00015617219,0.0001877006,0.00006379781,0.00009673738,0.0000044647436,0.00048557928,0.013359045,0.00041866794,0.9476379,0.00014508874,0.03735442],"study_design_scores_gemma":[0.0002815855,0.00024268946,0.00043127776,0.00002225178,0.000025825551,0.000010416973,0.000004072274,0.4274815,0.00024937396,0.5707665,0.0001837243,0.00030079807],"about_ca_topic_score_codex":0.000017116032,"about_ca_topic_score_gemma":0.000012358168,"teacher_disagreement_score":0.8823572,"about_ca_system_score_codex":0.000026347027,"about_ca_system_score_gemma":0.000057049863,"threshold_uncertainty_score":0.9998752},"labels":[],"label_agreement":null},{"id":"W2900800851","doi":"","title":"Which Graph Layout Gives a Good Shape for Large Graphs?","year":2017,"lang":"en","type":"article","venue":"Graph Drawing E-print Archive (Die Universität zu Köln)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ciência sem Fronteiras; Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Austrian Science Fund; Grantová Agentura České Republiky; National Institutes of Health; National Science Foundation","keywords":"Computer science; Graph; Graph drawing; Combinatorics; Mathematics; Theoretical computer science","score_opus":0.015151042034084293,"score_gpt":0.23635854264501058,"score_spread":0.22120750061092628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900800851","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.13565172,0.00019438582,0.8384022,0.0016649712,0.001574785,0.0009912543,0.0002514767,0.00068778923,0.020581434],"genre_scores_gemma":[0.96020263,0.000098832774,0.038765326,0.00023027051,0.00011789313,0.000026442196,0.000037448644,0.000046592366,0.00047456045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963207,0.00021556023,0.00039056753,0.0013360634,0.00046880104,0.0012682556],"domain_scores_gemma":[0.99621135,0.00039524457,0.00044233308,0.0022424287,0.00026882713,0.00043981013],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00082271267,0.00057089626,0.00056202605,0.0010424455,0.003651496,0.00075235637,0.00459376,0.00016245234,0.000037244863],"category_scores_gemma":[0.00016562533,0.000589248,0.0008008219,0.0005500137,0.00040463416,0.003013546,0.0017502242,0.00053243944,0.00005762558],"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.00008780989,0.0002119563,0.0038560901,0.00006536034,0.00031640573,0.000109113185,0.0039760433,0.00006179851,0.001163403,0.983867,0.00026830693,0.006016736],"study_design_scores_gemma":[0.0038720213,0.0004601772,0.041949905,0.0002701287,0.0001658828,0.000042228858,0.0012232333,0.01959564,0.0014501428,0.9150897,0.014428944,0.0014520002],"about_ca_topic_score_codex":0.00006630081,"about_ca_topic_score_gemma":0.0002544631,"teacher_disagreement_score":0.8245509,"about_ca_system_score_codex":0.000037389047,"about_ca_system_score_gemma":0.0001156816,"threshold_uncertainty_score":0.9996559},"labels":[],"label_agreement":null},{"id":"W2903551170","doi":"10.5555/3291656.3291684","title":"PruneJuice: pruning trillion-edge graphs to a precise pattern-matching solution","year":2018,"lang":"en","type":"article","venue":"IEEE International Conference on High Performance Computing, Data, and Analytics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":15,"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 British Columbia","funders":"","keywords":"Scalability; Computer science; Pruning; Pipeline (software); Matching (statistics); Scaling; Enhanced Data Rates for GSM Evolution; Pattern matching; Analytics; Set (abstract data type); Focus (optics); Graph; Theoretical computer science; Data mining; Algorithm; Artificial intelligence; Mathematics; Database","score_opus":0.05831802717286136,"score_gpt":0.31804624701030904,"score_spread":0.25972821983744765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903551170","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.45006394,0.000008844511,0.5467289,0.0006810978,0.0015092267,0.00012417231,0.000053882584,0.00010832087,0.00072159077],"genre_scores_gemma":[0.9890086,0.000101739446,0.009506607,0.00061126694,0.00052578433,0.0000039723677,0.00007533524,0.000013829319,0.00015284761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977278,0.00006673767,0.0004478296,0.0008044383,0.00054006575,0.00041310675],"domain_scores_gemma":[0.9982398,0.00010098249,0.00023417607,0.00082486117,0.0004119268,0.0001882576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007036895,0.0002818113,0.000258552,0.00043960594,0.000489908,0.0005380134,0.0022541,0.00008170519,0.000032085456],"category_scores_gemma":[0.000043906453,0.00026404168,0.00004625765,0.00045366675,0.00015216388,0.0010195486,0.0007616042,0.00029809156,0.000103607235],"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.00017259251,0.00055741647,0.008314844,0.00013164019,0.0003558977,0.000043675795,0.0077457847,0.0041020545,0.0028300846,0.24819836,0.0040326444,0.72351503],"study_design_scores_gemma":[0.00042543694,0.00034744985,0.0042722016,0.000351332,0.000015421809,0.000023465363,0.00007417329,0.9852967,0.0010620451,0.006800067,0.00095930253,0.00037238636],"about_ca_topic_score_codex":0.00004673491,"about_ca_topic_score_gemma":0.000021972019,"teacher_disagreement_score":0.9811947,"about_ca_system_score_codex":0.00004438142,"about_ca_system_score_gemma":0.00008162529,"threshold_uncertainty_score":0.99998116},"labels":[],"label_agreement":null},{"id":"W2907067508","doi":"10.1145/3240302.3240417","title":"Data-driven spatial locality","year":2018,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Memory Systems","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":7,"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 British Columbia","funders":"","keywords":"Locality; Computer science; Locality of reference; Cache; Spatial analysis; Bandwidth (computing); Database; Parallel computing; Computer network; Geography","score_opus":0.023849402917759863,"score_gpt":0.25570668457155293,"score_spread":0.23185728165379307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907067508","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.74952567,0.000069266345,0.05135904,0.013972197,0.032640874,0.0014260971,0.00031216693,0.0005192941,0.15017538],"genre_scores_gemma":[0.9974354,0.0000022295328,0.0005740133,0.00023686998,0.00092323375,0.000011543805,0.0000033923677,0.000009043228,0.0008042984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822617,0.000021317612,0.0003586232,0.00045782005,0.000758829,0.00017723892],"domain_scores_gemma":[0.99850875,0.000057686808,0.00034503345,0.00051829545,0.00051037583,0.000059868322],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0008241957,0.00014246593,0.00016655741,0.00006665498,0.00014758167,0.0002248814,0.0056061456,0.000056484212,0.000011927672],"category_scores_gemma":[0.00009077307,0.000099392506,0.000075514385,0.00020800314,0.00017478561,0.0006120641,0.0011602353,0.0001352249,0.000059041045],"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.00021471245,0.0006099579,0.00792092,0.00022752314,0.00046806489,0.000004532166,0.0021207507,0.0008555846,0.14738916,0.80996305,0.023684386,0.0065413923],"study_design_scores_gemma":[0.0011242714,0.0004815926,0.0028577384,0.00064657314,0.00004020622,0.00014650892,0.00036891486,0.78241706,0.16790776,0.00984589,0.033529337,0.0006341696],"about_ca_topic_score_codex":0.000111802525,"about_ca_topic_score_gemma":0.000004636918,"teacher_disagreement_score":0.80011714,"about_ca_system_score_codex":0.000055317985,"about_ca_system_score_gemma":0.000028993984,"threshold_uncertainty_score":0.999774},"labels":[],"label_agreement":null},{"id":"W2912134958","doi":"","title":"Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking","year":2007,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Data science","score_opus":0.012382363623699004,"score_gpt":0.22110813430579462,"score_spread":0.2087257706820956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912134958","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.7681861,0.00006117318,0.05281861,0.0003093071,0.0024776221,0.00038393604,0.0000010556469,0.000089173736,0.17567304],"genre_scores_gemma":[0.9976415,0.000003978714,0.0021780438,0.000046820536,0.00007527596,7.4881723e-7,4.127558e-8,0.0000026383002,0.000050921622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932283,0.000009262839,0.00016262573,0.00015998883,0.00019459476,0.00015067018],"domain_scores_gemma":[0.99954975,0.00007521732,0.0001153458,0.00012453967,0.000098220655,0.000036947273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005180235,0.00007509651,0.0001190327,0.000047274694,0.000060578346,0.00002729301,0.00043120934,0.000037288446,0.0000027159856],"category_scores_gemma":[0.000012336137,0.00004896323,0.000034378965,0.00031882146,0.00011686747,0.0001147969,0.0001483876,0.00009468936,4.8424124e-7],"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.0000064999826,0.000030259893,0.00045089723,0.00000795023,0.000005312657,4.595865e-7,0.00027242576,7.204125e-7,0.0016387387,0.98811406,0.000017926739,0.009454727],"study_design_scores_gemma":[0.0007463721,0.0003498206,0.011597729,0.00013383428,0.0000076742435,0.000013246397,0.00017660626,0.010027459,0.12101142,0.85555845,0.00020979739,0.00016757991],"about_ca_topic_score_codex":0.000009074855,"about_ca_topic_score_gemma":0.0000012355341,"teacher_disagreement_score":0.22945544,"about_ca_system_score_codex":0.000005415678,"about_ca_system_score_gemma":0.000018269862,"threshold_uncertainty_score":0.19966626},"labels":[],"label_agreement":null},{"id":"W2912434402","doi":"","title":"Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures","year":2012,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; IBM; Parallelism (grammar); Publication; Algorithm; Architecture; Library science; Parallel computing; History","score_opus":0.009312813988209413,"score_gpt":0.22626010463260615,"score_spread":0.21694729064439675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912434402","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.9910586,0.00007810558,0.0018899781,0.0021327836,0.00029123074,0.00020428578,0.0000035253652,0.000049630875,0.004291853],"genre_scores_gemma":[0.98364526,0.000006796552,0.015575318,0.00039358923,0.00006674589,0.000008615897,1.2219272e-7,0.0000048869456,0.00029865472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99914855,0.000027140812,0.00014808073,0.00019805286,0.00019881644,0.0002793578],"domain_scores_gemma":[0.9995018,0.000079474696,0.000060500905,0.00025222683,0.000031876476,0.00007411371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038505075,0.00011612421,0.00012262927,0.00010076219,0.00006361295,0.000035532874,0.000818595,0.00004418382,0.000004254849],"category_scores_gemma":[0.000036500358,0.000068317924,0.000044767952,0.00028863535,0.00009223875,0.00022089138,0.0004193071,0.00016037884,0.0000026793953],"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.00003417338,0.0004501494,0.043843392,0.000054052383,0.000032949,0.0000021130907,0.02725787,0.00017721947,0.0028467104,0.8758203,0.0007794329,0.04870167],"study_design_scores_gemma":[0.0025222562,0.00076867494,0.5950524,0.00026781287,0.000026492791,0.00017769009,0.002220438,0.015078313,0.06984972,0.3067646,0.006119107,0.001152429],"about_ca_topic_score_codex":0.000012519455,"about_ca_topic_score_gemma":0.000001868123,"teacher_disagreement_score":0.5690557,"about_ca_system_score_codex":0.000006473912,"about_ca_system_score_gemma":0.000008561049,"threshold_uncertainty_score":0.2785924},"labels":[],"label_agreement":null},{"id":"W2912876363","doi":"","title":"Proceedings of the 7th International Conference on Cyber-Physical Systems","year":2016,"lang":"en","type":"article","venue":"International Conference on Cyber-Physical Systems","topic":"Graph Theory 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":"University of British Columbia","funders":"","keywords":"Cyber-physical system; Computer science; Focus (optics); Wireless sensor network; Computer security; Telecommunications; Computer network; Operating system","score_opus":0.033429520821626243,"score_gpt":0.2760977907951357,"score_spread":0.24266826997350943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912876363","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.7552321,0.000016520635,0.0132239815,0.009452611,0.011889362,0.0012920595,0.0003605101,0.00039991643,0.20813294],"genre_scores_gemma":[0.9946752,0.000010974783,0.00005559034,0.00011365648,0.0011470858,0.0001518712,0.000006115115,0.000027167443,0.0038123257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958301,0.0001511834,0.0006476371,0.00095804,0.0019283437,0.00048466257],"domain_scores_gemma":[0.9969121,0.00036652724,0.0006494751,0.0006229608,0.0012385556,0.00021033097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004171434,0.00047942478,0.00057735376,0.00022018097,0.00016965084,0.00060186844,0.0039976537,0.00013787628,0.00004458796],"category_scores_gemma":[0.00014637806,0.0002817536,0.00035157215,0.00037619166,0.00036704817,0.00081689324,0.0005308313,0.00041747713,0.00034474875],"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.000058496025,0.00047380227,0.00029209675,0.0000205578,0.00014614958,0.0000055662094,0.0005287246,0.00006401626,0.023803135,0.9706915,0.0004818286,0.0034341153],"study_design_scores_gemma":[0.0052958457,0.002244147,0.009480857,0.007641663,0.000104812476,0.00018922925,0.0017275235,0.6648989,0.03918723,0.2522428,0.014149754,0.0028372828],"about_ca_topic_score_codex":0.00010565907,"about_ca_topic_score_gemma":0.000002736442,"teacher_disagreement_score":0.7184487,"about_ca_system_score_codex":0.00021926538,"about_ca_system_score_gemma":0.00014281484,"threshold_uncertainty_score":0.99996346},"labels":[],"label_agreement":null},{"id":"W2913140248","doi":"10.1016/j.patcog.2019.01.040","title":"New graph distance for deformable 3D objects recognition based on triangle-stars decomposition","year":2019,"lang":"en","type":"article","venue":"Pattern Recognition","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Triangle inequality; Mathematics; Disjoint sets; Artificial intelligence; Computer science; Pattern recognition (psychology); Graph; Algorithm; Combinatorics","score_opus":0.018521125837398546,"score_gpt":0.2398191553934628,"score_spread":0.22129802955606426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913140248","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.06880527,0.000020201373,0.92714036,0.00023195382,0.0011220175,0.00089822616,0.00013678397,0.00023012374,0.0014150866],"genre_scores_gemma":[0.93413293,0.000012409093,0.062434692,0.0018681918,0.00023552543,0.0001817417,0.0009671523,0.00003471942,0.00013263068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826866,0.00013295258,0.0003345604,0.0005745771,0.00027958522,0.00040965193],"domain_scores_gemma":[0.99882007,0.0002850822,0.00021719471,0.0003932787,0.00014277492,0.00014163264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046587456,0.00024580295,0.00024332081,0.00030389882,0.00018166864,0.00018853018,0.00032735296,0.00011291676,0.00016603491],"category_scores_gemma":[0.000029318699,0.00024578717,0.00021410808,0.00039628329,0.000016266858,0.00088565936,0.000028698547,0.00015770429,0.000686738],"study_design_candidate":"design_other","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.00022267089,0.00014646756,0.00025681208,0.00009792565,0.000021121385,0.000004719979,0.00017931931,0.0002787739,0.0008161911,0.000121397425,0.0003069311,0.9975477],"study_design_scores_gemma":[0.01240522,0.0030039754,0.0025762366,0.0014697118,0.0001138345,0.00003839559,0.0001202253,0.7046923,0.063782215,0.20850942,0.0014613231,0.0018271232],"about_ca_topic_score_codex":0.000021486952,"about_ca_topic_score_gemma":0.000020513511,"teacher_disagreement_score":0.99572057,"about_ca_system_score_codex":0.00006865941,"about_ca_system_score_gemma":0.000052943386,"threshold_uncertainty_score":0.99999946},"labels":[],"label_agreement":null},{"id":"W2919447473","doi":"10.1007/978-3-319-77525-8_215","title":"Graph Query Processing","year":2019,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Big Data Technologies","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Graph; Query optimization; Information retrieval; Theoretical computer science","score_opus":0.046518425755431435,"score_gpt":0.2419583743716511,"score_spread":0.19543994861621966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919447473","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027953325,0.012295416,0.11474111,0.00063387334,0.0021514436,0.0005283283,0.0005144508,0.002909481,0.86619794],"genre_scores_gemma":[0.01584239,0.07543006,0.2548563,0.00028842626,0.0009436135,0.000067724606,0.0015428871,0.00037242632,0.65065616],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976062,0.0000145596705,0.00051180425,0.0010802378,0.00043503632,0.00035212672],"domain_scores_gemma":[0.99458253,0.00012455875,0.0005520635,0.004607066,0.000101480226,0.00003226835],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0003767146,0.00044579126,0.00059857225,0.0007139313,0.00009518738,0.0000855304,0.007968135,0.0006669745,0.0000095995065],"category_scores_gemma":[0.0001435309,0.00039071622,0.000117020165,0.00024768486,0.0005011626,0.00079536415,0.0047053616,0.000694022,0.00010008139],"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.000001974341,0.000013579079,0.00001415537,0.00011368362,0.000028948507,0.000021008802,0.00003235494,6.882365e-7,0.000006918388,0.30970597,0.002613585,0.68744713],"study_design_scores_gemma":[0.00012668304,0.00008515582,0.000011527022,0.000440526,0.000035645695,0.000019413006,0.00005720208,0.00019920754,0.00017835664,0.5348843,0.46340176,0.0005602246],"about_ca_topic_score_codex":0.000004501647,"about_ca_topic_score_gemma":0.0000048998772,"teacher_disagreement_score":0.6868869,"about_ca_system_score_codex":0.000016871514,"about_ca_system_score_gemma":0.00026344229,"threshold_uncertainty_score":0.99985445},"labels":[],"label_agreement":null},{"id":"W2920477488","doi":"","title":"Reciprocal Product Degree Distance of Tensor Product of Graphs.","year":2018,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Reciprocal; Tensor product; Product (mathematics); Degree (music); Combinatorics; Pure mathematics; Geometry; Physics; Linguistics","score_opus":0.0181237300429473,"score_gpt":0.23851606653457288,"score_spread":0.2203923364916256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920477488","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.9884588,0.0004498839,0.0045412066,0.00029656925,0.0032916337,0.00037512,0.000006856612,0.00011892388,0.002460988],"genre_scores_gemma":[0.99139905,0.00000959849,0.008369834,0.00002283166,0.00002236179,0.000011814493,0.0000011716139,0.000011191131,0.00015212271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838525,0.000101736536,0.00037394403,0.00050908927,0.00034070504,0.00028927362],"domain_scores_gemma":[0.9980464,0.000059215585,0.00023886838,0.0011245387,0.00045556668,0.00007544126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000589455,0.00016574416,0.00030010377,0.00012519486,0.00009789399,0.000020931906,0.0011079493,0.000038629394,0.000009251986],"category_scores_gemma":[0.00018557908,0.0001436773,0.000099855126,0.0010501241,0.00047002902,0.00033228428,0.00019288837,0.00012519705,0.00001525511],"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.000030452085,0.00023309316,0.0036649893,0.00004557062,0.00002756347,0.0000034359882,0.00046704643,6.598248e-7,0.0037639788,0.97043765,0.00054279465,0.020782763],"study_design_scores_gemma":[0.00047277712,0.00052542315,0.01122091,0.000063282285,0.000010881575,0.000009430389,0.000016276554,0.00023242147,0.18152164,0.8047258,0.0009997478,0.00020140928],"about_ca_topic_score_codex":0.000010870573,"about_ca_topic_score_gemma":0.0000021445012,"teacher_disagreement_score":0.17775765,"about_ca_system_score_codex":0.0000123405525,"about_ca_system_score_gemma":0.00006543903,"threshold_uncertainty_score":0.58589906},"labels":[],"label_agreement":null},{"id":"W2921280920","doi":"10.1016/j.dam.2019.02.026","title":"Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.006231262015789569,"score_gpt":0.2145865321000022,"score_spread":0.20835527008421262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921280920","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.02712856,0.00002108421,0.9178327,0.00029848213,0.00045756088,0.0005769201,0.000013255843,0.00020506968,0.05346639],"genre_scores_gemma":[0.49366555,0.000066871246,0.50388205,0.00038350673,0.000036601326,0.00006609131,0.000027132794,0.000031966913,0.001840241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903166,0.000011134499,0.0002015583,0.0003006025,0.00028028173,0.00017478067],"domain_scores_gemma":[0.99928635,0.00008735582,0.00011878991,0.00040801297,0.000034189132,0.00006530148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002078707,0.00015209816,0.00015783371,0.00010884035,0.00007275754,0.00015183807,0.0004979329,0.000056399324,0.000052470536],"category_scores_gemma":[0.000010680937,0.00012234034,0.000043363274,0.00017699401,0.00004493817,0.00019693407,0.00018116682,0.000092017275,0.0001280271],"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.00000864987,0.000070437905,0.000023556682,0.00003612918,0.000030072919,0.0000010155522,0.0006728509,0.004069785,0.00091831526,0.9926239,0.00024836048,0.0012968826],"study_design_scores_gemma":[0.0011905774,0.0001343365,0.0001148855,0.000119316144,0.00002064909,0.000012699405,0.00050417386,0.63046426,0.0035052642,0.36270478,0.00074029417,0.00048874685],"about_ca_topic_score_codex":3.82591e-7,"about_ca_topic_score_gemma":9.499768e-8,"teacher_disagreement_score":0.6299192,"about_ca_system_score_codex":0.0000134491065,"about_ca_system_score_gemma":0.000015066055,"threshold_uncertainty_score":0.49888942},"labels":[],"label_agreement":null},{"id":"W2925810066","doi":"10.14778/3342263.3342643","title":"Optimizing subgraph queries by combining binary and worst-case optimal joins","year":2019,"lang":"en","type":"preprint","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Joins; Computer science; Intersection (aeronautics); Binary number; Partition (number theory); Query plan; Vertex (graph theory); Query optimization; Matching (statistics); Theoretical computer science; Graph; Mathematics; Data mining; Sargable; Combinatorics; Search engine; Information retrieval","score_opus":0.011492111412630185,"score_gpt":0.21651894232646995,"score_spread":0.20502683091383977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2925810066","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.9834711,0.0024016553,0.006830541,0.0016375632,0.001575357,0.0013188454,0.000051765543,0.00025221618,0.0024609605],"genre_scores_gemma":[0.96212727,0.00028545846,0.03700558,0.00015636603,0.00004461871,0.000095072646,0.0000033816823,0.000031872933,0.00025035528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99767417,0.000031166834,0.0005163832,0.00085356936,0.0004496153,0.00047511488],"domain_scores_gemma":[0.9984549,0.000093012204,0.0006557339,0.00047966352,0.00018041012,0.00013623605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007779043,0.00047391368,0.0005642964,0.00023248629,0.00032325578,0.0004354776,0.0017136894,0.00020201359,0.000006743285],"category_scores_gemma":[0.000045624267,0.00036551637,0.000270276,0.00035520433,0.00028160785,0.00047737136,0.0051540188,0.00073219475,0.0000026613923],"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.00038933603,0.0019980457,0.011430016,0.0064245,0.0021495826,0.00026550944,0.06972934,0.010456414,0.056378324,0.8012309,0.021862507,0.017685492],"study_design_scores_gemma":[0.008116392,0.0027119482,0.0015898729,0.009220527,0.0009893159,0.004677493,0.01501081,0.33752123,0.36821243,0.2376984,0.007119782,0.007131791],"about_ca_topic_score_codex":0.000055634035,"about_ca_topic_score_gemma":5.2952413e-7,"teacher_disagreement_score":0.56353253,"about_ca_system_score_codex":0.00005459553,"about_ca_system_score_gemma":0.000057932753,"threshold_uncertainty_score":0.99987966},"labels":[],"label_agreement":null},{"id":"W2928052000","doi":"10.1145/3302424.3303974","title":"GraphBolt","year":2019,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Leverage (statistics); Computation; Graph; Graph algorithms; Snapshot (computer storage); Reuse; Theoretical computer science; Parallel computing; Algorithm; Artificial intelligence","score_opus":0.002605424059160833,"score_gpt":0.17352721722678885,"score_spread":0.170921793167628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2928052000","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.10465051,0.000027543443,0.6871631,0.00039695777,0.00064663315,0.000067630106,1.5191769e-7,0.0002727586,0.20677467],"genre_scores_gemma":[0.97449875,0.0000010497987,0.020197133,0.0005364616,0.000009694736,0.0000010179715,1.2567392e-7,0.0000014006299,0.0047543906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996832,0.000011387885,0.00003865801,0.00011559396,0.000061897175,0.000089235444],"domain_scores_gemma":[0.99966824,0.000017010576,0.000008106346,0.00026991768,0.0000101750875,0.0000265419],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008450477,0.000032381497,0.000035824873,0.000036042475,0.000018576273,0.000034497923,0.00036320335,0.000012002865,0.00017822061],"category_scores_gemma":[0.0000013946626,0.000024461177,0.000029831941,0.00017515343,0.0000071307436,0.0001992948,0.00006124838,0.000028831653,0.001273119],"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":[2.0110654e-7,0.0000063228,0.00081356487,7.2485244e-7,0.0000016112417,9.1621354e-7,0.0000388986,0.0000030730773,0.00035577014,0.9884955,0.00019104268,0.0100923255],"study_design_scores_gemma":[0.00043068719,0.00011939564,0.011296728,0.000006588324,0.0000013790942,0.000020991749,0.000042917633,0.03189325,0.011843621,0.91718405,0.026858555,0.00030185853],"about_ca_topic_score_codex":0.0000015157318,"about_ca_topic_score_gemma":1.745059e-7,"teacher_disagreement_score":0.8698482,"about_ca_system_score_codex":0.000001177216,"about_ca_system_score_gemma":0.0000044338162,"threshold_uncertainty_score":0.9995045},"labels":[],"label_agreement":null},{"id":"W2929334204","doi":"10.5441/002/edbt.2019.96","title":"Fast Truss Decomposition in Large-scale Probabilistic Graphs","year":2019,"lang":"en","type":"article","venue":"Movebank","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Truss; Probabilistic logic; Decomposition; Computer science; Scale (ratio); Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence; Structural engineering; Engineering; Physics","score_opus":0.004594679837001494,"score_gpt":0.2224177167571918,"score_spread":0.2178230369201903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2929334204","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.9219849,0.000046431505,0.07133555,0.00015779633,0.00051068206,0.0002586607,0.0000059020404,0.00011860975,0.005581449],"genre_scores_gemma":[0.99307007,0.0000021160151,0.006285266,0.00025833922,0.000017318009,0.000018316703,0.0000058406813,0.0000070995443,0.00033562674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989269,0.000080696176,0.0001809765,0.00035537872,0.00015773402,0.0002983635],"domain_scores_gemma":[0.9993746,0.000054325967,0.000044851888,0.00044298332,0.000027390472,0.000055848413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003424624,0.00011277762,0.00013983548,0.00014474899,0.000052911702,0.00008821526,0.00050202064,0.00005547587,0.00005413386],"category_scores_gemma":[0.0000080445225,0.000104829196,0.00007135017,0.0004797737,0.00002507447,0.00039338542,0.00011566455,0.00013292341,0.0002300095],"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.000031253923,0.0005317595,0.066428125,0.000066663706,0.000015067031,0.000038718666,0.0024932555,0.0028886087,0.002870175,0.90709555,0.00011561638,0.017425233],"study_design_scores_gemma":[0.0015170233,0.00018456251,0.21164691,0.000071148184,0.0000043054065,0.000022118922,0.000068040055,0.16198967,0.0017150386,0.62182343,0.00051262946,0.00044514268],"about_ca_topic_score_codex":0.0000069642356,"about_ca_topic_score_gemma":0.000015237097,"teacher_disagreement_score":0.28527212,"about_ca_system_score_codex":0.00002529755,"about_ca_system_score_gemma":0.00001592501,"threshold_uncertainty_score":0.42748106},"labels":[],"label_agreement":null},{"id":"W2942074353","doi":"10.1016/j.dam.2019.03.006","title":"Querying relational event graphs using colored range searching data structures","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Timestamp; Colored; Graph; Relational database; Theoretical computer science; Computer science; Mathematics; Event (particle physics); Range (aeronautics); Data mining","score_opus":0.046040916136761874,"score_gpt":0.2903002288330911,"score_spread":0.24425931269632922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942074353","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.23109247,0.000040225455,0.76530737,0.000045869343,0.00017306053,0.00041057053,0.000026232128,0.00011719745,0.0027869889],"genre_scores_gemma":[0.61094075,0.0000024385422,0.38888466,0.00005606111,0.000027068047,0.0000061368305,0.000037364218,0.000016260514,0.000029225179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983818,0.000039362247,0.00032917506,0.0004580666,0.00047190042,0.0003197143],"domain_scores_gemma":[0.9981846,0.00024444293,0.00017944703,0.0012767994,0.00003060936,0.00008409737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007234329,0.00018972132,0.00024356763,0.00012830815,0.00021484813,0.00016221272,0.0013754566,0.0000687102,0.00004466984],"category_scores_gemma":[0.000027981307,0.00016279184,0.00006570975,0.0003335513,0.000058842463,0.0004628628,0.00083005294,0.00022736841,0.000045378623],"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.000005293944,0.0000238695,0.000105834726,0.000083217514,0.00003798669,0.000002740424,0.001442469,0.0015216942,0.004129508,0.9916352,0.0000258379,0.0009863254],"study_design_scores_gemma":[0.00032694018,0.00001161336,0.0002853468,0.0000439473,0.000016607022,0.000015319929,0.0003061023,0.42956817,0.00048682364,0.56863475,0.00007982049,0.00022451801],"about_ca_topic_score_codex":0.0000040045143,"about_ca_topic_score_gemma":8.4395253e-7,"teacher_disagreement_score":0.4280465,"about_ca_system_score_codex":0.000023845067,"about_ca_system_score_gemma":0.00005218305,"threshold_uncertainty_score":0.66384584},"labels":[],"label_agreement":null},{"id":"W2947498855","doi":"","title":"On the Tree Structure of Deep Convolutional Sum-Product Networks.","year":2019,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Tree (set theory); Product (mathematics); Convolutional neural network; Artificial intelligence; Mathematics; Combinatorics","score_opus":0.02337795284357017,"score_gpt":0.28873364691820014,"score_spread":0.26535569407462994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947498855","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.8997352,0.0011284999,0.06901675,0.023347484,0.0024365531,0.0014584097,0.00003175756,0.00013724707,0.0027080781],"genre_scores_gemma":[0.9978274,0.000038281672,0.00049218506,0.00067151565,0.00039998366,0.000010580982,0.0000037776763,0.000009172911,0.00054711173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972371,0.0006041002,0.00017415009,0.00038040234,0.0010540795,0.0005501564],"domain_scores_gemma":[0.99674,0.0015178496,0.000057974863,0.0012959075,0.00031977138,0.00006852435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030358396,0.0001362758,0.00015649821,0.00003371918,0.00056131475,0.00011743434,0.0023677237,0.000068805515,0.00016968854],"category_scores_gemma":[0.00012466889,0.00006962656,0.00022381177,0.001016821,0.00061243854,0.00019433047,0.00055367296,0.0010482335,0.00006925814],"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.00003143186,0.000036071993,0.00030800691,0.000016992892,0.000095562384,0.00000103536,0.0019658112,0.004936792,0.0024217989,0.9599974,0.026747894,0.0034411643],"study_design_scores_gemma":[0.0006054756,0.00028884964,0.008431429,0.000041514817,0.000008165744,0.000011356664,0.0006798996,0.5004197,0.007072947,0.47919747,0.0029767614,0.0002664734],"about_ca_topic_score_codex":0.000017206628,"about_ca_topic_score_gemma":0.0000045008164,"teacher_disagreement_score":0.49548286,"about_ca_system_score_codex":0.000049166556,"about_ca_system_score_gemma":0.0001087525,"threshold_uncertainty_score":0.45541108},"labels":[],"label_agreement":null},{"id":"W2948167003","doi":"10.1109/icde48307.2020.00112","title":"GSI: GPU-friendly Subgraph Isomorphism","year":2020,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":59,"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":"Subgraph isomorphism problem; Induced subgraph isomorphism problem; Bottleneck; Graph isomorphism; Scalability; Scaling; Isomorphism (crystallography)","score_opus":0.014162921857982312,"score_gpt":0.20464283468456304,"score_spread":0.19047991282658072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948167003","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.006001202,0.00008569703,0.9661567,0.008848216,0.00028626263,0.000075779266,0.0000018214253,0.00049120473,0.018053105],"genre_scores_gemma":[0.921052,0.000008191107,0.07137048,0.0069702864,0.00010167009,0.000005660013,0.0000013752699,0.000007589097,0.00048276896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910337,0.00004210226,0.00013049571,0.00032627705,0.00016747201,0.00023027584],"domain_scores_gemma":[0.9993878,0.00003913165,0.000030608975,0.00031935217,0.000031514817,0.00019161799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011209831,0.00010666758,0.00011103924,0.000046264413,0.00009740529,0.00009844319,0.0008695838,0.000035472018,0.0001808821],"category_scores_gemma":[0.000018387156,0.00008918188,0.00008633988,0.0005805761,0.000049790724,0.00036254432,0.00018951604,0.00010883736,0.0004883184],"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.0000030815304,0.000024763009,0.00016293889,0.000004248783,0.00001030551,0.000036488367,0.0006540338,0.000007927365,0.0009862771,0.97970414,0.0055588847,0.012846887],"study_design_scores_gemma":[0.0024075478,0.0014050548,0.003679695,0.000025698224,0.000026959375,0.00011436138,0.0004846363,0.17151275,0.051570643,0.44951743,0.3174333,0.0018219305],"about_ca_topic_score_codex":0.000005368875,"about_ca_topic_score_gemma":6.3429e-7,"teacher_disagreement_score":0.91505075,"about_ca_system_score_codex":0.0000034153209,"about_ca_system_score_gemma":0.000019486242,"threshold_uncertainty_score":0.62765074},"labels":[],"label_agreement":null},{"id":"W2948637333","doi":"10.1145/3299869.3300076","title":"Experimental Analysis of Streaming Algorithms for Graph Partitioning","year":2019,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":41,"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","keywords":"Computer science; Graph partition; Scalability; Graph; Algorithm; Theoretical computer science; Database","score_opus":0.016663960519732585,"score_gpt":0.2701431195513945,"score_spread":0.2534791590316619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948637333","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.29205573,0.000041927335,0.7064891,0.000018393177,0.00013063451,0.00010020128,0.0000048577613,0.00004709084,0.0011120894],"genre_scores_gemma":[0.9210338,6.060592e-7,0.0786934,0.000046395944,0.000009476934,0.00001467155,0.0000073504384,0.000002955465,0.00019135789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931717,0.000020641779,0.00016455239,0.00022773222,0.00011813848,0.00015178382],"domain_scores_gemma":[0.9994782,0.00009098287,0.000065244,0.00028528878,0.000042554246,0.00003773309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018845045,0.000072369905,0.00017533399,0.00025855334,0.000054855427,0.00003834784,0.00029335212,0.000023871218,0.00009412324],"category_scores_gemma":[0.0000042535926,0.000063779524,0.00021100113,0.00082034874,0.000022515223,0.0002765826,0.00005963877,0.00002529452,0.000006327476],"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.000009880833,0.00023149166,0.006283817,0.000015007413,0.00084952207,0.0000013153987,0.0015695544,0.003484526,0.03638877,0.9359015,0.00004388166,0.015220736],"study_design_scores_gemma":[0.0005693992,0.0002580867,0.0046981922,0.000012578372,0.0001227783,0.0000012797116,0.00084394636,0.71937186,0.26042798,0.013339176,0.00010962837,0.00024509136],"about_ca_topic_score_codex":0.000012602795,"about_ca_topic_score_gemma":0.0000013265236,"teacher_disagreement_score":0.9225623,"about_ca_system_score_codex":0.0000066064995,"about_ca_system_score_gemma":0.00000827566,"threshold_uncertainty_score":0.26008534},"labels":[],"label_agreement":null},{"id":"W2949522840","doi":"10.1109/icdcs.2019.00031","title":"Local Graph Edge Partitioning with a Two-Stage Heuristic Method","year":2019,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph partition; Computer science; Strength of a graph; Graph; Theoretical computer science; Partition (number theory); Voltage graph; Algorithm; Line graph; Mathematics; Combinatorics","score_opus":0.009210953413602176,"score_gpt":0.25146521779220987,"score_spread":0.2422542643786077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949522840","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.011243989,0.000020494617,0.97331816,0.00011567692,0.00017088199,0.00010956962,0.0000011072005,0.00019719731,0.014822906],"genre_scores_gemma":[0.7656191,6.558609e-7,0.2317003,0.00037971692,0.000015923972,0.000009104506,0.0000012268557,0.0000065105505,0.0022674375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899435,0.00011112639,0.00012077249,0.00034107518,0.00017358777,0.00025905974],"domain_scores_gemma":[0.999248,0.00013317078,0.000042646316,0.0004418182,0.00004331604,0.000090992806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004015045,0.00011515845,0.00013413627,0.00008540075,0.00009611753,0.00011380953,0.00041243873,0.000024615927,0.00018633995],"category_scores_gemma":[0.0000057221737,0.00008342947,0.000051796273,0.00044572176,0.00005277238,0.0003487132,0.00009695786,0.00011729612,0.000276885],"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.00000834243,0.000035835204,0.0008003269,0.000009702558,0.000017070572,0.00002544044,0.00020886988,0.0029991216,0.00021008284,0.98635966,0.00005607956,0.009269464],"study_design_scores_gemma":[0.0023581525,0.00074713974,0.002366234,0.0000971103,0.000025249909,0.00015738678,0.00041518416,0.73973435,0.01788536,0.23073655,0.0045634573,0.00091380806],"about_ca_topic_score_codex":0.000026989044,"about_ca_topic_score_gemma":0.0000094963425,"teacher_disagreement_score":0.7556231,"about_ca_system_score_codex":0.000008462592,"about_ca_system_score_gemma":0.000028670675,"threshold_uncertainty_score":0.35588887},"labels":[],"label_agreement":null},{"id":"W2951336423","doi":"10.48550/arxiv.1603.04626","title":"TAPER: query-aware, partition-enhancement for large, heterogenous, graphs","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Partition (number theory); Scalability; Graph partition; Workload; Space partitioning; Hash function; USable; Parallel computing; Theoretical computer science; Graph; Algorithm; Database; Mathematics","score_opus":0.04742599059995042,"score_gpt":0.19255647801610046,"score_spread":0.14513048741615003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951336423","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.05097491,0.00008212879,0.94586957,0.00014005511,0.0011945922,0.00059372414,0.00016511981,0.00027642297,0.0007035025],"genre_scores_gemma":[0.99608815,0.00021281598,0.0016735165,0.00020780005,0.000094617986,0.000016194917,0.000047054098,0.000023528994,0.0016362974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975382,0.00014588534,0.00025757696,0.0012888659,0.00011016528,0.00065928145],"domain_scores_gemma":[0.99781084,0.00013320684,0.00026825297,0.001352748,0.00021721415,0.0002177376],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040313596,0.0003916445,0.00037294772,0.00027445916,0.0003830249,0.00012461522,0.0018119022,0.00026443042,0.000058825946],"category_scores_gemma":[0.000011070508,0.00038445543,0.00048026958,0.00035959575,0.000095535404,0.00043043558,0.0011814152,0.0002786977,0.00011050417],"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.000034816203,0.00023954401,0.00038489723,0.000086834974,0.00016590553,0.00007644202,0.00016463439,0.0011007526,0.00007378722,0.99604636,0.00056539016,0.001060642],"study_design_scores_gemma":[0.0009803894,0.00014958045,0.0000809806,0.00015344811,0.00006789369,0.000005391597,0.000036996724,0.058252055,0.0016966563,0.9344977,0.0033975737,0.00068131654],"about_ca_topic_score_codex":0.0000118380685,"about_ca_topic_score_gemma":0.000018705752,"teacher_disagreement_score":0.94511324,"about_ca_system_score_codex":0.00011511661,"about_ca_system_score_gemma":0.00013242196,"threshold_uncertainty_score":0.99986076},"labels":[],"label_agreement":null},{"id":"W2951937410","doi":"10.48550/arxiv.1503.04359","title":"Accelerating Direction-Optimized Breadth First Search on Hybrid Architectures","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Workload; Parallel computing; Key (lock); Theoretical computer science; Graph; Vertex (graph theory); Efficient energy use; Architecture; Process (computing); Distributed computing","score_opus":0.08478218180540811,"score_gpt":0.20230665916162002,"score_spread":0.11752447735621191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951937410","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.5022619,0.00005616422,0.48583883,0.00041792286,0.0013201085,0.0004520621,0.000049719732,0.0006966784,0.00890665],"genre_scores_gemma":[0.99459493,0.000041791267,0.003949548,0.0002412478,0.00011197532,0.00000201841,0.000021755084,0.000019531593,0.0010171903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744415,0.0003445733,0.00020260787,0.0013354605,0.00019125076,0.00048196496],"domain_scores_gemma":[0.9977479,0.0002810881,0.0001703163,0.0013093813,0.0002056516,0.00028564947],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006454734,0.00040579203,0.00039549032,0.00045791018,0.00044114806,0.0002914483,0.0020851367,0.00015377706,0.000039354534],"category_scores_gemma":[0.000060357048,0.00042459663,0.00027453183,0.0005634144,0.00014224877,0.00018756883,0.0017625125,0.0010774336,0.00012890287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009080421,0.00013480648,0.00020697164,0.00003774711,0.00010784006,0.00039101788,0.00046907936,0.9657599,0.000008073507,0.02767672,0.0011514475,0.003965631],"study_design_scores_gemma":[0.0010875973,0.00016477381,0.00027379591,0.00016415858,0.000039088587,0.000028820648,0.00006298068,0.90699756,0.0009970197,0.08855028,0.0008364117,0.0007974887],"about_ca_topic_score_codex":0.00014358689,"about_ca_topic_score_gemma":0.000017358194,"teacher_disagreement_score":0.49233305,"about_ca_system_score_codex":0.0001758919,"about_ca_system_score_gemma":0.0002011893,"threshold_uncertainty_score":0.9998206},"labels":[],"label_agreement":null},{"id":"W2952908729","doi":"10.48550/arxiv.1311.4778","title":"Semantic Word Cloud Representations: Hardness and Approximation Algorithms","year":2013,"lang":"en","type":"preprint","venue":"Zurich Open Repository and Archive (University of Zurich)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Adjacency list; Combinatorics; Bounded function; Vertex (graph theory); Computer science; Mathematics; Graph; Discrete mathematics; Theoretical computer science","score_opus":0.01583044155109476,"score_gpt":0.2236481141465156,"score_spread":0.20781767259542083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952908729","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.17578955,0.0006368284,0.8141201,0.00058597955,0.0012174402,0.0014335266,0.00004678578,0.000135313,0.006034438],"genre_scores_gemma":[0.51311344,0.0009152508,0.4784123,0.000098722994,0.0002549601,0.000019155235,0.0001238507,0.00004081666,0.0070214826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722654,0.0009115283,0.00029113176,0.0010147543,0.00028528745,0.00027073812],"domain_scores_gemma":[0.9978834,0.00034634848,0.000511468,0.0008934656,0.00015448511,0.00021087065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008116555,0.00030852138,0.00052663166,0.00028878017,0.00079463754,0.00054397265,0.0018849025,0.00016851832,0.000013179152],"category_scores_gemma":[0.000028446299,0.00034922035,0.00011973922,0.00028183952,0.00041221382,0.0011869506,0.00564289,0.0004659982,0.000009072182],"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.00057343,0.002483033,0.015574212,0.0051110988,0.0028240574,0.0016175465,0.12148979,0.0013541183,0.009325389,0.56167024,0.038864605,0.23911248],"study_design_scores_gemma":[0.0028916213,0.00041782868,0.09421722,0.0014273684,0.00047461843,0.00044610453,0.0076211705,0.23767087,0.0012014852,0.64722127,0.004188304,0.0022221303],"about_ca_topic_score_codex":0.0007863515,"about_ca_topic_score_gemma":0.00001246939,"teacher_disagreement_score":0.3373239,"about_ca_system_score_codex":0.0000217834,"about_ca_system_score_gemma":0.000101576385,"threshold_uncertainty_score":0.999896},"labels":[],"label_agreement":null},{"id":"W2955938631","doi":"","title":"LUMOS: Dependency-Driven Disk-based Graph Processing.","year":2019,"lang":"en","type":"article","venue":"USENIX Annual Technical Conference","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Dependency (UML); Graph; Dependency graph; Parallel computing; Theoretical computer science; Artificial intelligence","score_opus":0.011511070876503134,"score_gpt":0.23905021158090767,"score_spread":0.22753914070440454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955938631","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.06255776,0.00010802176,0.92494035,0.0012083858,0.00040475352,0.00060231827,0.000041952117,0.0015407228,0.008595736],"genre_scores_gemma":[0.96545994,0.000006200896,0.033536233,0.0005124712,0.000034999845,0.00003712385,0.0000071726126,0.000017374525,0.00038850243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754584,0.00012476215,0.0003743052,0.0008434984,0.00054627104,0.0005653468],"domain_scores_gemma":[0.9981502,0.00014953056,0.00015423019,0.0010164978,0.0002996898,0.0002298071],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003575708,0.0003039211,0.00034231137,0.00018676204,0.0001683645,0.00027063632,0.0022621334,0.00021193366,0.00012675476],"category_scores_gemma":[0.000084143874,0.00026182816,0.00017237726,0.0008217539,0.00021270447,0.000858288,0.00040301256,0.00050417124,0.0003338624],"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.0000729758,0.0007260328,0.008197725,0.00015951596,0.000031422896,0.00013199121,0.0007852294,0.00030001326,0.011790554,0.83023816,0.00077229046,0.14679411],"study_design_scores_gemma":[0.0050536054,0.0031285926,0.041113064,0.0011147126,0.0001004048,0.00025562636,0.00053386635,0.27297097,0.023311239,0.6230125,0.024393702,0.00501176],"about_ca_topic_score_codex":0.00001131819,"about_ca_topic_score_gemma":0.000013472307,"teacher_disagreement_score":0.9029022,"about_ca_system_score_codex":0.000025978097,"about_ca_system_score_gemma":0.000259475,"threshold_uncertainty_score":0.9999834},"labels":[],"label_agreement":null},{"id":"W2962755600","doi":"10.5441/002/edbt.2016.35","title":"Query Workload-based RDF Graph Fragmentation and Allocation","year":2016,"lang":"en","type":"article","venue":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":13,"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":"RDF; SPARQL; Computer science; Fragmentation (computing); Workload; Distributed database; Distributed computing; Graph; Speedup; Database; Theoretical computer science; Information retrieval; Parallel computing; Semantic Web; Operating system","score_opus":0.004627764746968772,"score_gpt":0.17464235572103914,"score_spread":0.17001459097407037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962755600","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.8479241,0.00006688094,0.14474168,0.0064018127,0.0001619938,0.00013357941,0.000001976087,0.00010602808,0.00046194502],"genre_scores_gemma":[0.99394107,0.00010558056,0.0057335827,0.00005154738,0.00003257337,3.801218e-7,2.5846293e-7,0.0000021108224,0.00013288604],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990824,0.000026038992,0.00008792765,0.00034699417,0.00025678216,0.00019987226],"domain_scores_gemma":[0.9993107,0.000059576912,0.00010156677,0.0002974907,0.00017597392,0.000054729968],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00045049624,0.00008974589,0.000108972694,0.00048418873,0.00068778195,0.00004298914,0.00078554504,0.00007458696,0.000014463298],"category_scores_gemma":[0.000044312772,0.00006645916,0.000023970373,0.0017755022,0.0033710683,0.000791719,0.00023817323,0.000086750544,0.000007655916],"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.000021445358,0.000055382796,0.0044589103,0.000008696129,0.000011101222,0.000017094393,0.0007375065,0.000005831315,0.02668898,0.25266856,0.0001341481,0.7151924],"study_design_scores_gemma":[0.008344728,0.0016661747,0.20784235,0.0013260784,0.00017015151,0.00012619051,0.017412502,0.008010351,0.25107738,0.48222208,0.019562328,0.0022397055],"about_ca_topic_score_codex":0.00001638018,"about_ca_topic_score_gemma":0.000027317712,"teacher_disagreement_score":0.7129527,"about_ca_system_score_codex":0.000034582215,"about_ca_system_score_gemma":0.00010854416,"threshold_uncertainty_score":0.9993412},"labels":[],"label_agreement":null},{"id":"W2963282263","doi":"10.1137/1.9781611975031.70","title":"A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":14,"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":"Mathematics; Rank (graph theory); Hamiltonian (control theory); Combinatorics; Matrix (chemical analysis); Materials science; Mathematical optimization; Composite material","score_opus":0.036016870087504475,"score_gpt":0.24798687857463173,"score_spread":0.21197000848712724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963282263","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.0008340748,0.00019483667,0.82325417,0.00018551233,0.0018519384,0.005815392,0.00044457254,0.00048062298,0.16693889],"genre_scores_gemma":[0.0018141959,0.000033933655,0.5884365,0.00066121866,0.005961883,0.0008997142,0.0001176428,0.00037344333,0.4017015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977531,0.000004621685,0.0006607409,0.0007099055,0.00033506512,0.000536599],"domain_scores_gemma":[0.99809885,0.00047396237,0.00057217985,0.00056423753,0.00013787337,0.00015292432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009881023,0.0005858963,0.0007689472,0.00006636935,0.0007583533,0.0004365234,0.00071551884,0.0009592808,0.000023711935],"category_scores_gemma":[0.00001582379,0.0005197135,0.0008439575,0.00003006855,0.00042887148,0.0000789561,0.00028161771,0.0004312629,0.000016240065],"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.00003606966,0.000029905015,3.282105e-8,0.00033127636,0.00032413792,6.9637684e-7,0.001846072,6.057003e-7,0.00031088627,0.9751057,0.006461086,0.015553556],"study_design_scores_gemma":[0.001789326,0.0001503287,2.3409186e-8,0.00023168774,0.00021559469,0.000009735045,0.00009485067,0.0025094787,0.00071822765,0.8672886,0.12635706,0.0006350931],"about_ca_topic_score_codex":7.933792e-7,"about_ca_topic_score_gemma":0.0000012722433,"teacher_disagreement_score":0.2348177,"about_ca_system_score_codex":0.000047436293,"about_ca_system_score_gemma":0.00013564808,"threshold_uncertainty_score":0.99972546},"labels":[],"label_agreement":null},{"id":"W2963904000","doi":"10.1109/icde.2019.00100","title":"Time Constrained Continuous Subgraph Search Over Streaming Graphs","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":49,"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":"Computer science; Subgraph isomorphism problem; Induced subgraph isomorphism problem; Popularity; Streaming data; Graph; Concurrency; Theoretical computer science; Distributed computing; Data mining","score_opus":0.011401504327446316,"score_gpt":0.24011577805010226,"score_spread":0.22871427372265593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963904000","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.498108,0.0003442042,0.42127085,0.00045937026,0.0028419145,0.0015493708,0.00012602776,0.0015630756,0.07373718],"genre_scores_gemma":[0.9737648,0.000030481564,0.01932349,0.00033334058,0.00007959367,0.00002249063,0.000042647047,0.0000332587,0.0063699153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694777,0.00025912648,0.00042270237,0.0011497315,0.0005554606,0.0006652392],"domain_scores_gemma":[0.9974799,0.0003042438,0.00016295363,0.0016766672,0.00017506936,0.00020116067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000865591,0.00047023172,0.0006123971,0.00050542224,0.000131625,0.00049321476,0.0022923513,0.00037487887,0.0004579664],"category_scores_gemma":[0.000023054445,0.00042100993,0.00045251485,0.00047216853,0.00031298152,0.0002684269,0.0020525448,0.000904658,0.00046239205],"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.00003516594,0.00034043659,0.0034749396,0.00031389433,0.00067514915,0.00034556494,0.001995016,0.0019971232,0.0025243496,0.9187258,0.0028464913,0.06672609],"study_design_scores_gemma":[0.0029595415,0.00048614456,0.008905669,0.0007159399,0.00011319391,0.00019276826,0.00033051835,0.47987396,0.0054734377,0.49579424,0.0013708686,0.0037837487],"about_ca_topic_score_codex":0.00007613442,"about_ca_topic_score_gemma":0.000002895992,"teacher_disagreement_score":0.4778768,"about_ca_system_score_codex":0.000026597421,"about_ca_system_score_gemma":0.0002249802,"threshold_uncertainty_score":0.99982417},"labels":[],"label_agreement":null},{"id":"W2970605555","doi":"10.1109/iisa.2019.8900744","title":"Graph-XLL: a Graph Library for Extra Large Graph Analytics on a Single Machine","year":2019,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"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 Victoria","funders":"","keywords":"Computer science; Scalability; Analytics; Theoretical computer science; Graph; Database","score_opus":0.014526751853606825,"score_gpt":0.2220882040380449,"score_spread":0.20756145218443808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970605555","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.051229842,0.00031589763,0.92728627,0.0012532534,0.0010471579,0.0008059808,0.00011328275,0.00096495665,0.016983354],"genre_scores_gemma":[0.9294309,0.000033997283,0.061830834,0.00366373,0.000089242174,0.000039374136,0.000049724862,0.000051822917,0.004810389],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980718,0.00007808487,0.00030741203,0.00066159014,0.0002826315,0.00059850287],"domain_scores_gemma":[0.998478,0.0002513776,0.000105315165,0.00093570276,0.000043270087,0.00018632821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003544691,0.00028857347,0.0003038758,0.0005541606,0.00017936053,0.00026632802,0.0011505581,0.00010596931,0.00018942404],"category_scores_gemma":[0.0000145276135,0.00023272859,0.00042118318,0.0013534694,0.000053638523,0.00091469503,0.00020394383,0.0001940364,0.00010401442],"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.000048342157,0.00055767153,0.0017117538,0.000036971975,0.00007225057,0.000013134607,0.00018583114,0.00007403541,0.0005728389,0.9880894,0.0032977853,0.005340029],"study_design_scores_gemma":[0.0026193107,0.001722023,0.001328784,0.00007654824,0.00003722297,0.000024105879,0.00009033348,0.06742318,0.009143243,0.89219785,0.024416268,0.0009211137],"about_ca_topic_score_codex":0.0000036461774,"about_ca_topic_score_gemma":0.0000047027174,"teacher_disagreement_score":0.87820107,"about_ca_system_score_codex":0.0000067089195,"about_ca_system_score_gemma":0.000028948156,"threshold_uncertainty_score":0.94903964},"labels":[],"label_agreement":null},{"id":"W2971425956","doi":"10.1109/ipdps.2019.00108","title":"Incremental Graph Processing for On-line Analytics","year":2019,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":14,"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 British Columbia","funders":"","keywords":"Computer science; Granularity; Analytics; Graph; Theoretical computer science; Distributed computing; Data analysis; Graph database; Data mining","score_opus":0.02695990473978383,"score_gpt":0.2739362364078595,"score_spread":0.2469763316680757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971425956","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.05383171,0.000014328442,0.9389781,0.0003002136,0.00020839622,0.00018317916,0.0000017082212,0.00010587685,0.0063765375],"genre_scores_gemma":[0.94433165,7.8351405e-7,0.05383443,0.0007674727,0.000032819084,0.000005585828,0.0000016965248,0.0000042526012,0.0010212935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994214,0.000009969303,0.00009791852,0.00020301384,0.00011367737,0.00015399147],"domain_scores_gemma":[0.9996386,0.00004226563,0.000032337623,0.00021099807,0.00003692386,0.000038862978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020203953,0.00007086103,0.00007874784,0.000080755686,0.000068384375,0.00007919746,0.00035654005,0.000021528067,0.000022823418],"category_scores_gemma":[0.0000059891727,0.00005480726,0.000055299824,0.00024275357,0.00001470101,0.0002162632,0.000054967673,0.00004332972,0.000051080566],"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.000018639039,0.00015250937,0.0007384616,0.00003851578,0.000021446313,0.0000018801325,0.00019588448,0.00084013393,0.0014091899,0.8887396,0.00041212968,0.107431635],"study_design_scores_gemma":[0.00095244223,0.0006510572,0.00041267974,0.000035568097,0.000007797337,0.000005629023,0.00010383416,0.81387824,0.023428375,0.1584578,0.0017661253,0.00030045916],"about_ca_topic_score_codex":0.0000011490484,"about_ca_topic_score_gemma":6.905981e-7,"teacher_disagreement_score":0.89049995,"about_ca_system_score_codex":0.0000070483215,"about_ca_system_score_gemma":0.000016606986,"threshold_uncertainty_score":0.22349751},"labels":[],"label_agreement":null},{"id":"W2995841598","doi":"10.1109/access.2019.2960868","title":"Query-Sensitive Graph Partitioner for Pattern Matching Applications","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Graph partition; Partition (number theory); Workload; Scalability; Theoretical computer science; Tree traversal; Graph; Space partitioning; Graph traversal; Matching (statistics); Cluster analysis; Parallel computing; Algorithm; Artificial intelligence; Mathematics; Database","score_opus":0.017026312254769155,"score_gpt":0.2826221072212299,"score_spread":0.26559579496646074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995841598","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.08657557,0.000010405217,0.9116162,0.00027251526,0.00044959938,0.00043637297,0.000015949388,0.00011289126,0.0005105132],"genre_scores_gemma":[0.99548936,0.0000030300794,0.0030207217,0.0009842608,0.000113343915,0.00023062181,0.000007692848,0.000008694526,0.00014226545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922055,0.000033692086,0.00013155182,0.00030537698,0.00010844472,0.00020039758],"domain_scores_gemma":[0.9992688,0.00012939305,0.00006906003,0.0004004217,0.000079978,0.000052367857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017757317,0.000092924376,0.000105995176,0.00008048859,0.00014044122,0.00022886238,0.0006767334,0.000036734476,0.00001062108],"category_scores_gemma":[0.0000022076263,0.000085432024,0.0000795619,0.0002540908,0.000023828095,0.0008081369,0.00007856978,0.00007156892,0.00012914203],"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.000022466309,0.00034443315,0.004131052,0.00018600846,0.00014635552,0.000012240294,0.0024936532,0.00481901,0.009265787,0.75475234,0.0021090386,0.22171764],"study_design_scores_gemma":[0.00084947183,0.00007708514,0.004792246,0.00006161573,0.000020895663,0.000018974735,0.00011440419,0.020147743,0.04104334,0.9269092,0.0053408365,0.000624207],"about_ca_topic_score_codex":0.00001825574,"about_ca_topic_score_gemma":0.000006914125,"teacher_disagreement_score":0.9089138,"about_ca_system_score_codex":0.000008696426,"about_ca_system_score_gemma":0.000014611421,"threshold_uncertainty_score":0.34838167},"labels":[],"label_agreement":null},{"id":"W2996401364","doi":"10.1145/3434391","title":"Scalable Pattern Matching in Metadata Graphs via Constraint Checking","year":2021,"lang":"en","type":"preprint","venue":"ACM Transactions on Parallel Computing","topic":"Graph Theory and Algorithms","field":"Computer Science","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 British Columbia","funders":"Lawrence Livermore National Laboratory; U.S. Department of Energy","keywords":"Computer science; Scalability; Theoretical computer science; Vertex (graph theory); Iterated function; Graph; Database; Mathematics","score_opus":0.02814714752405869,"score_gpt":0.2669009362328258,"score_spread":0.2387537887087671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996401364","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.052982483,0.00029798358,0.9440471,0.00045488132,0.0012985074,0.0003714474,0.00001626994,0.00035640498,0.00017490736],"genre_scores_gemma":[0.74106234,0.000044802287,0.2583798,0.00036229487,0.00003789613,0.000024781524,0.000029529372,0.00003171256,0.00002683474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583703,0.00046399675,0.00089252926,0.0015200399,0.00050722575,0.0007791632],"domain_scores_gemma":[0.99667984,0.00041703336,0.00032836891,0.0022969993,0.000105086736,0.00017267939],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0012428348,0.0006051884,0.0007724563,0.0006332759,0.00048505323,0.0011214712,0.0030555013,0.0003437245,0.000043816268],"category_scores_gemma":[0.000022663997,0.000672811,0.00047361248,0.0008163505,0.000112465656,0.0007299689,0.0005503821,0.0023348958,0.000017179816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068498107,0.00033360993,0.00014886844,0.00016618888,0.00017091224,0.00023705077,0.0026818626,0.53288573,0.0001706857,0.0020129634,0.0000032275534,0.46118206],"study_design_scores_gemma":[0.001445182,0.00008698383,0.0020965494,0.002202785,0.0001052338,0.00026566946,0.0010044707,0.8202501,0.0011120723,0.16946831,0.000071337025,0.0018913085],"about_ca_topic_score_codex":0.00047915452,"about_ca_topic_score_gemma":0.00013958967,"teacher_disagreement_score":0.6880799,"about_ca_system_score_codex":0.00011336697,"about_ca_system_score_gemma":0.00017948974,"threshold_uncertainty_score":0.99996674},"labels":[],"label_agreement":null},{"id":"W2998529453","doi":"10.1109/csci46756.2018.00240","title":"On Evaluation of Graph Pattern Matching in Large Databases","year":2018,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","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 Winnipeg","funders":"","keywords":"Computer science; Reachability; Graph database; Factor-critical graph; Graph; Matching (statistics); Theoretical computer science; Graph factorization; Pattern matching; Data mining; Line graph; Artificial intelligence; Mathematics; Voltage graph","score_opus":0.04013647443571729,"score_gpt":0.314112528511913,"score_spread":0.27397605407619574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998529453","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.48787677,0.0000062208132,0.5101674,0.000039103368,0.00011399682,0.00004782592,0.0000026561336,0.000017285745,0.0017287342],"genre_scores_gemma":[0.9962793,7.2170025e-7,0.0034476707,0.00023442473,0.000017050368,0.0000033248618,0.0000024954902,0.0000018145248,0.000013178775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925596,0.00012089642,0.00010858629,0.00015350487,0.0002537226,0.00010730599],"domain_scores_gemma":[0.9995356,0.000060797374,0.00003433604,0.00029249326,0.000059774626,0.000016961403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013301524,0.000046168843,0.000057746638,0.00012589182,0.000033070406,0.000013493032,0.00024782994,0.000010616334,0.000118187556],"category_scores_gemma":[0.000024986037,0.000037320013,0.000019613944,0.00024387805,0.000019839372,0.00024540047,0.00007815649,0.000037841433,0.000031366304],"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.000005246185,0.00023417635,0.0042498917,0.000008484718,0.000007685,0.0000022784475,0.0015530391,0.000092000955,0.00078808464,0.86101717,0.00013927645,0.13190266],"study_design_scores_gemma":[0.0012057861,0.0002081077,0.04727645,0.000110915156,0.000007758858,0.0000029710914,0.00017907745,0.24549727,0.02405194,0.6811863,0.0000628566,0.00021053055],"about_ca_topic_score_codex":0.00004913857,"about_ca_topic_score_gemma":0.00012292308,"teacher_disagreement_score":0.5084025,"about_ca_system_score_codex":0.0000056612694,"about_ca_system_score_gemma":0.000013402734,"threshold_uncertainty_score":0.1521866},"labels":[],"label_agreement":null},{"id":"W3003551558","doi":"10.1109/icocsec47621.2019.8970906","title":"Using Attack Pattern for Cyber Attack Attribution","year":2019,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Computer security; Attack model; Relevance (law); Cyber-attack; Attack patterns; Confidentiality; Node (physics); Intrusion detection system; Engineering","score_opus":0.06786290029194066,"score_gpt":0.31368851552450033,"score_spread":0.2458256152325597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003551558","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.2065591,0.000012518529,0.79156613,0.00020907445,0.0005356648,0.0002101078,0.000004555872,0.00008919989,0.00081362936],"genre_scores_gemma":[0.9618487,8.8231906e-7,0.035695285,0.00061392516,0.00008619225,0.000007348058,0.000006421687,0.000008496707,0.0017327425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991352,0.000033289765,0.00013912912,0.00030249124,0.00012164149,0.0002682367],"domain_scores_gemma":[0.999371,0.00006526474,0.000048858983,0.0003872688,0.00007279085,0.000054831646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027174485,0.000102969905,0.00011785492,0.00005042417,0.00008893585,0.000096559954,0.00039756452,0.000052190226,0.0000993081],"category_scores_gemma":[0.00000530807,0.000087389024,0.00009468828,0.00017767186,0.0000164498,0.0004522315,0.00011750103,0.00005674199,0.00032716643],"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.000037374426,0.00038709416,0.041301373,0.00018733427,0.00015436925,0.000014269719,0.0011777371,0.006412492,0.01513258,0.60836756,0.007679532,0.31914827],"study_design_scores_gemma":[0.0008660639,0.00013171548,0.0035124372,0.000030042353,0.000008930407,0.000019420977,0.00002690738,0.9605764,0.006432201,0.006367482,0.02165078,0.0003776194],"about_ca_topic_score_codex":0.0000067161795,"about_ca_topic_score_gemma":0.0000019204358,"teacher_disagreement_score":0.9541639,"about_ca_system_score_codex":0.000025660875,"about_ca_system_score_gemma":0.000018532199,"threshold_uncertainty_score":0.42051718},"labels":[],"label_agreement":null},{"id":"W3013485901","doi":"10.5383/juspn.08.02.003","title":"From Relational Database to Big Data: Converting Relational to graph database, MOOC database as example","year":2017,"lang":"en","type":"article","venue":"Journal of Ubiquitous Systems and Pervasive Networks","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph database; Computer science; Relational database; Database; Database design; Database schema; Database model; View; Graph; Relational database management system; Semi-structured model; Wait-for graph; Relational model; Information retrieval; Theoretical computer science","score_opus":0.09163477766572739,"score_gpt":0.29044669702098885,"score_spread":0.19881191935526146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013485901","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.07553454,0.0021715467,0.9129477,0.0012011286,0.0065264697,0.00040153813,0.00096104434,0.000032917076,0.00022312831],"genre_scores_gemma":[0.9459405,0.00034087262,0.042011663,0.0011667786,0.009526536,0.000018389503,0.00067619147,0.000045625056,0.00027342624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661076,0.00030381628,0.0009933076,0.0007889088,0.0008279257,0.00047530467],"domain_scores_gemma":[0.99449,0.0008699629,0.0010845775,0.0023402278,0.000513866,0.0007013409],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002714664,0.00032243007,0.00055205286,0.00028842557,0.0011346037,0.00079313596,0.002476904,0.00013201084,0.000022940689],"category_scores_gemma":[0.0006658866,0.0002799619,0.0001078088,0.0002849946,0.00010022914,0.0030389514,0.0019688853,0.00060751976,0.000030596293],"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.0020906045,0.00097253296,0.058847558,0.00047762445,0.0028581389,0.0054821367,0.012682837,0.081705555,0.015925493,0.4435967,0.26477283,0.110588],"study_design_scores_gemma":[0.010164084,0.0024537558,0.057285126,0.0110324025,0.00076443853,0.0055006924,0.0036637296,0.62460357,0.0008259021,0.017535796,0.2615869,0.0045836265],"about_ca_topic_score_codex":0.0017753706,"about_ca_topic_score_gemma":0.00016421029,"teacher_disagreement_score":0.87093604,"about_ca_system_score_codex":0.000044381333,"about_ca_system_score_gemma":0.00022647799,"threshold_uncertainty_score":0.99996525},"labels":[],"label_agreement":null},{"id":"W3014850249","doi":"10.1145/3342195.3387548","title":"Peregrine","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Graph; Theoretical computer science; Computation; Algorithm","score_opus":0.030059612028123895,"score_gpt":0.24716423158869213,"score_spread":0.21710461956056823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014850249","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.00057466835,0.00007615207,0.9508812,0.0056044594,0.00086969923,0.00008521339,0.0000022624354,0.00050620013,0.041400146],"genre_scores_gemma":[0.64991206,0.000028558237,0.34374514,0.0027006164,0.00036872164,0.000023982822,0.000010590461,0.000013765808,0.0031965505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991558,0.000035884867,0.00011182382,0.00043710007,0.0001314091,0.00012794834],"domain_scores_gemma":[0.9991905,0.000021936723,0.000040480736,0.0006284053,0.000026985343,0.000091653994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009600286,0.00013225802,0.00014864825,0.00004150561,0.000034194094,0.00015613792,0.0014918209,0.00008114147,0.00009246677],"category_scores_gemma":[0.000012408885,0.000108582644,0.00010940321,0.00011322001,0.00001903807,0.000071690185,0.0025779079,0.00036006302,0.0002750998],"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":[6.5032964e-7,0.0000144334235,0.000014954211,0.000024840012,0.00001631121,0.000028743021,0.00022679404,0.000056216024,0.00004786198,0.9752172,0.0019036926,0.022448262],"study_design_scores_gemma":[0.000078424295,0.000024207902,0.00030511784,0.00001849851,0.000004069951,0.00000713226,0.000008801821,0.073660314,0.0009771435,0.91760737,0.0070475657,0.000261382],"about_ca_topic_score_codex":0.0000063160714,"about_ca_topic_score_gemma":5.0369067e-7,"teacher_disagreement_score":0.6493374,"about_ca_system_score_codex":0.0000064679625,"about_ca_system_score_gemma":0.000045911467,"threshold_uncertainty_score":0.4427872},"labels":[],"label_agreement":null},{"id":"W3016038458","doi":"10.1145/3448016.3452837","title":"Graphsurge","year":2021,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Dataflow; Computation; Analytics; Graph; Theoretical computer science; Programming language; Data science","score_opus":0.006654027007533462,"score_gpt":0.19762120782796613,"score_spread":0.19096718082043268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016038458","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.0075833267,0.0000874422,0.9213527,0.0007603682,0.00034016068,0.00001079312,1.9299381e-7,0.00015601022,0.069709],"genre_scores_gemma":[0.9017296,0.000009288379,0.089830324,0.0016544621,0.000026454785,0.0000021100236,7.5159835e-7,0.0000023964658,0.006744646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996632,0.000024045927,0.00004310804,0.00012223396,0.00005965293,0.000087813576],"domain_scores_gemma":[0.9996608,0.000024347153,0.0000063503066,0.0002456173,0.00002866948,0.00003425475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007842223,0.000029571605,0.000035521658,0.000021520145,0.00003951794,0.000049569553,0.00019536489,0.0000111623785,0.00013007861],"category_scores_gemma":[0.000008109664,0.000024847002,0.000038512648,0.00031074262,0.000009329347,0.00014302571,0.00008078726,0.00002770074,0.000093660106],"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":[7.909382e-8,0.000013482262,0.00012993727,6.0304455e-7,0.0000025459049,0.000040765175,0.00005593463,9.308738e-7,0.0004273895,0.98072106,0.000569284,0.018037995],"study_design_scores_gemma":[0.00016732921,0.000015258748,0.0038888229,0.000004146304,0.0000015483572,0.000091354406,0.000044790264,0.004871232,0.06848059,0.89455783,0.027701648,0.00017544358],"about_ca_topic_score_codex":7.4089166e-7,"about_ca_topic_score_gemma":9.246015e-7,"teacher_disagreement_score":0.89414626,"about_ca_system_score_codex":0.0000011332171,"about_ca_system_score_gemma":0.000015670303,"threshold_uncertainty_score":0.14242695},"labels":[],"label_agreement":null},{"id":"W3029888401","doi":"10.1109/icde48307.2020.00122","title":"G-thinker: A Distributed Framework for Mining Subgraphs in a Big Graph","year":2020,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parallel computing; Speedup; Bipartite graph; Scheduling (production processes); Vertex (graph theory); Computation; Cache; Graph; Documentation; Theoretical computer science; Distributed computing; Algorithm; Operating system; Mathematics","score_opus":0.03263031059648514,"score_gpt":0.2517556690995332,"score_spread":0.21912535850304804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029888401","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.025054397,0.000075008254,0.97002894,0.003977194,0.00022962385,0.0002038917,0.000014538245,0.00024921302,0.0001671691],"genre_scores_gemma":[0.7019798,0.000004846395,0.29577434,0.0021204003,0.000057833156,0.00003905963,0.000007373274,0.000007098109,0.000009228662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887687,0.000049814058,0.0002160862,0.00040386367,0.00012973351,0.00032360913],"domain_scores_gemma":[0.99917215,0.0003205841,0.000050056096,0.0002752849,0.00003485312,0.00014709706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024259661,0.0001336413,0.00018040558,0.000112936825,0.00008709114,0.000112579524,0.0007164023,0.000085043226,0.000009417386],"category_scores_gemma":[0.00017967878,0.00011792329,0.0001313944,0.0015265178,0.00004014621,0.0001873377,0.00012668544,0.00015254844,0.000008172324],"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.000021396427,0.000047622154,0.0019093386,0.000017540871,0.000015445024,0.000017675493,0.00216228,0.00005612489,0.00009319638,0.9753626,0.00040408317,0.01989267],"study_design_scores_gemma":[0.00076192437,0.00023476488,0.0019598037,0.000047133624,0.000006098968,0.0000044691005,0.00035794175,0.07392627,0.0012526348,0.9193808,0.0017199282,0.0003482547],"about_ca_topic_score_codex":0.0000057470893,"about_ca_topic_score_gemma":0.0000060458565,"teacher_disagreement_score":0.6769254,"about_ca_system_score_codex":0.000006198564,"about_ca_system_score_gemma":0.000026100073,"threshold_uncertainty_score":0.48087725},"labels":[],"label_agreement":null},{"id":"W3035093570","doi":"10.1145/3398682.3399164","title":"ELite","year":2020,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","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":"Computer science; Theoretical computer science; Vertex (graph theory); Computation; Redundancy (engineering); Graph; Algorithm","score_opus":0.015960489818582762,"score_gpt":0.20636744584579944,"score_spread":0.1904069560272167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035093570","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.0010357127,0.000022008651,0.94374037,0.005174706,0.0000564577,0.00001426506,1.1278111e-7,0.00017963765,0.049776707],"genre_scores_gemma":[0.86980444,0.000007122596,0.113308996,0.016249532,0.00007714791,0.0000014143625,2.2366e-7,0.0000022684699,0.0005488776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976367,0.000009609376,0.000032801214,0.000092221046,0.00004314067,0.000058589092],"domain_scores_gemma":[0.9998287,0.000009739855,0.000005289844,0.000094191724,0.0000065436643,0.000055544053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00003173031,0.000023748606,0.000025791747,0.0000067400956,0.000020589307,0.000032484873,0.0002827283,0.0000068068007,0.000051222512],"category_scores_gemma":[0.0000060362963,0.000018441824,0.000018046563,0.0001443774,0.000006181849,0.00013133102,0.00006628851,0.000024387133,0.00032850503],"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":[3.2319235e-7,0.0000029705136,0.000026897025,8.3081306e-7,0.0000013114231,0.000004124548,0.00026730695,0.0000044135745,0.0003048497,0.92290175,0.00060295797,0.07588227],"study_design_scores_gemma":[0.00047386132,0.00016232979,0.0019571432,0.0000058539044,0.0000026463144,0.000011553113,0.000076976605,0.37288544,0.015723046,0.35328594,0.25501674,0.0003984637],"about_ca_topic_score_codex":3.7011625e-7,"about_ca_topic_score_gemma":3.1527694e-8,"teacher_disagreement_score":0.8687687,"about_ca_system_score_codex":6.0184453e-7,"about_ca_system_score_gemma":0.0000036585839,"threshold_uncertainty_score":0.42223772},"labels":[],"label_agreement":null},{"id":"W3046760356","doi":"10.1145/3400903.3400931","title":"Vectorising k-Core Decomposition for GPU Acceleration","year":2020,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":11,"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 Victoria","funders":"","keywords":"Computer science; SIMD; Parallel computing; Analytics; Graph; Multi-core processor; Decomposition; Abstraction; Theoretical computer science; Computational science; Data mining","score_opus":0.055141250371652406,"score_gpt":0.29805258645820676,"score_spread":0.24291133608655435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046760356","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.017109921,0.000012069484,0.9796301,0.0020304862,0.00020081054,0.0001105033,8.292461e-7,0.00016342687,0.00074185635],"genre_scores_gemma":[0.85938185,7.3697316e-7,0.13918051,0.001255242,0.00014572656,0.000008083959,0.000004867992,0.0000029860726,0.00001998496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995931,0.000011222723,0.00007948046,0.00016385592,0.00006061735,0.00009176652],"domain_scores_gemma":[0.9997591,0.000040672414,0.000022364358,0.00009258165,0.000034578094,0.00005072857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000732,0.000049037328,0.000052266583,0.000018961045,0.00011107236,0.0001122821,0.000203606,0.00002045847,0.00001159005],"category_scores_gemma":[0.0000116143565,0.00004404178,0.000040378745,0.00014532196,0.0000058396117,0.00039233308,0.000034727535,0.00003069769,0.00001849474],"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.00001483066,0.00002389816,0.00008350426,0.0000143569005,0.000009758321,0.000002049464,0.0010297926,0.0002722407,0.041069075,0.88218325,0.0013841327,0.073913075],"study_design_scores_gemma":[0.00048134566,0.00024442785,0.0005355954,0.0000074658424,0.0000054955103,0.0000046351115,0.00003810305,0.80455834,0.08605786,0.104755275,0.0031116172,0.00019983102],"about_ca_topic_score_codex":8.585486e-7,"about_ca_topic_score_gemma":3.1836453e-7,"teacher_disagreement_score":0.8422719,"about_ca_system_score_codex":0.0000061481987,"about_ca_system_score_gemma":0.00000877885,"threshold_uncertainty_score":0.17959715},"labels":[],"label_agreement":null},{"id":"W3048147871","doi":"10.1145/3404397.3404433","title":"Balancing Graph Processing Workloads Using Work Stealing on Heterogeneous CPU-FPGA Systems","year":2020,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Intel Corporation","keywords":"Computer science; Parallel computing; Scheduling (production processes); Graph; Oracle; Distributed computing; Field-programmable gate array; Embedded system; Theoretical computer science; Programming language","score_opus":0.03308297250014956,"score_gpt":0.23922886549916472,"score_spread":0.20614589299901515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048147871","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.13760406,0.0008007367,0.8588613,0.00029044304,0.0006214461,0.00020421325,8.0986507e-7,0.00043986953,0.0011770804],"genre_scores_gemma":[0.98041445,0.0000039514753,0.01816356,0.0011081316,0.00024801807,0.0000068783547,0.0000010564432,0.00002008207,0.00003386744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807215,0.00013188904,0.00034526226,0.0006088873,0.00036136084,0.00048043046],"domain_scores_gemma":[0.999116,0.000079395984,0.000138477,0.00036033697,0.00006122321,0.00024457267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003332514,0.00024700537,0.0002773057,0.00012085073,0.0003625827,0.0005911286,0.0007627881,0.00008234296,0.000011450981],"category_scores_gemma":[0.000023743354,0.00021375675,0.00011572638,0.0012700454,0.00003787593,0.00039229702,0.00017697914,0.00023527905,0.000031235635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001245254,0.00022095499,0.0030112604,0.00051721977,0.00017738824,0.00065775745,0.008278319,0.74944645,0.006299774,0.041699164,0.00031001304,0.18925719],"study_design_scores_gemma":[0.00044161794,0.00017522546,0.000066617475,0.0007242749,0.000020465453,0.00008077641,0.0003632738,0.98898363,0.006327267,0.001789427,0.00033257433,0.0006948671],"about_ca_topic_score_codex":0.000009208891,"about_ca_topic_score_gemma":3.4925517e-7,"teacher_disagreement_score":0.8428104,"about_ca_system_score_codex":0.000033441327,"about_ca_system_score_gemma":0.000045495755,"threshold_uncertainty_score":0.8716747},"labels":[],"label_agreement":null},{"id":"W3080519191","doi":"10.1007/978-3-030-57796-4_22","title":"Triangle Enumeration on Massive Graphs Using AWS Lambda Functions","year":2020,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Enumeration; Lambda; Computer science; Concurrency; Combinatorics; Graph; Task (project management); Theoretical computer science; Parallel computing; Algorithm; Discrete mathematics; Mathematics; Distributed computing; Engineering","score_opus":0.028138430275836547,"score_gpt":0.2608050280559165,"score_spread":0.23266659778007995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080519191","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.00022047252,0.010703999,0.9362267,0.00006486157,0.0042450964,0.0005508618,0.00001318699,0.00014074263,0.04783405],"genre_scores_gemma":[0.95411634,0.0024659252,0.01219027,0.0006244882,0.0020247607,0.000043818865,0.00007289158,0.00016602842,0.028295498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800044,0.00009053466,0.0006530752,0.00072386354,0.00027780482,0.00025429067],"domain_scores_gemma":[0.9987647,0.00028009922,0.00044423752,0.0003372643,0.00007294357,0.00010078923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032766865,0.00036440467,0.0005220494,0.0003229151,0.00027956037,0.00022322724,0.00036802256,0.00016113889,0.0000062130066],"category_scores_gemma":[0.000021460657,0.00034802934,0.00014467833,0.00016972066,0.00006450789,0.00034377078,0.00017280075,0.00043876976,0.00003189282],"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.000010266599,0.000014528418,0.000018654287,0.00009209191,0.00003280026,0.00003994348,0.0004115994,0.026867626,0.000010494732,0.9117891,0.000022426824,0.060690466],"study_design_scores_gemma":[0.00047822564,0.0005223582,0.0000062041568,0.0033168579,0.00004796949,0.000084801475,0.00049954676,0.67742926,0.000133509,0.18494605,0.13134874,0.001186498],"about_ca_topic_score_codex":0.000015691496,"about_ca_topic_score_gemma":0.000008080188,"teacher_disagreement_score":0.95389587,"about_ca_system_score_codex":0.00007419727,"about_ca_system_score_gemma":0.000035061013,"threshold_uncertainty_score":0.9998972},"labels":[],"label_agreement":null},{"id":"W3080884987","doi":"10.1007/978-3-030-57796-4_9","title":"PageRank for Billion-Scale Networks in RDBMS","year":2020,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"PageRank; Relational database management system; Computer science; Big data; SPARK (programming language); Recommender system; Relational database; Graph; Database; Information retrieval; Data mining; Theoretical computer science","score_opus":0.015431663477269373,"score_gpt":0.24512103124266013,"score_spread":0.22968936776539076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080884987","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.000053128755,0.031583782,0.95097476,0.000059611077,0.0022317928,0.00072757073,0.0000057703915,0.0000858625,0.014277706],"genre_scores_gemma":[0.9186838,0.019455373,0.039629545,0.00088931556,0.0031104886,0.00019457321,0.00006967432,0.0002448941,0.017722316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774903,0.00005341847,0.0008148789,0.00081387785,0.00018740454,0.0003813982],"domain_scores_gemma":[0.998683,0.0004994838,0.00032511653,0.00033594412,0.00005433711,0.000102145714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006013926,0.00037681783,0.00067223073,0.00025032443,0.00011731763,0.00016213504,0.0006298505,0.00020994167,0.0000021878377],"category_scores_gemma":[0.000014284661,0.00035168944,0.00013094563,0.0001604595,0.00007118268,0.00026681606,0.00027735607,0.0004425861,0.0000063179446],"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.000013168978,0.000016711221,0.00017048462,0.0002668529,0.000020198213,0.000038891798,0.00056924304,0.051297344,0.0000014947839,0.7263277,0.000026485373,0.22125141],"study_design_scores_gemma":[0.00026728227,0.00014265488,0.000016669625,0.0018120336,0.000007875301,0.000027133061,0.00011284457,0.8302709,0.000010004867,0.08451086,0.082249016,0.0005727467],"about_ca_topic_score_codex":0.000012494466,"about_ca_topic_score_gemma":0.0000199898,"teacher_disagreement_score":0.9186307,"about_ca_system_score_codex":0.000051962987,"about_ca_system_score_gemma":0.000021358608,"threshold_uncertainty_score":0.9998935},"labels":[],"label_agreement":null},{"id":"W3085132976","doi":"10.48550/arxiv.2009.07970","title":"Skeletonization and Reconstruction based on Graph Morphological Transformations","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Theory and Algorithms","field":"Computer Science","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":"Université Laval","funders":"","keywords":"Skeletonization; Adjacency list; Computer science; Graph; Artificial intelligence; Pixel; Image processing; Path (computing); Pattern recognition (psychology); Medial axis; Computer vision; Image (mathematics); Theoretical computer science; Algorithm","score_opus":0.048777614024808034,"score_gpt":0.16860148236747097,"score_spread":0.11982386834266293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085132976","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.13560049,0.0000076150795,0.8621049,0.0004188189,0.00028036817,0.00017187631,0.000015440728,0.0002147944,0.0011857352],"genre_scores_gemma":[0.9939906,0.00007079556,0.005614424,0.00024056602,0.000025654266,9.126008e-7,0.000024052862,0.0000059564795,0.000027047858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988797,0.00014921834,0.00013124874,0.0006312738,0.0000579153,0.00015064771],"domain_scores_gemma":[0.9992623,0.00006843685,0.00010469737,0.00038123233,0.00005971696,0.0001236167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013170844,0.0001847885,0.00017340085,0.00023490346,0.00018872543,0.00009065681,0.00049202703,0.00019254921,0.000019931591],"category_scores_gemma":[0.00001775425,0.00019868395,0.00011618833,0.0005761304,0.00011499244,0.00029144908,0.00016530788,0.00039268,0.000018162153],"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.00004507111,0.000095029805,0.00068368687,0.00007038604,0.000040518822,0.00018007388,0.00034929594,0.2953937,0.00008833901,0.6937196,0.00005562218,0.009278621],"study_design_scores_gemma":[0.00028737032,0.00007484591,0.0006550948,0.000034919758,0.00002179576,0.000010194788,0.000033344902,0.76374054,0.000107023254,0.23480694,0.00003424596,0.00019370728],"about_ca_topic_score_codex":0.000004909726,"about_ca_topic_score_gemma":0.0000015127342,"teacher_disagreement_score":0.8583901,"about_ca_system_score_codex":0.00003510092,"about_ca_system_score_gemma":0.000051774412,"threshold_uncertainty_score":0.8102096},"labels":[],"label_agreement":null},{"id":"W3092832024","doi":"10.1109/icde51399.2021.00130","title":"A+ Indexes: Tunable and Space-Efficient Adjacency Lists in Graph Database Management Systems","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Graph Theory 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":"University of Waterloo","funders":"","keywords":"Joins; Search engine indexing; Adjacency list; Computer science; Vertex (graph theory); Partition (number theory); Adjacency matrix; Database; Graph; Theoretical computer science; Data mining; Mathematics; Combinatorics; Algorithm; Information retrieval","score_opus":0.01377196554687299,"score_gpt":0.2299567065551856,"score_spread":0.21618474100831261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092832024","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.11309696,0.006026143,0.86588556,0.00032243674,0.003139931,0.0013321877,0.000029875202,0.000312508,0.009854432],"genre_scores_gemma":[0.95581746,0.0011069403,0.040555477,0.00013693621,0.000060826012,0.00021969687,0.00006377477,0.000025951502,0.0020129357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703413,0.00024026782,0.00044882507,0.0013269609,0.000455498,0.0004943402],"domain_scores_gemma":[0.99787104,0.000063118554,0.00015138256,0.0016640249,0.00007130905,0.00017914985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010072617,0.0003831923,0.0004510309,0.0006013927,0.00010343208,0.00081810576,0.0012182208,0.0001709001,0.000022162385],"category_scores_gemma":[0.000014155038,0.00035667312,0.00010248304,0.0007626381,0.00007290538,0.0002339229,0.0047929934,0.0005404121,0.000011312871],"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.000009969925,0.000627003,0.0014326612,0.002356216,0.00014495435,0.001520563,0.00194888,0.03076417,0.000054995584,0.9550531,0.00054412894,0.005543347],"study_design_scores_gemma":[0.0035815863,0.00017388519,0.013666422,0.008968491,0.00015357205,0.00024914177,0.0063702213,0.90786034,0.001104903,0.049585074,0.0037375602,0.0045487913],"about_ca_topic_score_codex":0.00040630135,"about_ca_topic_score_gemma":0.00004063599,"teacher_disagreement_score":0.90546805,"about_ca_system_score_codex":0.0000613655,"about_ca_system_score_gemma":0.00007428202,"threshold_uncertainty_score":0.99988854},"labels":[],"label_agreement":null},{"id":"W3094414452","doi":"10.1016/j.sysarc.2020.101908","title":"Accelerating data filtering for database using FPGA","year":2020,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Research Grants Council, University Grants Committee","keywords":"Computer science; Speedup; Field-programmable gate array; Hardware acceleration; Control reconfiguration; Acceleration; Focus (optics); Filter (signal processing); Cloud computing; Embedded system; Parallel computing; Computer hardware; Operating system","score_opus":0.1390982729176827,"score_gpt":0.3031220357764073,"score_spread":0.16402376285872458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094414452","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.018011235,0.00055035064,0.9794897,0.00093040423,0.0007439303,0.00015771482,0.000065146516,0.00002594106,0.000025568173],"genre_scores_gemma":[0.58022135,0.0000045708634,0.41744462,0.00048595192,0.0018098387,0.0000016223074,0.0000071658433,0.000017603636,0.00000729011],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987167,0.000107102394,0.00046783104,0.00024279875,0.0002580219,0.00020756171],"domain_scores_gemma":[0.99857235,0.00016219096,0.0004406811,0.00050101767,0.00010198401,0.00022176522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008039143,0.00012846415,0.0002757496,0.000094141455,0.00015441263,0.00028688853,0.0018575717,0.000036370548,0.0000022002955],"category_scores_gemma":[0.00029857171,0.00009726332,0.000085014566,0.00023373707,0.000017455479,0.00074704713,0.00048610265,0.00029093033,8.6208706e-7],"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.0002703981,0.00014768181,0.0002497714,0.002323599,0.0006061095,0.0007739505,0.014630029,0.23936146,0.5937768,0.016306221,0.006545077,0.12500888],"study_design_scores_gemma":[0.0007735325,0.00024676262,0.000012030302,0.0004939391,0.00003306981,0.0013417732,0.00027441065,0.98108476,0.0028088177,0.0009561905,0.011721634,0.00025310274],"about_ca_topic_score_codex":0.0000037355876,"about_ca_topic_score_gemma":3.6214138e-7,"teacher_disagreement_score":0.74172324,"about_ca_system_score_codex":0.000012134344,"about_ca_system_score_gemma":0.00009868563,"threshold_uncertainty_score":0.39662832},"labels":[],"label_agreement":null},{"id":"W3111238704","doi":"10.48550/arxiv.2012.04553","title":"Pattern Morphing for Efficient Graph Mining","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Theory 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":"Simon Fraser University","funders":"","keywords":"Morphing; Computer science; Graph; Theoretical computer science; Artificial intelligence","score_opus":0.0782806409862616,"score_gpt":0.18577021616653705,"score_spread":0.10748957518027545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111238704","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.18856387,0.000032188353,0.8094704,0.00019506211,0.0008242213,0.00030049542,0.00002688513,0.00027620856,0.00031063808],"genre_scores_gemma":[0.9931399,0.000012709885,0.0063015036,0.0002574581,0.00010876032,0.000002521807,0.000015327014,0.00002052708,0.00014129309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797326,0.00010222645,0.00019112873,0.0012459431,0.00008675367,0.00040068536],"domain_scores_gemma":[0.9984328,0.00018114841,0.0002233131,0.00085639715,0.00010147962,0.00020486776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002910416,0.0003170267,0.00032829662,0.00025489385,0.0002448519,0.00016082996,0.0020505502,0.00018584805,0.000008618332],"category_scores_gemma":[0.000032361208,0.00036984019,0.00039664068,0.00054435077,0.000079660815,0.00015398134,0.0017469076,0.00038968463,0.000027688196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038189948,0.00014498603,0.0009759577,0.00026567496,0.00021948696,0.0005696476,0.0020479835,0.6068597,0.00012791602,0.3808272,0.00035188248,0.007571362],"study_design_scores_gemma":[0.00043439204,0.000058527687,0.00020755047,0.000096809345,0.00005255214,0.0000032423652,0.00012634942,0.8846857,0.00020593163,0.11351451,0.00017186775,0.00044257514],"about_ca_topic_score_codex":0.000018329394,"about_ca_topic_score_gemma":0.0000028176391,"teacher_disagreement_score":0.80457604,"about_ca_system_score_codex":0.000056526576,"about_ca_system_score_gemma":0.00008045811,"threshold_uncertainty_score":0.99987537},"labels":[],"label_agreement":null},{"id":"W3112520120","doi":"10.1145/3434642","title":"The future is big graphs","year":2021,"lang":"en","type":"article","venue":"Communications of the ACM","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":152,"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 British Columbia; University of Waterloo","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Computer science; Big data; Data mining","score_opus":0.026247511967339796,"score_gpt":0.2651093371293197,"score_spread":0.23886182516197993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112520120","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01232653,0.028258633,0.0038492868,0.9436155,0.0017912136,0.00020437149,0.000015422489,0.000088890476,0.009850174],"genre_scores_gemma":[0.81751865,0.0047077984,0.17370005,0.0025915815,0.000072375944,0.000030358078,0.0000033383797,0.000010140008,0.0013656891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993137,0.00025483198,0.00012861702,0.00009719501,0.000110837864,0.000094785406],"domain_scores_gemma":[0.95916003,0.00037190577,0.000077998695,0.040241886,0.000128503,0.000019658615],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00030328016,0.000051996776,0.00005993617,0.000018805204,0.0007636145,0.00006786056,0.04318247,0.000025820083,0.0000029295256],"category_scores_gemma":[0.0007207502,0.000029695193,0.00011964622,0.00068404566,0.00023406176,0.00007562473,0.021874534,0.00016458986,0.000010475208],"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":[5.7190005e-7,0.00004538101,0.00024022761,0.0000020256816,0.000024686631,1.5175958e-7,0.0007538539,0.0000018588702,0.00055305904,0.9490302,0.01289265,0.03645531],"study_design_scores_gemma":[0.000055360255,0.0000039856463,0.0023805357,0.000010147365,0.0000056013178,0.0000063167668,0.00023131921,0.00033996,0.005426652,0.88275325,0.108743794,0.000043086322],"about_ca_topic_score_codex":0.0000028770326,"about_ca_topic_score_gemma":0.000022757478,"teacher_disagreement_score":0.9410239,"about_ca_system_score_codex":0.0000046438527,"about_ca_system_score_gemma":0.000053564323,"threshold_uncertainty_score":0.98603636},"labels":[],"label_agreement":null},{"id":"W3112998129","doi":"10.1145/3257190","title":"Session details: Graph Processing Applications","year":2017,"lang":"en","type":"article","venue":"","topic":"Graph Theory 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":"University of Waterloo","funders":"","keywords":"Computer science; Session (web analytics); World Wide Web","score_opus":0.019387886184844657,"score_gpt":0.2790245632546558,"score_spread":0.25963667706981114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112998129","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.0016577436,0.000052861953,0.9724191,0.0005354086,0.00006693401,0.00008549714,2.394983e-7,0.00015989009,0.02502234],"genre_scores_gemma":[0.9199781,0.000004818596,0.07899861,0.00013843758,0.00003987708,0.000036643734,3.878317e-7,0.0000030592419,0.00080009183],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948925,0.0000128032325,0.00007585556,0.00020314014,0.00009249245,0.00012645508],"domain_scores_gemma":[0.99909526,0.000012183894,0.0000734038,0.00072336994,0.000040868967,0.000054922817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001559326,0.000058532623,0.00005435946,0.000041591462,0.001002858,0.00048698593,0.0011249224,0.000025338684,0.000010652377],"category_scores_gemma":[0.000008722483,0.000044502638,0.000033556942,0.00008691549,0.00006143389,0.0008313764,0.0001862369,0.000054568423,0.00005933495],"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":[4.3941242e-7,0.0000286264,0.0005614199,0.0000068577538,0.0000020750622,0.0000014896377,0.00008283392,0.0000030153249,0.00055517413,0.37672547,0.00007367203,0.6219589],"study_design_scores_gemma":[0.00032373008,0.000029170596,0.012840838,0.000042984582,0.0000068374006,0.000020202073,0.00007186501,0.03542685,0.011549032,0.9254882,0.013853155,0.00034714944],"about_ca_topic_score_codex":0.0000033376489,"about_ca_topic_score_gemma":0.0000018143144,"teacher_disagreement_score":0.91832036,"about_ca_system_score_codex":0.0000030098165,"about_ca_system_score_gemma":0.000019248455,"threshold_uncertainty_score":0.7713275},"labels":[],"label_agreement":null},{"id":"W3116457585","doi":"10.14778/3184470.3184473","title":"Distributed evaluation of subgraph queries using worst-case optimal low-memory dataflows","year":2018,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":70,"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":"Dataflow; Computer science; Computation; Memory footprint; Joins; Massively parallel; Graph; Parallel computing; Theoretical computer science; Distributed computing; Algorithm","score_opus":0.03065908720145722,"score_gpt":0.27186278200001407,"score_spread":0.24120369479855686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116457585","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.98613364,0.00008773525,0.012356245,0.000111252804,0.00039636865,0.00045277833,0.000035123343,0.000042837142,0.00038399763],"genre_scores_gemma":[0.98560834,0.000003871512,0.014248506,0.000026869846,0.00007127653,0.000019624753,0.0000024565963,0.000007867031,0.00001118666],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983817,0.000035348367,0.00036556873,0.0003188536,0.0006482508,0.000250301],"domain_scores_gemma":[0.998414,0.00003438453,0.00038440115,0.0003204366,0.00078540726,0.000061384664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015750446,0.00016035767,0.0001999588,0.00012113631,0.00022023726,0.000068327536,0.00092900306,0.000045620254,0.000020900527],"category_scores_gemma":[0.00014801974,0.00011771552,0.000118366515,0.0007308742,0.00033408141,0.00062423415,0.0005400721,0.000092781665,0.0000021552642],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00046898215,0.0020768119,0.006718559,0.00089523976,0.00079708116,0.000026470825,0.02174058,0.0044213226,0.6214676,0.2684966,0.0018572331,0.07103355],"study_design_scores_gemma":[0.0010403418,0.00021481366,0.0007748189,0.00023167336,0.0001559275,0.00021844373,0.0010272999,0.20445865,0.77310735,0.018426128,0.00007391285,0.00027063125],"about_ca_topic_score_codex":0.00004552956,"about_ca_topic_score_gemma":0.0000027716414,"teacher_disagreement_score":0.25007048,"about_ca_system_score_codex":0.00005499443,"about_ca_system_score_gemma":0.00006536766,"threshold_uncertainty_score":0.48002994},"labels":[],"label_agreement":null},{"id":"W3118048383","doi":"","title":"IDENTIFICATION OF MULTISCALE STATE-SPACE MODELS FROM INPUT-OUTPUT DATA","year":2015,"lang":"en","type":"article","venue":"Mechatronic systems and control","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Identification (biology); State space; State (computer science); Computer science; Space (punctuation); System identification; Artificial intelligence; Mathematics; Data mining; Algorithm; Statistics","score_opus":0.035314671335861685,"score_gpt":0.23829875484416543,"score_spread":0.20298408350830374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118048383","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.03045755,0.005184754,0.9629951,0.00016393598,0.0006318651,0.00029457652,0.0001663158,0.000061516745,0.000044383665],"genre_scores_gemma":[0.9984101,0.000025204514,0.001207795,0.000019374946,0.000062760875,0.0000215934,0.0000147948385,0.000007700754,0.0002306466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985172,0.00018800884,0.00037327214,0.00043963065,0.00027585105,0.00020601651],"domain_scores_gemma":[0.9983149,0.00007339394,0.00023370948,0.001146565,0.00010815503,0.00012324228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010927882,0.00012546011,0.00028059343,0.00006430107,0.000055753866,0.00015185788,0.0009292548,0.000054388493,6.156946e-7],"category_scores_gemma":[0.000027608943,0.00010619593,0.000031327007,0.00011947777,0.000037105685,0.00081868295,0.00022664302,0.00007547432,0.000008975102],"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.00016480932,0.00034908872,0.00047951742,0.00015233144,0.00055367016,0.0000254042,0.007811426,0.035409696,0.016743468,0.78533113,0.0010332676,0.1519462],"study_design_scores_gemma":[0.0013656121,0.000046190267,0.00007112262,0.000026223635,0.000019692365,0.0000042260444,0.00028451945,0.95563155,0.0005313777,0.04154414,0.00035571033,0.00011963063],"about_ca_topic_score_codex":0.00074628927,"about_ca_topic_score_gemma":0.000018977318,"teacher_disagreement_score":0.9679526,"about_ca_system_score_codex":0.000021003829,"about_ca_system_score_gemma":0.000079234414,"threshold_uncertainty_score":0.43305442},"labels":[],"label_agreement":null},{"id":"W3118976965","doi":"10.1109/icievicivpr48672.2020.9306543","title":"New Graph Embedding Approach for 3D Protein Shape Classification","year":2020,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Embedding; Artificial intelligence; Graph; Pattern recognition (psychology); Theoretical computer science","score_opus":0.04673221061454495,"score_gpt":0.26034833825634396,"score_spread":0.213616127641799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118976965","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.00044147612,0.00003077422,0.9935425,0.0016530972,0.000047849877,0.00044819835,8.8262783e-7,0.00026037724,0.0035748763],"genre_scores_gemma":[0.10959934,9.349629e-7,0.8893988,0.00054731494,0.000102124846,0.000058837708,0.000004437874,0.0000062296854,0.0002819832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920535,0.000027477623,0.00013103045,0.00035156088,0.00011401341,0.0001705577],"domain_scores_gemma":[0.99955106,0.000024067716,0.000045186334,0.0002131184,0.00003205782,0.00013452303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015612254,0.00008962221,0.00008995855,0.000042033218,0.000102159036,0.00012197551,0.00055156415,0.000039271672,0.000024812685],"category_scores_gemma":[0.000017917953,0.00007628354,0.00006918993,0.00039545938,0.000013993148,0.00033928052,0.00006808417,0.0000662473,0.000017266293],"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.0000075836497,0.000020439427,0.0000081869475,0.0000184336,0.000007636567,3.500157e-7,0.00044794485,0.00007437377,0.006903525,0.7954952,0.001299,0.1957173],"study_design_scores_gemma":[0.00024537143,0.00007207103,0.00004176082,0.000003466408,0.0000020358175,0.0000011226263,0.000058774123,0.9659818,0.003157359,0.026662001,0.0036468387,0.00012743933],"about_ca_topic_score_codex":0.000001394465,"about_ca_topic_score_gemma":5.585651e-8,"teacher_disagreement_score":0.9659074,"about_ca_system_score_codex":0.0000048672528,"about_ca_system_score_gemma":0.000025693935,"threshold_uncertainty_score":0.31107527},"labels":[],"label_agreement":null},{"id":"W3121853425","doi":"","title":"Comparison of Matrix Dimensionality Reduction Methods in Uncovering Latent Structures in the Data","year":2010,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Graph Theory 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":"St. Francis Xavier University","funders":"","keywords":"Singular value decomposition; Dimensionality reduction; Curse of dimensionality; Matrix (chemical analysis); Computer science; Decomposition; Reduction (mathematics); Data mining; Latent variable; Pattern recognition (psychology); Matrix decomposition; Algorithm; Artificial intelligence; Mathematics; Physics; Eigenvalues and eigenvectors; Materials science; Chemistry","score_opus":0.03462359579139276,"score_gpt":0.3895604652239113,"score_spread":0.35493686943251856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121853425","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.80983,0.00078129006,0.18821646,0.0005029763,0.0005500584,0.00007687976,0.0000011383978,0.000008720587,0.000032471078],"genre_scores_gemma":[0.9665322,0.00007347295,0.0333068,0.000010577478,0.00006274035,8.600256e-7,0.0000019518086,0.000003303829,0.000008132952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981143,0.0004728042,0.00034098508,0.00020156929,0.00022889454,0.0006414792],"domain_scores_gemma":[0.9991265,0.00012117932,0.00017020608,0.00053084485,0.000028608325,0.000022683222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075412425,0.00008535913,0.00015997046,0.00012660229,0.00009129512,0.000049296366,0.0014315539,0.000049358976,0.000003770858],"category_scores_gemma":[0.00007410954,0.000057700305,0.000039157952,0.00039782352,0.00004568092,0.00039357785,0.00018622937,0.0020454663,5.5634047e-7],"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.000020919915,0.00010382729,0.004850902,0.0000047677245,0.00002119129,0.0000021762487,0.00080774503,0.0015762077,0.020538574,0.9096053,0.000008572105,0.062459815],"study_design_scores_gemma":[0.00026155362,0.00006728758,0.013315499,0.000009548913,0.0000053999374,0.00032887474,0.0006304263,0.013667941,0.0021948346,0.96935666,0.00008119391,0.000080789905],"about_ca_topic_score_codex":0.00008969593,"about_ca_topic_score_gemma":0.00046292902,"teacher_disagreement_score":0.15670216,"about_ca_system_score_codex":0.00006958926,"about_ca_system_score_gemma":0.00036050862,"threshold_uncertainty_score":0.8886647},"labels":[],"label_agreement":null},{"id":"W3137936197","doi":"10.1109/bigdata50022.2020.9378430","title":"HyGN: Hybrid Graph Engine for NUMA","year":2020,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Asynchronous communication; Parallel computing; Shared memory; Distributed computing; Exploit; Graph; Distributed memory; Memory architecture; Computation; Computer architecture; Theoretical computer science; Programming language; Computer network","score_opus":0.018235833187079668,"score_gpt":0.214320342089083,"score_spread":0.19608450890200332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137936197","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.002700769,0.000035966106,0.98992807,0.00474737,0.00025548151,0.00011039976,0.0000039543224,0.00025668094,0.001961301],"genre_scores_gemma":[0.83634436,0.0000037078719,0.1589107,0.004235016,0.00016302952,0.000019373982,0.000003117145,0.0000073574593,0.00031334875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994352,0.000012811107,0.00008988368,0.00022254606,0.00007671932,0.00016282381],"domain_scores_gemma":[0.999605,0.00005603795,0.000017726257,0.00018456596,0.000029491295,0.00010718846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009612515,0.00007331094,0.000084195395,0.000028719154,0.00006454243,0.000057277666,0.00050421443,0.000012558296,0.00003707251],"category_scores_gemma":[0.00002224803,0.00006099856,0.0000839106,0.00021265165,0.000016081405,0.0001986444,0.00007551017,0.000044327266,0.00005589027],"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.0000073229917,0.000029975314,0.00002142752,0.000014601763,0.000016794744,0.000010351507,0.0002899122,0.00011343103,0.00040776166,0.93081117,0.0081998,0.060077477],"study_design_scores_gemma":[0.0009360635,0.00053395267,0.00009045141,0.0000067728924,0.000007809923,0.000014356561,0.00004379883,0.45500633,0.05089508,0.43868247,0.05337616,0.00040676733],"about_ca_topic_score_codex":7.884562e-7,"about_ca_topic_score_gemma":1.2796617e-7,"teacher_disagreement_score":0.83364356,"about_ca_system_score_codex":0.0000019333813,"about_ca_system_score_gemma":0.000009320904,"threshold_uncertainty_score":0.2487449},"labels":[],"label_agreement":null},{"id":"W3147470673","doi":"","title":"Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II","year":2010,"lang":"en","type":"article","venue":"International Conference on Algorithms and Architectures for Parallel Processing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Volume (thermodynamics); Computer science; Parallel computing; Physics","score_opus":0.028480433499606203,"score_gpt":0.2864301674948208,"score_spread":0.2579497339952146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3147470673","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.6706244,0.0002773416,0.292776,0.021147365,0.002612019,0.0028547226,0.0004615209,0.00037587795,0.008870783],"genre_scores_gemma":[0.8900867,0.00002119302,0.10769598,0.00063523214,0.00052099355,0.0003174488,0.000018355877,0.000040329036,0.00066378183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684566,0.000032836764,0.0006537821,0.0011131386,0.000763222,0.0005913653],"domain_scores_gemma":[0.9979262,0.0001474324,0.00061249477,0.0002874609,0.00081389566,0.0002125402],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058465777,0.0005636146,0.00047064264,0.00035932483,0.0009435678,0.0008235293,0.0018824837,0.00020634528,0.000036950434],"category_scores_gemma":[0.00021749592,0.00040939022,0.00021152581,0.00022658898,0.00065721123,0.00023417683,0.0005052037,0.0007522042,0.0000011218964],"study_design_candidate":"design_other","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.0005506673,0.0003892851,0.00054331037,0.00026146095,0.00016306325,0.0000033985807,0.004690263,0.0010121283,0.003815021,0.26948547,0.00018887657,0.71889704],"study_design_scores_gemma":[0.0020713739,0.0006999542,0.0022467293,0.00054198346,0.00003415112,0.00011945748,0.00038254593,0.71352726,0.0018814814,0.2747893,0.0030225192,0.00068322517],"about_ca_topic_score_codex":0.000011852302,"about_ca_topic_score_gemma":0.000018583307,"teacher_disagreement_score":0.7182138,"about_ca_system_score_codex":0.000027765082,"about_ca_system_score_gemma":0.00020319357,"threshold_uncertainty_score":0.9998358},"labels":[],"label_agreement":null},{"id":"W3155426438","doi":"10.1007/s41019-021-00156-2","title":"A Workload-Adaptive Streaming Partitioner for Distributed Graph Stores","year":2021,"lang":"en","type":"article","venue":"Data Science and Engineering","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Exploit; Workload; Graph traversal; Graph; Tree traversal; Latency (audio); Theoretical computer science; Distributed computing; Operating system; Algorithm","score_opus":0.026221650197992386,"score_gpt":0.23748156179220617,"score_spread":0.21125991159421378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155426438","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.01629318,0.00030556225,0.9826739,0.00013609741,0.0002573034,0.00005419837,0.00017693522,0.00007597521,0.00002686814],"genre_scores_gemma":[0.9007758,0.000044968107,0.0989461,0.00006303794,0.000060124683,0.000015850514,0.00008147783,0.000004535519,0.000008117374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904853,0.000006479405,0.00008655414,0.000418012,0.00018002784,0.0002604252],"domain_scores_gemma":[0.9991845,0.00007668322,0.000018669198,0.00052209815,0.00010210984,0.00009597628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005023404,0.00007682752,0.0000780118,0.00007822841,0.00023753737,0.00025932977,0.0007196992,0.000017217297,0.0000016361417],"category_scores_gemma":[0.0001975615,0.00007187761,0.000014461297,0.0008995446,0.00009278141,0.0017077824,0.0004523599,0.000055071378,0.0000010677461],"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.0000099825675,0.000119551034,0.00034391388,0.00007947017,0.000059258793,0.00008339995,0.000995478,0.009546425,0.048605196,0.77879107,0.001455919,0.15991037],"study_design_scores_gemma":[0.000245792,0.000036229416,0.0030402972,0.00008135838,0.000009530792,0.00002938597,0.0002111498,0.9783466,0.0068608453,0.0057073846,0.005157685,0.00027375444],"about_ca_topic_score_codex":0.0000024955064,"about_ca_topic_score_gemma":0.0000014847519,"teacher_disagreement_score":0.9688002,"about_ca_system_score_codex":0.000012097886,"about_ca_system_score_gemma":0.00006729442,"threshold_uncertainty_score":0.29310837},"labels":[],"label_agreement":null},{"id":"W3155541767","doi":"10.1155/2021/5598173","title":"On Solving the Decycling Problem in a Torus Network","year":2021,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science; Memorial University of Newfoundland","keywords":"Computer science; Torus; Mathematics; Geometry","score_opus":0.014389800728405747,"score_gpt":0.2581460638869767,"score_spread":0.24375626315857096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3155541767","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.51982665,0.010342102,0.4626379,0.0018958871,0.0003040182,0.00047671777,0.0000011668928,0.00021234076,0.0043032435],"genre_scores_gemma":[0.9433317,0.00043150948,0.055811837,0.00033001153,0.000032409367,0.00003359779,0.0000025276638,0.0000068758145,0.000019523535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882174,0.00033067807,0.00025163076,0.00024922454,0.000091605805,0.00025513335],"domain_scores_gemma":[0.997411,0.0010904889,0.000086055574,0.001314185,0.000057225145,0.000041050298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000746094,0.00010292278,0.00013869295,0.000041263807,0.00081241946,0.00021783898,0.0011229134,0.000036882742,0.0000014689036],"category_scores_gemma":[0.000020207515,0.000084789564,0.000042328407,0.00057158805,0.00008811438,0.000113384034,0.0013390919,0.00032037226,0.0000027282667],"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.000001267434,0.00009652634,0.00071871746,0.000009877429,0.000010767546,0.0000063312596,0.0026394832,0.01311878,0.00012608033,0.53485644,0.000021600481,0.44839412],"study_design_scores_gemma":[0.00025768927,0.000037592126,0.0010928838,0.00030284157,0.000003887806,0.00003045812,0.0004968931,0.95694965,0.00009265233,0.03769162,0.002863323,0.00018051582],"about_ca_topic_score_codex":0.000016518788,"about_ca_topic_score_gemma":0.000035426066,"teacher_disagreement_score":0.94383085,"about_ca_system_score_codex":0.000018258259,"about_ca_system_score_gemma":0.000043966684,"threshold_uncertainty_score":0.6248556},"labels":[],"label_agreement":null},{"id":"W3158280780","doi":"10.1109/ispass51385.2021.00023","title":"How Do Graph Relabeling Algorithms Improve Memory Locality?","year":2021,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Queen's University","keywords":"Computer science; Locality; Graph; Algorithm; Theoretical computer science","score_opus":0.01097245613410826,"score_gpt":0.21783165945676147,"score_spread":0.2068592033226532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158280780","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.0037251497,0.0007387639,0.9844419,0.0032796925,0.0014163959,0.00009276966,0.000003551588,0.00035822552,0.0059435726],"genre_scores_gemma":[0.4352618,0.000138429,0.5316798,0.0033861112,0.00044980002,0.000036117955,0.000010506598,0.000041558967,0.028995872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821377,0.00014519722,0.0002067905,0.00068007066,0.00033271147,0.00042144116],"domain_scores_gemma":[0.9984756,0.00011486142,0.0000647824,0.00096817303,0.00020185363,0.00017471988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005244889,0.00019330176,0.00021032608,0.00009919231,0.00021295526,0.00064520957,0.0007679354,0.00009906444,0.00004490028],"category_scores_gemma":[0.000074816184,0.00016908869,0.0001749272,0.0008689053,0.00008220448,0.00082951353,0.00040606462,0.00025425298,0.000050225124],"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.0000025028999,0.00012150788,0.000042021908,0.000023830446,0.00005930293,0.0002920398,0.00044172985,0.00004834565,0.006631359,0.656511,0.00046539356,0.33536094],"study_design_scores_gemma":[0.0013417999,0.00016402543,0.0001432739,0.00006136516,0.000033056545,0.00024017473,0.0015257284,0.07158807,0.24900125,0.6652487,0.009541329,0.0011112525],"about_ca_topic_score_codex":0.000008760325,"about_ca_topic_score_gemma":0.0000033944934,"teacher_disagreement_score":0.45276207,"about_ca_system_score_codex":0.00001784375,"about_ca_system_score_gemma":0.00008241101,"threshold_uncertainty_score":0.6895237},"labels":[],"label_agreement":null},{"id":"W3166524313","doi":"10.1145/3446980","title":"Optimizing One-time and Continuous Subgraph Queries using Worst-case Optimal Joins","year":2021,"lang":"en","type":"article","venue":"ACM Transactions on Database Systems","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":39,"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":"Computer science; Joins; Query plan; Query optimization; Spatial query; Vertex (graph theory); Computation; Theoretical computer science; Graph; Sargable; Algorithm; Database; Web search query; Search engine; Information retrieval","score_opus":0.03081097010833498,"score_gpt":0.24837275789465005,"score_spread":0.21756178778631508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166524313","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.10831484,0.00076961884,0.8892211,0.00014625039,0.0006534746,0.00022803988,0.0003627335,0.00022473774,0.000079233934],"genre_scores_gemma":[0.71295655,0.000095259566,0.28636277,0.00009397152,0.00007702625,0.00003515057,0.000041289048,0.000031882682,0.00030607937],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797666,0.00031632895,0.00038016395,0.00067082455,0.00026308215,0.00039296746],"domain_scores_gemma":[0.9978201,0.00027716413,0.000106171356,0.0014689871,0.0001176569,0.00020991277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047324187,0.0002602813,0.000370788,0.0002523635,0.0006795399,0.00046421264,0.0004497603,0.000086330816,0.000038078488],"category_scores_gemma":[0.00004116816,0.0002724144,0.00012001678,0.00071717706,0.00012355852,0.0010392133,0.000063515916,0.0002886171,0.000024964],"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.00057523226,0.0059473417,0.00029174425,0.0021662991,0.0040434874,0.061251465,0.023373138,0.27235684,0.33331475,0.15568367,0.0005319668,0.14046405],"study_design_scores_gemma":[0.0039643953,0.0005440626,0.000043521544,0.0020166321,0.00051410496,0.04488315,0.0068621775,0.8578889,0.07536444,0.00086952775,0.004284169,0.002764938],"about_ca_topic_score_codex":0.00024085597,"about_ca_topic_score_gemma":0.00003325362,"teacher_disagreement_score":0.60464174,"about_ca_system_score_codex":0.00003210181,"about_ca_system_score_gemma":0.00008976243,"threshold_uncertainty_score":0.9999728},"labels":[],"label_agreement":null},{"id":"W3166986506","doi":"10.1145/3469379.3469381","title":"A Deeper Dive into Pattern-Aware Subgraph Exploration with PEREGRINE","year":2021,"lang":"en","type":"article","venue":"ACM SIGOPS Operating Systems Review","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scalability; Graph; Reuse; Theoretical computer science; Computation; Semantics (computer science); Key (lock); Pattern matching; Data mining; Artificial intelligence; Algorithm; Programming language; Database","score_opus":0.022571235203088267,"score_gpt":0.26126243679026423,"score_spread":0.23869120158717597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166986506","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.010983776,0.1380815,0.84465283,0.0036078596,0.0008025646,0.001225516,0.000007294898,0.00034744194,0.000291218],"genre_scores_gemma":[0.95697784,0.011561243,0.026556207,0.003173715,0.00032867643,0.000722557,0.00008328032,0.000056741388,0.0005397281],"study_design_codex":"design_other","study_design_gemma":"systematic_review","domain_scores_codex":[0.99739736,0.0006601092,0.00055066106,0.0006721431,0.00041164138,0.00030810628],"domain_scores_gemma":[0.9975293,0.0001570952,0.00018601927,0.001498584,0.0005007169,0.00012824747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080445054,0.0002924699,0.0005497061,0.00005853221,0.00036910453,0.00049470284,0.0009834968,0.000058625927,0.000030731928],"category_scores_gemma":[0.00026904963,0.00020914132,0.000118519034,0.000899501,0.000037253598,0.0010884751,0.00040331986,0.00021295898,0.000086516004],"study_design_candidate":"design_other","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.000012801704,0.00082317175,0.023351045,0.043896247,0.0010447049,0.002990082,0.024387205,0.002678453,0.005390005,0.14354436,0.00665956,0.7452224],"study_design_scores_gemma":[0.014389263,0.0063417032,0.008193237,0.5039779,0.0021389367,0.017129568,0.024532847,0.17832065,0.0281394,0.026946856,0.16765237,0.022237305],"about_ca_topic_score_codex":0.000087134795,"about_ca_topic_score_gemma":0.000042720985,"teacher_disagreement_score":0.9459941,"about_ca_system_score_codex":0.000033736644,"about_ca_system_score_gemma":0.00011367892,"threshold_uncertainty_score":0.85285354},"labels":[],"label_agreement":null},{"id":"W3173160514","doi":"10.1145/3461837.3464514","title":"Position paper","year":2021,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"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 British Columbia","funders":"","keywords":"Computer science; Analytics; Graph; Audit; Graph database; Position paper; Data science; Theoretical computer science; World Wide Web","score_opus":0.005781225186015286,"score_gpt":0.20367089835994043,"score_spread":0.19788967317392514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173160514","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.0045833974,0.00004929543,0.92387605,0.0027153601,0.00019509227,0.0000104536875,1.7127684e-7,0.0000983038,0.06847185],"genre_scores_gemma":[0.8844545,0.0000051742436,0.10502443,0.0054804836,0.00004017137,0.0000018829679,0.0000017180442,0.0000018833667,0.0049897614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997494,0.000020492871,0.00003208562,0.000093317845,0.000047004007,0.000057661768],"domain_scores_gemma":[0.99977916,0.000012176108,0.00000462363,0.0001595272,0.000023557432,0.0000209562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004400002,0.000022157685,0.00002270894,0.00000964561,0.000035643712,0.000047716578,0.000109687826,0.000010429466,0.00021918232],"category_scores_gemma":[0.0000034366049,0.000018606132,0.000020803232,0.00012902786,0.0000052265673,0.00023374187,0.000049168062,0.000021247837,0.00012455185],"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":[1.1953438e-7,0.000012205536,0.000013405646,4.8836205e-7,0.0000016316098,0.000024031906,0.00004161135,0.0000020825016,0.0054808273,0.97466034,0.00033170532,0.019431537],"study_design_scores_gemma":[0.00019617121,0.000028316214,0.003548402,0.0000063663992,0.0000021842395,0.00014457236,0.000045220822,0.0073603657,0.12910222,0.84282005,0.016587742,0.00015840691],"about_ca_topic_score_codex":6.468333e-7,"about_ca_topic_score_gemma":6.534677e-7,"teacher_disagreement_score":0.8798711,"about_ca_system_score_codex":0.0000020894856,"about_ca_system_score_gemma":0.000010197961,"threshold_uncertainty_score":0.23998927},"labels":[],"label_agreement":null},{"id":"W3174162781","doi":"10.1145/3461837.3464515","title":"R2GSync and edge views","year":2021,"lang":"en","type":"article","venue":"","topic":"Graph Theory 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":"University of Waterloo","funders":"","keywords":"Computer science; Relational database management system; Joins; sync; Graph; Relational database; Synchronization (alternating current); Enhanced Data Rates for GSM Evolution; Theoretical computer science; Join (topology); Set (abstract data type); Database; Information retrieval; Programming language; Computer network; Artificial intelligence","score_opus":0.01905194193986144,"score_gpt":0.23701077359537046,"score_spread":0.217958831655509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174162781","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.01997225,0.0008507646,0.9097765,0.0014988146,0.00033716555,0.000032429678,4.0112397e-7,0.00011367297,0.067417994],"genre_scores_gemma":[0.7481772,0.000116202245,0.22900932,0.004198016,0.00009864496,0.0000063724196,0.0000012966506,0.0000062371514,0.018386738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964905,0.000030420824,0.000050214312,0.00014667884,0.000043463388,0.00008016541],"domain_scores_gemma":[0.9997043,0.000025925829,0.0000078819985,0.00020121936,0.000018872028,0.000041824773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009828806,0.000036545534,0.000049617192,0.000014584988,0.00004633841,0.0000701918,0.00013458778,0.000013370539,0.00006615121],"category_scores_gemma":[0.000008650843,0.000029025576,0.00001876135,0.00014349338,0.000016062771,0.00014591456,0.00013386969,0.000031453386,0.000051523413],"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":[1.5947833e-7,0.000014478712,0.000114888426,0.000002790296,0.000002908761,0.000025974043,0.00016685475,3.625185e-7,0.00079625665,0.8784786,0.0007546603,0.1196421],"study_design_scores_gemma":[0.00055905577,0.00007094973,0.007887068,0.000022474074,0.0000066579905,0.00032609334,0.00015603809,0.019059349,0.068212844,0.6495869,0.25366464,0.00044791255],"about_ca_topic_score_codex":7.8551824e-7,"about_ca_topic_score_gemma":0.0000021960414,"teacher_disagreement_score":0.7282049,"about_ca_system_score_codex":0.0000012849115,"about_ca_system_score_gemma":0.000011871612,"threshold_uncertainty_score":0.11836287},"labels":[],"label_agreement":null},{"id":"W3176395835","doi":"10.1145/3461837.3464516","title":"LSQB","year":2021,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":22,"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":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Commission","keywords":"Computer science; Benchmark (surveying); Scalability; Joins; Subgraph isomorphism problem; Matching (statistics); Petascale computing; Vertex (graph theory); Graph; Base (topology); Theoretical computer science; Database; Programming language; Mathematics","score_opus":0.006652524227814221,"score_gpt":0.20095670297332197,"score_spread":0.19430417874550773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176395835","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.0033363034,0.000050942763,0.902019,0.00095041894,0.00021537578,0.000006949627,9.2680004e-8,0.0000985162,0.09332238],"genre_scores_gemma":[0.77480865,0.0000051947018,0.20645145,0.002237334,0.00004337004,0.0000016551465,5.476716e-7,0.0000021314497,0.01644968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997438,0.000016348582,0.000031256106,0.0000969683,0.00004598,0.00006561222],"domain_scores_gemma":[0.9997306,0.000016229194,0.0000043314217,0.0002030376,0.00002083032,0.00002496677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000510999,0.000021858832,0.000025514708,0.000010182016,0.000029554922,0.000045134402,0.0001787792,0.000008632686,0.00014074713],"category_scores_gemma":[0.000006871869,0.000018086763,0.000020990714,0.00016481383,0.0000063676516,0.00011433119,0.000081728904,0.000022397575,0.00016971663],"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":[5.142173e-8,0.000008980489,0.000032524084,4.209241e-7,0.0000014403591,0.000026833926,0.000041852974,0.0000016992972,0.0005117443,0.97161347,0.00044708065,0.027313914],"study_design_scores_gemma":[0.00019716503,0.000020892396,0.0018170924,0.000004372443,0.0000014230947,0.000100320656,0.000059654863,0.015494214,0.12362528,0.80456305,0.053941846,0.00017469442],"about_ca_topic_score_codex":4.94849e-7,"about_ca_topic_score_gemma":5.528659e-7,"teacher_disagreement_score":0.77147233,"about_ca_system_score_codex":0.00000129505,"about_ca_system_score_gemma":0.0000141308665,"threshold_uncertainty_score":0.21814205},"labels":[],"label_agreement":null},{"id":"W3176427671","doi":"10.1145/3448016.3457331","title":"Efficient Graph Summarization using Weighted LSH at Billion-Scale","year":2021,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":23,"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 Victoria","funders":"","keywords":"Automatic summarization; Speedup; Computer science; Scalability; Theoretical computer science; Graph; Algorithm; Computation; Parallel computing; Artificial intelligence","score_opus":0.011882525272969796,"score_gpt":0.2195797201669366,"score_spread":0.20769719489396682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176427671","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.29957417,0.00007082367,0.6974076,0.00016319894,0.0004585852,0.000046257126,0.0000013803639,0.00012396385,0.0021540446],"genre_scores_gemma":[0.84912217,0.000012575354,0.14796089,0.00050016074,0.00006240944,0.0000038484436,0.000015542353,0.000012118651,0.0023102576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989898,0.00008954473,0.00015427177,0.00034483158,0.00021081649,0.00021073944],"domain_scores_gemma":[0.99930894,0.000046438156,0.000041796287,0.00039514233,0.0001279625,0.00007970544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017262786,0.00009757886,0.00009920644,0.00011154485,0.00025166332,0.00010046534,0.00026025748,0.000047944744,0.00012562393],"category_scores_gemma":[0.000008454422,0.00008216619,0.00007859194,0.0011827511,0.000036641864,0.000103866914,0.00027014877,0.00005638535,0.000047262296],"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.000015543752,0.00068936474,0.009314221,0.0000416207,0.00007497972,0.00018635532,0.0017929982,0.025863418,0.11365256,0.8180726,0.00079834374,0.029497953],"study_design_scores_gemma":[0.00033072892,0.000020600726,0.0011206667,0.000021086287,0.0000092898845,0.000056649154,0.00005554284,0.8847354,0.09166311,0.02076619,0.0009612099,0.00025954208],"about_ca_topic_score_codex":0.0000063524562,"about_ca_topic_score_gemma":0.00000562283,"teacher_disagreement_score":0.858872,"about_ca_system_score_codex":0.00002885233,"about_ca_system_score_gemma":0.00003570487,"threshold_uncertainty_score":0.335064},"labels":[],"label_agreement":null},{"id":"W3180260566","doi":"","title":"Controlling Memory Footprint of Stateful Streaming Graph Processing","year":2021,"lang":"en","type":"article","venue":"USENIX Annual Technical Conference","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Stateful firewall; Computer science; Memory footprint; Footprint; Graph; Parallel computing; Operating system; Theoretical computer science; Computer network; Geology","score_opus":0.017656542218749897,"score_gpt":0.2544506504079583,"score_spread":0.23679410818920837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180260566","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.10395159,0.00032679748,0.89200586,0.00034135202,0.00014282177,0.00015428408,0.000021596872,0.00035794196,0.0026977845],"genre_scores_gemma":[0.9493029,0.000026184152,0.050438385,0.0000819528,0.00002723532,0.000012437611,0.0000032030996,0.000010292196,0.0000973892],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99801946,0.00014274608,0.00049000775,0.00056783226,0.00038248434,0.0003974627],"domain_scores_gemma":[0.99816734,0.0002146846,0.00019465953,0.00062112365,0.0006554174,0.0001468022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046726989,0.00020703928,0.0003886138,0.00012315766,0.0001396874,0.00014378672,0.00090958783,0.00012287866,0.000018544602],"category_scores_gemma":[0.00022644732,0.00019212668,0.0001476583,0.0006943118,0.00021430654,0.00037202847,0.00045268235,0.000345826,0.00000479799],"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.000034311317,0.00034714423,0.00028597662,0.00012538822,0.0000417234,0.0002141269,0.0015783663,0.00024170642,0.09374112,0.41904062,0.000021980713,0.48432755],"study_design_scores_gemma":[0.0028196322,0.00067479856,0.005811247,0.0009853487,0.000086865264,0.0003126321,0.0031622963,0.03961377,0.5104882,0.43262675,0.0017291693,0.0016892636],"about_ca_topic_score_codex":0.000011890492,"about_ca_topic_score_gemma":0.0000131766565,"teacher_disagreement_score":0.84535134,"about_ca_system_score_codex":0.000017005712,"about_ca_system_score_gemma":0.00026576084,"threshold_uncertainty_score":0.7834699},"labels":[],"label_agreement":null},{"id":"W3183601063","doi":"10.18653/v1/2021.iwpt-1.2","title":"Proof Net Structure for Neural Lambek Categorial Parsing","year":2021,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Parsing; Combinatory categorial grammar; Computer science; Natural language processing; Artificial intelligence; Formalism (music); Proof of concept; Categorial grammar; Graph; Grammar; Programming language; Algorithm; Theoretical computer science; Attribute grammar; Mildly context-sensitive grammar formalism; Link grammar; Phrase structure rules; Linguistics","score_opus":0.012391835496732697,"score_gpt":0.2363195251538657,"score_spread":0.223927689657133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183601063","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.057358824,0.00010049974,0.9359047,0.0017263502,0.0032076475,0.00020923038,0.000010887071,0.00014909933,0.0013327654],"genre_scores_gemma":[0.9295634,4.9337444e-7,0.06907236,0.0004972611,0.00035657382,0.0000060496363,0.000010964213,0.0000058128658,0.00048707708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992694,0.000042806983,0.000106301595,0.00026431077,0.00009930341,0.00021784879],"domain_scores_gemma":[0.99951893,0.000061196086,0.00002665161,0.0002622936,0.000075983466,0.000054973814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008590045,0.00008457873,0.00009742378,0.000024018902,0.00012122171,0.00016027817,0.00028937854,0.000041081035,0.00003569842],"category_scores_gemma":[0.000023351478,0.00006923487,0.00006147286,0.00020505016,0.00002031036,0.00025984456,0.000091658585,0.000072319766,0.0000020980572],"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.000014257262,0.00003543577,0.00006302725,0.00002009621,0.000018728699,0.000031951346,0.0005481931,0.00055140373,0.007494821,0.90104693,0.0017690362,0.08840614],"study_design_scores_gemma":[0.0009973887,0.00013539166,0.00025135672,0.000007586106,0.000011863796,0.00010994009,0.00009354918,0.18703732,0.1676027,0.62872523,0.014686839,0.0003408196],"about_ca_topic_score_codex":0.000002580789,"about_ca_topic_score_gemma":0.000012888817,"teacher_disagreement_score":0.8722046,"about_ca_system_score_codex":0.000006187115,"about_ca_system_score_gemma":0.0000547409,"threshold_uncertainty_score":0.28233162},"labels":[],"label_agreement":null},{"id":"W3186166992","doi":"10.1007/s11227-022-04457-9","title":"Efficient parallel graph trimming by arc-consistency","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Trimming; Computer science; Graph; Algorithm; Correctness; Parallel computing; Theoretical computer science","score_opus":0.011233306583897377,"score_gpt":0.2142469495600161,"score_spread":0.20301364297611874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186166992","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.61110884,0.0017097057,0.38519874,0.0009286041,0.0007288042,0.00006825361,0.0000015977776,0.000030903808,0.00022457121],"genre_scores_gemma":[0.9882102,0.000010812921,0.011251759,0.00039353647,0.000092260605,9.640623e-7,3.7748993e-7,0.00000866719,0.00003140958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978845,0.00058806635,0.0005185795,0.00014388452,0.000543369,0.00032159078],"domain_scores_gemma":[0.99878913,0.00046289735,0.00026696848,0.0003126923,0.0000810022,0.000087335764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037799627,0.00013157979,0.0002218859,0.00017601417,0.0010875674,0.00007276908,0.0016987054,0.00001781639,0.00001988575],"category_scores_gemma":[0.000040217103,0.00009216228,0.00020250994,0.0006188209,0.000076169206,0.00012326139,0.0005241808,0.00058973307,0.000003745732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017114049,0.0012946887,0.0011483347,0.000041026517,0.00036214566,0.00033928695,0.042951554,0.70312506,0.023007838,0.078139305,0.005760879,0.14365876],"study_design_scores_gemma":[0.0054235808,0.0018734279,0.0018470292,0.00019210574,0.00019180706,0.010670962,0.018736174,0.8751711,0.0031843542,0.075271435,0.0061458466,0.0012921345],"about_ca_topic_score_codex":0.0000107425785,"about_ca_topic_score_gemma":1.3358822e-7,"teacher_disagreement_score":0.3771014,"about_ca_system_score_codex":0.00004308389,"about_ca_system_score_gemma":0.000067537745,"threshold_uncertainty_score":0.83647996},"labels":[],"label_agreement":null},{"id":"W3186295254","doi":"10.22215/etd/2021-14525","title":"A Workload-Driven Framework for NoSQL Data Modeling and Partitioning","year":2021,"lang":"en","type":"dissertation","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","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":"Carleton University","funders":"","keywords":"NoSQL; Computer science; Scalability; Heuristics; Database; Big data; Schema (genetic algorithms); Data mining; Workload; Distributed computing; Information retrieval","score_opus":0.053585331813431426,"score_gpt":0.31903284474888793,"score_spread":0.2654475129354565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186295254","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.002140161,0.0015167209,0.9943497,0.00015758653,0.0007101637,0.00016329663,0.00001883658,0.00009868741,0.00084485154],"genre_scores_gemma":[0.057077408,0.0002843032,0.93839735,0.0003333305,0.0002460916,0.00007134696,0.001437051,0.000025855532,0.0021272711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987439,0.000033320553,0.00020394262,0.0006686174,0.00013971573,0.00021050096],"domain_scores_gemma":[0.99874175,0.00018208164,0.00007866447,0.0008295143,0.000099766425,0.000068208836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021972987,0.00016437104,0.00020768377,0.00007147689,0.00022755828,0.0004176719,0.00087534694,0.00019308581,0.00003326282],"category_scores_gemma":[0.0000973267,0.00016201036,0.000054653818,0.00017526084,0.000010072724,0.00044962115,0.00021462975,0.00022263757,0.0000044205235],"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.000010020823,0.000028899003,0.000009814463,0.000112315945,0.000059292335,0.0000072578996,0.0009964891,0.0012688792,0.00002467558,0.94493747,0.00017454999,0.052370314],"study_design_scores_gemma":[0.00007537795,0.000012610821,0.000006667959,0.00044650747,0.000020241996,0.0000023158107,0.00032092835,0.7290305,0.00008583341,0.26966187,0.00015495314,0.00018219402],"about_ca_topic_score_codex":0.0000058042356,"about_ca_topic_score_gemma":0.000027254733,"teacher_disagreement_score":0.7277616,"about_ca_system_score_codex":0.000005725374,"about_ca_system_score_gemma":0.00007105455,"threshold_uncertainty_score":0.6606591},"labels":[],"label_agreement":null},{"id":"W3193304059","doi":"10.1145/3468791.3468817","title":"Truss Decomposition on Large Probabilistic Networks using H-Index","year":2021,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Truss; Scalability; Probabilistic logic; Computer science; Computation; Decomposition; Mathematical optimization; Approximation algorithm; Enhanced Data Rates for GSM Evolution; Memory footprint; Algorithm; Theoretical computer science; Mathematics; Artificial intelligence; Engineering; Structural engineering","score_opus":0.013218012695263157,"score_gpt":0.2647139710968508,"score_spread":0.2514959584015876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193304059","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.042305265,0.000032385415,0.95392734,0.00015280193,0.0004238063,0.000061759536,7.9104e-7,0.00011712134,0.0029787559],"genre_scores_gemma":[0.9758069,0.0000017365061,0.023199204,0.0007315763,0.00007706658,0.000003027864,0.0000036060326,0.0000051737447,0.00017170908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991215,0.000102116464,0.0001200319,0.000292216,0.00012609096,0.00023806219],"domain_scores_gemma":[0.9994309,0.00007418512,0.000029841804,0.0003474381,0.00005340634,0.000064205706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020297387,0.0000895742,0.00009455025,0.000040626863,0.00016735386,0.00013412628,0.00023910147,0.00004574762,0.000065994915],"category_scores_gemma":[0.000013544853,0.00007916729,0.00005969702,0.00036695827,0.000015072863,0.00019560535,0.00011244083,0.00010420422,0.000020255684],"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.000005411334,0.00018038983,0.0002216349,0.0000058569817,0.000011159698,0.000074476244,0.00007462306,0.029943647,0.00025075983,0.9608226,0.00006090081,0.008348578],"study_design_scores_gemma":[0.00021616298,0.000031185242,0.00075047696,0.000021434402,0.0000034145987,0.000038956252,0.0000130908775,0.9456092,0.0010425162,0.051980846,0.0001731495,0.00011954387],"about_ca_topic_score_codex":0.000001972622,"about_ca_topic_score_gemma":0.00000459577,"teacher_disagreement_score":0.93350166,"about_ca_system_score_codex":0.000023569159,"about_ca_system_score_gemma":0.000030777715,"threshold_uncertainty_score":0.32283482},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W3194448197","doi":"10.1145/3473588","title":"Grafs: declarative graph analytics","year":2021,"lang":"en","type":"article","venue":"Proceedings of the ACM on Programming Languages","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Computer science; Correctness; Analytics; Theoretical computer science; Graph; Source code; Programming language; Data mining","score_opus":0.01672219452698045,"score_gpt":0.2624621614790319,"score_spread":0.24573996695205144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194448197","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.97291046,0.0016308661,0.0060190274,0.008639071,0.00059473596,0.00057822664,0.000008445072,0.00058348186,0.009035689],"genre_scores_gemma":[0.8911637,0.000018949475,0.10785051,0.0003683774,0.000054727338,0.000020361414,0.000001011342,0.000013017064,0.0005093579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99877256,0.0000188852,0.00020850624,0.00035986817,0.00035230195,0.00028787184],"domain_scores_gemma":[0.9986568,0.00010770342,0.00019305154,0.0006598557,0.00031852175,0.00006405717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037678148,0.00016171463,0.00019583853,0.0001000722,0.00017560695,0.00020770401,0.0025563447,0.00006123582,0.00000495707],"category_scores_gemma":[0.0010782211,0.00011086347,0.00019327691,0.0012125148,0.00012678572,0.00027609454,0.0010139288,0.0002152053,0.0000051200955],"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.000016884745,0.0003847895,0.005617266,0.00013401451,0.0001857628,0.00002575753,0.0055364124,0.000014554753,0.015622128,0.8183793,0.0008673541,0.1532158],"study_design_scores_gemma":[0.00057622814,0.0002983082,0.003884518,0.00031896762,0.00007603944,0.00009397201,0.0051254504,0.00049416104,0.6767077,0.30813915,0.0037852048,0.00050033926],"about_ca_topic_score_codex":0.0000034926888,"about_ca_topic_score_gemma":0.0000014474953,"teacher_disagreement_score":0.66108555,"about_ca_system_score_codex":0.000014214116,"about_ca_system_score_gemma":0.000031300293,"threshold_uncertainty_score":0.4750367},"labels":[],"label_agreement":null},{"id":"W3196202149","doi":"10.1145/3468791.3468805","title":"Distributed Enumeration of Four Node Graphlets at Quadrillion-Scale","year":2021,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"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 Victoria","funders":"","keywords":"Enumeration; Scalability; Computer science; Node (physics); Overhead (engineering); Theoretical computer science; Graph; Probabilistic logic; Task (project management); Distributed computing; Parallel computing; Discrete mathematics; Mathematics; Programming language; Artificial intelligence","score_opus":0.011278113526760367,"score_gpt":0.21323323158158378,"score_spread":0.2019551180548234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196202149","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.11097699,0.000042896805,0.8861358,0.00069607084,0.00023917269,0.00003809817,0.000012986096,0.00007025259,0.0017877375],"genre_scores_gemma":[0.95825803,0.000013051263,0.04091371,0.00018404431,0.000022042155,0.000003829665,0.000032512202,0.0000035469818,0.00056923204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99923956,0.00007301441,0.00016468349,0.0002216724,0.00016441214,0.00013662832],"domain_scores_gemma":[0.99935097,0.0000569834,0.000051629086,0.00037244332,0.00011469779,0.000053278385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013776349,0.00007324761,0.00010968782,0.000044683682,0.00009541443,0.000037168447,0.00024139682,0.0000375976,0.0001421273],"category_scores_gemma":[0.000016628941,0.00006505583,0.00008470657,0.00051028933,0.000030454219,0.00021235563,0.00015055551,0.000044045122,0.000031562337],"study_design_candidate":"bench_or_experimental","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.000018872257,0.00038612174,0.014749544,0.000050800507,0.000085114836,0.00011616305,0.0011383381,0.00083689374,0.12341266,0.8281869,0.0033878796,0.027630651],"study_design_scores_gemma":[0.0007296494,0.00007258616,0.019815596,0.000026157839,0.000014471704,0.00010551322,0.00008596842,0.057288464,0.8460777,0.06934659,0.0060565076,0.00038083844],"about_ca_topic_score_codex":0.000006931117,"about_ca_topic_score_gemma":0.000021181682,"teacher_disagreement_score":0.84728104,"about_ca_system_score_codex":0.000010714486,"about_ca_system_score_gemma":0.000022220513,"threshold_uncertainty_score":0.26528996},"labels":[],"label_agreement":null},{"id":"W3196580506","doi":"10.14778/3476249.3476297","title":"Columnar storage and list-based processing for graph database management systems","year":2021,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":25,"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":"Computer science; Joins; Scalability; Column (typography); Query optimization; Graph; Block (permutation group theory); Parallel computing; Online aggregation; Database; Relational database management system; Theoretical computer science; Sargable; Relational database; Information retrieval; Web search query; Programming language; Search engine","score_opus":0.013402134967230724,"score_gpt":0.2220701710286801,"score_spread":0.20866803606144937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196580506","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.30107942,0.008278761,0.6648469,0.005392474,0.00289085,0.0065645333,0.000193229,0.0006107772,0.010143074],"genre_scores_gemma":[0.9573745,0.00003433738,0.041664388,0.00018869119,0.000040286955,0.00023281283,0.0000031790228,0.000013296497,0.00044850408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987713,0.000012391002,0.00025003363,0.0004086676,0.00030729818,0.0002502993],"domain_scores_gemma":[0.99924403,0.000039445356,0.00019843991,0.0002208664,0.00022544364,0.00007174418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054798473,0.00014659438,0.00018335921,0.000085254855,0.00026111686,0.0002699175,0.00064266345,0.000028740133,0.0000015299933],"category_scores_gemma":[0.000028862167,0.0001138115,0.00008518967,0.00046294695,0.00007518876,0.00032870655,0.00040144735,0.000074008945,4.3878745e-7],"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.00007730276,0.00066099793,0.0012396101,0.006229311,0.00019693412,0.000014244972,0.0012897067,0.00033107813,0.05124158,0.9146512,0.0026312515,0.021436743],"study_design_scores_gemma":[0.008384937,0.00064266054,0.0019689878,0.0043749367,0.0004950598,0.00017439011,0.005358085,0.29811662,0.566676,0.08850939,0.023574155,0.0017247736],"about_ca_topic_score_codex":0.0000063030034,"about_ca_topic_score_gemma":8.755884e-7,"teacher_disagreement_score":0.82614183,"about_ca_system_score_codex":0.000029245404,"about_ca_system_score_gemma":0.000032076077,"threshold_uncertainty_score":0.46410984},"labels":[],"label_agreement":null},{"id":"W3202113264","doi":"10.29007/8d9g","title":"Improved Algorithm for the Incremental Assignment Problem","year":2021,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Graph Theory and Algorithms","field":"Computer Science","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":"Nipissing University; Laurentian University","funders":"","keywords":"Bipartite graph; Assignment problem; Hungarian algorithm; 3-dimensional matching; Matching (statistics); Algorithm; Blossom algorithm; Generalized assignment problem; Mathematics; Weapon target assignment problem; Graph; Quadratic assignment problem; Mathematical optimization; Computer science; Optimization problem; Combinatorics","score_opus":0.013691028802653672,"score_gpt":0.24790459229866338,"score_spread":0.23421356349600972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202113264","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.0024350036,0.0003194239,0.99431145,0.0011840113,0.0009459887,0.000299263,0.000002499761,0.000083964056,0.000418377],"genre_scores_gemma":[0.29754835,0.000010758845,0.7013317,0.0005783228,0.0002238936,0.00004344221,0.000004751938,0.000011285161,0.0002475141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987819,0.00010687213,0.00027165635,0.00035524584,0.00014618048,0.00033813211],"domain_scores_gemma":[0.9990016,0.00044750946,0.0000817854,0.00037606954,0.00005610736,0.00003689188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008287977,0.00012785845,0.00014659647,0.000036498197,0.00033482016,0.00018202551,0.0006101018,0.000037390204,0.000012099674],"category_scores_gemma":[0.000044033666,0.000101262085,0.00007475558,0.00035962785,0.00006009872,0.00023961088,0.0005330121,0.0001493321,0.0000021695612],"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.00000405803,0.0000708984,0.00019058182,0.000018769946,0.000036830177,0.00002456304,0.0016287414,0.00050666335,0.001055622,0.062032707,0.00010189735,0.9343287],"study_design_scores_gemma":[0.0007171787,0.000118022486,0.0005380735,0.000052779855,0.000006557155,0.00007218202,0.0010100317,0.9389655,0.01816041,0.03674424,0.0033751316,0.00023987867],"about_ca_topic_score_codex":0.000010395789,"about_ca_topic_score_gemma":0.000007563146,"teacher_disagreement_score":0.93845886,"about_ca_system_score_codex":0.000050142797,"about_ca_system_score_gemma":0.00006600224,"threshold_uncertainty_score":0.4129348},"labels":[],"label_agreement":null},{"id":"W3204075099","doi":"10.1109/cluster48925.2021.00042","title":"Thrifty Label Propagation: Fast Connected Components for Skewed-Degree Graphs","year":2021,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast; CHIST-ERA; Department for the Economy","keywords":"Computer science; Speedup; Disjoint sets; Graph; Degree (music); Theoretical computer science; Algorithm; Combinatorics; Mathematics; Parallel computing","score_opus":0.04739815901358991,"score_gpt":0.2576594112921443,"score_spread":0.2102612522785544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204075099","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.033135343,0.000077403885,0.9584988,0.0013490677,0.00069807895,0.00031393048,0.000014475692,0.00033616266,0.005576773],"genre_scores_gemma":[0.84599704,0.0000061319834,0.15090229,0.0009117282,0.00006048475,0.000062764004,0.000043818996,0.000012549076,0.0020031875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883133,0.00008770206,0.00020116066,0.00041294252,0.00019566329,0.00027117375],"domain_scores_gemma":[0.9989198,0.0001553826,0.000060558505,0.00047581995,0.0002942579,0.000094216775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022284362,0.0001367712,0.0001638465,0.00006514421,0.00023811664,0.00015310317,0.0005054213,0.000055376437,0.00005632011],"category_scores_gemma":[0.00004982332,0.00011717889,0.00009200082,0.00056513055,0.000052260697,0.00034609434,0.00015571878,0.00008318881,0.000041023424],"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.000007684708,0.00015117569,0.00013177357,0.000019060291,0.000033832355,0.00002214502,0.00017933478,0.000005671775,0.009545923,0.9596921,0.00060030003,0.029610977],"study_design_scores_gemma":[0.004964823,0.00037270112,0.011505849,0.000086861735,0.00003274196,0.00018064673,0.00020655128,0.17612186,0.11631876,0.6806515,0.008580715,0.0009769748],"about_ca_topic_score_codex":0.000005150985,"about_ca_topic_score_gemma":0.0000115628445,"teacher_disagreement_score":0.8128617,"about_ca_system_score_codex":0.000008361958,"about_ca_system_score_gemma":0.000054800385,"threshold_uncertainty_score":0.47784165},"labels":[],"label_agreement":null},{"id":"W3208629736","doi":"10.48550/arxiv.2103.02284","title":"Columnar Storage and List-based Processing for Graph Database Management Systems","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Joins; Scalability; Column (typography); Query optimization; Graph; Block (permutation group theory); Database; Online aggregation; Parallel computing; Set (abstract data type); Relational database management system; Theoretical computer science; Sargable; Relational database; Information retrieval; Web search query; Programming language; Search engine; Computer network","score_opus":0.05249284472158499,"score_gpt":0.1857010624464603,"score_spread":0.13320821772487532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208629736","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.0756195,0.00044830516,0.92204326,0.00003024841,0.00059288397,0.00065990683,0.000062363164,0.00018514927,0.0003583563],"genre_scores_gemma":[0.9856864,0.00008493626,0.013331918,0.00006803437,0.000041296542,0.000009937893,0.000080665675,0.000018532019,0.0006782824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979843,0.00015083043,0.00018100772,0.0012537591,0.000097773336,0.00033232916],"domain_scores_gemma":[0.99834514,0.000084771666,0.00021911044,0.0010214074,0.00016231588,0.00016723287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004495965,0.00029330628,0.00032369557,0.0003113086,0.0003310607,0.0005299599,0.0011129574,0.00014646543,0.000003692937],"category_scores_gemma":[0.000010188387,0.00035576802,0.00015445417,0.0005891526,0.000118549695,0.00044830143,0.0012328968,0.00027136545,0.0000017671115],"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.000115055176,0.0004956056,0.00087638776,0.0068254103,0.0003981661,0.0024610385,0.0005521835,0.30836478,0.000101814876,0.6754546,0.0003653774,0.0039895424],"study_design_scores_gemma":[0.0008491888,0.00004860694,0.00013744958,0.00064901914,0.00014214891,0.000005933382,0.00044918255,0.9866528,0.00007039056,0.01001162,0.00045658762,0.0005270952],"about_ca_topic_score_codex":0.00004610915,"about_ca_topic_score_gemma":0.00001647672,"teacher_disagreement_score":0.9100669,"about_ca_system_score_codex":0.00007243913,"about_ca_system_score_gemma":0.0001162296,"threshold_uncertainty_score":0.99988943},"labels":[],"label_agreement":null},{"id":"W4200132737","doi":"10.1109/hpec49654.2021.9622817","title":"DMM-GAPBS: Adapting the GAP Benchmark Suite to a Distributed Memory Model","year":2021,"lang":"en","type":"article","venue":"","topic":"Graph Theory 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":"Glycemic Index Laboratories","funders":"Los Alamos National Laboratory; National Science Foundation","keywords":"Computer science; Suite; Distributed computing; Benchmark (surveying); Distributed memory; Server; Graph; Parallel computing; Theoretical computer science; Shared memory; Operating system","score_opus":0.024377124150510927,"score_gpt":0.2412342948711505,"score_spread":0.21685717072063956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200132737","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.015667051,0.00009596951,0.96878517,0.0045454726,0.00022884582,0.00011514774,0.000012529348,0.00015999412,0.01038981],"genre_scores_gemma":[0.9073497,0.000004812131,0.085362405,0.0036773768,0.00008035608,0.00002471267,0.000012230043,0.000009193478,0.0034792353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867254,0.00011864008,0.00019107008,0.000402419,0.00026264664,0.00035270324],"domain_scores_gemma":[0.9987333,0.00018690582,0.00003797481,0.00077888387,0.00012526014,0.00013768462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005570225,0.00013413612,0.00013115873,0.0000404194,0.000288394,0.00028417882,0.0009506646,0.000039599796,0.00006937403],"category_scores_gemma":[0.00011068989,0.00009194988,0.00010016706,0.0007788158,0.000033808206,0.00032198642,0.0006039403,0.0001547137,0.00006155015],"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.0000071794348,0.00011468175,0.000067673594,0.00001086971,0.000042784108,0.000091377326,0.0023055407,0.037798483,0.0029299038,0.9162737,0.0057675005,0.03459031],"study_design_scores_gemma":[0.00016785816,0.000026598276,0.00022582989,0.00001977844,0.0000073151614,0.000035146193,0.00046897604,0.9141488,0.005677024,0.07754119,0.0014476286,0.00023382764],"about_ca_topic_score_codex":0.000012627731,"about_ca_topic_score_gemma":0.00001969082,"teacher_disagreement_score":0.8916826,"about_ca_system_score_codex":0.000019174033,"about_ca_system_score_gemma":0.00008996227,"threshold_uncertainty_score":0.37496072},"labels":[],"label_agreement":null},{"id":"W4210526454","doi":"10.1007/978-3-030-95903-6_45","title":"Practical Survey on MapReduce Subgraph Enumeration Algorithms","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes on data engineering and communications technologies","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Enumeration; Scalability; Computer science; Overhead (engineering); Task (project management); Graph; Theoretical computer science; Algorithm; Distributed computing; Mathematics; Database; Programming language; Discrete mathematics; Engineering","score_opus":0.06779002658111451,"score_gpt":0.2892592450839757,"score_spread":0.22146921850286122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210526454","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.000028659939,0.004562314,0.97446144,0.012137646,0.00042477573,0.000527519,0.0014657682,0.0034562766,0.0029356042],"genre_scores_gemma":[0.29186678,0.022853484,0.6706704,0.0007456095,0.00012636061,0.00031207348,0.011759369,0.00026235363,0.001403588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998412,0.00007860987,0.0002708874,0.0007217546,0.0002798265,0.00023689744],"domain_scores_gemma":[0.9903559,0.001898039,0.00014932611,0.00750281,0.00005517926,0.00003875971],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054703077,0.0003998031,0.00031803193,0.0004905015,0.00043216543,0.00020385369,0.0046604504,0.0003653687,0.000008562969],"category_scores_gemma":[0.00087408104,0.00037380608,0.000056016634,0.00026120362,0.00018216492,0.00029946057,0.0034382448,0.001827352,0.000015163045],"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.000007796449,0.00006560482,0.000004625849,0.000017280234,0.00008621897,0.000008559022,0.000043048003,0.001341656,0.00003433457,0.8169447,0.00047101697,0.18097512],"study_design_scores_gemma":[0.0005148557,0.0010867841,0.00031933936,0.00038806352,0.00013202731,0.00014841217,0.000023462499,0.38081533,0.0011307029,0.16834033,0.44465393,0.0024467453],"about_ca_topic_score_codex":0.00003035977,"about_ca_topic_score_gemma":0.0000278313,"teacher_disagreement_score":0.6486044,"about_ca_system_score_codex":0.00004522854,"about_ca_system_score_gemma":0.00004720521,"threshold_uncertainty_score":0.9998714},"labels":[],"label_agreement":null},{"id":"W4211067674","doi":"10.32920/ryerson.14655771","title":"Clique Listing Algorithms and Characteristics of Cliques in Random Graphics","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Graph Theory 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":"Clique; Random graph; Clique graph; Computer science; Graph; Algorithm; Graphics; Mathematics; Combinatorics; Theoretical computer science; Line graph; Graph power","score_opus":0.017616142830866297,"score_gpt":0.2595410862788054,"score_spread":0.2419249434479391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211067674","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.25372747,0.00061470584,0.7434341,0.00023855627,0.0007358985,0.00030791466,0.000021373115,0.00012818871,0.0007918282],"genre_scores_gemma":[0.8881347,0.001100219,0.11031084,0.00023171585,0.00008462475,0.000028369726,0.000036549758,0.000016539214,0.000056457044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977673,0.00033765848,0.00072177034,0.0006791513,0.00022406063,0.00027000176],"domain_scores_gemma":[0.99826694,0.00040082855,0.0003453515,0.0006901971,0.00020478258,0.000091887065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013470848,0.00028868398,0.00072879874,0.00031506264,0.000051416697,0.00024758143,0.00075785466,0.00032332574,0.000007645336],"category_scores_gemma":[0.00019771642,0.0002749348,0.00015883421,0.00036326618,0.00014144133,0.00020853688,0.001720016,0.0007685271,3.9988512e-7],"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.00009666383,0.0006613754,0.026639123,0.0020662104,0.00025601214,0.0006405652,0.009982373,0.000114120216,0.0005952341,0.7100899,0.000037216196,0.24882118],"study_design_scores_gemma":[0.004434831,0.00030948035,0.11084357,0.0037929995,0.000098563374,0.00015926805,0.00062114303,0.50161004,0.009990022,0.3651328,0.00033952176,0.0026677304],"about_ca_topic_score_codex":0.0001881023,"about_ca_topic_score_gemma":0.000034848854,"teacher_disagreement_score":0.6344072,"about_ca_system_score_codex":0.0000144808955,"about_ca_system_score_gemma":0.00018105832,"threshold_uncertainty_score":0.99997026},"labels":[],"label_agreement":null},{"id":"W4211117691","doi":"10.32920/ryerson.14655771.v1","title":"Clique Listing Algorithms and Characteristics of Cliques in Random Graphics","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Graph Theory 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":"Clique; Random graph; Computer science; Graph; Algorithm; Clique graph; Graphics; Listing (finance); Mathematics; Theoretical computer science; Combinatorics; Line graph","score_opus":0.017616142830866297,"score_gpt":0.2595410862788054,"score_spread":0.2419249434479391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211117691","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.25372747,0.00061470584,0.7434341,0.00023855627,0.0007358985,0.00030791466,0.000021373115,0.00012818871,0.0007918282],"genre_scores_gemma":[0.8881347,0.001100219,0.11031084,0.00023171585,0.00008462475,0.000028369726,0.000036549758,0.000016539214,0.000056457044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977673,0.00033765848,0.00072177034,0.0006791513,0.00022406063,0.00027000176],"domain_scores_gemma":[0.99826694,0.00040082855,0.0003453515,0.0006901971,0.00020478258,0.000091887065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013470848,0.00028868398,0.00072879874,0.00031506264,0.000051416697,0.00024758143,0.00075785466,0.00032332574,0.000007645336],"category_scores_gemma":[0.00019771642,0.0002749348,0.00015883421,0.00036326618,0.00014144133,0.00020853688,0.001720016,0.0007685271,3.9988512e-7],"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.00009666383,0.0006613754,0.026639123,0.0020662104,0.00025601214,0.0006405652,0.009982373,0.000114120216,0.0005952341,0.7100899,0.000037216196,0.24882118],"study_design_scores_gemma":[0.004434831,0.00030948035,0.11084357,0.0037929995,0.000098563374,0.00015926805,0.00062114303,0.50161004,0.009990022,0.3651328,0.00033952176,0.0026677304],"about_ca_topic_score_codex":0.0001881023,"about_ca_topic_score_gemma":0.000034848854,"teacher_disagreement_score":0.6344072,"about_ca_system_score_codex":0.0000144808955,"about_ca_system_score_gemma":0.00018105832,"threshold_uncertainty_score":0.99997026},"labels":[],"label_agreement":null},{"id":"W4212863801","doi":"10.1007/3-540-45848-4_60","title":"Graph-Drawing Contest Report","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Mitsubishi Electric Research Laboratories","keywords":"CONTEST; Computer science; Graph; Ninth; Graph drawing; Graph algorithms; Theoretical computer science; Political science","score_opus":0.01777484275730002,"score_gpt":0.2308942981831741,"score_spread":0.2131194554258741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212863801","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.000051327366,0.00053400005,0.9800682,0.00056456454,0.0030816426,0.0003010023,0.0000034227091,0.0003121868,0.015083666],"genre_scores_gemma":[0.24115337,0.00012010885,0.74862975,0.0037350343,0.0014496925,0.000023799907,0.000012633144,0.00011257719,0.004763005],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952585,0.0000438826,0.0007247519,0.0020170303,0.0011087254,0.0008470915],"domain_scores_gemma":[0.9963942,0.00048771038,0.00041702253,0.0021803938,0.0002653482,0.0002552914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013319874,0.0006450898,0.00063837005,0.001146141,0.00042650383,0.0007171132,0.004108087,0.0003404518,0.00005121806],"category_scores_gemma":[0.00013652416,0.00059287314,0.00026672945,0.0009894328,0.001016154,0.0008453984,0.0012379154,0.0010359555,0.00009150546],"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.0000037155123,0.000067042856,0.0001432382,0.000042397438,0.000030233115,0.0043669464,0.0010480307,0.0076012276,0.00013821342,0.206789,0.00007121247,0.7796987],"study_design_scores_gemma":[0.00032198246,0.00018517251,0.00012133233,0.0005198359,0.000012189704,0.0019004905,1.5536534e-7,0.18257365,0.0009650795,0.8079891,0.004198219,0.0012127704],"about_ca_topic_score_codex":0.000010623536,"about_ca_topic_score_gemma":0.000010699768,"teacher_disagreement_score":0.77848595,"about_ca_system_score_codex":0.00014174187,"about_ca_system_score_gemma":0.00023666254,"threshold_uncertainty_score":0.99965227},"labels":[],"label_agreement":null},{"id":"W4212915184","doi":"10.1109/ia354616.2021.00011","title":"No More Leaky PageRank","year":2021,"lang":"en","type":"article","venue":"","topic":"Graph Theory 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":"University of British Columbia","funders":"","keywords":"PageRank; Computer science; Asynchronous communication; Implementation; Computation; Theoretical computer science; Graph; Normalization (sociology); Parallel computing; Algorithm; Programming language; Computer network","score_opus":0.009707274234602124,"score_gpt":0.22476111263397114,"score_spread":0.215053838399369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212915184","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.0076719522,0.0001285621,0.8373235,0.002014869,0.0007501268,0.000032948614,7.5702434e-7,0.0002572395,0.1518201],"genre_scores_gemma":[0.57594705,0.000030657357,0.29735184,0.009148538,0.00026130298,0.000009601952,0.000004941595,0.000012546753,0.117233515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99949,0.000029432947,0.000065373475,0.00018889197,0.000096949836,0.00012934221],"domain_scores_gemma":[0.99949616,0.000032681848,0.000010335729,0.00034940278,0.000063910746,0.000047531918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008928407,0.000051849,0.00005853782,0.00001921283,0.00006203935,0.00008442831,0.00030883422,0.000020591682,0.00030656988],"category_scores_gemma":[0.00001771993,0.000042856052,0.00004747398,0.00022939488,0.000018620598,0.00019892135,0.00013007394,0.000056107943,0.0005406489],"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.0000010012936,0.00005763187,0.000105404106,0.0000058738506,0.000012595065,0.00021106706,0.00028842068,0.000016377804,0.0043328214,0.9507549,0.0042842077,0.03992973],"study_design_scores_gemma":[0.0013075736,0.00014268313,0.00562281,0.000044400043,0.000012747238,0.00033731782,0.00028942976,0.11822164,0.20065966,0.31427762,0.3579912,0.0010929331],"about_ca_topic_score_codex":0.000002015449,"about_ca_topic_score_gemma":8.1578037e-7,"teacher_disagreement_score":0.63647723,"about_ca_system_score_codex":0.0000029747296,"about_ca_system_score_gemma":0.00002441936,"threshold_uncertainty_score":0.6949128},"labels":[],"label_agreement":null},{"id":"W4213139879","doi":"10.1016/j.patcog.2022.108588","title":"Robust image matching via local graph structure consensus","year":2022,"lang":"en","type":"article","venue":"Pattern Recognition","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Correctness; Computer science; Robustness (evolution); Graph; Linear programming; Matching (statistics); Artificial intelligence; Mathematical optimization; Feature vector; Theoretical computer science; Mathematics; Algorithm; Pattern recognition (psychology)","score_opus":0.018269228084103594,"score_gpt":0.21015305007461493,"score_spread":0.19188382199051135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213139879","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.23414554,0.000021003672,0.7644291,0.00026680322,0.00061879726,0.00010294413,0.00009574582,0.00014326982,0.00017680773],"genre_scores_gemma":[0.9859271,0.0000013727946,0.013040871,0.0008272924,0.00006503977,0.000023825778,0.00008791647,0.000012582777,0.00001400514],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987285,0.00024131512,0.0001769637,0.0003535045,0.00025481725,0.00024487308],"domain_scores_gemma":[0.999475,0.00006985382,0.00009367038,0.00024894284,0.000047027977,0.00006547444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024586884,0.0001332855,0.000114512455,0.00014094292,0.00041522286,0.000094252704,0.00038638272,0.000031972522,0.0005136557],"category_scores_gemma":[0.0000045814672,0.00013995137,0.00008000615,0.00030870148,0.000054467426,0.00018397567,0.00024025612,0.00031854905,0.00006279814],"study_design_candidate":"design_other","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.0000141854125,0.000082550236,0.00018802374,0.000029176264,0.000031713385,0.00019384257,0.001054944,0.0011149365,0.0058447854,0.0003661697,0.0003082753,0.9907714],"study_design_scores_gemma":[0.0012857519,0.00027752898,0.002301146,0.000042158288,0.00003610972,0.0012791769,0.0010110451,0.10116878,0.013529828,0.87791574,0.00026231218,0.00089044607],"about_ca_topic_score_codex":0.000046560715,"about_ca_topic_score_gemma":0.000010400767,"teacher_disagreement_score":0.989881,"about_ca_system_score_codex":0.000031453776,"about_ca_system_score_gemma":0.000014139037,"threshold_uncertainty_score":0.5707051},"labels":[],"label_agreement":null},{"id":"W4220892078","doi":"10.1007/s42979-022-01084-2","title":"Graph Compression for Adjacency-Matrix Multiplication","year":2022,"lang":"en","type":"article","venue":"SN Computer Science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"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":"Xunta de Galicia; H2020 Marie Skłodowska-Curie Actions; Academy of Finland; European Commission","keywords":"Adjacency matrix; Computer science; Graph energy; Computation; Adjacency list; Matrix multiplication; PageRank; Graph; Theoretical computer science; Algorithm; Line graph; Voltage graph","score_opus":0.013362033898218974,"score_gpt":0.2675174534668748,"score_spread":0.2541554195686558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220892078","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.008526566,0.00008503625,0.9878089,0.0007601164,0.0019630194,0.0004195663,0.000010390248,0.00026438793,0.00016201408],"genre_scores_gemma":[0.6456604,0.0000020831537,0.35361898,0.00040701876,0.00009159423,0.00013960805,0.000004722139,0.000006600941,0.00006896202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777704,0.00009442136,0.000231709,0.00080640113,0.0006322006,0.00045823815],"domain_scores_gemma":[0.9985622,0.00012943869,0.0001338936,0.0008755072,0.0001533127,0.00014560847],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013231616,0.00014429346,0.00014157876,0.0003612496,0.0018909224,0.0002601656,0.003401785,0.000020191717,0.000011703891],"category_scores_gemma":[0.000017967302,0.00013761614,0.00010439629,0.0019972946,0.00023089787,0.00086863025,0.0016179817,0.00015733423,0.0000117992795],"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.000018608464,0.00029748882,0.000249679,0.000020667663,0.000008544999,0.000006594324,0.0022773205,0.016642796,0.015437552,0.547368,0.0021310155,0.41554174],"study_design_scores_gemma":[0.00047623785,0.00026015606,0.0013317035,0.000009131615,0.0000027029105,0.000034536133,0.000026318474,0.9056288,0.0038112095,0.08070928,0.00743597,0.00027396684],"about_ca_topic_score_codex":0.000004279865,"about_ca_topic_score_gemma":3.4371055e-7,"teacher_disagreement_score":0.888986,"about_ca_system_score_codex":0.00005971598,"about_ca_system_score_gemma":0.00013662466,"threshold_uncertainty_score":0.9994085},"labels":[],"label_agreement":null},{"id":"W4229825606","doi":"10.1007/978-1-4614-6170-8_100660","title":"Graph Matching","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Graph; Matching (statistics); Computer science; Mathematics; Theoretical computer science; Statistics","score_opus":0.010905512906758648,"score_gpt":0.20129916116122912,"score_spread":0.19039364825447047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229825606","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.9698444e-7,0.000043497592,0.49870828,0.00008198696,0.00031254123,0.000033014407,6.9106443e-7,0.00016248641,0.5006568],"genre_scores_gemma":[0.00087025407,0.000021994018,0.034024052,0.0009161402,0.00015802003,0.0000019965582,0.0000032144185,0.000022146967,0.96398216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907047,0.000012767925,0.0001676021,0.0003786026,0.00019782367,0.00017276264],"domain_scores_gemma":[0.99906474,0.000061537,0.000085227424,0.0006775251,0.00003076112,0.00008022573],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022770381,0.00021581551,0.00021090456,0.00016115693,0.00009162557,0.0001177813,0.0009898643,0.00015039924,0.00027605201],"category_scores_gemma":[0.0000018626731,0.00018013961,0.00018071973,0.000026398944,0.000043466123,0.000101862766,0.00024138398,0.0002433834,0.0008157456],"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":[2.9531165e-7,0.0000014364346,9.122132e-8,0.000006263229,0.000013971725,0.000009334401,0.000040127266,0.0000045794172,0.0000033237577,0.96580493,0.00089570094,0.033219915],"study_design_scores_gemma":[0.000046009005,0.000019954798,0.0000010616291,0.000035513833,0.00000465815,0.00001504794,7.3813914e-7,0.0001716225,0.000020103169,0.89163417,0.10782393,0.00022717635],"about_ca_topic_score_codex":0.0000026131231,"about_ca_topic_score_gemma":0.0000016701493,"teacher_disagreement_score":0.46468422,"about_ca_system_score_codex":0.000006483058,"about_ca_system_score_gemma":0.00001473053,"threshold_uncertainty_score":0.9999622},"labels":[],"label_agreement":null},{"id":"W4230307341","doi":"10.1007/978-1-4939-7131-2_100760","title":"Network: Graph","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.018310841433778365,"score_gpt":0.20945586241676417,"score_spread":0.1911450209829858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230307341","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.7367453e-7,0.00017453484,0.3185298,0.00008574004,0.0008460307,0.00005984078,0.0000012420101,0.00021491823,0.6800874],"genre_scores_gemma":[0.00008214194,0.000034252498,0.031229304,0.0012517027,0.0007775695,0.0000023661441,0.0000039951015,0.000020349598,0.96659833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998909,0.000011665787,0.00017644669,0.00043449565,0.00019390427,0.0002744931],"domain_scores_gemma":[0.9989081,0.000042783086,0.00008932857,0.00080246717,0.00006542449,0.000091919],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023106701,0.00023477062,0.00020755117,0.00009692984,0.00011878683,0.00010274332,0.0011130805,0.00019829997,0.0018798466],"category_scores_gemma":[0.0000018586669,0.00019519869,0.00016437002,0.000053039614,0.00012019975,0.00014456539,0.00034302834,0.00019628808,0.0018729082],"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":[7.220356e-7,0.0000022087022,3.1198795e-7,0.00000238885,0.000019296449,0.000013629802,0.000023900258,0.0000021113553,2.2200696e-7,0.9437235,0.04863221,0.007579494],"study_design_scores_gemma":[0.000037712776,0.000040668623,0.0000015119597,0.000025310585,0.0000050681842,0.00001045836,2.9098763e-7,0.00022345653,0.0000056413787,0.7131852,0.28627056,0.00019415906],"about_ca_topic_score_codex":7.880561e-7,"about_ca_topic_score_gemma":0.0000022026625,"teacher_disagreement_score":0.2873005,"about_ca_system_score_codex":0.0000069937155,"about_ca_system_score_gemma":0.000026210475,"threshold_uncertainty_score":0.99903256},"labels":[],"label_agreement":null},{"id":"W4230999337","doi":"10.1007/978-1-4614-6170-8_110121","title":"Graph Classification","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.02320411845365998,"score_gpt":0.21632754209804197,"score_spread":0.193123423644382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230999337","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.6529582e-7,0.000030845622,0.478446,0.00016494365,0.00024391782,0.00004185574,7.0250576e-7,0.00014080144,0.52093065],"genre_scores_gemma":[0.0022538498,0.000035548663,0.014321342,0.00053805637,0.00013508402,0.000004333314,0.000009348824,0.000016201455,0.9826862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914294,0.000013584045,0.00016558115,0.0003733834,0.00018003858,0.00012448731],"domain_scores_gemma":[0.99897367,0.00004672259,0.00010550049,0.0007540924,0.000053994772,0.00006604854],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001936147,0.00017137952,0.00015556443,0.00015848034,0.00007035074,0.00008327746,0.0008027312,0.00017012942,0.00020094882],"category_scores_gemma":[0.0000035533344,0.00014556437,0.00013313568,0.000033146116,0.00005634703,0.00008835442,0.00010099033,0.00017116801,0.0009624972],"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":[3.2337763e-7,0.0000019851057,3.5767872e-7,0.0000038054168,0.0000088815295,0.0000015206602,0.000012594564,3.9913297e-7,0.000009138761,0.9312375,0.0021039175,0.06661954],"study_design_scores_gemma":[0.000040745774,0.000021423997,0.000015351785,0.000015116983,0.00000461493,0.000005021091,5.254412e-7,0.0014645327,0.000022986984,0.7309009,0.26733848,0.00017033459],"about_ca_topic_score_codex":6.465088e-7,"about_ca_topic_score_gemma":8.677125e-7,"teacher_disagreement_score":0.46412465,"about_ca_system_score_codex":0.000008863673,"about_ca_system_score_gemma":0.000017780823,"threshold_uncertainty_score":0.99981534},"labels":[],"label_agreement":null},{"id":"W4231409921","doi":"10.1109/ia3.2018.00011","title":"Scale-Free Graph Processing on a NUMA Machine","year":2018,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"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 British Columbia","funders":"","keywords":"Computer science; Scalability; Parallel computing; Distributed memory; Distributed computing; Graph partition; Shared memory; Distributed shared memory; Speedup; Partition (number theory); Graph; Theoretical computer science; Uniform memory access; Memory management; Operating system; Overlay","score_opus":0.009282644588959981,"score_gpt":0.2314970232925089,"score_spread":0.22221437870354893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231409921","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.02780136,0.000040498515,0.9027178,0.0017115765,0.00037601154,0.00009155238,0.000001637365,0.0004634222,0.06679609],"genre_scores_gemma":[0.93051285,0.0000011914661,0.06639302,0.0014869956,0.00013567728,0.0000050555636,4.9204647e-7,0.0000068013396,0.0014579457],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918216,0.000033211727,0.00010415176,0.0002883477,0.00017769712,0.00021444779],"domain_scores_gemma":[0.99922943,0.000023683911,0.000032615728,0.00058455754,0.000054352873,0.000075359916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022130198,0.000100889934,0.000084031526,0.00010568537,0.00021845795,0.00013421604,0.0010159586,0.00003056259,0.000066618355],"category_scores_gemma":[0.000015078913,0.00006421308,0.000046425346,0.00046892645,0.00010755433,0.00030016038,0.00018891908,0.00008140998,0.00017255246],"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.00001653659,0.00014821805,0.0004119143,0.00001121755,0.000008379667,0.0000106603175,0.0009103907,0.0000024239787,0.00046741776,0.3073957,0.0019658632,0.68865126],"study_design_scores_gemma":[0.00087582873,0.00064927747,0.0026366292,0.000071456096,0.000005315525,0.00004757893,0.000042036365,0.06399575,0.029150078,0.8975385,0.00454803,0.0004395634],"about_ca_topic_score_codex":0.000008064913,"about_ca_topic_score_gemma":0.000013532121,"teacher_disagreement_score":0.90271145,"about_ca_system_score_codex":0.0000053231365,"about_ca_system_score_gemma":0.000015110132,"threshold_uncertainty_score":0.26185337},"labels":[],"label_agreement":null},{"id":"W4231467374","doi":"10.1007/978-1-4939-7131-2_100632","title":"Markov Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Markov chain; Computer science; Mathematics; Statistics","score_opus":0.012071833058827555,"score_gpt":0.20803827022009308,"score_spread":0.19596643716126552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231467374","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021733506,0.00008770036,0.10699124,0.00010205176,0.0007628102,0.00007761406,0.0000035746518,0.00025535029,0.8917175],"genre_scores_gemma":[0.00013563292,0.000037492606,0.03429277,0.00062541536,0.00014804048,0.0000023356345,0.0000031555917,0.00001891568,0.9647362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894404,0.000011418719,0.00017032659,0.00045443495,0.00022123857,0.00019852523],"domain_scores_gemma":[0.9988596,0.000042932734,0.00008066112,0.0008488015,0.00007249341,0.00009551572],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001937951,0.0002373828,0.00019668754,0.00018139908,0.000087019485,0.00010341366,0.0011653099,0.00019070426,0.0032201633],"category_scores_gemma":[0.0000032346068,0.000196157,0.00019134776,0.000043217442,0.00013093083,0.00016104699,0.00031216897,0.00018274896,0.002095255],"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":[8.76855e-7,0.000002763154,2.7701313e-7,0.0000040457,0.000022106746,0.000024361736,0.000031806874,1.846628e-8,0.0000014479929,0.9573864,0.014801299,0.027724592],"study_design_scores_gemma":[0.000047752634,0.0000453834,0.0000032414803,0.000022776027,0.0000051763996,0.000021705722,5.896131e-7,0.00014253268,0.000028210305,0.743019,0.25644687,0.00021675578],"about_ca_topic_score_codex":9.803e-7,"about_ca_topic_score_gemma":0.000001968599,"teacher_disagreement_score":0.24164557,"about_ca_system_score_codex":0.000008385781,"about_ca_system_score_gemma":0.000027831877,"threshold_uncertainty_score":0.9986817},"labels":[],"label_agreement":null},{"id":"W42320972","doi":"10.4018/978-1-59140-553-5.ch231","title":"Graph Encoding and Recursion Computation","year":2005,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Graph Theory and Algorithms","field":"Computer Science","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 Winnipeg","funders":"","keywords":"Recursion (computer science); Computer science; Graph; Relational database; Computation; Relational model; Theoretical computer science; Software; Zhàng; Information retrieval; Programming language; Geography","score_opus":0.015313009119385969,"score_gpt":0.23735260403221892,"score_spread":0.22203959491283295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W42320972","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001203845,0.0005122825,0.094907306,0.000086110886,0.0005407011,0.00017389242,0.000021489102,0.00021719285,0.9034206],"genre_scores_gemma":[0.72031206,0.0001322855,0.11591735,0.0026622089,0.0014546515,0.000023416429,0.000017172,0.000115929935,0.15936491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986856,0.000025849953,0.00025072513,0.0005298667,0.0002727726,0.00023517234],"domain_scores_gemma":[0.9992838,0.00004079152,0.00016793466,0.0003072149,0.000064298285,0.00013595846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017350983,0.00029553764,0.00026248005,0.00011028728,0.00017112686,0.00017180212,0.0004160813,0.00023496988,0.0000061641585],"category_scores_gemma":[0.000004662948,0.00029433906,0.000122307,0.000029888162,0.000098219054,0.00014086167,0.00023324782,0.00021545656,0.000048598446],"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.0000039439365,0.0000031852533,0.0000019605266,0.000011887489,0.000016512617,0.000023208919,0.00007148044,0.000009391132,0.000007778068,0.8704461,0.00020516475,0.12919942],"study_design_scores_gemma":[0.00020747792,0.000073755655,0.000019356256,0.00015281184,0.000014657306,0.00009158083,0.0000034229918,0.0010709398,0.000032403506,0.98559904,0.012403728,0.00033084067],"about_ca_topic_score_codex":0.000005402513,"about_ca_topic_score_gemma":0.000005005721,"teacher_disagreement_score":0.74405575,"about_ca_system_score_codex":0.00005884509,"about_ca_system_score_gemma":0.00004221794,"threshold_uncertainty_score":0.9999509},"labels":[],"label_agreement":null},{"id":"W4232247264","doi":"10.1149/ma2010-01/29/1421","title":"High-Resolution X-Ray Computed Tomography and Direct Simulation of the Carbon-Paper GDLs","year":2010,"lang":"en","type":"article","venue":"ECS Meeting Abstracts","topic":"Graph Theory 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":"National Research Council Canada","funders":"","keywords":"Computed tomography; Resolution (logic); X-ray; Tomography; Materials science; Nuclear medicine; Physics; Computer science; Optics; Radiology; Artificial intelligence; Medicine","score_opus":0.007230254909272175,"score_gpt":0.2114436845747907,"score_spread":0.20421342966551853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232247264","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.99249,0.00005864104,0.00063437474,0.0001853122,0.0010160088,0.00012166775,0.0000021684846,0.00009908807,0.005392764],"genre_scores_gemma":[0.9902708,0.0000010017836,0.009559847,0.000052355703,0.00009144349,0.0000021173635,9.85149e-7,0.00000677243,0.0000147104365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898756,0.00009494779,0.00025561303,0.00025191833,0.00022122651,0.00018875654],"domain_scores_gemma":[0.9988548,0.00040078815,0.00020702927,0.00039444753,0.000082684,0.00006020908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007464222,0.0001174316,0.00013520756,0.00008655193,0.00017147802,0.00006825121,0.00037744254,0.000081114886,0.0000015846063],"category_scores_gemma":[0.00016739337,0.00008851058,0.00006297985,0.000367569,0.00010447295,0.00019060352,0.00012337636,0.00022799082,0.0000012487461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009740826,0.000102836486,0.003542835,0.000030500609,0.000032896278,0.0000036436204,0.0008376536,0.77449137,0.21506418,0.0024257877,0.000018896619,0.003439634],"study_design_scores_gemma":[0.0004199231,0.00004929701,0.391385,0.00011017923,0.000020532827,0.0000053737335,0.000015895515,0.51830935,0.080096826,0.0089344205,0.000394996,0.00025819597],"about_ca_topic_score_codex":0.00011978383,"about_ca_topic_score_gemma":0.000017146771,"teacher_disagreement_score":0.38784215,"about_ca_system_score_codex":0.0000041942244,"about_ca_system_score_gemma":0.000018165947,"threshold_uncertainty_score":0.36093566},"labels":[],"label_agreement":null},{"id":"W4232722495","doi":"10.1007/978-1-4939-7131-2_101353","title":"Time-Stamped Graphs","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.01159911916623158,"score_gpt":0.2040327171221511,"score_spread":0.19243359795591952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232722495","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008367133,0.00006945336,0.060517557,0.000092562244,0.0004937484,0.00011524845,0.0000066730986,0.0003980591,0.93829834],"genre_scores_gemma":[0.00009321114,0.000020437757,0.014162165,0.00053049007,0.00014589886,0.0000025813665,0.000007050821,0.000024559438,0.9850136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987569,0.000015449452,0.00020645722,0.0005233205,0.00026117556,0.0002366899],"domain_scores_gemma":[0.99869245,0.000057616046,0.00010355219,0.000936116,0.00009438197,0.00011585885],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00021714135,0.0002857178,0.00025477988,0.00021005623,0.000104546125,0.0001062563,0.0012458521,0.00022455027,0.0060773916],"category_scores_gemma":[0.0000045345073,0.00023892327,0.00021969283,0.000055271543,0.00020851327,0.00018765003,0.00032258072,0.00019861427,0.009159402],"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.0000013307082,0.00000435766,8.150768e-8,0.0000038855324,0.00003073446,0.000023209135,0.00007057578,1.7319476e-7,0.000010102891,0.97624487,0.015703948,0.007906704],"study_design_scores_gemma":[0.000074137584,0.00006828478,7.459365e-7,0.000027263803,0.000008069372,0.0000175836,8.0360263e-7,0.000844009,0.000069722104,0.75853455,0.24006552,0.00028932505],"about_ca_topic_score_codex":8.041121e-7,"about_ca_topic_score_gemma":9.911108e-7,"teacher_disagreement_score":0.22436157,"about_ca_system_score_codex":0.000010572648,"about_ca_system_score_gemma":0.000038848884,"threshold_uncertainty_score":0.9948312},"labels":[],"label_agreement":null},{"id":"W4232881219","doi":"10.1109/icpr.2004.1334077","title":"A comparison of junction tree and relaxation algorithms for point matching using different distance metrics","year":2004,"lang":"en","type":"article","venue":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"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 Alberta","funders":"","keywords":"Probabilistic logic; Algorithm; Computer science; Graph; Matching (statistics); Graphical model; Probabilistic analysis of algorithms; Relaxation (psychology); Tree (set theory); Point (geometry); Mathematics; Theoretical computer science; Artificial intelligence; Combinatorics; Statistics","score_opus":0.07420581418126966,"score_gpt":0.31215548376503455,"score_spread":0.2379496695837649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232881219","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.38552067,0.000058271642,0.6120474,0.0007664939,0.0006437261,0.0003823313,0.000064643755,0.000040185132,0.0004762894],"genre_scores_gemma":[0.9852406,0.000024769957,0.014419848,0.000110420435,0.000085182364,0.000036716236,0.000017996836,0.000016214599,0.000048258626],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981503,0.000019167399,0.000618608,0.00043018235,0.0005605726,0.0002211701],"domain_scores_gemma":[0.9978435,0.0000869333,0.00087455905,0.0001457096,0.0009811645,0.00006814715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039418007,0.000239289,0.00031560706,0.0003303657,0.00017877782,0.00014530178,0.00068117375,0.0000948322,0.000013619457],"category_scores_gemma":[0.00015223406,0.00019215042,0.00014381511,0.0003639906,0.00011705415,0.00065101293,0.0001227585,0.00020322844,0.0000023092186],"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.0005950652,0.0028618958,0.047475487,0.00093135494,0.00064546854,0.0000020007487,0.009411337,0.0017051764,0.043582357,0.34094286,0.00040784906,0.55143917],"study_design_scores_gemma":[0.0032493274,0.0006660795,0.014901394,0.00179294,0.000119381,0.000041702177,0.0012422903,0.12151895,0.1774174,0.678356,0.00004142546,0.0006531247],"about_ca_topic_score_codex":0.000051660427,"about_ca_topic_score_gemma":0.000012477924,"teacher_disagreement_score":0.59971994,"about_ca_system_score_codex":0.00015226229,"about_ca_system_score_gemma":0.00004783901,"threshold_uncertainty_score":0.78356665},"labels":[],"label_agreement":null},{"id":"W4234158878","doi":"10.1007/978-1-4614-6170-8_100581","title":"Graph Analysis","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.00973592011566206,"score_gpt":0.20014897664572107,"score_spread":0.190413056530059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234158878","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.1145304e-7,0.000045225457,0.50540173,0.00005842976,0.00011915148,0.00002466307,0.000001434505,0.000115492374,0.4942335],"genre_scores_gemma":[0.0025102745,0.000026179701,0.016552735,0.00056961866,0.00008399754,0.0000020229793,0.000010489265,0.0000124675435,0.98023224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989431,0.000015951457,0.00019067452,0.00045974337,0.00022810126,0.00016244705],"domain_scores_gemma":[0.99871534,0.00005945267,0.000103432416,0.0009746814,0.0000537341,0.00009334816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023130424,0.00021690296,0.00034856488,0.00062026636,0.00007032032,0.00010109907,0.0010387958,0.00015927099,0.00069184793],"category_scores_gemma":[0.0000027542678,0.00017750882,0.00055903837,0.00019525623,0.00005585634,0.00007068827,0.00018596141,0.00017211774,0.00052147126],"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":[3.0057313e-7,0.000002003572,0.000002736629,0.0000024130443,0.00035387563,0.000006783125,0.000012915152,0.00001440345,4.5297736e-7,0.98111945,0.0007183557,0.0177663],"study_design_scores_gemma":[0.00004773582,0.000025542146,0.000018887711,0.0000072995354,0.00022298048,0.0000025436132,3.7355548e-7,0.0027897556,0.000013295587,0.8480544,0.14851901,0.0002981621],"about_ca_topic_score_codex":0.000003393786,"about_ca_topic_score_gemma":0.000007771233,"teacher_disagreement_score":0.48884898,"about_ca_system_score_codex":0.000006322337,"about_ca_system_score_gemma":0.0000127693265,"threshold_uncertainty_score":0.75752497},"labels":[],"label_agreement":null},{"id":"W4235895077","doi":"10.1007/978-1-4939-7131-2_101253","title":"Spectral Graph Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Spectral analysis; Power graph analysis; Graph; Computer science; Mathematics; Combinatorics; Physics; Astronomy","score_opus":0.012589440077093247,"score_gpt":0.21527963811249412,"score_spread":0.20269019803540086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235895077","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010965942,0.000058924386,0.36112913,0.00006009827,0.00024091228,0.00004244352,0.0000043245554,0.00016685911,0.63828635],"genre_scores_gemma":[0.0016689178,0.000031497493,0.028378006,0.00033157092,0.00025181271,0.0000016726619,0.000011817389,0.000015505057,0.9693092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987343,0.0000130785065,0.00021003412,0.0005542326,0.00025943283,0.00022894479],"domain_scores_gemma":[0.9987173,0.00003380785,0.00010380629,0.00096720067,0.00006825649,0.0001096349],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019442971,0.00025502342,0.00034393533,0.00066728436,0.00008928875,0.0001326098,0.0011394817,0.00016755851,0.0044444124],"category_scores_gemma":[0.0000021544904,0.00021114227,0.0006244356,0.00027214744,0.00012803593,0.00015510879,0.00019657979,0.00018375657,0.001033581],"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":[8.3313046e-7,0.0000050714143,0.000004084255,0.0000018605132,0.0005246279,0.00002088975,0.000052393305,0.0000040950445,0.0000011651222,0.9955048,0.0017809874,0.0020992134],"study_design_scores_gemma":[0.000053783995,0.000058548783,0.00003969016,0.00000762986,0.00023819086,0.000005592254,0.000001469094,0.001488641,0.000063159925,0.9581272,0.039580066,0.00033605346],"about_ca_topic_score_codex":0.0000042082265,"about_ca_topic_score_gemma":0.000020688489,"teacher_disagreement_score":0.33275113,"about_ca_system_score_codex":0.000012020943,"about_ca_system_score_gemma":0.000023186703,"threshold_uncertainty_score":0.99974424},"labels":[],"label_agreement":null},{"id":"W4236802966","doi":"10.1145/3262496","title":"Session details: Computation on GPUs","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Graphics","topic":"Graph Theory 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":"University of Waterloo","funders":"","keywords":"Session (web analytics); Computer science; Computation; Parallel computing; Computational science; Computer graphics (images); Programming language; World Wide Web","score_opus":0.022883904212325945,"score_gpt":0.261104008026764,"score_spread":0.23822010381443803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236802966","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.019649716,0.000029299015,0.97759,0.0005816519,0.0007888386,0.00013629114,0.0000040932414,0.00024338733,0.0009767158],"genre_scores_gemma":[0.9674255,0.000047848873,0.03148533,0.0009102963,0.000011691222,0.000019243318,0.0000021368323,0.000012480275,0.00008542008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986776,0.00020772361,0.00019311141,0.00037897844,0.00030044804,0.00024210657],"domain_scores_gemma":[0.99877536,0.0003034872,0.00005925659,0.00068630837,0.00006830086,0.000107271466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032165443,0.00017265663,0.00012824389,0.00035535038,0.00046741363,0.00009656936,0.00051536417,0.0001030039,0.000021971133],"category_scores_gemma":[0.00003283759,0.00015774375,0.00014470886,0.0010393925,0.00006262677,0.00033534205,0.000004379979,0.00034088313,0.00007912378],"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.000038767914,0.0010489693,0.000116921015,0.000023564315,0.00008370341,0.00003197295,0.0008307625,0.015828155,0.0005656889,0.7071093,0.00019281713,0.2741294],"study_design_scores_gemma":[0.0015252221,0.000977198,0.0014938039,0.00012241685,0.000045469547,0.000075773794,0.00017007832,0.031521548,0.030728268,0.927141,0.0054181297,0.0007810767],"about_ca_topic_score_codex":0.0000026553985,"about_ca_topic_score_gemma":0.0000045651273,"teacher_disagreement_score":0.94777584,"about_ca_system_score_codex":0.00001920929,"about_ca_system_score_gemma":0.000033904973,"threshold_uncertainty_score":0.64326036},"labels":[],"label_agreement":null},{"id":"W4239625125","doi":"10.1145/2486159","title":"Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures","year":2013,"lang":"en","type":"paratext","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; IBM; Parallelism (grammar); Publication; Algorithm; Library science; Parallel computing","score_opus":0.008414914867157751,"score_gpt":0.22855729556532586,"score_spread":0.2201423806981681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239625125","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5565804,0.0031779732,0.0078038173,0.01856077,0.012213919,0.006555778,0.00041448924,0.00041677232,0.39427605],"genre_scores_gemma":[0.36143494,0.0014920719,0.0891383,0.006809867,0.001984583,0.00072833465,0.000041586714,0.00025312084,0.5381172],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997951,0.000061396,0.00040167692,0.00072738,0.00043020747,0.00042836028],"domain_scores_gemma":[0.9986964,0.00015457417,0.00026291845,0.0006599629,0.00012361346,0.00010256042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031625375,0.00041084047,0.00047265875,0.00032042692,0.00010724479,0.00017359933,0.0027937596,0.00027693328,0.00009337381],"category_scores_gemma":[0.00003755491,0.00024627533,0.00013998941,0.000483366,0.00022967195,0.00018158816,0.0012086158,0.0006913698,0.00013490702],"study_design_candidate":"not_applicable","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.00012599987,0.0011961409,0.00060445775,0.0012957071,0.00040463958,0.000020679667,0.044740185,0.0017409156,0.0020224163,0.32880026,0.50799596,0.11105264],"study_design_scores_gemma":[0.007585215,0.003880647,0.024625305,0.0049886266,0.00015491017,0.00043321398,0.0026345435,0.03347905,0.029911667,0.4803528,0.40461662,0.007337395],"about_ca_topic_score_codex":0.00008827189,"about_ca_topic_score_gemma":0.000004255831,"teacher_disagreement_score":0.19514549,"about_ca_system_score_codex":0.000019828822,"about_ca_system_score_gemma":0.000058077574,"threshold_uncertainty_score":0.9999989},"labels":[],"label_agreement":null},{"id":"W4241349356","doi":"10.1007/978-1-4614-6170-8_110023","title":"Graph Exploration","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.02225522940982956,"score_gpt":0.20876029361508996,"score_spread":0.18650506420526042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241349356","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.5070815e-7,0.000028385834,0.52102673,0.0001458387,0.00028706106,0.00004097716,5.089307e-7,0.00013706501,0.4783333],"genre_scores_gemma":[0.0007754478,0.000046863235,0.01730738,0.00060676236,0.00017626745,0.000005420234,0.000009969373,0.000016892722,0.981055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922293,0.000012877462,0.00015080151,0.00031965334,0.00017763741,0.00011608016],"domain_scores_gemma":[0.99920607,0.000034947843,0.00008160047,0.0005696762,0.00004917735,0.00005853641],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017134538,0.00017028741,0.00015358186,0.00015322799,0.0000686714,0.00009544236,0.0005966204,0.00013545975,0.00018087904],"category_scores_gemma":[0.000003025508,0.00014471261,0.00012085808,0.000029953002,0.000037466136,0.0002427258,0.00011466194,0.00014107731,0.0008568178],"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":[3.7304827e-7,0.0000015931104,7.220725e-8,0.0000033659585,0.000008035924,0.0000031060806,0.000034995974,0.0000033923773,0.000002817906,0.949502,0.001914895,0.048525363],"study_design_scores_gemma":[0.000044227505,0.000032838372,5.0906823e-7,0.000016738082,0.0000036642198,0.0000035358944,7.720073e-7,0.0007292776,0.00005489595,0.80825424,0.19069052,0.00016880641],"about_ca_topic_score_codex":7.5543113e-7,"about_ca_topic_score_gemma":0.0000016898108,"teacher_disagreement_score":0.50371933,"about_ca_system_score_codex":0.000005989464,"about_ca_system_score_gemma":0.00001390305,"threshold_uncertainty_score":0.99992114},"labels":[],"label_agreement":null},{"id":"W4241939346","doi":"10.1007/978-1-4939-7131-2_100437","title":"Graph Repository","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.010460158423141469,"score_gpt":0.19580000860243504,"score_spread":0.18533985017929358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241939346","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018495292,0.00014766064,0.13025475,0.000043359694,0.0011417622,0.000060839426,7.9546805e-7,0.0002713336,0.86807764],"genre_scores_gemma":[0.00017962743,0.000016137737,0.013487554,0.00024396008,0.00032119625,0.000002136149,0.0000017358153,0.0000160507,0.9857316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898463,0.000011986196,0.00018675876,0.0004481175,0.000207532,0.00016095312],"domain_scores_gemma":[0.99881005,0.00003289008,0.000098700715,0.00089590356,0.000076132244,0.000086297274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013478061,0.00020768012,0.00017640348,0.00014173193,0.00012184709,0.00010947273,0.0010042979,0.0001891374,0.00041356243],"category_scores_gemma":[0.000002015978,0.00017390116,0.00018250052,0.000031715903,0.00013757005,0.00015503941,0.0002417585,0.00017680963,0.0007097768],"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":[6.5524466e-7,0.0000035639341,2.7762277e-7,0.0000039141873,0.000022040158,0.000041152547,0.00004609099,9.284379e-8,0.000010208598,0.9877541,0.008473742,0.003644185],"study_design_scores_gemma":[0.0000439227,0.000058425616,0.0000024254641,0.000030918884,0.0000067525725,0.000050561885,0.0000013383819,0.00009277343,0.00031056884,0.76541495,0.23375733,0.00023000815],"about_ca_topic_score_codex":0.0000010671645,"about_ca_topic_score_gemma":6.6543276e-7,"teacher_disagreement_score":0.2252836,"about_ca_system_score_codex":0.000009837587,"about_ca_system_score_gemma":0.00003204733,"threshold_uncertainty_score":0.9122982},"labels":[],"label_agreement":null},{"id":"W4242631805","doi":"10.1007/978-1-4614-6170-8_100001","title":"Graph Representation","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Graph; Computer science; Theoretical computer science","score_opus":0.01860411193035892,"score_gpt":0.23161170248344942,"score_spread":0.2130075905530905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242631805","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.3456614e-7,0.000027257593,0.47036472,0.00010097664,0.00027585283,0.00004449131,5.6540824e-7,0.0001262582,0.52905935],"genre_scores_gemma":[0.00095883536,0.000028521703,0.015801027,0.00047703265,0.00013854435,0.000003196697,0.000008523181,0.000014102002,0.98257023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913305,0.00001593563,0.00015922844,0.00037965766,0.00019541642,0.00011670761],"domain_scores_gemma":[0.9990313,0.000060096256,0.00009343989,0.0007078262,0.000048514274,0.00005879507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015298353,0.00015459029,0.00015998725,0.00015489788,0.00006196241,0.00008407613,0.00063176366,0.00012588988,0.0002618582],"category_scores_gemma":[0.000005383508,0.00013390857,0.00014545875,0.000037514288,0.000044716213,0.00011132487,0.00014062772,0.00014274224,0.0005909733],"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":[4.91362e-7,0.0000014777428,7.5740707e-7,0.0000030402634,0.000011776069,0.0000054422508,0.00002355021,0.0000027268622,0.0000039172114,0.9442243,0.002506702,0.053215846],"study_design_scores_gemma":[0.00006282005,0.000025565425,0.000008281101,0.0000166464,0.000005606542,0.000009512146,7.2449194e-7,0.00070852024,0.000093738156,0.90472364,0.0941671,0.00017786003],"about_ca_topic_score_codex":0.0000025015343,"about_ca_topic_score_gemma":0.0000013396248,"teacher_disagreement_score":0.4545637,"about_ca_system_score_codex":0.0000057647694,"about_ca_system_score_gemma":0.000011863312,"threshold_uncertainty_score":0.75959635},"labels":[],"label_agreement":null},{"id":"W4243129909","doi":"10.1007/978-1-4614-6170-8_100734","title":"Graph Algorithms","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Algorithm","score_opus":0.013419432999916943,"score_gpt":0.20794501192002848,"score_spread":0.19452557892011155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243129909","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.2727398e-7,0.0001074484,0.4890693,0.00012311732,0.000549809,0.000065103144,0.0000024932149,0.00025659747,0.509826],"genre_scores_gemma":[0.00014274806,0.00005837358,0.050339296,0.00095467793,0.00028514198,0.0000052003193,0.000008648093,0.000034447887,0.94817144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843997,0.000020351941,0.0002716489,0.00063937774,0.00033975404,0.0002889102],"domain_scores_gemma":[0.9984304,0.00008419472,0.00013351798,0.0011158392,0.00007928438,0.0001567886],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030444088,0.00036455103,0.00035041786,0.00026730457,0.00011690076,0.00014485359,0.0015208749,0.0002833931,0.0005086009],"category_scores_gemma":[0.0000051430807,0.00030842575,0.00030356378,0.000057174842,0.00010655631,0.00013296797,0.0003331867,0.00034500516,0.0014831997],"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":[4.5860446e-7,0.000003462064,1.8035537e-7,0.00000622322,0.00002672188,0.000017862201,0.00002022055,0.0000014731946,0.0000015998402,0.8789868,0.0033378736,0.11759718],"study_design_scores_gemma":[0.00008717311,0.000050183666,0.000001635574,0.000028206246,0.000008535528,0.000023799748,5.219874e-7,0.0012398295,0.00003534097,0.6575557,0.34063375,0.0003352986],"about_ca_topic_score_codex":0.0000024847475,"about_ca_topic_score_gemma":0.0000014099969,"teacher_disagreement_score":0.43873,"about_ca_system_score_codex":0.000012868645,"about_ca_system_score_gemma":0.00003224683,"threshold_uncertainty_score":0.99993676},"labels":[],"label_agreement":null},{"id":"W4243982841","doi":"10.1145/2493132.2462378","title":"Kinetic data structures for all nearest neighbors and closest pair in the plane","year":2013,"lang":"en","type":"article","venue":"","topic":"Graph Theory 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":"University of Victoria","funders":"","keywords":"k-nearest neighbors algorithm; Plane (geometry); Combinatorics; Mathematics; Function (biology); Algebraic number; Binary logarithm; Trajectory; Amortized analysis; Degree (music); Discrete mathematics; Data structure; Physics; Computer science; Mathematical analysis; Geometry; Artificial intelligence","score_opus":0.03229127608139164,"score_gpt":0.25950020296628123,"score_spread":0.22720892688488958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243982841","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.79093623,0.00043880116,0.1903944,0.013488976,0.00054582965,0.001575686,0.000062943196,0.00018410364,0.0023730432],"genre_scores_gemma":[0.97726995,0.0000055357805,0.021056525,0.0015343679,0.00004226432,0.000017080174,0.000021483864,0.000003280188,0.00004948466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993632,0.000042914227,0.000096582364,0.00024580292,0.000083208375,0.00016832945],"domain_scores_gemma":[0.99904567,0.0002370701,0.000021311387,0.00064864446,0.000011835967,0.00003546076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022216345,0.00007725255,0.00006993927,0.000034202498,0.000053447093,0.00021738895,0.0012613736,0.000026618027,0.00002482112],"category_scores_gemma":[0.000024016736,0.000043561566,0.000010935854,0.000101994934,0.000047304504,0.00034536872,0.00022583311,0.0000659228,0.000007591083],"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.0000065982817,0.00005915441,0.0061743846,0.00002709014,0.000017001696,0.000010773025,0.0014576714,0.000044109493,0.00019520121,0.90126824,0.016412953,0.07432684],"study_design_scores_gemma":[0.00081301166,0.00023670595,0.2212957,0.000011556729,0.000009261166,0.00006027632,0.00035498937,0.17269982,0.00028271604,0.5796358,0.02427745,0.00032272338],"about_ca_topic_score_codex":0.00018633546,"about_ca_topic_score_gemma":0.00006243359,"teacher_disagreement_score":0.32163244,"about_ca_system_score_codex":0.0000015390409,"about_ca_system_score_gemma":0.0000077737195,"threshold_uncertainty_score":0.2343967},"labels":[],"label_agreement":null},{"id":"W4244144399","doi":"10.1515/iupac.87.0710","title":"Vigilance Decrement","year":2016,"lang":"en","type":"dataset","venue":"IUPAC Standards Online","topic":"Graph Theory 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":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Glossary; Chemical nomenclature; Relation (database); Psychology; Computer science; Chemistry; Linguistics; Data mining; Philosophy","score_opus":0.011882208035883536,"score_gpt":0.368536065982365,"score_spread":0.35665385794648147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244144399","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000074613367,0.00050875626,0.09093874,0.00083673827,0.001448938,0.00017276486,0.9059043,0.00013865341,0.00004365344],"genre_scores_gemma":[0.0000140494085,0.00042936375,0.0012583244,0.00070041616,0.00060374,0.00001704476,0.99669015,0.000017427205,0.00026946157],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970198,0.00012005458,0.00040036294,0.0007308722,0.001132384,0.0005965043],"domain_scores_gemma":[0.99754757,0.00007615962,0.00016239067,0.001698935,0.00030327312,0.00021167302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008861267,0.00041522397,0.00047296108,0.0002095421,0.0001757458,0.00016414936,0.0021944225,0.00022181557,0.00063591875],"category_scores_gemma":[0.000108532644,0.00026185735,0.00018538737,0.00021356069,0.000114951836,0.0002505138,0.0006443214,0.0003613317,0.000012078954],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001624005,0.00011433451,6.1202576e-7,0.000048217375,0.000047826765,0.0000884573,0.00001286711,0.0000010587489,0.000017614859,0.0013129644,0.9884706,0.009869194],"study_design_scores_gemma":[0.00049115194,0.00015226295,0.0000030454491,0.0002669493,0.000019541603,0.000019294092,0.000002621898,0.00003805222,0.00025153387,0.009237333,0.98909074,0.0004274833],"about_ca_topic_score_codex":0.000010448079,"about_ca_topic_score_gemma":0.000041675714,"teacher_disagreement_score":0.09078588,"about_ca_system_score_codex":0.00018525062,"about_ca_system_score_gemma":0.00033912342,"threshold_uncertainty_score":0.9999834},"labels":[],"label_agreement":null},{"id":"W4244218038","doi":"10.1007/978-0-387-39940-9_3121","title":"Multiprocessor Query Processing","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Multiprocessing; Parallel computing; Programming language","score_opus":0.013582111838061007,"score_gpt":0.22844000990154675,"score_spread":0.21485789806348574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244218038","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018689887,0.010926706,0.10627638,0.000057600348,0.0017572572,0.0007300345,0.0004422346,0.00036837006,0.8794227],"genre_scores_gemma":[0.0059628095,0.0032355946,0.035309874,0.00018770553,0.0021917187,0.00008086951,0.0006623627,0.00018418173,0.95218486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99699306,0.00006015322,0.0009083197,0.00089859986,0.0007351259,0.00040471234],"domain_scores_gemma":[0.99710375,0.00012514781,0.00086593867,0.0014431721,0.00026266387,0.00019933814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006586109,0.00055651006,0.00080449134,0.0003965888,0.00014011103,0.000120200704,0.0016736288,0.00030117462,0.000024198933],"category_scores_gemma":[0.000055837238,0.00050974503,0.00019634709,0.00015342936,0.000117463365,0.0009569854,0.00031843156,0.00049140386,0.00012480904],"study_design_candidate":"not_applicable","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.000019353904,0.0001258977,0.0000137387,0.002130609,0.00009926483,0.000295085,0.00069070933,0.000059861093,0.000089850175,0.724134,0.0053551225,0.2669865],"study_design_scores_gemma":[0.0007133438,0.00021572581,0.000015647347,0.005266318,0.00011266019,0.00016452049,0.00006223271,0.0071390667,0.00013146662,0.018366523,0.96615607,0.0016564501],"about_ca_topic_score_codex":0.000024906047,"about_ca_topic_score_gemma":0.000003997411,"teacher_disagreement_score":0.96080095,"about_ca_system_score_codex":0.00003923359,"about_ca_system_score_gemma":0.0002930193,"threshold_uncertainty_score":0.9997354},"labels":[],"label_agreement":null},{"id":"W4244572977","doi":"10.1109/sc.2018.00024","title":"PruneJuice: Pruning Trillion-edge Graphs to a Precise Pattern-Matching Solution","year":2018,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":21,"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 British Columbia","funders":"","keywords":"Scalability; Computer science; Pruning; Pipeline (software); Matching (statistics); Enhanced Data Rates for GSM Evolution; Scaling; Pattern matching; Set (abstract data type); Analytics; Focus (optics); Graph; Theoretical computer science; Data mining; Algorithm; Artificial intelligence; Mathematics; Database","score_opus":0.013911922450318229,"score_gpt":0.25361030064309154,"score_spread":0.23969837819277331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244572977","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.12687433,0.000018854602,0.8669975,0.0007407832,0.000758648,0.00021981623,0.0000012202505,0.00034461514,0.0040442604],"genre_scores_gemma":[0.9499824,0.0000025178713,0.04844529,0.00083757966,0.00015203818,0.000022347926,0.0000011602194,0.000010598682,0.0005460842],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852955,0.00010027339,0.00023325958,0.00047177245,0.0002543495,0.00041076433],"domain_scores_gemma":[0.9990086,0.00007944867,0.00006220165,0.00055530964,0.00011271016,0.00018171559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005857471,0.00016287141,0.00014921703,0.00026460347,0.00037802244,0.00021070513,0.0008228213,0.00005838068,0.000060269882],"category_scores_gemma":[0.000032297958,0.00013959053,0.00008635002,0.0008668651,0.00005494983,0.0007174351,0.00033865482,0.00011764545,0.00037473105],"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.00002961526,0.0002151361,0.0007421287,0.000029188264,0.00005007595,0.000021873147,0.016746001,0.00009113845,0.01596055,0.26653114,0.0031897565,0.6963934],"study_design_scores_gemma":[0.0020733192,0.0018190967,0.0134828435,0.00046589627,0.000039740844,0.00013907926,0.0007868787,0.1913629,0.0690827,0.7045529,0.01397825,0.002216438],"about_ca_topic_score_codex":0.00004998342,"about_ca_topic_score_gemma":0.000028993256,"teacher_disagreement_score":0.8231081,"about_ca_system_score_codex":0.000022075985,"about_ca_system_score_gemma":0.00002854583,"threshold_uncertainty_score":0.5692336},"labels":[],"label_agreement":null},{"id":"W4245762030","doi":"10.1007/978-1-4939-7131-2_100424","title":"Graph Classification","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Graph; Computer science; Combinatorics","score_opus":0.029846728982330067,"score_gpt":0.2298641151551981,"score_spread":0.20001738617286804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245762030","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013489554,0.000042137697,0.3401017,0.00013200982,0.0003933885,0.000057251404,0.0000016389064,0.00017693112,0.6590936],"genre_scores_gemma":[0.00061703415,0.000038148075,0.018817492,0.00037132093,0.00021172638,0.0000037762072,0.000008633333,0.000015397653,0.97991645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912786,0.000009760651,0.0001595548,0.00039238436,0.00018109311,0.00012933942],"domain_scores_gemma":[0.99896765,0.000028983526,0.00009906117,0.00075585605,0.00008472982,0.000063713516],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00016034167,0.00016894286,0.00013305373,0.00016185078,0.0000814937,0.00008961633,0.00083478657,0.00017385096,0.0010426064],"category_scores_gemma":[0.0000030175404,0.00014295468,0.00012076902,0.00004209661,0.00010586501,0.00016707375,0.00012508476,0.00013878528,0.0021485626],"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":[5.028936e-7,0.0000034562102,2.8270907e-7,0.0000027328947,0.000011794651,0.000002506997,0.00004070053,4.5777956e-8,0.000011038787,0.974852,0.0067574424,0.018317483],"study_design_scores_gemma":[0.00003654841,0.000033344244,0.000012437188,0.000016194504,0.0000046779337,0.000005981982,0.0000016128876,0.0005552146,0.000048925576,0.7923315,0.20678593,0.00016760774],"about_ca_topic_score_codex":5.2752364e-7,"about_ca_topic_score_gemma":0.0000011819671,"teacher_disagreement_score":0.32128417,"about_ca_system_score_codex":0.000010536862,"about_ca_system_score_gemma":0.00002552616,"threshold_uncertainty_score":0.9998706},"labels":[],"label_agreement":null},{"id":"W4245962026","doi":"10.1142/s012905411402002x","title":"PREFACE","year":2014,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Library science; Computer science; Download; World Wide Web","score_opus":0.010147234711187279,"score_gpt":0.27748372626392215,"score_spread":0.26733649155273487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245962026","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.04025454,0.000012787605,0.95465386,0.0011838219,0.0029764168,0.00002621302,6.531998e-7,0.0000143342895,0.0008773863],"genre_scores_gemma":[0.724063,0.0000038948915,0.2756027,0.0001347224,0.00017868375,3.155257e-7,1.9029866e-7,0.0000016240759,0.0000148758845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983335,0.00005175516,0.0004226315,0.00015593805,0.000908782,0.00012738358],"domain_scores_gemma":[0.9973727,0.00016456748,0.00045916057,0.00028680597,0.0016295864,0.00008717763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014710705,0.000071804454,0.00012412539,0.0005455661,0.00009919163,0.00028183087,0.0037881474,0.000016536003,0.000010621127],"category_scores_gemma":[0.00015556223,0.000061125706,0.000093451774,0.0005473554,0.00032484342,0.0019723575,0.00031733688,0.000098098666,0.000010748],"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.000006374859,0.00012213095,0.00040004848,0.0000023535642,0.00003292427,0.0000043398472,0.0005222622,0.0045922194,0.0031077377,0.69918686,0.00012285175,0.2918999],"study_design_scores_gemma":[0.0012450307,0.00070456055,0.02280074,0.00016928944,0.000013227079,0.00067319174,0.000022469349,0.6083848,0.028027527,0.32410172,0.013530381,0.00032705892],"about_ca_topic_score_codex":0.0000018982696,"about_ca_topic_score_gemma":3.3400772e-7,"teacher_disagreement_score":0.68380845,"about_ca_system_score_codex":0.00003684849,"about_ca_system_score_gemma":0.00022206426,"threshold_uncertainty_score":0.7039383},"labels":[],"label_agreement":null},{"id":"W4246538901","doi":"10.1007/978-1-4939-7131-2_100422","title":"Graph Algorithms","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Algorithm","score_opus":0.017204787386905035,"score_gpt":0.22078703039828199,"score_spread":0.20358224301137695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246538901","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.289885e-7,0.0001434889,0.36818665,0.000096670294,0.00086294493,0.000086923916,0.0000056475287,0.0003151744,0.6303019],"genre_scores_gemma":[0.000039789076,0.00006241783,0.06461365,0.0006584551,0.0004436939,0.0000045294764,0.000007987964,0.00003268346,0.9341368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841,0.000014705435,0.00026191448,0.0006715695,0.00034174928,0.000300045],"domain_scores_gemma":[0.9984281,0.000052636748,0.00012548386,0.0011184656,0.0001239025,0.00015139038],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00025327152,0.0003594613,0.00030027813,0.0002732144,0.00013501124,0.0001558454,0.001581628,0.0002895449,0.002610275],"category_scores_gemma":[0.000004383106,0.00030297643,0.00027580748,0.00007233993,0.00019833504,0.00025039996,0.00041171396,0.00028081602,0.003301627],"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":[7.64144e-7,0.0000064468295,1.5514009e-7,0.0000048144097,0.00003798536,0.000031556316,0.00006956422,1.8659665e-7,0.0000020799837,0.95171994,0.011367511,0.03675901],"study_design_scores_gemma":[0.00007918736,0.000078381454,0.0000013511515,0.000030488362,0.0000087479,0.000028571782,0.0000016063833,0.00048232652,0.00007584313,0.7209519,0.2779277,0.00033388424],"about_ca_topic_score_codex":0.000002023259,"about_ca_topic_score_gemma":0.0000019143158,"teacher_disagreement_score":0.30383494,"about_ca_system_score_codex":0.000015222133,"about_ca_system_score_gemma":0.00004605897,"threshold_uncertainty_score":0.99994224},"labels":[],"label_agreement":null},{"id":"W4246892476","doi":"10.1007/978-1-4614-6170-8_100535","title":"Markov Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Markov chain; Mathematics; Machine learning","score_opus":0.009385353575161681,"score_gpt":0.19575726810143035,"score_spread":0.18637191452626867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246892476","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.0498233e-7,0.00006106101,0.3289595,0.000121576435,0.00044859038,0.00005391687,0.0000014508122,0.00019326265,0.67016023],"genre_scores_gemma":[0.00049865135,0.000034605655,0.025829846,0.0008992366,0.00009333067,0.00000266016,0.0000033931635,0.000019738605,0.9726185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896395,0.000015950794,0.00017683089,0.00043229523,0.0002199569,0.00019102941],"domain_scores_gemma":[0.9988525,0.00006956522,0.00008595547,0.00084681716,0.000046070232,0.0000990773],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002347128,0.00024084745,0.00023024589,0.000177719,0.00007497201,0.000096085314,0.0011206077,0.00018660208,0.0006177861],"category_scores_gemma":[0.0000038179232,0.00019977237,0.00021116195,0.000033943576,0.000069260175,0.00008493629,0.00025166455,0.00022596016,0.0009372374],"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":[5.4820396e-7,0.0000015411832,3.4429505e-7,0.0000054967118,0.000016174561,0.00001436854,0.0000095286905,1.5971099e-7,0.0000011690272,0.89956933,0.004483671,0.09589768],"study_design_scores_gemma":[0.000052131596,0.000028382656,0.000003935989,0.00002076856,0.0000049953414,0.000017782104,1.8684212e-7,0.0003716988,0.000012941507,0.6860714,0.31320018,0.0002156061],"about_ca_topic_score_codex":0.0000011997629,"about_ca_topic_score_gemma":0.000001442037,"teacher_disagreement_score":0.3087165,"about_ca_system_score_codex":0.0000070309893,"about_ca_system_score_gemma":0.000019321778,"threshold_uncertainty_score":0.9998407},"labels":[],"label_agreement":null},{"id":"W4247906728","doi":"10.1007/978-3-642-10326-1_5","title":"Network Models","year":2010,"lang":"en","type":"book-chapter","venue":"Operations Research","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of New Brunswick","funders":"","keywords":"Subject (documents); Euler's formula; Bridge (graph theory); Graph; Section (typography); Graph theory; Mathematics; Calculus (dental); Computer science; Combinatorics; Mathematical analysis; Library science","score_opus":0.11622483620308983,"score_gpt":0.34025102430846615,"score_spread":0.22402618810537633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247906728","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000061953424,0.00030570137,0.24331598,0.0009194158,0.00039843787,0.0003099368,0.000010366405,0.000082986575,0.75465095],"genre_scores_gemma":[0.0018182155,0.00013363089,0.065260015,0.00015227722,0.00072068913,0.000056922123,0.000029215922,0.000033637407,0.9317954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803346,0.00009739967,0.00021014827,0.00051648397,0.0006960185,0.0004464754],"domain_scores_gemma":[0.997913,0.00014331829,0.0000144578435,0.0012307737,0.00054702925,0.00015139101],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014915419,0.0001730424,0.00017713617,0.00028541463,0.0010611421,0.00064845756,0.0015938753,0.00033535273,0.000471837],"category_scores_gemma":[0.000024595936,0.00015838094,0.00008486776,0.00017909393,0.00023738819,0.00046711313,0.00062726164,0.0017875115,0.0011086671],"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":[9.832764e-7,0.000008775498,5.227095e-8,0.0000029416271,0.000010684738,0.000015268277,0.00010270076,0.008406851,0.000043690427,0.98289424,0.0021818513,0.00633195],"study_design_scores_gemma":[0.00005359155,0.000040774186,3.907725e-7,0.00003107718,0.000001861632,0.000009748335,0.0000017387106,0.110437214,0.000033645763,0.779596,0.10962856,0.00016542849],"about_ca_topic_score_codex":0.000015260726,"about_ca_topic_score_gemma":0.000091168324,"teacher_disagreement_score":0.20329827,"about_ca_system_score_codex":0.000029917093,"about_ca_system_score_gemma":0.00030627532,"threshold_uncertainty_score":0.9996691},"labels":[],"label_agreement":null},{"id":"W4248615521","doi":"10.1007/978-1-4614-6170-8_100647","title":"Network: Graph","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.014347577501898408,"score_gpt":0.19733963014923026,"score_spread":0.18299205264733184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248615521","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.141256e-8,0.00012578281,0.46996766,0.000105688276,0.0005152426,0.000043034466,5.221145e-7,0.00016836857,0.5290736],"genre_scores_gemma":[0.00030314454,0.000031802487,0.023651017,0.0018094986,0.00049339584,0.0000027100625,0.000004319726,0.000021356831,0.97368276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989303,0.000016287202,0.00018317717,0.00041335417,0.00019278376,0.0002641448],"domain_scores_gemma":[0.998898,0.000069269285,0.00009518283,0.00080058735,0.000041594547,0.000095337185],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002797267,0.00023819107,0.00024291787,0.00009495549,0.00010237206,0.00009546449,0.0010703753,0.00019403752,0.00036059858],"category_scores_gemma":[0.000002193082,0.00019879127,0.00018136273,0.00004167368,0.00006364187,0.00007627413,0.000276607,0.000242608,0.00083785533],"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":[4.887986e-7,0.000001334197,4.1923232e-7,0.0000035125656,0.000015289139,0.000008704484,0.000007757919,0.000019713629,1.9399299e-7,0.9534778,0.01636248,0.030102313],"study_design_scores_gemma":[0.000040356936,0.000024953471,0.0000017983776,0.000022631551,0.0000047949543,0.000008402552,9.047746e-8,0.000570339,0.0000025378656,0.6651584,0.33397636,0.00018932353],"about_ca_topic_score_codex":9.646782e-7,"about_ca_topic_score_gemma":0.0000016140202,"teacher_disagreement_score":0.44631666,"about_ca_system_score_codex":0.0000058667,"about_ca_system_score_gemma":0.000018205275,"threshold_uncertainty_score":0.9999401},"labels":[],"label_agreement":null},{"id":"W4249113970","doi":"10.1007/978-1-4939-7131-2_100212","title":"Core Graph Decomposition","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Core (optical fiber); Decomposition; Computer science; Graph; Theoretical computer science; Biology; Ecology; Telecommunications","score_opus":0.03277685480891366,"score_gpt":0.2620599594991019,"score_spread":0.22928310469018823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249113970","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014533843,0.000064617736,0.33003068,0.000061003175,0.00058376126,0.000079318146,0.0000042748648,0.00022066716,0.66894114],"genre_scores_gemma":[0.0011664426,0.000047194106,0.052013967,0.00095307996,0.00037841525,0.0000047865205,0.000030129815,0.000029896693,0.9453761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905354,0.000007776677,0.00017184994,0.00040749455,0.00019455384,0.00016476438],"domain_scores_gemma":[0.99908215,0.000036329526,0.00009460218,0.0006159905,0.00008621231,0.000084694395],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001342193,0.00021645655,0.00017873645,0.00017941432,0.00011393676,0.00009067919,0.0007841809,0.00018451508,0.0013531325],"category_scores_gemma":[0.0000014915789,0.00018726663,0.00016733835,0.000041295527,0.00010832189,0.00017843534,0.00019032393,0.00016187069,0.0014398562],"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.000001468404,0.000005378065,4.270272e-7,0.000004356473,0.000019916715,0.00001545387,0.00004826794,2.9708139e-7,0.000015923526,0.9852377,0.006121418,0.008529398],"study_design_scores_gemma":[0.00007530125,0.000092885726,0.000005422759,0.00004708665,0.000008987835,0.000033627464,0.0000010523562,0.0005116942,0.00013788266,0.9384351,0.060396634,0.0002543542],"about_ca_topic_score_codex":0.0000010768305,"about_ca_topic_score_gemma":0.0000024227068,"teacher_disagreement_score":0.27801672,"about_ca_system_score_codex":0.000012498333,"about_ca_system_score_gemma":0.000021140248,"threshold_uncertainty_score":0.99955976},"labels":[],"label_agreement":null},{"id":"W4249281694","doi":"10.1007/978-3-030-68514-0","title":"Algorithm Portfolios","year":2021,"lang":"en","type":"book","venue":"SpringerBriefs in optimization","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science","score_opus":0.006267478902925279,"score_gpt":0.20359211532355234,"score_spread":0.19732463642062706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249281694","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":[4.3625212e-7,0.0010439663,0.8171323,0.00008285155,0.0010045297,0.00018992943,0.0000070748397,0.00018116384,0.18035772],"genre_scores_gemma":[0.0000080149675,0.00033008237,0.7049867,0.00027711826,0.0002534174,0.000025438456,0.00013426974,0.000048276797,0.29393673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979035,0.00007629023,0.00050692185,0.00080751715,0.0003434795,0.00036226003],"domain_scores_gemma":[0.9985366,0.000054340217,0.00025711374,0.00091863936,0.00013561384,0.00009771149],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041957342,0.00033875488,0.0004249073,0.00043788835,0.00008347576,0.00023351269,0.000918765,0.00038334183,0.00018010827],"category_scores_gemma":[0.0000458285,0.00040728433,0.00015433723,0.0005237174,0.00005953217,0.00044865662,0.00042367756,0.0004911369,0.000043826563],"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.0000034959344,0.00015565402,0.000020446829,0.00011729622,0.00008422004,0.0008741818,0.0005753521,0.2801707,0.0000032152627,0.55207944,0.0037573501,0.16215864],"study_design_scores_gemma":[0.0006246151,0.000057635403,0.00003186836,0.00064600614,0.000021671362,0.00007421166,0.0000100238485,0.7895876,0.00011437399,0.14339094,0.064289875,0.0011511733],"about_ca_topic_score_codex":0.0000047971703,"about_ca_topic_score_gemma":0.0000020321363,"teacher_disagreement_score":0.50941694,"about_ca_system_score_codex":0.00019655631,"about_ca_system_score_gemma":0.00039400786,"threshold_uncertainty_score":0.9998379},"labels":[],"label_agreement":null},{"id":"W4250104637","doi":"10.1007/978-1-4614-6170-8_100595","title":"Graph-Theory","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.009970754573769756,"score_gpt":0.19449346749198176,"score_spread":0.184522712918212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250104637","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.195436e-7,0.0001010706,0.47996473,0.00005804645,0.00036472548,0.000045364075,0.0000011448906,0.00019400602,0.5192707],"genre_scores_gemma":[0.00046956103,0.000030139747,0.012551663,0.0010795313,0.00016142738,0.0000031630261,0.0000039684624,0.00002475513,0.9856758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886113,0.000035318695,0.00019821456,0.00047389686,0.00022124086,0.00021016746],"domain_scores_gemma":[0.99863404,0.00014353302,0.000099965786,0.0009631071,0.00005009935,0.00010924213],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005000844,0.0002711135,0.00025831454,0.00021325375,0.0000908681,0.000093249924,0.0012540926,0.00021503402,0.00077694096],"category_scores_gemma":[0.000007263049,0.00022519894,0.00024331301,0.000036498666,0.00010807155,0.000095358366,0.00025984,0.00026647636,0.0014913694],"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.0000011168993,0.0000025192908,1.3853492e-7,0.000005972029,0.00002417577,0.0000109251105,0.00002317586,7.294436e-7,0.0000020908797,0.92043686,0.0020021754,0.07749011],"study_design_scores_gemma":[0.000056918845,0.000033260178,0.0000010675573,0.000023404038,0.000007407576,0.00001316056,5.3442795e-7,0.00011795193,0.000032052263,0.74769455,0.2517811,0.00023856427],"about_ca_topic_score_codex":5.1876367e-7,"about_ca_topic_score_gemma":6.7375e-7,"teacher_disagreement_score":0.46741307,"about_ca_system_score_codex":0.00000806758,"about_ca_system_score_gemma":0.000023204317,"threshold_uncertainty_score":0.99928606},"labels":[],"label_agreement":null},{"id":"W4250585153","doi":"10.1007/978-1-4939-7131-2_100426","title":"Graph Drawing","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.015314398469573694,"score_gpt":0.2147781072110853,"score_spread":0.19946370874151162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250585153","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000025836744,0.0000834385,0.28457433,0.000067668385,0.0006112997,0.00005098415,0.000001318583,0.00022205916,0.71438634],"genre_scores_gemma":[0.0002759583,0.000019828582,0.02473398,0.00054724305,0.0002663999,0.000001702776,0.0000025065706,0.000018680337,0.97413373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990083,0.000008872753,0.00016448149,0.00042292426,0.00020282147,0.00019257441],"domain_scores_gemma":[0.9990251,0.000039421615,0.00007473768,0.0007165206,0.00006124297,0.00008297067],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00018223781,0.00021589622,0.00018511765,0.00018083115,0.000115902985,0.00013034865,0.0010257304,0.00016654207,0.0019769424],"category_scores_gemma":[0.000003249977,0.00018203404,0.00018074307,0.000042500298,0.000111890935,0.00019899776,0.00028724276,0.00018206505,0.0029729235],"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":[4.254224e-7,0.0000024467806,2.6789385e-7,0.000003706565,0.000019514493,0.000016833568,0.00006887421,1.6707236e-7,0.0000040254617,0.984781,0.0058197323,0.00928299],"study_design_scores_gemma":[0.00004551546,0.000036865975,0.0000014434868,0.00003559066,0.000005231213,0.00001318354,0.0000014072931,0.00016430851,0.000081167535,0.7982346,0.20115888,0.00022180461],"about_ca_topic_score_codex":0.000001091738,"about_ca_topic_score_gemma":9.2793283e-7,"teacher_disagreement_score":0.25984034,"about_ca_system_score_codex":0.000008372394,"about_ca_system_score_gemma":0.000026820944,"threshold_uncertainty_score":0.9989354},"labels":[],"label_agreement":null},{"id":"W4250896559","doi":"10.1007/978-1-4939-7131-2_100438","title":"Graph Representation","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Graph; Computer science; Mathematics; Theoretical computer science","score_opus":0.023921302137159765,"score_gpt":0.24567630666109308,"score_spread":0.22175500452393332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250896559","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027934161,0.000038267724,0.31128004,0.00008305008,0.00045721186,0.0000625423,0.0000013556079,0.00016305129,0.6879117],"genre_scores_gemma":[0.00026285095,0.000030670144,0.020792,0.00032988028,0.00021759489,0.000002791437,0.00000788704,0.000013429877,0.9783429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991183,0.000011450126,0.0001534301,0.00039896957,0.00019655697,0.00012125404],"domain_scores_gemma":[0.9990327,0.000037280086,0.00008773724,0.0007094866,0.00007613046,0.000056716854],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00012669215,0.0001523923,0.00013683664,0.00015819215,0.000071776834,0.00009047578,0.0006569963,0.00012864382,0.001358283],"category_scores_gemma":[0.00000457175,0.00013150784,0.0001319476,0.00004764427,0.00008401384,0.00021050542,0.00017417726,0.00011573667,0.0013198223],"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":[7.771379e-7,0.0000026166522,6.088447e-7,0.0000022205584,0.000015904785,0.00000912493,0.0000773984,3.180778e-7,0.0000048121797,0.97700375,0.008181744,0.0147007],"study_design_scores_gemma":[0.00005479721,0.00003869429,0.000006524153,0.00001734189,0.000005526594,0.0000110204355,0.0000021626538,0.00026104806,0.00019400475,0.9331627,0.066075996,0.00017019347],"about_ca_topic_score_codex":0.0000020411462,"about_ca_topic_score_gemma":0.0000018247888,"teacher_disagreement_score":0.29048806,"about_ca_system_score_codex":0.000006852984,"about_ca_system_score_gemma":0.000017031021,"threshold_uncertainty_score":0.99955463},"labels":[],"label_agreement":null},{"id":"W4251054943","doi":"10.1007/978-1-4939-7131-2_101288","title":"Subgraph Matching","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Matching (statistics); Computer science; Mathematics; Statistics","score_opus":0.013354473787494518,"score_gpt":0.21163230671191496,"score_spread":0.19827783292442044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251054943","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008738917,0.00007532683,0.31254417,0.000074005744,0.0005395,0.000053089087,0.0000019621182,0.0002375086,0.6864657],"genre_scores_gemma":[0.0005560685,0.000026353659,0.034859214,0.00059812976,0.00026194114,0.0000018433083,0.0000035161968,0.00002328843,0.96366966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989831,0.000010111635,0.00017390918,0.0004240077,0.00021257547,0.00019631631],"domain_scores_gemma":[0.9990037,0.00004381496,0.00008576331,0.0007282521,0.000054497217,0.000083973166],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00020818811,0.00022806325,0.00019412093,0.00017522018,0.00010961129,0.00013979073,0.0010888054,0.00016772466,0.0016187228],"category_scores_gemma":[0.0000017744819,0.00019127109,0.0001749464,0.00003706463,0.00008881134,0.00020304903,0.00030079455,0.00020886933,0.001921585],"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":[5.656007e-7,0.0000027115766,2.3184911e-7,0.000004855064,0.00001934281,0.000016885157,0.00013859484,2.1407259e-7,0.0000049420437,0.9882457,0.002742653,0.008823255],"study_design_scores_gemma":[0.000044018052,0.000032633863,0.0000020568755,0.00003817661,0.0000050534904,0.000018644172,0.0000024020067,0.00011648797,0.00005596817,0.8769285,0.12251695,0.00023907115],"about_ca_topic_score_codex":0.000002745891,"about_ca_topic_score_gemma":0.0000034701254,"teacher_disagreement_score":0.27768496,"about_ca_system_score_codex":0.000008857563,"about_ca_system_score_gemma":0.000024609433,"threshold_uncertainty_score":0.9992939},"labels":[],"label_agreement":null},{"id":"W4251100610","doi":"10.1007/978-1-4939-7131-2_100427","title":"Graph Exploration","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Geology","score_opus":0.02864441073644147,"score_gpt":0.22193125016995696,"score_spread":0.1932868394335155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251100610","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.777892e-7,0.000034243338,0.46486542,0.000102967926,0.00040931787,0.000049516093,0.0000010504494,0.00015210142,0.5343847],"genre_scores_gemma":[0.00020917987,0.000049908,0.022607092,0.0004152286,0.0002744446,0.0000046835253,0.00000912688,0.00001592437,0.97641444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992102,0.000009238755,0.00014529064,0.00033596944,0.00017867814,0.000120619115],"domain_scores_gemma":[0.99919707,0.000021632657,0.00007660024,0.0005710052,0.000077258,0.00005645197],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00014172136,0.00016785435,0.00013129045,0.00015645103,0.00007961418,0.000102713166,0.00062044314,0.00013842917,0.00094104983],"category_scores_gemma":[0.0000025667846,0.00014210792,0.00010958376,0.000038080958,0.00007057393,0.0004594376,0.00014210743,0.00011426586,0.0019140532],"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":[5.7878356e-7,0.0000027686103,5.6694393e-8,0.0000024080696,0.000010649603,0.0000051085945,0.00011302353,3.8494696e-7,0.0000033915603,0.98064613,0.006151602,0.013063878],"study_design_scores_gemma":[0.000040327774,0.000052085194,4.184448e-7,0.000018246317,0.0000037773696,0.000004288151,0.000002415658,0.0002798736,0.00011891171,0.85343844,0.14587231,0.00016888556],"about_ca_topic_score_codex":6.16752e-7,"about_ca_topic_score_gemma":0.0000023039001,"teacher_disagreement_score":0.44225833,"about_ca_system_score_codex":0.0000071298587,"about_ca_system_score_gemma":0.00001998726,"threshold_uncertainty_score":0.9999722},"labels":[],"label_agreement":null},{"id":"W4251528148","doi":"10.1007/978-1-4939-7131-2_100423","title":"Graph Analysis","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.012781876744152185,"score_gpt":0.21366495102496774,"score_spread":0.20088307428081556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251528148","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000019377364,0.000057036097,0.42220032,0.000043080297,0.0001778527,0.000031169522,0.0000031014288,0.00013398813,0.5773515],"genre_scores_gemma":[0.0006806808,0.000028179935,0.0218982,0.00039366996,0.00013232745,0.0000017652129,0.000009695286,0.000011872541,0.9768436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892336,0.0000114257255,0.00018367537,0.0004832741,0.00022943543,0.00016881806],"domain_scores_gemma":[0.99871475,0.000036719466,0.00009706975,0.000976959,0.0000845174,0.0000900003],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019106624,0.00021378814,0.0002978215,0.0006331563,0.00008159619,0.00010880746,0.0010802425,0.00016276984,0.0036016635],"category_scores_gemma":[0.0000023342795,0.00017430079,0.00050667743,0.00024849933,0.00010549604,0.00013397895,0.00023062117,0.00013925428,0.001166132],"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":[4.6920894e-7,0.000003505173,0.0000021522203,0.0000017342712,0.0004719474,0.000011224432,0.00004204747,0.0000016302206,5.4782834e-7,0.99245316,0.0023330657,0.004678496],"study_design_scores_gemma":[0.000039086004,0.000036475136,0.000013913848,0.0000071530503,0.00020651036,0.0000027740334,0.0000010526805,0.00095858646,0.000025895732,0.89949715,0.098943464,0.00026792465],"about_ca_topic_score_codex":0.0000027724222,"about_ca_topic_score_gemma":0.00001060542,"teacher_disagreement_score":0.4003021,"about_ca_system_score_codex":0.000007536881,"about_ca_system_score_gemma":0.000018384282,"threshold_uncertainty_score":0.99961156},"labels":[],"label_agreement":null},{"id":"W4251647606","doi":"10.1007/978-1-4939-7131-2_100042","title":"Attributed Graph","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.019186255584909565,"score_gpt":0.2147478646408803,"score_spread":0.19556160905597075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251647606","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000016401291,0.000082703875,0.3718833,0.00010713689,0.00054983277,0.000071958566,0.000007873885,0.00028714663,0.6270084],"genre_scores_gemma":[0.00014567621,0.000033443626,0.020476637,0.00062536704,0.00018177615,0.0000027108051,0.000014573789,0.000020813202,0.978499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887496,0.000013331815,0.0001910343,0.0004713286,0.00022748465,0.00022186583],"domain_scores_gemma":[0.99879175,0.000044992634,0.000090780384,0.0008539824,0.00011365224,0.000104830695],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00021782963,0.00025155442,0.00023862692,0.00019321778,0.00009992033,0.00010162254,0.0011752971,0.00022428401,0.0022214067],"category_scores_gemma":[0.0000049764662,0.00020953004,0.00019706796,0.00006545859,0.0001296172,0.00016633017,0.0003134926,0.00019852328,0.0025803407],"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":[8.282994e-7,0.000004450079,3.307419e-7,0.0000032606772,0.000032687327,0.000017478293,0.000029471681,1.5574797e-7,0.00000310149,0.9743216,0.017596768,0.00798987],"study_design_scores_gemma":[0.00006851814,0.000051016348,0.0000030978729,0.000021194537,0.000006908184,0.000013612513,5.8980345e-7,0.00016265412,0.00008115967,0.6839481,0.31541833,0.00022483646],"about_ca_topic_score_codex":0.0000013505256,"about_ca_topic_score_gemma":0.0000024164824,"teacher_disagreement_score":0.35149062,"about_ca_system_score_codex":0.000010763152,"about_ca_system_score_gemma":0.000030574003,"threshold_uncertainty_score":0.9986907},"labels":[],"label_agreement":null},{"id":"W4252958138","doi":"10.1007/978-1-4939-7131-2_100434","title":"Graph Partitioning","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.016941161906403567,"score_gpt":0.2124372565675754,"score_spread":0.19549609466117182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252958138","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000021228338,0.00005912022,0.31695133,0.00007186772,0.0003987952,0.00003953415,0.0000015938646,0.00018890816,0.68228674],"genre_scores_gemma":[0.00055078114,0.000023828921,0.02425775,0.0005482416,0.0002614518,0.00000351437,0.0000055898004,0.00001549905,0.97433335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991966,0.0000081973485,0.00014417434,0.00033310824,0.00016076557,0.00015717577],"domain_scores_gemma":[0.99925107,0.000029704608,0.00007057845,0.0005183787,0.00006106744,0.00006921369],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000148605,0.00016186749,0.00013834,0.00012302196,0.000119530785,0.00011327633,0.000604278,0.00012320164,0.0022915467],"category_scores_gemma":[0.0000029756213,0.00014104907,0.00012923377,0.00003468426,0.00009967495,0.00018109722,0.00016719787,0.00013790872,0.0018571273],"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":[3.476951e-7,0.0000023610776,4.4827576e-7,0.0000026378373,0.000014584496,0.000009536714,0.000052613257,4.1781388e-7,0.0000016646649,0.98936605,0.005514372,0.005034974],"study_design_scores_gemma":[0.000038552433,0.000037228492,0.0000022516663,0.000035731744,0.000004679881,0.000010549572,0.0000011698842,0.00021151445,0.000076324504,0.8421273,0.15727882,0.00017583925],"about_ca_topic_score_codex":8.686197e-7,"about_ca_topic_score_gemma":0.0000021301307,"teacher_disagreement_score":0.2926936,"about_ca_system_score_codex":0.0000067001756,"about_ca_system_score_gemma":0.000019832347,"threshold_uncertainty_score":0.99892},"labels":[],"label_agreement":null},{"id":"W4253057875","doi":"10.1007/978-1-4614-6170-8_100261","title":"Spectral Graph Analysis","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Graph; Computer science; Theoretical computer science","score_opus":0.009935304884375685,"score_gpt":0.20350227736431725,"score_spread":0.19356697247994156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253057875","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023317077,0.000043678647,0.4909549,0.000074136035,0.00015197757,0.000031379124,0.0000019195447,0.00013384347,0.50860584],"genre_scores_gemma":[0.0058238325,0.000029586976,0.021875637,0.00047421656,0.00016473174,0.000001918911,0.0000128424335,0.000016367794,0.9716009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875706,0.00001797619,0.00021765435,0.0005285651,0.00025801055,0.00022072688],"domain_scores_gemma":[0.9987132,0.000053510994,0.000110274734,0.0009650684,0.000044391858,0.00011353517],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023341623,0.00025856556,0.00039944597,0.0006546638,0.000077470184,0.00012369452,0.0010981059,0.00016413802,0.0009302269],"category_scores_gemma":[0.0000025233878,0.00021484074,0.0006857767,0.00021628966,0.00006987905,0.000084566425,0.00016020756,0.00022490723,0.00048227684],"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":[5.5125935e-7,0.0000030103868,0.0000052041933,0.000002570025,0.0004027095,0.000013081466,0.000017248421,0.000032856125,9.833991e-7,0.9913704,0.00058721745,0.0075641694],"study_design_scores_gemma":[0.00006608073,0.0000423375,0.000054054617,0.000007896646,0.0002602782,0.0000052277464,5.58256e-7,0.004179908,0.00003412396,0.93467355,0.060297992,0.00037800224],"about_ca_topic_score_codex":0.00000509074,"about_ca_topic_score_gemma":0.00001539468,"teacher_disagreement_score":0.4690793,"about_ca_system_score_codex":0.000010158097,"about_ca_system_score_gemma":0.000016389316,"threshold_uncertainty_score":0.9999831},"labels":[],"label_agreement":null},{"id":"W4253119387","doi":"10.1007/978-1-4939-7131-2_100428","title":"Graph Matching","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Matching (statistics); Mathematics; Statistics","score_opus":0.014037628311400957,"score_gpt":0.2138935551456571,"score_spread":0.19985592683425615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253119387","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032881744,0.000054952845,0.4132763,0.000060555652,0.00046728586,0.000041796895,0.0000014967072,0.00018883757,0.58590543],"genre_scores_gemma":[0.00023348269,0.000023447266,0.044357747,0.00062712823,0.00024654268,0.00000172544,0.0000029425921,0.000020887637,0.9544861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905294,0.000009145299,0.00016144771,0.000397977,0.00019897829,0.00017953588],"domain_scores_gemma":[0.99907714,0.000038007343,0.00007998561,0.00067911786,0.000048384893,0.00007734949],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00018809203,0.0002127163,0.00018019788,0.00016450754,0.000106317384,0.00012676149,0.0010293607,0.00015370324,0.0014396074],"category_scores_gemma":[0.0000015786408,0.00017688406,0.00016378725,0.000033599037,0.0000820955,0.00019306013,0.0002993498,0.00019691545,0.0018235348],"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":[4.5293672e-7,0.000002469058,7.048677e-8,0.0000044227395,0.000018309347,0.000015176132,0.00012834978,5.092453e-7,0.0000039494626,0.9882655,0.0028570178,0.00870376],"study_design_scores_gemma":[0.000041711723,0.000031551826,8.659191e-7,0.000038532802,0.000004776686,0.000018170813,0.000002303123,0.00006520897,0.00004335285,0.9200788,0.07944868,0.00022602749],"about_ca_topic_score_codex":0.0000021346896,"about_ca_topic_score_gemma":0.000002279262,"teacher_disagreement_score":0.3689186,"about_ca_system_score_codex":0.000007728477,"about_ca_system_score_gemma":0.000021207852,"threshold_uncertainty_score":0.9994732},"labels":[],"label_agreement":null},{"id":"W4253544295","doi":"10.1109/asonam.2016.7752361","title":"An experimental evaluation of giraph and GraphChi","year":2016,"lang":"en","type":"article","venue":"2016 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"PageRank; Computer science; Implementation; Computation; Graph; Parallel computing; Theoretical computer science; Computer cluster; Focus (optics); Distributed computing; Operating system; Algorithm; Programming language","score_opus":0.036848360576902904,"score_gpt":0.350615048449353,"score_spread":0.3137666878724501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253544295","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.821766,0.0012262387,0.17376734,0.0003291789,0.0005324939,0.00012425033,0.000016662932,0.000029093868,0.0022087023],"genre_scores_gemma":[0.9960107,0.0008347029,0.0028781998,0.000060484494,0.00013572592,0.00002365869,0.000006888841,0.000005479235,0.000044119173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983478,0.00022300442,0.00031387745,0.0004521642,0.00047445737,0.00018866356],"domain_scores_gemma":[0.99907315,0.00016092368,0.00024256372,0.00022705946,0.00022828336,0.00006802333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009188164,0.00015952665,0.00027534508,0.0002838159,0.0001309612,0.00008651426,0.00054814504,0.00007522247,0.00008220118],"category_scores_gemma":[0.000041383642,0.00012065861,0.00009543985,0.00044128313,0.00021511693,0.00077795936,0.00009078413,0.00007912237,8.034151e-7],"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.000098353004,0.00025099664,0.026342038,0.0000041436156,0.00031951294,0.0000036069448,0.0021221414,0.002011428,0.0023016264,0.34004387,0.000045634057,0.6264566],"study_design_scores_gemma":[0.0025466108,0.0004297389,0.04168535,0.00026591413,0.00021857933,0.0000037931482,0.0017240355,0.86003065,0.0013507289,0.090784006,0.00029950571,0.0006611007],"about_ca_topic_score_codex":0.000009700962,"about_ca_topic_score_gemma":0.00005130465,"teacher_disagreement_score":0.85801923,"about_ca_system_score_codex":0.00003348943,"about_ca_system_score_gemma":0.00003376737,"threshold_uncertainty_score":0.49203154},"labels":[],"label_agreement":null},{"id":"W4255491308","doi":"10.1007/978-1-4939-7131-2_100263","title":"DeepGraph","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.013053519309933674,"score_gpt":0.2046377372917908,"score_spread":0.19158421798185712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255491308","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000011668286,0.00009601496,0.26157793,0.000066625544,0.00048147546,0.00005000169,0.0000016242326,0.00020822481,0.73751694],"genre_scores_gemma":[0.00012990774,0.000026576294,0.028352275,0.00058715785,0.00021428165,0.0000017799398,0.0000025799293,0.000015937212,0.9706695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991168,0.000007234541,0.00014312555,0.0003848476,0.0001807596,0.00016723415],"domain_scores_gemma":[0.99901223,0.00003226448,0.00006669602,0.0007424066,0.00006423509,0.000082179075],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013743207,0.00019783492,0.00016481243,0.00015480844,0.00007536863,0.00008785156,0.0010345072,0.00016752104,0.0024183795],"category_scores_gemma":[0.0000025445997,0.00016323851,0.00015966014,0.00003510288,0.000109341265,0.00013970464,0.00024779222,0.00015112442,0.0028468256],"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":[4.4664637e-7,0.000002606656,2.1821492e-7,0.0000025989139,0.000018122633,0.000012908572,0.000044712408,5.6081173e-8,0.0000015167315,0.97663593,0.007920216,0.015360644],"study_design_scores_gemma":[0.000036109122,0.00003812834,0.0000012563789,0.000016267648,0.000004033119,0.000011542557,6.5991475e-7,0.00015014861,0.000050016803,0.69015676,0.30936185,0.0001732056],"about_ca_topic_score_codex":6.6697766e-7,"about_ca_topic_score_gemma":0.0000018972707,"teacher_disagreement_score":0.30144164,"about_ca_system_score_codex":0.0000068585164,"about_ca_system_score_gemma":0.000024002115,"threshold_uncertainty_score":0.99849355},"labels":[],"label_agreement":null},{"id":"W4255497863","doi":"10.1007/978-3-319-70151-6_5","title":"Graphs and Trees","year":2018,"lang":"en","type":"book-chapter","venue":"Undergraduate topics in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Tree traversal; Graph traversal; Floyd–Warshall algorithm; Dijkstra's algorithm; Computer science; Enhanced Data Rates for GSM Evolution; Combinatorics; Breadth-first search; Mathematics; Algorithm; Discrete mathematics; Shortest path problem; Theoretical computer science; Graph; Artificial intelligence","score_opus":0.018086392220796037,"score_gpt":0.2351433232438299,"score_spread":0.21705693102303386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255497863","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.00085305725,0.0004908821,0.8729582,0.0031975876,0.0037142856,0.00040132547,0.0000055824235,0.0003753209,0.1180038],"genre_scores_gemma":[0.07484898,0.0015080692,0.6614543,0.0036014393,0.0014679637,0.000025302386,0.000010125468,0.0001233224,0.2569605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711436,0.000031697087,0.00040025267,0.0012895379,0.00063164916,0.0005325162],"domain_scores_gemma":[0.9982068,0.000103795945,0.0001781202,0.00115475,0.00014967537,0.000206873],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008008166,0.00040396885,0.00038115244,0.00086408993,0.00031278742,0.0005858336,0.0024970174,0.00017315448,0.000015597376],"category_scores_gemma":[0.000013447295,0.00037944128,0.00009692413,0.0004242852,0.0015635964,0.00071101595,0.0014783451,0.00041290955,0.00005560695],"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":[9.946848e-7,0.000012107914,0.00002607592,0.000010424057,0.000006865113,0.000044701323,0.000267176,0.000015594378,0.000004143282,0.8932783,0.00023088585,0.10610272],"study_design_scores_gemma":[0.00019386358,0.00014781122,0.00017031415,0.0001355768,0.0000046918526,0.00005708914,0.0000011510947,0.03917237,0.00006087551,0.94931775,0.010294394,0.00044411322],"about_ca_topic_score_codex":0.000006019224,"about_ca_topic_score_gemma":0.000036950314,"teacher_disagreement_score":0.21150386,"about_ca_system_score_codex":0.00007056381,"about_ca_system_score_gemma":0.00018667502,"threshold_uncertainty_score":0.9998658},"labels":[],"label_agreement":null},{"id":"W4280534476","doi":"10.5194/isprs-annals-v-4-2022-173-2022","title":"MULTI-RESOLUTION REPRESENTATION USING GRAPH DATABASE","year":2022,"lang":"en","type":"article","venue":"ISPRS annals of the photogrammetry, remote sensing and spatial information sciences","topic":"Graph Theory 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":"University of Calgary","funders":"","keywords":"Computer science; Graph traversal; Graph database; Tree traversal; Representation (politics); Database; Information retrieval; Graph; Spatial database; Object (grammar); Data mining; Theoretical computer science; Spatial analysis; Artificial intelligence; Algorithm","score_opus":0.09414068184610402,"score_gpt":0.33316492918041163,"score_spread":0.2390242473343076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280534476","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.04748656,0.00006611124,0.9508926,0.0005780748,0.00060152874,0.000220552,0.000017792921,0.000040375606,0.000096390926],"genre_scores_gemma":[0.9627372,0.000024740553,0.036599517,0.0006063938,0.000016369419,2.7785052e-7,0.0000056185236,0.0000025370568,0.000007328978],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823,0.00029132093,0.00039631088,0.00021063525,0.00062306307,0.00024867905],"domain_scores_gemma":[0.9988884,0.00009251635,0.0004321748,0.0003735054,0.00014954404,0.000063869426],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001781035,0.00011300105,0.0001431854,0.00036305469,0.0013758267,0.00024190168,0.000566888,0.000025428295,0.0000037593102],"category_scores_gemma":[0.00019077735,0.000088698835,0.000104109895,0.0016986491,0.0003158328,0.00084322895,0.0005351257,0.0001459583,7.32581e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016290494,0.000022838274,0.00009132853,0.000020336016,0.000011466445,7.640672e-7,0.001685219,0.026972815,0.002752832,0.00015129326,0.000072657975,0.9682022],"study_design_scores_gemma":[0.00016145037,0.00006522282,0.00037660942,0.000043594453,0.000005108901,0.00003871612,0.0006975344,0.98659,0.009267092,0.0024710507,0.00016891662,0.000114694914],"about_ca_topic_score_codex":0.064746395,"about_ca_topic_score_gemma":0.00087182684,"teacher_disagreement_score":0.96808743,"about_ca_system_score_codex":0.000010344228,"about_ca_system_score_gemma":0.00006971639,"threshold_uncertainty_score":0.99992424},"labels":[],"label_agreement":null},{"id":"W4281391497","doi":"10.1145/3534540.3534690","title":"Anti-vertex for neighborhood constraints in subgraph queries","year":2022,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Computer science; Combinatorics; Theoretical computer science; Mathematics; Graph","score_opus":0.00933439151572637,"score_gpt":0.21932256182916446,"score_spread":0.20998817031343808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281391497","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.068237185,0.00010308389,0.91638285,0.0014194302,0.0010286984,0.0004429788,0.000030963845,0.00024438222,0.012110442],"genre_scores_gemma":[0.9897855,0.0000021958879,0.009316207,0.0005996044,0.000008060576,0.000070674294,0.000003079703,0.000004332251,0.00021032363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991795,0.000066272616,0.00014145915,0.00025396445,0.00012568032,0.00023312203],"domain_scores_gemma":[0.99955666,0.0001138778,0.00003109536,0.00023974212,0.00001866769,0.000039976163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035996072,0.00008149097,0.00012278417,0.00014310092,0.00019251072,0.00005093868,0.00056995545,0.000016471786,0.00021509622],"category_scores_gemma":[0.000016331429,0.000077977704,0.0000691721,0.0004806731,0.000079208934,0.00022469807,0.00019900472,0.00009463266,0.0000045275383],"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.00000376594,0.0000640777,0.0021582749,0.000003561019,0.000005880286,0.000010330039,0.00039690943,0.00004292351,0.00021119896,0.9777336,0.00027192684,0.019097527],"study_design_scores_gemma":[0.0016975541,0.0003637064,0.011517915,0.000008038508,0.0000045839606,0.00007042406,0.0014797464,0.05785503,0.0024269142,0.9186638,0.0054240697,0.00048819743],"about_ca_topic_score_codex":0.000009545649,"about_ca_topic_score_gemma":0.0000065528607,"teacher_disagreement_score":0.92154837,"about_ca_system_score_codex":0.000012414761,"about_ca_system_score_gemma":0.000044730135,"threshold_uncertainty_score":0.31798384},"labels":[],"label_agreement":null},{"id":"W4282970690","doi":"10.1145/3524059.3532365","title":"MASTIFF","year":2022,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Queen's University; Queen's University Belfast; CHIST-ERA; Department for the Economy","keywords":"Computer science; Algorithm; Theoretical computer science","score_opus":0.005949135033091081,"score_gpt":0.1806415183000282,"score_spread":0.17469238326693712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282970690","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.006207461,0.000020847561,0.93699104,0.00096441776,0.00044730812,0.000027880287,6.645558e-7,0.0001922893,0.05514812],"genre_scores_gemma":[0.9721161,1.9078486e-7,0.022532424,0.0009449778,0.000012170413,0.000010498255,3.2555087e-7,0.0000013836296,0.004381895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996937,0.000028602139,0.000031427346,0.00008939467,0.000086294334,0.0000705974],"domain_scores_gemma":[0.999794,0.00001404865,0.0000069670587,0.00016161827,0.0000037861291,0.000019583284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119403216,0.000021593103,0.00002168747,0.000026952222,0.00015019366,0.000020285499,0.0004307918,0.0000024939554,0.00062744936],"category_scores_gemma":[0.0000016299801,0.000019319657,0.000018004008,0.00018323216,0.000005927412,0.0000755809,0.00031440053,0.00004509018,0.000048293154],"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":[3.0925162e-7,0.000012687346,0.000039325707,1.9445856e-7,0.0000010738553,0.000006906473,0.000096698604,0.00008924244,0.00007217128,0.9762406,0.0011356906,0.02230511],"study_design_scores_gemma":[0.00019161882,0.00010512763,0.00060811377,3.6504824e-7,8.81985e-7,0.000065394364,0.00014363849,0.07136195,0.0010766332,0.8013282,0.12496422,0.00015389196],"about_ca_topic_score_codex":0.0000014059324,"about_ca_topic_score_gemma":8.142742e-8,"teacher_disagreement_score":0.96590865,"about_ca_system_score_codex":0.0000044337585,"about_ca_system_score_gemma":0.000006902925,"threshold_uncertainty_score":0.6870131},"labels":[],"label_agreement":null},{"id":"W4285163476","doi":"10.1090/stml/097/04","title":"Graph burning","year":2022,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science","score_opus":0.012394117939400795,"score_gpt":0.22366261445014432,"score_spread":0.21126849651074353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285163476","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015847936,0.00049786776,0.029855406,0.000510949,0.00040672257,0.0002930684,0.00001839613,0.0006304328,0.9677713],"genre_scores_gemma":[0.00074422196,0.00015793399,0.035600644,0.0010794391,0.00026930016,0.00006833681,0.000046981288,0.00012953085,0.96190363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977515,0.000054093292,0.0004695922,0.0006029688,0.0007930327,0.00032886723],"domain_scores_gemma":[0.99839497,0.00028927685,0.00018825052,0.00093705097,0.000011115481,0.00017934917],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002378543,0.0003930204,0.0004924207,0.00025410185,0.00019314716,0.00031098345,0.0023978464,0.00013884266,0.008835445],"category_scores_gemma":[0.000008420877,0.00034534122,0.00037779458,0.00011581055,0.00010592675,0.00078499364,0.002548357,0.000703572,0.000755564],"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.0000018943582,0.00006587593,0.0000033236222,0.00006137544,0.00008350581,0.00019628939,0.0003829297,0.0000025294162,0.0000011185189,0.99422514,0.0028290006,0.0021469847],"study_design_scores_gemma":[0.00010820769,0.00008073397,0.0000058313267,0.00010196913,0.000022958913,0.00003608392,0.000016811347,0.00013290883,0.0000067229407,0.861867,0.13726355,0.0003572315],"about_ca_topic_score_codex":5.888613e-8,"about_ca_topic_score_gemma":9.818397e-9,"teacher_disagreement_score":0.13443455,"about_ca_system_score_codex":0.00001388623,"about_ca_system_score_gemma":0.00004599865,"threshold_uncertainty_score":0.99989986},"labels":[],"label_agreement":null},{"id":"W4285254141","doi":"10.1090/stml/097/03","title":"Graph searching","year":2022,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science","score_opus":0.015131610424055607,"score_gpt":0.2394509579475331,"score_spread":0.22431934752347749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285254141","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019577321,0.00032730427,0.031617686,0.0006908926,0.0003234445,0.00033598783,0.000024913807,0.00057316385,0.96608704],"genre_scores_gemma":[0.0008585988,0.0001644092,0.041814297,0.0011339757,0.00027401792,0.00006819205,0.00004899579,0.00014268034,0.9554948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976183,0.000075344025,0.00042623148,0.0006015098,0.00092229474,0.00035630746],"domain_scores_gemma":[0.99831015,0.00036091657,0.00013780693,0.0009798019,0.000009997317,0.00020133836],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000313179,0.00036515552,0.00045342225,0.00027858975,0.00021266322,0.00036178972,0.0026259804,0.00011760557,0.006484273],"category_scores_gemma":[0.0000088508805,0.00031915164,0.00036630928,0.00011153996,0.00011733669,0.00083137915,0.0031587495,0.0008294605,0.0007158557],"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.0000021252788,0.000073034644,0.0000028645338,0.0000755619,0.00008211664,0.00019107903,0.0004670934,0.0000021501007,0.0000011600869,0.9934568,0.002471339,0.0031747175],"study_design_scores_gemma":[0.00010420342,0.00007956783,0.0000070464857,0.00009785741,0.000016936327,0.000032692486,0.00001670395,0.00017925532,0.000006853011,0.9113388,0.08778397,0.00033610023],"about_ca_topic_score_codex":9.442449e-8,"about_ca_topic_score_gemma":1.6070418e-8,"teacher_disagreement_score":0.08531263,"about_ca_system_score_codex":0.00001479676,"about_ca_system_score_gemma":0.00005855396,"threshold_uncertainty_score":0.99992603},"labels":[],"label_agreement":null},{"id":"W4287284579","doi":"10.48550/arxiv.2103.02284","title":"Columnar Storage and List-based Processing for Graph Database Management\\n Systems","year":2021,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Theory 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":"University of Waterloo","funders":"","keywords":"Computer science; Joins; Scalability; Column (typography); Block (permutation group theory); Graph; Query optimization; Database; Online aggregation; Parallel computing; Relational database management system; Set (abstract data type); Theoretical computer science; Sargable; Relational database; Information retrieval; Web search query; Programming language; Search engine; Computer network","score_opus":0.05828580466625022,"score_gpt":0.18791107862743656,"score_spread":0.12962527396118634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287284579","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.11497243,0.0010695172,0.8797437,0.000041144634,0.0014906339,0.0016525012,0.00019382052,0.00019970392,0.0006365427],"genre_scores_gemma":[0.9868051,0.00048009,0.009958815,0.000111554706,0.00010933086,0.000017304093,0.00016600381,0.000053964995,0.002297833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99462885,0.0005266861,0.00052530994,0.0031803895,0.00022502818,0.00091375527],"domain_scores_gemma":[0.99599254,0.00026841045,0.00068232324,0.0020416558,0.0005084468,0.0005066421],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012412269,0.0008032088,0.00083814235,0.0007408458,0.0012359003,0.0015560054,0.0022459792,0.00037805096,0.00002568637],"category_scores_gemma":[0.000031851556,0.0010529851,0.00043503096,0.001946616,0.0005494398,0.0013619317,0.0023140016,0.00066408195,0.000007789642],"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.0005224394,0.0012654973,0.0015570577,0.015216623,0.0010037122,0.005021988,0.0012106594,0.45772552,0.00019011548,0.5081165,0.00023640065,0.007933501],"study_design_scores_gemma":[0.0022578556,0.00015302752,0.00020899215,0.0019391864,0.0005860741,0.000020189096,0.001899087,0.98388237,0.00008950135,0.006880132,0.0008664754,0.0012170877],"about_ca_topic_score_codex":0.000111237874,"about_ca_topic_score_gemma":0.000036980095,"teacher_disagreement_score":0.87183267,"about_ca_system_score_codex":0.00017241719,"about_ca_system_score_gemma":0.0003293802,"threshold_uncertainty_score":0.9994805},"labels":[],"label_agreement":null},{"id":"W4287307637","doi":"10.1007/s10619-022-07415-9","title":"Scalable probabilistic truss decomposition using central limit theorem and H-index","year":2022,"lang":"en","type":"article","venue":"Distributed and Parallel Databases","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Truss; Probabilistic logic; Computer science; Scalability; Algorithm; Discrete mathematics; Mathematical optimization; Mathematics; Theoretical computer science; Artificial intelligence; Structural engineering","score_opus":0.023529447674205426,"score_gpt":0.2592946132143147,"score_spread":0.23576516554010926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287307637","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.4049857,0.000497689,0.59207195,0.00016462075,0.0001549918,0.00018659026,0.0018000688,0.00009052829,0.00004786251],"genre_scores_gemma":[0.99166405,0.000038667135,0.0070608123,0.000121394434,0.000029536064,0.000021377671,0.0010477655,0.000006386646,0.000010030649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876344,0.00017599868,0.00016435186,0.00039597342,0.00017076285,0.00032945292],"domain_scores_gemma":[0.99935174,0.00012677125,0.00006561842,0.0002982117,0.000022701473,0.00013492999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024393726,0.00014622945,0.0001552192,0.000055974455,0.00076098484,0.00013876097,0.0002717157,0.000017767392,0.000040815386],"category_scores_gemma":[0.00002575158,0.00013762168,0.00003441615,0.00027942212,0.000107597676,0.0004276234,0.00048106388,0.00014299488,0.0000010594842],"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.00020758153,0.0005250002,0.020290913,0.00010695104,0.00008127795,0.00016419089,0.0006178394,0.018735083,0.0008504321,0.94632804,0.00080530957,0.011287353],"study_design_scores_gemma":[0.001535854,0.00021228343,0.023202006,0.000054921282,0.00005898236,0.0005314091,0.0005169058,0.9079427,0.00029542626,0.05790239,0.0070697414,0.00067737955],"about_ca_topic_score_codex":0.000060128725,"about_ca_topic_score_gemma":0.0000056151634,"teacher_disagreement_score":0.8892076,"about_ca_system_score_codex":0.000026866712,"about_ca_system_score_gemma":0.000034908793,"threshold_uncertainty_score":0.58529574},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"split"},{"id":"W4287597871","doi":"10.5281/zenodo.4274986","title":"r3d3: Optimized Query Compilation on GPUs","year":2020,"lang":"en","type":"paratext","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph Theory 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":"McGill University","funders":"","keywords":"Computer science; Query optimization; Parallel computing; Computer graphics (images); Information retrieval","score_opus":0.036086356591716565,"score_gpt":0.24604927562087445,"score_spread":0.20996291902915787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287597871","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000102920356,0.00019808831,0.35409808,0.0029231913,0.0015337967,0.00077494077,0.0007349988,0.0015750668,0.6380589],"genre_scores_gemma":[0.22141959,0.0071893083,0.096522056,0.021758147,0.01378032,0.0000023658042,0.15508273,0.038805068,0.4454404],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99671954,0.0008479353,0.00039339773,0.00094177545,0.0006242554,0.0004730977],"domain_scores_gemma":[0.9979485,0.000069459995,0.0002701639,0.0009629013,0.00045469467,0.00029426746],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006269561,0.00034391176,0.0003752222,0.0004210512,0.002076565,0.001930757,0.0033513717,0.00019680648,0.015127901],"category_scores_gemma":[0.00026198107,0.00035905323,0.00015415474,0.0009962517,0.000147827,0.00041233687,0.0020480873,0.0008087003,0.14159289],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008494874,0.00012400419,3.711101e-8,0.00008029321,0.00007021434,0.000030610045,0.0007361587,0.0015268933,0.0003021394,0.02511945,0.91339856,0.058526702],"study_design_scores_gemma":[0.0006050279,0.00036701412,0.000010335083,0.00008803456,0.000011762028,0.000050499715,0.000034091114,0.01017618,0.00036589144,0.0007386531,0.98717076,0.00038175096],"about_ca_topic_score_codex":0.00000403307,"about_ca_topic_score_gemma":2.732781e-8,"teacher_disagreement_score":0.25757602,"about_ca_system_score_codex":0.00014223326,"about_ca_system_score_gemma":0.000010864516,"threshold_uncertainty_score":0.99988616},"labels":[],"label_agreement":null},{"id":"W4287812716","doi":"10.48550/arxiv.2004.11315","title":"Engineering Data Reduction for Nested Dissection","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Preprocessor; Computer science; Reduction (mathematics); Sparse matrix; Computation; Dense graph; Graph; Node (physics); Algorithm; Shortest path problem; Theoretical computer science; Mathematics; Artificial intelligence; Pathwidth","score_opus":0.13385391014915474,"score_gpt":0.19521397945413968,"score_spread":0.06136006930498494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287812716","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.04031072,0.000017946104,0.9571578,0.00014895867,0.0015820467,0.00027910268,0.000038565602,0.00038632724,0.000078522804],"genre_scores_gemma":[0.99089646,0.00002472146,0.008455926,0.000015327289,0.00021662541,0.0000013408024,0.00015053134,0.0000142151175,0.00022486475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855906,0.000043951546,0.0001170631,0.0010467819,0.0000429887,0.00019018087],"domain_scores_gemma":[0.99837935,0.00004300777,0.00011235034,0.0012935578,0.00006647813,0.00010527361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001951776,0.0001870256,0.00017847447,0.0001445485,0.00011502701,0.000104714454,0.0019144148,0.00014782611,0.000003882048],"category_scores_gemma":[0.000047955233,0.0002317378,0.000103501865,0.00047739383,0.000025259991,0.00058332755,0.001617779,0.0003055903,0.000015216994],"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.00006408809,0.000089170375,0.000060008457,0.00028073444,0.00018297574,0.00010555525,0.0003860642,0.39848834,0.0013125482,0.5943028,0.0005732644,0.0041544517],"study_design_scores_gemma":[0.00019273537,0.000029065051,0.00016603996,0.00003991488,0.00004608484,0.000008756204,0.00003374371,0.945938,0.000315232,0.05240272,0.00057476154,0.00025293868],"about_ca_topic_score_codex":0.00001668945,"about_ca_topic_score_gemma":0.0000015587019,"teacher_disagreement_score":0.9505857,"about_ca_system_score_codex":0.00005429853,"about_ca_system_score_gemma":0.000059049064,"threshold_uncertainty_score":0.94499934},"labels":[],"label_agreement":null},{"id":"W4289550979","doi":"10.14778/3551793.3551862","title":"Optimizing differentially-maintained recursive queries on dynamic graphs","year":2022,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"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":"Computer science; Scalability; Dataflow; Computation; Overhead (engineering); Graph; Probabilistic logic; Parallel computing; Differential (mechanical device); Theoretical computer science; Algorithm; Programming language","score_opus":0.006113840765845322,"score_gpt":0.20260877880646236,"score_spread":0.19649493804061705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289550979","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.9658409,0.00034214742,0.011849522,0.0069612847,0.0028258073,0.001564766,0.000037219826,0.00041065476,0.010167737],"genre_scores_gemma":[0.9928987,0.000019731833,0.0063519324,0.0002899293,0.000013760697,0.00013825901,0.0000011770927,0.000012477692,0.0002740563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851805,0.000031477437,0.0002454755,0.00036986143,0.0005266669,0.0003084652],"domain_scores_gemma":[0.9993058,0.00005301824,0.00026220997,0.00023862858,0.00008299636,0.00005736512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003942887,0.00018097548,0.00019597613,0.00016546501,0.00056314387,0.00008260253,0.0016688367,0.000022488754,0.000031299078],"category_scores_gemma":[0.000036048594,0.00013448304,0.00019547663,0.00056310993,0.000097867895,0.0002027025,0.0011642721,0.00026250075,0.0000022133015],"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.000060684146,0.00019508998,0.00010811023,0.00002504269,0.000060589446,0.0000015985897,0.0031512321,0.0003384273,0.013182394,0.97910315,0.00023913698,0.003534534],"study_design_scores_gemma":[0.0012954794,0.0011764426,0.0011035145,0.00012017661,0.000051926174,0.000045259294,0.0033767382,0.008446545,0.10028046,0.88192356,0.0016310125,0.00054888515],"about_ca_topic_score_codex":0.000007841678,"about_ca_topic_score_gemma":6.541462e-7,"teacher_disagreement_score":0.0971796,"about_ca_system_score_codex":0.00010933765,"about_ca_system_score_gemma":0.000023187833,"threshold_uncertainty_score":0.54840595},"labels":[],"label_agreement":null},{"id":"W4289866493","doi":"10.1109/icde53745.2022.00242","title":"Out-of-Core Edge Partitioning at Linear Run-Time","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 38th International Conference on Data Engineering (ICDE)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Stateful firewall; Graph partition; Enhanced Data Rates for GSM Evolution; Cluster analysis; Partition (number theory); Stateless protocol; Streaming algorithm; Vertex (graph theory); Graph; Parallel computing; Algorithm; Theoretical computer science; Combinatorics; Mathematics; Upper and lower bounds; Computer network; Artificial intelligence","score_opus":0.07982544312203282,"score_gpt":0.28794173938733386,"score_spread":0.20811629626530104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289866493","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.15194635,0.00020082894,0.7996479,0.0030948466,0.02503459,0.00076138094,0.0056346515,0.0011526297,0.012526782],"genre_scores_gemma":[0.98104525,0.000028871216,0.013527453,0.0002584163,0.0003630902,0.00006050826,0.0013881506,0.000035050427,0.0032931876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981751,0.00004742083,0.00033356738,0.00054198765,0.00064359844,0.0002583703],"domain_scores_gemma":[0.99857146,0.00011256092,0.00014379845,0.0009900114,0.000091412665,0.000090787275],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00054093153,0.00018906963,0.00019322308,0.00023049426,0.00017852163,0.00007711589,0.003156426,0.000035374283,0.001778155],"category_scores_gemma":[0.00008141975,0.00020965398,0.00006913339,0.00026574242,0.000035805773,0.000485193,0.0016029249,0.00035974415,0.00019146425],"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.000103586484,0.00043364128,0.00033320527,0.00005989651,0.0003529607,0.00016557383,0.0016405608,0.1294367,0.054733783,0.7869282,0.01788873,0.00792318],"study_design_scores_gemma":[0.00028540674,0.000112058806,0.00012435156,0.00004051481,0.0000075687353,0.00001938539,0.000028192453,0.9743794,0.00248418,0.0016361892,0.020623824,0.00025892362],"about_ca_topic_score_codex":0.0000076282317,"about_ca_topic_score_gemma":0.000002136436,"teacher_disagreement_score":0.8449427,"about_ca_system_score_codex":0.00010786813,"about_ca_system_score_gemma":0.00006598127,"threshold_uncertainty_score":0.99913436},"labels":[],"label_agreement":null},{"id":"W4292697948","doi":"10.48550/arxiv.1603.04626","title":"TAPER: query-aware, partition-enhancement for large, heterogenous,\\n graphs","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Partition (number theory); Scalability; Graph partition; Workload; Space partitioning; Hash function; USable; Parallel computing; Theoretical computer science; Graph; Algorithm; Database; Mathematics","score_opus":0.04841516048492684,"score_gpt":0.19307823179101344,"score_spread":0.1446630713060866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292697948","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.05715272,0.000075468786,0.9396053,0.0001397858,0.0012177713,0.00060275354,0.00016161983,0.00028147348,0.00076310424],"genre_scores_gemma":[0.9961199,0.00019211079,0.0016658732,0.0002118758,0.00009677624,0.000017113915,0.000044621756,0.000024325853,0.0016273913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747276,0.00015288375,0.00026588643,0.0013187029,0.0001133622,0.0006764268],"domain_scores_gemma":[0.99774873,0.00014416786,0.00027620787,0.0013817275,0.00022542577,0.00022373545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042300846,0.00040213426,0.000383218,0.0002910534,0.00039778595,0.00012804805,0.0018485541,0.00027106766,0.00006211208],"category_scores_gemma":[0.000011784633,0.00039464506,0.00050659233,0.0003785415,0.00009894164,0.00044280008,0.0012083946,0.00029087483,0.000118695476],"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.000036785408,0.00025040697,0.0003911711,0.00009034362,0.00017480766,0.00007895969,0.0001791794,0.0012415642,0.00008259989,0.9958641,0.0005444944,0.0010655693],"study_design_scores_gemma":[0.0010195958,0.00015896698,0.000080823695,0.00015419554,0.00007005585,0.0000053816693,0.000039626644,0.060571186,0.0018342007,0.93237627,0.0029949967,0.00069470523],"about_ca_topic_score_codex":0.000010940075,"about_ca_topic_score_gemma":0.00001779418,"teacher_disagreement_score":0.93896717,"about_ca_system_score_codex":0.0001162339,"about_ca_system_score_gemma":0.00013271991,"threshold_uncertainty_score":0.9998506},"labels":[],"label_agreement":null},{"id":"W4293169203","doi":"10.3390/sym14081748","title":"Graph Algorithms and Graph Theory-Symmetry Special Issue","year":2022,"lang":"en","type":"article","venue":"Symmetry","topic":"Graph Theory 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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Graph; Theoretical computer science; Algorithm; Mathematics","score_opus":0.008054395753983363,"score_gpt":0.2249694607814344,"score_spread":0.21691506502745103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293169203","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.12653375,0.008084937,0.660279,0.005011063,0.027073542,0.0017611323,0.00033086876,0.0021834353,0.1687423],"genre_scores_gemma":[0.92527616,0.00021197776,0.055134814,0.0058577037,0.0062819594,0.00020013572,0.000041948257,0.0001221911,0.0068731024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971796,0.0005317436,0.00032179628,0.00078924047,0.0005985874,0.00057897536],"domain_scores_gemma":[0.99851376,0.000281858,0.00012928268,0.00080260437,0.000046448542,0.00022604203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015595227,0.00029931578,0.0003175602,0.0006764281,0.0009378602,0.00019790164,0.0013810759,0.000079346646,0.0006292793],"category_scores_gemma":[0.000053546104,0.00029698215,0.00019812137,0.0022369416,0.00021498118,0.00043643953,0.0011452053,0.00057953567,0.000070919596],"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.000019765062,0.00013363031,0.00050908426,0.000013185771,0.00006176625,0.00009460854,0.00073910906,0.000008179456,0.00007485848,0.7879517,0.006048788,0.20434535],"study_design_scores_gemma":[0.0007612713,0.0003067629,0.0019749172,0.000008902567,0.000025766285,0.00022183376,0.0010278485,0.00085260853,0.00084324967,0.92589873,0.06749013,0.0005879842],"about_ca_topic_score_codex":0.000014727003,"about_ca_topic_score_gemma":0.0000011278319,"teacher_disagreement_score":0.7987424,"about_ca_system_score_codex":0.0000350581,"about_ca_system_score_gemma":0.000043315336,"threshold_uncertainty_score":0.9999482},"labels":[],"label_agreement":null},{"id":"W4294805243","doi":"10.5206/mt.v2i1.15001","title":"Maple Conference 2021 Mathematical Art and Creative Works Exhibit","year":2022,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Maple; Computer science; Mathematics education; Mathematics; Biology","score_opus":0.014838920012798336,"score_gpt":0.2215320930948427,"score_spread":0.20669317308204438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294805243","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.0028167428,0.000061525636,0.9863602,0.0014816866,0.00015932813,0.00013721023,0.000026095708,0.00008548705,0.00887173],"genre_scores_gemma":[0.96097964,0.000024700212,0.028396972,0.00018938463,0.000022822853,0.0001676125,0.000006739358,0.000010571556,0.01020157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899626,0.00012398079,0.00015173762,0.00030199534,0.00020607743,0.0002199806],"domain_scores_gemma":[0.99940234,0.00011780176,0.00003296123,0.000314398,0.000029278182,0.00010322955],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024447386,0.0001138485,0.00014368117,0.0000880509,0.00058999425,0.00014040746,0.00033474108,0.000029118744,0.0068132775],"category_scores_gemma":[0.000005129822,0.00011519096,0.000068464615,0.0003692784,0.00009157918,0.00029647717,0.00004889225,0.00029385765,0.000091158516],"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.000043695938,0.0008555275,0.000033953795,0.000045519668,0.00014539364,0.00009617014,0.013564898,0.002067907,0.0011751968,0.8049811,0.0024096344,0.17458099],"study_design_scores_gemma":[0.0017341381,0.0005369076,0.0006910384,0.00008556203,0.00009538932,0.00049751636,0.0065945596,0.23621131,0.0033232125,0.69577897,0.053415764,0.0010356082],"about_ca_topic_score_codex":0.0000058310457,"about_ca_topic_score_gemma":0.0000055797605,"teacher_disagreement_score":0.9581629,"about_ca_system_score_codex":0.000021689375,"about_ca_system_score_gemma":0.000035905625,"threshold_uncertainty_score":0.9940946},"labels":[],"label_agreement":null},{"id":"W4300001996","doi":"","title":"Portfolios of Subgraph Isomorphism Algorithms","year":2016,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Subgraph isomorphism problem; Induced subgraph isomorphism problem; Isomorphism (crystallography); Computer science; Algorithm; Theoretical computer science; Graph; Crystal structure; Crystallography","score_opus":0.008477213805286161,"score_gpt":0.20017070143414123,"score_spread":0.19169348762885507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300001996","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.038257625,0.00030555515,0.94007915,0.006867158,0.00018370636,0.00015152924,0.000018101613,0.00021889762,0.01391829],"genre_scores_gemma":[0.8797645,0.0001788047,0.11532105,0.00009536979,0.000011747811,0.000016779606,0.000008122989,0.000016580347,0.004587063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99657553,0.0018407252,0.00040313107,0.00049280527,0.000361934,0.00032587774],"domain_scores_gemma":[0.9957064,0.0010067899,0.0003008304,0.0017512533,0.001068223,0.00016655299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035553596,0.00018346526,0.00023399564,0.00022789938,0.00019295944,0.000094411924,0.0017195132,0.00009039556,0.00010067131],"category_scores_gemma":[0.00043615748,0.00014361701,0.00017468965,0.0007591296,0.00030906632,0.00045077677,0.0004394523,0.00011566089,0.00004790718],"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.0000029997796,0.000246852,0.0012605415,0.000011289732,0.000027182305,0.00000615772,0.0017341478,8.0778705e-7,0.016684279,0.7834953,0.0004268126,0.1961036],"study_design_scores_gemma":[0.0020896895,0.0000029706682,0.010891305,0.0011890448,0.000030379122,0.000099543795,0.000091152746,0.009799151,0.7582676,0.19842072,0.018271117,0.0008473285],"about_ca_topic_score_codex":0.00009813122,"about_ca_topic_score_gemma":0.000033521686,"teacher_disagreement_score":0.84150684,"about_ca_system_score_codex":0.000022196773,"about_ca_system_score_gemma":0.00008681263,"threshold_uncertainty_score":0.5856532},"labels":[],"label_agreement":null},{"id":"W4308090282","doi":"10.1109/hpec55821.2022.9926324","title":"Efficient Calculation of Triangle Centrality in Big Data Networks","year":2022,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Centrality; Computer science; Big data; Theoretical computer science; Data mining; Mathematics; Combinatorics","score_opus":0.05095242852755281,"score_gpt":0.2569508552808525,"score_spread":0.20599842675329968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308090282","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.12281887,0.00007054568,0.8757059,0.00017770955,0.0005762324,0.000106903826,0.000008087787,0.000031046977,0.00050469],"genre_scores_gemma":[0.99761176,6.825379e-7,0.002227568,0.0000638142,0.00001953099,0.000003129205,0.000016255048,0.0000014717959,0.000055802175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915725,0.00018257594,0.00016811852,0.00020984682,0.00015583266,0.00012639281],"domain_scores_gemma":[0.9992424,0.00005939654,0.00004806067,0.0006164943,0.000009571618,0.000024045385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010058068,0.000039973344,0.000083416555,0.000062337785,0.000060267284,0.000012701663,0.00080560264,0.000011385638,0.000029059827],"category_scores_gemma":[0.000014287793,0.000036783462,0.000023171438,0.000605009,0.000015724045,0.000049068083,0.0007295547,0.00007801674,8.205741e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016370543,0.00032188452,0.0023076145,0.000004506083,0.0000066723037,0.000008499409,0.00045435605,0.744497,0.00006809043,0.1556813,0.00028648376,0.0963472],"study_design_scores_gemma":[0.00027216948,0.000019513729,0.007574174,0.0000015111377,0.0000010838532,0.0000014756321,0.000030080026,0.9900958,0.000055857963,0.0015103922,0.00039126133,0.000046659465],"about_ca_topic_score_codex":0.00006954071,"about_ca_topic_score_gemma":0.000010504589,"teacher_disagreement_score":0.8747929,"about_ca_system_score_codex":0.00001699002,"about_ca_system_score_gemma":0.00002072857,"threshold_uncertainty_score":0.1499986},"labels":[],"label_agreement":null},{"id":"W4308487050","doi":"10.1016/j.parco.2022.102984","title":"Efficient parallel branch-and-bound approaches for exact graph edit distance problem","year":2022,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Graph Theory and Algorithms","field":"Computer Science","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":"Université de Sherbrooke","funders":"Direction Générale de la Recherche Scientifique et du Développement Technologique","keywords":"Computer science; Speedup; Search tree; Pruning; Branch and bound; Theoretical computer science; Graph; Parallel computing; Algorithm; Search algorithm","score_opus":0.026937644813734955,"score_gpt":0.2351926344659796,"score_spread":0.20825498965224465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308487050","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.036776904,0.0008940365,0.95943445,0.0005560673,0.0005853324,0.00068320916,0.000010901791,0.00026255794,0.00079654745],"genre_scores_gemma":[0.8554273,0.0000032486967,0.14391162,0.0001980455,0.00015957457,0.00013907666,0.000011032536,0.000020695084,0.00012939173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975506,0.00020732229,0.0003914862,0.0008139585,0.00038977386,0.0006468395],"domain_scores_gemma":[0.99874556,0.00038047848,0.00022007286,0.0004763651,0.00004198747,0.00013554502],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012987772,0.0002741078,0.00031692238,0.00014202116,0.001518219,0.00024570455,0.0010483899,0.00004060306,0.0000074606105],"category_scores_gemma":[0.00002235006,0.0002731057,0.00017670372,0.00053648464,0.000117972304,0.00011560842,0.00081357337,0.00030935387,0.000004379294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044359742,0.00019406101,0.00028868509,0.00008220553,0.000048519916,0.000007740065,0.0026072701,0.53334326,0.000030034373,0.43440917,0.000352142,0.028592547],"study_design_scores_gemma":[0.0009636956,0.00015679158,0.0006711162,0.000019778567,0.000011295039,0.00004473568,0.00018607652,0.89365107,0.000014891006,0.10065828,0.0032190802,0.00040317758],"about_ca_topic_score_codex":0.000007725949,"about_ca_topic_score_gemma":0.0000014451039,"teacher_disagreement_score":0.8186504,"about_ca_system_score_codex":0.00004607937,"about_ca_system_score_gemma":0.000045603643,"threshold_uncertainty_score":0.9999721},"labels":[],"label_agreement":null},{"id":"W4310519221","doi":"10.5139/jksas.2022.50.12.889","title":"Parallel Computation on the Three-dimensional Electromagnetic Field by the Graph Partitioning and Multi-frontal Method","year":2022,"lang":"en","type":"article","venue":"Journal of the Korean Society for Aeronautical & Space Sciences","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"HFSS; Computation; Computer science; Graph; Metis; Electromagnetic field; Field (mathematics); Computational science; Parallel computing; Mathematics; Physics; Algorithm; Theoretical computer science; Pure mathematics","score_opus":0.02075504983917179,"score_gpt":0.27812606457477884,"score_spread":0.25737101473560703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310519221","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.13804182,0.00066276605,0.7501326,0.110205226,0.0005365871,0.00034454814,0.0000083528985,0.000017881473,0.000050185023],"genre_scores_gemma":[0.7954822,0.000009294795,0.19966939,0.004639449,0.00007028063,0.000020997926,5.7834603e-7,0.0000062906774,0.000101467886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828106,0.0003011685,0.00023259902,0.00021381433,0.0006895719,0.00028177444],"domain_scores_gemma":[0.9976559,0.0018223359,0.00024128114,0.0001578216,0.000058486778,0.00006412032],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0033426739,0.00011822205,0.00013982989,0.000020793428,0.0025708035,0.00018766648,0.0011097472,0.000028076096,0.000013562116],"category_scores_gemma":[0.000114016046,0.000054028358,0.00038980762,0.00043506312,0.000540561,0.00018997051,0.00029140967,0.00045865646,4.023479e-7],"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.00015521346,0.0006028034,0.000839106,0.000015589627,0.0002738085,0.0000039207653,0.005410454,0.039738216,0.004849681,0.85899913,0.06592439,0.02318771],"study_design_scores_gemma":[0.00073657115,0.0021534285,0.0020759937,0.000024091254,0.000059690694,0.00021385522,0.0013569954,0.6911849,0.00089503033,0.30044073,0.00068323896,0.00017550513],"about_ca_topic_score_codex":0.000011123984,"about_ca_topic_score_gemma":0.000007342392,"teacher_disagreement_score":0.6574404,"about_ca_system_score_codex":0.00003320781,"about_ca_system_score_gemma":0.00008156803,"threshold_uncertainty_score":0.99872774},"labels":[],"label_agreement":null},{"id":"W4312902677","doi":"10.2139/ssrn.4246392","title":"Spatial Massive Memory","year":2022,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Geography","score_opus":0.00466618801474724,"score_gpt":0.20189026718286715,"score_spread":0.1972240791681199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312902677","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.03758402,0.0014548379,0.95514935,0.002253917,0.0013359832,0.000091226975,0.0000019771112,0.00009491996,0.0020337754],"genre_scores_gemma":[0.99701065,0.000116513074,0.0006062348,0.00029455844,0.00022210364,0.000010042875,9.414816e-7,0.000009224828,0.0017297474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997464,0.00024579893,0.0001643451,0.0002053742,0.00037136927,0.0015491334],"domain_scores_gemma":[0.9994999,0.00003597421,0.00011788001,0.00024018792,0.0000338235,0.000072196555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017840571,0.00010279693,0.0001065336,0.00013389712,0.0007866285,0.00007939306,0.0011631146,0.000018725854,0.00011721758],"category_scores_gemma":[0.000014839164,0.00009720793,0.00011824123,0.00030253953,0.000027057149,0.0002632121,0.00030209002,0.0019760677,0.000028325027],"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.000013443313,0.000052732845,0.00005105182,7.137752e-7,0.0000506011,0.000037581016,0.0003457101,0.0005426805,0.00020092918,0.86194044,0.00010671093,0.13665743],"study_design_scores_gemma":[0.00047646684,0.0004703017,0.00008383234,0.0000017208173,0.0000071065497,0.0015580589,0.001087929,0.005197665,0.00021011817,0.98820347,0.0025368608,0.00016645351],"about_ca_topic_score_codex":0.000019542578,"about_ca_topic_score_gemma":0.00002953161,"teacher_disagreement_score":0.95942664,"about_ca_system_score_codex":0.00045472838,"about_ca_system_score_gemma":0.0012503,"threshold_uncertainty_score":0.858514},"labels":[],"label_agreement":null},{"id":"W4313172799","doi":"10.14778/3551793.3551826","title":"Finding locally densest subgraphs","year":2022,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":19,"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 British Columbia","funders":"","keywords":"Graph; Graph factorization; Computer science; Combinatorics; Regular polygon; Pruning; Theoretical computer science; Mathematics; Graph power; Biology; Line graph","score_opus":0.009705402500551377,"score_gpt":0.20046701625810603,"score_spread":0.19076161375755465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313172799","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.9679524,0.00038563638,0.0074203047,0.003781439,0.0018893235,0.0008882583,0.000013510713,0.00029735567,0.01737181],"genre_scores_gemma":[0.9956981,0.0000066755942,0.0034565218,0.00033036343,0.000024732379,0.0000735543,2.5526492e-7,0.000008054468,0.00040177623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987021,0.000015958602,0.00021752587,0.0002844289,0.0005093694,0.00027062965],"domain_scores_gemma":[0.99944764,0.000038342176,0.00019179453,0.00019430528,0.0000737476,0.000054182845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059449614,0.000121539095,0.0001335959,0.00012201344,0.0004836708,0.0000706572,0.0018813096,0.00001688623,0.000035562844],"category_scores_gemma":[0.000029472769,0.00009210049,0.00014664138,0.000776655,0.000067511544,0.00021484964,0.0013177794,0.00020280103,0.0000044646945],"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.00002117544,0.00022076086,0.0052275932,0.000042767675,0.000054402786,0.0000033052686,0.0023746733,0.00020805998,0.032078724,0.9485599,0.0020420232,0.0091666365],"study_design_scores_gemma":[0.0020074388,0.00090086577,0.008921229,0.00012689676,0.000071575436,0.00034887623,0.0025856306,0.010345114,0.41376334,0.53974783,0.020240534,0.0009406414],"about_ca_topic_score_codex":0.000010224595,"about_ca_topic_score_gemma":3.609443e-7,"teacher_disagreement_score":0.40881202,"about_ca_system_score_codex":0.000054906875,"about_ca_system_score_gemma":0.000028142973,"threshold_uncertainty_score":0.3755749},"labels":[],"label_agreement":null},{"id":"W4320024124","doi":"10.1109/bigdata55660.2022.10020422","title":"Dynamic Graph Summarization: Optimal and Scalable","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Conference on Big Data (Big Data)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Automatic summarization; Computer science; Scalability; Lossless compression; Graph; Theoretical computer science; Algorithm; Artificial intelligence; Data compression","score_opus":0.15820750215485105,"score_gpt":0.3135448753019634,"score_spread":0.15533737314711235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320024124","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.015126028,0.00022394703,0.9249254,0.006785614,0.016889349,0.00047087503,0.02884995,0.0003235827,0.006405284],"genre_scores_gemma":[0.96042305,0.00042196762,0.010084714,0.0012504138,0.00039074433,0.000066526554,0.025363935,0.000029130413,0.001969503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969995,0.00019524433,0.00032316684,0.0012601243,0.0009213287,0.000300639],"domain_scores_gemma":[0.99677426,0.00011673658,0.00017267729,0.002699526,0.00010966032,0.00012713257],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0009428939,0.00022518689,0.0001911905,0.00033335033,0.00050541724,0.00054681295,0.0083199665,0.000044267676,0.00037765148],"category_scores_gemma":[0.00008134788,0.0002388949,0.000030081363,0.0005438657,0.00013688934,0.0014238514,0.006648605,0.0004345763,0.000050504776],"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.00015011217,0.0005800648,0.00056433014,0.000024127696,0.00026547973,0.00020951671,0.00029915446,0.0010461535,0.0022306994,0.45309046,0.034442548,0.50709736],"study_design_scores_gemma":[0.00075655297,0.00018116525,0.00057706673,0.000029713663,0.000018767247,0.000113556125,0.0001915017,0.9121439,0.000117781296,0.019217383,0.06617222,0.00048041434],"about_ca_topic_score_codex":0.000054106953,"about_ca_topic_score_gemma":0.000055768927,"teacher_disagreement_score":0.94529706,"about_ca_system_score_codex":0.000052066014,"about_ca_system_score_gemma":0.00018166692,"threshold_uncertainty_score":0.9970455},"labels":[],"label_agreement":null},{"id":"W4323241026","doi":"10.5220/0011783700003417","title":"BigGraphVis: Visualizing Communities in Big Graphs Leveraging GPU-Accelerated Streaming Algorithms","year":2023,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Streaming algorithm; Big data; Parallel computing; Data mining; Mathematics","score_opus":0.0706774165266606,"score_gpt":0.29183289958443914,"score_spread":0.22115548305777855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323241026","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.8422356,0.00022434012,0.14998998,0.00032971668,0.0010872894,0.00025329608,0.0000060732086,0.0022410427,0.0036326193],"genre_scores_gemma":[0.9915935,0.00014672993,0.007559164,0.0003373145,0.000038968392,0.000035305482,0.000025154251,0.000024359659,0.00023949514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977877,0.00032008666,0.00043386282,0.00040394434,0.00032432,0.0007300908],"domain_scores_gemma":[0.99869204,0.0003415699,0.00008663161,0.00068612566,0.00007645088,0.00011720862],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011359993,0.00027938103,0.00029620453,0.0015353729,0.00042245956,0.00043017924,0.0012498623,0.00008651086,0.000027354306],"category_scores_gemma":[0.000021154718,0.00026580313,0.00012209473,0.0050774813,0.00012046733,0.00073401665,0.0005265972,0.00034223776,0.00006728028],"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.000012115184,0.00023499467,0.014207464,0.000072263654,0.00010766694,0.00033021526,0.022880336,0.0014695043,0.0027838636,0.31700715,0.0003479665,0.64054644],"study_design_scores_gemma":[0.0018884186,0.00018335352,0.02143573,0.00040974116,0.000012439595,0.000053105716,0.023914894,0.79313946,0.008374646,0.1475368,0.0016102646,0.0014411415],"about_ca_topic_score_codex":0.0008146931,"about_ca_topic_score_gemma":0.00014076136,"teacher_disagreement_score":0.79166996,"about_ca_system_score_codex":0.000027857806,"about_ca_system_score_gemma":0.000045013923,"threshold_uncertainty_score":0.99997944},"labels":[],"label_agreement":null},{"id":"W4376608133","doi":"10.1007/978-3-031-32296-9","title":"Algorithms and Models for the Web Graph","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.02140765485840043,"score_gpt":0.2480883015554551,"score_spread":0.22668064669705468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376608133","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.000009863224,0.0010824705,0.99342114,0.0013198124,0.0029527713,0.0006848827,0.000021274964,0.00025756544,0.00025023875],"genre_scores_gemma":[0.013035914,0.0007342073,0.9753412,0.0040992266,0.0018330073,0.00025319503,0.000015227796,0.00012325057,0.0045647696],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967034,0.000056083554,0.00036470147,0.0014340023,0.000680237,0.0007615614],"domain_scores_gemma":[0.99580014,0.0024257507,0.00016921447,0.0012805769,0.00018077357,0.00014353172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001924415,0.0004489651,0.0004181085,0.0006995401,0.0006492154,0.00079975964,0.004098347,0.00024233302,0.0000012257034],"category_scores_gemma":[0.000082809056,0.00031287974,0.00017069328,0.0016084859,0.001096496,0.00063608796,0.0014224323,0.00062292,0.000009013899],"study_design_candidate":"design_other","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.000004124936,0.000017731809,0.0000028495936,0.000049909424,0.000023314951,0.000025111318,0.0010100149,0.07990504,0.000016716634,0.0630809,0.00035553722,0.85550874],"study_design_scores_gemma":[0.00013524132,0.00005846323,0.000008159592,0.000070739065,0.000005928234,0.000020365425,2.313888e-7,0.52533686,0.000043054446,0.47364733,0.00045138432,0.00022221901],"about_ca_topic_score_codex":0.0000058166065,"about_ca_topic_score_gemma":0.000025471265,"teacher_disagreement_score":0.85528654,"about_ca_system_score_codex":0.00008477134,"about_ca_system_score_gemma":0.00065618305,"threshold_uncertainty_score":0.99993235},"labels":[],"label_agreement":null},{"id":"W4376865071","doi":"10.48550/arxiv.2305.03240","title":"Sum-of-Local-Effects Data Structures for Separable Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Combinatorics; Mathematics; RADIUS; Separable space; Graph; Constant (computer programming); Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.11833331978384988,"score_gpt":0.22866746580923095,"score_spread":0.11033414602538107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376865071","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.05730544,0.000108081265,0.9398164,0.000031997137,0.0014962894,0.0005156405,0.00022426242,0.0003132258,0.00018867293],"genre_scores_gemma":[0.99232,0.000106660715,0.0065082153,0.00003998981,0.00004537167,0.0000023017985,0.00014628217,0.000025591047,0.00080556143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775237,0.00014672794,0.00020850096,0.0013902012,0.00010046017,0.00040176194],"domain_scores_gemma":[0.9960443,0.0005184607,0.00026208474,0.002908374,0.00012880978,0.00013800051],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004724813,0.0003145694,0.0004333841,0.00038102682,0.0001733631,0.00008015817,0.0050286814,0.00026528438,0.000005514267],"category_scores_gemma":[0.00005557532,0.00034152644,0.0002521404,0.0008131935,0.00021185918,0.0004196274,0.004163536,0.0003622085,0.00001862523],"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.000032292988,0.000049492082,0.000348419,0.00042012875,0.00019956323,0.00011886323,0.00009615779,0.075367905,0.00003786576,0.92010367,0.0012387311,0.0019869057],"study_design_scores_gemma":[0.0003380927,0.000051317944,0.00057077064,0.00008067597,0.00007491013,0.0000014748764,0.0000351344,0.31460378,0.00073854293,0.6829204,0.00029196806,0.00029292828],"about_ca_topic_score_codex":0.00011776403,"about_ca_topic_score_gemma":0.000032185042,"teacher_disagreement_score":0.9350146,"about_ca_system_score_codex":0.000034365283,"about_ca_system_score_gemma":0.00014951799,"threshold_uncertainty_score":0.9999037},"labels":[],"label_agreement":null},{"id":"W4379535338","doi":"10.14232/actacyb.303531","title":"Preface","year":2023,"lang":"en","type":"article","venue":"Acta Cybernetica","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Czech; Library science; Political science; Philosophy; Computer science","score_opus":0.010602519344563018,"score_gpt":0.2262806912629306,"score_spread":0.21567817191836758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379535338","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.6474099,0.00019572684,0.09252324,0.01933416,0.0026460262,0.0005711457,0.000010023416,0.0053055924,0.23200414],"genre_scores_gemma":[0.99099773,0.000016333568,0.004259527,0.00022648818,0.000041351777,0.000008986881,0.0000016641209,0.000006541986,0.004441373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992392,0.00003866328,0.0000861632,0.00023311093,0.00015026642,0.00025258143],"domain_scores_gemma":[0.9993318,0.00009733612,0.000020216703,0.00045591837,0.0000184113,0.000076331184],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018772788,0.00007431347,0.0000699432,0.00007027251,0.00007034114,0.00007880658,0.00072122185,0.000033037402,0.000051520245],"category_scores_gemma":[0.00003405723,0.000066143584,0.000040837713,0.0006008298,0.000038716786,0.00017047244,0.00024587786,0.00007627891,0.0014819703],"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.0000028166412,0.000042163327,0.00022704544,0.000007131996,0.00002077191,0.000051156854,0.0012560351,0.000030237024,0.004377318,0.9111837,0.021645805,0.06115582],"study_design_scores_gemma":[0.0006963988,0.0002132897,0.05092945,0.00003678071,0.000013345227,0.00004638655,0.00009251581,0.06550406,0.015158953,0.54399014,0.3225801,0.0007385663],"about_ca_topic_score_codex":0.0000030228746,"about_ca_topic_score_gemma":5.786316e-7,"teacher_disagreement_score":0.36719355,"about_ca_system_score_codex":0.0000048154284,"about_ca_system_score_gemma":0.0000148262225,"threshold_uncertainty_score":0.9992955},"labels":[],"label_agreement":null},{"id":"W4380591158","doi":"10.21203/rs.3.rs-3040379/v1","title":"Simplified Algorithms for Order-Based CoreMaintenance","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Correctness; Enhanced Data Rates for GSM Evolution; Computer science; Time complexity; Order (exchange); Algorithm; Graph; Analytics; Theoretical computer science; Data mining; Artificial intelligence","score_opus":0.19188112261459872,"score_gpt":0.42772294007863265,"score_spread":0.23584181746403393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380591158","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.0007643838,0.00024309669,0.98874223,0.00472369,0.0015153587,0.0024253693,0.00035092555,0.0008752211,0.0003597213],"genre_scores_gemma":[0.4392942,0.00036887318,0.53181404,0.00091643725,0.0024885659,0.009509997,0.0012156022,0.0005015235,0.013890791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99433535,0.0005820777,0.00047477387,0.0016307897,0.0014460991,0.0015309139],"domain_scores_gemma":[0.99272424,0.0023143974,0.00015556239,0.0023634576,0.0020915617,0.00035079967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0050951014,0.00041191143,0.00052742416,0.00086937787,0.0006235648,0.0007135932,0.0038996346,0.00044411953,0.000019628997],"category_scores_gemma":[0.0016216248,0.0003757813,0.00039602132,0.0018308881,0.00031525706,0.0001688258,0.0026891185,0.0016842291,0.0002615577],"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.0003047244,0.0009700645,0.00034886415,0.0066958787,0.00035173388,0.0006189449,0.0017642361,0.024269493,0.00049934816,0.7126243,0.05488278,0.19666962],"study_design_scores_gemma":[0.00076653354,0.0003856705,0.00047006583,0.0008103411,0.000006798624,0.0000030071149,0.00012728211,0.54388493,0.0011490777,0.44203672,0.009800584,0.0005589825],"about_ca_topic_score_codex":0.00008373874,"about_ca_topic_score_gemma":0.000025124024,"teacher_disagreement_score":0.5196155,"about_ca_system_score_codex":0.0001817776,"about_ca_system_score_gemma":0.0011149539,"threshold_uncertainty_score":0.9998694},"labels":[],"label_agreement":null},{"id":"W4380629788","doi":"10.1162/dint_a_00209","title":"MillenniumDB: An Open-Source Graph Database System","year":2023,"lang":"en","type":"article","venue":"Data Intelligence","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Nacional de Investigación y Desarrollo; Pontificia Universidad Católica de Chile; Universidad de Chile; University of Waterloo; University of Toronto; University of Galway; National University of Ireland; Universidad Técnica Federico Santa María","keywords":"Computer science; Graph database; Query language; Query optimization; Graph; Search engine indexing; Information retrieval; Theoretical computer science; Joins; Database; Programming language","score_opus":0.103571274253965,"score_gpt":0.32994977076281207,"score_spread":0.22637849650884706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380629788","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.0023258745,0.00015154455,0.99370176,0.00016517208,0.00082739064,0.00029537847,0.0006439297,0.0010335351,0.0008554342],"genre_scores_gemma":[0.8434447,0.0006604272,0.14642061,0.0012485444,0.00047475728,0.00013951582,0.0060680583,0.000110115114,0.0014332948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974902,0.00021183345,0.0003376935,0.0011406615,0.00034525292,0.00047435507],"domain_scores_gemma":[0.99405813,0.0001832105,0.00009789443,0.0053562685,0.0000672674,0.00023720384],"candidate_categories":["open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018745757,0.00020598536,0.00020932937,0.00023751639,0.0003381568,0.0006767775,0.015548903,0.00005682358,0.000029095774],"category_scores_gemma":[0.000093473325,0.00018790714,0.000029571125,0.0019270355,0.00010985974,0.0034880564,0.0074321222,0.00020003316,0.0016500602],"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.000019253413,0.00017144288,0.00010017327,0.00011108276,0.000044486802,0.00030816413,0.0010627699,0.0005354655,0.0009888925,0.7422851,0.01861267,0.23576051],"study_design_scores_gemma":[0.00017160825,0.0002415073,0.00018279193,0.00025094204,0.000020451116,0.00016122393,0.0024117213,0.8856417,0.007564248,0.013787294,0.088663764,0.00090274285],"about_ca_topic_score_codex":0.00019416765,"about_ca_topic_score_gemma":0.000025403519,"teacher_disagreement_score":0.88510627,"about_ca_system_score_codex":0.000015331658,"about_ca_system_score_gemma":0.00005207317,"threshold_uncertainty_score":0.99912727},"labels":[],"label_agreement":null},{"id":"W4381165139","doi":"10.1007/s11227-023-05492-w","title":"iPartition: a distributed partitioning algorithm for block-centric graph processing systems","year":2023,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Graph partition; Graph; Distributed computing; Algorithm; Skew; Theoretical computer science","score_opus":0.02137050743923048,"score_gpt":0.2510161233004746,"score_spread":0.22964561586124416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381165139","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.07317946,0.0007105761,0.9243597,0.0005386819,0.00087170355,0.00017165078,0.00000985003,0.0001423068,0.000016067088],"genre_scores_gemma":[0.9826577,0.000035173056,0.016574629,0.00006405243,0.00062732614,0.000005817908,0.000007020021,0.000013893113,0.000014434897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824977,0.0002109906,0.0005874594,0.00015484195,0.00036124483,0.00043568737],"domain_scores_gemma":[0.9985245,0.00047345128,0.0003179272,0.0002047789,0.00037365485,0.00010571957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029928405,0.00014490068,0.00024937483,0.0002457162,0.00079758296,0.00030692606,0.00079263764,0.00004649996,0.0000012037034],"category_scores_gemma":[0.00007658573,0.00010132649,0.00016228655,0.0015762713,0.00006362876,0.00061604363,0.00012998228,0.00023924687,0.000008069297],"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.00006906509,0.00041179918,0.0010424032,0.00046212022,0.0004694796,0.00031310983,0.014588989,0.32499498,0.0028626393,0.033792857,0.0065434733,0.6144491],"study_design_scores_gemma":[0.00060349045,0.00013617714,0.00041606525,0.00032318398,0.000047597736,0.00072223746,0.0011796005,0.9854063,0.00045410503,0.009926731,0.0006137593,0.00017078307],"about_ca_topic_score_codex":0.0000038580874,"about_ca_topic_score_gemma":2.0093347e-7,"teacher_disagreement_score":0.9094782,"about_ca_system_score_codex":0.000034180845,"about_ca_system_score_gemma":0.000072758194,"threshold_uncertainty_score":0.6134444},"labels":[],"label_agreement":null},{"id":"W4381489899","doi":"10.1145/3594778.3594882","title":"Going with the Flow: Real-Time Max-Flow on Asynchronous Dynamic Graphs","year":2023,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Asynchronous communication; PageRank; Theoretical computer science; Graph; Clique-width; Spacetime; Graph algorithms; Distributed computing; Line graph; Voltage graph; Computer network","score_opus":0.005361600729347703,"score_gpt":0.2072267181096087,"score_spread":0.20186511738026097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381489899","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.32515472,0.000033264703,0.5876243,0.0075814547,0.0008165217,0.00069062423,0.000014020137,0.0035837214,0.074501365],"genre_scores_gemma":[0.93248487,0.000055383,0.0553035,0.0010097937,0.00006129294,0.00005175043,0.000012604308,0.000041943404,0.010978868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998727,0.00009894325,0.00011674831,0.00039230217,0.00027936473,0.0003856422],"domain_scores_gemma":[0.9988933,0.0002363585,0.0000412145,0.0007259535,0.000029753593,0.00007340661],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046597698,0.00016702004,0.00013372408,0.00014894281,0.00032333046,0.00016243944,0.00088997744,0.000040076047,0.00006043015],"category_scores_gemma":[0.000007933126,0.000094168965,0.000078841076,0.001139564,0.00008819259,0.00020921793,0.0001582561,0.0001464578,0.0015494804],"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.00007267868,0.00016265451,0.00017682376,0.00003385886,0.0001917592,0.0005772086,0.0028371764,0.028930347,0.0024128545,0.4936089,0.009802345,0.4611934],"study_design_scores_gemma":[0.00025347772,0.0002577198,0.0015920136,0.000027050488,0.0000067792034,0.000033195545,0.000047978298,0.96973234,0.00024789848,0.027116168,0.00046210687,0.00022325933],"about_ca_topic_score_codex":0.000009907893,"about_ca_topic_score_gemma":0.000015890113,"teacher_disagreement_score":0.940802,"about_ca_system_score_codex":0.00001980371,"about_ca_system_score_gemma":0.000033793323,"threshold_uncertainty_score":0.99922794},"labels":[],"label_agreement":null},{"id":"W4382762652","doi":"10.1145/3605573.3605597","title":"Parallel Order-Based Core Maintenance in Dynamic Graphs","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Core (optical fiber); Computer science; Order (exchange); Distributed computing; Telecommunications; Business","score_opus":0.033374109445562454,"score_gpt":0.27395006182403014,"score_spread":0.24057595237846768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382762652","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.009246357,0.000062966916,0.9845166,0.002040137,0.0015877397,0.0004280554,0.000017398219,0.0008315293,0.00126918],"genre_scores_gemma":[0.68434715,0.000107165564,0.30911872,0.001178802,0.000025211493,0.00026569286,0.00006434932,0.000055247438,0.0048376666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976752,0.00010196958,0.00039468042,0.0010044321,0.00029483082,0.00052892417],"domain_scores_gemma":[0.9981308,0.00017024826,0.00014489517,0.001353893,0.00009992063,0.00010027368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062821177,0.0003454702,0.00038460272,0.000506823,0.0000677632,0.00015523382,0.0023356308,0.0002535694,0.000025408186],"category_scores_gemma":[0.00006150874,0.00030528038,0.00019701432,0.0011000556,0.000106218424,0.000109932516,0.0011930001,0.0007555274,0.00016473027],"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.000027900971,0.00021492605,0.001922545,0.000241908,0.000054204647,0.0007359612,0.00037046036,0.091397375,0.00003891033,0.8887835,0.0017052862,0.014507023],"study_design_scores_gemma":[0.00028736846,0.000021434469,0.0038682064,0.00013815025,0.000002344778,0.0000029260889,0.000013760739,0.4900445,0.000007645072,0.5052358,0.000090557936,0.0002872864],"about_ca_topic_score_codex":0.00015083434,"about_ca_topic_score_gemma":0.00043806323,"teacher_disagreement_score":0.67539793,"about_ca_system_score_codex":0.000056052217,"about_ca_system_score_gemma":0.00020947635,"threshold_uncertainty_score":0.9999399},"labels":[],"label_agreement":null},{"id":"W4385381069","doi":"10.1007/s00373-023-02684-2","title":"Correction to: On Reconfiguration Graphs of Independent Sets Under Token Sliding","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Security token; Control reconfiguration; Mathematics; Combinatorics; Discrete mathematics; Computer science; Computer network","score_opus":0.018274318225183397,"score_gpt":0.24557428510548163,"score_spread":0.22729996688029824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385381069","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.9742628,0.00005620236,0.01620964,0.00035005403,0.0059273792,0.00024102376,0.0000041848843,0.00030465596,0.0026440772],"genre_scores_gemma":[0.99942404,0.00007936034,0.00010055582,0.00013735513,0.000005711148,0.000014255608,0.000005979136,0.00000747754,0.00022525972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989668,0.00006715338,0.00019885994,0.00030016713,0.00026145505,0.00020557288],"domain_scores_gemma":[0.99933,0.00014124693,0.00008354981,0.00027228254,0.000072047675,0.000100896286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041220855,0.00012446569,0.00014669489,0.00046179284,0.0001850544,0.00007940436,0.00026244103,0.00006043454,0.0000028519687],"category_scores_gemma":[0.000027674178,0.000119580596,0.00006766902,0.0017100908,0.00001860123,0.00020694465,0.00008616054,0.00013789328,0.000012176444],"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.000008167033,0.000050992327,0.00085568766,0.000009742959,0.000014834395,0.000004248281,0.00052670017,0.00015309444,0.0005863271,0.98072785,0.0012879493,0.0157744],"study_design_scores_gemma":[0.0003702822,0.00044509312,0.026045889,0.000056798075,0.000007648522,0.000009101117,0.00028361115,0.009132339,0.006438433,0.95676166,0.00023441162,0.00021475193],"about_ca_topic_score_codex":0.000015012494,"about_ca_topic_score_gemma":0.0000031110071,"teacher_disagreement_score":0.0251902,"about_ca_system_score_codex":0.000015842066,"about_ca_system_score_gemma":0.000017479102,"threshold_uncertainty_score":0.48763552},"labels":[],"label_agreement":null},{"id":"W4385623043","doi":"10.1145/3588195.3593004","title":"Real-Time PageRank on Dynamic Graphs","year":2023,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":15,"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 British Columbia","funders":"","keywords":"Computer science; PageRank; Analytics; Abstraction; Graph; Theoretical computer science; Focus (optics); Power graph analysis; Clique-width; Distributed computing; Data science; Line graph; Voltage graph","score_opus":0.00818664707841954,"score_gpt":0.23514750307991553,"score_spread":0.226960856001496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385623043","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.6805434,0.00001243033,0.08803568,0.0038769902,0.0015417889,0.0003767503,0.000009362025,0.0066355783,0.21896797],"genre_scores_gemma":[0.9639641,0.00006577695,0.011108344,0.0005434682,0.000024103309,0.000016509199,0.000007907889,0.000015498399,0.02425428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991882,0.0000526117,0.00009520023,0.00026872114,0.00015985822,0.00023542653],"domain_scores_gemma":[0.9993391,0.000116193834,0.000019366218,0.00044605442,0.000016018315,0.000063248575],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002859129,0.0000888807,0.00008565297,0.00019084403,0.000108616136,0.00006856958,0.0005348226,0.000031552056,0.00008848298],"category_scores_gemma":[0.0000087451945,0.00007096476,0.00007175822,0.0009415384,0.000027061758,0.00015482075,0.000099145145,0.00006547865,0.003796314],"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.000004231348,0.000033845197,0.000032263255,0.0000043724067,0.0000151422255,0.0001052141,0.0002267035,0.000109434965,0.0074981023,0.94462174,0.004904198,0.042444758],"study_design_scores_gemma":[0.00033004562,0.000188896,0.00802234,0.000017841405,0.0000032600988,0.000013313443,0.000021500957,0.3229007,0.0015710159,0.6655749,0.0010268351,0.0003293361],"about_ca_topic_score_codex":0.000005818438,"about_ca_topic_score_gemma":8.53829e-7,"teacher_disagreement_score":0.32279128,"about_ca_system_score_codex":0.0000065657946,"about_ca_system_score_gemma":0.000009792743,"threshold_uncertainty_score":0.99697936},"labels":[],"label_agreement":null},{"id":"W4386974086","doi":"10.1007/978-3-031-43380-1","title":"Graph-Theoretic Concepts in Computer Science","year":2023,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Sorbonne Université; Masarykova Univerzita; Université de Fribourg; Universidad de Chile; Université d'Orléans; Ben-Gurion University of the Negev; Massachusetts Institute of Technology; Università degli Studi di Parma; Victoria University of Wellington; Durham University; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; University of California, Irvine; American University of Beirut; McGill University; Victoria University; Univerzita Karlova v Praze; Iowa State University; Università Bocconi; National Science Foundation","keywords":"Computer science; Theoretical computer science; Graph","score_opus":0.011466161515425214,"score_gpt":0.25704008768664466,"score_spread":0.24557392617121945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386974086","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.00090704835,0.00025928702,0.9895025,0.00047898586,0.0067772176,0.0006705206,0.000009167783,0.0005063166,0.0008889734],"genre_scores_gemma":[0.35007066,0.00014058332,0.6414792,0.004860128,0.0019152728,0.00009574427,0.000021742311,0.0001742065,0.0012424679],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907381,0.00023378331,0.0009949992,0.0035971226,0.002324799,0.002111218],"domain_scores_gemma":[0.9946647,0.0013684202,0.00040315834,0.0027031077,0.00041101474,0.00044957848],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.005172697,0.0009353693,0.0009968448,0.0043598423,0.00066851353,0.0014685787,0.011316549,0.0004406307,0.000017091279],"category_scores_gemma":[0.0002469325,0.00086851406,0.00026171768,0.010870881,0.0072069047,0.0016167714,0.0040313387,0.0017214792,0.00021481137],"study_design_candidate":"design_other","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.000012210158,0.00014865655,0.00026073877,0.00013438515,0.000015292826,0.00079965254,0.004473942,0.09972322,0.00021512434,0.113954134,0.00014103374,0.7801216],"study_design_scores_gemma":[0.00039665384,0.00019831174,0.00047046295,0.00057423505,0.000004674221,0.00007480212,4.6876383e-7,0.45959675,0.0007449962,0.5370045,0.000106028354,0.0008281427],"about_ca_topic_score_codex":0.000021167845,"about_ca_topic_score_gemma":0.00005873931,"teacher_disagreement_score":0.7792935,"about_ca_system_score_codex":0.00071597233,"about_ca_system_score_gemma":0.0028378658,"threshold_uncertainty_score":0.999568},"labels":[],"label_agreement":null},{"id":"W4387600598","doi":"10.1016/j.tibs.2023.08.011","title":"Using graphs and charts in scientific figures","year":2023,"lang":"en","type":"article","venue":"Trends in Biochemical Sciences","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada's Michael Smith Genome Sciences Centre; Michael Smith Health Research BC; University of British Columbia","funders":"","keywords":"Computer science; Data science; Information retrieval","score_opus":0.07328464770416913,"score_gpt":0.3316865429927945,"score_spread":0.25840189528862534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387600598","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.99815136,0.00021764387,0.00012504622,0.0003695547,0.000250035,0.00002690367,0.0000015752627,0.000079673366,0.00077818386],"genre_scores_gemma":[0.99674755,0.000010490902,0.0030702464,0.00003601131,0.000008687743,0.0000036465583,0.0000013176447,0.0000017918051,0.000120238976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862546,0.0000450875,0.00015633044,0.00053204317,0.00026059174,0.00038046812],"domain_scores_gemma":[0.99964625,0.00007477714,0.000029331908,0.00017034815,0.0000093046865,0.00007000296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010692843,0.000090761474,0.000106287465,0.00094380806,0.00018493678,0.00024167552,0.0006586906,0.00004495179,0.000012275791],"category_scores_gemma":[0.000038048605,0.00007390562,0.000028268654,0.006714741,0.00078245846,0.0003326367,0.00024781562,0.000091103415,0.000006749317],"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.000011316665,0.00025339483,0.07430347,0.00004134834,0.000007015928,0.00014049822,0.005382145,0.0005102632,0.32208115,0.41707033,0.0022403826,0.17795868],"study_design_scores_gemma":[0.0006975957,0.0001051245,0.087537654,0.00019793441,0.0000030856868,0.000032093627,0.0003470359,0.30443504,0.08185404,0.52368647,0.0003895288,0.000714409],"about_ca_topic_score_codex":0.000024162871,"about_ca_topic_score_gemma":0.000011264627,"teacher_disagreement_score":0.3039248,"about_ca_system_score_codex":0.000011085044,"about_ca_system_score_gemma":0.000019674406,"threshold_uncertainty_score":0.32262102},"labels":[],"label_agreement":null},{"id":"W4387870430","doi":"10.1109/icc45041.2023.10279733","title":"Efficient and Privacy-Preserving Subgraph Matching Queries in Graph Federation","year":2023,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","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 New Brunswick","funders":"","keywords":"Computer science; Matching (statistics); Factor-critical graph; Subgraph isomorphism problem; Graph database; Theoretical computer science; Graph; Graph factorization; Induced subgraph isomorphism problem; Data mining; Line graph; Voltage graph; Mathematics","score_opus":0.012213234218363438,"score_gpt":0.23577946108491007,"score_spread":0.22356622686654665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387870430","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.8033509,0.00003704291,0.1946133,0.00073926285,0.00013418733,0.00008418429,3.3649462e-7,0.00025612404,0.0007846265],"genre_scores_gemma":[0.99033004,0.000012998861,0.00941845,0.000096430704,0.000010959906,0.000010353525,0.0000012391484,0.000004392711,0.00011514824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991758,0.00006903215,0.00014278256,0.00026106014,0.00013802409,0.00021330314],"domain_scores_gemma":[0.9995509,0.000101949794,0.00002559774,0.0002604185,0.000016916792,0.000044251847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052428595,0.000085189844,0.00008865003,0.00030063587,0.00020521978,0.00026692587,0.0003491409,0.00002977759,0.0000061026863],"category_scores_gemma":[0.00003076141,0.0000745392,0.00002801466,0.0009478063,0.000031141393,0.00023556054,0.00042094712,0.00007997734,0.000012330282],"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.000006526516,0.000047635578,0.00805942,0.000041410196,0.000009815515,0.00004191906,0.009366591,0.008665869,0.0037557688,0.95815593,0.00017361053,0.011675516],"study_design_scores_gemma":[0.00032483155,0.000036083136,0.07224199,0.00004677362,0.0000014935562,0.000010343599,0.00080470165,0.44645658,0.002004866,0.47774938,0.000076504206,0.00024645185],"about_ca_topic_score_codex":0.000070136004,"about_ca_topic_score_gemma":0.00005732623,"teacher_disagreement_score":0.48040655,"about_ca_system_score_codex":0.000005496635,"about_ca_system_score_gemma":0.000009758778,"threshold_uncertainty_score":0.30396205},"labels":[],"label_agreement":null},{"id":"W4388233567","doi":"10.1145/3631504.3631514","title":"Kùzu: A Database Management System For \"Beyond Relational\" Workloads","year":2023,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"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":"Computer science; Relational database; Relational database management system; Set (abstract data type); Database; Relational model; World Wide Web; Programming language","score_opus":0.02996732447430424,"score_gpt":0.25584146233573296,"score_spread":0.22587413786142874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388233567","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.008588446,0.00008449394,0.9823405,0.0012042788,0.0023529506,0.0006084575,0.00003349328,0.00086723565,0.0039201127],"genre_scores_gemma":[0.26975808,0.000080257734,0.7141235,0.00052099844,0.00051415584,0.0007351487,0.00018162346,0.000055519187,0.014030741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866974,0.000060329756,0.0002336254,0.00047500184,0.0002282864,0.00033303973],"domain_scores_gemma":[0.99824816,0.0003979411,0.000080247264,0.0011404294,0.00004741875,0.00008577703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071035686,0.00013779296,0.00014483358,0.00022705781,0.00023340384,0.00008578198,0.0011924239,0.000049153165,0.000011271174],"category_scores_gemma":[0.00006159464,0.00012840709,0.00010511004,0.0009176602,0.000024177767,0.00039980107,0.0006336193,0.00008874113,0.00035707175],"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.00002268639,0.00003297928,0.00022953525,0.00014330466,0.00007044496,0.00006577102,0.00017186938,0.00012823209,0.000095022326,0.7446325,0.012965658,0.24144201],"study_design_scores_gemma":[0.0027413066,0.0003029315,0.0026349328,0.0005546169,0.00009109327,0.000046977042,0.00067615724,0.24166922,0.0011541898,0.5559715,0.19300288,0.0011541978],"about_ca_topic_score_codex":0.0000034229415,"about_ca_topic_score_gemma":0.0000019084237,"teacher_disagreement_score":0.26821706,"about_ca_system_score_codex":0.00003440114,"about_ca_system_score_gemma":0.000017414035,"threshold_uncertainty_score":0.5236289},"labels":[],"label_agreement":null},{"id":"W4389104986","doi":"10.1109/tnnls.2023.3332360","title":"Graph-Based Multicentroid Nonnegative Matrix Factorization","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Graph Theory and Algorithms","field":"Computer Science","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":"Concordia University","funders":"National Key Research and Development Program of China; Liaoning Revitalization Talents Program","keywords":"Centroid; Cluster analysis; Non-negative matrix factorization; Pattern recognition (psychology); Data point; Graph; Mathematics; Distance matrix; Matrix decomposition; Computer science; Artificial intelligence; Data mining; Algorithm; Combinatorics","score_opus":0.011527235394552398,"score_gpt":0.23373334329478987,"score_spread":0.22220610790023748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389104986","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.0366975,0.00008083378,0.96032083,0.00012914972,0.0019230384,0.00023184794,0.0000032315177,0.0005980002,0.000015586236],"genre_scores_gemma":[0.99913836,0.000032147254,0.00023232259,0.000039618073,0.00009306329,0.00003580042,0.000004903501,0.000016836577,0.00040693447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984768,0.00041724142,0.00021926382,0.00036584766,0.00019953049,0.00032133513],"domain_scores_gemma":[0.9990991,0.00043833378,0.000100473946,0.00019680479,0.000053286378,0.00011202402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032578592,0.00017962138,0.00018217872,0.00023696125,0.0006819904,0.00024944945,0.00020332381,0.000090145186,0.000003863274],"category_scores_gemma":[0.0000064980154,0.00015922806,0.00009230309,0.0009965337,0.00004784229,0.0002767338,0.0000021533979,0.00048195635,0.000017594808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014036764,0.000021778644,0.00010811366,0.000016717748,0.000017472383,0.000009557717,0.00026891322,0.99082583,0.00012280252,0.00059438474,0.00001600538,0.007984402],"study_design_scores_gemma":[0.00040354405,0.00016544698,0.00026794287,0.000048597358,0.000010967445,0.000010101624,0.00015553416,0.99845153,0.00008842653,0.00004419897,0.00017737424,0.00017632726],"about_ca_topic_score_codex":0.000030922267,"about_ca_topic_score_gemma":0.0000024052026,"teacher_disagreement_score":0.96244085,"about_ca_system_score_codex":0.000015132646,"about_ca_system_score_gemma":0.000009122203,"threshold_uncertainty_score":0.6493132},"labels":[],"label_agreement":null},{"id":"W4391093907","doi":"10.1109/bigdata59044.2023.10386845","title":"Maximum Flow on Highly Dynamic Graphs","year":2023,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Asynchronous communication; Vertex (graph theory); Latency (audio); Theoretical computer science; Graph","score_opus":0.00940772776099345,"score_gpt":0.22826825651743082,"score_spread":0.21886052875643738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391093907","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.16603237,0.000030369943,0.7632446,0.007669178,0.003642281,0.00028578812,0.000010499645,0.004573195,0.054511663],"genre_scores_gemma":[0.9763859,0.000014602295,0.01732816,0.0009205177,0.000019445948,0.00001194884,0.0000048597,0.000009694165,0.005304859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916303,0.00003751093,0.00009312754,0.0002798031,0.00017462192,0.00025192593],"domain_scores_gemma":[0.99937826,0.000072197545,0.000016885655,0.00044792326,0.000017442397,0.0000672726],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021890826,0.00009353091,0.00007929172,0.00021197487,0.00010930155,0.000076679324,0.0006233912,0.000033667926,0.000034389697],"category_scores_gemma":[0.000008559804,0.00007420387,0.00007313278,0.0010036016,0.000027623291,0.00016900802,0.00012509394,0.000082131024,0.0019281686],"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.0000030541682,0.000029004832,0.00003096363,0.0000042179613,0.0000115423,0.000080682075,0.00014667383,0.00045835058,0.00034816904,0.866018,0.003119654,0.12974967],"study_design_scores_gemma":[0.00016252208,0.0000893059,0.0022766388,0.0000071477557,0.0000013318269,0.0000065928707,0.000014122107,0.31345123,0.00063348725,0.6811858,0.0020222412,0.0001496199],"about_ca_topic_score_codex":0.0000025847967,"about_ca_topic_score_gemma":0.000002671738,"teacher_disagreement_score":0.8103535,"about_ca_system_score_codex":0.0000072836565,"about_ca_system_score_gemma":0.00000993711,"threshold_uncertainty_score":0.998849},"labels":[],"label_agreement":null},{"id":"W4391580154","doi":"10.54254/2755-2721/36/20230442","title":"A parallel Breadth-First Search using shared memory level-synchronization","year":2024,"lang":"en","type":"article","venue":"Applied and Computational Engineering","topic":"Graph Theory 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":"University of Toronto","funders":"","keywords":"Computer science; Speedup; Graph traversal; Parallel computing; Graph; Tree traversal; Benchmark (surveying); Overhead (engineering); Multiprocessing; Distributed memory; Relation (database); Breadth-first search; Distributed computing; Shared memory; Theoretical computer science; Algorithm; Data mining","score_opus":0.019793538495116104,"score_gpt":0.2238018173652416,"score_spread":0.2040082788701255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391580154","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.011294679,0.0003558158,0.9875238,0.00012135081,0.00016628286,0.00009205811,0.0000055020196,0.0002676254,0.0001729045],"genre_scores_gemma":[0.83894545,0.0000043980262,0.16087982,0.00003670338,0.00008001351,0.0000097598095,0.000014092247,0.0000120718105,0.000017723078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992323,0.000006713844,0.00012660725,0.0002794411,0.00018158909,0.00017338262],"domain_scores_gemma":[0.9996928,0.000113036265,0.000011120101,0.00009097954,0.00002747879,0.00006456562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013886637,0.000116870935,0.0000916983,0.00014953387,0.00012153858,0.00027130148,0.00016665997,0.000036643174,0.000007973347],"category_scores_gemma":[0.0000027955432,0.00012074989,0.000028078564,0.00037848236,0.000019260244,0.0002558743,0.00009437359,0.000107931504,0.000014689801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010205728,0.0000057531774,0.0000030354263,0.000049518887,0.000016817234,0.000007722769,0.00040632658,0.6923495,0.00017509048,0.29575053,0.000009355083,0.011225352],"study_design_scores_gemma":[0.00013982935,0.000007734996,0.00052092294,0.000047763526,0.00000449515,0.00004448785,0.000016709148,0.9870391,0.00006218443,0.011855713,0.00011631761,0.0001447653],"about_ca_topic_score_codex":0.000004764064,"about_ca_topic_score_gemma":2.3749976e-7,"teacher_disagreement_score":0.8276507,"about_ca_system_score_codex":0.000029735087,"about_ca_system_score_gemma":0.00004551321,"threshold_uncertainty_score":0.49240378},"labels":[],"label_agreement":null},{"id":"W4393140105","doi":"10.1109/tsipn.2024.3380351","title":"Bipartite Graph Approximation by Eigenvalue Optimization","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Graph Theory and Algorithms","field":"Computer Science","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 Windsor","funders":"","keywords":"Bipartite graph; Eigenvalues and eigenvectors; Mathematics; Combinatorics; Graph; Physics; Quantum mechanics","score_opus":0.005653637728516566,"score_gpt":0.20403156469187209,"score_spread":0.19837792696335552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393140105","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.00034553983,0.00044768763,0.9975997,0.0001349091,0.00041357218,0.00013669035,0.000008351881,0.00036117187,0.0005523481],"genre_scores_gemma":[0.9902288,0.00021309844,0.008687124,0.0006516062,0.000042043,0.00004470661,0.00002409374,0.0000091470965,0.000099382356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906313,0.000036809128,0.00030174505,0.00018926208,0.00022127185,0.00018779683],"domain_scores_gemma":[0.99962795,0.000043936183,0.00007284187,0.00011214554,0.00006482781,0.00007830364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025957517,0.00015222064,0.00010197972,0.00025471463,0.00037876825,0.00094563153,0.00015149223,0.00009901779,0.000043969474],"category_scores_gemma":[9.3182643e-7,0.00013425946,0.000055928664,0.0008142061,0.00005117501,0.0074304654,0.0000022877266,0.00022450152,0.00001539593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009635669,0.000020562757,6.31103e-7,0.00005335645,0.000013665898,3.6365594e-7,0.0005109928,0.66488236,0.00002453125,0.003096517,0.0003033376,0.33108404],"study_design_scores_gemma":[0.00015822002,0.000058644022,0.000005285205,0.000109803834,0.000014634642,0.000010351669,0.000024331324,0.995424,0.0011069936,0.0016052849,0.0013132301,0.00016923908],"about_ca_topic_score_codex":0.0000023961652,"about_ca_topic_score_gemma":1.6029587e-7,"teacher_disagreement_score":0.98988324,"about_ca_system_score_codex":0.000021238335,"about_ca_system_score_gemma":0.0000338099,"threshold_uncertainty_score":0.91187465},"labels":[],"label_agreement":null},{"id":"W4393502087","doi":"10.5281/zenodo.61234","title":"Mapp Dataset","year":2016,"lang":"en","type":"dataset","venue":"Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.008696954149617473,"score_gpt":0.19673400764959675,"score_spread":0.1880370534999793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393502087","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007412927,0.0016119499,0.13536525,0.002297122,0.0014002705,0.0007487193,0.85511434,0.0008955069,0.0018255629],"genre_scores_gemma":[0.0015657748,0.0067972164,0.01193449,0.0033190376,0.0012944001,0.000027507456,0.9691228,0.00017873697,0.0057600206],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99217224,0.0008730901,0.0008003739,0.002456957,0.0011277586,0.0025695607],"domain_scores_gemma":[0.992842,0.0005162317,0.0008991222,0.0038537807,0.00028005344,0.0016087869],"candidate_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.00096694875,0.0016860334,0.0013438753,0.001909129,0.0024205353,0.0007872377,0.010472123,0.0018698181,0.0013489333],"category_scores_gemma":[0.00011410391,0.0018182395,0.00093295285,0.0023172358,0.0010195057,0.004347114,0.0046014185,0.0018976432,0.001760994],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005235334,0.0004042146,0.000053228963,0.00026422815,0.00049786735,0.005664314,0.001042814,0.00041650597,0.00015416337,0.03530081,0.9487059,0.00697241],"study_design_scores_gemma":[0.005583192,0.00023551733,0.0003097217,0.0006562809,0.0004282624,0.0016329116,0.0011333936,0.0021288665,0.00024114236,0.0045820847,0.98084337,0.0022252542],"about_ca_topic_score_codex":0.0008957871,"about_ca_topic_score_gemma":0.00028621196,"teacher_disagreement_score":0.12343076,"about_ca_system_score_codex":0.0015401375,"about_ca_system_score_gemma":0.002495529,"threshold_uncertainty_score":0.9995886},"labels":[],"label_agreement":null},{"id":"W4393657304","doi":"10.5281/zenodo.6975830","title":"LRGB: Long Range Graph Benchmark","year":2022,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph Theory 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":"McGill University; Université de Montréal","funders":"","keywords":"Benchmark (surveying); Graph; Computer science; Range (aeronautics); Combinatorics; Theoretical computer science; Mathematics; Geography; Materials science; Cartography; Composite material","score_opus":0.022492604142220568,"score_gpt":0.2316505517257387,"score_spread":0.20915794758351813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393657304","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004343919,0.00029391202,0.01460066,0.0002935508,0.00083571905,0.0005886214,0.9740449,0.0011307499,0.008168431],"genre_scores_gemma":[0.00015105243,0.00035591584,0.00027843905,0.00032585242,0.0001800023,1.4653811e-7,0.9974739,0.0007785742,0.00045611194],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963341,0.0009670345,0.00035869802,0.0009193752,0.000827709,0.00059311156],"domain_scores_gemma":[0.9974623,0.000055227683,0.00023117088,0.0016818722,0.00030799577,0.0002614577],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013897524,0.000317197,0.0002901027,0.000702625,0.004000054,0.0016930382,0.006459899,0.00013560177,0.13413319],"category_scores_gemma":[0.00023724504,0.00034646105,0.00016919748,0.0015909665,0.0001936146,0.0004894406,0.0047178534,0.0009424274,0.0054047173],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014336447,0.00013677811,1.5845751e-7,0.0000751962,0.000053590058,0.00012978757,0.00025822382,0.000018503515,0.000008726322,0.003342056,0.97856027,0.017402373],"study_design_scores_gemma":[0.0003265291,0.0002322026,0.00003578261,0.00002496956,0.000021082138,0.00022260498,0.000042705462,0.00007660343,0.000007743033,0.0012468972,0.9973824,0.00038045133],"about_ca_topic_score_codex":0.000021415954,"about_ca_topic_score_gemma":5.064055e-7,"teacher_disagreement_score":0.12872848,"about_ca_system_score_codex":0.00012901754,"about_ca_system_score_gemma":0.0000073533943,"threshold_uncertainty_score":0.99989873},"labels":[],"label_agreement":null},{"id":"W4394341356","doi":"10.6084/m9.figshare.6427673","title":"graph-archive.rar","year":2018,"lang":"en","type":"dataset","venue":"Figshare","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph; Computer science; Theoretical computer science","score_opus":0.022764743904946382,"score_gpt":0.24465503651462361,"score_spread":0.22189029260967724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394341356","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.7010598e-8,0.00013265629,0.000114460614,0.000023159033,0.00040123143,0.00014097505,0.9986642,0.00014136946,0.00038191536],"genre_scores_gemma":[2.2842437e-7,0.000007430126,0.0014177458,0.00040622137,0.0003343156,0.00009426194,0.997644,0.000010779989,0.000085013744],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998468,0.00009631626,0.00018442988,0.00059145346,0.0002936063,0.00036622584],"domain_scores_gemma":[0.99803406,0.00013996365,0.00015502225,0.001454625,0.00006779939,0.00014855033],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007136184,0.00029151264,0.0002332294,0.00023686732,0.00017421931,0.00025466635,0.0032388028,0.00020555605,0.10119165],"category_scores_gemma":[0.00023288354,0.00026452926,0.00018783963,0.0004005537,0.000019948224,0.00021163623,0.00096902397,0.00037932454,0.018563552],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.808897e-7,0.00002197895,1.784904e-8,0.00009118613,0.000017556453,0.000094224895,0.000012431704,3.6623118e-7,2.2211188e-7,0.00011280777,0.9991041,0.0005442162],"study_design_scores_gemma":[0.00007672351,0.000066304485,0.0000054910515,0.0008137567,0.000005174055,0.00002853701,7.8527444e-7,0.00010554522,0.000016444346,0.008732,0.9898178,0.00033141856],"about_ca_topic_score_codex":0.000005054143,"about_ca_topic_score_gemma":0.00000765117,"teacher_disagreement_score":0.08262809,"about_ca_system_score_codex":0.000009360181,"about_ca_system_score_gemma":0.00008433329,"threshold_uncertainty_score":0.9999807},"labels":[],"label_agreement":null},{"id":"W4394793064","doi":"10.61091/um119-08","title":"On Maximum Degree and Maximum Reverse Degree Energies of Splitting and Shadow graph of Complete graph","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Windmill graph; Graph; Vertex (graph theory); Regular graph; Butterfly graph; Discrete mathematics; Line graph; Voltage graph; Physics","score_opus":0.038940150735022126,"score_gpt":0.25089549136809297,"score_spread":0.21195534063307084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394793064","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.7692976,0.0052441927,0.21157873,0.000672473,0.0004375655,0.0006397134,0.0001345513,0.00037790934,0.011617263],"genre_scores_gemma":[0.92875063,0.00007346771,0.071022995,0.00005204552,0.000012321459,0.000011319671,0.0000019531321,0.000017264563,0.000058029436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834704,0.0000987342,0.00049306644,0.00046697274,0.00030830473,0.00028588795],"domain_scores_gemma":[0.9981723,0.00090371247,0.00012803084,0.0006304743,0.00006250361,0.000102979924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008157706,0.0002413174,0.00043408462,0.00035788378,0.00009937185,0.00008166046,0.0004593646,0.00007390414,0.000031664833],"category_scores_gemma":[0.0001275093,0.0001959801,0.00014410747,0.00053657894,0.00043565585,0.00026622417,0.00030180503,0.00015504252,0.0000078570465],"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.000014834614,0.00008136932,0.000047990707,0.0013045334,0.00008877225,0.000024766845,0.0023944355,0.000004958402,0.0015537489,0.9610886,0.00018909162,0.033206884],"study_design_scores_gemma":[0.00022843151,0.00020634352,0.0006132985,0.00076043914,0.000044320946,0.000056713823,0.00040806824,0.010256972,0.0018252236,0.98531586,0.00009026266,0.00019405247],"about_ca_topic_score_codex":0.000014546306,"about_ca_topic_score_gemma":0.000002749646,"teacher_disagreement_score":0.159453,"about_ca_system_score_codex":0.000006509195,"about_ca_system_score_gemma":0.00002100662,"threshold_uncertainty_score":0.79918367},"labels":[],"label_agreement":null},{"id":"W4394946076","doi":"10.1145/3627703.3629589","title":"Contigra: Graph Mining with Containment Constraints","year":2024,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Universitas Brawijaya","keywords":"Scalability; Containment (computer programming); Computer science; Graph; Constraint (computer-aided design); Task (project management); Limit (mathematics); Theoretical computer science; Distributed computing; Mathematics; Programming language; Database; Engineering","score_opus":0.0072216911303840375,"score_gpt":0.21143320155128945,"score_spread":0.2042115104209054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394946076","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.018708985,0.00026801482,0.9510401,0.0007048819,0.00036438738,0.000104301354,0.000001836794,0.00045441926,0.028353095],"genre_scores_gemma":[0.9618858,0.00000451764,0.03694373,0.00037581997,0.000022036684,0.000010803028,7.3282536e-7,0.0000050867384,0.0007514515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992056,0.000029925233,0.00010644152,0.00029525263,0.00015693904,0.00020586948],"domain_scores_gemma":[0.99957186,0.00009515883,0.000013976315,0.00021807039,0.000022492783,0.000078425925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022771723,0.0001046218,0.00009838908,0.000095976335,0.000067509776,0.00025392757,0.00030118978,0.000024125253,0.000093122966],"category_scores_gemma":[0.0000034001537,0.00006998455,0.00004812615,0.00033021238,0.00015012064,0.00027639593,0.000052296324,0.00007455359,0.000048717142],"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.0000024037895,0.000014499185,0.00018446906,0.000008571031,0.0000443334,0.0001873279,0.00058250333,0.000005295871,0.00015638875,0.9347591,0.00048001364,0.06357512],"study_design_scores_gemma":[0.0058144513,0.0035896571,0.0071635228,0.0018176364,0.00018038266,0.0028866755,0.009024531,0.17806971,0.042977866,0.6660466,0.0782768,0.0041521704],"about_ca_topic_score_codex":0.0000034874197,"about_ca_topic_score_gemma":0.0000039360557,"teacher_disagreement_score":0.94317687,"about_ca_system_score_codex":0.000008698316,"about_ca_system_score_gemma":0.000039946382,"threshold_uncertainty_score":0.2853887},"labels":[],"label_agreement":null},{"id":"W4395688995","doi":"10.1007/978-981-97-2387-4_26","title":"DYGL: A Unified Benchmark and Library for Dynamic Graph","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PricewaterhouseCoopers (Canada)","funders":"","keywords":"Computer science; Benchmark (surveying); Graph; Theoretical computer science; Cartography","score_opus":0.007923577022929977,"score_gpt":0.22022107733300206,"score_spread":0.21229750031007208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395688995","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.000088814086,0.0021112408,0.9905349,0.0012382399,0.0023276731,0.00051215413,0.000033389962,0.00033616522,0.0028174354],"genre_scores_gemma":[0.10888901,0.00031811316,0.8829972,0.0028314264,0.0005475196,0.00005369449,0.00004070635,0.00012832122,0.0041939984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688864,0.000021196765,0.00038790578,0.0016700734,0.00043904132,0.00059317343],"domain_scores_gemma":[0.9980283,0.000618262,0.0001325604,0.0009620957,0.00006767058,0.00019114734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057169737,0.0005166046,0.00045148784,0.0011331345,0.00026401514,0.0010243569,0.0024487837,0.00028794605,0.000012237849],"category_scores_gemma":[0.00002444026,0.00044938456,0.0001778069,0.0007989952,0.00079678034,0.0008791817,0.0013999145,0.00064477953,0.000013988715],"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.000007707535,0.00001454713,0.00000802563,0.00013416292,0.000021236245,0.00008559502,0.0005008521,0.00095060805,0.000050073937,0.5827654,0.000043996937,0.41541776],"study_design_scores_gemma":[0.00013059139,0.00014113546,0.00002324687,0.00029823472,0.000009692323,0.00005625239,1.5837593e-7,0.29245704,0.00015669364,0.7042388,0.0020821062,0.0004060523],"about_ca_topic_score_codex":0.0000017644306,"about_ca_topic_score_gemma":0.000010225751,"teacher_disagreement_score":0.41501173,"about_ca_system_score_codex":0.000047168378,"about_ca_system_score_gemma":0.0002612407,"threshold_uncertainty_score":0.9997958},"labels":[],"label_agreement":null},{"id":"W4396601617","doi":"10.14778/3648160.3648187","title":"AeonG: An Efficient Built-in Temporal Support in Graph Databases","year":2024,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Graph database; Database; Graph; Theoretical computer science","score_opus":0.020735606360406958,"score_gpt":0.26751256505131277,"score_spread":0.24677695869090582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396601617","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.9936811,0.0003234195,0.0016254768,0.0010516931,0.0007244279,0.00048505052,0.000014390294,0.00014478971,0.0019496662],"genre_scores_gemma":[0.9955986,0.000015697362,0.0041368986,0.0000785085,0.00003054991,0.00004342873,0.0000019150298,0.0000099551,0.00008442363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99846774,0.000016373047,0.00034404264,0.00046871306,0.00036945083,0.00033369433],"domain_scores_gemma":[0.9995123,0.000038578073,0.00007484105,0.00026114777,0.00004155665,0.00007153962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009822589,0.00016337866,0.00018238036,0.00035960204,0.00005140373,0.00011982783,0.0012340066,0.000029153705,0.0000134232205],"category_scores_gemma":[0.000031960375,0.00011384048,0.00009503366,0.0011665864,0.0000845064,0.00050343375,0.0005020064,0.00019660895,0.00000775151],"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.000036369165,0.0009519967,0.029981893,0.0003541016,0.000034894023,0.000050892148,0.0061599086,0.0006338202,0.01953992,0.9284061,0.00086182123,0.012988251],"study_design_scores_gemma":[0.003312106,0.0012189971,0.052150197,0.0024563377,0.00007395876,0.00026920965,0.003453208,0.21074526,0.4379294,0.27439174,0.012087151,0.0019124286],"about_ca_topic_score_codex":0.00011880621,"about_ca_topic_score_gemma":0.000021890479,"teacher_disagreement_score":0.6540144,"about_ca_system_score_codex":0.000049274022,"about_ca_system_score_gemma":0.00004971834,"threshold_uncertainty_score":0.464228},"labels":[],"label_agreement":null},{"id":"W4398143310","doi":"10.1007/s10878-024-01178-y","title":"The frustum network model based on clique extension","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Frustum; Extension (predicate logic); Theory of computation; Clique; Computer science; Mathematics; Combinatorics; Algorithm; Programming language; Geometry","score_opus":0.007567530312318666,"score_gpt":0.23355045132413746,"score_spread":0.2259829210118188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398143310","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.000204366,0.0002796527,0.98574036,0.0016983976,0.011377385,0.00007679174,2.749013e-7,0.000049561204,0.00057320856],"genre_scores_gemma":[0.84247583,0.00016929435,0.15535541,0.00045786175,0.0014086942,0.0000036212325,0.0000012775935,0.000021934877,0.00010609579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877214,0.00018089425,0.00035107168,0.0001373011,0.00039144928,0.00016715021],"domain_scores_gemma":[0.9988557,0.00038398325,0.00017935659,0.0002448674,0.00026338256,0.000072682196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014842545,0.00010522349,0.00013356723,0.00010305771,0.0002573708,0.00039952673,0.00049530104,0.000071179544,0.0000032950857],"category_scores_gemma":[0.00011022932,0.0000669639,0.00013541832,0.00047800184,0.00002895296,0.00045538862,0.000043248852,0.00029858164,0.0000037221043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037149566,0.000025870651,0.0000013318485,0.0000023852838,0.0000072921057,0.0000122695665,0.000030094472,0.6661031,0.000005834298,0.33043993,0.0014774789,0.0018572636],"study_design_scores_gemma":[0.00027721224,0.00022269804,0.000004766294,0.00008733899,0.0000095197265,0.000008273943,0.0000024465342,0.7914069,0.00006562478,0.20707554,0.00077747606,0.000062207146],"about_ca_topic_score_codex":2.248213e-7,"about_ca_topic_score_gemma":2.085673e-8,"teacher_disagreement_score":0.84227145,"about_ca_system_score_codex":0.00004622339,"about_ca_system_score_gemma":0.00018475455,"threshold_uncertainty_score":0.38526455},"labels":[],"label_agreement":null},{"id":"W4398233641","doi":"10.1145/3626246.3658369","title":"The Future of Graph Analytics","year":2024,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Universitas Brawijaya","keywords":"Computer science; Analytics; Data science; Graph; Theoretical computer science","score_opus":0.00654042828929299,"score_gpt":0.22574651309888044,"score_spread":0.21920608480958745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398233641","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.0022596805,0.0046627913,0.97288185,0.0041175773,0.0018148771,0.000044215114,0.0000011699835,0.00018310569,0.014034711],"genre_scores_gemma":[0.98600477,0.00023350852,0.010575171,0.00016047602,0.00015679089,0.0000017434699,2.4756605e-7,0.0000035425278,0.0028637452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966073,0.00001755266,0.00006971371,0.00008826697,0.00008686086,0.00007690194],"domain_scores_gemma":[0.99963033,0.000083191604,0.000008675001,0.00024054154,0.000018550052,0.00001872294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020958872,0.000035063047,0.000035575787,0.000038245977,0.00005802666,0.00009398152,0.00043312396,0.000014803896,0.000008059052],"category_scores_gemma":[0.0000020574266,0.000017645854,0.000059465892,0.0004819499,0.00003865678,0.00009700808,0.0000564542,0.000053081756,0.000014666244],"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":[2.1916709e-7,0.0000027201106,0.00000855457,0.0000032295054,0.0000096489275,0.0000026223438,0.00008196773,0.0000065783324,0.000031208343,0.913929,0.0012282649,0.084696025],"study_design_scores_gemma":[0.000028432067,0.000030168725,0.00020394781,0.00000891359,0.0000047941858,0.000007828241,0.00012707389,0.062137008,0.0017178741,0.8607129,0.07495979,0.0000612612],"about_ca_topic_score_codex":8.238777e-7,"about_ca_topic_score_gemma":0.000002411475,"teacher_disagreement_score":0.9837451,"about_ca_system_score_codex":0.0000014640931,"about_ca_system_score_gemma":0.000013595079,"threshold_uncertainty_score":0.0906266},"labels":[],"label_agreement":null},{"id":"W4398596069","doi":"10.7910/dvn/3cs5es/dnbo4x","title":"graph_api_counts.tab","year":2019,"lang":"en","type":"dataset","venue":"Harvard Dataverse","topic":"Graph Theory 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":"University of Ottawa; Simon Fraser University","funders":"","keywords":"Graph; Computer science; Programming language; Theoretical computer science","score_opus":0.014696756608063879,"score_gpt":0.23145143588904907,"score_spread":0.21675467928098519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398596069","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00000215434,0.0000034609463,0.012802948,0.0000066997827,0.0036459516,0.0002630974,0.98290753,0.00012570615,0.00024241811],"genre_scores_gemma":[0.000005773375,0.00025634596,0.0018164346,0.0008522859,0.00028205724,0.000020060439,0.99623495,0.000016837495,0.000515233],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99736816,0.00015255235,0.00034652863,0.000979578,0.0005990624,0.0005541312],"domain_scores_gemma":[0.99497175,0.00012474395,0.00023719828,0.004388903,0.00008734918,0.0001900399],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00052300334,0.0004569755,0.00045454764,0.00040446376,0.00016035055,0.00039739494,0.004664777,0.0003175414,0.0050413157],"category_scores_gemma":[0.00007148599,0.00043465156,0.00023783496,0.0005421548,0.0001055162,0.000939764,0.0014869374,0.0006042171,0.3410459],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073343854,0.00006906474,0.0000011619575,0.00006772753,0.00005855559,0.00012611307,0.000015109028,0.0000047911244,0.000004244021,0.0022896675,0.9964126,0.00094364525],"study_design_scores_gemma":[0.00033978035,0.000060526763,0.000009354586,0.00006401181,0.00004367975,0.000038684157,0.000008304246,0.0003664216,0.000014972356,0.0019904822,0.99652994,0.0005338167],"about_ca_topic_score_codex":0.00009043958,"about_ca_topic_score_gemma":0.00001695424,"teacher_disagreement_score":0.33600456,"about_ca_system_score_codex":0.000037967347,"about_ca_system_score_gemma":0.00015542166,"threshold_uncertainty_score":0.9998105},"labels":[],"label_agreement":null},{"id":"W4399452902","doi":"10.1145/3661304.3661900","title":"Optimizing Differential Computation for Large-Scale Graph Processing","year":2024,"lang":"en","type":"article","venue":"","topic":"Graph Theory 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":"University of Waterloo","funders":"","keywords":"Computer science; Computation; Graph; Scale (ratio); Theoretical computer science; Parallel computing; Algorithm","score_opus":0.013492272477144053,"score_gpt":0.2634781820546988,"score_spread":0.24998590957755476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399452902","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.0063892007,0.00019592988,0.99123263,0.00027511836,0.0005076948,0.00013000441,0.0000027268518,0.00049721927,0.00076944893],"genre_scores_gemma":[0.7325813,0.0000014525585,0.26703414,0.00008535123,0.000078604906,0.000018141429,0.000007130225,0.0000073234833,0.0001865419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927974,0.000018266697,0.000117011834,0.000281802,0.000101316014,0.00020187678],"domain_scores_gemma":[0.99975085,0.00005655147,0.000017176391,0.00009539415,0.0000375485,0.000042500622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016152763,0.00008474532,0.000079469224,0.00011430682,0.00017804916,0.00048178885,0.00022599894,0.000031295272,0.000010832705],"category_scores_gemma":[0.0000032512712,0.00006832912,0.00008466575,0.0003115554,0.000013199452,0.00048687198,0.000067303175,0.00006119237,0.000008998059],"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.00000858927,0.000114341696,0.00003314012,0.00026067646,0.00003375636,0.0000090990525,0.0052962876,0.0013525746,0.0017750193,0.6477353,0.0007932371,0.342588],"study_design_scores_gemma":[0.00015484306,0.00003074733,0.000044409964,0.000032650005,0.0000063184975,0.0000047618637,0.00008222156,0.9189759,0.0011354912,0.07899752,0.00043118486,0.000103978324],"about_ca_topic_score_codex":4.5074455e-7,"about_ca_topic_score_gemma":0.0000011692396,"teacher_disagreement_score":0.9176233,"about_ca_system_score_codex":0.0000077628565,"about_ca_system_score_gemma":0.000020059162,"threshold_uncertainty_score":0.4645901},"labels":[],"label_agreement":null},{"id":"W4399729095","doi":"10.1109/icdew61823.2024.00053","title":"Towards View Management in Graph Databases","year":2024,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","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":"McGill University","funders":"","keywords":"Computer science; Graph database; Database; Graph; Information retrieval; Theoretical computer science","score_opus":0.02538976692979606,"score_gpt":0.2816876922927155,"score_spread":0.25629792536291945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399729095","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.0009794406,0.0015858093,0.9329847,0.0008333822,0.0005686386,0.000100148856,0.0000021160624,0.00031070295,0.06263506],"genre_scores_gemma":[0.6886571,0.0012114785,0.30320498,0.0019541977,0.000075590346,0.00006917177,0.000009273992,0.00001567743,0.004802513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993664,0.000028388391,0.00009725163,0.0002545343,0.00011067538,0.00014273144],"domain_scores_gemma":[0.9996366,0.000020988946,0.000004776015,0.00030167148,0.0000046332716,0.000031324107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027240772,0.000066300796,0.000060593877,0.00018878256,0.000021780808,0.000113309514,0.00040700394,0.000008268372,0.00008143314],"category_scores_gemma":[0.0000016472204,0.00005046158,0.00003782452,0.00075025705,0.000016306765,0.00038366372,0.00022987796,0.000055628403,0.0001472349],"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":[2.1677407e-7,0.000012621711,0.0000067114124,0.000026783013,0.000006806867,0.00011712247,0.00005092306,0.000003872939,0.0000042185534,0.7218347,0.0005149921,0.27742103],"study_design_scores_gemma":[0.00023759111,0.000043298136,0.0020268427,0.0002786859,0.000011500159,0.000032835567,0.00011258187,0.042752407,0.0012094869,0.729466,0.22343448,0.00039428662],"about_ca_topic_score_codex":0.000017056387,"about_ca_topic_score_gemma":0.0000075114635,"teacher_disagreement_score":0.6876777,"about_ca_system_score_codex":0.000006893851,"about_ca_system_score_gemma":0.000008586899,"threshold_uncertainty_score":0.20577633},"labels":[],"label_agreement":null},{"id":"W4400404039","doi":"10.1007/s00778-024-00860-1","title":"Minimum motif-cut: a workload-aware RDF graph partitioning strategy","year":2024,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Motif (music); RDF; Computer science; Workload; Graph; Parallel computing; Theoretical computer science; Artificial intelligence; Operating system; Art; Semantic Web","score_opus":0.01798901487496369,"score_gpt":0.25051093290324294,"score_spread":0.23252191802827926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400404039","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.12579353,0.008362527,0.84913224,0.0073649776,0.004234648,0.00017148482,0.000006974517,0.00047209856,0.0044615013],"genre_scores_gemma":[0.9971019,0.00019092765,0.0011352608,0.00026049174,0.0005505976,0.000005314096,5.3470905e-7,0.000012596575,0.0007423658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861723,0.0002044469,0.00026208573,0.00022658617,0.00030623167,0.00038339317],"domain_scores_gemma":[0.9992418,0.00015546437,0.00006993097,0.00033079265,0.000058218004,0.000143739],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001028327,0.00015010129,0.00012510283,0.0001708545,0.0006185409,0.001379666,0.0009802816,0.0000484748,0.00013631812],"category_scores_gemma":[0.000014238801,0.0000944668,0.00018911909,0.0007697914,0.00009843123,0.00066517195,0.00011592162,0.0006208968,0.00017900305],"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.00006980171,0.00017254098,0.00019515224,0.00006979134,0.00044085993,0.0019051929,0.008729089,0.0072748917,0.0012169322,0.5152762,0.016637586,0.448012],"study_design_scores_gemma":[0.00031499754,0.00039892163,0.0006185207,0.0006063091,0.00004615689,0.003037249,0.0006529272,0.080242984,0.0012074221,0.90782267,0.0046879794,0.0003638732],"about_ca_topic_score_codex":0.0000019269783,"about_ca_topic_score_gemma":0.0000040843665,"teacher_disagreement_score":0.8713084,"about_ca_system_score_codex":0.000020663103,"about_ca_system_score_gemma":0.00009521174,"threshold_uncertainty_score":0.999657},"labels":[],"label_agreement":null},{"id":"W4400829805","doi":"10.26434/chemrxiv-2024-fmck4","title":"\"Amide - amine + alcohol = carboxylic acid.\" Chemical reactions as linear algebraic analogies in graph neural networks.","year":2024,"lang":"en","type":"preprint","venue":"ChemRxiv","topic":"Graph Theory 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":"University of New Brunswick","funders":"","keywords":"Amine gas treating; Alcohol; Amide; Algebraic number; Chemistry; Graph; Organic chemistry; Carboxylic acid; Mathematics; Discrete mathematics","score_opus":0.02145926334760183,"score_gpt":0.26720884266021455,"score_spread":0.2457495793126127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400829805","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.95872724,0.0056601884,0.020428743,0.002978077,0.0051974454,0.0007645875,0.0000103459715,0.0017974416,0.0044359067],"genre_scores_gemma":[0.99529564,0.000213963,0.0030643614,0.000302004,0.00056232157,0.00016273682,0.000072210736,0.000052722928,0.00027400855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669474,0.00012392957,0.0006701215,0.0014324121,0.00035451283,0.0007242619],"domain_scores_gemma":[0.99776953,0.00018530007,0.00019688973,0.001543741,0.00008570403,0.0002188573],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0005123765,0.00060794246,0.0006371414,0.0005716313,0.00009365508,0.00033015053,0.0020441834,0.00056943187,0.000026657304],"category_scores_gemma":[0.00015074242,0.0005890601,0.00049141946,0.00154056,0.00026771048,0.00021259749,0.0029175798,0.0024752375,0.00007911093],"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.00027583694,0.002722317,0.0030856673,0.0038723098,0.002842582,0.007558058,0.00838385,0.12783521,0.14178309,0.52282506,0.008967778,0.16984823],"study_design_scores_gemma":[0.000519172,0.00006070499,0.00076818105,0.00047399043,0.00009646336,0.00015376639,0.00006904462,0.5481433,0.04247513,0.40536836,0.0005468499,0.0013249817],"about_ca_topic_score_codex":0.00010255787,"about_ca_topic_score_gemma":0.000013155985,"teacher_disagreement_score":0.42030814,"about_ca_system_score_codex":0.00010142021,"about_ca_system_score_gemma":0.000116723386,"threshold_uncertainty_score":0.9998261},"labels":[],"label_agreement":null},{"id":"W4400887584","doi":"10.24132/csrn.3401.1","title":"A Synergy of Computer Graphics and Generative AI: Advancements and Challenges","year":2024,"lang":"en","type":"article","venue":"Computer Science Research Notes","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Generative grammar; Computer graphics; Graphics; Computer graphics (images); Artificial intelligence; Human–computer interaction","score_opus":0.11460364694519654,"score_gpt":0.37893787795042855,"score_spread":0.264334231005232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400887584","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.031853016,0.0112000685,0.9513099,0.0048168018,0.00049057446,0.00018167208,0.0000035882351,0.00009478898,0.000049589064],"genre_scores_gemma":[0.86867344,0.004349592,0.12655602,0.00019435522,0.00018844526,0.000016536165,7.0285796e-7,0.000009649979,0.000011223516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971803,0.00023475214,0.00019258294,0.000928644,0.0008838995,0.0005798206],"domain_scores_gemma":[0.99803305,0.0008329135,0.000030334795,0.00048061018,0.0003807252,0.00024234309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029548632,0.00016290344,0.00020726491,0.00090138376,0.00043994843,0.0007750837,0.0011136265,0.000047401794,0.0000014817848],"category_scores_gemma":[0.000057514797,0.0001306888,0.000039089544,0.0018189809,0.0021003997,0.001467212,0.0017915752,0.00030669157,0.0000042658007],"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.000001942751,0.000028525468,0.00005157208,0.00009415156,0.000013157303,0.000025475501,0.00140211,0.00004534278,0.0007150622,0.52801675,0.000031112613,0.46957478],"study_design_scores_gemma":[0.0001548777,0.00055435003,0.0017563625,0.00022620722,0.000002222954,0.00004749213,0.000021533939,0.8902785,0.005269979,0.099735685,0.0017630081,0.00018979001],"about_ca_topic_score_codex":0.00000919083,"about_ca_topic_score_gemma":0.000003287905,"teacher_disagreement_score":0.89023316,"about_ca_system_score_codex":0.000021610073,"about_ca_system_score_gemma":0.00018155329,"threshold_uncertainty_score":0.77390105},"labels":[],"label_agreement":null},{"id":"W4400910151","doi":"10.1109/icde60146.2024.00148","title":"Task-Oriented GNNs Training on Large Knowledge Graphs for Accurate and Efficient Modeling","year":2024,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology; Concordia University","funders":"","keywords":"Computer science; Task (project management); Training (meteorology); Artificial intelligence; Machine learning; Training set; Systems engineering","score_opus":0.033988497446006134,"score_gpt":0.2897766437299083,"score_spread":0.2557881462839022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400910151","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.078087114,0.00054493354,0.91839653,0.0002508089,0.0007841416,0.000192124,0.000013913901,0.0003584701,0.001371962],"genre_scores_gemma":[0.989661,0.000011869844,0.009872392,0.00015012885,0.00004369,0.000030808853,0.0000035606383,0.000011092734,0.00021545254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890727,0.00003490535,0.00016118001,0.00045832896,0.000098974146,0.0003393558],"domain_scores_gemma":[0.99944395,0.00018969124,0.00001536189,0.00021081956,0.000045005178,0.00009519968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000566214,0.00014030458,0.00012672339,0.00020262918,0.00022074027,0.0002075861,0.00024152298,0.00005892459,0.000005000926],"category_scores_gemma":[0.00002411082,0.00010925217,0.00008968766,0.0004623666,0.00002237163,0.00013458413,0.00010112759,0.00014522871,0.000017048902],"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.000005070339,0.00003831379,6.084592e-7,0.000025077405,0.000016160417,0.00000449224,0.003957725,0.003275509,0.00018785705,0.9793508,0.000113277674,0.013025132],"study_design_scores_gemma":[0.00026255296,0.000081515296,0.000004359453,0.0000649975,0.0000066057314,0.0000057646735,0.00026532085,0.94172895,0.00018654559,0.05546592,0.0017829135,0.00014453364],"about_ca_topic_score_codex":8.944879e-7,"about_ca_topic_score_gemma":0.0000019151555,"teacher_disagreement_score":0.93845344,"about_ca_system_score_codex":0.000010056815,"about_ca_system_score_gemma":0.000034293116,"threshold_uncertainty_score":0.44551742},"labels":[],"label_agreement":null},{"id":"W4401015308","doi":"10.5206/mt.v4i1.18785","title":"Maple Conference 2023 Mathematical Art and Creative Works Exhibit","year":2024,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Maple; Computer science; Botany; Biology","score_opus":0.01746288829459877,"score_gpt":0.24245003397363463,"score_spread":0.22498714567903585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401015308","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.0010139175,0.00024315923,0.98230195,0.001673226,0.00025690428,0.00011707447,0.000018570267,0.0002776398,0.01409753],"genre_scores_gemma":[0.9333639,0.000105567364,0.039571017,0.00012754902,0.00005496997,0.000080329075,0.0000052454184,0.000016939426,0.026674468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912065,0.00004967601,0.00014937739,0.0003286612,0.00014155178,0.00021006775],"domain_scores_gemma":[0.9994219,0.00017093326,0.000013103214,0.00025625929,0.000028825916,0.0001089878],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018689349,0.00012722296,0.00013435393,0.000109031054,0.00017628806,0.0004156205,0.00022900716,0.00006156272,0.0015066555],"category_scores_gemma":[0.000005442259,0.00011188536,0.00007545649,0.00039519605,0.00011392579,0.00049549295,0.000016492633,0.00023590734,0.0005373401],"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.000008531277,0.00014771962,0.0000036136605,0.00012346834,0.00011252136,0.000085291096,0.004704174,0.00012480217,0.000685084,0.8509391,0.0024234194,0.14064232],"study_design_scores_gemma":[0.00036884134,0.00014416875,0.00021237637,0.0004490915,0.00007242708,0.00022093998,0.00080550974,0.31323338,0.002895383,0.65366024,0.027420895,0.0005167279],"about_ca_topic_score_codex":0.000005066372,"about_ca_topic_score_gemma":0.000009576296,"teacher_disagreement_score":0.94273096,"about_ca_system_score_codex":0.000012729818,"about_ca_system_score_gemma":0.00003446969,"threshold_uncertainty_score":0.9994061},"labels":[],"label_agreement":null},{"id":"W4402200311","doi":"10.1137/23m1556800","title":"Generalizing Lloyd’s Algorithm for Graph Clustering","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Scientific Computing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Nuclear Security Administration","keywords":"Mathematics; Cluster analysis; Algorithm; Graph; Combinatorics; Statistics","score_opus":0.02679274351788102,"score_gpt":0.28695660388153976,"score_spread":0.26016386036365874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402200311","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.009055137,0.00086383236,0.9706025,0.00047705122,0.01814036,0.00016459858,0.0000055230544,0.00032451763,0.00036646772],"genre_scores_gemma":[0.3786037,0.0000138804635,0.61746585,0.00041889562,0.002043239,0.000005086757,0.0000054302886,0.000050155082,0.0013937831],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730456,0.00013208773,0.0005190094,0.0007661806,0.00058339053,0.00069479656],"domain_scores_gemma":[0.9986251,0.0003571668,0.00014390681,0.0004440429,0.00018433467,0.00024543193],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0040766494,0.0002312856,0.00023129754,0.0008210842,0.0015329166,0.00519876,0.0012501631,0.000060676553,0.000011559004],"category_scores_gemma":[0.00004883886,0.00020557169,0.00038299977,0.0014030443,0.00010741175,0.0007317859,0.00030584336,0.00047704813,0.00005989679],"study_design_candidate":"design_other","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.0000023590778,0.000034205153,0.0000034897866,0.000032038275,0.00004379583,0.000116371,0.0010992694,0.0062484085,0.0018054271,0.03607828,0.0019216667,0.95261467],"study_design_scores_gemma":[0.00023800651,0.00010221223,0.000021246713,0.00034116348,0.000009378238,0.00053024053,0.00006881569,0.94166327,0.001074364,0.034384817,0.021299278,0.00026719717],"about_ca_topic_score_codex":8.465186e-7,"about_ca_topic_score_gemma":6.486839e-7,"teacher_disagreement_score":0.9523475,"about_ca_system_score_codex":0.00007621861,"about_ca_system_score_gemma":0.00012260964,"threshold_uncertainty_score":0.99976695},"labels":[],"label_agreement":null},{"id":"W4402455871","doi":"10.1016/j.disc.2024.114253","title":"Adversarial graph burning densities","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Mathematics; Combinatorics; Adversarial system; Graph; Discrete mathematics; Artificial intelligence; Computer science","score_opus":0.010629957919076755,"score_gpt":0.23862935155523418,"score_spread":0.22799939363615743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402455871","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.0129802255,0.000350894,0.97770286,0.00025940567,0.0009486115,0.00008145754,0.0000045581446,0.0005149692,0.007157009],"genre_scores_gemma":[0.84202415,0.000018080922,0.15646513,0.00010973636,0.00021386686,0.000012299803,0.0000044392027,0.000023319551,0.0011289577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912363,0.000031427975,0.00018513807,0.00022442106,0.0002175662,0.00021780006],"domain_scores_gemma":[0.99936706,0.0001684423,0.00003202308,0.00034911165,0.000024049225,0.000059291433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032481836,0.00013215854,0.00014000782,0.00012770231,0.00011685413,0.00040962684,0.00045694655,0.0000434831,0.000027494856],"category_scores_gemma":[0.000030932537,0.000104736886,0.00012956704,0.00035142776,0.00006169073,0.00038994366,0.00015482063,0.00013508486,0.00015245893],"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":[6.54875e-7,0.000010117335,0.0000023140979,0.00009481957,0.00003141991,0.00005840806,0.006440254,0.000047840105,0.00021171008,0.99007106,0.00027621296,0.0027552051],"study_design_scores_gemma":[0.000080909784,0.00003016791,0.0000073900096,0.00015895993,0.000019416608,0.00006018782,0.00058778626,0.24359265,0.00088102935,0.75274867,0.0016350949,0.000197708],"about_ca_topic_score_codex":0.0000015365799,"about_ca_topic_score_gemma":4.1090973e-7,"teacher_disagreement_score":0.8290439,"about_ca_system_score_codex":0.000010574712,"about_ca_system_score_gemma":0.000025197123,"threshold_uncertainty_score":0.42710462},"labels":[],"label_agreement":null},{"id":"W4402543084","doi":"10.1007/978-3-031-69257-4_16","title":"Machine Learning-Based Per-Instance Algorithm Selection for High-Performance Subgraph Isomorphism Enumeration","year":2024,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Tezpur University; Queen's University; Queen's University Belfast","keywords":"Enumeration; Isomorphism (crystallography); Selection (genetic algorithm); Computer science; Subgraph isomorphism problem; Induced subgraph isomorphism problem; Algorithm; Combinatorics; Artificial intelligence; Mathematics; Theoretical computer science; Chemistry; Crystallography; Graph","score_opus":0.015979033309971885,"score_gpt":0.24467727779749898,"score_spread":0.2286982444875271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402543084","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.00006918609,0.0006934289,0.9879916,0.00078162627,0.0006308887,0.0005842278,0.00004076591,0.00025330245,0.0089549795],"genre_scores_gemma":[0.22497092,0.0039789276,0.7637513,0.001365022,0.0001578128,0.00027307635,0.00052963936,0.000043516033,0.004929762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981085,0.000037374954,0.00067959435,0.000437922,0.00043456577,0.00030202026],"domain_scores_gemma":[0.9977632,0.00022163468,0.00032881775,0.0010794124,0.0005129672,0.00009394323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013634497,0.00031164527,0.00027921546,0.0013993393,0.0009989133,0.00084823335,0.0020666963,0.00016270397,0.0000073576493],"category_scores_gemma":[0.000021482752,0.00031442233,0.00007276443,0.0007472148,0.00061077427,0.005564493,0.00061683997,0.00066250126,0.00005577063],"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.0000037514653,0.000015530404,0.000019179515,0.000057112295,0.000007701927,1.395094e-7,0.0005971307,0.0034237893,0.000006310704,0.68679446,0.00003541579,0.3090395],"study_design_scores_gemma":[0.0003214041,0.00017099942,0.00011531758,0.00018262633,0.000009694773,0.000014557931,0.0000042642487,0.90980536,0.00009055292,0.030338222,0.058616318,0.0003307101],"about_ca_topic_score_codex":0.000011532824,"about_ca_topic_score_gemma":0.0000079681895,"teacher_disagreement_score":0.90638155,"about_ca_system_score_codex":0.00015153048,"about_ca_system_score_gemma":0.0002692006,"threshold_uncertainty_score":0.9999308},"labels":[],"label_agreement":null},{"id":"W4402812188","doi":"10.1007/978-3-031-64373-6_3","title":"Graph Compression","year":2024,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on learning, networks, and algorithms","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; University of Guelph; Brock University; St. Francis Xavier University","funders":"","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.008398028061198258,"score_gpt":0.2090252396085913,"score_spread":0.20062721154739302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402812188","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026249296,0.040527396,0.34873915,0.0011989644,0.005114452,0.0008303369,0.000035904814,0.002324951,0.6012026],"genre_scores_gemma":[0.037634782,0.014895717,0.007842256,0.0015564392,0.005081467,0.0001574321,0.000091266484,0.00061659416,0.932124],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962601,0.00018958266,0.00053199584,0.0016327397,0.0006467498,0.00073883263],"domain_scores_gemma":[0.9973685,0.0009965313,0.00034787084,0.00087530934,0.000079758465,0.0003320197],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006505127,0.0010124333,0.0009377199,0.000619066,0.0006751324,0.0006966525,0.00112074,0.0008115131,0.00024580903],"category_scores_gemma":[0.000067897716,0.0008197514,0.00051916053,0.00020046049,0.00032520213,0.00018678837,0.0004728045,0.002443295,0.00020747441],"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.000030632353,0.000036307323,0.0000030409237,0.00010254836,0.00033900418,0.00024459552,0.0002884647,0.008286801,0.0000065136774,0.38586706,0.0053704237,0.5994246],"study_design_scores_gemma":[0.00023770597,0.00043196886,0.00002827669,0.0021472292,0.00019748253,0.0001271674,0.00001808016,0.105530806,0.0001113513,0.3274367,0.56208915,0.0016440803],"about_ca_topic_score_codex":0.0000056999484,"about_ca_topic_score_gemma":0.0000026713435,"teacher_disagreement_score":0.5977805,"about_ca_system_score_codex":0.0000434548,"about_ca_system_score_gemma":0.00004389183,"threshold_uncertainty_score":0.9998581},"labels":[],"label_agreement":null},{"id":"W4403166107","doi":"10.61091/um120-06","title":"Using Schur Rings to Produce GRRs for Dihedral Groups","year":2024,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dihedral angle; Mathematics; Dihedral group; Pure mathematics; Group (periodic table); Chemistry; Organic chemistry","score_opus":0.050954123238017617,"score_gpt":0.3216894948108748,"score_spread":0.27073537157285715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403166107","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.07273318,0.00022744318,0.92323714,0.0009841623,0.0005773359,0.0006166411,0.000010417263,0.0004349083,0.0011787561],"genre_scores_gemma":[0.5747568,6.568704e-7,0.4244687,0.00014626708,0.0001150869,0.000076567616,0.0000010120593,0.000021249642,0.00041366473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860483,0.000032590946,0.00025701724,0.0005182912,0.00020857423,0.00037869497],"domain_scores_gemma":[0.99894124,0.00025499452,0.000027116024,0.00059675094,0.00005192233,0.00012799687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075542566,0.00016988115,0.00019549092,0.00016439197,0.0001532478,0.00030818532,0.000663357,0.00004161508,0.000027204289],"category_scores_gemma":[0.00018494202,0.0001411829,0.00013296894,0.0005289206,0.00004569046,0.0004520358,0.00022799826,0.000095124786,0.00017791391],"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.000004130707,0.000054419736,0.0000028784539,0.00045164395,0.000027092598,0.000009567838,0.0031537332,0.000016078127,0.0017070889,0.9849406,0.0005974732,0.009035289],"study_design_scores_gemma":[0.00009427365,0.00009190836,0.00002922658,0.00028038118,0.000026859621,0.000046552846,0.00012250092,0.22409709,0.003729892,0.76818466,0.003056605,0.00024003893],"about_ca_topic_score_codex":0.0000014663873,"about_ca_topic_score_gemma":3.0804105e-7,"teacher_disagreement_score":0.50202364,"about_ca_system_score_codex":0.00003060692,"about_ca_system_score_gemma":0.000043034936,"threshold_uncertainty_score":0.57572716},"labels":[],"label_agreement":null},{"id":"W4403305626","doi":"10.1017/9781009302180.025","title":"Graph Search Algorithms","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Graph Theory 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":"York University","funders":"","keywords":"Computer science; Algorithm","score_opus":0.022565901562522285,"score_gpt":0.20735609275949288,"score_spread":0.1847901911969706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403305626","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000087738645,0.0004436923,0.059106372,0.000047373203,0.0009383625,0.00029295118,0.00017124227,0.0006141449,0.9383771],"genre_scores_gemma":[0.00021759955,0.00011269394,0.0018070468,0.000070030066,0.00017963558,7.245221e-7,0.000020584726,0.0000500927,0.9975416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99775857,0.000049479768,0.00020222978,0.0010281504,0.00048933923,0.00047225042],"domain_scores_gemma":[0.9982087,0.00008517881,0.00009251316,0.0011600726,0.00016349663,0.00029004566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002448168,0.0004862586,0.00041107152,0.00056347536,0.00027183993,0.0002524827,0.002188889,0.00039392986,0.0000049512237],"category_scores_gemma":[0.0000022848383,0.00054070394,0.0004600188,0.000042924836,0.0003367456,0.00023736722,0.0015207989,0.00095997925,0.00017668735],"study_design_candidate":"not_applicable","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.000009418304,0.0000075174253,9.22339e-8,0.00007786744,0.00016880562,0.0014955713,0.00009027018,0.0000045059232,0.000013987658,0.9826518,0.00801378,0.007466326],"study_design_scores_gemma":[0.00030564566,0.00008645387,0.0000016835882,0.0002377444,0.000121870115,0.00008280059,0.000020467027,0.0023341111,0.00041171542,0.0045777927,0.99106365,0.0007560345],"about_ca_topic_score_codex":0.00003779485,"about_ca_topic_score_gemma":3.8877351e-7,"teacher_disagreement_score":0.9830499,"about_ca_system_score_codex":0.00011169827,"about_ca_system_score_gemma":0.00012603865,"threshold_uncertainty_score":0.9997044},"labels":[],"label_agreement":null},{"id":"W4403334264","doi":"10.1145/3656019.3676897","title":"ACE: Efficient GPU Kernel Concurrency for Input-Dependent Irregular Computational Graphs","year":2024,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","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 Toronto","funders":"","keywords":"Computer science; Parallel computing; Kernel (algebra); Concurrency; Distributed computing; Mathematics; Discrete mathematics","score_opus":0.012771846244660389,"score_gpt":0.26123575363179663,"score_spread":0.24846390738713625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403334264","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.010984944,0.000624482,0.9837754,0.0009081448,0.0019083975,0.00031971378,0.000026125312,0.00048131018,0.0009714798],"genre_scores_gemma":[0.9514663,0.0000049310834,0.047151368,0.00028226222,0.000073233285,0.000056860095,0.00001519121,0.000012996145,0.0009368235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985143,0.000049528633,0.00024672443,0.0005325601,0.00034544268,0.00031142036],"domain_scores_gemma":[0.9991876,0.00027388337,0.000033443033,0.00028800106,0.00010251599,0.00011456407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049244834,0.00017058296,0.00014457885,0.00019752792,0.00016672502,0.0003351564,0.00063594815,0.00005542514,0.00005335095],"category_scores_gemma":[0.00001656618,0.00014118846,0.00018041454,0.00048498274,0.000076078366,0.00020996673,0.00016800158,0.00012171537,0.00011577703],"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.0000029806108,0.00005758342,0.00001189828,0.000038850936,0.000033455453,0.000018727624,0.00035604052,0.008739483,0.000097849064,0.9608843,0.0016222845,0.028136604],"study_design_scores_gemma":[0.00027508617,0.00006973629,0.00014464057,0.00002789555,0.000008541947,0.00003773955,0.000021725142,0.6789748,0.0005387281,0.31663403,0.0030835762,0.00018349323],"about_ca_topic_score_codex":0.0000022388394,"about_ca_topic_score_gemma":6.125223e-7,"teacher_disagreement_score":0.94048136,"about_ca_system_score_codex":0.000024393628,"about_ca_system_score_gemma":0.000086498294,"threshold_uncertainty_score":0.5757498},"labels":[],"label_agreement":null},{"id":"W4403486988","doi":"10.3233/faia240856","title":"Deep Generative Models for Subgraph Prediction","year":2024,"lang":"en","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Graph Theory 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":"Simon Fraser University","funders":"","keywords":"Generative grammar; Computer science; Artificial intelligence","score_opus":0.036584290503879756,"score_gpt":0.25833616689443256,"score_spread":0.2217518763905528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403486988","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":[7.624717e-7,0.0028629755,0.9712756,0.0002648002,0.0006426381,0.00091417826,0.00009168868,0.00010823836,0.023839077],"genre_scores_gemma":[0.016805736,0.008951598,0.7934469,0.00078030507,0.0029084012,0.006880903,0.00054357765,0.00023545123,0.16944711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985931,0.000009163573,0.0004039933,0.00066133967,0.00012649031,0.00020594425],"domain_scores_gemma":[0.99932706,0.000054393156,0.000088574714,0.00037129733,0.00008232979,0.00007633168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020660636,0.00023185478,0.00023846327,0.00037385267,0.00019589676,0.00017395034,0.0004288269,0.00021152875,0.0000054223624],"category_scores_gemma":[0.0000033700537,0.00023647967,0.00012279495,0.00017865244,0.00018412006,0.00023934497,0.00008644948,0.00025948122,0.000022252056],"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.0000037598452,0.000014714806,6.1980995e-7,0.000019836178,0.000024005654,8.8760265e-7,0.00030126068,0.0022265846,0.0000054430266,0.79744506,0.00033879682,0.19961901],"study_design_scores_gemma":[0.000007105609,0.000024640223,1.4203512e-7,0.00002866276,0.00001724326,0.0000013976942,0.000064842774,0.38376155,0.00017131784,0.6024313,0.013359458,0.00013235859],"about_ca_topic_score_codex":0.0000023389525,"about_ca_topic_score_gemma":0.000014048283,"teacher_disagreement_score":0.38153496,"about_ca_system_score_codex":0.000038342605,"about_ca_system_score_gemma":0.000036579964,"threshold_uncertainty_score":0.9643361},"labels":[],"label_agreement":null},{"id":"W4403690984","doi":"10.1561/1900000090","title":"Modern Techniques For Querying Graph-structured Databases","year":2024,"lang":"en","type":"article","venue":"Foundations and Trends in Databases","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"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; Polytechnique Montréal","funders":"","keywords":"Computer science; Graph database; Database; Graph; Information retrieval; Theoretical computer science","score_opus":0.048239545733152527,"score_gpt":0.3378664988143314,"score_spread":0.28962695308117886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403690984","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.0028032577,0.0010455664,0.9935753,0.00037572026,0.00034067375,0.00011574641,0.0009845766,0.00034518092,0.00041402577],"genre_scores_gemma":[0.68182904,0.00015485732,0.31602773,0.00009023972,0.00010100205,0.000108519394,0.0014446161,0.000015853506,0.00022814162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990159,0.000035234872,0.00019378542,0.0004544131,0.000096833064,0.00020383445],"domain_scores_gemma":[0.9991927,0.00025736808,0.000028331624,0.00044858115,0.000025453715,0.000047573852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024368602,0.00013935001,0.00012659981,0.0006798436,0.00021440301,0.0002847138,0.0002711468,0.000020174433,0.000028458384],"category_scores_gemma":[0.00004169689,0.00012249107,0.00005435057,0.00078310387,0.00008366096,0.0014120158,0.0001851693,0.000098443474,0.0000017488651],"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.0000029000003,0.000024337009,0.00011635892,0.000030991832,0.0000134751945,0.000008800073,0.00012504769,0.0000065985587,0.00020397885,0.5055751,0.00064741564,0.49324498],"study_design_scores_gemma":[0.00067733467,0.00015586542,0.0023002746,0.00060485484,0.00007987611,0.00015533937,0.00013997727,0.2256027,0.008485324,0.49968982,0.2610691,0.0010395618],"about_ca_topic_score_codex":0.00006825172,"about_ca_topic_score_gemma":0.00024445617,"teacher_disagreement_score":0.67902577,"about_ca_system_score_codex":0.0000124111675,"about_ca_system_score_gemma":0.000025795141,"threshold_uncertainty_score":0.4995041},"labels":[],"label_agreement":null},{"id":"W4403937384","doi":"10.1109/iscc61673.2024.10733726","title":"Performance Evaluation of Kubernetes Networking Approaches across Constraint Edge Environments","year":2024,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"CODE","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Constraint (computer-aided design); Computer network; Distributed computing; Telecommunications; Engineering","score_opus":0.07088356353589806,"score_gpt":0.2718149464877129,"score_spread":0.20093138295181487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403937384","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.74738353,0.0012926101,0.22889513,0.00008016205,0.0009176257,0.00024017676,0.0000024317474,0.0001242431,0.021064086],"genre_scores_gemma":[0.99548423,0.00001883111,0.0042310976,0.000017023234,0.00006285038,0.000012989133,0.0000020978682,0.000003943853,0.00016693718],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990624,0.00006840363,0.00015012188,0.00023613384,0.00030737312,0.00017551894],"domain_scores_gemma":[0.99965227,0.00005958491,0.000030100067,0.0002174334,0.000010929885,0.000029705587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014661279,0.000080405116,0.000078206656,0.000032513504,0.00006443707,0.00008296418,0.00029182504,0.000032195123,0.000030373167],"category_scores_gemma":[0.000004860427,0.00006522594,0.000045282657,0.0001911164,0.00010775639,0.00033093872,0.00011976765,0.0000703152,0.000033795128],"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.0000012952522,0.000025512973,0.0007346383,0.00002056679,0.000028118764,8.5314537e-7,0.0013148198,0.004186197,0.00026833106,0.049982306,0.000022940705,0.94341445],"study_design_scores_gemma":[0.00009747386,0.000028246677,0.0025134592,0.000040890853,0.000009094137,0.000006263701,0.0000858584,0.9867637,0.0042975796,0.005541636,0.00053041225,0.00008537771],"about_ca_topic_score_codex":0.0000011769112,"about_ca_topic_score_gemma":3.716294e-7,"teacher_disagreement_score":0.9825775,"about_ca_system_score_codex":0.00002005942,"about_ca_system_score_gemma":0.000025148687,"threshold_uncertainty_score":0.26598367},"labels":[],"label_agreement":null},{"id":"W4404751902","doi":"","title":"Dynamique naturelle et aménagement durable de la forêt boréale : apports des modèles basés sur les Transformations de Graphes pour caractériser les trajectoires et fournir des recommandations","year":2023,"lang":"en","type":"dissertation","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Transformation (genetics); Taiga; Boreal; Geography; Graph; Sustainable forest management; Environmental resource management; Forest management; Environmental science; Computer science; Forestry; Theoretical computer science; Biology","score_opus":0.015127228040514236,"score_gpt":0.24213536899459207,"score_spread":0.22700814095407784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404751902","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.2158111,0.0013678309,0.73380387,0.0027177313,0.0001907977,0.00060247036,0.0001323471,0.0007486523,0.044625174],"genre_scores_gemma":[0.84962785,0.0058991523,0.12478114,0.000091929316,0.000015384847,0.00036925398,0.0018940158,0.00010396549,0.017217334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99093527,0.006733719,0.00064368325,0.00066723244,0.00041333106,0.00060678466],"domain_scores_gemma":[0.99381095,0.0032212373,0.0004520792,0.001030766,0.0012582217,0.00022676546],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.008361038,0.00048694605,0.00041137106,0.00059591356,0.0016185226,0.0009660606,0.0014857828,0.00041165407,0.000078207915],"category_scores_gemma":[0.0010133976,0.00049945334,0.0003908574,0.0010581877,0.0002865072,0.00096889434,0.0001693884,0.00086541014,0.00001548875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046944733,0.0016727082,0.0034374718,0.0011687478,0.0004593218,0.00003993982,0.084630325,0.0020392865,0.006224372,0.6900535,0.0036437286,0.20658363],"study_design_scores_gemma":[0.0020936592,0.000009303612,0.15431996,0.0077128694,0.00035849388,0.00013037589,0.01202019,0.17573304,0.07341272,0.556096,0.015518069,0.002595327],"about_ca_topic_score_codex":0.0025898295,"about_ca_topic_score_gemma":0.038079727,"teacher_disagreement_score":0.6338167,"about_ca_system_score_codex":0.00016073111,"about_ca_system_score_gemma":0.00062166457,"threshold_uncertainty_score":0.9997457},"labels":[],"label_agreement":null},{"id":"W4405006607","doi":"10.1007/s00778-024-00883-8","title":"A graph pattern mining framework for large graphs on GPU","year":2024,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Graph; CUDA; Theoretical computer science; Data science; Data mining; Parallel computing","score_opus":0.0195451147952551,"score_gpt":0.27693911823719536,"score_spread":0.25739400344194024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405006607","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.03222211,0.0009919321,0.96011466,0.0037009541,0.002545526,0.00009922255,0.000008638523,0.000116759176,0.000200223],"genre_scores_gemma":[0.97663087,0.000081404265,0.020623937,0.0019019361,0.00059554784,0.000015221598,6.2788166e-7,0.000019908115,0.00013052707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988235,0.000119826334,0.00019736042,0.00021722852,0.0002488949,0.00039316042],"domain_scores_gemma":[0.99886835,0.00059288717,0.000064662294,0.0003358872,0.000038413647,0.000099779834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013809261,0.00013805986,0.00012063237,0.0002136311,0.0005517372,0.000665287,0.0009939418,0.00005815097,0.00003425303],"category_scores_gemma":[0.00004665792,0.00008212563,0.0002674016,0.0005085769,0.00003430827,0.00024806065,0.00008652165,0.00053585076,0.00004040342],"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.000010558651,0.00004061267,0.00007893422,0.000014706493,0.00007711641,0.00007731303,0.0029312766,0.000032932996,0.00004480335,0.8725808,0.0023687347,0.12174217],"study_design_scores_gemma":[0.0001909285,0.00020348391,0.00023666763,0.00031660352,0.000017237971,0.00030376777,0.0001738462,0.013650687,0.00025403296,0.9774175,0.0070886915,0.00014650596],"about_ca_topic_score_codex":5.004271e-7,"about_ca_topic_score_gemma":6.552924e-7,"teacher_disagreement_score":0.9444088,"about_ca_system_score_codex":0.000011193804,"about_ca_system_score_gemma":0.000032956148,"threshold_uncertainty_score":0.6415378},"labels":[],"label_agreement":null},{"id":"W4406141864","doi":"10.1137/1.9781611978322.50","title":"Eulerian Graph Sparsification by Effective Resistance Decomposition","year":2025,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Eulerian path; Decomposition; Graph; Resistance (ecology); Computer science; Mathematics; Chemistry; Theoretical computer science; Biology; Pure mathematics; Ecology; Lagrangian; Organic chemistry","score_opus":0.019786593117780728,"score_gpt":0.2323271620927924,"score_spread":0.21254056897501167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406141864","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000070070826,0.00021983647,0.5625627,0.00019453773,0.00044592054,0.003237592,0.00031301536,0.00024216979,0.43271416],"genre_scores_gemma":[0.0033204174,0.00013414699,0.34812474,0.00072497583,0.0010720855,0.0017326596,0.00053392805,0.00016646148,0.64419055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985504,0.000009037905,0.00040952858,0.00056748843,0.00021404286,0.0002494812],"domain_scores_gemma":[0.9986557,0.0003777101,0.00037996544,0.00042757537,0.00007117021,0.00008790186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048691433,0.00038060482,0.00047502486,0.0000618362,0.00041503986,0.00018358241,0.00043595542,0.00063052226,0.000002903559],"category_scores_gemma":[0.000008984136,0.00037045137,0.00040364018,0.00004293525,0.00017798886,0.000053771328,0.00013380076,0.0003960102,0.0000031317345],"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.000019733801,0.000021606493,1.4444811e-8,0.0001910773,0.00016943316,1.7246995e-7,0.00053480675,4.1181582e-7,0.0005894405,0.9567965,0.014332807,0.027343953],"study_design_scores_gemma":[0.0009662465,0.000053107706,7.358523e-8,0.00033541129,0.00014596879,0.0000011777462,0.0000561445,0.0002427422,0.0031791588,0.94426113,0.050350737,0.00040812802],"about_ca_topic_score_codex":4.3062573e-7,"about_ca_topic_score_gemma":6.9621535e-7,"teacher_disagreement_score":0.21443793,"about_ca_system_score_codex":0.00005237356,"about_ca_system_score_gemma":0.000059954284,"threshold_uncertainty_score":0.9998748},"labels":[],"label_agreement":null},{"id":"W4406379941","doi":"10.1145/3712311.3712323","title":"A Roadmap to Graph Analytics","year":2025,"lang":"en","type":"article","venue":"ACM SIGMOD Record","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"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":"Computer science; Analytics; Data science; Graph; Data analysis; Product (mathematics); Task (project management); Data mining; Theoretical computer science; Engineering; Systems engineering","score_opus":0.013973507860048258,"score_gpt":0.2632285770793657,"score_spread":0.24925506921931745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406379941","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.037514005,0.0000815477,0.94807845,0.0044629984,0.0014295215,0.00016825633,0.0000018436943,0.00023600746,0.008027376],"genre_scores_gemma":[0.78321505,0.000024389052,0.2045303,0.004921357,0.000107894055,0.00003803755,0.0000018044547,0.000011951424,0.0071492125],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896216,0.000057372148,0.00018505781,0.00038566094,0.00013153184,0.00027820325],"domain_scores_gemma":[0.9984187,0.0001642341,0.00003548166,0.0012114446,0.00006256126,0.00010761182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027082028,0.00012628632,0.00016167581,0.0003322798,0.00012528863,0.000113952476,0.0018229553,0.000054173317,0.00001962983],"category_scores_gemma":[0.00019187182,0.00011510429,0.000108337925,0.0015533852,0.000027113207,0.00018932307,0.0005960827,0.00012385126,0.00010856379],"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.000014152337,0.00006241657,0.0024493793,0.000013570123,0.00006642558,0.000024457613,0.0003517678,0.00010051806,0.0005883497,0.37725058,0.0122859515,0.6067924],"study_design_scores_gemma":[0.00032136487,0.00016096477,0.0024879123,0.000054508637,0.000017753104,0.0000046974883,0.00004338375,0.00845452,0.0034499643,0.93805903,0.046623006,0.0003228948],"about_ca_topic_score_codex":0.000021092557,"about_ca_topic_score_gemma":0.000017346341,"teacher_disagreement_score":0.7457011,"about_ca_system_score_codex":0.000017202432,"about_ca_system_score_gemma":0.000046234236,"threshold_uncertainty_score":0.4693817},"labels":[],"label_agreement":null},{"id":"W4407385487","doi":"10.14778/3696435.3696437","title":"CUTTANA: Scalable Graph Partitioning for Faster Distributed Graph Databases and Analytics","year":2024,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","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 British Columbia","funders":"","keywords":"Computer science; Scalability; Graph database; Analytics; Graph; Database; Theoretical computer science","score_opus":0.022006714325906684,"score_gpt":0.24875675482104148,"score_spread":0.2267500404951348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407385487","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.23346858,0.0034687587,0.7514938,0.005956783,0.0015699033,0.001621721,0.0005780212,0.0005092982,0.0013331571],"genre_scores_gemma":[0.9867967,0.000086303226,0.0126882605,0.0001099052,0.000052469528,0.00007626887,0.000008692672,0.000010730952,0.00017071767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989793,0.0000057648417,0.00022249918,0.00033359925,0.00020599725,0.00025289218],"domain_scores_gemma":[0.999514,0.00008598014,0.000081092,0.00014559904,0.00010781575,0.00006553359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037968322,0.00013620198,0.0001502821,0.00012158079,0.0001976088,0.00025017458,0.00044972566,0.000023555676,0.0000039284196],"category_scores_gemma":[0.000046128232,0.000093402625,0.000120805606,0.0006618086,0.00011167539,0.00055202504,0.0002980125,0.00009008918,0.0000013836391],"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.00001591384,0.00009123946,0.002759791,0.0004497018,0.00017136472,0.0000014256668,0.00052690547,0.00006551714,0.007907005,0.97871137,0.0045244936,0.0047752643],"study_design_scores_gemma":[0.000991823,0.0002997435,0.0022719472,0.0010653423,0.00028972028,0.00006670174,0.00068320544,0.08050269,0.2104904,0.68347436,0.019252237,0.00061182625],"about_ca_topic_score_codex":0.0000066186844,"about_ca_topic_score_gemma":0.0000012458477,"teacher_disagreement_score":0.7533281,"about_ca_system_score_codex":0.000016631106,"about_ca_system_score_gemma":0.000015535672,"threshold_uncertainty_score":0.38088483},"labels":[],"label_agreement":null},{"id":"W4408061173","doi":"10.14778/3705829.3705846","title":"Can Graph Reordering Speed Up Graph Neural Network Training? An Experimental Study","year":2024,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","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 Toronto","funders":"","keywords":"Computer science; Graph; Artificial neural network; Artificial intelligence; Machine learning; Theoretical computer science","score_opus":0.02788617619331354,"score_gpt":0.26391288883681896,"score_spread":0.23602671264350542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408061173","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.9945008,0.00051019195,0.00021376491,0.00049773185,0.0022223657,0.00069019926,0.0000029425019,0.0003382815,0.001023723],"genre_scores_gemma":[0.9980528,0.00000615505,0.0014150823,0.00012555033,0.00019882848,0.000051787567,5.428399e-7,0.000023899938,0.00012538533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980147,0.000031019823,0.00035774623,0.0006041093,0.00049549027,0.0004969486],"domain_scores_gemma":[0.99936265,0.000034514473,0.000119200435,0.00028354762,0.00006409998,0.0001359872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071342685,0.00027354396,0.000259053,0.00016725266,0.0003008803,0.00037812252,0.0015279013,0.000040268762,0.000010383657],"category_scores_gemma":[0.000012334849,0.00019755935,0.00020595694,0.0011101541,0.00011474797,0.0005906217,0.00051656796,0.00025405711,0.0000019464728],"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.00014451379,0.0022438825,0.007742835,0.00022564674,0.0006935132,0.00005228962,0.19805673,0.0022228302,0.11564227,0.63611364,0.0018634488,0.034998417],"study_design_scores_gemma":[0.0046000904,0.007610138,0.0076756016,0.0009880454,0.00031867574,0.00042127486,0.07302833,0.091095395,0.32743967,0.48283863,0.001250076,0.002734088],"about_ca_topic_score_codex":0.000042230306,"about_ca_topic_score_gemma":0.0000049804294,"teacher_disagreement_score":0.21179739,"about_ca_system_score_codex":0.000039109287,"about_ca_system_score_gemma":0.00002723545,"threshold_uncertainty_score":0.80562365},"labels":[],"label_agreement":null},{"id":"W4408092675","doi":"10.1109/hipcw63042.2024.00049","title":"Accelerated Multilevel Graph Partitioning on GPUs","year":2024,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Parallel computing; Graph; Graph partition; Theoretical computer science","score_opus":0.034559562462732035,"score_gpt":0.2733290310598424,"score_spread":0.23876946859711037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408092675","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.030022928,0.00010869611,0.94670546,0.00075602054,0.0011985821,0.00008103427,0.0000025268985,0.001095936,0.02002881],"genre_scores_gemma":[0.98862827,0.0000050219696,0.009219522,0.0004887745,0.000047882866,0.0000114521445,0.0000019275417,0.000005493215,0.0015916418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930865,0.00003239999,0.00009816699,0.00027232987,0.000116805626,0.00017162302],"domain_scores_gemma":[0.99961114,0.000084566804,0.000009227526,0.00021708108,0.000022435537,0.000055569064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015751264,0.00008339884,0.000059611735,0.00012643474,0.000109655295,0.0003611868,0.00029616538,0.00002947062,0.00012783399],"category_scores_gemma":[0.00000895993,0.00006435848,0.00005524307,0.00044250843,0.000021690714,0.0003639966,0.000052694995,0.000109123146,0.0004984544],"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.0000012783245,0.0000251007,0.000014560342,0.000005479377,0.000012366226,0.000042632415,0.00022685765,0.000167329,0.00054965203,0.92620605,0.0012163427,0.07153235],"study_design_scores_gemma":[0.00023692036,0.00014020652,0.0014515206,0.00011493737,0.0000054962525,0.000027274627,0.000034483975,0.58210194,0.041245464,0.36662054,0.007677021,0.00034418833],"about_ca_topic_score_codex":0.0000054458046,"about_ca_topic_score_gemma":7.894095e-7,"teacher_disagreement_score":0.95860535,"about_ca_system_score_codex":0.000007517887,"about_ca_system_score_gemma":0.000016838263,"threshold_uncertainty_score":0.6406789},"labels":[],"label_agreement":null},{"id":"W4408100839","doi":"10.1109/hipcw63042.2024.00041","title":"Evaluating the Influence of Graph Characteristics on Parallel Algorithms for Derived Graph Structures","year":2024,"lang":"en","type":"article","venue":"","topic":"Graph Theory 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":"University of British Columbia","funders":"","keywords":"Computer science; Graph; Graph algorithms; Theoretical computer science; Algorithm","score_opus":0.04473797983110414,"score_gpt":0.33235041119064596,"score_spread":0.28761243135954184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408100839","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.45671713,0.00015563144,0.54175645,0.0003582589,0.00045429508,0.00032408015,0.000019031904,0.00014513648,0.000070012786],"genre_scores_gemma":[0.9090867,0.000020955604,0.09031743,0.00033696907,0.00006995445,0.000060580365,0.000004274802,0.000011643342,0.00009150298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986005,0.00010205852,0.0003187326,0.00039206038,0.0003171766,0.0002695081],"domain_scores_gemma":[0.9985148,0.0006874576,0.00009271019,0.00051890826,0.00013206253,0.000054114942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073439255,0.00017991834,0.00018533447,0.00015063149,0.00020632945,0.00019494168,0.0009261485,0.00005625892,0.000010227737],"category_scores_gemma":[0.00011234423,0.00010839334,0.00017468161,0.0005255163,0.00014474255,0.0002497086,0.00011359071,0.00016253493,0.0000055732926],"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.000022761516,0.000025826455,0.00003356193,0.0000714536,0.00007259722,0.000004490001,0.00094059546,0.0053894436,0.009018628,0.88275474,0.0000618842,0.10160402],"study_design_scores_gemma":[0.00028829224,0.00065907056,0.013290894,0.00010214277,0.000032437878,0.000015022288,0.00006950683,0.23982486,0.004493406,0.7407884,0.0001633042,0.00027267082],"about_ca_topic_score_codex":0.0000078339845,"about_ca_topic_score_gemma":8.568941e-7,"teacher_disagreement_score":0.45236957,"about_ca_system_score_codex":0.000007537041,"about_ca_system_score_gemma":0.00005345022,"threshold_uncertainty_score":0.4420152},"labels":[],"label_agreement":null},{"id":"W4408229973","doi":"10.1101/2025.02.28.640915","title":"FASTiso: Fast Algorithm on Search state Tree for subgraph ISOmorphism in graphs of any size and density","year":2025,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Graph Theory 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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Induced subgraph isomorphism problem; Subgraph isomorphism problem; Isomorphism (crystallography); Tree (set theory); Combinatorics; Mathematics; Algorithm; State (computer science); Computer science; Graph; Line graph; Chemistry","score_opus":0.010940720561695644,"score_gpt":0.22068551749114979,"score_spread":0.20974479692945414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408229973","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.738955,0.0005237348,0.25669962,0.00024899645,0.0010649884,0.001360526,0.00089059654,0.0002484955,0.000008027324],"genre_scores_gemma":[0.90023506,0.00028001796,0.09906084,0.00016092237,0.000051035782,0.00015882746,3.1137458e-7,0.00004169503,0.000011278539],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9963174,0.0003038282,0.0006897777,0.0014806904,0.00046114708,0.0007471606],"domain_scores_gemma":[0.9965865,0.00058804353,0.00033125002,0.0017022605,0.0005307621,0.00026116686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014565156,0.00061185093,0.000879207,0.0009373818,0.00017886363,0.00021350365,0.001626686,0.00038914735,0.000002836998],"category_scores_gemma":[0.00022540847,0.00066139793,0.00024646398,0.0014079898,0.0003025256,0.0002383221,0.0013462856,0.0008269509,0.000002728624],"study_design_candidate":"bench_or_experimental","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.0012132949,0.005536849,0.07843552,0.00969296,0.0025127956,0.0011512891,0.0017133831,0.0017788929,0.54514897,0.34115914,0.0007621765,0.010894741],"study_design_scores_gemma":[0.004220406,0.00067375175,0.54740804,0.0022684145,0.00012966566,1.2506041e-7,0.000020168563,0.0512729,0.38623014,0.0050891354,0.00026941637,0.0024178463],"about_ca_topic_score_codex":0.00009988418,"about_ca_topic_score_gemma":0.000011120543,"teacher_disagreement_score":0.46897253,"about_ca_system_score_codex":0.00009092035,"about_ca_system_score_gemma":0.0004570583,"threshold_uncertainty_score":0.9995837},"labels":[],"label_agreement":null},{"id":"W4408330939","doi":"10.1002/jgt.23218","title":"Eigenvalue Approach to Dense Clusters in Hypergraphs","year":2025,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Mathematics; Minimax; Eigenvalues and eigenvectors; Combinatorics; Decomposition; Matrix (chemical analysis); Discrete mathematics; Mathematical optimization","score_opus":0.007853695029531156,"score_gpt":0.23326014608860496,"score_spread":0.2254064510590738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408330939","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.19905156,0.0008765166,0.78762496,0.00052753644,0.0010390512,0.00015466566,9.2173013e-7,0.000030147796,0.010694664],"genre_scores_gemma":[0.9624063,0.00004465488,0.035532147,0.0016934279,0.00004421785,0.0000054886946,1.8064749e-7,0.000008282224,0.0002653151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816847,0.0004978284,0.000522206,0.00023776559,0.00027057625,0.00030316837],"domain_scores_gemma":[0.99887526,0.00026281207,0.00017238477,0.00042150344,0.00012244574,0.00014558533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029906102,0.00016341674,0.00031734118,0.0016419952,0.00009728841,0.000090952766,0.001369283,0.00007601765,0.0000036815288],"category_scores_gemma":[0.00012115698,0.00013316439,0.00027760625,0.002030153,0.000091577676,0.00037619343,0.0001682648,0.00035952128,0.0000057873335],"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.00013945083,0.00024719,0.00096777064,0.000019368419,0.00007841407,0.00005666078,0.0013312991,0.0014976893,0.0005358487,0.9723395,0.0005356831,0.022251137],"study_design_scores_gemma":[0.0009133285,0.00017141669,0.005411326,0.00014237463,0.000024135785,0.00014961365,0.0006516919,0.0011081175,0.00086478604,0.9895174,0.00082588056,0.00021994582],"about_ca_topic_score_codex":0.0000017752,"about_ca_topic_score_gemma":0.0000011653404,"teacher_disagreement_score":0.7633547,"about_ca_system_score_codex":0.000034013294,"about_ca_system_score_gemma":0.00009407383,"threshold_uncertainty_score":0.5430286},"labels":[],"label_agreement":null},{"id":"W4408447369","doi":"10.1103/physrevapplied.23.034031","title":"Parallel tempering–inspired distributed binary optimization with in-memory computing","year":2025,"lang":"en","type":"article","venue":"Physical Review Applied","topic":"Graph Theory and Algorithms","field":"Computer Science","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":"Saskatchewan Health Quality Council","funders":"Defense Advanced Research Projects Agency","keywords":"Computer science; Parallel computing; Binary number; Distributed computing; Mathematics; Arithmetic","score_opus":0.008125922655047454,"score_gpt":0.25451711806725,"score_spread":0.24639119541220256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408447369","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.009618799,0.001965588,0.98424566,0.0005150253,0.00005411993,0.00057064457,0.0000019538213,0.00018610402,0.0028421208],"genre_scores_gemma":[0.96791315,0.00034674836,0.030618515,0.0009670048,0.000031976953,0.0000775414,0.000023149598,0.000008559028,0.000013355323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892,0.000060614693,0.00023356166,0.00039320072,0.00015383855,0.00023877155],"domain_scores_gemma":[0.9993077,0.00010980512,0.00008430559,0.00041211396,0.00003255481,0.000053509408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021210402,0.00017092882,0.00037140836,0.000058529113,0.00010933923,0.000046401794,0.00050787657,0.000021162457,0.0000026514547],"category_scores_gemma":[0.000017410639,0.00013473941,0.00006349092,0.0012324738,0.000054988046,0.00012583075,0.00019404196,0.0001603288,0.000014012462],"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.00004279178,0.00070928223,0.00012364493,0.0016323861,0.000056045097,0.000029275008,0.00027347705,0.17498781,0.00071610115,0.67596346,0.00022321453,0.14524253],"study_design_scores_gemma":[0.0013484681,0.000092761795,0.0024010763,0.0030440881,0.00004737168,0.0000032982327,0.000026196112,0.9704636,0.0006063205,0.020625254,0.0007931588,0.00054841774],"about_ca_topic_score_codex":0.0000022697732,"about_ca_topic_score_gemma":3.0135223e-7,"teacher_disagreement_score":0.95829433,"about_ca_system_score_codex":0.000029355466,"about_ca_system_score_gemma":0.000041468866,"threshold_uncertainty_score":0.54945135},"labels":[],"label_agreement":null},{"id":"W4408860469","doi":"10.1109/tit.2025.3555187","title":"Efficient Algorithms for Attributed Graph Alignment With Vanishing Edge Correlation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Algorithm; Computer science; Correlation; Enhanced Data Rates for GSM Evolution; Graph theory; Combinatorics; Mathematics; Artificial intelligence; Geometry","score_opus":0.009118280732590495,"score_gpt":0.22680165236590327,"score_spread":0.21768337163331278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408860469","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.0009142879,0.000012520564,0.99511445,0.00021561164,0.0013285212,0.0006748358,0.000053371543,0.00030553908,0.0013808717],"genre_scores_gemma":[0.963518,0.000005541963,0.034854744,0.00090939057,0.000014439526,0.00031081386,0.000024561376,0.000008950065,0.0003535567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878716,0.00010637888,0.00038224558,0.00020558994,0.000255884,0.00026275197],"domain_scores_gemma":[0.99883026,0.00037269027,0.00014073403,0.00039485993,0.00019369509,0.00006778305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009039913,0.00018867345,0.00015841077,0.00049321254,0.0006004918,0.00020852943,0.00038561886,0.00009130117,0.000014384408],"category_scores_gemma":[0.000010228755,0.00016225677,0.00012504937,0.00083129,0.00006857171,0.00093677983,0.0000032581206,0.00018061884,0.000039622857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015196763,0.00013107444,0.0000013340896,0.0000361406,0.0000908731,4.7203642e-7,0.001493997,0.44984147,0.000037542275,0.38361824,0.000100770296,0.16449612],"study_design_scores_gemma":[0.0025019567,0.00035798812,0.00006975425,0.00014822316,0.00008138167,0.000015944826,0.0007582858,0.9006392,0.018192975,0.07485756,0.0019680855,0.00040866667],"about_ca_topic_score_codex":0.0000025128782,"about_ca_topic_score_gemma":7.8456543e-7,"teacher_disagreement_score":0.9626037,"about_ca_system_score_codex":0.000091069654,"about_ca_system_score_gemma":0.00007553984,"threshold_uncertainty_score":0.6616639},"labels":[],"label_agreement":null},{"id":"W4409048322","doi":"10.1109/tai.2025.3556375","title":"TSTNet: Temporal Semantic Transformer-Based Computing Power Network for Automatic Driving in the Internet of Vehicles","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Artificial Intelligence","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Transformer; The Internet; Power network; Computer network; Real-time computing; World Wide Web; Electrical engineering; Power (physics); Engineering; Electric power system","score_opus":0.026363905753761765,"score_gpt":0.2882913611853399,"score_spread":0.26192745543157814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409048322","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.076059304,0.000024145002,0.9219422,0.0006260157,0.00073239784,0.0004512205,0.0000032342177,0.00007792483,0.000083571664],"genre_scores_gemma":[0.983147,0.0000017350408,0.016465992,0.00030671494,0.000015586998,0.00003588898,7.489818e-7,0.0000075309053,0.000018749377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984014,0.00017594303,0.0005958322,0.0003123428,0.00018855595,0.0003259285],"domain_scores_gemma":[0.9984659,0.000990904,0.00009622969,0.0003543203,0.00006133231,0.000031318683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009811971,0.0001697518,0.00023052368,0.00025264345,0.00020190497,0.00010087733,0.00084412156,0.00007120504,0.000013677113],"category_scores_gemma":[0.000012911266,0.00013925882,0.0001915846,0.0010929789,0.00013889236,0.00015442513,0.0000020012767,0.00024809557,0.000007045899],"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.00006278363,0.0006741213,0.000105362895,0.000114930604,0.000052286297,0.000007223276,0.004514793,0.31857163,0.0009859084,0.08219418,0.00004269367,0.5926741],"study_design_scores_gemma":[0.00006095641,0.0001732838,0.00012460235,0.0002933367,0.000015078608,0.000001836356,0.00032208854,0.8899426,0.072285384,0.036621284,0.000029258541,0.00013032937],"about_ca_topic_score_codex":0.00005553408,"about_ca_topic_score_gemma":0.00023100415,"teacher_disagreement_score":0.90708774,"about_ca_system_score_codex":0.00002586311,"about_ca_system_score_gemma":0.00007213508,"threshold_uncertainty_score":0.5678809},"labels":[],"label_agreement":null},{"id":"W4409748157","doi":"10.1214/25-aap2146","title":"Average-case and smoothed analysis of graph isomorphism","year":2025,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Graph Theory 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":"Science North","funders":"","keywords":"Isomorphism (crystallography); Graph isomorphism; Graph; Mathematics; Combinatorics; Computer science; Chemistry; Crystallography; Line graph","score_opus":0.037252546361507516,"score_gpt":0.2841761287804059,"score_spread":0.24692358241889836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409748157","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.9051888,0.00015885882,0.0898414,0.0012433777,0.000037552498,0.00034818207,0.00001800737,0.000039679137,0.003124119],"genre_scores_gemma":[0.99635416,0.0000200844,0.003240715,0.0003404581,0.0000033552333,0.000017774966,0.000001078139,0.000002084453,0.000020312626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892116,0.00011606242,0.0003494413,0.00031291702,0.00013869436,0.00016172846],"domain_scores_gemma":[0.9983537,0.0003372492,0.00016406908,0.0009838573,0.00012165591,0.000039445673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017275711,0.000116228824,0.00036165732,0.00022965105,0.00011127515,0.000023605795,0.0005931698,0.000047043588,0.000013196417],"category_scores_gemma":[0.00003521044,0.00008005935,0.00017832204,0.0018875172,0.00041749357,0.00007585103,0.00025874277,0.000097465396,6.618242e-7],"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.00008232894,0.00018633915,0.0004186959,0.000077732424,0.0006288783,0.0000037732475,0.0013077086,0.0013563363,0.0007872785,0.970788,0.000048887283,0.024314048],"study_design_scores_gemma":[0.00017562807,0.00003448668,0.0062656174,0.000007867611,0.00013698613,0.0000026504908,0.00004626584,0.007984705,0.015261881,0.96993077,0.00006474418,0.00008840902],"about_ca_topic_score_codex":0.0000325046,"about_ca_topic_score_gemma":0.000010225426,"teacher_disagreement_score":0.09116531,"about_ca_system_score_codex":0.0000026857003,"about_ca_system_score_gemma":0.00002681469,"threshold_uncertainty_score":0.32647252},"labels":[],"label_agreement":null},{"id":"W4410115253","doi":"10.1109/tgrs.2025.3567357","title":"Segmentation of Individual Trees in TLS Point Clouds via Graph Optimization","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Geoscience and Remote Sensing","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Point cloud; Segmentation; Graph; Image segmentation; Artificial intelligence; Computer vision; Theoretical computer science","score_opus":0.009452900951788513,"score_gpt":0.23795999258719377,"score_spread":0.22850709163540525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410115253","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.062180333,0.000021536942,0.93690234,0.00021709649,0.00043621822,0.00011364033,0.0000020804232,0.000035638506,0.00009113683],"genre_scores_gemma":[0.75307447,0.000047098856,0.24669282,0.00013824274,0.0000039827305,1.2294463e-7,5.0851276e-7,0.0000023230916,0.000040397546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990384,0.000085917694,0.00022543389,0.00029045754,0.00019216049,0.00016764204],"domain_scores_gemma":[0.99959624,0.000078469144,0.000062428415,0.00018332555,0.00004330604,0.000036215668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042332007,0.00009968362,0.00012353767,0.0005204563,0.0002152682,0.00007366967,0.00018251177,0.00005263636,0.000001289777],"category_scores_gemma":[0.000004152138,0.00009265121,0.000045541386,0.0013455219,0.00015539842,0.00039854442,0.0000042396487,0.0001179787,4.9417537e-7],"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.000009740811,0.000041047995,0.0000025881827,0.000008915659,0.000007631124,0.0000033056654,0.0011812276,0.06370689,0.007058762,0.0002759048,9.049497e-7,0.9277031],"study_design_scores_gemma":[0.0003519456,0.00007870588,0.00060885097,0.00012565954,0.000012184902,0.000015042278,0.00028678434,0.92744,0.06297473,0.007992385,0.0000018372771,0.00011189227],"about_ca_topic_score_codex":0.00010586804,"about_ca_topic_score_gemma":0.00005167303,"teacher_disagreement_score":0.9275912,"about_ca_system_score_codex":0.000016752734,"about_ca_system_score_gemma":0.000044420463,"threshold_uncertainty_score":0.37782067},"labels":[],"label_agreement":null},{"id":"W4410398814","doi":"10.1145/3735650","title":"Robust Neural Model for Searching over Incomplete Graphs","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Intelligent Systems and Technology","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"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; York University; University of Toronto","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning","score_opus":0.03846906754591372,"score_gpt":0.2751686339396371,"score_spread":0.23669956639372336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410398814","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.01071122,0.00028994677,0.98607767,0.0015073669,0.00058897765,0.00041005114,0.000011983589,0.00031502842,0.00008777888],"genre_scores_gemma":[0.981636,0.00006111877,0.017426433,0.00010937696,0.000007126443,0.00019315434,0.0000011671566,0.000008534268,0.00055708725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998922,0.000036323727,0.00025999037,0.0004095939,0.000090887384,0.00028120697],"domain_scores_gemma":[0.9989849,0.00017774949,0.000047051763,0.00067577686,0.00006987566,0.00004467072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022876424,0.00015443744,0.00020833197,0.0008364455,0.00032819997,0.000091655485,0.00076752825,0.00014876686,0.0000040307664],"category_scores_gemma":[0.000020222687,0.00013882872,0.000086462984,0.0007116848,0.000116455056,0.00015055024,0.00003729859,0.00027058355,0.0000026260975],"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.000012930122,0.00006996668,0.000053841275,0.000066049724,0.00007331841,0.0000021314147,0.00013809337,0.041122332,0.0002868031,0.84892535,0.00004216463,0.10920704],"study_design_scores_gemma":[0.00017358984,0.00008866902,0.000008573906,0.000052668536,0.000011422919,0.000014902984,0.00010809564,0.7825025,0.0010690608,0.21525268,0.00060662517,0.00011120652],"about_ca_topic_score_codex":0.000027395503,"about_ca_topic_score_gemma":0.00001306941,"teacher_disagreement_score":0.9709248,"about_ca_system_score_codex":0.000022797667,"about_ca_system_score_gemma":0.000025078834,"threshold_uncertainty_score":0.5661271},"labels":[],"label_agreement":null},{"id":"W4410403751","doi":"10.1007/s10878-025-01308-0","title":"Better approximating SONET k-edge partition for small capacity k","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Synchronous optical networking; Partition (number theory); Theory of computation; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Mathematics; Discrete mathematics; Parallel computing; Computer network; Algorithm; Telecommunications","score_opus":0.015262999486374024,"score_gpt":0.2321040588423008,"score_spread":0.21684105935592676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410403751","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.006985934,0.000030723586,0.9868953,0.0007099036,0.00480189,0.00016173135,0.0000013305109,0.00002706071,0.0003860937],"genre_scores_gemma":[0.19581012,0.000007457507,0.80343497,0.00026973605,0.0004154961,0.00001137778,0.0000038512508,0.0000074430463,0.00003952504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901676,0.000107365566,0.00046282692,0.00011914452,0.00014769848,0.00014621203],"domain_scores_gemma":[0.99879783,0.00016280371,0.00041501512,0.00014541287,0.00043179077,0.000047117825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093458657,0.00009674616,0.0002019565,0.00017737331,0.0001528751,0.00015474591,0.0003607741,0.000076062075,0.000004340888],"category_scores_gemma":[0.00022162289,0.00008561727,0.00012334471,0.00033770094,0.000024512661,0.00056408317,0.000043097145,0.00013561374,7.783811e-7],"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.00009397461,0.000286864,0.0001646564,0.00008237474,0.00008472179,0.0000030290419,0.0005353944,0.097037904,0.0005411875,0.8896942,0.0013047751,0.010170915],"study_design_scores_gemma":[0.0019308726,0.00022690352,0.000059713853,0.00009604953,0.000036920697,0.000008739859,0.000018996327,0.4996078,0.0049702497,0.49205875,0.0008585597,0.0001264616],"about_ca_topic_score_codex":7.127188e-7,"about_ca_topic_score_gemma":6.387486e-8,"teacher_disagreement_score":0.4025699,"about_ca_system_score_codex":0.000044617493,"about_ca_system_score_gemma":0.00006705195,"threshold_uncertainty_score":0.3491371},"labels":[],"label_agreement":null},{"id":"W4410544001","doi":"10.14778/3717755.3717771","title":"In-Depth Analysis of Densest Subgraph Discovery in a Unified Framework","year":2024,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory 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":"University of British Columbia","funders":"","keywords":"Computer science; Computational biology; Biology","score_opus":0.00938181969614827,"score_gpt":0.2451218865393913,"score_spread":0.23574006684324303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410544001","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.9914291,0.000499041,0.0054239137,0.00090009073,0.00034120827,0.00022893176,0.0000056278027,0.000035779325,0.0011363202],"genre_scores_gemma":[0.9970369,0.000058971385,0.0027049258,0.00006364616,0.000012563506,0.000021264403,2.800127e-7,0.000005892112,0.000095592026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987866,0.000014656695,0.00036005036,0.00031817722,0.00030452292,0.00021593962],"domain_scores_gemma":[0.999471,0.00013626652,0.00011418561,0.00020062792,0.000047349604,0.000030534044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055236364,0.00012708303,0.00028558433,0.00082996365,0.000024875322,0.00010455371,0.00092962955,0.000053392658,0.0000050412345],"category_scores_gemma":[0.000061323335,0.00008803722,0.0002364209,0.005187818,0.0000849567,0.0005420805,0.00029321542,0.0002078059,0.0000012589564],"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.000017544296,0.00016340952,0.0313738,0.00014962441,0.0002546639,0.0000057574157,0.003603575,0.0002765453,0.006396192,0.95646447,0.000045119523,0.001249296],"study_design_scores_gemma":[0.0004590089,0.000153334,0.12669033,0.001187444,0.00034515813,0.000008462043,0.00090055563,0.02305698,0.11265003,0.73398393,0.00016639341,0.0003983918],"about_ca_topic_score_codex":0.000089654175,"about_ca_topic_score_gemma":0.000023733633,"teacher_disagreement_score":0.22248057,"about_ca_system_score_codex":0.000041052223,"about_ca_system_score_gemma":0.000028662529,"threshold_uncertainty_score":0.35900533},"labels":[],"label_agreement":null},{"id":"W4411141667","doi":"10.1145/3725228","title":"An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs Using Fast Matrix Multiplication","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","topic":"Graph Theory and Algorithms","field":"Computer Science","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":"Universitas Brawijaya","keywords":"Matrix multiplication; Multiplication (music); Algorithm; Computer science; Matrix (chemical analysis); Multiplication algorithm; Arithmetic; Mathematics; Parallel computing; Combinatorics; Physics; Materials science","score_opus":0.024970418219312337,"score_gpt":0.32197904203225824,"score_spread":0.2970086238129459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411141667","genre_codex":"empirical","genre_gemma":"methods","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.53776973,0.00008739156,0.45908058,0.00086113194,0.0002846462,0.0015050303,0.0001434365,0.00008437539,0.00018368567],"genre_scores_gemma":[0.3287501,0.000022331864,0.67105305,0.000054706434,0.000010568498,0.00002431887,0.000019900623,0.000008405094,0.000056617933],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876344,0.000009455179,0.00034011094,0.0004896052,0.00019269326,0.00020471116],"domain_scores_gemma":[0.99824077,0.00003714663,0.0003021492,0.0012905331,0.000110438996,0.000018937282],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0008975607,0.00013231157,0.00017039351,0.00026121392,0.00011094439,0.00009817941,0.006430416,0.000036908332,3.5357525e-7],"category_scores_gemma":[0.000050261457,0.00011138623,0.00005432051,0.0007132099,0.000056785582,0.00095731206,0.002658565,0.000077661796,1.8191824e-7],"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.00006242179,0.00051091495,0.001961292,0.0009786066,0.00017833083,3.7045817e-7,0.00022249717,0.00032919878,0.072176084,0.21869428,0.00014600586,0.70474],"study_design_scores_gemma":[0.00055442995,0.000045954537,0.0038466083,0.0002131641,0.000038455386,3.960674e-7,0.00025467802,0.9209152,0.0042991666,0.069676794,0.000045374436,0.0001097767],"about_ca_topic_score_codex":0.000017591778,"about_ca_topic_score_gemma":0.0000017562027,"teacher_disagreement_score":0.920586,"about_ca_system_score_codex":0.000027296963,"about_ca_system_score_gemma":0.000011506348,"threshold_uncertainty_score":0.9989453},"labels":[],"label_agreement":null},{"id":"W4411403412","doi":"10.1145/3725404","title":"Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","topic":"Graph Theory 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":"University of British Columbia","funders":"","keywords":"Backtracking; Computer science; Benchmark (surveying); Redundancy (engineering); Graph; Computation; Theoretical computer science; Algorithm","score_opus":0.05965004820938316,"score_gpt":0.2988278835663659,"score_spread":0.23917783535698275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411403412","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.7299008,0.0006025948,0.04887603,0.015094695,0.0013596884,0.0033122082,0.0002076615,0.00050557556,0.20014076],"genre_scores_gemma":[0.88680714,0.000069749476,0.11245104,0.00014206137,0.000018620629,0.0000147043675,0.000013578938,0.0000116016645,0.00047149337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981715,0.00002336859,0.0003632919,0.0006190351,0.00052381353,0.00029897233],"domain_scores_gemma":[0.9969978,0.000054866337,0.000227081,0.00257591,0.00010439822,0.00003997439],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0012703056,0.00018275049,0.00025746008,0.00027827633,0.00017061026,0.0001435047,0.016377635,0.000043905493,0.0000030067747],"category_scores_gemma":[0.00006740235,0.00014034,0.00010003165,0.0014771885,0.0001731702,0.00079805555,0.01247853,0.00021632922,0.000003073251],"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.000072799674,0.0005887379,0.0017502472,0.001496193,0.0003808226,0.0000013040601,0.00044878694,0.000041734933,0.0040218094,0.85875565,0.006022935,0.12641898],"study_design_scores_gemma":[0.0023354464,0.0003140251,0.03427992,0.003220172,0.00033248146,0.000008514791,0.003702649,0.027663006,0.09845387,0.82605106,0.0028030626,0.00083578],"about_ca_topic_score_codex":0.000006833125,"about_ca_topic_score_gemma":2.0421385e-7,"teacher_disagreement_score":0.19966927,"about_ca_system_score_codex":0.000015867687,"about_ca_system_score_gemma":0.00001458262,"threshold_uncertainty_score":0.9955084},"labels":[],"label_agreement":null},{"id":"W4411797260","doi":"10.1145/3735546","title":"Proceedings of the 8th Joint Workshop on Graph Data Management Experiences &amp; Systems (GRADES) and Network Data Analytics (NDA)","year":2025,"lang":"en","type":"paratext","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation; Canada Excellence Research Chairs, Government of Canada; National Science Foundation; Government of Canada; Agence Nationale de la Recherche","keywords":"Computer science; Analytics; Data analysis; Data science; Data management; Graph; Joint (building); World Wide Web; Data mining; Theoretical computer science; Engineering","score_opus":0.07936672135207508,"score_gpt":0.2913250038531657,"score_spread":0.2119582825010906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411797260","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024550913,0.019558454,0.44556713,0.0033041013,0.028402908,0.005233284,0.0009946238,0.0004088214,0.4940756],"genre_scores_gemma":[0.06639993,0.021435488,0.06961606,0.0021028104,0.0021051383,0.00037431766,0.0015668209,0.00012349604,0.83627594],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964969,0.00008001717,0.0006402557,0.0015872887,0.0007345625,0.0004609608],"domain_scores_gemma":[0.9950653,0.00015490757,0.00048793852,0.0040912684,0.00009950343,0.00010108818],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0013148014,0.0004470167,0.000655434,0.00026493255,0.0003381929,0.00079975434,0.010457917,0.00019707788,0.000046909197],"category_scores_gemma":[0.000034252633,0.00028424826,0.000084972424,0.0018430557,0.00030543434,0.00057499704,0.009844617,0.00044537883,0.000035829187],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009497611,0.00007312071,0.000025628155,0.0005696548,0.0003110628,0.0000021065928,0.00065921614,0.00062377384,9.348091e-7,0.12034288,0.87366843,0.0037137135],"study_design_scores_gemma":[0.0005966755,0.00010752554,0.00015867676,0.0069565107,0.00038389114,0.000024571855,0.008336029,0.13784723,0.000030292966,0.008329251,0.835761,0.001468363],"about_ca_topic_score_codex":0.000026807693,"about_ca_topic_score_gemma":0.000008664859,"teacher_disagreement_score":0.37595108,"about_ca_system_score_codex":0.000017471793,"about_ca_system_score_gemma":0.00006629777,"threshold_uncertainty_score":0.99996096},"labels":[],"label_agreement":null},{"id":"W4411798774","doi":"10.61091/um123-16","title":"The edge surviving rate of Halin graphs","year":2025,"lang":"en","type":"article","venue":"Utilitas Mathematica","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Computer science","score_opus":0.010248360433344643,"score_gpt":0.2485449282576334,"score_spread":0.23829656782428876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411798774","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.06505646,0.0015141572,0.8635384,0.0026827494,0.0010875945,0.00051153154,0.000008084889,0.0002739857,0.06532706],"genre_scores_gemma":[0.9872628,0.00001954707,0.011374575,0.00010870693,0.000006834152,0.000019099176,3.9202718e-7,0.0000048964416,0.0012031374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989643,0.0001952296,0.00031444707,0.00019336175,0.00011448449,0.0002181945],"domain_scores_gemma":[0.9978191,0.0011733773,0.00008360878,0.0008167889,0.00007310075,0.000033991717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018143615,0.0001055175,0.00017651619,0.000086135165,0.0002273085,0.00007590432,0.0010307602,0.00003355804,0.00001484451],"category_scores_gemma":[0.0003283371,0.00006802985,0.00011649712,0.0005731959,0.00017239257,0.00012303545,0.00024304132,0.00009001708,0.000026104282],"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.0000022169236,0.000041752195,0.000030839434,0.000058342324,0.000028255463,9.746938e-7,0.00050192006,0.0000011197915,0.00017864983,0.9877398,0.00044889757,0.0109672425],"study_design_scores_gemma":[0.00010109167,0.000016329006,0.0005612457,0.00009106707,0.000009372459,0.0000016187281,0.0001715646,0.014521515,0.0025486636,0.9808382,0.001070708,0.00006865867],"about_ca_topic_score_codex":0.0000037951081,"about_ca_topic_score_gemma":0.0000024379074,"teacher_disagreement_score":0.92220634,"about_ca_system_score_codex":0.0000060840775,"about_ca_system_score_gemma":0.00003709333,"threshold_uncertainty_score":0.27741766},"labels":[],"label_agreement":null},{"id":"W4412853875","doi":"10.1007/s10732-025-09565-2","title":"Efficient Hybridization of Quantum Annealing and Ant Colony Optimization for Coloring DIMACS Graph Instances","year":2025,"lang":"en","type":"article","venue":"Journal of Heuristics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Heritage College","funders":"","keywords":"Ant colony optimization algorithms; Graph coloring; Quantum annealing; Simulated annealing; Computer science; Quantum; Graph; Mathematical optimization; Theoretical computer science; Mathematics; Algorithm; Quantum computer; Physics","score_opus":0.008322143247078195,"score_gpt":0.2488166021591408,"score_spread":0.24049445891206261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412853875","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.1757395,0.0005837959,0.82285935,0.00010504136,0.0005965315,0.0000789445,0.0000048857733,0.0000070159854,0.000024956598],"genre_scores_gemma":[0.89086425,0.0001825689,0.108877175,0.00003405755,0.000032030006,0.0000011434079,6.412339e-7,0.0000030177841,0.000005099829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923676,0.00004156719,0.00039349296,0.00009173474,0.00013653652,0.000099917015],"domain_scores_gemma":[0.99885,0.00025311607,0.00038367324,0.00008517538,0.00039373146,0.000034333698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005608231,0.000066460525,0.00017697566,0.00021147252,0.00011517805,0.000049209793,0.00019496365,0.000026671327,3.4940774e-7],"category_scores_gemma":[0.0002592733,0.000058034766,0.000048761845,0.00035111437,0.000050861487,0.000091562884,0.00004090636,0.00006851002,2.5640945e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000636211,0.000078024495,0.000571161,0.000118586555,0.000032194406,0.0000072308626,0.0002832986,0.82617056,0.00040847328,0.16947934,0.00007599126,0.0027115426],"study_design_scores_gemma":[0.00045802305,0.00020396715,0.00033159897,0.00015912119,0.000027578868,0.00001260223,0.000073272284,0.9812834,0.0020302369,0.015256471,0.000107190885,0.000056494035],"about_ca_topic_score_codex":7.80878e-7,"about_ca_topic_score_gemma":2.0328777e-7,"teacher_disagreement_score":0.7151248,"about_ca_system_score_codex":0.000016530244,"about_ca_system_score_gemma":0.000068218586,"threshold_uncertainty_score":0.23665892},"labels":[],"label_agreement":null},{"id":"W4413013076","doi":"10.1080/10618600.2025.2544182","title":"On Seeded Subgraph-to-Subgraph Matching: The ssSGM Algorithm and Matchability Information Theory","year":2025,"lang":"en","type":"article","venue":"Journal of Computational and Graphical Statistics","topic":"Graph Theory 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":"Induced subgraph isomorphism problem; Subgraph isomorphism problem; Matching (statistics); Seeding; Algorithm; Computer science; Mathematics; Artificial intelligence; Combinatorics; Graph; Statistics; Line graph; Biology","score_opus":0.003457809734509369,"score_gpt":0.22857143812472058,"score_spread":0.2251136283902112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413013076","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.049177296,0.00008914741,0.94743127,0.0027453064,0.00028505785,0.0001290577,0.000055694607,0.000017041368,0.00007011907],"genre_scores_gemma":[0.82002854,0.00004375456,0.17648415,0.0033783412,0.0000369997,0.0000041296194,0.0000067414803,0.000004048391,0.0000133045205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985031,0.0002153106,0.0005345449,0.0001482088,0.00042912664,0.00016969799],"domain_scores_gemma":[0.9968513,0.0022767568,0.00022666443,0.00013754246,0.00035638912,0.00015133462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012980105,0.00015569422,0.00022637122,0.00039639504,0.00034872402,0.00027547314,0.00035602553,0.0000577695,0.0000041497574],"category_scores_gemma":[0.0001695849,0.000101710735,0.00007834539,0.0006873997,0.0002397742,0.00036805216,0.00011331352,0.000345394,0.0000019295846],"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.00006125453,0.00004322506,0.00014608607,0.00001952031,0.00005470223,0.0000051413763,0.00048289748,0.002269907,0.0000022964166,0.88974446,0.00036730693,0.1068032],"study_design_scores_gemma":[0.00041681112,0.00022961863,0.05673231,0.000041712323,0.000021242484,0.000053361793,0.00007854487,0.022347823,0.000006492847,0.919656,0.00031410737,0.00010200595],"about_ca_topic_score_codex":0.0000044922886,"about_ca_topic_score_gemma":8.822472e-7,"teacher_disagreement_score":0.7709471,"about_ca_system_score_codex":0.0000141269065,"about_ca_system_score_gemma":0.00007482942,"threshold_uncertainty_score":0.41476434},"labels":[],"label_agreement":null},{"id":"W4413361290","doi":"10.1109/icde65448.2025.00338","title":"A Unified Narrative for Query Processing in Graph Databases","year":2025,"lang":"en","type":"article","venue":"","topic":"Graph Theory 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":"University of Waterloo","funders":"","keywords":"Computer science; Graph database; Information retrieval; Query optimization; Graph; Narrative; Database; Query language; Theoretical computer science","score_opus":0.02275859930743471,"score_gpt":0.298723527965488,"score_spread":0.2759649286580533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413361290","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.011127142,0.000119241544,0.98412436,0.0006859278,0.00012880826,0.00017493338,0.000002076524,0.0000894213,0.0035481057],"genre_scores_gemma":[0.8769013,0.0000034585019,0.120833725,0.00081413734,0.000011620541,0.00006628342,0.0000045502106,0.0000027697463,0.0013621271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994209,0.000035464174,0.00011782483,0.00022926542,0.000049584087,0.0001469972],"domain_scores_gemma":[0.9996346,0.00008850864,0.000023405039,0.00019199395,0.000041966698,0.000019490233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002544209,0.000068133966,0.00008931046,0.00019818202,0.00010609326,0.000061585575,0.00032140224,0.000016738772,0.0000033295114],"category_scores_gemma":[0.000039440733,0.000055984277,0.000030073681,0.0007465859,0.000033878943,0.00044987077,0.00008098567,0.000051978368,8.843842e-7],"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.000009727001,0.00005025068,0.00018539518,0.000030366231,0.0000035814694,0.0000026645005,0.0014094174,0.000026166466,0.00028319928,0.9627111,0.00033709884,0.034951016],"study_design_scores_gemma":[0.0012216792,0.00007348911,0.001945117,0.00026414587,0.000006154709,0.0000030669758,0.0036054908,0.093316376,0.013303376,0.88241017,0.0035119185,0.00033903858],"about_ca_topic_score_codex":0.000018575809,"about_ca_topic_score_gemma":0.00006322945,"teacher_disagreement_score":0.86577415,"about_ca_system_score_codex":0.0000075617836,"about_ca_system_score_gemma":0.00007861638,"threshold_uncertainty_score":0.22829726},"labels":[],"label_agreement":null},{"id":"W4413968449","doi":"10.14778/3746405.3746413","title":"Locality-Aware Cache Replacement Policy for Graph Traversals","year":2025,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory 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":"University of Waterloo","funders":"","keywords":"Locality; Cache; Computer science; Locality of reference; Graph; Parallel computing; Theoretical computer science","score_opus":0.008567600864450518,"score_gpt":0.2535545745113512,"score_spread":0.2449869736469007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413968449","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.10973862,0.00073288236,0.7796397,0.05940191,0.002968736,0.0068950136,0.00009867685,0.0006770018,0.039847452],"genre_scores_gemma":[0.9905823,0.000020769803,0.006626283,0.0011303648,0.00005726381,0.00018752636,7.816767e-7,0.000007810464,0.0013869111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871415,0.000012236686,0.00031955412,0.00036884006,0.00026481145,0.00032041012],"domain_scores_gemma":[0.9992094,0.00007113988,0.0001797829,0.00028579458,0.00019613403,0.000057767873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071636727,0.00016397628,0.00020800928,0.00019909955,0.0002115022,0.0000845985,0.0013390966,0.000050734878,0.0000038674452],"category_scores_gemma":[0.00008223247,0.000115438335,0.00022609244,0.0008213516,0.00009621593,0.00019179782,0.00042604082,0.0000993022,0.0000015763336],"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.000041958945,0.00012990013,0.0004669645,0.00017820873,0.00009221271,9.978331e-8,0.00069171155,0.000015075924,0.0037235094,0.9826879,0.00372994,0.008242513],"study_design_scores_gemma":[0.0013493677,0.00021426576,0.0005499723,0.00019550047,0.000051258772,0.0000044133176,0.00066941394,0.0035349594,0.341785,0.64248145,0.008937408,0.00022701068],"about_ca_topic_score_codex":0.000043225715,"about_ca_topic_score_gemma":9.989478e-7,"teacher_disagreement_score":0.88084364,"about_ca_system_score_codex":0.0000846769,"about_ca_system_score_gemma":0.00007970907,"threshold_uncertainty_score":0.4707439},"labels":[],"label_agreement":null},{"id":"W4414003972","doi":"10.14778/3749646.3749704","title":"NaviX: A Native Vector Index Design for Graph DBMSs With Robust Predicate-Agnostic Search Performance","year":2025,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Predicate (mathematical logic); Graph; Programming language; Theoretical computer science","score_opus":0.017912365227868456,"score_gpt":0.22755192029124968,"score_spread":0.20963955506338122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414003972","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.34475243,0.00020176338,0.6481917,0.0019341519,0.0004175535,0.0029146455,0.000012916013,0.00017263746,0.0014021822],"genre_scores_gemma":[0.9796585,0.000026199212,0.019486126,0.000114791554,0.000023833782,0.00037885163,4.7572345e-7,0.000010331941,0.00030092197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985302,0.000018597591,0.00023992908,0.00040788844,0.00042211066,0.0003812873],"domain_scores_gemma":[0.9989421,0.00022941019,0.00015335924,0.00020582446,0.00040400203,0.00006529762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000751777,0.00019637583,0.00021702271,0.0001997073,0.00031102484,0.00010001679,0.0015023849,0.00005196093,0.0000023031012],"category_scores_gemma":[0.00009483388,0.00012368537,0.00009627486,0.0010773253,0.00019845123,0.00036982985,0.00035260626,0.00019753719,0.0000012730266],"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.0019075221,0.0017511635,0.042242777,0.0027316536,0.0013321799,0.000003268659,0.01238594,0.039118025,0.021820772,0.84552073,0.003978176,0.027207796],"study_design_scores_gemma":[0.0041560754,0.0020280033,0.02571418,0.0017198076,0.00015356095,0.000025106423,0.0006909505,0.25095505,0.65449375,0.059063762,0.00033446052,0.000665289],"about_ca_topic_score_codex":0.000008661921,"about_ca_topic_score_gemma":4.9793573e-7,"teacher_disagreement_score":0.78645694,"about_ca_system_score_codex":0.00006193234,"about_ca_system_score_gemma":0.000114576935,"threshold_uncertainty_score":0.5043743},"labels":[],"label_agreement":null},{"id":"W4414078184","doi":"10.14778/3749646.3749706","title":"Robust Recursive Query Parallelism in Graph Database Management Systems","year":2025,"lang":"en","type":"article","venue":"Proceedings of the VLDB Endowment","topic":"Graph Theory 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":"University of Waterloo","funders":"","keywords":"Computation; Graph; Variety (cybernetics); Node (physics); Query optimization; Graph database; Parallelism (grammar); Directed acyclic graph; Materialized view","score_opus":0.013331584993892084,"score_gpt":0.21476247281281138,"score_spread":0.2014308878189193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414078184","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.4053853,0.011050508,0.24536397,0.020962568,0.015665768,0.013235135,0.0000876646,0.0010415727,0.28720754],"genre_scores_gemma":[0.98246294,0.00033832915,0.014713616,0.0003832549,0.000034603334,0.00028161652,0.0000016806829,0.0000099844265,0.0017739695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986173,0.00002153205,0.00036041974,0.00040018986,0.0003042665,0.00029628366],"domain_scores_gemma":[0.9993316,0.000038839233,0.00017080976,0.00032487378,0.00009084031,0.000043029704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069655373,0.0001639627,0.00020823207,0.000313573,0.00010571764,0.000102627084,0.0015805523,0.000038995484,0.0000018813253],"category_scores_gemma":[0.00002430929,0.000119690805,0.00009965255,0.00104754,0.00007033838,0.00035831166,0.00084348634,0.00015696374,0.0000036646443],"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.0000141056225,0.00012863688,0.00072560925,0.0002426274,0.000055939945,0.000003599368,0.00035953982,0.00043712027,0.0005267468,0.99374014,0.0021892264,0.0015766991],"study_design_scores_gemma":[0.005645423,0.0002565696,0.012125646,0.006317487,0.00020661342,0.00004752277,0.0069160094,0.02199205,0.054369234,0.8768902,0.013885639,0.0013476388],"about_ca_topic_score_codex":0.000058683494,"about_ca_topic_score_gemma":0.0000022546178,"teacher_disagreement_score":0.5770777,"about_ca_system_score_codex":0.000065733155,"about_ca_system_score_gemma":0.00001766249,"threshold_uncertainty_score":0.4880849},"labels":[],"label_agreement":null},{"id":"W4414100071","doi":"10.26493/1855-3974.3451.46f","title":"Extending graph burning to hypergraphs","year":2025,"lang":"en","type":"article","venue":"Ars Mathematica Contemporanea","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Graph; Conjecture; Generalization; Existential quantification; Upper and lower bounds","score_opus":0.012585412892742544,"score_gpt":0.25702225554295166,"score_spread":0.24443684265020912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414100071","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.03266646,0.00024845544,0.9181078,0.002179101,0.0004912546,0.00038879915,0.000001853718,0.00043627122,0.045480028],"genre_scores_gemma":[0.93332994,0.0000063952643,0.06388022,0.0011362683,0.000013366334,0.00005990693,0.0000010384935,0.000012238977,0.0015606245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842054,0.00009791027,0.00040424886,0.0004619117,0.0002403642,0.00037503126],"domain_scores_gemma":[0.9985453,0.00032493804,0.00009121754,0.000813256,0.000078709265,0.00014660074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008331224,0.00021756049,0.0003333608,0.0004968604,0.00025810848,0.00021361934,0.0011233708,0.000057916455,0.000021564643],"category_scores_gemma":[0.00016273174,0.00019318717,0.0001692227,0.0013327003,0.000061000195,0.00034665244,0.00026218782,0.00014976405,0.00014483983],"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.0000053751537,0.00006653377,0.00011165319,0.000058176116,0.0000469998,0.00002948155,0.0011246686,0.00001309621,0.0022910459,0.9854182,0.0007439667,0.010090813],"study_design_scores_gemma":[0.00045768166,0.00006615929,0.00017594895,0.0003911749,0.000017905739,0.000024553836,0.00028982645,0.00431076,0.0037284377,0.98620963,0.0039799362,0.0003479568],"about_ca_topic_score_codex":0.0000048647694,"about_ca_topic_score_gemma":0.0000012175584,"teacher_disagreement_score":0.9006635,"about_ca_system_score_codex":0.000015892574,"about_ca_system_score_gemma":0.000038960097,"threshold_uncertainty_score":0.7877944},"labels":[],"label_agreement":null},{"id":"W4414199011","doi":"10.1109/dac63849.2025.11132100","title":"GPart: A GNN-Enabled Multilevel Graph Partitioner","year":2025,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scalability; Graph; Graph partition; Layer (electronics); Graph theory; Reduction (mathematics)","score_opus":0.00820922993931541,"score_gpt":0.23597775345619623,"score_spread":0.22776852351688082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414199011","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.00456504,0.00003667872,0.9556736,0.0008690688,0.00038217066,0.0000952193,0.0000017055828,0.00028135575,0.038095206],"genre_scores_gemma":[0.9499586,0.000004064258,0.03467983,0.0018135209,0.000016885688,0.00003504611,0.0000023679945,0.0000026177183,0.013487067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991835,0.000051647534,0.00014714431,0.00028675963,0.00010431108,0.00022668013],"domain_scores_gemma":[0.9993465,0.000075026146,0.000023724442,0.0004439775,0.000052767773,0.00005801805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021673505,0.000093769384,0.00012239678,0.00026656577,0.00015016789,0.00011229419,0.00049358484,0.000040451603,0.00011247333],"category_scores_gemma":[0.000016514383,0.00007623848,0.00011710517,0.0012222539,0.000043545268,0.0002894743,0.00013748193,0.000076061544,0.00011170425],"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.0000020948812,0.000058125705,0.00040568283,0.0000040622544,0.00007313786,0.0000047802337,0.00010826097,0.00013506714,0.0001584104,0.9902405,0.0022827785,0.0065270904],"study_design_scores_gemma":[0.00066794414,0.00003146289,0.016275927,0.000017599054,0.000051856146,0.0000026483149,0.000036437308,0.12269951,0.0090493895,0.8380121,0.012875173,0.00027998645],"about_ca_topic_score_codex":0.000011212734,"about_ca_topic_score_gemma":0.0000073058063,"teacher_disagreement_score":0.94539356,"about_ca_system_score_codex":0.0000066322173,"about_ca_system_score_gemma":0.000028783239,"threshold_uncertainty_score":0.3108915},"labels":[],"label_agreement":null},{"id":"W4414878045","doi":"","title":"A graph-structured distance for heterogeneous datasets with meta variables","year":2024,"lang":"en","type":"other","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Office National d'études et de Recherches Aérospatiales; Fonds de recherche du Québec – Nature et technologies; European Commission","keywords":"Weighting; Feature (linguistics); Hyperparameter; Regression; Variable (mathematics); Multilayer perceptron; Data point; Regression analysis; Meta learning (computer science)","score_opus":0.009909839266732981,"score_gpt":0.2242475920476452,"score_spread":0.21433775278091222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414878045","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.0000033374113,0.016017893,0.9708473,0.0005948802,0.00043509534,0.0015473355,0.0046621156,0.0023908175,0.0035011915],"genre_scores_gemma":[0.0026217764,0.0004041462,0.8768944,0.001911785,0.00042770134,0.003527368,0.0008186915,0.0012455605,0.112148575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965578,0.00014054228,0.0004423053,0.001434495,0.00046209036,0.00096282124],"domain_scores_gemma":[0.99655443,0.00011024129,0.00038073395,0.0025582102,0.00005836389,0.00033804326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004995261,0.00089922815,0.0009704986,0.00087561435,0.00016866541,0.000655097,0.0023482672,0.00053964625,0.00009783217],"category_scores_gemma":[0.000038886614,0.00069529004,0.0004956939,0.00096760696,0.0001769442,0.00026752925,0.0004434475,0.0005097127,0.000025954012],"study_design_candidate":"not_applicable","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.0000968808,0.0001741836,0.000021443524,0.00059030554,0.0034284163,0.00067804527,0.00012852772,0.00054080377,0.00019545844,0.57032466,0.41701657,0.00680469],"study_design_scores_gemma":[0.00078317005,0.00042073036,0.000011337696,0.00045262612,0.0015931939,0.00088961556,0.0000126322775,0.032467153,0.002335948,0.2153713,0.7437001,0.0019622168],"about_ca_topic_score_codex":0.0012002065,"about_ca_topic_score_gemma":0.0032788066,"teacher_disagreement_score":0.35495338,"about_ca_system_score_codex":0.00010587491,"about_ca_system_score_gemma":0.00018784746,"threshold_uncertainty_score":0.9995498},"labels":[],"label_agreement":null},{"id":"W4415004213","doi":"10.1109/caibda65784.2025.11183378","title":"Research on Efficient Graph Partitioning Algorithms for Sparse Matrices","year":2025,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Key Research and Development Program of China","keywords":"Graph partition; Sparse matrix; Graph; Computation; Graph algorithms; Partition (number theory); Dense graph; Convergence (economics)","score_opus":0.06708949888104136,"score_gpt":0.36880711027690355,"score_spread":0.3017176113958622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415004213","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.01052979,0.0001259635,0.9688134,0.0014003406,0.00059215416,0.00033602392,0.0000034897132,0.00019350555,0.018005336],"genre_scores_gemma":[0.88889253,0.000019089524,0.10567926,0.0007202612,0.00010057584,0.00023769215,0.000003870561,0.000009212467,0.004337519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854505,0.00012722872,0.00018002924,0.00042498735,0.0003006958,0.00042197944],"domain_scores_gemma":[0.9985954,0.00068547827,0.000026958765,0.00044633378,0.00017790412,0.000067923356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001730025,0.00009867393,0.00011136223,0.0005787431,0.00054545753,0.00025441605,0.0007217075,0.00004898687,0.000017382488],"category_scores_gemma":[0.000052155483,0.000080977916,0.00009305326,0.001645455,0.00008292951,0.00011650393,0.00016768913,0.00016006664,0.000065080894],"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.000009689277,0.00010886545,0.000019504401,0.0000141177425,0.000011671386,0.0000030446408,0.00008780182,0.0024539996,0.000050741764,0.9723141,0.0025620167,0.02236441],"study_design_scores_gemma":[0.00078001956,0.00034820242,0.00066898117,0.00012889192,0.000007761416,0.0000027897863,0.0004009568,0.42010814,0.016547896,0.55048406,0.010262677,0.00025963402],"about_ca_topic_score_codex":0.000011841183,"about_ca_topic_score_gemma":0.0000021563726,"teacher_disagreement_score":0.8783627,"about_ca_system_score_codex":0.000023695002,"about_ca_system_score_gemma":0.000050467454,"threshold_uncertainty_score":0.41952732},"labels":[],"label_agreement":null},{"id":"W4415353160","doi":"10.1109/lgrs.2025.3623931","title":"S2G-GCN: A Plot Classification Network Integrating Spectrum-to-Graph Modeling and Graph Convolutional Network for Compact HFSWR","year":2025,"lang":"","type":"article","venue":"IEEE Geoscience and Remote Sensing Letters","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Shandong Provincial Postdoctoral Science Foundation; Fundamental Research Funds for the Central Universities; Natural Science Foundation of Shandong Province","keywords":"Pattern recognition (psychology); Discriminative model; Plot (graphics); Graph; Classifier (UML); Feature extraction; Constant false alarm rate; False alarm; Energy (signal processing)","score_opus":0.022942009080052547,"score_gpt":0.253966774174581,"score_spread":0.23102476509452846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415353160","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.18575707,0.0007290637,0.79442376,0.014146074,0.0040123016,0.00072784146,0.00001049391,0.00011710108,0.00007629524],"genre_scores_gemma":[0.76896214,0.00020860636,0.21897337,0.0107839955,0.0009478199,9.3022203e-7,0.000007031196,0.000027422358,0.00008866632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948127,0.0003464525,0.0008848434,0.0017974423,0.00051143905,0.0016470926],"domain_scores_gemma":[0.99775285,0.0006127885,0.00034062576,0.0006750398,0.00020656128,0.00041215162],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00256134,0.0006356156,0.00067382614,0.0005948578,0.0032029985,0.0012034706,0.0006813224,0.00021330308,7.2914276e-7],"category_scores_gemma":[0.00011760194,0.0006143446,0.00025759378,0.0031595267,0.0011550253,0.0006684282,0.00019181955,0.00063217734,0.0000027553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000392353,0.00007786193,0.0006677657,0.00032068975,0.0003006212,0.000051754832,0.0042619994,0.46340698,0.029711416,0.064424895,0.005267882,0.43111578],"study_design_scores_gemma":[0.00055694307,0.00015066436,0.0011225999,0.001329312,0.00007902997,0.00007595242,0.00022764536,0.9212716,0.00013468797,0.07415743,0.0002722108,0.000621928],"about_ca_topic_score_codex":0.0003751345,"about_ca_topic_score_gemma":0.000108015534,"teacher_disagreement_score":0.5832051,"about_ca_system_score_codex":0.00009591371,"about_ca_system_score_gemma":0.00022186874,"threshold_uncertainty_score":0.9998334},"labels":[],"label_agreement":null},{"id":"W4415353339","doi":"10.1109/isit63088.2025.11195708","title":"On the Information-Theoretic Limit of Subgraph Alignment","year":2025,"lang":"","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Aarhus Universitets Forskningsfond","keywords":"Limit (mathematics); Sequence (biology); Set (abstract data type); Point (geometry)","score_opus":0.006128830713763188,"score_gpt":0.20728320963305596,"score_spread":0.20115437891929278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415353339","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.024170449,0.00016442916,0.7468323,0.01103274,0.0016080701,0.0006103678,0.000010507177,0.000059105958,0.215512],"genre_scores_gemma":[0.99302524,0.000083507926,0.0007750877,0.0047929105,0.000010225625,0.000019060813,0.0000010716429,0.0000026350083,0.0012902553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822426,0.00024231366,0.0005985853,0.00022031322,0.00040488548,0.0003096505],"domain_scores_gemma":[0.99762464,0.0009136514,0.00019282509,0.0010570949,0.00015121678,0.000060594997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011679631,0.00021447084,0.00021214945,0.00031165767,0.00029536872,0.00021890155,0.0014953926,0.00008039309,0.0005362582],"category_scores_gemma":[0.00012701948,0.00013349361,0.00022222537,0.0013800794,0.0004550099,0.000473349,0.00033529755,0.00019111823,0.0001715977],"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.000019186846,0.00010113853,0.00003178095,0.00004042438,0.0000655719,5.1599534e-7,0.001369529,0.00018080884,0.00001510563,0.96512324,0.0018772989,0.03117539],"study_design_scores_gemma":[0.00035176307,0.00026010151,0.00039971343,0.00019834762,0.000032125394,0.0000013072835,0.000535024,0.046452977,0.015936606,0.9332107,0.0024442344,0.00017712268],"about_ca_topic_score_codex":0.0000090504645,"about_ca_topic_score_gemma":7.6103447e-7,"teacher_disagreement_score":0.9688548,"about_ca_system_score_codex":0.000020314093,"about_ca_system_score_gemma":0.00011323244,"threshold_uncertainty_score":0.5871651},"labels":[],"label_agreement":null},{"id":"W4415686200","doi":"10.1007/978-3-032-09527-5_19","title":"Graph Querying or Similarity Search? Both!","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Graph; Similarity (geometry); Graph database; Semantic similarity; Knowledge graph; sort; Similitude; Clique-width","score_opus":0.02179112356671124,"score_gpt":0.2617235394994741,"score_spread":0.23993241593276285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415686200","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.000033259897,0.00041093337,0.98882407,0.0008318533,0.0022992152,0.00038988926,0.000010767516,0.00029534666,0.006904649],"genre_scores_gemma":[0.05904101,0.00018753383,0.92786306,0.007112743,0.00073230953,0.000020699123,0.000009560467,0.00006145001,0.004971649],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953423,0.00009524402,0.0005518622,0.0019520224,0.001101352,0.0009571789],"domain_scores_gemma":[0.99647415,0.0009732197,0.00017708314,0.0018957737,0.00023840484,0.00024138788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017256368,0.00063937885,0.0006442723,0.0015671168,0.00057510927,0.00082736334,0.0053774286,0.00040861446,0.000045764224],"category_scores_gemma":[0.00013650334,0.00052770047,0.00024325713,0.0016050922,0.0010645436,0.00076708297,0.0024017922,0.0014343983,0.00002715905],"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.00001580956,0.000044175973,0.000041694246,0.000093863506,0.000024460602,0.0003275285,0.00072046154,0.009766084,0.000053920663,0.20287669,0.00006885844,0.78596646],"study_design_scores_gemma":[0.0003255089,0.00019210129,0.000074168296,0.0007868714,0.000011734714,0.000082019986,3.583428e-7,0.29859748,0.0013476281,0.69571567,0.0019458246,0.00092063955],"about_ca_topic_score_codex":0.0000280204,"about_ca_topic_score_gemma":0.00007047716,"teacher_disagreement_score":0.7850458,"about_ca_system_score_codex":0.00018817197,"about_ca_system_score_gemma":0.0010407055,"threshold_uncertainty_score":0.9997175},"labels":[],"label_agreement":null},{"id":"W4415968816","doi":"10.1109/iecon58223.2025.11221803","title":"A divide and conquer partitioning method for bigraph data in industrial grade intelligent unmanned distributed systems","year":2025,"lang":"","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Ningbo University of Technology","keywords":"Scalability; Adaptability; Locality; Hypergraph; Node (physics); Process (computing); Load balancing (electrical power); Distributed database; Task (project management)","score_opus":0.09618483522921924,"score_gpt":0.34587164223891176,"score_spread":0.24968680700969254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415968816","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.002971327,0.0017444043,0.9872951,0.0026310338,0.0027663894,0.0016047325,0.00080064364,0.0000919374,0.00009446079],"genre_scores_gemma":[0.97979045,0.00019772201,0.01821081,0.00035430654,0.00022992025,0.00023378232,0.0004547553,0.000017992026,0.00051027496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954329,0.0009599342,0.0011323843,0.00143037,0.00027199733,0.0007723922],"domain_scores_gemma":[0.996053,0.0018918051,0.00024830597,0.0014565894,0.0001372015,0.00021312306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004509263,0.00041568023,0.00069556717,0.00058070954,0.0004340431,0.0010366075,0.001707896,0.0003209994,0.00001433285],"category_scores_gemma":[0.0006540488,0.0003908749,0.00011264501,0.0021632235,0.0002376558,0.00088630343,0.0015186343,0.00046705536,0.0000030668793],"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.00018660072,0.00044118694,0.0039403476,0.00029619943,0.0003869291,0.000024621506,0.0006883099,0.0023253525,0.00013255027,0.8846887,0.0032366745,0.10365252],"study_design_scores_gemma":[0.0026958014,0.00020139369,0.00047760055,0.00090224535,0.00014087194,0.000013244757,0.0006459586,0.89844567,0.0013004866,0.078664176,0.015985843,0.0005267377],"about_ca_topic_score_codex":0.0005361541,"about_ca_topic_score_gemma":0.00014284124,"teacher_disagreement_score":0.9768191,"about_ca_system_score_codex":0.000059239013,"about_ca_system_score_gemma":0.00023838771,"threshold_uncertainty_score":0.9998543},"labels":[],"label_agreement":null},{"id":"W4416236029","doi":"10.48550/arxiv.2511.09052","title":"Efficient Distributed Exact Subgraph Matching via GNN-PE: Load Balancing, Cache Optimization, and Query Plan Ranking","year":2025,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Scalability; Embedding; Pruning; Matching (statistics); Ranking (information retrieval); Load balancing (electrical power); Distributed algorithm; Reachability; Cache","score_opus":0.022663359718491795,"score_gpt":0.17274543669735554,"score_spread":0.15008207697886375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416236029","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.24407469,0.0002693264,0.7527884,0.00006559203,0.0013225302,0.000577987,0.00017486379,0.00027339536,0.00045317938],"genre_scores_gemma":[0.99464524,0.00034997583,0.0041290624,0.00012992798,0.000099199766,0.0000024195858,0.00012400156,0.00003144187,0.00048873934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940527,0.00085762993,0.00074506097,0.0028840578,0.00035149965,0.0011090599],"domain_scores_gemma":[0.99580264,0.00058210554,0.00077827845,0.0017870424,0.00053703936,0.00051289314],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015991093,0.0010475037,0.001005052,0.00082148187,0.0014291066,0.000588419,0.0024318688,0.00064897834,0.00008519068],"category_scores_gemma":[0.000086546475,0.0012577869,0.0005045174,0.0027352169,0.0005018955,0.0004615824,0.0030440767,0.0014523554,0.000019657622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011556066,0.00017727488,0.0034682234,0.0002675392,0.0002914356,0.00042863406,0.0014787706,0.93584836,0.000043319193,0.057232738,0.000024964898,0.000623214],"study_design_scores_gemma":[0.0014728863,0.000069185095,0.0010217038,0.0008239401,0.0003295508,0.000040293697,0.00035313127,0.97162867,0.00017669279,0.02278801,0.00009612406,0.0011998037],"about_ca_topic_score_codex":0.0006576141,"about_ca_topic_score_gemma":0.000053080446,"teacher_disagreement_score":0.75057054,"about_ca_system_score_codex":0.00053000066,"about_ca_system_score_gemma":0.0006572731,"threshold_uncertainty_score":0.9998709},"labels":[],"label_agreement":null},{"id":"W4416371776","doi":"10.2316/j.2026.206-1312","title":"GRAPH COLLABORATIVE GUIDED SESSION-BASED RECOMMENDATION. 368-382","year":2025,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph; Matching (statistics); Recommender system; Context (archaeology)","score_opus":0.009506109429260369,"score_gpt":0.2881235341783957,"score_spread":0.2786174247491353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416371776","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.00587201,0.000078223966,0.9778248,0.013769836,0.0017075795,0.00005554086,0.0000044204257,0.000027350801,0.00066023803],"genre_scores_gemma":[0.8565621,0.000060890936,0.14216828,0.0010307068,0.00008075192,0.0000020131442,0.000009812831,0.0000036247113,0.0000818437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910307,0.00008580521,0.00038805493,0.0001074706,0.00024108651,0.0000745363],"domain_scores_gemma":[0.99843746,0.00017073585,0.00035307836,0.00008228852,0.000914664,0.00004177075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004469038,0.00008219883,0.00011825825,0.00042955234,0.000092716684,0.00023928672,0.000397157,0.00004006097,0.000013403612],"category_scores_gemma":[0.00011499005,0.000069523114,0.000057400415,0.00036312622,0.000032056843,0.0005527205,0.00005896717,0.000099696845,0.0000017609908],"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.00006829216,0.00030531932,0.0017991465,0.000025144685,0.00033277966,0.00003736582,0.00061843323,0.08831534,0.0016200339,0.64898384,0.006770872,0.25112343],"study_design_scores_gemma":[0.001793283,0.00012859632,0.008676617,0.00032856825,0.000029252387,0.00005123084,0.00013578968,0.77663326,0.0041717156,0.20391497,0.0039461423,0.00019057105],"about_ca_topic_score_codex":0.0000014046634,"about_ca_topic_score_gemma":6.36728e-7,"teacher_disagreement_score":0.85069007,"about_ca_system_score_codex":0.00004221159,"about_ca_system_score_gemma":0.00015503266,"threshold_uncertainty_score":0.28350705},"labels":[],"label_agreement":null},{"id":"W4416429943","doi":"10.1109/iiswc66894.2025.00030","title":"ALPHA-PIM: Analysis of Linear Algebraic Processing for High-Performance Graph Applications on a Real Processing-In-Memory System","year":2025,"lang":"","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Leverage (statistics); Graph; Wait-for graph; Computation; Graph algorithms; Graph partition; Bottleneck; Data-flow analysis","score_opus":0.009859340040570338,"score_gpt":0.26088324783690653,"score_spread":0.2510239077963362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416429943","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.13477138,0.00075801776,0.8584534,0.00024625877,0.00024607408,0.0016844731,0.000039304305,0.00022534851,0.0035757795],"genre_scores_gemma":[0.9802003,0.00007513926,0.017813371,0.0001769748,0.00007723038,0.00078391854,0.000028274013,0.0000223598,0.000822458],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588114,0.00014014177,0.0014358247,0.0013338987,0.00048656398,0.0007224265],"domain_scores_gemma":[0.9972339,0.00022191243,0.00067404896,0.0011098818,0.0006233014,0.00013693186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014063733,0.00049491687,0.0010832235,0.0028828257,0.0007668577,0.00022558024,0.001563652,0.0002441394,0.000007135197],"category_scores_gemma":[0.000023835128,0.0004590613,0.0003717107,0.014122593,0.00030865837,0.0006997637,0.00019689217,0.00031996003,0.000006570035],"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.00021965003,0.0011367534,0.0013889597,0.0064745587,0.0006483706,0.0000040679583,0.0016346531,0.021149892,0.0007516146,0.31111127,0.0000226146,0.6554576],"study_design_scores_gemma":[0.001048862,0.00029803568,0.006963259,0.0011890832,0.0010500691,0.0000018218142,0.00059730606,0.9765136,0.008235139,0.0035876187,0.000037933278,0.00047723885],"about_ca_topic_score_codex":0.00006942312,"about_ca_topic_score_gemma":0.000028156584,"teacher_disagreement_score":0.95536375,"about_ca_system_score_codex":0.00012505516,"about_ca_system_score_gemma":0.0005939159,"threshold_uncertainty_score":0.99978614},"labels":[],"label_agreement":null},{"id":"W4416672590","doi":"10.1145/3776737","title":"Indexing Techniques for Graph Reachability Queries","year":2025,"lang":"en","type":"article","venue":"ACM Computing Surveys","topic":"Graph Theory 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":"University of Waterloo","funders":"","keywords":"Reachability; Search engine indexing; Graph database; Graph; Modular decomposition","score_opus":0.018208770502163647,"score_gpt":0.29134052814656897,"score_spread":0.27313175764440534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416672590","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.027658356,0.00008276865,0.9687124,0.00061088026,0.0006165713,0.00029852422,0.0000039890315,0.00079595076,0.0012205542],"genre_scores_gemma":[0.74546415,0.000002116959,0.2540419,0.00026156259,0.00004941595,0.000017806977,0.0000053677863,0.0000071862046,0.00015045461],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979815,0.00066902064,0.0003130821,0.00051591947,0.00012698799,0.00039353003],"domain_scores_gemma":[0.9968364,0.0017240712,0.000097311495,0.0011194646,0.00017286293,0.000049845206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067339814,0.00017142021,0.00024125917,0.00020907378,0.00041648446,0.00017100695,0.0015914616,0.00008808299,0.0000013277162],"category_scores_gemma":[0.0011341302,0.00016643525,0.00013878504,0.0008029533,0.000120389115,0.00024130585,0.0007963917,0.00017089881,0.0000017826272],"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.000005224584,0.00007507902,0.016875971,0.00008304504,0.000038857375,0.0000020435723,0.00047973252,0.000033918463,0.0003311045,0.3597578,0.00050570146,0.6218115],"study_design_scores_gemma":[0.0002987464,0.00011307812,0.04598604,0.00015369091,0.000008404688,0.00000430515,0.00005570243,0.0129726855,0.013547333,0.92278725,0.0036830257,0.0003897458],"about_ca_topic_score_codex":0.000076524404,"about_ca_topic_score_gemma":0.000019271336,"teacher_disagreement_score":0.7178058,"about_ca_system_score_codex":0.000029290464,"about_ca_system_score_gemma":0.0000711151,"threshold_uncertainty_score":0.67870325},"labels":[],"label_agreement":null},{"id":"W4416714820","doi":"10.1073/pnas.2526595122","title":"Stochastically evolving graphs via edit semigroups","year":2025,"lang":"en","type":"article","venue":"Proceedings of the National Academy of Sciences","topic":"Graph Theory 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":"Random walk; Random graph; Hyperplane; Stochastic matrix; Eigenvalues and eigenvectors; Simple (philosophy); Graph; Stochastic process","score_opus":0.016380349607007523,"score_gpt":0.2747454819103273,"score_spread":0.2583651323033198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416714820","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.6839892,0.0017490417,0.10494042,0.050408144,0.0013124851,0.0015357753,0.000032051164,0.00042616637,0.15560667],"genre_scores_gemma":[0.9829566,0.0000046723408,0.016336726,0.00051421876,0.00003891863,0.000006789075,1.7924725e-8,0.0000014656392,0.00014058728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982553,0.000007962416,0.00029384939,0.0002963549,0.00096484454,0.00018168574],"domain_scores_gemma":[0.99912846,0.00024054007,0.00023711676,0.000013786445,0.00034667412,0.00003340907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017668062,0.00009317921,0.00013554418,0.00030990827,0.00030377286,0.00006419581,0.0024506536,0.00006633284,0.000005657906],"category_scores_gemma":[0.00051901967,0.00006324966,0.00009842288,0.0021197326,0.0007882914,0.0008575841,0.00043085736,0.00017872383,0.0000012356753],"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.0000021056612,0.000027915303,0.00075285713,0.000021190954,0.000010058872,3.4853453e-9,0.000099750796,0.000057547833,0.055215444,0.94207954,0.0006151642,0.0011184354],"study_design_scores_gemma":[0.00009211148,0.000027225728,0.016032435,0.00010396444,0.0000058499672,0.000003982113,0.000039070932,0.024309805,0.0624619,0.8967856,0.000067485,0.000070561015],"about_ca_topic_score_codex":0.0000015796113,"about_ca_topic_score_gemma":1.3924899e-8,"teacher_disagreement_score":0.29896736,"about_ca_system_score_codex":0.000017350996,"about_ca_system_score_gemma":0.000040200743,"threshold_uncertainty_score":0.45539647},"labels":[],"label_agreement":null},{"id":"W4417127346","doi":"10.3390/software4040033","title":"Graph Generalization for Software Engineering","year":2025,"lang":"en","type":"article","venue":"Software","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"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 Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Generalization; Scalability; Class (philosophy); Software; Syntax; Simple (philosophy); Graph","score_opus":0.006684026980776802,"score_gpt":0.22303742345295757,"score_spread":0.21635339647218077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417127346","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.0020751015,0.00026899064,0.99592096,0.00012585067,0.00079728937,0.00016159644,0.000008700283,0.00062177546,0.000019752148],"genre_scores_gemma":[0.048594512,0.000010334757,0.9495239,0.0007546659,0.00008592349,0.000115900606,0.00002914646,0.000015673088,0.000869941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934274,0.00001396685,0.00012128208,0.00024508376,0.00007768244,0.00019922465],"domain_scores_gemma":[0.99941593,0.00013311706,0.000026689942,0.00030597474,0.00008063234,0.000037625672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013024596,0.00010233805,0.00009860878,0.00016066841,0.00013692066,0.000080425554,0.00043296078,0.000053689004,0.0000038884305],"category_scores_gemma":[0.00023535478,0.00010238703,0.00008778013,0.0005285573,0.00001300436,0.00022380981,0.00008625273,0.00005273362,0.0000049286828],"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.000007129129,0.00005221387,0.005020265,0.00020533652,0.000064501095,0.000005003813,0.00036289138,0.0099096345,0.0002821877,0.8696282,0.004468093,0.10999453],"study_design_scores_gemma":[0.0018885061,0.00016581653,0.01016752,0.00032237146,0.00005534179,0.000012213069,0.000034542525,0.10397444,0.015360362,0.79519755,0.07170068,0.0011206577],"about_ca_topic_score_codex":0.0000016950817,"about_ca_topic_score_gemma":7.725083e-7,"teacher_disagreement_score":0.108873874,"about_ca_system_score_codex":0.000014517433,"about_ca_system_score_gemma":0.000031335898,"threshold_uncertainty_score":0.4175222},"labels":[],"label_agreement":null},{"id":"W6889603890","doi":"10.26181/29389490.v1","title":"The Looking Glass. Vol. 15 No. 2 (2011)","year":2011,"lang":"en","type":"article","venue":"Figshare","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"George (robot); Poetry; Period (music)","score_opus":0.030882089293204424,"score_gpt":0.21309771506708147,"score_spread":0.18221562577387704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6889603890","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018584181,0.00863786,0.019882131,0.0010777679,0.0158265,0.0024766366,0.06880044,0.0048858114,0.8765544],"genre_scores_gemma":[0.8920676,0.000046976507,0.03793173,0.0066962764,0.0042228326,0.0012644837,0.011121094,0.00020451334,0.046444494],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992369,0.00004345555,0.00010424634,0.00021481508,0.00014153407,0.00025904475],"domain_scores_gemma":[0.99905705,0.00011375481,0.000059268237,0.000528892,0.00017409946,0.00006694312],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00010641332,0.000095120056,0.00006478606,0.000026483096,0.0002842811,0.00012834714,0.0012294018,0.000041375206,0.0400416],"category_scores_gemma":[0.00030425278,0.00006409331,0.00006502199,0.000110130335,0.000010763644,0.00029224256,0.00031060056,0.00012535704,0.02130368],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057528227,0.0000405264,0.000041531745,0.000024843728,0.000024817231,0.000049816543,0.0010136798,0.0000016516262,0.000020349571,0.021364085,0.9038378,0.07357513],"study_design_scores_gemma":[0.0002028157,0.00008803608,0.00323311,0.00025390284,0.0000032433072,0.000017229433,0.00003246823,0.007691547,0.0025073579,0.027625732,0.95800495,0.00033961254],"about_ca_topic_score_codex":0.0000028228565,"about_ca_topic_score_gemma":0.000002321012,"teacher_disagreement_score":0.8902092,"about_ca_system_score_codex":0.0000075302178,"about_ca_system_score_gemma":0.000025950529,"threshold_uncertainty_score":0.97945833},"labels":[],"label_agreement":null},{"id":"W6892295760","doi":"10.5167/uzh-120510","title":"Workload Scheduling in Distributed Stream Processors using Graph Partitioning","year":2015,"lang":"en","type":"article","venue":"Zurich Open Repository and Archive (University of Zurich)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Graph partition; Workload; Scheduling (production processes); Implementation; Stream processing; Network topology; Graph; Space partitioning; Server; Distributed algorithm","score_opus":0.026545655281185604,"score_gpt":0.22844126488410457,"score_spread":0.20189560960291897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6892295760","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.64389926,0.00016357329,0.35404173,0.000059604645,0.00008253915,0.00016116309,0.000008205188,0.000034848945,0.0015490875],"genre_scores_gemma":[0.9092533,0.000017506323,0.09061601,0.0000139649455,0.000016355501,5.48093e-7,0.0000070547994,0.000005002243,0.000070237526],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986188,0.00039833147,0.00016255712,0.00039898616,0.00017721759,0.00024411635],"domain_scores_gemma":[0.99912685,0.00015631325,0.00017805316,0.0002651793,0.000085101135,0.00018848562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072901504,0.00013470951,0.00023816442,0.00019649687,0.00041715143,0.00014392279,0.00090194645,0.000049963022,0.0000026761793],"category_scores_gemma":[0.000031201474,0.00015552795,0.000050455885,0.000713616,0.00018322092,0.001241735,0.00075771933,0.00017623018,0.0000018398337],"study_design_candidate":"observational","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.0015102025,0.0032716156,0.51819235,0.00057855935,0.00069767644,0.0038341677,0.081404895,0.121026404,0.02188811,0.21380484,0.0014747161,0.03231644],"study_design_scores_gemma":[0.008940471,0.0011177771,0.13366231,0.0022440625,0.00020656535,0.0004918873,0.032217726,0.4911817,0.005915579,0.3202547,0.0014374417,0.0023297693],"about_ca_topic_score_codex":0.00036356042,"about_ca_topic_score_gemma":0.00003864281,"teacher_disagreement_score":0.38453007,"about_ca_system_score_codex":0.00002803943,"about_ca_system_score_gemma":0.00011301515,"threshold_uncertainty_score":0.6342246},"labels":[],"label_agreement":null},{"id":"W6906516905","doi":"10.16908/rds-essentiels/55","title":"Valeur clinique et économique des systèmes de gestion de l’information et de déploiement du dossier électronique du patient (DEP) en Suisse","year":2024,"lang":"fr","type":"report","venue":"SERVAL (Université de Lausanne)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Limiting; Context (archaeology); Homogeneous","score_opus":0.019936732750157636,"score_gpt":0.22571558395631977,"score_spread":0.20577885120616213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6906516905","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.67983305,0.0016102982,0.30138636,0.00573562,0.0010458468,0.0008890739,0.0001902907,0.0005143708,0.008795104],"genre_scores_gemma":[0.8717397,0.03257533,0.07474221,0.0053617028,0.0009560473,0.0001933241,0.0007944924,0.00022259788,0.013414604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99485564,0.001986919,0.00072836457,0.00077121827,0.00038808543,0.0012697682],"domain_scores_gemma":[0.99700207,0.000609085,0.00061921554,0.00067158847,0.00050734694,0.0005906889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005235541,0.00071284873,0.00063653727,0.0005200895,0.00061081763,0.00059291424,0.0011112806,0.0009872774,0.0001566576],"category_scores_gemma":[0.00025207942,0.0008198022,0.00054194627,0.000686047,0.00021042977,0.0024417208,0.0010340073,0.0014129168,0.00012644615],"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":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004406902,0.00059752836,0.023215093,0.0033965185,0.0011759683,0.0043214276,0.11113741,0.025982393,0.0010688315,0.6917179,0.0068491385,0.13009706],"study_design_scores_gemma":[0.0019151075,0.0023479373,0.12384252,0.006766917,0.001326916,0.008999685,0.0033032869,0.24511838,0.0066055837,0.34242272,0.25403512,0.0033158248],"about_ca_topic_score_codex":0.004165784,"about_ca_topic_score_gemma":0.001669959,"teacher_disagreement_score":0.34929523,"about_ca_system_score_codex":0.008083363,"about_ca_system_score_gemma":0.004286867,"threshold_uncertainty_score":0.9994253},"labels":[],"label_agreement":null},{"id":"W6912282828","doi":"10.5281/zenodo.16591808","title":"kraina-ai/quackosm: 0.16.0","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph Theory 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":"Workplace Health, Safety and Compensation Commission","funders":"","keywords":"Row; Sorting; Scale (ratio); Table (database); Process (computing)","score_opus":0.01768147368826879,"score_gpt":0.23812412655010062,"score_spread":0.22044265286183184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6912282828","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010833656,0.0002084406,0.2430504,0.0007364379,0.0003032282,0.00028072443,0.00014715905,0.0022686138,0.7530039],"genre_scores_gemma":[0.002020135,0.00021253753,0.0037905793,0.0011548953,0.00045391486,7.701384e-8,0.0011700327,0.0063003586,0.9848975],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977495,0.0004423887,0.00022815268,0.0007294841,0.00039952667,0.00045092186],"domain_scores_gemma":[0.9982163,0.000023890336,0.00014499965,0.0011576543,0.00028364453,0.00017356695],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000587775,0.00026268567,0.00024970484,0.0006825921,0.001181758,0.0012522376,0.0036233698,0.00017937395,0.028326306],"category_scores_gemma":[0.0002556225,0.00027482034,0.00010890968,0.0009906022,0.00016603374,0.00020700252,0.0026030643,0.0004556158,0.017320573],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003511961,0.00004998039,6.263239e-8,0.000050952865,0.00004139312,0.000015436479,0.00012781576,0.0000018687074,0.000023609242,0.1945815,0.6963708,0.10873309],"study_design_scores_gemma":[0.00026445437,0.00008881464,0.0000060178227,0.000109651926,0.000011677849,0.00003911196,0.000027309721,0.0002612996,0.000056999488,0.007203731,0.9916534,0.0002775558],"about_ca_topic_score_codex":0.000022890383,"about_ca_topic_score_gemma":3.7626188e-7,"teacher_disagreement_score":0.29528257,"about_ca_system_score_codex":0.00009881394,"about_ca_system_score_gemma":0.000010336641,"threshold_uncertainty_score":0.9999704},"labels":[],"label_agreement":null},{"id":"W6926318492","doi":"10.24443/usi-arc-bib_fcor.5670","title":"Saguenay","year":2005,"lang":"de","type":"other","venue":"USI-Biblioteca","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Period (music); Subject (documents); Context (archaeology); Government (linguistics)","score_opus":0.0123578284361766,"score_gpt":0.23938159081013374,"score_spread":0.22702376237395713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926318492","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023423272,0.0223301,0.20675407,0.002531002,0.010097464,0.00096689496,0.00010421722,0.0011203808,0.75586164],"genre_scores_gemma":[0.0030465168,0.0038294028,0.019423582,0.0028948886,0.0078105866,0.000041133837,0.000044713746,0.00049810304,0.96241105],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948141,0.00034985575,0.0007289461,0.0017190826,0.0010160523,0.0013719508],"domain_scores_gemma":[0.99607074,0.00018633693,0.0005391143,0.002525408,0.00014232613,0.0005360714],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00088265236,0.0010408122,0.0009283735,0.008064524,0.00040038695,0.0010562197,0.003677467,0.0011651516,0.03533782],"category_scores_gemma":[0.0000670344,0.0009936361,0.00059964857,0.010547314,0.00040107788,0.0005995612,0.0009264784,0.0013220523,0.041594695],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029148834,0.00052358204,0.00006944023,0.00017804619,0.00045432843,0.0004160597,0.000970048,0.00014742922,0.00029892114,0.10998971,0.5182518,0.36867154],"study_design_scores_gemma":[0.0006663291,0.00016384156,0.000288708,0.00044113642,0.0000911568,0.00006755262,0.000015837548,0.0055825617,0.0004418529,0.0046745306,0.9862752,0.0012913011],"about_ca_topic_score_codex":0.00009184973,"about_ca_topic_score_gemma":0.000053974836,"teacher_disagreement_score":0.46802345,"about_ca_system_score_codex":0.00007865445,"about_ca_system_score_gemma":0.0002540356,"threshold_uncertainty_score":0.9999808},"labels":[],"label_agreement":null},{"id":"W6930230448","doi":"10.5281/zenodo.12359983","title":"The long tail pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Long tail; Boom; Product (mathematics); Supply and demand; Mainstream; Niche market; Service (business); Entertainment","score_opus":0.017970079753521592,"score_gpt":0.22711163754338864,"score_spread":0.20914155778986704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930230448","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018142836,0.0010487344,0.04787662,0.000796367,0.0005798898,0.00026098176,0.00004764219,0.0018661362,0.9475218],"genre_scores_gemma":[0.00064345443,0.00029767302,0.00048471926,0.00012434105,0.00039112396,4.377476e-8,0.00017620176,0.004927562,0.9929549],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982229,0.00031736726,0.00017233021,0.0005283202,0.00038200032,0.00037712173],"domain_scores_gemma":[0.9986741,0.000024116553,0.00009802326,0.0009434591,0.00013131194,0.00012897865],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007513297,0.00018812124,0.00013161679,0.00026185578,0.0014273274,0.0026802816,0.0033285425,0.000103071,0.020836089],"category_scores_gemma":[0.00014766415,0.00014715413,0.00008560534,0.0006944029,0.00020879928,0.00012967296,0.0023242834,0.0004212568,0.20042793],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021308617,0.000016974693,2.896092e-8,0.00003768975,0.000043295968,0.000030929543,0.00016947833,9.741105e-7,0.0000132892255,0.078645416,0.8233879,0.09765188],"study_design_scores_gemma":[0.0000928824,0.000058044705,0.000004049517,0.000080946906,0.000009113869,0.00008180884,0.00003511901,0.00031207755,0.000021844951,0.0051259818,0.9940013,0.00017682563],"about_ca_topic_score_codex":0.000005610817,"about_ca_topic_score_gemma":4.584356e-7,"teacher_disagreement_score":0.17959183,"about_ca_system_score_codex":0.000046923546,"about_ca_system_score_gemma":0.0000036569488,"threshold_uncertainty_score":0.9998727},"labels":[],"label_agreement":null},{"id":"W6930793289","doi":"10.5281/zenodo.14838283","title":"TCR/CAR antagonism: theoretical modeling","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph Theory 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":"Mila - Quebec Artificial Intelligence Institute; Université de Montréal; McGill University","funders":"","keywords":"Mathematical model; Fuzzy logic; Code (set theory); Source code; Set (abstract data type); Estimation theory; Data modeling","score_opus":0.01895013855419467,"score_gpt":0.23539772899944772,"score_spread":0.21644759044525305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930793289","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004049345,0.00011471254,0.429895,0.00031917193,0.00021438028,0.00019316141,0.00010891327,0.0015053969,0.5676452],"genre_scores_gemma":[0.090152636,0.001772861,0.03937084,0.0025448867,0.0025158168,3.4706247e-7,0.005197314,0.03091966,0.8275256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99785584,0.00041878456,0.00022336934,0.00068765046,0.00038592363,0.00042842486],"domain_scores_gemma":[0.9985244,0.000022598724,0.00008994345,0.00097061926,0.00022749818,0.00016493829],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006126751,0.0002413283,0.00023481279,0.00050650176,0.0011108861,0.0010593245,0.0030558258,0.00017939422,0.01419211],"category_scores_gemma":[0.00021249906,0.00024244786,0.00010007182,0.0006441529,0.00023873892,0.0001533157,0.0024326544,0.0004332914,0.0063801208],"study_design_candidate":"not_applicable","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.0000058610103,0.00005128904,2.596097e-8,0.000042818916,0.00004455453,0.000018870256,0.0001688244,0.00005174518,0.00007138586,0.7034488,0.247722,0.048373852],"study_design_scores_gemma":[0.00023966076,0.000071187045,4.761283e-7,0.0000994265,0.000014321456,0.000042889857,0.00003797593,0.032311387,0.00007503791,0.024592951,0.94224286,0.00027183653],"about_ca_topic_score_codex":0.000008624704,"about_ca_topic_score_gemma":5.0592316e-8,"teacher_disagreement_score":0.69452083,"about_ca_system_score_codex":0.00005535295,"about_ca_system_score_gemma":0.000008911642,"threshold_uncertainty_score":0.99997765},"labels":[],"label_agreement":null},{"id":"W6931895911","doi":"10.5683/sp3/wzkmff","title":"Hockey Lines","year":2025,"lang":"en","type":"dataset","venue":"Borealis","topic":"Graph Theory 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":"University of Calgary","funders":"","keywords":"Focus (optics); Line (geometry); Perspective (graphical); Ice hockey; Context (archaeology)","score_opus":0.010082939511071469,"score_gpt":0.25071378546380785,"score_spread":0.24063084595273637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931895911","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.02218415e-7,0.00032400442,0.0077877725,0.0004352067,0.00061400374,0.00008685599,0.99006736,0.000111017886,0.00057368877],"genre_scores_gemma":[2.9174117e-7,0.0002691876,0.0021523372,0.000829131,0.00013876753,0.00001987776,0.9961162,0.000002699754,0.0004714816],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890155,0.000071538656,0.00018969446,0.0004101227,0.0001991366,0.0002279781],"domain_scores_gemma":[0.9982103,0.00009441199,0.00008864366,0.0014705602,0.00006427358,0.00007179682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017963255,0.0002120326,0.00023834362,0.00020295905,0.00010002493,0.0001608308,0.0020996039,0.0001903797,0.000012566846],"category_scores_gemma":[0.00007097165,0.00018415955,0.00012386762,0.0003304877,0.000041756866,0.00012447918,0.00046869242,0.00023405085,0.000008418593],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011414801,0.00002565723,1.4768551e-7,0.000035896748,0.000021040385,0.00003922881,0.00001195154,0.0000010786047,3.049629e-7,0.0034824922,0.98984474,0.0065362947],"study_design_scores_gemma":[0.00007821111,0.000020738404,0.000011504795,0.000058958038,0.000017135253,0.0000057476755,0.0000018311283,0.000106273445,0.000022694105,0.009185116,0.9902956,0.00019621578],"about_ca_topic_score_codex":0.0021094917,"about_ca_topic_score_gemma":0.0007320197,"teacher_disagreement_score":0.006340079,"about_ca_system_score_codex":0.0000130099,"about_ca_system_score_gemma":0.00011216221,"threshold_uncertainty_score":0.75098085},"labels":[],"label_agreement":null},{"id":"W6931931760","doi":"10.5683/sp3/g2du0q","title":"Supplemental data for: Tracking the microbial communities from the farm to the processing facility of a washed-rind cheese operation","year":2024,"lang":"en","type":"dataset","venue":"Borealis","topic":"Graph Theory 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":"University of Guelph","funders":"","keywords":"Amplicon sequencing; Milking; Microbiome; 16S ribosomal RNA; Raw milk; Metagenomics; UniFrac; Water quality","score_opus":0.05467680138780816,"score_gpt":0.3033959839471344,"score_spread":0.24871918255932624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931931760","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033507624,0.00025741674,0.004886394,0.003219805,0.0002868397,0.00075097993,0.990229,0.000025883948,0.000008588232],"genre_scores_gemma":[0.0035512124,0.000029721728,0.000724688,0.0007141061,0.0002575306,0.000083569765,0.99462396,0.000008071484,0.0000071333766],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841857,0.00032576083,0.00036077652,0.00036755152,0.00029324638,0.00023408365],"domain_scores_gemma":[0.9964839,0.00035383957,0.0001362556,0.0029166949,0.0000787157,0.00003054511],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0015981675,0.00023375261,0.0002197496,0.000040350624,0.0007569899,0.00096841995,0.0066353893,0.00008287239,0.000018581759],"category_scores_gemma":[0.00006207334,0.000112719026,0.000094420335,0.00019766702,0.00020544956,0.0002747724,0.0020662805,0.000414671,0.0000070747287],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013331122,0.0000324266,0.0000023820758,0.000055374003,0.00005601898,0.000001041903,0.0054129283,0.000026363861,0.00004315375,0.00034595965,0.98208225,0.0119287465],"study_design_scores_gemma":[0.00014029318,0.00003458252,0.0000800697,0.00010631131,0.00008405017,0.0000057343696,0.0026005951,0.0025013504,0.00018284272,0.0009125815,0.9931969,0.00015466745],"about_ca_topic_score_codex":0.023767961,"about_ca_topic_score_gemma":0.104268014,"teacher_disagreement_score":0.08050005,"about_ca_system_score_codex":0.000025066187,"about_ca_system_score_gemma":0.00014220925,"threshold_uncertainty_score":0.9987392},"labels":[],"label_agreement":null},{"id":"W6945058138","doi":"10.25318/1310028901-fra","title":"Les comportements de santé des jeunes d'âge scolaire 2002, réponses des étudiants à la question : Ta famille possède-t-elle une voiture, une camionnette ou une fourgonnette?","year":2019,"lang":"fr","type":"dataset","venue":"Statistics Canada Dissemination","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Identity (music); Subject (documents); Laziness","score_opus":0.016991351053294287,"score_gpt":0.28815428113548724,"score_spread":0.27116293008219294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945058138","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013654807,0.0026518572,0.27346697,0.00075138017,0.0022966205,0.0010077056,0.7058786,0.00008637907,0.00020561968],"genre_scores_gemma":[0.28108746,0.0027596226,0.029325092,0.00030186205,0.0004338347,0.00014651746,0.68307906,0.00015814745,0.0027083692],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9940057,0.0011377137,0.0011399578,0.0011935271,0.0012755323,0.0012475823],"domain_scores_gemma":[0.99518657,0.0014746994,0.0010122041,0.001002505,0.0008256768,0.0004983438],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011834067,0.0010127098,0.0008600414,0.00039688646,0.0015852674,0.0005037871,0.0013016561,0.0004785817,0.00011775553],"category_scores_gemma":[0.00079145445,0.0011137677,0.00011747522,0.0018070631,0.00094718457,0.0007952707,0.00030947174,0.00074970844,0.000044628552],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005345628,0.00045673133,0.0024087983,0.0013648936,0.00024743393,0.00084713945,0.0007843181,0.0012011263,0.00017701912,0.023888344,0.9134949,0.05507586],"study_design_scores_gemma":[0.0029356985,0.001045665,0.6983512,0.009887324,0.0013408902,0.0007684249,0.006911991,0.055870667,0.0008310612,0.057826456,0.15910806,0.005122574],"about_ca_topic_score_codex":0.32451445,"about_ca_topic_score_gemma":0.7827413,"teacher_disagreement_score":0.75438684,"about_ca_system_score_codex":0.0010560178,"about_ca_system_score_gemma":0.0012638236,"threshold_uncertainty_score":0.99971455},"labels":[],"label_agreement":null},{"id":"W6945207838","doi":"10.25318/3610040401-eng","title":"Final demand categories, by commodity, M-level aggregation [1961 - 2008]","year":2019,"lang":"en","type":"dataset","venue":"Statistics Canada Dissemination","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Table (database); Commodity; Product (mathematics); Personal consumption expenditures price index; Personal income; Consumer expenditure","score_opus":0.015611944039595349,"score_gpt":0.25260098056992153,"score_spread":0.23698903653032619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945207838","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000050046524,0.00015358362,0.30735043,0.000098042896,0.0011994825,0.00020690651,0.6909558,0.000016639517,0.0000140816965],"genre_scores_gemma":[0.00040105885,0.00008407061,0.0037085845,0.00016091953,0.00007632134,0.000029711962,0.9943523,0.000016497368,0.0011705342],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99758685,0.00014969632,0.000428436,0.0005463792,0.0008978282,0.00039081683],"domain_scores_gemma":[0.9977963,0.00050620455,0.0004422338,0.0007868842,0.00030740877,0.00016097314],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032455154,0.00037134963,0.00033904886,0.00014346644,0.00028472845,0.00026507815,0.0011422562,0.00020419985,0.00009654508],"category_scores_gemma":[0.00022724777,0.0003993769,0.0000311559,0.0003789173,0.00006916804,0.00027862628,0.0001795383,0.00039589655,0.000027560409],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000411393,0.000040962343,0.0000043988075,0.00012637909,0.000025660382,0.000039603197,0.00002910447,0.00001936072,0.0000053702124,0.00570093,0.98581547,0.008188662],"study_design_scores_gemma":[0.0002875422,0.000088635425,0.00054998003,0.00013037641,0.000071252594,0.000024182427,0.00002850379,0.004449522,0.0002259036,0.009544119,0.98381853,0.00078145164],"about_ca_topic_score_codex":0.053073186,"about_ca_topic_score_gemma":0.23488905,"teacher_disagreement_score":0.30364186,"about_ca_system_score_codex":0.00030335624,"about_ca_system_score_gemma":0.0008448604,"threshold_uncertainty_score":0.9998458},"labels":[],"label_agreement":null},{"id":"W6945355333","doi":"10.25318/3310076601-fra","title":"Nombre d'entreprises canadiennes, avec employés, régions métropolitaines de recensement et subdivisions de recensement, décembre 2024","year":2025,"lang":"fr","type":"dataset","venue":"Statistics Canada Dissemination","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Subdivision; Census","score_opus":0.010245232904827784,"score_gpt":0.27727740500025755,"score_spread":0.2670321720954298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945355333","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029315674,0.000790887,0.16516902,0.005179154,0.0037316235,0.00063246326,0.82387835,0.00005577619,0.0002695577],"genre_scores_gemma":[0.0017995697,0.0027770423,0.025189852,0.001894381,0.00023964197,0.00018986683,0.9364808,0.000055473163,0.03137334],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9942986,0.00091446884,0.0010622895,0.0012441012,0.0008718763,0.0016087088],"domain_scores_gemma":[0.99416715,0.0020609044,0.0005912119,0.0013961323,0.00089974963,0.00088487443],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009236364,0.0008580055,0.0006716361,0.0004987992,0.001034901,0.0005162588,0.0015084539,0.00033227616,0.00036759328],"category_scores_gemma":[0.0021225407,0.0009932322,0.00012846742,0.0012696629,0.00025812798,0.0002858356,0.0005585036,0.00087640545,0.000008939748],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015087632,0.0002039259,0.000138763,0.0004372049,0.0001843453,0.0007853743,0.0006823054,0.00021541747,0.00002200291,0.12842107,0.85328376,0.015610772],"study_design_scores_gemma":[0.00036893308,0.00016337086,0.0047962843,0.0013544781,0.00047429057,0.00012371672,0.0010316538,0.008250556,0.00014133859,0.020958276,0.9611665,0.0011705832],"about_ca_topic_score_codex":0.5339683,"about_ca_topic_score_gemma":0.92840356,"teacher_disagreement_score":0.3944352,"about_ca_system_score_codex":0.0029586959,"about_ca_system_score_gemma":0.007959728,"threshold_uncertainty_score":0.9992518},"labels":[],"label_agreement":null},{"id":"W6945548839","doi":"10.25549/wpacards-m24737","title":"WPA block face card for household census of Twenty-Sixth Street in Los Angeles","year":2012,"lang":"en","type":"dataset","venue":"University of Southern California Digital Library","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Census; Block (permutation group theory); Face (sociological concept); Quarter (Canadian coin)","score_opus":0.011843914676097588,"score_gpt":0.17195780933983668,"score_spread":0.1601138946637391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945548839","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036694594,0.00016009262,0.0006433412,0.00002419024,0.00006436197,0.0002520911,0.9950055,0.00006608852,0.000114901835],"genre_scores_gemma":[0.00979669,0.000024738412,0.0011522125,0.000030675958,0.00006839787,5.127724e-7,0.9887729,0.000028414977,0.0001254263],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986889,0.000054344153,0.00026752887,0.00038122034,0.00025763878,0.0003504127],"domain_scores_gemma":[0.9987618,0.0001380793,0.00032554465,0.0005903639,0.000029562223,0.00015468447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000092718175,0.00028658326,0.00047285188,0.00031261815,0.00006219788,0.000061932034,0.0015336047,0.00023908642,0.000010802011],"category_scores_gemma":[0.000011996669,0.00029778946,0.0002808149,0.00031368138,0.00020602239,0.00052711193,0.00068816764,0.00021588175,0.000049522503],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106527325,0.00034895947,0.002188092,0.00036033697,0.00008566265,0.00004223368,0.00006776534,0.00006171766,0.0000030135936,0.00012772939,0.9953967,0.0012112882],"study_design_scores_gemma":[0.0006286518,0.00006634276,0.000030110421,0.00018489553,0.000045125482,0.000003463939,0.0007728306,0.00009004161,0.00009372262,0.0009853456,0.9967181,0.0003813829],"about_ca_topic_score_codex":0.00003966576,"about_ca_topic_score_gemma":0.0000132778,"teacher_disagreement_score":0.006232542,"about_ca_system_score_codex":0.000019335588,"about_ca_system_score_gemma":0.00009069453,"threshold_uncertainty_score":0.9999474},"labels":[],"label_agreement":null},{"id":"W6945887208","doi":"10.25547/dprw-w642","title":"NDRIO and the Canadian Digital Research Infrastructure Strategy","year":2024,"lang":"en","type":"article","venue":"Electronic Textual Cultures Lab","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Digital government; Government (linguistics); E-Government; Critical infrastructure; Federal budget; Key (lock); Public policy","score_opus":0.010676900448177096,"score_gpt":0.27907881293026277,"score_spread":0.26840191248208567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6945887208","genre_codex":"other","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.33356237,0.16626021,0.025350856,0.06468679,0.0025043092,0.004153283,0.00027659655,0.0026063556,0.40059924],"genre_scores_gemma":[0.99657094,0.00007030729,0.000055080905,0.00020504645,0.00015270342,0.000015729156,0.0000074800305,0.000008963393,0.0029137393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982347,0.00016307915,0.00011772628,0.00038818715,0.00032631433,0.000770012],"domain_scores_gemma":[0.9992731,0.00016568262,0.000012582609,0.00031280387,0.00007289999,0.00016289372],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00073879346,0.00014327103,0.00011285535,0.00013197595,0.0006147833,0.002543294,0.0008697026,0.00009905527,0.00003934399],"category_scores_gemma":[0.00005450245,0.00008106273,0.000055187542,0.00075036683,0.00040319387,0.0005503299,0.00016271217,0.0010093203,0.000062039064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005727381,0.0000028415075,0.0000060630923,0.0000053375725,0.000028952529,0.000023644025,0.0016560622,0.000020931197,0.000025385765,0.9500404,0.005834076,0.042350575],"study_design_scores_gemma":[0.00036109405,0.00015598886,0.0004482627,0.000020078453,0.0000063113457,0.00023410284,0.0004848172,0.0051022996,0.00011115626,0.6977782,0.29509035,0.00020729066],"about_ca_topic_score_codex":0.003132737,"about_ca_topic_score_gemma":0.040919475,"teacher_disagreement_score":0.6630086,"about_ca_system_score_codex":0.00015119227,"about_ca_system_score_gemma":0.0008419961,"threshold_uncertainty_score":0.9984922},"labels":[],"label_agreement":null},{"id":"W6947609304","doi":"10.3790/978-3-428-59368-2.2024.1446909","title":"Depicting and Remembering Prince Albert in the 21st Century – The Role of Youth and Germanness in the ITV Series “Victoria”","year":2025,"lang":"en","type":"book-chapter","venue":"DUNCKER UND HUMBLOT eBooks","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Series (stratigraphy); Narrative; Period (music)","score_opus":0.010189203321837412,"score_gpt":0.2106090106483628,"score_spread":0.20041980732652537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947609304","genre_codex":"other","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.030316042,0.0067500025,0.00015114891,0.00045453283,0.00080353,0.0012180702,0.000027308932,0.000065133194,0.96021426],"genre_scores_gemma":[0.9823144,0.0004531858,0.0003599576,0.0006171329,0.00025711846,0.00005827303,0.000007846465,0.000039362232,0.015892727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983822,0.00018160847,0.00039882236,0.00044251222,0.00031086066,0.0002839698],"domain_scores_gemma":[0.99850774,0.00048113838,0.00019973505,0.0007376101,0.000044619468,0.00002915149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001114725,0.00031441692,0.0003184678,0.00012848656,0.00029514343,0.0002460933,0.0011566717,0.00014419256,0.0000016572445],"category_scores_gemma":[0.000025040208,0.00017995536,0.000071789,0.00007338772,0.00030926388,0.00014543942,0.0005242138,0.0005930177,7.591925e-7],"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.0000129252485,0.000010349181,0.00031280058,0.000058828246,0.00003334678,0.000014401831,0.03717891,0.000002002305,0.000017898532,0.94534355,0.0000031263703,0.017011829],"study_design_scores_gemma":[0.0012998142,0.00020441231,0.0050525228,0.002207869,0.00027206773,0.00018264605,0.021006241,0.00050249585,0.0005713617,0.577976,0.38930586,0.0014187343],"about_ca_topic_score_codex":0.000089230736,"about_ca_topic_score_gemma":0.0004716617,"teacher_disagreement_score":0.95199835,"about_ca_system_score_codex":0.000016073625,"about_ca_system_score_gemma":0.000056994853,"threshold_uncertainty_score":0.73383665},"labels":[],"label_agreement":null},{"id":"W6948062435","doi":"10.48550/arxiv.astro-ph/0508416","title":"C^2-Ray: A new method for photon-conserving transport of ionizing radiation","year":2005,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Theory 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":"Canadian Institute for Theoretical Astrophysics","funders":"","keywords":"Ionization; Opacity; Photon; Radiative transfer; Ionizing radiation; Position (finance); Coupling (piping)","score_opus":0.06022621991467315,"score_gpt":0.2158275664557779,"score_spread":0.15560134654110475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948062435","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.03902638,0.00011070264,0.95917875,0.000097778444,0.00052644766,0.00039654245,0.00002212414,0.00013353636,0.0005077421],"genre_scores_gemma":[0.8013115,0.000078290286,0.19761905,0.000081006445,0.00014240801,0.0000013834898,0.000018415598,0.00001576793,0.00073218404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984648,0.00011669319,0.00026158767,0.0008031846,0.00007436041,0.0002793623],"domain_scores_gemma":[0.9983443,0.00022068451,0.000341027,0.0008067421,0.00014325182,0.00014396997],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057589286,0.0002481464,0.0003780745,0.00031244737,0.00012274511,0.000034851484,0.0013710269,0.00022885899,0.000019100979],"category_scores_gemma":[0.000036749105,0.0003015299,0.0003672796,0.00049466366,0.000041460058,0.00028553428,0.00029747744,0.00028271927,0.00000450546],"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.00009375069,0.00012906193,0.0009510949,0.00026050655,0.00024173464,0.000046823618,0.0016647312,0.38473013,0.000501898,0.5869333,0.00016621727,0.024280736],"study_design_scores_gemma":[0.000822659,0.000051366726,0.00081795803,0.00013264778,0.00012139009,0.0000022500171,0.00006443593,0.82943225,0.0031116947,0.1631837,0.0018559763,0.00040369623],"about_ca_topic_score_codex":0.00019154546,"about_ca_topic_score_gemma":0.000024722205,"teacher_disagreement_score":0.7622851,"about_ca_system_score_codex":0.00007825468,"about_ca_system_score_gemma":0.00031248142,"threshold_uncertainty_score":0.9999437},"labels":[],"label_agreement":null},{"id":"W6948111339","doi":"10.48550/arxiv.astro-ph/0107180","title":"PSR J1016-5857: a young radio pulsar with possible supernova remnant, X-ray, and gamma-ray associations","year":2001,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Graph Theory 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":"McGill University","funders":"","keywords":"Pulsar; Supernova remnant; Luminosity; Supernova; Egret; Pulsar planet; Millisecond pulsar; Binary pulsar","score_opus":0.037798961965754066,"score_gpt":0.17861262967939695,"score_spread":0.1408136677136429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948111339","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.55054504,0.0001985895,0.44226116,0.00020670488,0.000569139,0.00041886844,0.00007054191,0.00036010056,0.0053698295],"genre_scores_gemma":[0.98813957,0.0003914621,0.0049744896,0.00007487456,0.00011216479,0.0000019297213,0.000035174453,0.000031449676,0.0062388843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724734,0.00024465026,0.00026457736,0.001431759,0.00018975713,0.0006219224],"domain_scores_gemma":[0.997746,0.00014011895,0.00031188046,0.001281248,0.00023417728,0.00028657468],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000526194,0.00047655118,0.00052475266,0.00046020898,0.00049541285,0.00036325664,0.0016319746,0.00035557215,0.000033449604],"category_scores_gemma":[0.000036357527,0.00048214814,0.00019982985,0.0012737408,0.0002424188,0.00077365915,0.001128411,0.0008009342,0.0000463628],"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.00020664514,0.0008880013,0.20116648,0.00023438221,0.0014330818,0.0056826784,0.0047014444,0.09834967,0.00031046398,0.68312436,0.0010895283,0.00281324],"study_design_scores_gemma":[0.005907602,0.00079371216,0.15038264,0.00089721027,0.00093598705,0.00037732357,0.0010984069,0.5139981,0.0003257775,0.31750226,0.0029656368,0.004815345],"about_ca_topic_score_codex":0.00031290165,"about_ca_topic_score_gemma":0.00014040046,"teacher_disagreement_score":0.4375945,"about_ca_system_score_codex":0.00021570029,"about_ca_system_score_gemma":0.00025956886,"threshold_uncertainty_score":0.999763},"labels":[],"label_agreement":null},{"id":"W6948285476","doi":"10.5167/uzh-158132","title":"Peter Andreas Hochuli (1946–2018)","year":2018,"lang":"de","type":"article","venue":"Open MIND","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Geologist; Favourite; Herbarium; Magnum opus; Graduation (instrument); Curiosity; Natural history; White (mutation); Obituary","score_opus":0.0417234383430164,"score_gpt":0.2950196435213404,"score_spread":0.253296205178324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948285476","genre_codex":"other","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.37368593,0.0031485003,0.09741623,0.0035430393,0.029265124,0.0023532389,0.00021908892,0.000033788067,0.49033508],"genre_scores_gemma":[0.87029827,0.00005521671,0.089514025,0.00093034474,0.0031495993,0.000016891676,0.000019205016,0.0000418436,0.03597458],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99763423,0.00022037553,0.00033648615,0.0008996858,0.00030369806,0.0006055464],"domain_scores_gemma":[0.9981178,0.000086152184,0.00015820024,0.0012105473,0.00013757368,0.0002896993],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00093472993,0.00029082294,0.00031080426,0.00010590559,0.0004544778,0.0016423358,0.0030452975,0.00014214996,0.006951465],"category_scores_gemma":[0.00004212703,0.00026549638,0.000121516605,0.00051182765,0.0004756637,0.0010216215,0.0015460461,0.00022026211,0.038049027],"study_design_candidate":"not_applicable","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.00011048743,0.00037151785,0.00037693453,0.000010564602,0.0001887086,0.00021465073,0.009057675,0.000002177896,0.00073001185,0.0045060967,0.013097106,0.97133404],"study_design_scores_gemma":[0.0011769073,0.00091476145,0.0015008389,0.0001661625,0.00008800982,0.00006555586,0.00011378056,0.0055283415,0.014900769,0.008388714,0.9663996,0.0007565527],"about_ca_topic_score_codex":0.000023564298,"about_ca_topic_score_gemma":0.000020264375,"teacher_disagreement_score":0.97057754,"about_ca_system_score_codex":0.000024477076,"about_ca_system_score_gemma":0.00015646586,"threshold_uncertainty_score":0.99997973},"labels":[],"label_agreement":null},{"id":"W6948411362","doi":"10.5061/dryad.d2547d802","title":"Research Data Services in Academic Libraries: A Survey of North American Academic Libraries in 2019","year":2020,"lang":"en","type":"dataset","venue":"Open MIND","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Staffing; Academic library; Research data; Center (category theory); Information system; Information center; Survey data collection","score_opus":0.17913001171047582,"score_gpt":0.4000970666877546,"score_spread":0.22096705497727875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948411362","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017129602,0.00060557656,0.000036793408,0.00048685266,0.0001624541,0.0007133292,0.98081845,0.0000043366827,0.000042626078],"genre_scores_gemma":[0.001936515,0.0013743478,0.0037997805,0.00021564339,0.00007812481,0.00002705349,0.99248064,0.000022274184,0.000065598506],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99381846,0.0021172746,0.00097075914,0.0016011926,0.0007719287,0.00072041247],"domain_scores_gemma":[0.99481064,0.0016808498,0.00052576093,0.0026887949,0.00007468485,0.0002192906],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":["open_science"],"category_scores_codex":[0.004585084,0.00037171517,0.00095158454,0.00084724557,0.000096134216,0.0006546224,0.028931264,0.00034870426,0.000087542096],"category_scores_gemma":[0.00040273322,0.00035852412,0.00003396912,0.0062475195,0.0006340345,0.004454122,0.020609435,0.0040533654,0.00047370198],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017344208,0.00009200312,0.018991843,0.00014098981,0.000039687628,0.00011074711,0.0012875048,0.000016773312,0.000002399354,0.00007485509,0.93824506,0.04082471],"study_design_scores_gemma":[0.0006072171,0.00024615787,0.1586623,0.00065930886,0.000012540641,0.000006047795,0.00033958256,0.001918468,0.00008300094,0.0010763059,0.8356586,0.00073046965],"about_ca_topic_score_codex":0.011576746,"about_ca_topic_score_gemma":0.016521718,"teacher_disagreement_score":0.13967046,"about_ca_system_score_codex":0.00002637151,"about_ca_system_score_gemma":0.001302715,"threshold_uncertainty_score":0.9998867},"labels":[],"label_agreement":null},{"id":"W6948489945","doi":"10.5061/dryad.j2448","title":"Data from: Recent non-hybrid origin of sunflower ecotypes in a novel habitat","year":2012,"lang":"en","type":"dataset","venue":"Data Archiving and Networked Services (DANS)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"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 British Columbia","funders":"","keywords":"Ecotype; Gene flow; Local adaptation; Coalescent theory; Adaptation (eye); Context (archaeology); Population genomics; Population; Hybrid zone; Habitat","score_opus":0.03955566227948101,"score_gpt":0.2794999321691942,"score_spread":0.2399442698897132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948489945","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038854352,0.0016272903,0.012415667,0.00007391734,0.0012478561,0.00025901655,0.98038626,0.00004651945,0.000058025416],"genre_scores_gemma":[0.0009462999,0.0030974098,0.010834564,0.00022312005,0.0005324928,0.000010261311,0.9843122,0.000027846867,0.000015833662],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962491,0.00028314182,0.0007147885,0.001596012,0.00042198674,0.0007349951],"domain_scores_gemma":[0.9915347,0.00076444226,0.00044497682,0.0069779605,0.00003586579,0.00024201661],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0016368506,0.00055517966,0.0007758274,0.00027732152,0.00015983448,0.0002277647,0.012236788,0.00015331703,0.000058923808],"category_scores_gemma":[0.000025984204,0.00048832304,0.00004891194,0.0005207824,0.00014718465,0.0014034815,0.009480852,0.00073750975,0.000053217704],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001548409,0.0008296985,0.0025058528,0.0010277434,0.00038930058,0.00009587518,0.0013245974,0.0002148708,0.000099972895,0.00011327472,0.9637044,0.029539572],"study_design_scores_gemma":[0.00058645615,0.00004894819,0.0030774623,0.001219455,0.00012184925,0.000021913662,0.00004931394,0.16594572,0.0000101487685,0.0009592055,0.8272682,0.00069130794],"about_ca_topic_score_codex":0.00259934,"about_ca_topic_score_gemma":0.011446654,"teacher_disagreement_score":0.16573086,"about_ca_system_score_codex":0.000022029119,"about_ca_system_score_gemma":0.00013365857,"threshold_uncertainty_score":0.9997568},"labels":[],"label_agreement":null},{"id":"W6948524800","doi":"10.48660/15080018","title":"TianNu: simulating the neutrino sky","year":2015,"lang":"en","type":"other","venue":"PIRSA","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Institute for Theoretical Astrophysics","funders":"","keywords":"Sky; Neutrino; Neutrino oscillation; Noise (video); Neutrino detector","score_opus":0.018351189461938276,"score_gpt":0.24829948412830333,"score_spread":0.22994829466636504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948524800","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008177073,0.0009802964,0.022530252,0.00026616527,0.0011190784,0.00014700957,0.000009148322,0.0004092296,0.97453064],"genre_scores_gemma":[0.006605727,0.000017775154,0.004181899,0.0007735914,0.0012004304,0.000012412919,0.000008433101,0.00018251802,0.9870172],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990585,0.00008814003,0.000113714246,0.00028624572,0.00022514284,0.00022826884],"domain_scores_gemma":[0.99894494,0.000076627955,0.000113953625,0.0007659519,0.00002853417,0.0000700206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030721218,0.0001709365,0.00016159013,0.00008972128,0.00007413343,0.0001112103,0.0012489794,0.00011056358,0.00023479032],"category_scores_gemma":[0.000018348264,0.00011127543,0.000066510875,0.00027761146,0.000052664254,0.00006607612,0.00028041413,0.00021346837,0.0006352649],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011301588,0.000030582116,0.000018430195,0.000021090182,0.000043397144,0.000029689747,0.0007680353,0.000111361376,0.0000038969583,0.08314831,0.86779094,0.048033122],"study_design_scores_gemma":[0.00011576744,0.00001923613,0.000013211062,0.000043388318,0.0000071849818,0.000006079112,0.000012947004,0.004700659,0.000008676564,0.009565245,0.98533654,0.0001710927],"about_ca_topic_score_codex":0.000029664056,"about_ca_topic_score_gemma":0.00000927146,"teacher_disagreement_score":0.11754555,"about_ca_system_score_codex":0.0000104293285,"about_ca_system_score_gemma":0.000044878037,"threshold_uncertainty_score":0.8165257},"labels":[],"label_agreement":null},{"id":"W6948544913","doi":"10.5281/zenodo.10574298","title":"''Do you have time for a quick call?\": Exploring Remote and Hybrid Requirements Engineering Practices and Challenges in Industry","year":2024,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph Theory 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":"University of Victoria","funders":"","keywords":"Respondent; Requirements engineering; Demographics; Requirements analysis; Requirements elicitation; Replication (statistics)","score_opus":0.1268404410519051,"score_gpt":0.2854485614477179,"score_spread":0.15860812039581282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948544913","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064804433,0.015770001,0.007915591,0.007980723,0.0015012231,0.003787125,0.9513058,0.002428603,0.002830475],"genre_scores_gemma":[0.0062643844,0.054731064,0.013283431,0.00041318627,0.0020770016,0.0000033685933,0.916325,0.0055079036,0.0013946763],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981108,0.00018858789,0.00024914814,0.00078881823,0.0002864506,0.00037623307],"domain_scores_gemma":[0.9988903,0.00008216597,0.00018349374,0.00054699753,0.00013399102,0.00016307159],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013710269,0.00023453492,0.00022848372,0.00050173653,0.00048649914,0.0013945589,0.0010843682,0.00014272657,0.00013327457],"category_scores_gemma":[0.0008858152,0.0002506056,0.00003274886,0.00026899128,0.000068797846,0.0007762209,0.0023077696,0.0007292564,0.00062710734],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041891657,0.000080819445,3.099021e-7,0.0014159844,0.000110337176,0.00017912155,0.001130327,0.000030229769,0.00015608568,0.001280548,0.7852285,0.21034586],"study_design_scores_gemma":[0.00028585957,0.00018627133,0.000014085087,0.00034650115,0.000019496225,0.00016637289,0.00011561066,0.005824889,0.000041446932,0.00041136262,0.9923323,0.00025582055],"about_ca_topic_score_codex":0.00001009574,"about_ca_topic_score_gemma":4.1218843e-7,"teacher_disagreement_score":0.21009004,"about_ca_system_score_codex":0.0000719996,"about_ca_system_score_gemma":0.0000059628396,"threshold_uncertainty_score":0.99999464},"labels":[],"label_agreement":null},{"id":"W6948607829","doi":"10.5061/dryad.g0m5s","title":"Data from: Assessing models of speciation under different biogeographic scenarios; an empirical study using multi-locus and RNA-seq analyses","year":2015,"lang":"en","type":"dataset","venue":"Data Archiving and Networked Services (DANS)","topic":"Graph Theory 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":"Royal Ontario Museum","funders":"","keywords":"Gene flow; Genetic algorithm; Phylogeography; Phylogenetic tree; Taxon; Divergence (linguistics); Coalescent theory; Null model; Introgression","score_opus":0.24450049186076278,"score_gpt":0.40376619171886263,"score_spread":0.15926569985809985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948607829","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30149204,0.0010244236,0.09526317,0.000012922368,0.000297094,0.00027795526,0.6015708,0.000059355203,0.0000022721692],"genre_scores_gemma":[0.10917506,0.0005008277,0.011463373,0.000079203535,0.00034587827,0.0000040478085,0.8783991,0.000031214302,0.0000012995287],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947782,0.0012330691,0.00077494903,0.0020085133,0.00069167634,0.00051359704],"domain_scores_gemma":[0.9933325,0.00046169644,0.0006862494,0.005083408,0.00008512401,0.00035101754],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015048243,0.00063828134,0.000944752,0.00050688937,0.00048336832,0.0010425134,0.006084538,0.00019896729,0.0000035722899],"category_scores_gemma":[0.00001704582,0.0005166705,0.00005568464,0.0007044434,0.00020795218,0.0029549534,0.0077794828,0.00059521256,9.287268e-7],"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.0016083162,0.03720499,0.3323295,0.007214519,0.021091105,0.0014075874,0.058085315,0.18036027,0.00420926,0.00025088983,0.20440534,0.15183292],"study_design_scores_gemma":[0.00068549754,0.00011436709,0.015984174,0.0004985622,0.0005805262,0.00001084899,0.0010334613,0.9776107,0.0000021797027,0.0023533336,0.00054034166,0.00058602606],"about_ca_topic_score_codex":0.005677866,"about_ca_topic_score_gemma":0.012651848,"teacher_disagreement_score":0.7972504,"about_ca_system_score_codex":0.000023007851,"about_ca_system_score_gemma":0.00009548435,"threshold_uncertainty_score":0.9999945},"labels":[],"label_agreement":null},{"id":"W6948872065","doi":"10.5281/zenodo.10109463","title":"Fig. 4 in Repatriation of knowledge about insects and types through the DORSA virtual museum (Digital Orthoptera Specimen Access)","year":2005,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Repatriation; Scrolling; Orthoptera; Documentation; National museum; Las vegas","score_opus":0.022950471216979094,"score_gpt":0.2514726088638283,"score_spread":0.22852213764684917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948872065","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011909535,0.00087865785,0.015201323,0.00041326042,0.00024739167,0.0006448248,0.00020148695,0.0006061261,0.980616],"genre_scores_gemma":[0.82359403,0.002665301,0.0024628397,0.00034733868,0.0016520651,4.117974e-7,0.0014031994,0.0066105966,0.16126424],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855286,0.0002785355,0.00026339336,0.00042975773,0.0002446232,0.00023084573],"domain_scores_gemma":[0.99900097,0.00004085396,0.00021077077,0.000556119,0.00013328901,0.00005798795],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00041714212,0.00017263449,0.00019663833,0.0003294615,0.0003529325,0.00086787884,0.0016695592,0.0001052678,0.0032254152],"category_scores_gemma":[0.00019693765,0.00014426064,0.000047473004,0.0007190051,0.0001647736,0.00060503156,0.0016697984,0.00025713173,0.00083961536],"study_design_candidate":"not_applicable","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.000050174203,0.00030671497,0.000017587185,0.00013891814,0.000116802155,0.000020539786,0.009914593,0.000062273364,0.00007415433,0.104306936,0.26271802,0.62227327],"study_design_scores_gemma":[0.00036530162,0.0001223645,0.00044257863,0.000108093736,0.0000066056964,0.000022046375,0.000057484154,0.0005142002,0.00003607343,0.00064242247,0.99751514,0.0001676735],"about_ca_topic_score_codex":0.000020562466,"about_ca_topic_score_gemma":0.000003225154,"teacher_disagreement_score":0.8224031,"about_ca_system_score_codex":0.00004324091,"about_ca_system_score_gemma":0.000008009738,"threshold_uncertainty_score":0.99993837},"labels":[],"label_agreement":null},{"id":"W6948978757","doi":"10.5281/zenodo.12044324","title":"sing we the song of emmanuel pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Irish; Download; Performance art; Sheet music; Popular music; Love song","score_opus":0.025868508394478157,"score_gpt":0.23297550887426316,"score_spread":0.207107000479785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948978757","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008573663,0.0009787496,0.047633033,0.00089594774,0.0003587488,0.0002631566,0.000072841176,0.0009176726,0.94887125],"genre_scores_gemma":[0.008180887,0.000518653,0.0026296633,0.0001937563,0.0006142831,5.8709315e-8,0.00023111908,0.007964413,0.9796672],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984762,0.00030116856,0.00019191769,0.00041594074,0.0003522196,0.0002625263],"domain_scores_gemma":[0.99885476,0.000021603833,0.00013949872,0.0007819383,0.00012646863,0.00007571609],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006406962,0.00016145238,0.00016139263,0.00033074935,0.0005582155,0.0008049632,0.0025536595,0.00008733225,0.016080374],"category_scores_gemma":[0.00010586338,0.00012795438,0.000089323956,0.0007117524,0.00020819005,0.00012027299,0.0018886297,0.00034054377,0.036953125],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033379224,0.000031743126,3.7016946e-8,0.00013852006,0.000056935074,0.000015238892,0.00089268264,0.0000043984073,0.00014255077,0.07599839,0.84037685,0.08233932],"study_design_scores_gemma":[0.000089618574,0.00007417254,0.0000026051632,0.00020481825,0.000013755611,0.00005095976,0.000099393576,0.00057994865,0.00009318837,0.0062828464,0.9923702,0.00013851815],"about_ca_topic_score_codex":0.0000076241035,"about_ca_topic_score_gemma":1.8448661e-7,"teacher_disagreement_score":0.15199332,"about_ca_system_score_codex":0.000029194158,"about_ca_system_score_gemma":0.0000036296562,"threshold_uncertainty_score":0.98481905},"labels":[],"label_agreement":null},{"id":"W6949035854","doi":"10.5281/zenodo.11566905","title":"+27640409447.,.,; THE 3 IN 1 SSD CHEMICAL SOLUTIONS AND ACTIVATION POWDER FOR CLEANING OF BLACK NOTES","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Chemical industry; Chemical products; Chemical laboratory; Chemical safety; Organic chemicals; Euros; China","score_opus":0.03597890376077885,"score_gpt":0.24761588826533767,"score_spread":0.2116369845045588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949035854","genre_codex":"other","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.0015189383,0.00092024973,0.4373022,0.00555996,0.00046790406,0.0024836205,0.000505016,0.0020519434,0.54919016],"genre_scores_gemma":[0.85530084,0.000599447,0.01595655,0.0007023506,0.0013281018,0.0000013593574,0.0015866855,0.015459087,0.109065585],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887544,0.0001443831,0.00018312474,0.00037271032,0.00018605961,0.00023829873],"domain_scores_gemma":[0.9992946,0.00007127674,0.00010439905,0.0003664234,0.00011289326,0.00005041812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006171753,0.00012987074,0.00014265522,0.00029885306,0.00030243682,0.0003552083,0.0008885518,0.000098116936,0.0006779839],"category_scores_gemma":[0.00032973196,0.0001105877,0.000049178623,0.00051698985,0.0002256336,0.00012924602,0.00097318913,0.0002509011,0.00046722102],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030221978,0.00013576692,7.098342e-7,0.0004542316,0.000106713895,0.0000039735146,0.004311181,0.000032168853,0.0072435793,0.35201287,0.53629345,0.09937512],"study_design_scores_gemma":[0.00033093558,0.00009153988,0.00002545134,0.00027334198,0.000015747668,0.000018214549,0.0002108878,0.0045401296,0.0010807395,0.012062913,0.98114794,0.00020216325],"about_ca_topic_score_codex":0.0000123075,"about_ca_topic_score_gemma":4.054528e-7,"teacher_disagreement_score":0.8537819,"about_ca_system_score_codex":0.00003495163,"about_ca_system_score_gemma":0.000004019248,"threshold_uncertainty_score":0.74234486},"labels":[],"label_agreement":null},{"id":"W6949137735","doi":"10.5281/zenodo.12203570","title":"nissan juke 2020 owners manual pdf","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Troubleshooting; Upload; Download; Table (database); Automotive industry","score_opus":0.016756106396710265,"score_gpt":0.2381784807879699,"score_spread":0.22142237439125964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949137735","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004860324,0.00038613004,0.028301967,0.0007002049,0.0006324571,0.00029943418,0.00016391372,0.0026289902,0.96688205],"genre_scores_gemma":[0.0008364662,0.00016709296,0.0019845206,0.0002454654,0.00061538385,5.394409e-8,0.00065906934,0.006656705,0.9888352],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977178,0.00032090273,0.00022398472,0.00081633456,0.00047139026,0.0004495805],"domain_scores_gemma":[0.99861455,0.000012369798,0.00011971999,0.0009000161,0.00012448737,0.00022887472],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00055508694,0.00027298988,0.00022097754,0.0004876191,0.00067586347,0.0016290662,0.0029489861,0.00016321658,0.07062765],"category_scores_gemma":[0.000104069666,0.00026225467,0.000112273374,0.00090349227,0.0001885443,0.00019127928,0.0024061806,0.00050657504,0.24646504],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039745833,0.000039036237,4.2210797e-8,0.00008929667,0.00006382394,0.00009229292,0.00035877258,0.0000020644889,0.000060228107,0.039382424,0.90867287,0.051235154],"study_design_scores_gemma":[0.0001691069,0.00011273262,0.000003385261,0.000113560636,0.000016026304,0.00013330138,0.000069553374,0.00034690177,0.000041239462,0.0032435213,0.9954416,0.00030906912],"about_ca_topic_score_codex":0.000009001235,"about_ca_topic_score_gemma":2.6466637e-7,"teacher_disagreement_score":0.17583738,"about_ca_system_score_codex":0.0000655949,"about_ca_system_score_gemma":0.0000051571064,"threshold_uncertainty_score":0.99998295},"labels":[],"label_agreement":null},{"id":"W6949158354","doi":"10.5281/zenodo.12187003","title":"the summer i turned pretty book 2 pdf download","year":2024,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Girl; Dream; Performance art; Download; Quarter (Canadian coin)","score_opus":0.01892790634246839,"score_gpt":0.23202079715982368,"score_spread":0.2130928908173553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949158354","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000013810804,0.0023065396,0.01183676,0.0011032525,0.0005672174,0.0004192971,0.00010628692,0.0020413424,0.9816179],"genre_scores_gemma":[0.0001794044,0.00059736846,0.00039814645,0.00041047804,0.00032462802,1.1402877e-7,0.00038238638,0.0038684271,0.993839],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978149,0.00042532335,0.00021659557,0.0006521054,0.00044418563,0.00044692017],"domain_scores_gemma":[0.998445,0.000030240904,0.00012534636,0.0011142993,0.00012578123,0.0001593791],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007679402,0.00024290768,0.00016860392,0.00023536176,0.0013149634,0.0022774495,0.0032922863,0.00013648019,0.037609875],"category_scores_gemma":[0.0001557442,0.00018652505,0.000110078945,0.00067562144,0.00025878803,0.00019020535,0.0026600324,0.0005088336,0.18060884],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005313715,0.000024507579,3.996448e-8,0.00003766377,0.00006246397,0.0000223531,0.000256516,0.0000012489427,0.000027575825,0.023963567,0.92997825,0.045620482],"study_design_scores_gemma":[0.00013766412,0.00007523822,0.0000020650443,0.000070585265,0.00001425041,0.000059211026,0.000025204723,0.00022721884,0.000038606766,0.0026515326,0.9964697,0.00022876286],"about_ca_topic_score_codex":0.000007794299,"about_ca_topic_score_gemma":3.9141827e-7,"teacher_disagreement_score":0.14299898,"about_ca_system_score_codex":0.00006117732,"about_ca_system_score_gemma":0.000004466547,"threshold_uncertainty_score":0.9999852},"labels":[],"label_agreement":null},{"id":"W6949991247","doi":"10.5281/zenodo.4274985","title":"r3d3: Optimized Query Compilation on GPUs","year":2020,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph Theory 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":"McGill University","funders":"","keywords":"Code (set theory); Source code; Scripting language; Compiler; Software; Key (lock)","score_opus":0.04134543016024473,"score_gpt":0.2316127941478588,"score_spread":0.19026736398761407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949991247","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.009778013,0.000047319263,0.8476843,0.011211033,0.0002782431,0.000535014,0.00010370654,0.003041662,0.12732068],"genre_scores_gemma":[0.98575974,0.000039276176,0.009856053,0.0024552338,0.00025680565,4.5251085e-8,0.00054372713,0.00076058577,0.00032853452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845326,0.00035809242,0.00018510848,0.00042558037,0.00031957714,0.00025837283],"domain_scores_gemma":[0.99905425,0.000034615965,0.00007876798,0.0004038151,0.00021776903,0.00021079143],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00042192414,0.000120825556,0.00012589207,0.00012638663,0.0012621465,0.0007882693,0.0014560446,0.00004201495,0.0019058919],"category_scores_gemma":[0.0002800068,0.00012287752,0.00005693199,0.00068199827,0.00007588442,0.0004023193,0.0008534693,0.0002291136,0.007743475],"study_design_candidate":"not_applicable","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.00029962658,0.00035592358,0.000004779853,0.000072285075,0.000085233856,0.00008253473,0.00658288,0.0061262697,0.00806834,0.4564665,0.15681547,0.36504015],"study_design_scores_gemma":[0.0010532379,0.00057278725,0.00027916464,0.000024385557,0.00000679769,0.000045151603,0.00011492614,0.08141319,0.0021330353,0.0028063937,0.91126126,0.00028969272],"about_ca_topic_score_codex":0.0000013899293,"about_ca_topic_score_gemma":1.217307e-8,"teacher_disagreement_score":0.9759817,"about_ca_system_score_codex":0.000039227984,"about_ca_system_score_gemma":0.0000025040574,"threshold_uncertainty_score":0.9990065},"labels":[],"label_agreement":null},{"id":"W6957895992","doi":"10.60692/vgzhe-14s02","title":"Corrigendum to \"Best match graphs\"","year":2021,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Graph Theory 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":"Université de Sherbrooke","funders":"","keywords":"Lemma (botany); Precondition; Key (lock); Calculus (dental)","score_opus":0.03343883322653724,"score_gpt":0.20729078937317819,"score_spread":0.17385195614664095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957895992","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.092423126,0.0000037173759,0.89340866,0.00016765768,0.0031036434,0.00020034493,0.000039280698,0.00039186777,0.010261702],"genre_scores_gemma":[0.99070364,5.339129e-8,0.0074789724,0.00067215046,0.000038270085,0.000034640205,0.000007151282,0.0000050209305,0.0010601117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99876654,0.0000699603,0.00039770274,0.00019350415,0.00029235016,0.00027996048],"domain_scores_gemma":[0.9988127,0.0000035201924,0.00011561401,0.0006606172,0.00023871503,0.00016888452],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028138558,0.00014496522,0.00016783754,0.00022844413,0.00017320874,0.00047705782,0.0004887735,0.00006342217,0.000018520816],"category_scores_gemma":[0.0000112107555,0.00012786216,0.00008632456,0.0008219557,0.000012381932,0.0011012652,0.00018483597,0.000074779964,0.0037794758],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003648516,0.000020151383,0.04878911,0.00065565604,0.00015047535,0.00018597038,0.36478585,0.0004796513,0.000049521765,0.5634682,0.0032162277,0.018162722],"study_design_scores_gemma":[0.013585575,0.0014493052,0.20864351,0.0033294202,0.00026131162,0.0072780913,0.30233088,0.19706433,0.13731995,0.0054974216,0.113205895,0.010034308],"about_ca_topic_score_codex":0.0000022650722,"about_ca_topic_score_gemma":9.16531e-8,"teacher_disagreement_score":0.8982805,"about_ca_system_score_codex":0.00003594274,"about_ca_system_score_gemma":0.000045345918,"threshold_uncertainty_score":0.9969962},"labels":[],"label_agreement":null},{"id":"W6958281057","doi":"10.60692/8szx8-ybc82","title":"Corrigendum to \"Best match graphs\"","year":2021,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Graph Theory 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":"Université de Sherbrooke","funders":"","keywords":"Lemma (botany); Precondition; Key (lock); Calculus (dental)","score_opus":0.03343883322653724,"score_gpt":0.20729078937317819,"score_spread":0.17385195614664095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958281057","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.092423126,0.0000037173759,0.89340866,0.00016765768,0.0031036434,0.00020034493,0.000039280698,0.00039186777,0.010261702],"genre_scores_gemma":[0.99070364,5.339129e-8,0.0074789724,0.00067215046,0.000038270085,0.000034640205,0.000007151282,0.0000050209305,0.0010601117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99876654,0.0000699603,0.00039770274,0.00019350415,0.00029235016,0.00027996048],"domain_scores_gemma":[0.9988127,0.0000035201924,0.00011561401,0.0006606172,0.00023871503,0.00016888452],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028138558,0.00014496522,0.00016783754,0.00022844413,0.00017320874,0.00047705782,0.0004887735,0.00006342217,0.000018520816],"category_scores_gemma":[0.0000112107555,0.00012786216,0.00008632456,0.0008219557,0.000012381932,0.0011012652,0.00018483597,0.000074779964,0.0037794758],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003648516,0.000020151383,0.04878911,0.00065565604,0.00015047535,0.00018597038,0.36478585,0.0004796513,0.000049521765,0.5634682,0.0032162277,0.018162722],"study_design_scores_gemma":[0.013585575,0.0014493052,0.20864351,0.0033294202,0.00026131162,0.0072780913,0.30233088,0.19706433,0.13731995,0.0054974216,0.113205895,0.010034308],"about_ca_topic_score_codex":0.0000022650722,"about_ca_topic_score_gemma":9.16531e-8,"teacher_disagreement_score":0.8982805,"about_ca_system_score_codex":0.00003594274,"about_ca_system_score_gemma":0.000045345918,"threshold_uncertainty_score":0.9969962},"labels":[],"label_agreement":null},{"id":"W6961255747","doi":"10.1371/journal.pone.0280710.s002","title":"#SafeHandsSafeHearts intervention.","year":2024,"lang":"en","type":"article","venue":"Figshare","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Intervention (counseling); Anxiety; Transgender; Distress; Public health; Men who have sex with men; Transgender women; Health equity; Sexual minority","score_opus":0.018591686729403378,"score_gpt":0.2552350840331178,"score_spread":0.23664339730371442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6961255747","genre_codex":"dataset","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.0017638878,0.054303166,0.29558748,0.009778166,0.013934145,0.0021849188,0.34007618,0.019716516,0.26265553],"genre_scores_gemma":[0.9770481,0.0000031181642,0.003292118,0.00043207573,0.00038924522,0.00018789506,0.011960695,0.000025669611,0.0066610603],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994684,0.000024797502,0.00008210687,0.00020320072,0.00009461609,0.00012689647],"domain_scores_gemma":[0.999645,0.000058645386,0.000010450725,0.00021586171,0.000023036915,0.000046986013],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000055654084,0.00006352978,0.00004817691,0.00007488191,0.0000507469,0.00029232478,0.00036319674,0.000027863854,0.057224713],"category_scores_gemma":[0.00005547269,0.0000550005,0.00009749555,0.00028815345,0.0000024305932,0.0004209508,0.00015353254,0.00008777259,0.009231608],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.5895624e-7,0.000032888536,0.0000018764817,0.00019810331,0.000021960466,0.0002104622,0.00032737554,0.000011212159,0.000032018008,0.07492889,0.6938531,0.23038128],"study_design_scores_gemma":[0.00010491676,0.000061678045,0.00042681408,0.0023342825,0.0000024875392,0.0000730415,0.000008702528,0.03591321,0.0014174893,0.03294738,0.92649996,0.00021000838],"about_ca_topic_score_codex":3.892377e-7,"about_ca_topic_score_gemma":3.4765273e-7,"teacher_disagreement_score":0.9752842,"about_ca_system_score_codex":0.00000757617,"about_ca_system_score_gemma":0.000015373113,"threshold_uncertainty_score":0.99153984},"labels":[],"label_agreement":null},{"id":"W6969277584","doi":"10.5555/3635637.3662960","title":"Continuous Monte Carlo Graph Search","year":2024,"lang":"en","type":"article","venue":"Aaltodoc (Aalto University)","topic":"Graph Theory 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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Monte Carlo method; Graph; Graph theory; Multi-agent system; Markov chain Monte Carlo","score_opus":0.00930263009474361,"score_gpt":0.19849364775758932,"score_spread":0.1891910176628457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6969277584","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.31407776,0.002317396,0.5486949,0.0032266467,0.0035823276,0.00064762984,0.000048275626,0.0032234523,0.124181606],"genre_scores_gemma":[0.9741666,0.00011888815,0.0033654855,0.00015744471,0.000089958805,6.2422805e-7,0.0000018439745,0.000016561933,0.022082603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984779,0.0001468831,0.00011837142,0.0005539909,0.00026197353,0.00044091188],"domain_scores_gemma":[0.99904317,0.00013500416,0.000022928261,0.0005178913,0.00008308345,0.00019795552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029459642,0.00017489618,0.0001800231,0.00068084593,0.00023944247,0.00024094102,0.0011780822,0.000081582024,0.000050511753],"category_scores_gemma":[0.0000087664275,0.00018005147,0.00018442744,0.0018576902,0.00012339506,0.000890074,0.00036576166,0.00030117042,0.00032024202],"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.000013196117,0.000046727193,0.00019776681,0.00004061553,0.000086173284,0.002061781,0.0013657055,0.00017920215,0.00032285223,0.9586346,0.0021481905,0.034903165],"study_design_scores_gemma":[0.0014605614,0.0006339136,0.0015013928,0.0003110982,0.00011276561,0.0002680781,0.0018838281,0.059291523,0.0038467224,0.037822876,0.89129955,0.0015676816],"about_ca_topic_score_codex":0.00011735658,"about_ca_topic_score_gemma":0.000015831989,"teacher_disagreement_score":0.9208118,"about_ca_system_score_codex":0.00006167156,"about_ca_system_score_gemma":0.00011107475,"threshold_uncertainty_score":0.7342286},"labels":[],"label_agreement":null},{"id":"W6976577962","doi":"10.60692/4x1va-qp893","title":"Microbial contamination and associated risk factors in retailed pork from key value chains in Northern Vietnam","year":2021,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Graph Theory 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":"Engineers Without Borders Canada","funders":"","keywords":"Hygiene; Food safety; Salmonella; Descriptive statistics; Vietnamese; Food contaminant","score_opus":0.011640982629415994,"score_gpt":0.1798715574608038,"score_spread":0.1682305748313878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976577962","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.95495933,0.000005391684,0.04411164,0.000032599615,0.00031418804,0.00019416401,0.00010704026,0.00008988468,0.00018573558],"genre_scores_gemma":[0.99947125,3.9464987e-7,0.00034580164,0.000047228863,0.000014912906,0.000012223609,0.000078958365,0.0000048012566,0.000024407685],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9985053,0.00034127003,0.0005473308,0.00020695382,0.00019224577,0.00020692541],"domain_scores_gemma":[0.9992213,0.000030430734,0.000315755,0.00026037294,0.00011801681,0.0000541101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057592476,0.00015280211,0.00024935647,0.00025547048,0.00009589829,0.00023939539,0.0002030175,0.00013304845,0.0000025202803],"category_scores_gemma":[0.000068485424,0.00013970058,0.000049079626,0.00053180277,0.000017744052,0.00097091566,0.00009364519,0.00015638924,0.00003517983],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007343797,0.00000495602,0.8866547,0.000019245512,0.000018488225,0.000010070396,0.11184019,0.00024625947,0.0000098680275,0.00071717915,0.000001139795,0.00047059782],"study_design_scores_gemma":[0.0015302103,0.000019916939,0.93528414,0.00015278057,0.000008043848,0.000005375352,0.008294822,0.053659525,0.00078879733,0.000046259513,0.000009296634,0.00020083491],"about_ca_topic_score_codex":0.00009220369,"about_ca_topic_score_gemma":0.000088015055,"teacher_disagreement_score":0.10354536,"about_ca_system_score_codex":0.00014804542,"about_ca_system_score_gemma":0.000042998356,"threshold_uncertainty_score":0.5696824},"labels":[],"label_agreement":null},{"id":"W6976756013","doi":"10.6084/m9.figshare.12922719","title":"Additional file 3 of Chemoprophylaxis, diagnosis, treatments, and discharge management of COVID-19: An evidence-based clinical practice guideline (updated version)","year":2020,"lang":"en","type":"article","venue":"Figshare","topic":"Graph Theory 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":"McMaster University","funders":"","keywords":"Guideline; Clinical Practice; MEDLINE; Practice management","score_opus":0.07874252422345376,"score_gpt":0.3405162829567169,"score_spread":0.26177375873326314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976756013","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016354388,0.0001560941,0.000453085,0.002107757,0.00002064857,0.0002482997,0.9967599,0.000055801116,0.00018205866],"genre_scores_gemma":[0.002471721,0.00003577393,0.08342155,0.00647497,0.0000763198,0.0004268018,0.90703195,0.000011462351,0.000049424685],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99852306,0.00017261191,0.0004272266,0.0004222417,0.00031931445,0.00013552124],"domain_scores_gemma":[0.99644595,0.0022887473,0.00034790376,0.00034078164,0.00019693919,0.00037969285],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012656082,0.00013233798,0.0002040008,0.000044408134,0.00007721861,0.00003334398,0.00051830336,0.000057505247,0.89947116],"category_scores_gemma":[0.006408758,0.000117395386,0.00009188053,0.00038794687,0.000029704377,0.00074114045,0.00027291244,0.000092500326,0.00017834954],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004685963,0.00024918167,0.000008810367,0.00014295212,0.000054368884,0.00004266168,0.000028473693,0.000016593685,0.000001643563,0.00014085288,0.99022996,0.009037618],"study_design_scores_gemma":[0.00058533874,0.00059166,0.0006700925,0.0009345328,0.000025184305,0.0000031262805,0.0000542986,0.009178102,0.0002210005,0.00012040243,0.98747,0.00014631441],"about_ca_topic_score_codex":0.000002914863,"about_ca_topic_score_gemma":2.2354253e-7,"teacher_disagreement_score":0.8992928,"about_ca_system_score_codex":0.000016516082,"about_ca_system_score_gemma":0.00016932994,"threshold_uncertainty_score":0.7672345},"labels":[],"label_agreement":null},{"id":"W6991373840","doi":"","title":"GPU Acceleration of Graph Matching, Clustering, and Partitioning","year":2013,"lang":"en","type":"dissertation","venue":"Data Archiving and Networked Services (DANS)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cluster analysis; Graph; Hypergraph; Matching (statistics); Feature (linguistics)","score_opus":0.013836386025914995,"score_gpt":0.24442156774886606,"score_spread":0.23058518172295106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6991373840","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.85157883,0.0011891748,0.14476417,0.000027355714,0.0006592011,0.0002821026,0.000110505585,0.00013462649,0.0012540567],"genre_scores_gemma":[0.9720499,0.001368676,0.019602273,0.000110787216,0.00024177942,0.000034363817,0.0061427234,0.00004029775,0.00040923242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982848,0.00015245707,0.00038864266,0.0006798082,0.00020932482,0.00028494702],"domain_scores_gemma":[0.99847466,0.00014243262,0.00034965258,0.000885014,0.000040421517,0.000107830194],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043921094,0.0002849659,0.00032660287,0.00016292145,0.00037047872,0.00043035235,0.0013901143,0.00011080073,0.0000074289032],"category_scores_gemma":[0.0000039664865,0.00026355873,0.00003939922,0.0002116329,0.000052056577,0.0010986612,0.00061768683,0.00027099578,0.0000028804225],"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.00031732675,0.00044722715,0.010644467,0.012655975,0.0011019219,0.000056544945,0.18533428,0.009868163,0.013968058,0.06409848,0.0011445621,0.700363],"study_design_scores_gemma":[0.00049454486,0.00013076879,0.05724072,0.002683736,0.00012659359,0.000035124136,0.0027211,0.867719,0.0003504287,0.06716442,0.00045907154,0.0008744741],"about_ca_topic_score_codex":0.00046527866,"about_ca_topic_score_gemma":0.0014598777,"teacher_disagreement_score":0.85785085,"about_ca_system_score_codex":0.000003985197,"about_ca_system_score_gemma":0.00001987286,"threshold_uncertainty_score":0.99998164},"labels":[],"label_agreement":null},{"id":"W6999849622","doi":"","title":"Distributed Regular Path Query Matching and Optimization for Graph Database based on Spark","year":2016,"lang":"en","type":"dissertation","venue":"Research Repository (Delft University of Technology)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"NoSQL; Partition (number theory); Distributed database; Graph database; Relational database; Computation; Graph; SPARK (programming language); Path expression; Volume (thermodynamics)","score_opus":0.013427508424492918,"score_gpt":0.2540259510217504,"score_spread":0.2405984425972575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999849622","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.09042853,0.0002282186,0.90676564,0.0005254219,0.0002526772,0.0007450152,0.00017547623,0.0003132861,0.00056573126],"genre_scores_gemma":[0.7623147,0.00050304376,0.23078358,0.000016096279,0.00009289063,0.00002360647,0.0013894885,0.000073385105,0.0048032217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997999,0.0001990849,0.00019615232,0.000725623,0.00048824324,0.0003918579],"domain_scores_gemma":[0.99783754,0.00027029103,0.00023912333,0.0009824389,0.00056304224,0.00010756886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008012684,0.00020940525,0.00030748747,0.0014871042,0.00086417893,0.000057496058,0.0012784224,0.0004800486,0.000003297063],"category_scores_gemma":[0.00013785213,0.00021167843,0.00012077664,0.0008418464,0.00035222335,0.00032905975,0.00021031439,0.00049908407,0.0000013804879],"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.0043564322,0.0019618508,0.0006631515,0.004703553,0.00092503376,0.0020801888,0.0012509965,0.013118471,0.12949648,0.7703225,0.005181603,0.06593972],"study_design_scores_gemma":[0.0101339575,0.0043341047,0.0019457651,0.011919506,0.0003940648,0.00009315915,0.009792404,0.47420305,0.24483691,0.23150304,0.0072465413,0.0035975063],"about_ca_topic_score_codex":0.000037837974,"about_ca_topic_score_gemma":0.0000052204127,"teacher_disagreement_score":0.67598206,"about_ca_system_score_codex":0.00009768818,"about_ca_system_score_gemma":0.00022603631,"threshold_uncertainty_score":0.8631996},"labels":[],"label_agreement":null},{"id":"W7015238914","doi":"","title":"S+EPP: Construct and Explore Bisimulation Summaries, plus Optimize Navigational Queries; all on Existing SPARQL Systems","year":2015,"lang":"en","type":"article","venue":"IRIS Research product catalog (Sapienza University of Rome)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"SPARQL; Graph; Bisimulation; Component (thermodynamics); Tree traversal; Property (philosophy); Graph traversal; Class (philosophy); Construct (python library); Reachability","score_opus":0.14024024102263125,"score_gpt":0.32633608944607456,"score_spread":0.18609584842344332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7015238914","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.9517441,0.001616521,0.038954183,0.0018542461,0.0008092573,0.0014940193,0.00018242742,0.00028517275,0.0030600892],"genre_scores_gemma":[0.9873852,0.000042464002,0.011489282,0.000015573798,0.00009785371,0.0000022720644,0.00016533215,0.000012810738,0.0007891781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970202,0.0005889305,0.00021898598,0.00069540425,0.0010097027,0.0004667624],"domain_scores_gemma":[0.9975584,0.00045091147,0.00015255237,0.00067262934,0.0008502397,0.00031525208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002694918,0.00018241748,0.0003068583,0.00042478045,0.00046837633,0.00015627626,0.00088829035,0.00008905323,0.000007065148],"category_scores_gemma":[0.00057392713,0.00019030391,0.000049573326,0.0007749354,0.00095621194,0.0010286071,0.00067153876,0.00041811724,0.00003296778],"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.0030215704,0.0007424326,0.011390031,0.0011430441,0.0007358639,0.0015233888,0.077691965,0.076834686,0.002348114,0.7302102,0.029826358,0.064532354],"study_design_scores_gemma":[0.026091348,0.008535968,0.012701121,0.0020795646,0.00016091528,0.0011369109,0.05150967,0.5015522,0.0121178655,0.076162346,0.30329144,0.004660606],"about_ca_topic_score_codex":0.00068942417,"about_ca_topic_score_gemma":0.000013884486,"teacher_disagreement_score":0.65404785,"about_ca_system_score_codex":0.0002109414,"about_ca_system_score_gemma":0.00040833623,"threshold_uncertainty_score":0.7760368},"labels":[],"label_agreement":null},{"id":"W7017895727","doi":"","title":"Cardinality Estimation in Streaming Graph Data Management Systems","year":2024,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Graph Theory 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":"Blackberry (Canada)","funders":"","keywords":"Graph; Dynamism; Streaming algorithm; Cardinality (data modeling); Key (lock); Graph database; Streaming data; Wait-for graph","score_opus":0.015149089212818139,"score_gpt":0.2234448981517053,"score_spread":0.20829580893888716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017895727","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.97076184,0.0009756877,0.021837493,0.00029241215,0.0025095982,0.00073936756,0.0001398527,0.00027118876,0.0024725597],"genre_scores_gemma":[0.66972697,0.00037710316,0.033371065,0.000008173984,0.000047252037,0.0000024849994,0.003159076,0.000041958425,0.29326594],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985752,0.00010426822,0.00014810894,0.0006440441,0.00031568372,0.00021269685],"domain_scores_gemma":[0.9986948,0.000025180007,0.00015010513,0.0010275214,0.000050322546,0.00005207756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048272777,0.00019255182,0.00030854775,0.0005820175,0.00010395995,0.000101137826,0.0016855147,0.00013942471,0.000005341145],"category_scores_gemma":[0.0000033951762,0.00022413919,0.000090651905,0.0005912198,0.000035711,0.0006914222,0.0004177089,0.0002141134,0.000034394914],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020007916,0.0005028268,0.0006356248,0.014912468,0.001713676,0.0029096827,0.40346733,0.012563898,0.00036113829,0.3484994,0.0045717796,0.2096621],"study_design_scores_gemma":[0.0011795404,0.00014394008,0.011214312,0.004162797,0.00061845663,0.00001637527,0.3512237,0.5989833,0.00014644852,0.03017946,0.00078182947,0.001349843],"about_ca_topic_score_codex":0.01689713,"about_ca_topic_score_gemma":0.006499786,"teacher_disagreement_score":0.5864194,"about_ca_system_score_codex":0.000057647143,"about_ca_system_score_gemma":0.000031175758,"threshold_uncertainty_score":0.9896494},"labels":[],"label_agreement":null},{"id":"W7018666893","doi":"","title":"Dynamic Large-Scale Graph Processing over Data Streams with Community Detection as a Case Study","year":2018,"lang":"en","type":"dissertation","venue":"QSpace (Queen's University Library)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University","keywords":"Graph; Graph database; Analytics; Big data; Data analysis; Wait-for graph; Online transaction processing; SPARK (programming language); Data processing","score_opus":0.008061963742599518,"score_gpt":0.22346164401705743,"score_spread":0.2153996802744579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7018666893","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.9707631,0.000017998373,0.025597006,0.00025926362,0.00029787436,0.0006826568,0.00012694632,0.00067953864,0.0015756058],"genre_scores_gemma":[0.970474,0.000021524575,0.00821368,0.00004795984,0.00003558435,0.0000026031296,0.0010438564,0.00006122318,0.02009957],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.99729127,0.00069705956,0.0001850489,0.00094535726,0.00042193237,0.00045931822],"domain_scores_gemma":[0.99691147,0.000086899854,0.00037741972,0.0022836553,0.000119196084,0.00022133846],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00023535159,0.0004905342,0.00040641142,0.0006366903,0.0017466308,0.00045302938,0.0028268192,0.0002756069,0.000044270626],"category_scores_gemma":[0.000009573,0.0004945623,0.00009850844,0.0016705903,0.00012252147,0.005694783,0.001038939,0.0010689226,0.000018403012],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008330676,0.030018175,0.044806305,0.0054151895,0.0052724094,0.098452,0.49157637,0.0002850114,0.00009417433,0.005847906,0.023808217,0.28609356],"study_design_scores_gemma":[0.0106294295,0.009270035,0.026435958,0.002328342,0.002002096,0.0004690612,0.88781184,0.02432063,0.0021646696,0.009066737,0.018431887,0.0070693404],"about_ca_topic_score_codex":0.009230368,"about_ca_topic_score_gemma":0.012576799,"teacher_disagreement_score":0.39623544,"about_ca_system_score_codex":0.000064857944,"about_ca_system_score_gemma":0.00033487807,"threshold_uncertainty_score":0.9997506},"labels":[],"label_agreement":null},{"id":"W7023793821","doi":"","title":"Portrait statistique de l'évolution de l'enseignement supérieur au Canada des années 60 aux années 80 : document rédigé en vue de la douzième conférence quinquennale sur les universités du Commonwealth, tenue à Vancouver du 19 au 26 août 1978","year":2015,"lang":"fr","type":"other","venue":"Bibliothèque et Archives nationales du Québec (Québec government)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Liquation; Diafiltration; Emperipolesis; Triacetin; Demotion","score_opus":0.010838642309824268,"score_gpt":0.2204930526405629,"score_spread":0.20965441033073864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023793821","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.63164985,0.012019539,0.1636034,0.021095281,0.0014866263,0.002251662,0.0045833634,0.00060178596,0.16270848],"genre_scores_gemma":[0.92157227,0.0020032567,0.008955528,0.0019230887,0.0008761097,0.000183764,0.00010908115,0.00022441382,0.06415247],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99224377,0.0023998462,0.0009879464,0.0012149635,0.0017101824,0.0014432957],"domain_scores_gemma":[0.98718506,0.009599099,0.0010428639,0.0007327438,0.0003455447,0.0010946579],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022817831,0.0010657333,0.0008518987,0.0010183399,0.0015373968,0.00060838775,0.0022028782,0.00032393393,0.0015598284],"category_scores_gemma":[0.002607654,0.0011527244,0.00031242438,0.0011077161,0.0023247625,0.0011341417,0.00083065056,0.00089947,0.00003688486],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.0004400057,0.0010407032,0.21349475,0.0011132314,0.00093045196,0.0012324315,0.09991128,0.008889526,0.00042942428,0.3073097,0.36196497,0.0032435553],"study_design_scores_gemma":[0.0022304174,0.0004218214,0.30871853,0.0011332947,0.00022168644,0.0003736636,0.0037535501,0.0071638837,0.00022399865,0.008880325,0.66533667,0.001542167],"about_ca_topic_score_codex":0.98775345,"about_ca_topic_score_gemma":0.99980104,"teacher_disagreement_score":0.31022564,"about_ca_system_score_codex":0.03504669,"about_ca_system_score_gemma":0.34527233,"threshold_uncertainty_score":0.9997625},"labels":[],"label_agreement":null},{"id":"W7024314047","doi":"","title":"Release: Luther College Researcher Receives $1 Million Grant for Intimate Partner Violence Research","year":2011,"lang":"en","type":"other","venue":"oURspace (University of Regina)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Domestic violence; Intimate partner; Martin luther king; Sexual assault; Social research; Research council; Sexual violence","score_opus":0.048368740687898454,"score_gpt":0.2802927247276868,"score_spread":0.23192398403978834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024314047","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007777881,0.0057428293,0.3531873,0.40660697,0.0012156202,0.003928371,0.00070238404,0.00096428883,0.22687444],"genre_scores_gemma":[0.00019902481,0.0021311503,0.039438505,0.000014993379,0.000074567426,0.0000045419383,0.000011903837,0.00012455591,0.9580008],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973073,0.00053584715,0.000026051444,0.0007957942,0.0006391671,0.00069585955],"domain_scores_gemma":[0.9977814,0.00020068996,0.00024288989,0.0011767477,0.0003753278,0.00022293969],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015740487,0.0002673499,0.00043669515,0.0010273536,0.00035918373,0.00003502323,0.0022672229,0.0003841365,0.00009769937],"category_scores_gemma":[0.000072700845,0.00029056755,0.00022499236,0.0010210542,0.000869101,0.00026550388,0.00054820476,0.0004996492,0.00018598784],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077183744,0.000045024637,0.000010187928,0.00015639747,0.00006717818,0.00006238836,0.00035954008,8.9544113e-7,0.00005146407,0.12666015,0.8678878,0.0046217935],"study_design_scores_gemma":[0.00061496306,0.00025620672,0.000029896071,0.00086633343,0.000022524951,0.000006449867,0.0013367737,0.00070157234,0.00010599253,0.0051204204,0.9906062,0.00033266156],"about_ca_topic_score_codex":0.0000934724,"about_ca_topic_score_gemma":0.00019591069,"teacher_disagreement_score":0.7311263,"about_ca_system_score_codex":0.00006581877,"about_ca_system_score_gemma":0.0001887499,"threshold_uncertainty_score":0.99995464},"labels":[],"label_agreement":null},{"id":"W7024639982","doi":"","title":"The State as Polluter Challenge in Climate Law","year":2021,"lang":"","type":"dissertation","venue":"TSpace","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; Ministry of Defense; Lantheus Medical Imaging; University of Toronto; ConocoPhillips","keywords":"State (computer science); Principal (computer security); Scope (computer science); Climate change; State responsibility; International law; Environmental law; Polluter pays principle; Greenhouse gas","score_opus":0.013839746173031218,"score_gpt":0.3096923423978212,"score_spread":0.29585259622478993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024639982","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.5687079,0.051480033,0.0058588614,0.02073716,0.024964247,0.0030322862,0.00006843243,0.00049137324,0.3246597],"genre_scores_gemma":[0.9127207,0.02124131,0.0012479468,0.001227185,0.00033159793,0.00016717451,0.00011035639,0.0001252631,0.06282846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99569714,0.00070484204,0.00064428523,0.0011200168,0.0006247259,0.0012089835],"domain_scores_gemma":[0.9974018,0.00041452926,0.00039890106,0.001379313,0.00020367454,0.00020182562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014129961,0.00060014543,0.0005408883,0.00016140554,0.00095121557,0.0009981841,0.0017447267,0.0002885503,0.000161948],"category_scores_gemma":[0.00005056339,0.00049213355,0.00030029519,0.000923323,0.00022088723,0.00041698018,0.00041577689,0.0010257969,0.00045869985],"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.00014393636,0.00023300441,0.000009058807,0.00017769235,0.00009249746,0.00058088376,0.121963136,0.00012808207,0.00021471563,0.7907108,0.00003578801,0.08571043],"study_design_scores_gemma":[0.0053391918,0.00184768,0.003807855,0.0048357598,0.0002140218,0.00020943319,0.14805736,0.04980792,0.016812773,0.65970117,0.10298374,0.0063830973],"about_ca_topic_score_codex":0.00068209815,"about_ca_topic_score_gemma":0.0041683028,"teacher_disagreement_score":0.3440128,"about_ca_system_score_codex":0.0000661051,"about_ca_system_score_gemma":0.00025916065,"threshold_uncertainty_score":0.99975306},"labels":[],"label_agreement":null},{"id":"W7027051066","doi":"","title":"Canadian Solar Completes the Sale of a 290 MWp Greenfield Solar Portfolio in Italy | AltEnergyMag","year":2020,"lang":"en","type":"other","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Portfolio; Greenfield project; Work (physics); Government (linguistics); Renewable energy; Solar energy","score_opus":0.009903178469860005,"score_gpt":0.19867777989908061,"score_spread":0.18877460142922062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027051066","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049397844,0.0010876956,0.032690782,0.0033851243,0.0006450707,0.00040582576,0.00009969756,0.00020212604,0.9614343],"genre_scores_gemma":[0.14399578,0.00040689862,0.04326761,0.017104005,0.0009751657,0.00008442833,0.0001336103,0.0006486268,0.7933839],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99850255,0.00010879106,0.00029488947,0.00044517827,0.00023472648,0.0004138745],"domain_scores_gemma":[0.9987669,0.000076495155,0.00015467552,0.00076513714,0.000024260185,0.00021253018],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025237142,0.00027045392,0.00039420286,0.0004042977,0.00006369523,0.000070818154,0.0018469653,0.00019730485,0.001346595],"category_scores_gemma":[0.00002157825,0.00019406872,0.0001503498,0.00065907976,0.000102041726,0.00008887105,0.00021634299,0.00032265592,0.000070576454],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005073998,0.00007775119,0.0009074253,0.00010083393,0.0002094891,0.000347108,0.00077652134,0.000026066478,0.00010533754,0.3968983,0.5769875,0.023558602],"study_design_scores_gemma":[0.00047528028,0.00018183948,0.00052351115,0.0002298637,0.000030061065,0.000034462493,0.00019192377,0.009485687,0.00058904494,0.027541155,0.9598463,0.00087084976],"about_ca_topic_score_codex":0.2651465,"about_ca_topic_score_gemma":0.33456323,"teacher_disagreement_score":0.38285884,"about_ca_system_score_codex":0.000023843435,"about_ca_system_score_gemma":0.00029036598,"threshold_uncertainty_score":0.9995663},"labels":[],"label_agreement":null},{"id":"W7027508319","doi":"","title":"Descartes Reports Fiscal 2018 First Quarter Financial Results","year":2017,"lang":"en","type":"other","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Debt; Economic forecasting","score_opus":0.010865487795603023,"score_gpt":0.22263332430095586,"score_spread":0.21176783650535283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027508319","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000037491604,0.00020033216,0.06813329,0.00062516745,0.003299614,0.00018181087,0.000026323243,0.0005117414,0.927018],"genre_scores_gemma":[0.0010820132,0.000028844852,0.013979135,0.00017951064,0.0009579087,0.000017803637,0.000018810595,0.00008337958,0.9836526],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99823356,0.00004284009,0.00028658583,0.0007941997,0.00027388879,0.0003689087],"domain_scores_gemma":[0.99722826,0.0000500856,0.00043196732,0.0021430857,0.000023806475,0.00012280725],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035805185,0.00031230267,0.00033722605,0.0001766286,0.00024194515,0.00027641805,0.0011654987,0.0003508443,0.00022440711],"category_scores_gemma":[0.000114410934,0.00025134778,0.00018135441,0.000087035216,0.00013595834,0.000200659,0.0002572393,0.0002066957,0.00032997364],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035709077,0.000029335024,0.000023615175,0.000012339104,0.000014020107,0.00032909538,0.00007273822,2.9324312e-7,7.7499925e-7,0.0059702294,0.98836327,0.0051807277],"study_design_scores_gemma":[0.00023334635,0.00006515104,0.00037305706,0.00019663578,0.000008588715,0.00010474194,0.0000017914165,0.00019128625,0.000036296547,0.01050635,0.98788494,0.00039778897],"about_ca_topic_score_codex":0.0001404928,"about_ca_topic_score_gemma":0.00041029547,"teacher_disagreement_score":0.056634616,"about_ca_system_score_codex":0.0000127242865,"about_ca_system_score_gemma":0.00006595311,"threshold_uncertainty_score":0.99999386},"labels":[],"label_agreement":null},{"id":"W7033519122","doi":"","title":"Residential mobility of the urban poor, a study of female-headed single parent Aboriginal households in Winnipeg","year":2001,"lang":"en","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"","funders":"Centers for Disease Control and Prevention","keywords":"Nucleofection; TSG101; Hyporeflexia; Articular cartilage damage; Gestational period; Fusible alloy","score_opus":0.006233171491515958,"score_gpt":0.17200015068682542,"score_spread":0.16576697919530947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033519122","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.63261,0.0011653946,0.0009003817,0.00092026294,0.0013918164,0.0016995737,0.0005564854,0.000049940303,0.36070615],"genre_scores_gemma":[0.97200656,0.000035290454,0.00040856138,0.00010290903,0.0000482132,0.000009531559,0.0000014845451,0.000044749162,0.027342726],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9968937,0.0002498247,0.0004713214,0.0003938284,0.0017145172,0.00027679378],"domain_scores_gemma":[0.9986761,0.00012556542,0.0004595907,0.00061740587,9.135148e-7,0.00012038117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000034705612,0.00025294718,0.00046584613,0.0000628457,0.00006160257,0.000017314751,0.001023724,0.000049278275,0.00003232496],"category_scores_gemma":[0.000002619357,0.00020549074,0.000055029508,0.00029978744,0.00015884986,0.00017031933,0.00027854275,0.00019851158,8.827564e-10],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008456063,0.0037407887,0.7556921,0.0014820122,0.00065185234,0.0004894152,0.003335119,0.00041086957,0.008867892,0.19863455,0.015966428,0.009883309],"study_design_scores_gemma":[0.0059670364,0.00214592,0.8025815,0.003009669,0.00021010597,0.000031904256,0.014325562,0.002139206,0.08008586,0.008033662,0.0793979,0.0020716898],"about_ca_topic_score_codex":0.031525277,"about_ca_topic_score_gemma":0.13875577,"teacher_disagreement_score":0.33939654,"about_ca_system_score_codex":0.000009426004,"about_ca_system_score_gemma":0.0011246637,"threshold_uncertainty_score":0.9749239},"labels":[],"label_agreement":null},{"id":"W7033570770","doi":"","title":"A Search for Periodicities in the 8B Solar Neutrino Flux Measured by the Sudbury Neutrino Observatory","year":2005,"lang":"en","type":"article","venue":"IUScholarWorks (Indiana University)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Industry Canada; Strong; Western Canada Research Grid","keywords":"Flux (metallurgy); Solar neutrino; Neutrino; Observatory; Solar neutrino problem; Modulation (music); Neutrino oscillation; Variation (astronomy)","score_opus":0.023705720919608868,"score_gpt":0.2177885549319855,"score_spread":0.19408283401237664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033570770","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.8920693,0.002553725,0.08553118,0.011154483,0.00053348416,0.0016979722,0.000060321192,0.00028261892,0.00611694],"genre_scores_gemma":[0.9950379,0.00006662869,0.0009943746,0.0016932804,0.00015445755,0.000009908399,0.000010595162,0.000017207898,0.0020156505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99745625,0.00067121186,0.00020923978,0.0005187201,0.00045454744,0.0006900039],"domain_scores_gemma":[0.99823856,0.0004972712,0.000082889324,0.00091081054,0.00012762858,0.00014286459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017189771,0.00025521303,0.00023025465,0.0003615395,0.0011181738,0.00051301334,0.0034476828,0.00018379313,0.000015184575],"category_scores_gemma":[0.00002363389,0.00019589257,0.00023055934,0.0016111041,0.0002555978,0.0016090355,0.00028284133,0.0009579762,0.00002913971],"study_design_candidate":"not_applicable","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.0004675387,0.0010752148,0.023057668,0.00013393222,0.00037499127,0.0007038932,0.050965168,0.003590934,0.0042381217,0.68574053,0.01651537,0.21313664],"study_design_scores_gemma":[0.0058996514,0.0005102474,0.04357659,0.0001723134,0.00013364873,0.00010615495,0.015832892,0.010966629,0.012995311,0.0032909196,0.9048526,0.0016629999],"about_ca_topic_score_codex":0.00007094105,"about_ca_topic_score_gemma":0.00014040443,"teacher_disagreement_score":0.88833725,"about_ca_system_score_codex":0.00013744055,"about_ca_system_score_gemma":0.00017328918,"threshold_uncertainty_score":0.8600202},"labels":[],"label_agreement":null},{"id":"W7033848447","doi":"","title":"Schmidt, Alberta G (Birth, 1910-04-03)","year":2012,"lang":"en","type":"other","venue":"Spectrum Research Repository (Concordia University)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Natural (archaeology); Work (physics); Identification (biology); Government (linguistics)","score_opus":0.02040536902866652,"score_gpt":0.24769347490975732,"score_spread":0.2272881058810908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033848447","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076789985,0.00065728795,0.0034873814,0.0004810811,0.0020191441,0.00054495153,0.00001291105,0.0005845984,0.99144477],"genre_scores_gemma":[0.05332956,0.00018891407,0.00048424766,0.000024244842,0.001266313,0.000004330501,0.000010187538,0.00024032801,0.94445187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99445045,0.0011947484,0.00026788897,0.00129993,0.0010832135,0.0017037839],"domain_scores_gemma":[0.9960677,0.00040248825,0.00025014125,0.0023148104,0.00012404,0.00084080035],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00078539335,0.0005457556,0.0005879153,0.0026661046,0.00075581245,0.00037005555,0.0042502256,0.0005975302,0.0010983357],"category_scores_gemma":[0.00005534474,0.00058508595,0.0003737762,0.0024467246,0.0007548614,0.0006956682,0.0016468111,0.0015978037,0.0020246503],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011298556,0.00046389175,0.0083794715,0.0002704222,0.0006924159,0.0032783847,0.00050615426,0.0000043581595,0.0007582294,0.72631335,0.2541734,0.0050469046],"study_design_scores_gemma":[0.0005252865,0.00019143561,0.00092023966,0.00014710889,0.000028527016,0.00007708206,0.00009445976,0.00012689739,0.00179116,0.0027160672,0.9926883,0.0006934087],"about_ca_topic_score_codex":0.018503396,"about_ca_topic_score_gemma":0.0045517953,"teacher_disagreement_score":0.7385149,"about_ca_system_score_codex":0.00037919747,"about_ca_system_score_gemma":0.00064910343,"threshold_uncertainty_score":0.9998148},"labels":[],"label_agreement":null},{"id":"W7037270804","doi":"","title":"Eight years of computing education papers at NACCQ","year":2008,"lang":"en","type":"other","venue":"UTS ePRESS (University of Technology Sydney)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Capstone; Consistency (knowledge bases); Set (abstract data type); Quarter (Canadian coin); Curriculum; Position (finance); Position paper","score_opus":0.004536600543426925,"score_gpt":0.1806666795456286,"score_spread":0.17613007900220168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7037270804","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057470135,0.0045923097,0.061434973,0.0015027474,0.0026031802,0.0009934457,0.00012421378,0.0022000503,0.86907893],"genre_scores_gemma":[0.24044143,0.0016698363,0.17800769,0.00013251597,0.000117067386,0.0000011979678,0.000063408166,0.0002280463,0.5793388],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907076,0.000039093033,0.000115784875,0.00041389896,0.0001641914,0.00019626632],"domain_scores_gemma":[0.9986812,0.00003096509,0.0003970836,0.0007931394,0.000050035247,0.000047602483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006340725,0.00016243017,0.00036881407,0.0010950109,0.00009830078,0.0000034668683,0.0017119134,0.00051024486,0.00019563927],"category_scores_gemma":[0.00001544491,0.00020979985,0.00012839561,0.00061149505,0.00059371156,0.000075070086,0.00080675026,0.00021635005,0.00003892944],"study_design_candidate":"not_applicable","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.000026413285,0.0006634836,0.0034739135,0.00037553,0.0006544138,0.00022032589,0.0034542035,0.000029067121,0.0022925735,0.23575962,0.23052955,0.5225209],"study_design_scores_gemma":[0.000977793,0.00016155907,0.0034279379,0.0008281292,0.00008493923,0.00012143022,0.0009311488,0.0007261402,0.002057405,0.005194709,0.9846518,0.00083702226],"about_ca_topic_score_codex":0.00015931415,"about_ca_topic_score_gemma":0.000033478245,"teacher_disagreement_score":0.75412226,"about_ca_system_score_codex":0.00003637593,"about_ca_system_score_gemma":0.00008742772,"threshold_uncertainty_score":0.85553896},"labels":[],"label_agreement":null},{"id":"W7038888393","doi":"","title":"L’effet d’un événement de fraude médiatisée sur la performance et le risque des entreprises","year":2020,"lang":"fr","type":"other","venue":"Knowledge UdeS (Institutional Deposit of the University of Sherbrooke)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Private enterprise; Private life; Passenger information","score_opus":0.011033034926536097,"score_gpt":0.18810912067493776,"score_spread":0.17707608574840167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7038888393","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.120014735,0.013689065,0.53318185,0.0006358288,0.00085765845,0.00060585217,0.00005894454,0.000108604836,0.33084747],"genre_scores_gemma":[0.9171166,0.003684768,0.042230826,0.000082223494,0.00010957649,0.0000015216867,0.000009878307,0.00004249575,0.036722142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99777347,0.00055071077,0.00033966784,0.0005502154,0.0004087761,0.00037714676],"domain_scores_gemma":[0.9985689,0.000227341,0.00027124007,0.00056574686,0.00016896929,0.00019782296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043756625,0.0004122859,0.0005240543,0.00017169055,0.00073666,0.00005351313,0.0021685895,0.00030118725,0.0004670539],"category_scores_gemma":[0.00008877715,0.0004089922,0.00048765304,0.00049865304,0.0018913749,0.00047298972,0.0011282255,0.00046107205,0.00011003947],"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.0002781993,0.0028222078,0.020231325,0.012058245,0.0015610284,0.00017837947,0.03878546,0.09173348,0.012410004,0.7102648,0.005745764,0.103931114],"study_design_scores_gemma":[0.003604903,0.0004261752,0.22394,0.016761854,0.00064375025,0.00020124238,0.000300086,0.20169924,0.077615455,0.005379454,0.46811804,0.0013097884],"about_ca_topic_score_codex":0.0012698172,"about_ca_topic_score_gemma":0.0019052535,"teacher_disagreement_score":0.79710186,"about_ca_system_score_codex":0.0005795246,"about_ca_system_score_gemma":0.00078676554,"threshold_uncertainty_score":0.9998362},"labels":[],"label_agreement":null},{"id":"W7039945015","doi":"","title":"5N Plus to Release Second Quarter 2024 Results on August 5, 2024","year":2024,"lang":"en","type":"other","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Window (computing); Welding; Tower","score_opus":0.010913099398452286,"score_gpt":0.24099328856048796,"score_spread":0.23008018916203568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039945015","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004656443,0.00029196803,0.01300172,0.001447695,0.007443172,0.0003534877,0.00022107243,0.0007578587,0.9764784],"genre_scores_gemma":[0.00014928203,0.000008645508,0.0050201914,0.0021377804,0.0007863426,0.000034247285,0.000012034378,0.0002326399,0.9916188],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99750155,0.000081509716,0.00032809484,0.0012619892,0.00037401417,0.00045281064],"domain_scores_gemma":[0.99807847,0.00007170101,0.00007703705,0.0014420972,0.000023980694,0.00030674302],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00030339143,0.0004542941,0.00036418834,0.0007227727,0.00004245587,0.0003976837,0.0012170323,0.00029495588,0.0150807295],"category_scores_gemma":[0.000022427494,0.0003569649,0.00020280787,0.0007222969,0.00004233271,0.00009538961,0.00033921286,0.00054637867,0.04428062],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001931879,0.000027424254,4.6104642e-8,0.00006990263,0.00005444505,0.00021593137,0.0002167512,0.0000049260652,0.0000035193646,0.08209144,0.91413337,0.003162947],"study_design_scores_gemma":[0.00030392938,0.00023610034,0.0000015477738,0.0004194735,0.000015655794,0.000014608589,0.000037924216,0.0007407794,0.00006269945,0.011555868,0.9860989,0.00051250745],"about_ca_topic_score_codex":0.00006322594,"about_ca_topic_score_gemma":0.00016350561,"teacher_disagreement_score":0.07196556,"about_ca_system_score_codex":0.00005220487,"about_ca_system_score_gemma":0.00008679013,"threshold_uncertainty_score":0.99988824},"labels":[],"label_agreement":null},{"id":"W7040581293","doi":"","title":"Queering Cannabis","year":2019,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Graph Theory 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":"University of British Columbia","funders":"","keywords":"Queer; Opposition (politics); Recreation; Lesbian; Queer theory; Homosexuality; Ethnography; The Imaginary","score_opus":0.003990023054730075,"score_gpt":0.14944842226405747,"score_spread":0.1454583992093274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7040581293","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.9683356,0.000051022507,0.027726062,0.00010099477,0.00026385923,0.000099496865,0.00001260709,0.000106696556,0.0033036042],"genre_scores_gemma":[0.9937588,0.000011592551,0.0033805207,0.000041732088,0.000009442325,1.07318385e-7,0.0000013631129,0.0000043114005,0.0027921484],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99928594,0.000031438813,0.000058916867,0.0002877583,0.00015034253,0.0001856172],"domain_scores_gemma":[0.9994312,0.000013914179,0.00005402804,0.00035155707,0.00007200091,0.00007727805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001428725,0.000025519998,0.00013736665,0.000033944907,0.00010704857,0.0001007064,0.00072718854,0.0000475518,0.000085449035],"category_scores_gemma":[0.00000492958,0.00010583575,0.00008541678,0.0002984084,0.00006997731,0.0005534113,0.00022413417,0.00008210171,0.00009234422],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000203683,0.00006651106,0.010767808,0.000052584997,0.000030104713,0.00015078751,0.00048304492,0.000079195925,0.00057187525,0.00043549895,0.0020068935,0.98535365],"study_design_scores_gemma":[0.00044411916,0.00005808178,0.99042296,0.000062461,0.0000048527295,0.00005000665,0.00034309662,0.003932143,0.0000034614422,0.0031980942,0.0013086154,0.00017213215],"about_ca_topic_score_codex":0.031458426,"about_ca_topic_score_gemma":0.025026921,"teacher_disagreement_score":0.9851815,"about_ca_system_score_codex":0.000025331103,"about_ca_system_score_gemma":0.00003909652,"threshold_uncertainty_score":0.9927638},"labels":[],"label_agreement":null},{"id":"W7042742027","doi":"","title":"Selective parallel loading of large-scale compressed graphs with ParaGrapher","year":2024,"lang":"en","type":"other","venue":"Research Portal (Queen's University Belfast)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; HORIZON EUROPE Framework Programme; Department for the Economy; Tezpur University; Ministry of Education, India; Queen's University; Queen's University Belfast","keywords":"Speedup; Graph; Graph product; Binary number; Block graph; Line graph","score_opus":0.013104556554391395,"score_gpt":0.26116920311348296,"score_spread":0.24806464655909158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042742027","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009123541,0.00043430604,0.07283042,0.0005128514,0.00034242493,0.0014596805,0.00039754907,0.0009443429,0.92216605],"genre_scores_gemma":[0.116334505,0.0004474845,0.015915142,0.000035277284,0.00012936884,0.000010842511,0.00007762233,0.00040330167,0.86664647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959416,0.0005172518,0.00022337308,0.0010947359,0.0012271785,0.0009958793],"domain_scores_gemma":[0.99802446,0.00013952775,0.00020243265,0.0009638616,0.0003256177,0.00034409686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007465637,0.00042600094,0.0006053663,0.0019560717,0.00025586624,0.000106318905,0.0018441179,0.00035705825,0.00050865073],"category_scores_gemma":[0.000012588982,0.00039430635,0.00028827335,0.003168418,0.0006380194,0.00032961593,0.0007890929,0.0012584509,0.00015520595],"study_design_candidate":"not_applicable","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.00020092452,0.0006589565,0.00094983535,0.0007455615,0.0013870393,0.0029878488,0.0017656743,0.000060623,0.00006656947,0.55139,0.43932143,0.00046553218],"study_design_scores_gemma":[0.0062813666,0.0028329236,0.0019851248,0.0051619573,0.00037253613,0.0000916137,0.008122401,0.0031337964,0.0016224466,0.065623045,0.90100765,0.0037651472],"about_ca_topic_score_codex":0.0007600259,"about_ca_topic_score_gemma":0.00014221603,"teacher_disagreement_score":0.48576695,"about_ca_system_score_codex":0.000055441244,"about_ca_system_score_gemma":0.00029482346,"threshold_uncertainty_score":0.99985087},"labels":[],"label_agreement":null},{"id":"W7091495435","doi":"10.5281/zenodo.17356358","title":"Software Artifact for \"On Computing Top-k Simple Shortest Paths from a Single Source. M. D'Emidio, G. Di Stefano\". SIAM 28th Symposium on Algorithm Engineering and Experiments (ALENEX 2026), Vancouver, Canada.","year":2025,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Artifact (error); Simple (philosophy); Software; Key (lock); Algorithm design","score_opus":0.01220415500266563,"score_gpt":0.2059788549591027,"score_spread":0.19377469995643706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7091495435","genre_codex":"methods","genre_gemma":"other","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.0003955326,0.0003390537,0.9617697,0.00013000082,0.0014265915,0.0011771218,0.0018904752,0.0020125841,0.030858966],"genre_scores_gemma":[0.2245574,0.0010330684,0.2062142,0.0059034484,0.009141834,0.000009449912,0.026342388,0.055394236,0.471404],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976021,0.00016425717,0.00030132564,0.00092972134,0.00045852366,0.0005440803],"domain_scores_gemma":[0.99853545,0.00015878823,0.00017746692,0.0007280633,0.00016557347,0.00023465461],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002581731,0.00038968367,0.0003517062,0.00032940164,0.00085015025,0.0007172018,0.0013017572,0.00014369925,0.00063941674],"category_scores_gemma":[0.00021669004,0.0004197427,0.00007633844,0.00038256764,0.0000569732,0.00012352905,0.0011472425,0.00032556528,0.00008672077],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003479925,0.0002600009,0.0000034371617,0.00015255506,0.00020674855,0.000046168258,0.0007399783,0.0018498019,0.0008795466,0.000943203,0.58849597,0.4063878],"study_design_scores_gemma":[0.0005537652,0.00033996912,0.000013475363,0.0003444156,0.000018750503,0.0000063564894,0.00010036626,0.037183743,0.0015422071,0.00010782684,0.95932144,0.0004677018],"about_ca_topic_score_codex":0.0022180935,"about_ca_topic_score_gemma":0.00013756439,"teacher_disagreement_score":0.75555545,"about_ca_system_score_codex":0.00023200431,"about_ca_system_score_gemma":0.000028155113,"threshold_uncertainty_score":0.9998254},"labels":[],"label_agreement":null},{"id":"W7095580264","doi":"","title":"Streaming graph partitioning for large distributed graphs","year":2012,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Heuristics; Scalability; Computation; Graph partition; Graph; Hash function; PageRank; Cluster analysis","score_opus":0.015418300803078554,"score_gpt":0.24805465861994724,"score_spread":0.2326363578168687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7095580264","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.024069758,0.00009022543,0.97438455,0.00011907185,0.00037646285,0.00011466901,0.00003185516,0.00022288672,0.00059055066],"genre_scores_gemma":[0.963245,0.0000025899897,0.03637634,0.00017042679,0.000054946002,0.00003863857,0.000027433085,0.0000049269697,0.00007974586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991077,0.0000328347,0.00012737824,0.0001650713,0.00009728917,0.00046968085],"domain_scores_gemma":[0.99944115,0.00010750497,0.000040573254,0.00024691137,0.00004220557,0.00012168615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043914924,0.00009224796,0.00008933685,0.000072082745,0.0002765655,0.00008070979,0.00029365765,0.00003448432,0.000025100882],"category_scores_gemma":[0.000027257764,0.00007904747,0.00010367266,0.0003604066,0.000016645432,0.00073393784,0.000073641226,0.00005173765,0.000015911573],"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.0000014229894,0.00006506852,0.004273265,0.0000048975357,0.00001196181,5.17178e-7,0.00015776118,0.000005184937,0.00011025692,0.9914908,0.00036017483,0.0035187325],"study_design_scores_gemma":[0.001470906,0.00014992335,0.03226697,0.00003742133,0.00003135177,0.000030639094,0.00039536317,0.031291228,0.012989526,0.8958844,0.024708468,0.0007438052],"about_ca_topic_score_codex":0.0000018869408,"about_ca_topic_score_gemma":0.0000020062428,"teacher_disagreement_score":0.9391752,"about_ca_system_score_codex":0.000006200593,"about_ca_system_score_gemma":0.0000066110765,"threshold_uncertainty_score":0.32234624},"labels":[],"label_agreement":null},{"id":"W7097206564","doi":"","title":"Graphs and Networks Lecture 19 Graph Clustering: Spectral Methods and Normalized Cuts","year":2010,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cluster analysis; Heuristics; Partition (number theory); Graph partition; Spectral clustering; Graph; Segmentation; Cut","score_opus":0.007981789090917072,"score_gpt":0.27309763190011266,"score_spread":0.2651158428091956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097206564","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.050474666,0.00031608972,0.9460641,0.00034217502,0.00066493166,0.00011211704,6.077209e-7,0.00020286476,0.0018224365],"genre_scores_gemma":[0.4316703,0.00008054747,0.5673413,0.0006804175,0.000051143357,0.000005770424,0.0000010248716,0.000008574987,0.00016087726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998904,0.00012996254,0.00015142452,0.0003992473,0.00009127098,0.00032410378],"domain_scores_gemma":[0.9991957,0.00015041746,0.00004473399,0.000363039,0.000023739844,0.00022240278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067733205,0.00017697578,0.0001854429,0.00013571096,0.00021376384,0.00023683446,0.0003662331,0.00011587287,0.00003007105],"category_scores_gemma":[0.000021058459,0.00013694247,0.00006294171,0.00039347008,0.00016124333,0.0003269136,0.00025367818,0.0003595922,9.326328e-7],"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.000030747975,0.00004653499,0.002108229,0.00002228554,0.0000615935,0.00003231478,0.0010154392,0.0002113013,0.010013178,0.7861627,0.00038270862,0.199913],"study_design_scores_gemma":[0.0010441011,0.00015867823,0.008093167,0.000009483947,0.000022278016,0.0005435092,0.000028177243,0.35193673,0.0041512945,0.62997955,0.0034692963,0.00056372123],"about_ca_topic_score_codex":0.000022411648,"about_ca_topic_score_gemma":0.00006878162,"teacher_disagreement_score":0.38119566,"about_ca_system_score_codex":0.0000017116481,"about_ca_system_score_gemma":0.000010449052,"threshold_uncertainty_score":0.5584352},"labels":[],"label_agreement":null},{"id":"W7097564016","doi":"","title":"CMU-ML-10-100 Fast Nearest-neighbor Search in Disk-resident Graphs","year":2010,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cluster analysis; Graph; Computation; Node (physics); Degree (music); Clustering coefficient; Random walk; Cluster (spacecraft)","score_opus":0.010654942761539664,"score_gpt":0.2513865257996696,"score_spread":0.24073158303812991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097564016","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.91426796,0.000040098592,0.058549456,0.0019284694,0.0011117096,0.00035560213,0.0000057905972,0.00037344947,0.02336748],"genre_scores_gemma":[0.98620015,0.0000068913287,0.00996614,0.00021742343,0.00006263444,0.000019018837,0.0000017386071,0.00001172062,0.0035142542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9982124,0.00012083793,0.00024908714,0.00051122694,0.0003870696,0.0005193596],"domain_scores_gemma":[0.99870425,0.00016812583,0.000035483932,0.00081904116,0.00006998015,0.00020313937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069486554,0.00017789855,0.00017269704,0.00031305256,0.0001525277,0.00028170474,0.0013928019,0.000095447045,0.00078403973],"category_scores_gemma":[0.000040305593,0.00014496438,0.00010145804,0.0009222783,0.0001412825,0.00054899114,0.00040668674,0.00044378638,0.00041775536],"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.000016880593,0.00018676813,0.018171523,0.0000146821985,0.000015489577,0.00015960303,0.0015623596,0.00007710389,0.005360705,0.92446667,0.0011726168,0.048795596],"study_design_scores_gemma":[0.0022177668,0.00048470357,0.4521706,0.00006926632,0.000009508855,0.00012790658,0.00048483594,0.0744894,0.036870398,0.42533723,0.006183274,0.0015551086],"about_ca_topic_score_codex":0.00026050684,"about_ca_topic_score_gemma":0.0005564502,"teacher_disagreement_score":0.49912944,"about_ca_system_score_codex":0.000011366086,"about_ca_system_score_gemma":0.000068566136,"threshold_uncertainty_score":0.85846853},"labels":[],"label_agreement":null},{"id":"W7099173269","doi":"","title":"Modeling of parameters affecting phytate phosphorus bioavailability in growing birds. Poultry Science","year":2004,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Bioavailability; Phosphorus; Population; Nutrient; Nitrogen; Phytase; Animal feed","score_opus":0.01574395944478938,"score_gpt":0.24221330614972192,"score_spread":0.22646934670493254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099173269","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.6867796,0.00004931704,0.31215906,0.000074596894,0.00017971505,0.00008876838,2.7595536e-7,0.000087726694,0.00058090215],"genre_scores_gemma":[0.88739955,0.0000055625214,0.11249197,0.000086364926,0.0000052849073,0.0000032275927,9.295402e-8,0.000004814691,0.0000031238746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983576,0.000046470366,0.00031919638,0.0005364614,0.00031521532,0.0004250494],"domain_scores_gemma":[0.9991983,0.00008613643,0.000059968872,0.00049052236,0.000077199154,0.00008786716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019086055,0.00013405297,0.00019011395,0.0002868016,0.00014429209,0.00008872861,0.00093006244,0.000037649486,0.0000014992335],"category_scores_gemma":[0.0001654056,0.00011825577,0.00007767368,0.001996694,0.00024803844,0.0015219728,0.00025429754,0.00016308847,0.000007366944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021125783,0.00039667374,0.0144627215,0.00006118562,0.0000135927985,0.000026163794,0.0052922345,0.6950858,0.061875958,0.15928327,3.56655e-7,0.06348093],"study_design_scores_gemma":[0.0006559421,0.00009801894,0.0013396892,0.00011483589,0.0000028891338,0.000010834524,0.0011670784,0.65610254,0.2225203,0.11769474,5.173337e-7,0.00029258913],"about_ca_topic_score_codex":0.0005834863,"about_ca_topic_score_gemma":0.000009311743,"teacher_disagreement_score":0.2006199,"about_ca_system_score_codex":0.00008177047,"about_ca_system_score_gemma":0.0001356797,"threshold_uncertainty_score":0.48223305},"labels":[],"label_agreement":null},{"id":"W7099364543","doi":"","title":"GYNAECOLOGY Diagnostic Criteria for Polycystic Ovary Syndrome: Pitfalls and Controversies","year":2015,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Polycystic ovary; Anovulation; Hyperandrogenism; Androgen Excess; Stein-Leventhal Syndrome; Endocrine system; Androgen","score_opus":0.019469045144892984,"score_gpt":0.25784196140793936,"score_spread":0.23837291626304638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099364543","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.045255944,0.0006245833,0.9438787,0.0015907679,0.002295579,0.00047778702,0.000013735468,0.0002275389,0.0056353416],"genre_scores_gemma":[0.9739271,0.0000058617666,0.024497408,0.0010394497,0.000029541116,0.00003714666,0.000002215853,0.000005831272,0.00045547314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992037,0.00006348826,0.00013070005,0.0002633414,0.000080798,0.00025799705],"domain_scores_gemma":[0.9972418,0.002279792,0.00003499404,0.0002232966,0.00005936265,0.00016078004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000334101,0.000108426866,0.0001758088,0.000076965734,0.00008271139,0.00010143878,0.00033118966,0.000052734365,0.000058374913],"category_scores_gemma":[0.00094468746,0.000092671995,0.00003574725,0.0001042128,0.00009432569,0.00033669986,0.00016015144,0.000045633027,0.000022511407],"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.00006193912,0.00016550826,0.0011660362,0.000044873163,0.000094095405,0.00020765854,0.0011733517,0.00001601826,0.00007948996,0.93778604,0.023305984,0.035899013],"study_design_scores_gemma":[0.005585149,0.0026655046,0.08102029,0.000011125757,0.000070151225,0.00092625787,0.00044942542,0.04971524,0.00047541587,0.8487281,0.009536031,0.0008172989],"about_ca_topic_score_codex":0.000007783228,"about_ca_topic_score_gemma":0.0000020608622,"teacher_disagreement_score":0.9286711,"about_ca_system_score_codex":0.000015251044,"about_ca_system_score_gemma":0.00004212063,"threshold_uncertainty_score":0.37790543},"labels":[],"label_agreement":null},{"id":"W7118015018","doi":"10.1145/3712285.3787178","title":"10.1145/3712285.3787178","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Pattern matching; Graph; Matching (statistics)","score_opus":0.003895837417355556,"score_gpt":0.16112312151522748,"score_spread":0.15722728409787193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118015018","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058100146,0.00003459503,0.0007689398,0.0004268497,0.000007868889,0.00009761596,0.0000029180253,0.00028374614,0.9977965],"genre_scores_gemma":[0.0006114102,1.5490201e-7,0.0032944635,0.0001886301,0.000068010624,0.000009017272,0.0000016684478,0.000007969721,0.9958187],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912363,0.000050068145,0.00012041586,0.000278263,0.00015860869,0.0002689849],"domain_scores_gemma":[0.9992711,0.000041831157,0.00001702301,0.0004983463,0.00002608208,0.00014562873],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019214468,0.0001116584,0.00011187867,0.00007269588,0.0001027622,0.00009782757,0.00079014676,0.000036953217,0.95049363],"category_scores_gemma":[0.000010193552,0.00010457326,0.000058933765,0.00040049414,0.000026420726,0.00024368633,0.00009095585,0.000074778116,0.9766506],"study_design_candidate":"not_applicable","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.000008341795,0.000036368143,6.594306e-8,0.0000013600841,0.000006491042,0.000011681924,0.00004134622,0.00007486588,0.000041504052,0.00049285166,0.024888547,0.9743966],"study_design_scores_gemma":[0.00012255662,0.00010219191,0.000025177846,0.0000069815196,0.0000026958985,0.000012829742,2.8522447e-7,0.0037027511,0.00021065591,0.0010482037,0.99460965,0.00015600638],"about_ca_topic_score_codex":0.0000035748067,"about_ca_topic_score_gemma":1.7617488e-8,"teacher_disagreement_score":0.97424054,"about_ca_system_score_codex":0.000009965994,"about_ca_system_score_gemma":0.000016627664,"threshold_uncertainty_score":0.42643738},"labels":[],"label_agreement":null},{"id":"W7119113086","doi":"10.1145/3725843.3786401","title":"10.1145/3725843.3786401","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Graph; Term (time); Component (thermodynamics)","score_opus":0.003938602793886749,"score_gpt":0.1612544679223201,"score_spread":0.15731586512843335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7119113086","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006026628,0.00003588316,0.00083363085,0.00042375588,0.000008226078,0.00009658204,0.0000030631973,0.00028783077,0.9977084],"genre_scores_gemma":[0.0005560319,1.6371968e-7,0.0032433278,0.00018261325,0.00006866905,0.000008908318,0.0000017052378,0.000008154872,0.99593043],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913037,0.000048932983,0.000120420365,0.00027537384,0.00015537902,0.00026953226],"domain_scores_gemma":[0.99927,0.000041570707,0.000016812968,0.0004980966,0.000025909732,0.00014760168],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019263136,0.000111221816,0.000111967536,0.000072671,0.00010120745,0.000097200376,0.0008006346,0.000036543002,0.9482402],"category_scores_gemma":[0.000010153293,0.000104304294,0.000059427693,0.00040127675,0.000026757594,0.00024311956,0.000094010895,0.00007535392,0.97510344],"study_design_candidate":"not_applicable","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.000008202183,0.00003502052,6.1004855e-8,0.0000013622761,0.0000063563916,0.000011162321,0.000040244064,0.00007450028,0.00004905836,0.00048056224,0.023310304,0.97598314],"study_design_scores_gemma":[0.00011829692,0.000105858555,0.00002699989,0.000007337534,0.0000026725886,0.000013928171,3.927552e-7,0.0037052315,0.00018380949,0.001019126,0.99466056,0.00015577576],"about_ca_topic_score_codex":0.000003731451,"about_ca_topic_score_gemma":2.2116502e-8,"teacher_disagreement_score":0.9758274,"about_ca_system_score_codex":0.000010207867,"about_ca_system_score_gemma":0.000015764674,"threshold_uncertainty_score":0.42534056},"labels":[],"label_agreement":null},{"id":"W7131069251","doi":"10.57717/cgt.v5i2.72","title":"Finding maximum matchings in RDV graphs efficiently","year":2024,"lang":"en","type":"article","venue":"Computing in Geometry and Topology","topic":"Graph Theory 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":"University of Waterloo","funders":"","keywords":"Matching (statistics); Graph; Set (abstract data type); Representation (politics); Range (aeronautics); Independent set","score_opus":0.010241587883671792,"score_gpt":0.2600547494874061,"score_spread":0.2498131616037343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7131069251","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.89108914,0.0015036167,0.10464993,0.00044527234,0.0012731424,0.00006103796,7.081902e-7,0.0001244901,0.0008526646],"genre_scores_gemma":[0.9946588,0.000020434958,0.0050323186,0.00019693842,0.000039696068,0.0000017629337,0.0000011059946,0.000006437149,0.00004248552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986738,0.00011574527,0.00025060202,0.0004746148,0.00008510467,0.00040013276],"domain_scores_gemma":[0.9992432,0.00047506893,0.00003089386,0.00019082827,0.000008852744,0.00005114619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009258606,0.00012980787,0.00018965309,0.00081760867,0.00010246265,0.00013443564,0.00040173202,0.00009899608,0.000016498398],"category_scores_gemma":[0.00004595661,0.00012834964,0.000044926495,0.001713209,0.0001197307,0.00016028155,0.00035503783,0.0003697769,0.000016624232],"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.0000055893106,0.00007426681,0.023062449,0.00010820526,0.000013675081,0.0005165808,0.003385915,0.0014605054,0.00012032903,0.8099702,0.000047681195,0.16123462],"study_design_scores_gemma":[0.00052676286,0.00015282043,0.047411088,0.00029464884,0.000004555154,0.00035478358,0.00028486084,0.43746877,0.00030568495,0.51207006,0.000720766,0.00040520896],"about_ca_topic_score_codex":0.00003676055,"about_ca_topic_score_gemma":0.000004941967,"teacher_disagreement_score":0.43600824,"about_ca_system_score_codex":0.00001848597,"about_ca_system_score_gemma":0.000019540308,"threshold_uncertainty_score":0.52339464},"labels":[],"label_agreement":null},{"id":"W7133038545","doi":"","title":"Automatic Compiler-based Optimizations for Deep Neural Networks","year":2024,"lang":"","type":"dissertation","venue":"TSpace","topic":"Graph Theory 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":"University of Toronto","funders":"","keywords":"Compiler; Key (lock); Graph; Alias; Artificial neural network; Implementation; Optimizing compiler; Deep learning; Code (set theory)","score_opus":0.018440336560198764,"score_gpt":0.31569687617411274,"score_spread":0.29725653961391396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133038545","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.0046284827,0.0018525764,0.98101133,0.0010055257,0.008541513,0.0016072528,0.000020420803,0.00065083767,0.000682075],"genre_scores_gemma":[0.7449773,0.00004857419,0.2400549,0.0009639899,0.0009968787,0.0009983048,0.0023206554,0.0002809711,0.009358441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99640375,0.0002536343,0.00075877924,0.001235493,0.0004397972,0.0009085402],"domain_scores_gemma":[0.99698544,0.0008538199,0.00044284776,0.0010230208,0.00038547258,0.00030939523],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005413538,0.0007928311,0.0007245639,0.0004914671,0.00088242296,0.0011558263,0.0015040501,0.00049466046,0.0003554859],"category_scores_gemma":[0.000092584545,0.00082216656,0.000683435,0.0016746244,0.0001469157,0.00031645104,0.00011753319,0.0007424134,0.00009644404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004494798,0.00020377185,0.0000047370145,0.00086470234,0.00016444072,0.000027131484,0.009985873,0.88459206,0.000016905857,0.028978545,0.0007368291,0.074380085],"study_design_scores_gemma":[0.0006277367,0.0003170871,0.00005145714,0.0004494129,0.0003424045,0.000009430518,0.0014234568,0.991776,0.000087289205,0.003726373,0.00034718763,0.00084219105],"about_ca_topic_score_codex":0.00001434618,"about_ca_topic_score_gemma":0.00003468095,"teacher_disagreement_score":0.7409564,"about_ca_system_score_codex":0.00007904964,"about_ca_system_score_gemma":0.00023957097,"threshold_uncertainty_score":0.9998811},"labels":[],"label_agreement":null},{"id":"W7133713936","doi":"10.1109/ccnis69465.2025.00025","title":"A Practical Recipe for Structured Pruning of MotionGPT: Dependency-Graph Pruning and FFN Channel Reduction","year":2025,"lang":"","type":"article","venue":"","topic":"Graph Theory 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":"University of Toronto","funders":"","keywords":"Recipe; Pruning; Channel (broadcasting); Reduction (mathematics); Pattern recognition (psychology)","score_opus":0.024645136460864043,"score_gpt":0.30085547417859915,"score_spread":0.2762103377177351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133713936","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.035070956,0.00050279615,0.95735407,0.0024559235,0.0024266678,0.0009893785,0.00001130158,0.00009307145,0.0010958643],"genre_scores_gemma":[0.8324989,0.00012414229,0.16581282,0.0000690088,0.00011137599,0.000041747746,0.0000043947953,0.000014345745,0.0013232663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970661,0.0003001484,0.0007705105,0.0009691867,0.00033769864,0.0005563922],"domain_scores_gemma":[0.9979431,0.00038865602,0.000406845,0.0006143001,0.00048144523,0.00016565977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013932496,0.00035965044,0.0004919342,0.00064112217,0.00064934633,0.00027939223,0.0004709152,0.00030176438,0.000031674103],"category_scores_gemma":[0.00042802698,0.00035146828,0.0002041124,0.0014852798,0.00035248292,0.001219652,0.000362169,0.00042169035,9.206961e-7],"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.00023172174,0.0002433024,0.000108398424,0.0004705686,0.00028362774,0.0000061746146,0.0034972627,0.000573894,0.00876677,0.87262976,0.00030469245,0.11288381],"study_design_scores_gemma":[0.0016457026,0.0005972324,0.0015158374,0.00058823946,0.00021020338,0.0001377078,0.0021025017,0.33588618,0.0371832,0.6194734,0.00016305962,0.000496744],"about_ca_topic_score_codex":0.000020868416,"about_ca_topic_score_gemma":0.000008122717,"teacher_disagreement_score":0.79742795,"about_ca_system_score_codex":0.00003514899,"about_ca_system_score_gemma":0.00030717129,"threshold_uncertainty_score":0.9998937},"labels":[],"label_agreement":null}]}