{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15185544,0.0073427847,0.47345695,0.012721834,0.0062456597,0.0010567328,0.036511913,0.06525137,0.24555734],"genre_scores_gemma":[0.43879902,0.0018664808,0.43239474,0.003981123,0.00070216804,0.0011603542,0.06887587,0.01655069,0.035669494],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580896,0.0013534302,0.00022834998,0.00085188955,0.0011904837,0.00056680525],"domain_scores_gemma":[0.9937202,0.0018641982,0.00021473032,0.0024463397,0.0011522523,0.00060230156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036169875,0.0019115136,0.0013715866,0.0027552184,0.0017666699,0.0034015763,0.005955392,0.0027343805,0.016972274],"category_scores_gemma":[0.015601923,0.00072485476,0.001044078,0.0038540105,0.0018061135,0.006228023,0.0051759034,0.0032631736,0.0055198153],"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.001162249,0.00074385916,0.0021477567,0.0016826078,0.00018484406,0.00016727226,0.00019848089,0.07550251,0.0077209934,0.20991021,0.4741463,0.22643292],"study_design_scores_gemma":[0.0003371987,0.00041766386,0.0014919166,0.000434698,0.00012623306,0.0002467682,0.00034302022,0.25982046,0.015291265,0.5478974,0.17351893,0.00007441858],"about_ca_topic_score_codex":0.0049344744,"about_ca_topic_score_gemma":0.0075719105,"teacher_disagreement_score":0.016972274,"about_ca_system_score_codex":0.0019238978,"about_ca_system_score_gemma":0.0022916705,"threshold_uncertainty_score":0.056777894},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8260836,0.00032845748,0.13794765,0.0003412632,0.000108614986,0.000051367435,0.00011831473,0.00047147815,0.034549188],"genre_scores_gemma":[0.9820796,0.00013206176,0.01124924,0.000039754137,0.00003080628,0.000017863142,0.00009478945,0.00010331815,0.0062525105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997545,0.00003891093,0.000009926702,0.000059610837,0.00008881083,0.000048352333],"domain_scores_gemma":[0.99961674,0.00007372059,0.000067284614,0.000079977326,0.00008418177,0.00007801655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022002366,0.00030365933,0.0004148643,0.0018227857,0.00066779484,0.001425788,0.00069532555,0.00087803905,0.004512611],"category_scores_gemma":[0.0021498615,0.0003309964,0.00029758827,0.0006846374,0.000777536,0.0011067283,0.0013223138,0.0005147289,0.00091159344],"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.00020215599,0.00009444143,0.0025208604,0.000114710136,0.000039959476,0.00061157934,0.00053330336,0.017510394,0.05078766,0.8385014,0.0024288942,0.08665458],"study_design_scores_gemma":[0.000033046763,0.00006931752,0.0041555506,0.000028601276,0.000022158105,0.0011958344,0.00065158535,0.10645489,0.0115193715,0.8687935,0.007047401,0.000028788732],"about_ca_topic_score_codex":0.0008588646,"about_ca_topic_score_gemma":0.000788699,"teacher_disagreement_score":0.004512611,"about_ca_system_score_codex":0.00055875443,"about_ca_system_score_gemma":0.00031851477,"threshold_uncertainty_score":0.015096188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005285523,0.00063879695,0.97467506,0.0005546501,0.00067867036,0.00013322594,0.00034097562,0.0023029777,0.015390098],"genre_scores_gemma":[0.03192486,0.00051816803,0.9478501,0.00042063012,0.00039781036,0.00023672023,0.00092766114,0.0008046327,0.016919384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987091,0.00019436362,0.00006912176,0.00040828422,0.0004931487,0.0001259593],"domain_scores_gemma":[0.9988927,0.00027038244,0.000060520408,0.00038966845,0.00026374523,0.0001229878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008899719,0.0012451487,0.002051908,0.002059847,0.0014138732,0.0025260204,0.0035297275,0.0020383457,0.020786906],"category_scores_gemma":[0.003119823,0.0007552598,0.0015795376,0.0031629405,0.00090145227,0.004404215,0.0041423254,0.0031758843,0.0067438493],"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.0003321625,0.00025075,0.0003437897,0.00024439374,0.000100791076,0.000082987346,0.00008693235,0.034384444,0.0070116776,0.118851095,0.050023567,0.78828746],"study_design_scores_gemma":[0.00026881517,0.00018063074,0.0004167849,0.00008842908,0.00012167167,0.00038714882,0.00010952272,0.4823026,0.007813372,0.4100854,0.09815857,0.00006703755],"about_ca_topic_score_codex":0.0014645702,"about_ca_topic_score_gemma":0.002500268,"teacher_disagreement_score":0.020786906,"about_ca_system_score_codex":0.0012536532,"about_ca_system_score_gemma":0.0018120514,"threshold_uncertainty_score":0.06953913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20066097,0.00053919107,0.7730432,0.00063994474,0.00016028748,0.00010850416,0.0005246496,0.000982191,0.023341063],"genre_scores_gemma":[0.7972604,0.0006597781,0.17656343,0.00018112457,0.00015805833,0.00010738872,0.0013818567,0.00048358194,0.023204412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971284,0.00061099103,0.00019297621,0.00067165477,0.0010533647,0.00034262543],"domain_scores_gemma":[0.99003184,0.0038516135,0.0010842176,0.0034460803,0.0010114053,0.00057474774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018923762,0.0007534656,0.0016519452,0.002122948,0.0017833216,0.0033493314,0.0045172423,0.0020282827,0.0077230935],"category_scores_gemma":[0.01508801,0.0011255356,0.0010087476,0.0046556843,0.0017590625,0.010770384,0.0053549516,0.0032977753,0.0012171442],"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.0003979986,0.00019498335,0.0017892432,0.00029339528,0.00008463736,0.0005849532,0.00059396256,0.0945418,0.006274629,0.7890087,0.004291275,0.101944484],"study_design_scores_gemma":[0.000019601384,0.000023485794,0.00037365398,0.000029203691,0.00003531521,0.00025620684,0.00017506281,0.17617323,0.0051243813,0.81371886,0.0040517077,0.000019303676],"about_ca_topic_score_codex":0.0015848661,"about_ca_topic_score_gemma":0.0020488112,"teacher_disagreement_score":0.0077230935,"about_ca_system_score_codex":0.0018825963,"about_ca_system_score_gemma":0.0012704785,"threshold_uncertainty_score":0.025836349},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00752885,0.09314276,0.70250833,0.020938925,0.024803502,0.00086217985,0.0041385735,0.016505228,0.12957166],"genre_scores_gemma":[0.055128075,0.073385105,0.3653917,0.0046941102,0.0067289034,0.00093895633,0.013575185,0.0071956073,0.47296235],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982242,0.00031537103,0.00012413126,0.00024769484,0.0009137729,0.00017481692],"domain_scores_gemma":[0.997134,0.00069563376,0.00006531565,0.00042667956,0.0013057154,0.00037268823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003982236,0.001661322,0.001962582,0.0018009422,0.0024668528,0.0069291033,0.002420192,0.0014887977,0.028927041],"category_scores_gemma":[0.0054568234,0.0016121131,0.00083667965,0.0042170836,0.0021414643,0.0050534518,0.0026822276,0.0034470062,0.012224295],"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.0000919062,0.000079666104,0.00035786675,0.00038092828,0.000025749578,0.000095023956,0.00024885274,0.0018061214,0.0019457279,0.03919817,0.79488236,0.16088769],"study_design_scores_gemma":[0.000063767875,0.000076833916,0.000866378,0.0003313085,0.000059274153,0.0004822354,0.00024814144,0.016893318,0.003416025,0.05483724,0.92267746,0.000047983136],"about_ca_topic_score_codex":0.065367356,"about_ca_topic_score_gemma":0.1127335,"teacher_disagreement_score":0.065367356,"about_ca_system_score_codex":0.0056118616,"about_ca_system_score_gemma":0.012460692,"threshold_uncertainty_score":0.12997371},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045660296,0.0005097428,0.99180436,0.00010242422,0.000053687058,0.00006893857,0.0000910966,0.0011069018,0.0016969015],"genre_scores_gemma":[0.048993915,0.00038883768,0.94728655,0.00008309728,0.00007117665,0.00015108257,0.000355886,0.00051558204,0.0021538301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910873,0.0002469789,0.000045475193,0.00024590152,0.00025218682,0.00010073135],"domain_scores_gemma":[0.99589044,0.0026431018,0.00024093225,0.0004711843,0.00056925014,0.00018518265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017286818,0.0017036031,0.0031503595,0.0029134138,0.0011266216,0.002404177,0.0035106323,0.0024571198,0.00731588],"category_scores_gemma":[0.007312993,0.0013426936,0.0012753468,0.0059959036,0.0018946562,0.0034669952,0.0020159686,0.0031163606,0.0013865153],"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.00018488633,0.00024822354,0.0003915724,0.00026872676,0.0000792077,0.000086174194,0.0001292141,0.49524492,0.0026408534,0.05562636,0.015237548,0.42986238],"study_design_scores_gemma":[0.000036077596,0.000031145824,0.00010410636,0.000013911287,0.0000115924295,0.000028233952,0.000029604282,0.9689651,0.000715315,0.028533094,0.0015190893,0.000012758315],"about_ca_topic_score_codex":0.016126303,"about_ca_topic_score_gemma":0.020072581,"teacher_disagreement_score":0.016126303,"about_ca_system_score_codex":0.0022351642,"about_ca_system_score_gemma":0.0027985133,"threshold_uncertainty_score":0.032064855},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013357901,0.0004146497,0.98020566,0.000116224575,0.0001453582,0.00011913018,0.00014054995,0.0025635944,0.002936851],"genre_scores_gemma":[0.08563712,0.00020315437,0.9084787,0.00013391518,0.00008675163,0.00018239579,0.0005776858,0.00055618904,0.0041441377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977204,0.00062997866,0.00013800655,0.0003715223,0.0009672759,0.000172781],"domain_scores_gemma":[0.9962031,0.0014579671,0.00017358073,0.0011547679,0.0009206832,0.00008977715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001540625,0.00095337006,0.0019940492,0.00341832,0.0012924493,0.0020650122,0.0031827984,0.0022294172,0.011571978],"category_scores_gemma":[0.009677489,0.00065519725,0.0011646692,0.006161982,0.0008181152,0.0042698095,0.0021022472,0.0013336481,0.0041477266],"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.0005349739,0.00032795448,0.0008174171,0.00023025885,0.00011010075,0.000069905254,0.000112980655,0.09734602,0.010706944,0.031421177,0.01166385,0.84665847],"study_design_scores_gemma":[0.000063667554,0.00013085392,0.00023041679,0.000019036652,0.00003900149,0.00016719385,0.00005643258,0.955079,0.008488601,0.03003213,0.005670391,0.000023154584],"about_ca_topic_score_codex":0.0035384023,"about_ca_topic_score_gemma":0.0044462853,"teacher_disagreement_score":0.011571978,"about_ca_system_score_codex":0.001163557,"about_ca_system_score_gemma":0.0015611672,"threshold_uncertainty_score":0.038712084},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008452957,0.0005460551,0.9260325,0.0003621896,0.00018908325,0.00010946973,0.0027732211,0.05475288,0.0067815585],"genre_scores_gemma":[0.07046709,0.0015535438,0.89900833,0.000227888,0.00007146951,0.00041642427,0.0044600605,0.01450539,0.009289746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965906,0.00007612768,0.000026730899,0.000057254347,0.00013902456,0.00004183037],"domain_scores_gemma":[0.99906296,0.00047914786,0.000045088957,0.00020143011,0.00013899745,0.0000723287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004678453,0.0021711034,0.0010933012,0.001908204,0.0006481048,0.002879253,0.0020556757,0.00093532127,0.042510528],"category_scores_gemma":[0.0018183602,0.001059089,0.0013400293,0.0018887727,0.0005491846,0.0022190223,0.0026982478,0.0018905579,0.007628274],"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.0005043642,0.00013557001,0.0008998602,0.0018576697,0.0001778586,0.0008248475,0.0016599705,0.031258836,0.06188199,0.051418595,0.17133714,0.6780432],"study_design_scores_gemma":[0.0004226831,0.00014226515,0.0018985211,0.000474437,0.00015087811,0.0015082452,0.0007000827,0.42911044,0.097267404,0.1421107,0.32590702,0.0003072394],"about_ca_topic_score_codex":0.0019486137,"about_ca_topic_score_gemma":0.002915255,"teacher_disagreement_score":0.042510528,"about_ca_system_score_codex":0.0003946702,"about_ca_system_score_gemma":0.0006551461,"threshold_uncertainty_score":0.14221191},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056738164,0.024646875,0.8648663,0.010925606,0.0021873666,0.00026896768,0.007587638,0.0072725136,0.07657087],"genre_scores_gemma":[0.073662736,0.039407797,0.59766555,0.0015325885,0.0012431127,0.000732778,0.021089874,0.0046495744,0.26001605],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991999,0.00015237372,0.000047241,0.00022185556,0.0003001706,0.000078439756],"domain_scores_gemma":[0.99778724,0.0010305629,0.00009344263,0.00045426333,0.0004945638,0.00013979484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013559666,0.0016721499,0.0016252177,0.002036427,0.0012472252,0.007086353,0.0034072546,0.001946872,0.03234856],"category_scores_gemma":[0.0040837894,0.0015347098,0.0014967638,0.0044622733,0.0015789173,0.0075298245,0.00146547,0.003224611,0.01245679],"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.000091474176,0.000111243775,0.000546704,0.00066642655,0.000052654486,0.00013376676,0.00024996,0.025545912,0.0012151857,0.30596536,0.45131683,0.21410449],"study_design_scores_gemma":[0.000046775906,0.00003470098,0.0006744674,0.00029243474,0.00004672392,0.00043616843,0.00022211624,0.10494952,0.001541588,0.560562,0.3311319,0.00006156074],"about_ca_topic_score_codex":0.03594524,"about_ca_topic_score_gemma":0.06782827,"teacher_disagreement_score":0.96405476,"about_ca_system_score_codex":0.0064646294,"about_ca_system_score_gemma":0.0039376584,"threshold_uncertainty_score":0.10821664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006984071,0.00059244124,0.9900737,0.00016572674,0.00007502845,0.000041571675,0.000059721115,0.00083307456,0.0011747937],"genre_scores_gemma":[0.13039346,0.00080784614,0.8629963,0.00018497452,0.00017866268,0.00009953564,0.0004812139,0.00065637066,0.0042016357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99367934,0.003273252,0.00023347688,0.00079102407,0.0018148532,0.00020808603],"domain_scores_gemma":[0.974482,0.018078543,0.0007261475,0.0029261468,0.0034240822,0.00036316848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005920775,0.0012380058,0.0022653835,0.0033287073,0.00091530755,0.0025373346,0.0040824027,0.0020836142,0.005472097],"category_scores_gemma":[0.02563606,0.00086322654,0.0013352005,0.0050709522,0.0015187127,0.0065008164,0.0032804643,0.0019774993,0.0021208853],"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.00086925057,0.0005111026,0.001965882,0.00044645788,0.00035245632,0.000040752533,0.0002381875,0.20967959,0.0040502534,0.052042328,0.006711305,0.72309256],"study_design_scores_gemma":[0.000043854234,0.00006547062,0.00041982328,0.000020201238,0.000039387312,0.00006224496,0.00010504184,0.9523068,0.0018853614,0.042930048,0.0020991026,0.000022543052],"about_ca_topic_score_codex":0.003825625,"about_ca_topic_score_gemma":0.0055379947,"teacher_disagreement_score":0.005920775,"about_ca_system_score_codex":0.0010067415,"about_ca_system_score_gemma":0.0019393575,"threshold_uncertainty_score":0.031312406},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28639048,0.0005150558,0.4421528,0.0012306824,0.0004362971,0.0005261217,0.0040674014,0.21636105,0.0483201],"genre_scores_gemma":[0.5510786,0.00012584837,0.4234983,0.00027509188,0.000044129352,0.0002452116,0.003989307,0.011988866,0.008754582],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970535,0.0009008653,0.00013990054,0.0006147816,0.00094335986,0.00034754974],"domain_scores_gemma":[0.99106205,0.003972409,0.00029580956,0.0031778147,0.0011422129,0.00034969783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001968506,0.001747029,0.0005984272,0.0013485819,0.0009378801,0.0012096933,0.0047067436,0.0018821644,0.013906727],"category_scores_gemma":[0.010088344,0.0011045729,0.0007482796,0.001517065,0.0013810232,0.0036378996,0.0016744017,0.0014518988,0.0032363923],"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.0032008162,0.0015261114,0.0145751275,0.0010474989,0.00017146654,0.0005047414,0.0011482384,0.1436755,0.045884203,0.025477728,0.15048307,0.6123054],"study_design_scores_gemma":[0.0007289313,0.0007533456,0.0032454447,0.000095376,0.0000990128,0.00028292698,0.0004867624,0.81209016,0.12728968,0.02412753,0.030718308,0.000082571045],"about_ca_topic_score_codex":0.010625358,"about_ca_topic_score_gemma":0.011614324,"teacher_disagreement_score":0.013906727,"about_ca_system_score_codex":0.0014235121,"about_ca_system_score_gemma":0.0017610649,"threshold_uncertainty_score":0.046522617},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063782185,0.00013737481,0.9893596,0.00038413212,0.000034534984,0.00009421062,0.00043645926,0.0004948845,0.0026804893],"genre_scores_gemma":[0.2931765,0.0009744509,0.68634564,0.00057568814,0.00024039655,0.0008188349,0.0023812077,0.0007777395,0.01470962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662507,0.0010292359,0.00017615841,0.0009865764,0.0008536132,0.00032932262],"domain_scores_gemma":[0.9955882,0.0022874863,0.0003919826,0.0010317621,0.0004592055,0.00024137813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002531805,0.0013726844,0.0036799756,0.0022397107,0.001204661,0.0035734859,0.0078474535,0.005095236,0.011794543],"category_scores_gemma":[0.012968024,0.0021328288,0.0031128828,0.0049622618,0.002047436,0.008727112,0.004522484,0.0038555409,0.0028114028],"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.00021617745,0.0001780484,0.00045416804,0.00022399762,0.00007786894,0.000101770056,0.00014781834,0.598474,0.0014342781,0.3254094,0.006666546,0.06661594],"study_design_scores_gemma":[0.000027580725,0.000018346827,0.000058484475,0.000014175937,0.000023176444,0.000035577992,0.000012770621,0.7451728,0.00021172837,0.25330314,0.0011079727,0.000014165652],"about_ca_topic_score_codex":0.005481286,"about_ca_topic_score_gemma":0.006285838,"teacher_disagreement_score":0.011794543,"about_ca_system_score_codex":0.0027057505,"about_ca_system_score_gemma":0.0023435706,"threshold_uncertainty_score":0.039456666},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043074125,0.00012589604,0.9922472,0.0001789451,0.000058594294,0.00009498348,0.000058157,0.0012859319,0.0016427835],"genre_scores_gemma":[0.13347867,0.00012014326,0.8618774,0.00013200592,0.000054524833,0.0003336293,0.00039055856,0.00022671865,0.0033863587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991721,0.00015809866,0.00004427325,0.00025494705,0.00027464298,0.000095922136],"domain_scores_gemma":[0.9989415,0.00038555652,0.00008383218,0.00026834768,0.00023826923,0.00008255799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076587114,0.0010164992,0.0010889139,0.0009234947,0.0013054003,0.0012429304,0.002184994,0.0014467941,0.004544901],"category_scores_gemma":[0.0027449697,0.00051630154,0.0008326497,0.0012229413,0.0006888303,0.0017353675,0.0022121284,0.0015085097,0.0013964343],"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.00036630742,0.00023303619,0.0007727457,0.00020893832,0.0001122617,0.00015895008,0.00020222703,0.48206425,0.014253137,0.045973472,0.015925923,0.4397288],"study_design_scores_gemma":[0.00009034947,0.00004689111,0.00012735087,0.0000066183115,0.000012529309,0.000082027305,0.00003417894,0.973559,0.0018018038,0.02012591,0.004102013,0.000011329094],"about_ca_topic_score_codex":0.0031990665,"about_ca_topic_score_gemma":0.0053154235,"teacher_disagreement_score":0.004544901,"about_ca_system_score_codex":0.0011181845,"about_ca_system_score_gemma":0.0019204846,"threshold_uncertainty_score":0.015204251},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7520587,0.00019170671,0.21080603,0.0014740588,0.00008993411,0.00010592484,0.0012671965,0.0006367576,0.03336966],"genre_scores_gemma":[0.9841888,0.000080900034,0.009077759,0.000109283545,0.000039329585,0.000043073505,0.0005214054,0.000053255822,0.0058862516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999503,0.00012205555,0.000025395328,0.0000994127,0.00014158717,0.00010855793],"domain_scores_gemma":[0.9961448,0.0019159202,0.00046362437,0.0005126879,0.00062383164,0.00033925858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004599883,0.00026960688,0.0005402214,0.0009003883,0.00092075526,0.0010837467,0.0008501565,0.0006338699,0.008041517],"category_scores_gemma":[0.0046974155,0.00031084273,0.00036997403,0.00085146783,0.0012700926,0.0018529199,0.0009874734,0.00096283696,0.00048359085],"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.00034559512,0.000074474294,0.00410412,0.00014276478,0.000035255973,0.00039963075,0.00033903902,0.030594416,0.0063746306,0.9335818,0.0059503433,0.01805791],"study_design_scores_gemma":[0.000059779293,0.000061450206,0.0018370855,0.000018177436,0.000039423925,0.0001961548,0.00016105337,0.11119988,0.0045589856,0.87933934,0.0025050782,0.000023566752],"about_ca_topic_score_codex":0.0029140455,"about_ca_topic_score_gemma":0.0038782984,"teacher_disagreement_score":0.008041517,"about_ca_system_score_codex":0.0010671818,"about_ca_system_score_gemma":0.0011232054,"threshold_uncertainty_score":0.026901603},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046333134,0.0002491183,0.92949283,0.0010563666,0.00011764206,0.00017866497,0.00023550671,0.0012599012,0.02107681],"genre_scores_gemma":[0.563876,0.00046122583,0.41754916,0.00076265674,0.00019292878,0.0004894086,0.00062654784,0.00061003567,0.015432112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99569255,0.0012164538,0.00032160626,0.0009852985,0.0012145065,0.0005695486],"domain_scores_gemma":[0.99200857,0.0035237249,0.0005069373,0.0030897756,0.0006036247,0.00026738594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026834286,0.0007564757,0.0012854774,0.0016174288,0.001785721,0.005046956,0.0023171424,0.001585491,0.008481081],"category_scores_gemma":[0.014505931,0.00063545833,0.0013213281,0.0022630156,0.005795494,0.014432882,0.005238116,0.003101013,0.0018059993],"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.00007186912,0.000049723832,0.00023546311,0.000059350554,0.000011704664,0.00002529488,0.00013931358,0.0050674477,0.0010190663,0.9528926,0.0014187078,0.03900942],"study_design_scores_gemma":[0.000029776935,0.00003528044,0.000084168954,0.000017201466,0.000013181503,0.000047822607,0.00006644858,0.031215562,0.0040271273,0.9582697,0.0061766594,0.000016876951],"about_ca_topic_score_codex":0.0014154669,"about_ca_topic_score_gemma":0.001517117,"teacher_disagreement_score":0.008481081,"about_ca_system_score_codex":0.002446137,"about_ca_system_score_gemma":0.0024698584,"threshold_uncertainty_score":0.02837205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023432826,0.00032269894,0.99541193,0.000077744415,0.00004335199,0.00003890972,0.00011593763,0.00070243893,0.000943692],"genre_scores_gemma":[0.040492572,0.00054682017,0.9509728,0.00015883839,0.000109823915,0.00015108683,0.0010816023,0.00046430496,0.006022122],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904794,0.00019993335,0.00007100271,0.00029946846,0.00031515275,0.000066527704],"domain_scores_gemma":[0.9981888,0.0006321444,0.000112657755,0.0004671383,0.0005024147,0.00009685475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000715737,0.0011176957,0.00161875,0.0034049044,0.0012129309,0.0017057656,0.0038549441,0.0015669103,0.0045641502],"category_scores_gemma":[0.0035904553,0.00067900796,0.001383207,0.004594243,0.0010475059,0.0025274663,0.0018709636,0.001883704,0.0027902566],"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.00022245273,0.00021479728,0.001342117,0.000594033,0.0002452012,0.00021028605,0.00029990607,0.07431337,0.027664397,0.11539537,0.020123104,0.7593749],"study_design_scores_gemma":[0.000019988915,0.000058901147,0.00053862215,0.000041469768,0.00007033735,0.0002692696,0.00009196698,0.7563109,0.0067190346,0.2227243,0.0131115755,0.000043618475],"about_ca_topic_score_codex":0.0031988823,"about_ca_topic_score_gemma":0.0053428533,"teacher_disagreement_score":0.0045641502,"about_ca_system_score_codex":0.000635806,"about_ca_system_score_gemma":0.0006564476,"threshold_uncertainty_score":0.015268564},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057809275,0.001190157,0.8130309,0.0010466252,0.00030233708,0.000100295794,0.0014944037,0.0025988328,0.1224272],"genre_scores_gemma":[0.65325713,0.0014715653,0.24622466,0.0005502405,0.00040343622,0.0002239682,0.0027353906,0.0013961351,0.09373746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942064,0.00012287233,0.00004889766,0.000115573486,0.00021058308,0.000081451544],"domain_scores_gemma":[0.9989687,0.00032418602,0.00007899123,0.00038685594,0.00017752836,0.000063751875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061272946,0.0005869659,0.0006272846,0.0013285417,0.00081560336,0.0029454427,0.001033084,0.0008330179,0.017625628],"category_scores_gemma":[0.002114858,0.00054685393,0.0005860042,0.0020958509,0.0011957774,0.00768039,0.0018501275,0.0022353416,0.0036457737],"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.000025248351,0.000014139019,0.00004370782,0.00004968593,0.000004410058,0.000042259006,0.00019936942,0.0006826879,0.001308336,0.96122336,0.00322172,0.03318509],"study_design_scores_gemma":[0.000006006776,0.0000110850915,0.00006737084,0.00002026632,0.000008538555,0.00014047037,0.00006699833,0.0050480235,0.0010163554,0.97691035,0.016695846,0.000008792057],"about_ca_topic_score_codex":0.00034825513,"about_ca_topic_score_gemma":0.00059279695,"teacher_disagreement_score":0.017625628,"about_ca_system_score_codex":0.0005943219,"about_ca_system_score_gemma":0.0002938773,"threshold_uncertainty_score":0.058963597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015295417,0.000252275,0.99513346,0.00009721237,0.00013679925,0.0001204024,0.00010150567,0.001851608,0.00077713025],"genre_scores_gemma":[0.011383813,0.0002450755,0.9848043,0.00009766596,0.000101942336,0.00017841003,0.00033446844,0.00032338154,0.0025310102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982223,0.00020933183,0.00013448825,0.0005557988,0.0007647404,0.00011333927],"domain_scores_gemma":[0.99832135,0.0005005111,0.00009785834,0.00041037085,0.00057645317,0.00009349452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011816651,0.0016616983,0.002570774,0.0052931835,0.0015885744,0.0023554,0.0037417677,0.002800614,0.009752318],"category_scores_gemma":[0.004660734,0.0011133177,0.0016627555,0.00749758,0.0012641792,0.0042650397,0.0033847017,0.0023897078,0.006241531],"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.0001902133,0.00017845808,0.00028675178,0.0002363604,0.00013084855,0.000118724965,0.00007545186,0.0190499,0.026271943,0.014332935,0.014385286,0.9247432],"study_design_scores_gemma":[0.00019352583,0.00022705093,0.000889143,0.000046582558,0.00018840982,0.001160741,0.00009761819,0.8674878,0.035545792,0.061142832,0.032912496,0.00010804554],"about_ca_topic_score_codex":0.0053305896,"about_ca_topic_score_gemma":0.007110066,"teacher_disagreement_score":0.009752318,"about_ca_system_score_codex":0.0011282262,"about_ca_system_score_gemma":0.0015525565,"threshold_uncertainty_score":0.03262472},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049049207,0.01558937,0.3305185,0.0043807165,0.0038271667,0.00016727709,0.0011835952,0.002675771,0.63675267],"genre_scores_gemma":[0.0845966,0.03357669,0.32919708,0.0028040134,0.002091729,0.00025003523,0.0038378846,0.002569677,0.5410763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999597,0.000058675232,0.000016220283,0.00012214096,0.00015845805,0.0000475346],"domain_scores_gemma":[0.9995752,0.00015629579,0.000019402869,0.00013900506,0.00007037364,0.00003959801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003200382,0.0010264125,0.0010553916,0.0015735136,0.0013235392,0.002976624,0.002087734,0.0014854543,0.049782787],"category_scores_gemma":[0.0015538306,0.00064372574,0.00080958265,0.004347706,0.0011881285,0.007658377,0.0024246802,0.0025134017,0.024831057],"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.000028592594,0.000057088553,0.000080454345,0.00041218655,0.00002312233,0.000054340715,0.00008525368,0.0035033966,0.0015322493,0.5800218,0.12534074,0.28886065],"study_design_scores_gemma":[0.0000073261835,0.0000128146385,0.00011442049,0.00011481103,0.000016346467,0.0002312762,0.000048231137,0.006121883,0.0008895971,0.74484605,0.24758472,0.000012518051],"about_ca_topic_score_codex":0.0008697908,"about_ca_topic_score_gemma":0.0019531678,"teacher_disagreement_score":0.049782787,"about_ca_system_score_codex":0.001378255,"about_ca_system_score_gemma":0.000968313,"threshold_uncertainty_score":0.16654003},"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":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23139152,0.015573686,0.2471945,0.37870783,0.02022641,0.00031594152,0.017167266,0.00707442,0.08234846],"genre_scores_gemma":[0.88835984,0.004135044,0.04727613,0.008084863,0.010550513,0.00032395028,0.010410173,0.0020174729,0.028841933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966563,0.0012808234,0.0001495713,0.0006201583,0.0010121875,0.0002810242],"domain_scores_gemma":[0.9280727,0.059492465,0.0018816695,0.005430654,0.0026650396,0.0024574522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040527615,0.0012226345,0.0012582211,0.001873579,0.0036135404,0.006783793,0.0019965456,0.004502486,0.021591865],"category_scores_gemma":[0.0834682,0.0012381237,0.0013674846,0.0026529625,0.005066431,0.021354802,0.0044675,0.007936169,0.0049671237],"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.0013776481,0.00020813651,0.008139969,0.0007096778,0.00016825247,0.0005431397,0.004933823,0.010080881,0.0015315239,0.5007292,0.3928227,0.07875507],"study_design_scores_gemma":[0.00014670403,0.00007155609,0.0022658485,0.0002006157,0.000065875305,0.0002369534,0.0020516105,0.042578354,0.0016729245,0.850181,0.10045466,0.000073953655],"about_ca_topic_score_codex":0.0029079474,"about_ca_topic_score_gemma":0.0036882523,"teacher_disagreement_score":0.021591865,"about_ca_system_score_codex":0.0025265494,"about_ca_system_score_gemma":0.0012994516,"threshold_uncertainty_score":0.07223201},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075869807,0.009512966,0.77880776,0.015040169,0.008821748,0.0003578264,0.031569954,0.03813471,0.110167824],"genre_scores_gemma":[0.12604944,0.021645347,0.5411616,0.013172825,0.007934391,0.00085124635,0.10197818,0.020164179,0.16704278],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981504,0.0002784816,0.00023113594,0.00032661547,0.00087947655,0.00013377581],"domain_scores_gemma":[0.99526286,0.001096269,0.0004180816,0.0017703811,0.001209825,0.00024250233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013901865,0.001247401,0.0008764271,0.0034145506,0.0010520192,0.004794182,0.0032469279,0.0018279447,0.051955253],"category_scores_gemma":[0.009693624,0.00066977896,0.001054687,0.009224581,0.0017381229,0.007857855,0.0027611034,0.0018470084,0.038481493],"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.00021325449,0.00005378937,0.0011572065,0.00081637036,0.000048686677,0.00041164563,0.00017289064,0.0034619523,0.0068635135,0.14948381,0.58039284,0.25692406],"study_design_scores_gemma":[0.000018429671,0.00004731148,0.000613618,0.00023673748,0.00002970853,0.0006776019,0.000070957,0.012283614,0.010408249,0.07590239,0.89964676,0.00006454562],"about_ca_topic_score_codex":0.0041720667,"about_ca_topic_score_gemma":0.0061707315,"teacher_disagreement_score":0.051955253,"about_ca_system_score_codex":0.0012503988,"about_ca_system_score_gemma":0.00096802664,"threshold_uncertainty_score":0.17380762},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01504363,0.00015698015,0.98035127,0.000114319475,0.000024802906,0.00009050403,0.0002732266,0.002803148,0.0011420207],"genre_scores_gemma":[0.17414145,0.00029616186,0.82098806,0.000100846286,0.00005215312,0.00023268544,0.0012186929,0.0006203084,0.0023496912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877244,0.0003021639,0.000122041834,0.00027438055,0.00041443185,0.00011445052],"domain_scores_gemma":[0.99762315,0.0008299151,0.00019295081,0.0006682338,0.00054389756,0.00014190174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00140813,0.0008204037,0.0009970726,0.0015067863,0.0009065329,0.0017526636,0.0016547266,0.00068399304,0.0024921123],"category_scores_gemma":[0.0053379596,0.00060186343,0.001018141,0.0018392578,0.00089115306,0.004037165,0.0022770555,0.0013128457,0.0010589124],"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.0005277053,0.00019585056,0.0012612845,0.0007424499,0.00012630629,0.00043003744,0.0009886372,0.34352154,0.031150935,0.33516088,0.008335085,0.27755916],"study_design_scores_gemma":[0.00005472611,0.0001584761,0.00022029021,0.000045375084,0.00006685045,0.00012133948,0.00018264091,0.70807225,0.022504967,0.25095773,0.017572295,0.00004310698],"about_ca_topic_score_codex":0.001975714,"about_ca_topic_score_gemma":0.003928387,"teacher_disagreement_score":0.0024921123,"about_ca_system_score_codex":0.00091868883,"about_ca_system_score_gemma":0.0013753866,"threshold_uncertainty_score":0.008336902},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013011019,0.00031553037,0.9502799,0.0008144441,0.00021010297,0.00019172393,0.001124411,0.023279484,0.010773452],"genre_scores_gemma":[0.17015715,0.00067001645,0.80685467,0.0007832117,0.000103119855,0.00080178765,0.003108818,0.004957768,0.012563498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999508,0.00011438406,0.00002478324,0.000101725105,0.00018569022,0.00006547896],"domain_scores_gemma":[0.9990767,0.00020985756,0.00004983955,0.00026174472,0.0003010532,0.00010076367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000598971,0.0011593308,0.0006706812,0.0008565207,0.0008841968,0.0019842517,0.005173377,0.0014192733,0.009855047],"category_scores_gemma":[0.0023547446,0.0006253765,0.001451001,0.0013055812,0.0008145696,0.0026718494,0.0016679086,0.0022551205,0.0029765533],"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.0005548508,0.00023532462,0.002184259,0.0006017107,0.00014742896,0.0003875718,0.0004210454,0.5809164,0.015526839,0.21028829,0.08405594,0.10468038],"study_design_scores_gemma":[0.00009266671,0.00006594741,0.00016118173,0.00002809104,0.000017043765,0.00007930492,0.000043634078,0.90903354,0.0028715027,0.053647056,0.033935193,0.000024758714],"about_ca_topic_score_codex":0.013856727,"about_ca_topic_score_gemma":0.020645764,"teacher_disagreement_score":0.013856727,"about_ca_system_score_codex":0.0017976474,"about_ca_system_score_gemma":0.002068223,"threshold_uncertainty_score":0.03296846},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039825212,0.00015541627,0.9552329,0.00023228022,0.00006596203,0.00006873757,0.0005540753,0.0013842812,0.0024810974],"genre_scores_gemma":[0.66366076,0.0004517564,0.32970986,0.00014118761,0.00008568919,0.000100208046,0.0025393663,0.000518365,0.0027927249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883336,0.0003471513,0.000056087738,0.00030971738,0.0003584752,0.0000951857],"domain_scores_gemma":[0.9985464,0.0002991954,0.00020837426,0.0006637839,0.0002152912,0.00006675895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006351601,0.0005035186,0.0008363847,0.0035469434,0.0005764587,0.0020910276,0.0014353225,0.0010394948,0.0020395943],"category_scores_gemma":[0.004599414,0.00054688577,0.0009353658,0.0038932466,0.0011404982,0.0024677904,0.0024463676,0.0010798984,0.001454272],"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.0005100296,0.00024624923,0.006300768,0.00028136413,0.0002048753,0.00038422542,0.000603254,0.40423834,0.031912565,0.14870313,0.008803034,0.3978122],"study_design_scores_gemma":[0.000025315305,0.00008974601,0.002760095,0.000028202074,0.00004648814,0.00023989305,0.0002205663,0.8707024,0.012299837,0.10667642,0.0068736677,0.000037423157],"about_ca_topic_score_codex":0.003855682,"about_ca_topic_score_gemma":0.0047797677,"teacher_disagreement_score":0.003855682,"about_ca_system_score_codex":0.0006502018,"about_ca_system_score_gemma":0.0008908742,"threshold_uncertainty_score":0.0076664686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031894904,0.00031937505,0.9592059,0.0015673717,0.000098725606,0.0003268459,0.0012968526,0.0015952244,0.0036947716],"genre_scores_gemma":[0.4346553,0.00078947545,0.55112755,0.0005458114,0.00014188228,0.000729326,0.0038880992,0.0005009984,0.007621551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805033,0.00072476757,0.00013177215,0.00046502988,0.00048721748,0.00014080375],"domain_scores_gemma":[0.992508,0.003701503,0.0005948848,0.002035786,0.00083487673,0.00032494884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030977512,0.00089126686,0.0007824766,0.0015332965,0.0013426163,0.0030401857,0.0033221329,0.0015297782,0.0047582923],"category_scores_gemma":[0.014536706,0.0006683723,0.0012302961,0.0026202444,0.0011199851,0.008160632,0.0020470843,0.0019544435,0.0011559614],"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.00037677286,0.00027096242,0.0025945979,0.00016975099,0.00009206608,0.00020276832,0.0005701533,0.7004748,0.002323044,0.22097,0.015487676,0.05646744],"study_design_scores_gemma":[0.000026337939,0.00002481991,0.00017495902,0.000011999675,0.00001609028,0.000052429572,0.00010317622,0.9093964,0.00061702036,0.08475965,0.004806205,0.000010839975],"about_ca_topic_score_codex":0.010393079,"about_ca_topic_score_gemma":0.016855964,"teacher_disagreement_score":0.010393079,"about_ca_system_score_codex":0.0029388557,"about_ca_system_score_gemma":0.0017438725,"threshold_uncertainty_score":0.021322966},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2912195,0.0040536695,0.61961555,0.008271685,0.00045834537,0.00012737603,0.00088549906,0.0004908183,0.07487758],"genre_scores_gemma":[0.89041793,0.0037451237,0.084502846,0.0012270433,0.00077025656,0.0002452006,0.0007490086,0.00064679823,0.017695677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702966,0.0011689635,0.00013804731,0.00086163636,0.0005018141,0.00029987816],"domain_scores_gemma":[0.95204234,0.036213655,0.0026251704,0.004571195,0.0023574878,0.0021901773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047972724,0.001071666,0.0020673384,0.003896555,0.0023323337,0.004832521,0.0037627926,0.0036599475,0.009714942],"category_scores_gemma":[0.047745716,0.0014320443,0.0012247966,0.0037975805,0.009646987,0.021822143,0.005669056,0.010385736,0.0009154572],"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.00008238413,0.000027107671,0.00074804726,0.00005399592,0.000012597034,0.00008917734,0.00037846318,0.004074433,0.0004664451,0.9864851,0.0010240563,0.0065580965],"study_design_scores_gemma":[0.000018538341,0.000021403777,0.00037725136,0.00002603105,0.000009808226,0.0000925607,0.00011456667,0.015235038,0.00023678553,0.9819016,0.0019521754,0.0000142315],"about_ca_topic_score_codex":0.0016479966,"about_ca_topic_score_gemma":0.0009148219,"teacher_disagreement_score":0.009714942,"about_ca_system_score_codex":0.0022780232,"about_ca_system_score_gemma":0.00093147974,"threshold_uncertainty_score":0.03249967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008140032,0.00030986196,0.9882952,0.0003059454,0.000084950036,0.000053370015,0.00019260033,0.0010773501,0.0015406873],"genre_scores_gemma":[0.22104956,0.00047302098,0.7699447,0.00025224235,0.00017539832,0.00025660635,0.0012489791,0.0005975652,0.0060018357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985448,0.00043729128,0.00006835553,0.00035419987,0.0004635016,0.000131871],"domain_scores_gemma":[0.9972613,0.00113732,0.000212141,0.00068199483,0.0005408246,0.00016645137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014561262,0.0009688419,0.0026508411,0.0030632492,0.0019179736,0.00252994,0.002621259,0.0017320144,0.006829849],"category_scores_gemma":[0.009214314,0.000831573,0.0014399292,0.0042889696,0.0012889225,0.0036595787,0.0022744222,0.0023092874,0.0016829122],"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.00050891517,0.00021098685,0.0014890301,0.0003741774,0.000227313,0.00009034418,0.000262337,0.33379203,0.004383311,0.14997384,0.021274528,0.48741314],"study_design_scores_gemma":[0.000026671862,0.00002711142,0.00027085035,0.000020614309,0.000028019685,0.000033518292,0.00006142803,0.8039633,0.0020466992,0.19029373,0.0032126554,0.000015428746],"about_ca_topic_score_codex":0.0064757927,"about_ca_topic_score_gemma":0.008994193,"teacher_disagreement_score":0.006829849,"about_ca_system_score_codex":0.002131296,"about_ca_system_score_gemma":0.0023334967,"threshold_uncertainty_score":0.02284813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013395243,0.00015369545,0.98416245,0.00025136519,0.000042542088,0.00007602174,0.000055726206,0.00035517072,0.0015077196],"genre_scores_gemma":[0.54521984,0.0002590212,0.45094734,0.00024355417,0.00009161826,0.00033932313,0.00028531393,0.00023630045,0.0023776765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880874,0.0003226091,0.00009931229,0.00020757326,0.00039299644,0.00016874187],"domain_scores_gemma":[0.99783415,0.0009095868,0.0002250872,0.00036587805,0.0005166887,0.00014860809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017742662,0.0006708404,0.0017653704,0.0014160513,0.0009244344,0.0026804183,0.0021763472,0.0012946188,0.0030439268],"category_scores_gemma":[0.0077719423,0.00085949374,0.00085595076,0.0016687696,0.0010145236,0.0024835852,0.0021829824,0.001766686,0.0005222527],"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.00016573307,0.000102200254,0.000669062,0.00012589563,0.000055888122,0.00006204213,0.00008585631,0.82089853,0.0040369327,0.06425792,0.0023317917,0.107208095],"study_design_scores_gemma":[0.0000060499915,0.00001916028,0.0000535032,0.0000068820946,0.0000056288477,0.000006585134,0.000007945309,0.9791693,0.00040353727,0.02003679,0.0002802365,0.0000044109006],"about_ca_topic_score_codex":0.0031475886,"about_ca_topic_score_gemma":0.0040653413,"teacher_disagreement_score":0.0031475886,"about_ca_system_score_codex":0.0013317519,"about_ca_system_score_gemma":0.0016170508,"threshold_uncertainty_score":0.010182917},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34951276,0.0036500718,0.61875135,0.0059360024,0.00026413903,0.00045873807,0.007378902,0.010546626,0.0035013866],"genre_scores_gemma":[0.6912882,0.0012624451,0.29055774,0.00080188905,0.0002860343,0.00016034194,0.012320364,0.0005903595,0.0027326024],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995567,0.0010197579,0.0005335532,0.0013295831,0.0012634756,0.00028650195],"domain_scores_gemma":[0.98455566,0.00989353,0.001134136,0.0030773552,0.000910357,0.00042907428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018422508,0.0013125669,0.003172606,0.0043951753,0.0012187632,0.00486026,0.0036305941,0.0030884908,0.0026757251],"category_scores_gemma":[0.016625063,0.0012586752,0.0016734191,0.0075049708,0.0012119821,0.016231354,0.0036378028,0.0024097404,0.0010908253],"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.0030325863,0.002043365,0.028870488,0.0022560179,0.0010062588,0.0012180138,0.0014565564,0.2765237,0.02825109,0.0500709,0.050787818,0.5544832],"study_design_scores_gemma":[0.00015327049,0.00017120538,0.001330664,0.000035803358,0.00017704697,0.00044386208,0.0007721808,0.83567864,0.005777818,0.15219639,0.0032234397,0.00003972288],"about_ca_topic_score_codex":0.004410752,"about_ca_topic_score_gemma":0.007966775,"teacher_disagreement_score":0.00486026,"about_ca_system_score_codex":0.0012049072,"about_ca_system_score_gemma":0.0014013929,"threshold_uncertainty_score":0.009742856},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009500426,0.0010964851,0.9853425,0.0003846502,0.00016572759,0.000082063634,0.0001201778,0.001371612,0.0019363816],"genre_scores_gemma":[0.43118966,0.0019195026,0.55509245,0.000657304,0.00039703798,0.0002511991,0.00078774727,0.00028759224,0.009417475],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849665,0.00031030792,0.00011493018,0.00048373386,0.00045162157,0.000142739],"domain_scores_gemma":[0.9989793,0.0003787205,0.0001111439,0.0003295127,0.0001453025,0.00005612873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000676643,0.00077594945,0.0027556536,0.0016608798,0.00082423433,0.002780585,0.0031424311,0.0028014702,0.005267194],"category_scores_gemma":[0.0030103792,0.0006335875,0.0012364008,0.0033284952,0.0014103289,0.005453905,0.0027833988,0.001413517,0.0027381214],"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.0003265973,0.00025138108,0.0010898268,0.0004920069,0.00018047205,0.00025201144,0.00018745178,0.084297135,0.024258418,0.12612851,0.008713478,0.75382274],"study_design_scores_gemma":[0.00003427692,0.00009185287,0.00069044746,0.000025720232,0.000045539644,0.000295791,0.000075373595,0.65167004,0.006035849,0.33565372,0.005339989,0.00004138712],"about_ca_topic_score_codex":0.0024514124,"about_ca_topic_score_gemma":0.001987426,"teacher_disagreement_score":0.005267194,"about_ca_system_score_codex":0.00081460143,"about_ca_system_score_gemma":0.00084164774,"threshold_uncertainty_score":0.017620564},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0820981,0.00022293792,0.8904266,0.00020887071,0.00015014179,0.00017092722,0.00034241908,0.007888316,0.018491782],"genre_scores_gemma":[0.36802307,0.00015030142,0.6251876,0.00008269965,0.000033674813,0.00033429073,0.0011776525,0.0009179136,0.004092852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934024,0.000108426655,0.00004508418,0.000115699724,0.00025262803,0.00013785697],"domain_scores_gemma":[0.99916553,0.00020394677,0.00005115638,0.00022401051,0.0003008968,0.00005457958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051255873,0.0005447891,0.0007261989,0.00051820715,0.0007484929,0.00093770586,0.0017621784,0.00056136533,0.00417214],"category_scores_gemma":[0.0021831007,0.00025471288,0.0006855328,0.00069343956,0.00046512083,0.0010464207,0.0012254274,0.0011224123,0.0010297603],"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.0006859868,0.00040032738,0.0029443058,0.0005140725,0.00012063872,0.00050863554,0.0005078142,0.62558687,0.03944938,0.073374294,0.020938639,0.23496903],"study_design_scores_gemma":[0.00007201873,0.00006281033,0.00044945924,0.000009113345,0.000013083603,0.00009759609,0.000046912035,0.96716624,0.012062915,0.013209115,0.0067943647,0.000016373357],"about_ca_topic_score_codex":0.004275727,"about_ca_topic_score_gemma":0.0036293834,"teacher_disagreement_score":0.004275727,"about_ca_system_score_codex":0.00056698435,"about_ca_system_score_gemma":0.0013806663,"threshold_uncertainty_score":0.013957202},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026429545,0.00047952135,0.9707855,0.00012974064,0.000028771059,0.000038337548,0.00015714766,0.0008408196,0.0011104996],"genre_scores_gemma":[0.4475228,0.00057926355,0.5478004,0.00016397212,0.00009626507,0.00021491587,0.0014147802,0.00040068314,0.0018069568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941162,0.0020162493,0.0003186029,0.0014604471,0.0017793558,0.0003092128],"domain_scores_gemma":[0.95734423,0.032566067,0.0020784198,0.005501535,0.0019983356,0.00051146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046445588,0.0012775748,0.0019107951,0.0038536682,0.00074953854,0.003112445,0.0026327504,0.0024190857,0.0017243631],"category_scores_gemma":[0.061244164,0.0008319994,0.0012178818,0.0030535879,0.0014299613,0.0058210334,0.0024491304,0.0033599315,0.0011016347],"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.00020888231,0.00016927521,0.0040554805,0.00018605168,0.00011991488,0.00014123322,0.00021318218,0.86371464,0.0042878226,0.039739773,0.0013836132,0.08578021],"study_design_scores_gemma":[0.0000038212943,0.000019703897,0.0003302609,0.000009885137,0.000006816125,0.00004369562,0.000016217044,0.9831246,0.0009455738,0.015108894,0.0003818664,0.000008674003],"about_ca_topic_score_codex":0.0046205157,"about_ca_topic_score_gemma":0.004652157,"teacher_disagreement_score":0.0046445588,"about_ca_system_score_codex":0.0020770964,"about_ca_system_score_gemma":0.0010713934,"threshold_uncertainty_score":0.024563074},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022804469,0.00021753742,0.9704775,0.00019015561,0.000037833677,0.00012398658,0.0000373225,0.0008618414,0.0052493187],"genre_scores_gemma":[0.35089535,0.00024314612,0.64010435,0.000104707964,0.00003340899,0.00032116505,0.00019064892,0.000174289,0.007932928],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853253,0.0005039907,0.000073150535,0.0002849819,0.00033388083,0.00027136682],"domain_scores_gemma":[0.99894685,0.00042428458,0.00010239984,0.0002681915,0.0001738312,0.00008440808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014126,0.0008237138,0.0017330775,0.0011438598,0.0013269697,0.0014292907,0.0024458834,0.0016203653,0.0067918934],"category_scores_gemma":[0.0032956474,0.0003945653,0.0008212336,0.0015193657,0.0011001487,0.0041579236,0.0023772505,0.001404631,0.0018176871],"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.0004398791,0.0005063996,0.00069970905,0.00025374308,0.000066538036,0.00018312433,0.00041358123,0.37893924,0.007220542,0.15397505,0.009235123,0.44806698],"study_design_scores_gemma":[0.000088018765,0.00012642036,0.00015027469,0.000016119931,0.000019460953,0.0001554816,0.00015556376,0.91847,0.004512885,0.07138469,0.0048922338,0.00002887534],"about_ca_topic_score_codex":0.0017400872,"about_ca_topic_score_gemma":0.0015069391,"teacher_disagreement_score":0.0067918934,"about_ca_system_score_codex":0.0008914193,"about_ca_system_score_gemma":0.0020587533,"threshold_uncertainty_score":0.022721112},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01270722,0.1992159,0.33453152,0.36168724,0.015179592,0.00032812412,0.0055242777,0.0021381867,0.06868791],"genre_scores_gemma":[0.2511026,0.21908017,0.39689124,0.044572704,0.014860854,0.00059262087,0.009742375,0.0015577592,0.061599717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98641425,0.006384869,0.0008066259,0.0018971037,0.004151521,0.00034561596],"domain_scores_gemma":[0.9601308,0.023038829,0.0021215235,0.0064070513,0.0064948285,0.001806954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016421376,0.001311461,0.0010010427,0.0061050886,0.003181396,0.014366432,0.0023460768,0.004817617,0.0075610005],"category_scores_gemma":[0.032956764,0.00097517855,0.0012545389,0.010878664,0.0061961017,0.02615209,0.0051083583,0.007748033,0.0034044303],"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.00010866715,0.000050733575,0.0032600877,0.0024041703,0.00014783228,0.00030822706,0.0036597794,0.0023935072,0.0012568193,0.56955963,0.12566194,0.29118854],"study_design_scores_gemma":[0.000012235637,0.000034369896,0.001392696,0.0010661635,0.00003774168,0.0004777609,0.004317977,0.0050300346,0.0013211785,0.3262893,0.6599509,0.00006967571],"about_ca_topic_score_codex":0.0054785833,"about_ca_topic_score_gemma":0.006049583,"teacher_disagreement_score":0.016421376,"about_ca_system_score_codex":0.00563955,"about_ca_system_score_gemma":0.00500695,"threshold_uncertainty_score":0.08684558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036106675,0.00006692519,0.9946572,0.000063505,0.000055923796,0.0000691678,0.000035977053,0.0005053851,0.00093522336],"genre_scores_gemma":[0.05418565,0.00010972957,0.9434048,0.00007355319,0.000075361386,0.00012410048,0.00022394974,0.00021002808,0.0015928717],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974859,0.00042287895,0.0001554504,0.0006552579,0.0011279299,0.00015260663],"domain_scores_gemma":[0.9971425,0.0008241643,0.00023886462,0.0005504687,0.0010830398,0.00016103908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013212092,0.0009662492,0.0011643105,0.0045730066,0.0009675763,0.0014268992,0.0021115518,0.0011494544,0.0050287982],"category_scores_gemma":[0.004869843,0.0005973764,0.0010558773,0.001924765,0.0016947557,0.003869202,0.0025541137,0.0015706343,0.0015386312],"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.00025975288,0.00023685461,0.002216355,0.00048565472,0.00013417135,0.00033589458,0.00041557345,0.018359404,0.06962894,0.10713249,0.007062718,0.7937323],"study_design_scores_gemma":[0.00020140146,0.00066315435,0.003105865,0.00009171323,0.0001237271,0.0024707979,0.00035869709,0.7353424,0.057572354,0.15767406,0.042101156,0.00029469957],"about_ca_topic_score_codex":0.0011619062,"about_ca_topic_score_gemma":0.0010374448,"teacher_disagreement_score":0.0050287982,"about_ca_system_score_codex":0.00056491914,"about_ca_system_score_gemma":0.0008545169,"threshold_uncertainty_score":0.016822934},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07740386,0.0004320322,0.9169945,0.00023170936,0.00009108184,0.00013174805,0.00020487513,0.0015503669,0.0029597594],"genre_scores_gemma":[0.56345767,0.00029394534,0.43109077,0.00014712084,0.0001390027,0.00018333386,0.0009125915,0.00034954312,0.0034260734],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801385,0.00041786052,0.00012304752,0.0003963928,0.0008923662,0.00015647055],"domain_scores_gemma":[0.99601966,0.0016901363,0.0003431916,0.0012382885,0.00054942584,0.00015940955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010386617,0.0007202431,0.0019288778,0.0029665725,0.000860605,0.0018424613,0.0024107057,0.0019686616,0.003635161],"category_scores_gemma":[0.010627819,0.00055417715,0.0007799779,0.004474202,0.0007587948,0.0062948903,0.0033552947,0.0012684049,0.0010599954],"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.0007097515,0.0006248431,0.00487316,0.0006359709,0.0002588441,0.00042009423,0.00042376574,0.26311612,0.0367494,0.10218075,0.012183962,0.57782334],"study_design_scores_gemma":[0.00003039243,0.000082296865,0.00029918255,0.00000925657,0.00003317922,0.0001503422,0.00008687127,0.93073875,0.007295175,0.05932024,0.001941138,0.000013143548],"about_ca_topic_score_codex":0.0015125084,"about_ca_topic_score_gemma":0.0030606787,"teacher_disagreement_score":0.003635161,"about_ca_system_score_codex":0.0009323521,"about_ca_system_score_gemma":0.0009610916,"threshold_uncertainty_score":0.012160838},"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":"editorial","genre_gemma":"methods","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015742006,0.003151781,0.012926196,0.1138437,0.86077976,0.00017478937,0.0032350859,0.002901359,0.0028299503],"genre_scores_gemma":[0.0123371845,0.012149992,0.08742095,0.34730792,0.3927016,0.0030489403,0.011060785,0.017825352,0.11614731],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9444444,0.025004407,0.0076981694,0.005487279,0.015557391,0.0018082627],"domain_scores_gemma":[0.65996057,0.18039408,0.010565044,0.02259773,0.12092846,0.0055540516],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.041756168,0.007990481,0.0067530414,0.009948763,0.0063854395,0.008218496,0.01114538,0.015084235,0.09563419],"category_scores_gemma":[0.47905192,0.0050964975,0.0064612483,0.009957968,0.006950098,0.008654359,0.0062466674,0.026494928,0.07021539],"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.00002140922,0.0000070935057,0.000049058093,0.000059291615,0.000021368445,0.000038028866,0.00001571458,0.000047234986,0.000016784605,0.0004102248,0.99622214,0.0030916014],"study_design_scores_gemma":[0.00026709988,0.00007181441,0.0017816632,0.000998215,0.000143104,0.00041601123,0.00008656187,0.0016598994,0.00042193284,0.008683717,0.9852529,0.00021711092],"about_ca_topic_score_codex":0.027863069,"about_ca_topic_score_gemma":0.02248928,"teacher_disagreement_score":0.95824385,"about_ca_system_score_codex":0.010584567,"about_ca_system_score_gemma":0.013313774,"threshold_uncertainty_score":0.31992823},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7699497,0.0020977547,0.18932772,0.0027076646,0.00023314296,0.0000668797,0.00031619964,0.00083669776,0.034464207],"genre_scores_gemma":[0.97101295,0.0002295442,0.024180397,0.00017222817,0.000036577396,0.000051076142,0.0000881203,0.00010896794,0.004120082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951506,0.00010757666,0.000019763696,0.00011822908,0.00011532115,0.0001239757],"domain_scores_gemma":[0.99901414,0.0005610838,0.000042008403,0.00019853975,0.00012018319,0.00006398916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004387598,0.0005147831,0.0005097278,0.00041438424,0.0006905112,0.0014101134,0.0011929804,0.0008757047,0.008010497],"category_scores_gemma":[0.0023399799,0.00036894047,0.0003434992,0.00091208046,0.0008655986,0.0030513476,0.0009878606,0.00061522727,0.00081443763],"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.0016503365,0.00039698873,0.0067860573,0.0005645798,0.00024513446,0.0016418736,0.00040129176,0.6713948,0.053073395,0.16079074,0.0129667325,0.090088055],"study_design_scores_gemma":[0.00008026529,0.00016347966,0.0018415905,0.0000188039,0.00004117134,0.0004530962,0.00022235882,0.92538935,0.009214001,0.057964895,0.0045876605,0.00002331811],"about_ca_topic_score_codex":0.0018168723,"about_ca_topic_score_gemma":0.0031947447,"teacher_disagreement_score":0.008010497,"about_ca_system_score_codex":0.00055830245,"about_ca_system_score_gemma":0.00028698318,"threshold_uncertainty_score":0.026797831},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02170615,0.01248596,0.8382194,0.0065751565,0.0022183831,0.00034221675,0.0024334623,0.0077132564,0.10830605],"genre_scores_gemma":[0.29244146,0.009896581,0.56717855,0.0052042683,0.0036968598,0.00072705606,0.015369474,0.0031054,0.102380365],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785244,0.00047043207,0.00013419658,0.00068828894,0.0005730017,0.00028162965],"domain_scores_gemma":[0.9943538,0.0028041336,0.00022054219,0.0018260083,0.00048696896,0.00030849397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015306132,0.0014110969,0.0019736183,0.0038286063,0.0023698537,0.0040924908,0.0037660433,0.0025875263,0.02687408],"category_scores_gemma":[0.007971937,0.0010664958,0.0015274624,0.0055333907,0.0027670998,0.011165379,0.004479834,0.0042110826,0.011263179],"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.00030272955,0.00031970057,0.0017426275,0.00062051864,0.00017241033,0.0002602245,0.0003681988,0.012999403,0.0030252133,0.32190713,0.19675657,0.46152523],"study_design_scores_gemma":[0.000039945997,0.000045630637,0.0010156028,0.00013979044,0.00007303294,0.00041618416,0.000244344,0.070476934,0.003239104,0.8458199,0.07844967,0.0000397851],"about_ca_topic_score_codex":0.004668168,"about_ca_topic_score_gemma":0.009244553,"teacher_disagreement_score":0.02687408,"about_ca_system_score_codex":0.0018779356,"about_ca_system_score_gemma":0.001236027,"threshold_uncertainty_score":0.08990282},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040794136,0.00025307282,0.9846162,0.00038626298,0.00009699261,0.00006311351,0.000069360016,0.0012790571,0.009156519],"genre_scores_gemma":[0.12443653,0.0009121106,0.86272043,0.00035432435,0.00014169938,0.00016632603,0.00062152656,0.00090410624,0.009742963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977397,0.00069192675,0.00019710697,0.0006862535,0.00053958996,0.00014538832],"domain_scores_gemma":[0.9967547,0.0015132191,0.00024262205,0.0010085467,0.00036321848,0.0001176669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012780274,0.0007362917,0.0009385604,0.0018508328,0.0012965384,0.0033447202,0.0016125131,0.0010909426,0.0063405284],"category_scores_gemma":[0.0056228647,0.00048105896,0.002379682,0.0013790065,0.0036061567,0.005349443,0.0024364383,0.0016981207,0.0027597724],"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.000033519755,0.000038468683,0.00036127702,0.0002093984,0.000041401123,0.00030634733,0.00080420525,0.018973079,0.008644056,0.85838413,0.0039978893,0.108206175],"study_design_scores_gemma":[0.000019120933,0.00004160435,0.0001921516,0.000055555352,0.00003693239,0.00043580987,0.00014402693,0.084836245,0.009682467,0.85310286,0.051396366,0.00005692397],"about_ca_topic_score_codex":0.0029121866,"about_ca_topic_score_gemma":0.0024942826,"teacher_disagreement_score":0.0063405284,"about_ca_system_score_codex":0.001393921,"about_ca_system_score_gemma":0.0010886354,"threshold_uncertainty_score":0.021211207},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016002143,0.0009310359,0.9936972,0.0003638049,0.00016408469,0.00012603529,0.00016925471,0.0013139818,0.0016343493],"genre_scores_gemma":[0.022878844,0.0013599601,0.9714551,0.00019802734,0.00017752123,0.00016927665,0.00062192586,0.00025504228,0.0028844026],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988275,0.00022943875,0.00007758442,0.00027982632,0.00052977295,0.00005584488],"domain_scores_gemma":[0.99855584,0.00042970432,0.000119371805,0.00021994523,0.00061331625,0.00006179518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010017888,0.0013609827,0.0017254543,0.0059904526,0.0015342268,0.0016586937,0.0017003225,0.0021943937,0.0038336068],"category_scores_gemma":[0.0041979062,0.0006306304,0.0014565199,0.009941453,0.0009920573,0.0029439938,0.00116743,0.0015933046,0.003207367],"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.00014567122,0.00014941554,0.00079935545,0.00043998676,0.00024260125,0.0002448958,0.00017550938,0.11309037,0.012916017,0.05199911,0.02635678,0.7934403],"study_design_scores_gemma":[0.000061483086,0.00014457796,0.0010275722,0.00007899961,0.000117758485,0.0011851,0.00012393798,0.8365202,0.013654683,0.085105315,0.061844733,0.00013574708],"about_ca_topic_score_codex":0.0076200888,"about_ca_topic_score_gemma":0.007805261,"teacher_disagreement_score":0.0076200888,"about_ca_system_score_codex":0.0013032269,"about_ca_system_score_gemma":0.0013910917,"threshold_uncertainty_score":0.015151501},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014535919,0.00009962723,0.995732,0.00011402368,0.000087750086,0.0000741747,0.00007769231,0.0013005649,0.0010605268],"genre_scores_gemma":[0.019762184,0.00015266045,0.97591794,0.000116732124,0.00005881152,0.00017039162,0.0005065624,0.00029861685,0.0030161678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970511,0.0004286106,0.00025035304,0.00086638425,0.0012054801,0.00019812053],"domain_scores_gemma":[0.9961915,0.0009455508,0.00032124834,0.0011513433,0.0011958042,0.0001946167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014067065,0.0014657325,0.0015977891,0.0041526593,0.0020188487,0.0025765954,0.0036957453,0.0027186922,0.009264743],"category_scores_gemma":[0.0076371273,0.00087132334,0.0013912864,0.0044821887,0.0013147509,0.0070595387,0.004259456,0.0029485798,0.004777197],"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.00028897185,0.00018779293,0.0007402068,0.00022854583,0.00011626584,0.00023651845,0.00018411996,0.07003593,0.011296514,0.06966282,0.019050255,0.82797205],"study_design_scores_gemma":[0.000119803844,0.00015948858,0.00040855174,0.00004874329,0.00006314339,0.0009282539,0.00013440882,0.81409657,0.015694972,0.11965381,0.048612487,0.000079887584],"about_ca_topic_score_codex":0.0035953873,"about_ca_topic_score_gemma":0.003140036,"teacher_disagreement_score":0.009264743,"about_ca_system_score_codex":0.0011267557,"about_ca_system_score_gemma":0.0024824883,"threshold_uncertainty_score":0.03099364},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014799422,0.0014533666,0.9535672,0.0006500403,0.0004368774,0.0006011936,0.0045195166,0.0087580625,0.0152142085],"genre_scores_gemma":[0.14778234,0.00087409467,0.8205541,0.00047533063,0.00032407657,0.0005161673,0.013797527,0.0014447197,0.014231552],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952506,0.0006800601,0.0005134137,0.0012863864,0.001969492,0.0003001595],"domain_scores_gemma":[0.99529475,0.0011644065,0.0003038366,0.0022076815,0.0007572607,0.0002720557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002386493,0.0012830684,0.002016978,0.0030127272,0.0019314492,0.0031744584,0.004250894,0.0015799775,0.022291165],"category_scores_gemma":[0.008770889,0.00067093596,0.0016539996,0.005367994,0.0006916338,0.005055226,0.004442924,0.0018402273,0.008290081],"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.0011962441,0.0006818881,0.0036314996,0.00089062034,0.00035234677,0.0002803667,0.00047011056,0.04489188,0.010648757,0.086091645,0.08818434,0.76268035],"study_design_scores_gemma":[0.00038608225,0.0007611435,0.0019981316,0.00012444088,0.00020420126,0.0016282821,0.0007702838,0.49011257,0.032171942,0.2459951,0.22568123,0.00016653187],"about_ca_topic_score_codex":0.002195672,"about_ca_topic_score_gemma":0.0037372732,"teacher_disagreement_score":0.022291165,"about_ca_system_score_codex":0.00094003027,"about_ca_system_score_gemma":0.0014352334,"threshold_uncertainty_score":0.07457131},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016918486,0.00014471823,0.99633247,0.00015846649,0.000019740883,0.000028570072,0.0001059756,0.0003520082,0.0011662354],"genre_scores_gemma":[0.16801737,0.0010128958,0.82268196,0.0003476045,0.00016174412,0.00037026068,0.0015672165,0.00039182242,0.005449187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962845,0.0012563455,0.00020372693,0.00094607973,0.0010898255,0.00021961116],"domain_scores_gemma":[0.9954862,0.0021403118,0.00061167177,0.0012613349,0.0003752091,0.00012526887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016675942,0.0014827577,0.0014648819,0.0028723846,0.0010444039,0.0026396222,0.003608232,0.0029898565,0.006859635],"category_scores_gemma":[0.012132262,0.001165304,0.0025074184,0.004099869,0.0024008148,0.00635948,0.0038524107,0.0026770246,0.0021563352],"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.00008572832,0.00006348596,0.00058084243,0.00024726058,0.000099662786,0.00021141584,0.0002400767,0.3342757,0.0018741806,0.55349696,0.0043284832,0.10449617],"study_design_scores_gemma":[0.00001924328,0.00002406734,0.00011705498,0.000030003264,0.00002347579,0.00013638342,0.000039866154,0.41957885,0.0007347261,0.5709933,0.008280628,0.0000223296],"about_ca_topic_score_codex":0.0032815414,"about_ca_topic_score_gemma":0.0030476437,"teacher_disagreement_score":0.006859635,"about_ca_system_score_codex":0.0013650429,"about_ca_system_score_gemma":0.0012349908,"threshold_uncertainty_score":0.022947729},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001713594,0.00006308052,0.9973259,0.000045774825,0.000019060233,0.00002325614,0.00001538724,0.00025791852,0.00053598295],"genre_scores_gemma":[0.058527354,0.00016404985,0.93830323,0.00008528726,0.00004169679,0.00013094158,0.00017642883,0.00023073592,0.0023402732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817336,0.00057553686,0.00006601034,0.00040254433,0.00070285227,0.00007958486],"domain_scores_gemma":[0.9984195,0.00047664662,0.000120349345,0.00053083355,0.00038073008,0.00007192229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016363598,0.00084745756,0.0013742285,0.0021399576,0.0010918967,0.0013283872,0.0022505876,0.0018303188,0.0034798163],"category_scores_gemma":[0.0044801976,0.0005774199,0.0010894637,0.0022296484,0.0016742998,0.0025030868,0.0022611583,0.0019889239,0.0018407678],"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.00015415241,0.00013258982,0.000661201,0.00020118144,0.00014572604,0.00021717174,0.000334558,0.33968186,0.024593659,0.20503458,0.0052486123,0.4235947],"study_design_scores_gemma":[0.000008736372,0.000024517867,0.00016847807,0.000007791023,0.000009704216,0.00010313512,0.00002770692,0.9585459,0.0036405062,0.034456976,0.0029768196,0.00002972717],"about_ca_topic_score_codex":0.002777929,"about_ca_topic_score_gemma":0.002487994,"teacher_disagreement_score":0.0034798163,"about_ca_system_score_codex":0.0008330874,"about_ca_system_score_gemma":0.0012766947,"threshold_uncertainty_score":0.011641145},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075103333,0.00009695958,0.98947704,0.000091354086,0.000016584143,0.000034263303,0.000042171116,0.001863466,0.0008678658],"genre_scores_gemma":[0.13179496,0.0002768547,0.864203,0.00010901068,0.00004777007,0.00014630123,0.0002867391,0.00087436143,0.0022610275],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988943,0.00028485712,0.000057028497,0.00023351843,0.00045128254,0.00007905807],"domain_scores_gemma":[0.99810755,0.0007635495,0.00021503738,0.0004261388,0.0003800096,0.00010768858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089644635,0.001044278,0.001236531,0.0041385703,0.0009837413,0.0025090983,0.0015388546,0.0013341829,0.0029490844],"category_scores_gemma":[0.004491618,0.00071714073,0.0011107213,0.00301205,0.0012036728,0.00311379,0.0020285433,0.0011473496,0.0014611105],"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.0002067288,0.000106605534,0.0020989552,0.00034495222,0.00016602367,0.00033570474,0.0010302507,0.22637132,0.051743966,0.21990743,0.007934685,0.4897534],"study_design_scores_gemma":[0.00001465128,0.00003667408,0.00056760525,0.000017739923,0.000012860314,0.00025441468,0.000066043634,0.8969874,0.010471703,0.08527298,0.006247664,0.000050268267],"about_ca_topic_score_codex":0.0032151805,"about_ca_topic_score_gemma":0.003086712,"teacher_disagreement_score":0.0041385703,"about_ca_system_score_codex":0.0013265003,"about_ca_system_score_gemma":0.0009908227,"threshold_uncertainty_score":0.009865701},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003580986,0.00009560112,0.99515694,0.000042451233,0.000044714117,0.00003898175,0.000117300624,0.00034493412,0.0005780557],"genre_scores_gemma":[0.1179539,0.00019216648,0.87593627,0.00020017114,0.00011753895,0.00028719413,0.0013174412,0.00033127892,0.0036639909],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997736,0.00087810593,0.00013612171,0.0005360558,0.0006220726,0.000091755624],"domain_scores_gemma":[0.99575883,0.0020896874,0.00023074931,0.000847206,0.00094196777,0.00013162478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027008667,0.000884434,0.0014648702,0.0026866435,0.0006462513,0.0010403502,0.002779636,0.0021677807,0.005192515],"category_scores_gemma":[0.012956468,0.00039567397,0.0011699153,0.003241405,0.0008270339,0.002144902,0.0017735688,0.0018133189,0.001964149],"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.0005552344,0.0003712348,0.0056318664,0.00061028503,0.0006034348,0.00017880819,0.00019899842,0.18975596,0.021753129,0.068465106,0.011834409,0.7000415],"study_design_scores_gemma":[0.000046811052,0.00017435878,0.00200731,0.000033643057,0.000076013726,0.0004916065,0.00006928393,0.93833834,0.01173033,0.040066365,0.006922,0.000043894972],"about_ca_topic_score_codex":0.0009801348,"about_ca_topic_score_gemma":0.0015973593,"teacher_disagreement_score":0.005192515,"about_ca_system_score_codex":0.00056830473,"about_ca_system_score_gemma":0.0007099406,"threshold_uncertainty_score":0.0173707},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020650707,0.0041425987,0.9678572,0.0010072661,0.0001271392,0.00006730228,0.00013805805,0.00042681053,0.005582946],"genre_scores_gemma":[0.44220084,0.008633209,0.53943604,0.00042540373,0.00031059628,0.00020941411,0.00083842763,0.00023566559,0.007710449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978617,0.00083079777,0.0001137856,0.0005290253,0.00054962735,0.0001150496],"domain_scores_gemma":[0.99700683,0.001586686,0.00034300075,0.00063428475,0.00033319622,0.00009609577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014291294,0.0006710636,0.0012147792,0.0024552355,0.0008064432,0.0022314717,0.0017038828,0.0020509847,0.002192662],"category_scores_gemma":[0.0100144595,0.0005331783,0.00078205287,0.0061926204,0.0021556315,0.006926587,0.0019544044,0.0017227827,0.00058683194],"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.00006449653,0.00007110096,0.0008057628,0.00037249055,0.00005568561,0.000094674026,0.00019591356,0.20005222,0.0014503538,0.6474892,0.004313882,0.14503424],"study_design_scores_gemma":[0.000008642385,0.000025914338,0.00022392468,0.000034632933,0.000016846692,0.000076350625,0.000061063314,0.24848995,0.00067910017,0.7435869,0.006783393,0.000013442542],"about_ca_topic_score_codex":0.0036325075,"about_ca_topic_score_gemma":0.0027245602,"teacher_disagreement_score":0.0036325075,"about_ca_system_score_codex":0.0023240026,"about_ca_system_score_gemma":0.0009992827,"threshold_uncertainty_score":0.016861856},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34683368,0.0031133317,0.62154126,0.0012675565,0.00029585295,0.0005503644,0.0058469353,0.0100390045,0.010512005],"genre_scores_gemma":[0.5283616,0.0020740307,0.45076674,0.0003443205,0.00014705613,0.00056569,0.010914918,0.00079024676,0.0060353414],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893504,0.00014958308,0.000120610544,0.00023227658,0.00042767837,0.00013484868],"domain_scores_gemma":[0.9947876,0.001605599,0.0003558501,0.00247065,0.0006540097,0.00012628411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007135539,0.00091879343,0.0013356158,0.0021693252,0.00060789485,0.0019261745,0.0021472548,0.00066373305,0.005777795],"category_scores_gemma":[0.007785128,0.000613652,0.00066927844,0.0056884717,0.00060019735,0.006938201,0.0022008135,0.0010043484,0.0013279748],"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.0014662818,0.000385234,0.0040758806,0.00069189235,0.0001587746,0.00073989516,0.00064244133,0.08991557,0.04282249,0.034492563,0.02225106,0.8023579],"study_design_scores_gemma":[0.00038745275,0.0009797972,0.0033286598,0.00018546573,0.00024281813,0.0022577916,0.0013171554,0.68632615,0.11052349,0.12356794,0.07074855,0.00013478269],"about_ca_topic_score_codex":0.0023994572,"about_ca_topic_score_gemma":0.0022195987,"teacher_disagreement_score":0.005777795,"about_ca_system_score_codex":0.00059367507,"about_ca_system_score_gemma":0.0010334359,"threshold_uncertainty_score":0.019328713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9953159,0.00031119032,0.0027761532,0.00015098637,0.00004321762,0.000014732043,0.000071607705,0.00019865455,0.0011175727],"genre_scores_gemma":[0.9980848,0.000059210113,0.0014001041,0.000024501325,0.00002096169,0.000011331377,0.00007873129,0.000056826313,0.0002637127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972224,0.0009462238,0.0001696222,0.00040149115,0.00062353024,0.00063670176],"domain_scores_gemma":[0.9614685,0.029209618,0.0019274735,0.0036426114,0.0025309403,0.001220839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036467959,0.00069230446,0.00057775626,0.000896818,0.0008270461,0.0014389622,0.0010586305,0.0006534415,0.0015196899],"category_scores_gemma":[0.023511259,0.00061374996,0.0004632794,0.0013231781,0.0010317847,0.0018498703,0.0007537126,0.0015795896,0.00019790453],"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.009476951,0.0027338988,0.13927154,0.00059494906,0.00055784266,0.00047294283,0.0009269287,0.564661,0.14067997,0.008827705,0.005034552,0.12676169],"study_design_scores_gemma":[0.00012834983,0.0011464187,0.03310149,0.000017816983,0.0002501321,0.0000889077,0.00022637432,0.9135151,0.046976365,0.003578819,0.000919503,0.000050755232],"about_ca_topic_score_codex":0.0036970149,"about_ca_topic_score_gemma":0.0042525693,"teacher_disagreement_score":0.0036970149,"about_ca_system_score_codex":0.0011467481,"about_ca_system_score_gemma":0.0015779539,"threshold_uncertainty_score":0.019286275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23749243,0.0018231573,0.68806326,0.0026343588,0.0004786202,0.000120753306,0.00083779293,0.00040509622,0.06814452],"genre_scores_gemma":[0.8986927,0.0012539779,0.075357385,0.00071024837,0.0008023396,0.00021788,0.0005820666,0.0001287562,0.022254637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990845,0.00026539163,0.00004246185,0.0002235007,0.00027134188,0.00011281425],"domain_scores_gemma":[0.9947536,0.0026957565,0.00085501716,0.0006869129,0.00060998567,0.00039876558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070855167,0.0006038745,0.00080312527,0.0018748654,0.0013933982,0.0018665724,0.0011865981,0.0010961227,0.012652011],"category_scores_gemma":[0.005884181,0.00055757095,0.00058441894,0.0026067533,0.0027539937,0.0039193425,0.0014284519,0.0025676652,0.0010513003],"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.000026451875,0.000015588266,0.000114134375,0.000018889272,0.000005361309,0.000029145387,0.000073609495,0.0024048248,0.00039027273,0.9903694,0.000964502,0.0055877627],"study_design_scores_gemma":[0.0000047889935,0.0000062892464,0.000049237322,0.0000040198465,0.000002263772,0.000024131157,0.000017530561,0.010480838,0.00015481863,0.98841757,0.00083204237,0.000006506065],"about_ca_topic_score_codex":0.0010796181,"about_ca_topic_score_gemma":0.0016925314,"teacher_disagreement_score":0.012652011,"about_ca_system_score_codex":0.0007537252,"about_ca_system_score_gemma":0.0007723325,"threshold_uncertainty_score":0.0423252},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011386457,0.00048255315,0.9769131,0.00080935186,0.00010599294,0.00016386226,0.001960537,0.0035069177,0.0046712304],"genre_scores_gemma":[0.18487896,0.00096880604,0.8012808,0.00025093558,0.00010814251,0.0004978043,0.0061627594,0.00051247515,0.0053393194],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986823,0.00040989465,0.00012125751,0.00021324589,0.00046385577,0.00010938272],"domain_scores_gemma":[0.99703705,0.0010099794,0.00021894109,0.001270608,0.0003655603,0.0000977965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009965084,0.0009983111,0.0008363122,0.0018570325,0.0007251671,0.0031945775,0.001790154,0.0014847894,0.011672281],"category_scores_gemma":[0.009724297,0.0005477674,0.0010798645,0.0044144075,0.0008088301,0.006582951,0.0022870784,0.0019230036,0.0033453275],"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.0003009289,0.00017463314,0.0011303602,0.0006320702,0.00006140029,0.00029448932,0.00053860137,0.18088663,0.0036208201,0.36051995,0.032349464,0.4194907],"study_design_scores_gemma":[0.00005072841,0.000058178266,0.00018576218,0.00008046215,0.000028907676,0.0003731306,0.00038550992,0.5876081,0.0025511498,0.37432176,0.034331303,0.000024943869],"about_ca_topic_score_codex":0.0026805983,"about_ca_topic_score_gemma":0.0045044525,"teacher_disagreement_score":0.011672281,"about_ca_system_score_codex":0.0012380559,"about_ca_system_score_gemma":0.0009698421,"threshold_uncertainty_score":0.039047718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022208267,0.00002586504,0.9959162,0.000032656586,0.000011753994,0.000018510224,0.000026652333,0.00057874946,0.0011688423],"genre_scores_gemma":[0.11332822,0.00018159644,0.8826839,0.0000687229,0.000020345082,0.00015606503,0.00018693044,0.0006700493,0.0027042364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995165,0.00011083437,0.000024953828,0.00009167337,0.00021100795,0.00004507807],"domain_scores_gemma":[0.9991566,0.0002835186,0.00007181022,0.00025587576,0.00017015425,0.000061948216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066662574,0.00072933163,0.00059434486,0.001113208,0.000623018,0.0019868456,0.0019391296,0.0010377008,0.0038481716],"category_scores_gemma":[0.0025390596,0.00072777533,0.0010876076,0.001025737,0.0011434947,0.0026565492,0.0020695482,0.0015398535,0.0011578255],"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.000098880824,0.00006599635,0.00064615364,0.00013664918,0.000043098582,0.00013523348,0.00036187592,0.58819306,0.021777255,0.25058365,0.0043370835,0.13362099],"study_design_scores_gemma":[0.000011645356,0.000030407235,0.000051512627,0.00001455893,0.000012424764,0.000056324414,0.000028143613,0.9322602,0.0053240675,0.0491206,0.013069369,0.000020748948],"about_ca_topic_score_codex":0.0030724225,"about_ca_topic_score_gemma":0.00554027,"teacher_disagreement_score":0.0038481716,"about_ca_system_score_codex":0.0007085507,"about_ca_system_score_gemma":0.0011180796,"threshold_uncertainty_score":0.012873411},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023301024,0.00029643724,0.93926746,0.0002926268,0.00012395703,0.00013572832,0.0007506091,0.02929148,0.0065405886],"genre_scores_gemma":[0.23716912,0.0003221679,0.7521141,0.00024728835,0.00006498993,0.00035745112,0.0032747593,0.0019211244,0.0045289313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991007,0.00014058249,0.000050119583,0.00024384916,0.00033785857,0.00012686006],"domain_scores_gemma":[0.99860066,0.00033970535,0.000087099645,0.0005958468,0.000278847,0.00009780612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005802297,0.0009652835,0.0006961742,0.00097088114,0.00085653085,0.0016503211,0.0026171445,0.0006192308,0.003725873],"category_scores_gemma":[0.0022550658,0.0005834536,0.0012164366,0.001494251,0.00097509485,0.002466808,0.0021494841,0.0015334878,0.0011579776],"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.0010731835,0.00034746004,0.0043431073,0.0010285646,0.00034410896,0.0005922371,0.00077684526,0.3738153,0.07528861,0.1293384,0.073418215,0.33963403],"study_design_scores_gemma":[0.00019567885,0.000102212514,0.0006710751,0.00002479393,0.000051592113,0.0001217625,0.000085559164,0.8924076,0.027158229,0.056368038,0.022767255,0.000046307556],"about_ca_topic_score_codex":0.009446078,"about_ca_topic_score_gemma":0.015903324,"teacher_disagreement_score":0.009446078,"about_ca_system_score_codex":0.0014081253,"about_ca_system_score_gemma":0.0027166735,"threshold_uncertainty_score":0.018782198},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44175166,0.0143500045,0.4709498,0.01907851,0.002035975,0.00022698434,0.00065223494,0.006012244,0.04494251],"genre_scores_gemma":[0.8205824,0.004233529,0.16117768,0.0015421049,0.00067727553,0.00013859314,0.0006386637,0.0011831544,0.009826471],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982003,0.0006635178,0.000064567255,0.00029984396,0.000463836,0.00030783901],"domain_scores_gemma":[0.9959973,0.0019178273,0.00015937221,0.0010091692,0.0005655211,0.0003507913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017139398,0.0010286273,0.001108065,0.0008972355,0.0013304296,0.0033749007,0.0023330317,0.001499907,0.0060033086],"category_scores_gemma":[0.01122908,0.0006182024,0.0005335115,0.0024128177,0.0014737787,0.007308342,0.0027158777,0.0021031287,0.0013800287],"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.001545536,0.0005135743,0.008905105,0.00057610206,0.00018541151,0.000500299,0.00095889217,0.2834098,0.021434613,0.18150266,0.057844583,0.44262347],"study_design_scores_gemma":[0.000115067836,0.00024212305,0.002741738,0.00008294794,0.00006922871,0.0003745475,0.0007117998,0.72009003,0.012797063,0.22979425,0.03292033,0.00006091865],"about_ca_topic_score_codex":0.0051811086,"about_ca_topic_score_gemma":0.008663924,"teacher_disagreement_score":0.0060033086,"about_ca_system_score_codex":0.0013305258,"about_ca_system_score_gemma":0.0013518744,"threshold_uncertainty_score":0.02008313},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009115392,0.00008809091,0.9898493,0.00006747712,0.000009182724,0.000018574536,0.0000256138,0.00033392533,0.00049233134],"genre_scores_gemma":[0.23003162,0.0002307925,0.7672163,0.00007736525,0.000034510704,0.00010022133,0.00034374636,0.00016428735,0.0018012121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823964,0.00061695516,0.00007821146,0.0004117638,0.00055123813,0.00010225515],"domain_scores_gemma":[0.9974775,0.0009944743,0.0003228561,0.0007577054,0.00034532585,0.00010221401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012844433,0.0007986081,0.001632025,0.0023060204,0.0008580115,0.0018336393,0.001710003,0.0016677838,0.0015555434],"category_scores_gemma":[0.005666769,0.0006649427,0.0010516038,0.0029364747,0.0016068583,0.0035329019,0.0025204348,0.0013697234,0.0007071492],"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.00012434198,0.00008428642,0.0011294016,0.00011222012,0.00013626907,0.00018923145,0.00025854737,0.66108495,0.007894061,0.059981503,0.002088857,0.26691636],"study_design_scores_gemma":[0.000005084369,0.000014619912,0.00016592722,0.0000042888487,0.000005983041,0.00005344203,0.000034278233,0.9637005,0.0017670485,0.03366476,0.00057261134,0.000011476832],"about_ca_topic_score_codex":0.0028048747,"about_ca_topic_score_gemma":0.0026559718,"teacher_disagreement_score":0.0028048747,"about_ca_system_score_codex":0.0007599302,"about_ca_system_score_gemma":0.001001086,"threshold_uncertainty_score":0.006792903},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023449922,0.033857323,0.5794005,0.14267705,0.0328878,0.00053931144,0.0010718729,0.010162135,0.17595401],"genre_scores_gemma":[0.13550797,0.020223439,0.5462157,0.028888311,0.0124067385,0.00058846816,0.0011903034,0.004981529,0.24999751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776113,0.0005224515,0.00012968111,0.00058184064,0.0007632031,0.0002416633],"domain_scores_gemma":[0.9936899,0.0021181405,0.00019428373,0.0021855172,0.00096721726,0.0008450141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038356779,0.002087692,0.0011665979,0.0020245442,0.0031559288,0.0051278723,0.0023853965,0.0025462927,0.05675963],"category_scores_gemma":[0.012142514,0.001299802,0.0015297432,0.0014102901,0.007204032,0.017671667,0.007183078,0.008058336,0.021456141],"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.0011450229,0.00027902593,0.0012912215,0.0007620925,0.00013971055,0.000484771,0.0009351048,0.0035842727,0.009523676,0.42707282,0.26662222,0.28816003],"study_design_scores_gemma":[0.0001633122,0.0003549735,0.0007965751,0.0006386795,0.00005656058,0.0006323087,0.0005649274,0.009433122,0.0025631764,0.31481633,0.66985697,0.00012305264],"about_ca_topic_score_codex":0.0031212883,"about_ca_topic_score_gemma":0.0037432984,"teacher_disagreement_score":0.05675963,"about_ca_system_score_codex":0.001993737,"about_ca_system_score_gemma":0.002170874,"threshold_uncertainty_score":0.18987983},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013038521,0.00039370728,0.9964055,0.0000820351,0.000021714224,0.000023741028,0.000032924458,0.00018758816,0.0015490842],"genre_scores_gemma":[0.062356558,0.0009973026,0.93291026,0.00016214926,0.000058572197,0.00022049627,0.00022948635,0.00015858443,0.0029065537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994808,0.00021507588,0.000023755598,0.00007790706,0.00015510345,0.00004747091],"domain_scores_gemma":[0.99922276,0.0005085798,0.00007409689,0.0000829243,0.00007851077,0.000033149365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090108055,0.00094021845,0.0009859425,0.0012581833,0.000606758,0.00112874,0.0016536847,0.0014293023,0.0047542723],"category_scores_gemma":[0.0024385622,0.00085960433,0.0012138919,0.0016692017,0.00097120367,0.0013702348,0.0013139516,0.0015375599,0.0011229583],"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.00006788716,0.0000544061,0.00014336599,0.00022806034,0.000061489656,0.000071957824,0.000101578655,0.79909664,0.0027294236,0.0636161,0.0042956634,0.12953348],"study_design_scores_gemma":[0.00001770164,0.000018203993,0.000041725147,0.000021012178,0.000008271982,0.000039309263,0.000022290134,0.9642587,0.0007067855,0.031109668,0.0037444471,0.0000118732505],"about_ca_topic_score_codex":0.004301861,"about_ca_topic_score_gemma":0.0039030155,"teacher_disagreement_score":0.0047542723,"about_ca_system_score_codex":0.0010339735,"about_ca_system_score_gemma":0.0009846039,"threshold_uncertainty_score":0.015904605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2449386,0.0026286829,0.72967994,0.0033021139,0.00025889557,0.00046666252,0.0048266114,0.0049777995,0.008920666],"genre_scores_gemma":[0.76300526,0.0013737137,0.2241555,0.00046255192,0.0002532181,0.00038857057,0.005484811,0.0002651348,0.004611304],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872655,0.0002757485,0.00011917858,0.00024084287,0.00052385544,0.0001138372],"domain_scores_gemma":[0.99445045,0.0017809365,0.00050752546,0.002461505,0.0006577326,0.00014193272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007839297,0.0006868908,0.0008851004,0.0017001794,0.0006899672,0.0013159065,0.0014185274,0.0007005589,0.0022058978],"category_scores_gemma":[0.010291253,0.00030379687,0.00051044545,0.0029228895,0.00088001654,0.0051189936,0.0018605617,0.001030617,0.0009892475],"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.0011114413,0.0003351942,0.009551226,0.000713153,0.00015683677,0.00065411703,0.0019444478,0.16519274,0.047861226,0.11406754,0.0296659,0.62874615],"study_design_scores_gemma":[0.00009662106,0.000280528,0.0025465304,0.00007746651,0.000072844916,0.0008977454,0.0009556459,0.7982685,0.0470785,0.12952138,0.020141501,0.000062695886],"about_ca_topic_score_codex":0.0017788268,"about_ca_topic_score_gemma":0.0022385952,"teacher_disagreement_score":0.0022058978,"about_ca_system_score_codex":0.0009583425,"about_ca_system_score_gemma":0.00095558213,"threshold_uncertainty_score":0.0073794723},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30475068,0.0008764974,0.46440336,0.0005158294,0.0002851547,0.0008633564,0.0034549918,0.19814663,0.026703509],"genre_scores_gemma":[0.45765042,0.0004242929,0.5204799,0.00026046613,0.00005162674,0.0006124893,0.0067090713,0.009038732,0.004772904],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99686277,0.00082647026,0.00014637428,0.00047732383,0.0012812627,0.0004058092],"domain_scores_gemma":[0.9937263,0.0030625723,0.0002709799,0.0016802395,0.0009580758,0.00030191042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027057687,0.002103402,0.00088973955,0.0015332674,0.0010548386,0.0010602484,0.0052141966,0.0014086745,0.006173452],"category_scores_gemma":[0.008839506,0.00096403214,0.00085724785,0.0024598762,0.0013239647,0.0027561097,0.0018647547,0.0016548746,0.0019064087],"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.0028760836,0.002308366,0.011119112,0.0017549176,0.0003945805,0.0004726444,0.00093429856,0.36152965,0.023509683,0.018611213,0.07433199,0.50215745],"study_design_scores_gemma":[0.0006321999,0.0007124921,0.0034543357,0.00006490449,0.00008139022,0.00013488442,0.00021721369,0.9089527,0.05968039,0.005725567,0.020270115,0.00007382526],"about_ca_topic_score_codex":0.021394132,"about_ca_topic_score_gemma":0.012660008,"teacher_disagreement_score":0.021394132,"about_ca_system_score_codex":0.0016643007,"about_ca_system_score_gemma":0.0025241012,"threshold_uncertainty_score":0.04253924},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47675493,0.0019396996,0.39911434,0.0021290586,0.00031746365,0.000411666,0.0030407284,0.0012987076,0.11499333],"genre_scores_gemma":[0.85576963,0.0015984669,0.113515176,0.00053343317,0.0005008456,0.00025050744,0.0036021338,0.00063063094,0.023599243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922407,0.00013052896,0.000051170555,0.00024329202,0.0002280144,0.00012291555],"domain_scores_gemma":[0.99640036,0.0018357277,0.00042611486,0.0004984168,0.00048750703,0.0003519807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064368406,0.0010032143,0.0009188898,0.0036020025,0.0010976645,0.0032444997,0.001328829,0.0008992708,0.0057104],"category_scores_gemma":[0.0046154,0.0006281931,0.0007709846,0.0032261023,0.0014762761,0.005700029,0.0016303229,0.0018578724,0.00080306135],"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.00028272986,0.00012463584,0.003333678,0.0004917794,0.000036443842,0.00025452304,0.0006775616,0.011301147,0.015085651,0.87134093,0.011163999,0.08590689],"study_design_scores_gemma":[0.000027576833,0.00008989337,0.0022771142,0.00012464424,0.000044116554,0.0008362607,0.00041079623,0.047755938,0.006996375,0.9224429,0.01895964,0.00003478884],"about_ca_topic_score_codex":0.00055830536,"about_ca_topic_score_gemma":0.0008628449,"teacher_disagreement_score":0.0057104,"about_ca_system_score_codex":0.001030323,"about_ca_system_score_gemma":0.00050116953,"threshold_uncertainty_score":0.01910317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026247341,0.00036872047,0.9715784,0.00008050351,0.00005268021,0.000054837714,0.00015375408,0.00077215256,0.0006915045],"genre_scores_gemma":[0.3388817,0.00038330798,0.6579772,0.00007876697,0.00006977329,0.000110084555,0.00084784214,0.00016871415,0.0014826293],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831957,0.00033055083,0.00013310397,0.00049305015,0.0006459317,0.00007782827],"domain_scores_gemma":[0.9976503,0.0008702485,0.00033692116,0.00057297136,0.0004168253,0.00015264418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007132442,0.0006490521,0.0012524781,0.0032173574,0.00050964305,0.0011420175,0.0018894422,0.0011206939,0.0015871819],"category_scores_gemma":[0.005330418,0.00026468188,0.0009240105,0.0035017212,0.00074122084,0.002236446,0.0014531333,0.00083091867,0.00059660285],"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.00035095625,0.00016754758,0.0025679704,0.0003620564,0.00019821995,0.0002545855,0.00033250503,0.1528706,0.03184312,0.03833813,0.0046071787,0.7681072],"study_design_scores_gemma":[0.00001607641,0.00018630964,0.0013553862,0.000014894034,0.00003485201,0.00042851767,0.00009689437,0.94331557,0.016971326,0.03378708,0.0037468392,0.000046246154],"about_ca_topic_score_codex":0.0024080514,"about_ca_topic_score_gemma":0.0026563825,"teacher_disagreement_score":0.0032173574,"about_ca_system_score_codex":0.0008463991,"about_ca_system_score_gemma":0.0005573255,"threshold_uncertainty_score":0.006141126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092110597,0.00005727833,0.9978751,0.00014417166,0.000019989287,0.000019891106,0.000024047087,0.00022842803,0.00070996745],"genre_scores_gemma":[0.20508108,0.00049267785,0.78823173,0.0002591294,0.00023303136,0.0005965227,0.0002688377,0.00026761854,0.004569389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840134,0.0007360783,0.00006485044,0.00024120432,0.00040463213,0.0001519001],"domain_scores_gemma":[0.9972024,0.0017909501,0.00018589263,0.00039113188,0.00031852123,0.00011110969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029087784,0.0017704514,0.0017879835,0.00089057715,0.00096461835,0.0017868147,0.003267895,0.002042097,0.0038256866],"category_scores_gemma":[0.007292556,0.0008405705,0.0012101382,0.0016902046,0.0020371142,0.0026707966,0.0018441246,0.0042557707,0.0012151414],"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.0000344213,0.000034305616,0.000119477045,0.000069213915,0.000025381547,0.00005227162,0.000048991587,0.86517334,0.00047418836,0.11785294,0.0016218812,0.014493604],"study_design_scores_gemma":[0.000010051058,0.000007651584,0.000010124471,0.0000025742227,0.0000030223964,0.0000062775125,0.0000037019454,0.9636828,0.00016047986,0.0354033,0.00070720824,0.0000027690223],"about_ca_topic_score_codex":0.005196904,"about_ca_topic_score_gemma":0.005029428,"teacher_disagreement_score":0.005196904,"about_ca_system_score_codex":0.0020187853,"about_ca_system_score_gemma":0.0024352772,"threshold_uncertainty_score":0.015383303},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021882867,0.00022763031,0.9758009,0.00014196854,0.000037426013,0.00009147273,0.00008104869,0.0005747413,0.0011619242],"genre_scores_gemma":[0.23012087,0.00018686123,0.7660175,0.00018388948,0.000047567362,0.00028674386,0.0006479933,0.00040013433,0.0021084663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989942,0.00027073576,0.000037733957,0.0003244906,0.00027031294,0.000102533486],"domain_scores_gemma":[0.99878734,0.0006070798,0.00013670692,0.00014860285,0.0002350843,0.00008529956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010937243,0.0014709501,0.0015857199,0.0016086624,0.0010336107,0.0010851424,0.0020199595,0.0015290733,0.0024095478],"category_scores_gemma":[0.003137989,0.00060483103,0.0008313004,0.0020283503,0.00092975376,0.0023771399,0.0013007009,0.0010672758,0.0005244721],"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.00023837408,0.0001897067,0.0015060268,0.00022654934,0.000095068746,0.00013402048,0.00021044105,0.6778124,0.013395148,0.020631162,0.0066741896,0.2788869],"study_design_scores_gemma":[0.000023391314,0.00003690834,0.00015470118,0.000008211366,0.000012876361,0.000047063408,0.000036043835,0.986955,0.0022163535,0.009564636,0.00093770446,0.0000072365465],"about_ca_topic_score_codex":0.0045169615,"about_ca_topic_score_gemma":0.0060049873,"teacher_disagreement_score":0.0045169615,"about_ca_system_score_codex":0.0013521481,"about_ca_system_score_gemma":0.0014215269,"threshold_uncertainty_score":0.009810567},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012694488,0.00040971002,0.9101713,0.00067725213,0.00021281601,0.00035555,0.005221051,0.06680161,0.0034562084],"genre_scores_gemma":[0.14121497,0.00042146197,0.83489764,0.00037056144,0.00009733147,0.00060550525,0.0143782,0.0032343126,0.0047800317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921894,0.0001281859,0.00007025429,0.00018279195,0.00034204955,0.000057733578],"domain_scores_gemma":[0.99717975,0.0005824365,0.00020355698,0.0013548204,0.0004193109,0.00026027736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010290953,0.0010853889,0.00088962214,0.0021731975,0.0009711157,0.0016538759,0.004443397,0.00090986746,0.007732197],"category_scores_gemma":[0.006420734,0.00068642356,0.0008370209,0.0033132443,0.00085240055,0.00404753,0.0033377428,0.0018317334,0.0026574123],"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.001078096,0.00048668566,0.0051651234,0.0008712481,0.00027011443,0.0003381254,0.00067954214,0.14225753,0.017044725,0.07880573,0.17646688,0.57653606],"study_design_scores_gemma":[0.0002975574,0.00026656422,0.0010975266,0.00005863445,0.000056207857,0.00029542178,0.00020499754,0.80468535,0.01605938,0.09792568,0.07894786,0.00010480011],"about_ca_topic_score_codex":0.004562236,"about_ca_topic_score_gemma":0.010054908,"teacher_disagreement_score":0.007732197,"about_ca_system_score_codex":0.0012041981,"about_ca_system_score_gemma":0.0016461499,"threshold_uncertainty_score":0.025866747},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01706234,0.00063849846,0.97567755,0.00015289323,0.00018211632,0.000114784205,0.00039257598,0.0029844495,0.0027948255],"genre_scores_gemma":[0.13640068,0.00029818798,0.85756373,0.00011890364,0.00013732661,0.00021948645,0.0015316085,0.0007896848,0.0029402857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783736,0.00055974093,0.00020561973,0.00052206643,0.00068059016,0.00019454803],"domain_scores_gemma":[0.99351716,0.0034653577,0.00024849048,0.0017482456,0.0007452521,0.00027556613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017492315,0.0013852799,0.0025684764,0.004165649,0.0012599714,0.0033347069,0.0037286598,0.001800992,0.009517463],"category_scores_gemma":[0.012057028,0.0008508895,0.0016943977,0.0044418843,0.0013596022,0.0050092004,0.0025713143,0.0024701545,0.0028506562],"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.0006452005,0.00036774582,0.0015092526,0.0005726873,0.0002662498,0.00032093324,0.0004173161,0.16859898,0.013840434,0.14808756,0.021958992,0.6434147],"study_design_scores_gemma":[0.00008067318,0.00013668518,0.0005915484,0.000041120293,0.00007776969,0.00021807908,0.00011771677,0.83830315,0.0073396154,0.14656045,0.006462388,0.00007080592],"about_ca_topic_score_codex":0.0035058197,"about_ca_topic_score_gemma":0.0052159205,"teacher_disagreement_score":0.009517463,"about_ca_system_score_codex":0.0019473631,"about_ca_system_score_gemma":0.0019509195,"threshold_uncertainty_score":0.031839073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13566872,0.0002897798,0.8508441,0.0010978617,0.000090554415,0.0002440315,0.00029591678,0.000326667,0.011142368],"genre_scores_gemma":[0.7525544,0.0004306816,0.23377678,0.00017387989,0.000049139035,0.00030000144,0.0006098757,0.00009421176,0.012011021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902785,0.00034166072,0.000047387988,0.00022252207,0.00014387137,0.00021668496],"domain_scores_gemma":[0.9990388,0.00041580308,0.00012262081,0.000093556446,0.00010765325,0.00022147736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008571935,0.0007214824,0.00083232374,0.00086964417,0.0014731095,0.0017296086,0.0017386285,0.001406572,0.005777181],"category_scores_gemma":[0.0020668486,0.00049124914,0.0009625042,0.001816912,0.0008364772,0.003529657,0.0016276924,0.0011990565,0.00047781106],"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.0003011198,0.00029867873,0.002603899,0.00015702606,0.00005864598,0.0005075188,0.0004046038,0.8410061,0.0018514011,0.09967934,0.004661027,0.048470616],"study_design_scores_gemma":[0.000040122766,0.000036791273,0.00031865574,0.000010231085,0.000017567683,0.000060764334,0.00023395447,0.96410763,0.0003615043,0.032663126,0.0021357809,0.000013801741],"about_ca_topic_score_codex":0.017184494,"about_ca_topic_score_gemma":0.01626048,"teacher_disagreement_score":0.017184494,"about_ca_system_score_codex":0.0016456618,"about_ca_system_score_gemma":0.0021373935,"threshold_uncertainty_score":0.03416896},"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":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04708662,0.00091789087,0.3444376,0.0008246782,0.0008671346,0.0004965434,0.0068780524,0.44795376,0.15053771],"genre_scores_gemma":[0.43965068,0.00085816375,0.37078044,0.0015073278,0.00025396937,0.00095232116,0.02697431,0.03543712,0.12358559],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887997,0.00019830267,0.000052036034,0.0003854765,0.00033268283,0.00015152845],"domain_scores_gemma":[0.9975011,0.00032536217,0.00006185065,0.0015622792,0.00039549643,0.00015389129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008898036,0.00094986893,0.00051145995,0.00088988536,0.00096483115,0.0016218023,0.0025272884,0.0008274679,0.03614961],"category_scores_gemma":[0.0037110504,0.0007601601,0.00069899904,0.0008320847,0.000949964,0.0028464578,0.003092166,0.0014490631,0.017511938],"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.0028026656,0.0004121504,0.004937518,0.0011774072,0.00020764841,0.00044040655,0.0008129368,0.03496903,0.041927263,0.11804061,0.42658266,0.36768973],"study_design_scores_gemma":[0.0005006552,0.0003870334,0.0028843062,0.00013463398,0.00012406388,0.00066246575,0.00022278022,0.21425843,0.061768368,0.1023443,0.6165552,0.00015773065],"about_ca_topic_score_codex":0.003738397,"about_ca_topic_score_gemma":0.0042413417,"teacher_disagreement_score":0.03614961,"about_ca_system_score_codex":0.00079700974,"about_ca_system_score_gemma":0.0014063503,"threshold_uncertainty_score":0.12093252},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006401502,0.00045871534,0.88896793,0.0005113642,0.00008475239,0.00035116094,0.0016962251,0.09827921,0.003249144],"genre_scores_gemma":[0.1407674,0.0007874059,0.8309201,0.00091189495,0.00015322535,0.00072676054,0.010150494,0.010533466,0.0050491896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99656445,0.0005669067,0.00031912993,0.00097543566,0.00123533,0.00033887968],"domain_scores_gemma":[0.9947983,0.0013616997,0.00021190384,0.002596169,0.0006905089,0.00034134378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004428691,0.0022860952,0.0017558051,0.002367698,0.0019909893,0.0045996215,0.0075231385,0.0018363659,0.005400068],"category_scores_gemma":[0.007963038,0.0016132048,0.002415364,0.0037465577,0.0030065374,0.010862462,0.0066053923,0.004172469,0.0029069092],"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.0028872208,0.00083619385,0.009019652,0.0023472647,0.00061973464,0.00072132243,0.002417513,0.1019322,0.07424613,0.30107218,0.21728759,0.28661296],"study_design_scores_gemma":[0.0003976579,0.00026148933,0.0014925881,0.000093430725,0.00013276435,0.0005719675,0.00045156173,0.7000275,0.035902083,0.16118033,0.09926668,0.0002219355],"about_ca_topic_score_codex":0.015236175,"about_ca_topic_score_gemma":0.022148624,"teacher_disagreement_score":0.015236175,"about_ca_system_score_codex":0.0022713318,"about_ca_system_score_gemma":0.0036024766,"threshold_uncertainty_score":0.030294955},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020296723,0.00023203192,0.73804647,0.0003733845,0.00015499287,0.00022471722,0.0046644607,0.22388585,0.012121356],"genre_scores_gemma":[0.27544,0.00049708626,0.65708643,0.0010235597,0.00012916105,0.00045837078,0.024941208,0.021531602,0.01889249],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989613,0.00015456697,0.00009776049,0.00030602308,0.0003927338,0.0000875641],"domain_scores_gemma":[0.9983456,0.00040466592,0.00009560827,0.0007441249,0.00034461168,0.0000653709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091419194,0.0010619411,0.0005365159,0.00067635864,0.000402387,0.0016874631,0.0016690579,0.000469603,0.014513643],"category_scores_gemma":[0.0038153096,0.00054689514,0.0008056494,0.00083944754,0.00048382,0.003011367,0.0022284247,0.0010186844,0.0059220484],"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.0014136215,0.0002811062,0.0051182457,0.0011404502,0.00019000853,0.000667872,0.00074661605,0.04412558,0.055131763,0.07219938,0.18488823,0.6340971],"study_design_scores_gemma":[0.0002304385,0.00039251093,0.0019899588,0.00007918023,0.000115226554,0.0007429475,0.00025014198,0.52776664,0.1277236,0.06760506,0.27299163,0.00011272513],"about_ca_topic_score_codex":0.0033342803,"about_ca_topic_score_gemma":0.0033930615,"teacher_disagreement_score":0.014513643,"about_ca_system_score_codex":0.0005704024,"about_ca_system_score_gemma":0.0010022006,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008184694,0.0011162893,0.9288641,0.0027974343,0.00065186765,0.00025903675,0.0069992873,0.030192612,0.020934679],"genre_scores_gemma":[0.15767209,0.0025379688,0.7773151,0.002403767,0.00042203837,0.00080848386,0.028850386,0.0075974455,0.022392739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975668,0.000573018,0.00022509771,0.0006997237,0.00075762544,0.0001777124],"domain_scores_gemma":[0.9934683,0.001226839,0.00028152464,0.0036674184,0.0008637976,0.00049211876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026673463,0.00072493835,0.00095396204,0.0028218508,0.001725469,0.004869349,0.0042694323,0.0016150937,0.010068553],"category_scores_gemma":[0.012011379,0.0008210709,0.0015504999,0.0030820917,0.0019449586,0.013491014,0.0057558324,0.0021970368,0.004446796],"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.00020787127,0.00009515153,0.0012626543,0.00041033843,0.00009330962,0.00020783264,0.0006248947,0.0078620305,0.002446058,0.65345395,0.116804145,0.21653174],"study_design_scores_gemma":[0.000062204614,0.000057984395,0.0005002795,0.00014125707,0.00005412296,0.00033472735,0.0001719903,0.030676655,0.0037981663,0.46694824,0.4971546,0.00009980793],"about_ca_topic_score_codex":0.005189206,"about_ca_topic_score_gemma":0.004966768,"teacher_disagreement_score":0.010068553,"about_ca_system_score_codex":0.0014832118,"about_ca_system_score_gemma":0.0022891446,"threshold_uncertainty_score":0.033682704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9606584,0.0009395862,0.0132800685,0.00062268315,0.0004130526,0.000385699,0.0020666786,0.008253878,0.013379931],"genre_scores_gemma":[0.94050515,0.00048303354,0.044412587,0.00030968175,0.000100564066,0.00033246473,0.0084000835,0.00085933786,0.004597082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996111,0.000976745,0.00041852507,0.0008782812,0.0011624239,0.000453091],"domain_scores_gemma":[0.98111606,0.009237604,0.00067862537,0.0045189173,0.0035377599,0.0009110452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029423316,0.0009901201,0.0007837994,0.0013705387,0.001074618,0.0013048565,0.0022577024,0.0010411057,0.005131413],"category_scores_gemma":[0.015143482,0.00045617323,0.00043291735,0.0022552568,0.0011654389,0.003750167,0.0014431394,0.0013961105,0.0015987145],"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.018455027,0.012623264,0.025455661,0.005010725,0.0011914842,0.0008346339,0.002395611,0.27142504,0.14001103,0.024309976,0.12194855,0.376339],"study_design_scores_gemma":[0.002178128,0.016217288,0.042625155,0.00019299217,0.00038993446,0.00079007033,0.0030433636,0.6974812,0.17314315,0.018859893,0.044813756,0.00026504503],"about_ca_topic_score_codex":0.0037232826,"about_ca_topic_score_gemma":0.004334174,"teacher_disagreement_score":0.005131413,"about_ca_system_score_codex":0.0011492502,"about_ca_system_score_gemma":0.001108922,"threshold_uncertainty_score":0.017166317},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1806637,0.00033581257,0.8000292,0.0005712329,0.000084208696,0.0001789682,0.00044028234,0.006468044,0.011228528],"genre_scores_gemma":[0.5085057,0.00020456203,0.48438832,0.00017682901,0.000026034219,0.00021351388,0.0010680892,0.00064524816,0.0047717323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927574,0.00013944187,0.000044792516,0.00019474598,0.00020803584,0.00013733293],"domain_scores_gemma":[0.9969958,0.00091551,0.00019718893,0.0013015564,0.00042691306,0.00016308797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010449333,0.0008093466,0.00068808097,0.0009295138,0.0010042824,0.001489421,0.0016227012,0.0007513224,0.004907934],"category_scores_gemma":[0.006103801,0.00049839925,0.000692374,0.0014942645,0.000873805,0.0035087497,0.0017585318,0.0012219249,0.001373386],"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.00090095046,0.0003024004,0.0057541626,0.0003796038,0.00014566106,0.0003656886,0.0007113432,0.61212045,0.018326862,0.065403365,0.017558277,0.27803117],"study_design_scores_gemma":[0.00003876512,0.000055714714,0.00058392005,0.000014010639,0.000016103553,0.0000623538,0.00015949622,0.9538427,0.004528257,0.037234314,0.0034547716,0.000009485914],"about_ca_topic_score_codex":0.006659556,"about_ca_topic_score_gemma":0.01219268,"teacher_disagreement_score":0.006659556,"about_ca_system_score_codex":0.0015576977,"about_ca_system_score_gemma":0.0017229051,"threshold_uncertainty_score":0.016418695},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16025329,0.0013263997,0.67429435,0.00070074265,0.00022201124,0.00065569876,0.002019888,0.14870286,0.0118247615],"genre_scores_gemma":[0.45027322,0.00047130717,0.53403234,0.0003476655,0.000091445,0.00025647925,0.005056041,0.004598227,0.004873315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880433,0.0002936354,0.000064922795,0.00025546277,0.00044357587,0.00013820732],"domain_scores_gemma":[0.99606687,0.0012481328,0.00021663155,0.0018856608,0.00038933224,0.0001933747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014216948,0.0013071185,0.00084722176,0.00128349,0.00085103104,0.0015022369,0.0031049629,0.0007546573,0.0032864395],"category_scores_gemma":[0.0057904273,0.0006189782,0.001001679,0.0014879693,0.0008986771,0.003459591,0.0028887417,0.0009066815,0.001661609],"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.002215709,0.0007030598,0.006097755,0.0009581133,0.00027905192,0.0005196759,0.0011321434,0.24885133,0.10563132,0.015683308,0.07224961,0.545679],"study_design_scores_gemma":[0.00029019156,0.00052260194,0.0024334267,0.000031550426,0.000065814645,0.0005055854,0.00040409548,0.9222855,0.04014053,0.012280303,0.020971293,0.00006902803],"about_ca_topic_score_codex":0.0066344882,"about_ca_topic_score_gemma":0.009993817,"teacher_disagreement_score":0.0066344882,"about_ca_system_score_codex":0.0009187161,"about_ca_system_score_gemma":0.0010310138,"threshold_uncertainty_score":0.0131917},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10153096,0.00053681683,0.8921758,0.00091771677,0.00006582067,0.00010848021,0.0005515893,0.00060300966,0.003509815],"genre_scores_gemma":[0.62924635,0.00056777254,0.3638023,0.00021126514,0.0001008004,0.00018686298,0.0020053217,0.0002410649,0.0036382102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788505,0.0007177388,0.000097216944,0.0006624905,0.0004144283,0.00022304172],"domain_scores_gemma":[0.99272037,0.0052067623,0.0003779688,0.0009904162,0.00048787898,0.00021657046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016100378,0.0010084142,0.0022888593,0.002745193,0.0009895528,0.002345163,0.0034221315,0.0025785717,0.0045405715],"category_scores_gemma":[0.015842937,0.0007832104,0.0013571338,0.004723713,0.001303276,0.0081636775,0.0028362805,0.0020646732,0.00060681754],"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.00047965118,0.00048864336,0.0030974734,0.0005256518,0.0002335071,0.00022268103,0.0002898376,0.71332836,0.0026634037,0.07255467,0.0077142636,0.19840193],"study_design_scores_gemma":[0.000029235476,0.000036378657,0.00028534813,0.000015738331,0.000032416043,0.000051607993,0.00009449981,0.877618,0.0006683432,0.12036874,0.00079203834,0.000007645529],"about_ca_topic_score_codex":0.0074946424,"about_ca_topic_score_gemma":0.0080754105,"teacher_disagreement_score":0.0074946424,"about_ca_system_score_codex":0.00191151,"about_ca_system_score_gemma":0.0016721077,"threshold_uncertainty_score":0.015189707},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06927115,0.0012145557,0.9159271,0.0015438634,0.00020933728,0.00019213973,0.0007123345,0.001626425,0.009303055],"genre_scores_gemma":[0.36803263,0.0007836243,0.6218795,0.00032844723,0.00023663089,0.00031869917,0.0018352452,0.00041638836,0.0061687636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987056,0.00039222054,0.0000676702,0.00023008099,0.00034679522,0.00025765144],"domain_scores_gemma":[0.99614954,0.0021895817,0.00022724779,0.00084193586,0.00036088514,0.00023079803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016304634,0.0011658724,0.0018789566,0.0014801528,0.0015067784,0.0022628468,0.003672706,0.002462802,0.006967018],"category_scores_gemma":[0.008753208,0.00084756094,0.00129085,0.003528634,0.000913408,0.004774257,0.0032396596,0.0026008661,0.0014586083],"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.0010111289,0.00037204343,0.0022069633,0.0005593703,0.00013827422,0.00013836735,0.0004104583,0.68635184,0.0038211318,0.097288765,0.024856644,0.1828449],"study_design_scores_gemma":[0.00004687402,0.000036494876,0.00013260994,0.000012493535,0.000012852856,0.000043528442,0.000050937586,0.9457624,0.00054948893,0.05198561,0.0013610127,0.0000058027467],"about_ca_topic_score_codex":0.004789002,"about_ca_topic_score_gemma":0.007471689,"teacher_disagreement_score":0.006967018,"about_ca_system_score_codex":0.0023154214,"about_ca_system_score_gemma":0.0016482224,"threshold_uncertainty_score":0.023306966},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040610544,0.0026952012,0.9518611,0.0003795212,0.00030129612,0.00009021325,0.00006478617,0.0010461671,0.0029511682],"genre_scores_gemma":[0.62655586,0.0034665111,0.3627877,0.0002450244,0.0004950401,0.0002841139,0.00040840518,0.00044725148,0.005310065],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982185,0.0006397757,0.00009357721,0.00022034091,0.0006886954,0.00013908328],"domain_scores_gemma":[0.994041,0.0031499427,0.00023938536,0.00048101853,0.001922372,0.00016618657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023388104,0.0008562824,0.0007326552,0.0015780823,0.0005044451,0.0009037554,0.0007507825,0.0005769012,0.0028203242],"category_scores_gemma":[0.016185923,0.00021342104,0.0006271534,0.0012059192,0.0007721161,0.002528753,0.00078435533,0.0012348607,0.0010437235],"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.00073714694,0.00022859366,0.011667509,0.0007209814,0.00016240122,0.000578447,0.0005594089,0.33282635,0.03009705,0.09252418,0.013347373,0.5165506],"study_design_scores_gemma":[0.000017293201,0.00008487459,0.00091472355,0.000024812412,0.000019451856,0.00014184367,0.000042629097,0.97827405,0.005781821,0.012089395,0.0025872358,0.00002178303],"about_ca_topic_score_codex":0.0027857954,"about_ca_topic_score_gemma":0.0015760507,"teacher_disagreement_score":0.0028203242,"about_ca_system_score_codex":0.0005767533,"about_ca_system_score_gemma":0.0009655309,"threshold_uncertainty_score":0.012368977},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005566469,0.00018907918,0.9881108,0.00036415632,0.000057366728,0.00006911253,0.00021318716,0.0007081485,0.0047217035],"genre_scores_gemma":[0.16861187,0.0007135748,0.8221218,0.0002692586,0.00009045564,0.00048115433,0.0010414126,0.0004434373,0.0062270006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993581,0.00024916595,0.000027819904,0.00010103881,0.00021348159,0.00005033265],"domain_scores_gemma":[0.9980489,0.0010372247,0.0001571673,0.00045184718,0.0002381165,0.00006674153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083859934,0.00087597425,0.00058679,0.001015166,0.0006332434,0.0014495648,0.0018012878,0.0011835857,0.008437816],"category_scores_gemma":[0.0065811495,0.00047026688,0.00090503466,0.0014950417,0.0009886506,0.0029797717,0.0015355087,0.0020272397,0.0025148834],"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.00007203983,0.00010225108,0.0006840152,0.00021172037,0.000040036593,0.00017717943,0.00017819396,0.38624287,0.002886127,0.4908298,0.012640913,0.10593493],"study_design_scores_gemma":[0.00001877246,0.00002625655,0.00010115473,0.000015483478,0.000007989519,0.00006623118,0.00004128211,0.7255789,0.00075423147,0.2671816,0.006197256,0.000010815788],"about_ca_topic_score_codex":0.003681124,"about_ca_topic_score_gemma":0.006498415,"teacher_disagreement_score":0.008437816,"about_ca_system_score_codex":0.0008750111,"about_ca_system_score_gemma":0.0011718326,"threshold_uncertainty_score":0.02822727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5368143,0.00048088495,0.16923869,0.0037263585,0.0011903174,0.00019760808,0.0007152588,0.0019038478,0.28573266],"genre_scores_gemma":[0.94867647,0.00026061828,0.01015709,0.0004353417,0.00031122335,0.00010061001,0.0002633378,0.00033434798,0.03946095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939406,0.00012578748,0.000015089295,0.00011615482,0.00021691617,0.00013187835],"domain_scores_gemma":[0.9991455,0.00017844234,0.00016434613,0.00021826502,0.00013560297,0.00015788608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035184607,0.00038383936,0.00034177775,0.0015722257,0.0010834953,0.0016638832,0.0005409084,0.0011584647,0.016999017],"category_scores_gemma":[0.0024043748,0.00022705593,0.00051114365,0.0006492173,0.0016237948,0.0019421608,0.0012121241,0.0011444057,0.003022623],"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.00010522964,0.00007545568,0.00042171575,0.000036811598,0.000014468849,0.00028501017,0.00027383558,0.0024969287,0.007987834,0.96562976,0.00782424,0.014848734],"study_design_scores_gemma":[0.00003986137,0.000036289348,0.0008764929,0.000012394431,0.0000088383995,0.00044421334,0.00022427936,0.014963977,0.003000477,0.975827,0.0045471895,0.00001899828],"about_ca_topic_score_codex":0.0006313346,"about_ca_topic_score_gemma":0.0006059567,"teacher_disagreement_score":0.016999017,"about_ca_system_score_codex":0.00061463244,"about_ca_system_score_gemma":0.00044943494,"threshold_uncertainty_score":0.05686736},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07011542,0.004153946,0.8048536,0.0081059765,0.00071195984,0.0010391593,0.005785078,0.03720345,0.06803143],"genre_scores_gemma":[0.44813004,0.000993775,0.5165547,0.0012585194,0.0003475491,0.0011940275,0.0075942017,0.0018257508,0.022101492],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957235,0.0008487286,0.00022851946,0.0013162099,0.0010144529,0.00086862233],"domain_scores_gemma":[0.9891587,0.0062626093,0.000508053,0.0028346626,0.00067574094,0.00056007504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017148971,0.0027452882,0.0022167757,0.001714631,0.0018528317,0.00358567,0.0068773166,0.0026566908,0.039795406],"category_scores_gemma":[0.010383251,0.000846479,0.002157539,0.0037077353,0.0022259578,0.009312718,0.0046222857,0.0043908833,0.00894795],"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.0045216875,0.0020088397,0.0038197266,0.003040427,0.0005731989,0.00043387606,0.0008289389,0.1026241,0.029916717,0.10122806,0.1309864,0.620018],"study_design_scores_gemma":[0.0019999456,0.0005960087,0.0027226429,0.00020124918,0.000581736,0.00096132373,0.00060927164,0.63982093,0.017195411,0.30258378,0.03255875,0.00016888297],"about_ca_topic_score_codex":0.008568107,"about_ca_topic_score_gemma":0.022533549,"teacher_disagreement_score":0.039795406,"about_ca_system_score_codex":0.0058699446,"about_ca_system_score_gemma":0.0076945033,"threshold_uncertainty_score":0.13312888},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06808162,0.00068438944,0.81323004,0.0041276794,0.00077106676,0.00046843378,0.0015936162,0.004012112,0.10703104],"genre_scores_gemma":[0.29166266,0.0011134697,0.6453713,0.0015142877,0.00030032505,0.0005640592,0.0043697455,0.002517032,0.052587148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998116,0.0006912213,0.00010616359,0.0004253008,0.00037506185,0.00028636],"domain_scores_gemma":[0.9910699,0.0029824858,0.00039869137,0.0039925845,0.00094188214,0.0006144769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022397044,0.00092221494,0.0007488785,0.002455642,0.003439351,0.0026948457,0.0022395423,0.0019501899,0.017163094],"category_scores_gemma":[0.01240669,0.0007365254,0.0012887482,0.0029097854,0.0030886272,0.010903208,0.0051382873,0.0027745492,0.00849162],"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.00026411036,0.00027375767,0.0013696307,0.00030726878,0.000035469082,0.00026352162,0.0012000884,0.005728409,0.005490521,0.83335,0.025550548,0.12616663],"study_design_scores_gemma":[0.000032205127,0.000055862616,0.00039603215,0.000083924846,0.000046279503,0.00025821943,0.00046762158,0.012586945,0.0034541897,0.95588696,0.02669557,0.000036203393],"about_ca_topic_score_codex":0.0016876454,"about_ca_topic_score_gemma":0.0034133645,"teacher_disagreement_score":0.017163094,"about_ca_system_score_codex":0.0010798414,"about_ca_system_score_gemma":0.0015493901,"threshold_uncertainty_score":0.05741626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026176766,0.00006904764,0.9638348,0.00022566254,0.000057494333,0.000088415574,0.000046091405,0.0050975378,0.004404186],"genre_scores_gemma":[0.46283543,0.00022332623,0.52809376,0.00035462662,0.00010911416,0.00026762727,0.00038322934,0.0013734824,0.0063594696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979735,0.0005885884,0.00017346253,0.00041666557,0.00060705334,0.0002407113],"domain_scores_gemma":[0.9917938,0.002306395,0.0006360947,0.004169469,0.00085908663,0.00023519507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024878737,0.0006798575,0.00056169095,0.000805271,0.0010610876,0.0015775304,0.0016798363,0.0007446794,0.004414514],"category_scores_gemma":[0.009444182,0.00063842244,0.0005616658,0.0007741208,0.0017015524,0.0040426403,0.003322736,0.0018785264,0.0012779343],"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.0010406057,0.00050572446,0.0051105283,0.0005733548,0.00017045045,0.0006883814,0.0022098366,0.14065656,0.13974859,0.43325058,0.014750095,0.26129523],"study_design_scores_gemma":[0.00023960792,0.00042521834,0.0012006841,0.00008393673,0.0001267055,0.0005299435,0.00042365713,0.52008575,0.14065126,0.29542634,0.04073054,0.00007647316],"about_ca_topic_score_codex":0.0010362762,"about_ca_topic_score_gemma":0.0023481224,"teacher_disagreement_score":0.004414514,"about_ca_system_score_codex":0.0007137106,"about_ca_system_score_gemma":0.0013420051,"threshold_uncertainty_score":0.014768064},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033454879,0.00014764213,0.9948061,0.00017050354,0.000027886548,0.000031858828,0.000077768185,0.00038907796,0.0010036466],"genre_scores_gemma":[0.23283641,0.0005113242,0.7560498,0.000535396,0.0002000252,0.00025955288,0.0013568597,0.00059749786,0.007653055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974612,0.0008668737,0.00010944471,0.0007070478,0.00068452733,0.00017092047],"domain_scores_gemma":[0.9967002,0.0016373034,0.0003880447,0.0006796953,0.0004586591,0.00013603385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00226517,0.0014764407,0.0022996673,0.0019425192,0.00089449843,0.0020687662,0.00236299,0.0027057016,0.0038849893],"category_scores_gemma":[0.009351343,0.0008108087,0.0015265492,0.003007508,0.0013995962,0.0032499027,0.0019640247,0.002795598,0.0016547621],"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.00014157359,0.00015722534,0.0007880201,0.00028582563,0.0001269681,0.00022750594,0.00010389849,0.7509796,0.005321574,0.055660997,0.01371442,0.17249244],"study_design_scores_gemma":[0.000008947525,0.000012959571,0.000068010355,0.000005084924,0.000006043284,0.00004057689,0.000010130329,0.9807747,0.0006765324,0.017346678,0.0010428214,0.0000075694225],"about_ca_topic_score_codex":0.0051833824,"about_ca_topic_score_gemma":0.00561188,"teacher_disagreement_score":0.0051833824,"about_ca_system_score_codex":0.0012242122,"about_ca_system_score_gemma":0.0019684264,"threshold_uncertainty_score":0.012996614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6800164,0.0018031687,0.17724375,0.0011141476,0.00017381029,0.00011737397,0.0014453728,0.0005286462,0.13755727],"genre_scores_gemma":[0.9336815,0.0009919786,0.04246486,0.00025177057,0.00011251472,0.00009148071,0.0019447799,0.00018477919,0.02027642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892515,0.00031555726,0.000059841746,0.00026323288,0.00028482353,0.00015135435],"domain_scores_gemma":[0.99453765,0.003089699,0.0005855772,0.0006709403,0.00070859137,0.0004075197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006284746,0.00040090733,0.0004826008,0.0019093488,0.0015089659,0.0019450763,0.0007075604,0.00056909095,0.0094574625],"category_scores_gemma":[0.005122458,0.00056738325,0.0004645185,0.0021704682,0.0018637807,0.0037713174,0.0024840247,0.0013532548,0.00089951756],"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.00018081063,0.00006192492,0.004060735,0.00022608077,0.000036004898,0.0004899632,0.0014703145,0.002350831,0.0032879096,0.9386544,0.005129203,0.04405184],"study_design_scores_gemma":[0.00002658151,0.00006087331,0.004053384,0.000078324425,0.00008072829,0.0013540793,0.0008717812,0.009442902,0.0038695056,0.9572262,0.02291033,0.000025347617],"about_ca_topic_score_codex":0.0019950867,"about_ca_topic_score_gemma":0.0027435394,"teacher_disagreement_score":0.0094574625,"about_ca_system_score_codex":0.00054269604,"about_ca_system_score_gemma":0.0004071925,"threshold_uncertainty_score":0.031638384},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041710217,0.0000834486,0.9562368,0.000084802254,0.00001947164,0.00009576767,0.000036625283,0.00072035735,0.0010125868],"genre_scores_gemma":[0.4570547,0.00008315545,0.5414798,0.00007044333,0.000027909935,0.0002680156,0.00023686276,0.00014039653,0.0006386899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872726,0.0006304455,0.0000644185,0.00017353793,0.0002904961,0.00011386476],"domain_scores_gemma":[0.9965623,0.0021011464,0.00014291356,0.0006581935,0.00042698428,0.0001085087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017716823,0.0005122862,0.0006177,0.00066899625,0.00065671635,0.00062008004,0.0010199434,0.00043879618,0.0015232204],"category_scores_gemma":[0.009119034,0.00029546683,0.0004806714,0.0008344678,0.0005628298,0.0010180372,0.00091079297,0.00077151565,0.0004448394],"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.0006727441,0.00025160162,0.0054738172,0.00019217946,0.000082327184,0.0002012928,0.00046699165,0.5646757,0.033264287,0.05940676,0.0028927606,0.33241957],"study_design_scores_gemma":[0.000017498514,0.00004267774,0.0002518802,0.0000033639722,0.000005698625,0.000020908035,0.000019536126,0.98398525,0.0030017379,0.012057106,0.0005903987,0.000003966893],"about_ca_topic_score_codex":0.0033263334,"about_ca_topic_score_gemma":0.004100786,"teacher_disagreement_score":0.0033263334,"about_ca_system_score_codex":0.00075425976,"about_ca_system_score_gemma":0.001630666,"threshold_uncertainty_score":0.009369671},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043116817,0.0020950208,0.97725165,0.0023461631,0.00025205486,0.00015435791,0.00023736399,0.0014792811,0.011872287],"genre_scores_gemma":[0.12803496,0.004618343,0.8501205,0.0008059451,0.0008616507,0.0006124691,0.0009994971,0.000575342,0.013371306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974153,0.0006184047,0.0001708106,0.00068903435,0.00091912085,0.00018730556],"domain_scores_gemma":[0.9959407,0.0017050287,0.00025173166,0.0014175634,0.000539438,0.00014554155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025189295,0.0010034502,0.0009466787,0.0037538763,0.0019643828,0.004298596,0.0025304686,0.0015811168,0.010238947],"category_scores_gemma":[0.009226503,0.0010428384,0.002101394,0.0034111736,0.0036373965,0.010805454,0.005482131,0.0042506857,0.0038699056],"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.000017090579,0.000024037488,0.00033198274,0.00020952788,0.000039735347,0.00010188491,0.00036832463,0.009211028,0.0015546035,0.93798333,0.006919586,0.04323888],"study_design_scores_gemma":[0.000012963524,0.000014699812,0.00019991411,0.00005913108,0.00002158541,0.00015692365,0.00012903044,0.07191717,0.001098488,0.8801396,0.046229873,0.00002056148],"about_ca_topic_score_codex":0.0032315212,"about_ca_topic_score_gemma":0.0039415257,"teacher_disagreement_score":0.010238947,"about_ca_system_score_codex":0.0024492934,"about_ca_system_score_gemma":0.0017979771,"threshold_uncertainty_score":0.034252703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056326877,0.0005030674,0.9402838,0.00027317938,0.00007796682,0.00010959406,0.00022321525,0.0011256802,0.0010768048],"genre_scores_gemma":[0.72047424,0.0004593261,0.27693674,0.00006198981,0.000052287243,0.000120071745,0.00040132215,0.00007725984,0.0014167555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938834,0.00014752796,0.000053790613,0.00015340597,0.00017886909,0.00007804329],"domain_scores_gemma":[0.99781966,0.00073421304,0.00025167104,0.00065986416,0.00027378544,0.000260761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007415129,0.00083392614,0.0010925969,0.00089298736,0.00077127304,0.001342305,0.0015354413,0.0009502636,0.0021570974],"category_scores_gemma":[0.004608218,0.0005256648,0.00055982085,0.0016088937,0.0008088247,0.0021483297,0.0027916075,0.0008624036,0.0004794046],"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.00046041142,0.00008371133,0.003456249,0.00026404028,0.00005625132,0.0002927416,0.0004108552,0.8028024,0.015152271,0.020715598,0.0034775645,0.15282793],"study_design_scores_gemma":[0.000017284694,0.000050620216,0.00022724713,0.000010620637,0.000007701753,0.000057436144,0.00010182718,0.9896103,0.0034572918,0.004998832,0.0014465696,0.000014218436],"about_ca_topic_score_codex":0.002370449,"about_ca_topic_score_gemma":0.0028092568,"teacher_disagreement_score":0.002370449,"about_ca_system_score_codex":0.0007906913,"about_ca_system_score_gemma":0.0009926084,"threshold_uncertainty_score":0.007216215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004883967,0.020703757,0.0593797,0.0029214509,0.0021114075,0.000046332392,0.0004337424,0.0006598253,0.90885985],"genre_scores_gemma":[0.16658328,0.05137156,0.08018365,0.0022790774,0.0054138056,0.00027767877,0.002434092,0.0009503531,0.69050646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977905,0.000049786147,0.0000074094914,0.00004290872,0.000102451624,0.00001838218],"domain_scores_gemma":[0.9998542,0.000040838022,0.00001012064,0.00003649048,0.00003822602,0.000020049763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021931759,0.0010467258,0.000550486,0.0021121246,0.00070240296,0.0030568196,0.00079766696,0.00071381236,0.020811534],"category_scores_gemma":[0.00077323645,0.0003974015,0.00037911738,0.002470903,0.0019065349,0.0027300501,0.0011641335,0.0027002553,0.006893492],"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.000002449346,0.0000062509857,0.000022401146,0.00004205458,0.0000027201497,0.000008867834,0.000117211086,0.0005094261,0.00024251104,0.9305461,0.0334284,0.03507155],"study_design_scores_gemma":[0.000002710407,0.000004784999,0.00009532807,0.000033729775,0.000002803101,0.000051231113,0.000048057642,0.00090178096,0.00010622442,0.78433895,0.21441028,0.0000040800364],"about_ca_topic_score_codex":0.0011452312,"about_ca_topic_score_gemma":0.0012915068,"teacher_disagreement_score":0.020811534,"about_ca_system_score_codex":0.0012976656,"about_ca_system_score_gemma":0.0005959507,"threshold_uncertainty_score":0.0696215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023610054,0.0009008352,0.9573393,0.004353843,0.00063210056,0.000547032,0.0009173061,0.0031403399,0.008559219],"genre_scores_gemma":[0.622365,0.0012485402,0.36009663,0.0007520865,0.00077862083,0.00093549874,0.0036707032,0.000568355,0.009584514],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959357,0.0013389315,0.000265061,0.0007077177,0.0014541798,0.00029844817],"domain_scores_gemma":[0.9923201,0.002109771,0.00068766315,0.0028436368,0.0013519496,0.00068683014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045561027,0.00086839666,0.00091153657,0.0018990184,0.0024443262,0.0046438645,0.0033371323,0.0011406395,0.0022860614],"category_scores_gemma":[0.013818563,0.00046118186,0.0009162176,0.0025188292,0.0012532395,0.006142786,0.0049545025,0.0015437624,0.0008890151],"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.0005842303,0.00051248376,0.008399664,0.00056863,0.00036970177,0.001114592,0.0018445237,0.18500486,0.010554768,0.30128214,0.076918,0.41284636],"study_design_scores_gemma":[0.00006685309,0.00006012691,0.0011472118,0.000046706642,0.000060199203,0.00016704087,0.0006877736,0.7207212,0.0032972512,0.23161528,0.04208524,0.000045010005],"about_ca_topic_score_codex":0.004517197,"about_ca_topic_score_gemma":0.006473679,"teacher_disagreement_score":0.0046438645,"about_ca_system_score_codex":0.0018390835,"about_ca_system_score_gemma":0.0023004177,"threshold_uncertainty_score":0.024095297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6028116,0.017956056,0.09476215,0.0052886303,0.0067513036,0.003195497,0.032947846,0.17758536,0.05870163],"genre_scores_gemma":[0.6453135,0.0030934303,0.25803187,0.0020315526,0.000692545,0.0016300852,0.073057055,0.007381548,0.008768339],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98691946,0.0049107387,0.00087841897,0.0027652807,0.003641131,0.00088504935],"domain_scores_gemma":[0.9710159,0.012849805,0.00078852684,0.008165668,0.005845721,0.0013344804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008661124,0.0032337322,0.0021580092,0.0046543344,0.0026351407,0.0030118893,0.0053339433,0.0030187832,0.006343987],"category_scores_gemma":[0.03823629,0.00092410774,0.0013382253,0.006212516,0.0019356654,0.0072699697,0.0029847582,0.003126581,0.005097327],"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.009867022,0.0042497707,0.018826963,0.0064794472,0.0019918769,0.00040683275,0.0009071249,0.15097435,0.013939978,0.019749487,0.37257245,0.40003476],"study_design_scores_gemma":[0.0027058374,0.00573302,0.020282283,0.00046222645,0.0006121812,0.0014145916,0.0016993392,0.78777605,0.03727292,0.031818558,0.10984533,0.00037771254],"about_ca_topic_score_codex":0.01023901,"about_ca_topic_score_gemma":0.012000536,"teacher_disagreement_score":0.01023901,"about_ca_system_score_codex":0.0025234781,"about_ca_system_score_gemma":0.0026402876,"threshold_uncertainty_score":0.045804918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019050911,0.00022301964,0.9743696,0.00021024632,0.000055068198,0.000138612,0.000428807,0.003456064,0.0020675682],"genre_scores_gemma":[0.16654582,0.00016436717,0.827009,0.000115140305,0.000027374628,0.00020866285,0.0023566324,0.00053483265,0.0030380944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956506,0.00005927684,0.00003045981,0.00012372664,0.00016589584,0.000055578585],"domain_scores_gemma":[0.9995283,0.00008106964,0.00003707736,0.00012877326,0.00019190837,0.00003285893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046148864,0.0007766914,0.0005939847,0.0013052436,0.0008788882,0.0009752227,0.0017013452,0.0006308645,0.003659551],"category_scores_gemma":[0.0013647901,0.00033266167,0.00059943245,0.0016609479,0.00042341568,0.0018387072,0.001495216,0.00071938935,0.00135582],"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.000406195,0.0001437107,0.0011815714,0.00019572485,0.00007573831,0.00016096294,0.00020560906,0.365784,0.033075865,0.025343413,0.02596048,0.5474667],"study_design_scores_gemma":[0.00003402364,0.000020173764,0.0001783468,0.000008096627,0.000007093661,0.00004766992,0.0000498548,0.97751266,0.007260294,0.009962995,0.00490829,0.0000104479905],"about_ca_topic_score_codex":0.009780832,"about_ca_topic_score_gemma":0.010408378,"teacher_disagreement_score":0.009780832,"about_ca_system_score_codex":0.0011072461,"about_ca_system_score_gemma":0.0013454433,"threshold_uncertainty_score":0.019447803},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02759448,0.002364954,0.8036624,0.0020975743,0.00083127583,0.0005609506,0.0023954844,0.14114268,0.019350205],"genre_scores_gemma":[0.102504216,0.000837309,0.873681,0.00056802394,0.00026625223,0.00052884495,0.006139139,0.0056496887,0.009825541],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99611735,0.0008983323,0.00018678622,0.0006981725,0.0017451491,0.00035430622],"domain_scores_gemma":[0.9877071,0.004532377,0.0004755701,0.0044189123,0.0023932,0.0004729714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023050471,0.0026038429,0.0016861189,0.0034073617,0.0020492403,0.0029446867,0.0037785838,0.0016866149,0.026442934],"category_scores_gemma":[0.021772811,0.0012509921,0.0017339473,0.0068551083,0.0011786366,0.009211599,0.0032771465,0.0034931705,0.01568382],"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.0011217761,0.00062194397,0.002384423,0.0011344597,0.00032197172,0.00039393798,0.0004838381,0.08658522,0.020141356,0.041115325,0.2185141,0.6271817],"study_design_scores_gemma":[0.0004426101,0.00037436996,0.001211557,0.00006745108,0.00011802986,0.00036913503,0.0003815987,0.79309934,0.024030725,0.09242361,0.087377205,0.00010438064],"about_ca_topic_score_codex":0.014640647,"about_ca_topic_score_gemma":0.036405478,"teacher_disagreement_score":0.026442934,"about_ca_system_score_codex":0.002111581,"about_ca_system_score_gemma":0.0035824399,"threshold_uncertainty_score":0.088460445},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012795716,0.000613783,0.5075663,0.0011006758,0.00045696532,0.0008069861,0.03836018,0.43682733,0.012988218],"genre_scores_gemma":[0.024146568,0.0013600471,0.79174674,0.0008895231,0.00017075145,0.0034208037,0.11402893,0.050219756,0.014016896],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99763453,0.00040206392,0.00036376223,0.000323199,0.0010276004,0.00024870396],"domain_scores_gemma":[0.99579924,0.001562046,0.00023654973,0.0011660488,0.00067577633,0.00056021265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035242958,0.0023875886,0.0019264339,0.003555542,0.0010621621,0.0046633384,0.003926539,0.0011511534,0.044458397],"category_scores_gemma":[0.011657405,0.00226673,0.0025954577,0.0048752674,0.000848434,0.0061059743,0.0077327453,0.0057785227,0.03296868],"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.0010342846,0.00033367137,0.0029832842,0.0034190377,0.00059724087,0.0014059779,0.0012291117,0.01626198,0.00975916,0.09341429,0.66892636,0.20063555],"study_design_scores_gemma":[0.0005388454,0.00009677997,0.002739143,0.00079634436,0.000116095325,0.00072855974,0.00031977575,0.11711297,0.00784888,0.15039547,0.71908164,0.00022551192],"about_ca_topic_score_codex":0.0042548054,"about_ca_topic_score_gemma":0.0039286576,"teacher_disagreement_score":0.044458397,"about_ca_system_score_codex":0.0009756423,"about_ca_system_score_gemma":0.0033371593,"threshold_uncertainty_score":0.14872813},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045758422,0.00079796836,0.9344717,0.0004327848,0.00023253418,0.0005949469,0.0025306316,0.0057781455,0.009402782],"genre_scores_gemma":[0.21062057,0.00034043108,0.77375734,0.0001923588,0.00010173504,0.0004977113,0.0076936255,0.0010085206,0.005787665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991906,0.00014508689,0.000057828485,0.00030994433,0.00020424834,0.000092350274],"domain_scores_gemma":[0.99848336,0.00047431022,0.00011427039,0.00053362164,0.00027920806,0.000115202325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052303757,0.0011725627,0.0009623652,0.0012971931,0.0009190987,0.0016653808,0.0015768786,0.0008070055,0.006091124],"category_scores_gemma":[0.003081652,0.00040632876,0.0010625558,0.0016155035,0.00040219547,0.0020327265,0.0014273613,0.0008396279,0.002087108],"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.0008727828,0.00038986816,0.0037473128,0.00089170755,0.00021688278,0.00046817918,0.00054303004,0.20723583,0.041727245,0.033079896,0.04592704,0.66490024],"study_design_scores_gemma":[0.00010530581,0.00021131146,0.0017111332,0.000044290835,0.000049760307,0.000479766,0.000457873,0.9127394,0.018426485,0.03653795,0.029205969,0.000030800027],"about_ca_topic_score_codex":0.003295876,"about_ca_topic_score_gemma":0.007362804,"teacher_disagreement_score":0.006091124,"about_ca_system_score_codex":0.000822118,"about_ca_system_score_gemma":0.0013007263,"threshold_uncertainty_score":0.020376801},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07148866,0.00022601562,0.9196251,0.0022957178,0.00013448599,0.00019407397,0.00026285715,0.0015223362,0.004250713],"genre_scores_gemma":[0.5174899,0.00029117355,0.47513068,0.00045285898,0.00013155227,0.0001697117,0.0007677245,0.0006378538,0.004928509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977581,0.00070733513,0.00008053426,0.00072070025,0.0004371093,0.00029625188],"domain_scores_gemma":[0.9904281,0.00615716,0.00049506,0.001661326,0.0006788797,0.00057946314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025670058,0.00082623557,0.00087568886,0.00085432606,0.001894596,0.0031166761,0.0020554878,0.0021555054,0.004406976],"category_scores_gemma":[0.014567743,0.00071484776,0.0013060401,0.0013261542,0.0024647755,0.006018579,0.0029342864,0.0028098046,0.0005702263],"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.00035840948,0.00024792037,0.003874695,0.00035561193,0.00009807494,0.0004750373,0.00080563035,0.71458167,0.010618137,0.17761843,0.012648034,0.07831829],"study_design_scores_gemma":[0.000033885994,0.00003631618,0.0004901397,0.000011669193,0.000015104198,0.00012422662,0.00017876491,0.811642,0.0028972167,0.17977585,0.0047766278,0.000018142866],"about_ca_topic_score_codex":0.006541527,"about_ca_topic_score_gemma":0.0069535677,"teacher_disagreement_score":0.006541527,"about_ca_system_score_codex":0.0021403295,"about_ca_system_score_gemma":0.0017377539,"threshold_uncertainty_score":0.015529215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005546397,0.000038912265,0.99165654,0.00005956964,0.000010454991,0.000030215038,0.000052103744,0.0021662472,0.0004396325],"genre_scores_gemma":[0.09928077,0.00012256153,0.8970644,0.00015242181,0.000031404325,0.000074115895,0.0008146769,0.00069001544,0.0017697014],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989643,0.00022836441,0.00003876843,0.00031090897,0.00033264048,0.00012504139],"domain_scores_gemma":[0.9988617,0.00033232346,0.00014370236,0.00039318597,0.00021546498,0.000053629738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009026255,0.0017805218,0.0015809053,0.0026734294,0.0009566666,0.0014709249,0.0023593013,0.0019606058,0.003046873],"category_scores_gemma":[0.0028079427,0.0008177415,0.0018807298,0.0023554224,0.001055493,0.0033083227,0.0018345892,0.0018643492,0.0025514367],"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.00014236962,0.00024848746,0.0009067139,0.00017558152,0.00008456707,0.0001734168,0.00019778189,0.3288662,0.05131929,0.022140754,0.007696598,0.5880482],"study_design_scores_gemma":[0.000008684215,0.000028393259,0.00022000796,0.0000034836733,0.000011194438,0.000060937702,0.000026810942,0.97602457,0.00963478,0.01257049,0.0013935259,0.00001713596],"about_ca_topic_score_codex":0.0057518743,"about_ca_topic_score_gemma":0.008886008,"teacher_disagreement_score":0.0057518743,"about_ca_system_score_codex":0.0010524893,"about_ca_system_score_gemma":0.0017236712,"threshold_uncertainty_score":0.01143682},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.276331,0.009136705,0.3063657,0.012323276,0.0018969681,0.000052228148,0.00088456,0.00037428204,0.3926352],"genre_scores_gemma":[0.9067537,0.0025786688,0.026497941,0.0017966669,0.00084278104,0.00012045629,0.00054361153,0.00047727444,0.060388856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933064,0.00020443657,0.000023617993,0.000117348456,0.00019463748,0.00012940711],"domain_scores_gemma":[0.9972422,0.0016512335,0.00016993872,0.00036301752,0.00030006055,0.0002735649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008744947,0.00048704914,0.0009047739,0.0019578778,0.0017602703,0.0022189894,0.0021052072,0.0023753028,0.022909524],"category_scores_gemma":[0.007401494,0.00037222868,0.00054561405,0.0014813732,0.0023862387,0.007176528,0.0026572188,0.0030472511,0.0025290223],"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.00002078659,0.000012816484,0.00023856034,0.000040962517,0.000005987062,0.000040254792,0.00008637875,0.0015004388,0.00034494838,0.9888548,0.0032134473,0.0056405663],"study_design_scores_gemma":[0.0000038897656,0.0000068806607,0.00017994356,0.000019946781,0.0000038140647,0.00007399122,0.0000693473,0.009205337,0.00017722779,0.9872242,0.0030305288,0.0000048514103],"about_ca_topic_score_codex":0.0006166538,"about_ca_topic_score_gemma":0.0008855146,"teacher_disagreement_score":0.022909524,"about_ca_system_score_codex":0.0011526429,"about_ca_system_score_gemma":0.00033933463,"threshold_uncertainty_score":0.07664001},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081245184,0.009492568,0.71099716,0.0071600857,0.0017195385,0.00021438352,0.0025176655,0.0014224526,0.18523106],"genre_scores_gemma":[0.72973895,0.008881212,0.18016396,0.0032201072,0.0036815272,0.00043579016,0.0028515428,0.0011884047,0.06983855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990409,0.00022834033,0.00006145655,0.00030684148,0.00024707496,0.00011534385],"domain_scores_gemma":[0.9959015,0.0016295612,0.00048674885,0.0007012122,0.0006681034,0.000612838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007123506,0.0010869405,0.00091946346,0.005855787,0.0021177742,0.004083479,0.0019468999,0.0017729222,0.010843005],"category_scores_gemma":[0.007096764,0.00051580893,0.00077646424,0.005675505,0.0030348487,0.009687168,0.0033137752,0.003961241,0.003542714],"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.000045217967,0.000045881276,0.00091580756,0.00014297162,0.000013149995,0.0001310467,0.00026483447,0.0020413208,0.0023362525,0.94674206,0.016113348,0.03120803],"study_design_scores_gemma":[0.000011512222,0.000039528026,0.0011645582,0.00008820286,0.000026770702,0.0009696307,0.00040153085,0.023857955,0.0015709418,0.905688,0.066147216,0.00003418126],"about_ca_topic_score_codex":0.0015506727,"about_ca_topic_score_gemma":0.0011602731,"teacher_disagreement_score":0.010843005,"about_ca_system_score_codex":0.0016613187,"about_ca_system_score_gemma":0.00053777825,"threshold_uncertainty_score":0.03627348},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065225963,0.046002906,0.0040396615,0.13274713,0.36067042,0.0014033446,0.026369981,0.0030539643,0.41918996],"genre_scores_gemma":[0.014199436,0.012671767,0.0016937003,0.014712354,0.04835723,0.0008740867,0.0145856,0.0015412378,0.8913645],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99589765,0.0003494434,0.00019044605,0.00042722683,0.0025433595,0.00059192063],"domain_scores_gemma":[0.99350935,0.00027869685,0.00043912648,0.00030347702,0.0029558316,0.0025134392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045677093,0.0014696101,0.0010749666,0.0016874984,0.002092006,0.005845096,0.001707218,0.0032619874,0.23095724],"category_scores_gemma":[0.00922299,0.0003670097,0.00081024645,0.0011553641,0.00073939963,0.00518894,0.008059597,0.003253312,0.19602472],"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.000051451763,0.000018427123,0.00013267882,0.00008459646,0.0000034976854,0.000059036112,0.000036241734,0.000043058528,0.00021660699,0.0009151666,0.9867343,0.011704869],"study_design_scores_gemma":[0.000006348605,0.000034192624,0.00043115913,0.000060553484,0.0000023789612,0.000039410606,0.00004013142,0.000029444447,0.00019810692,0.00020813069,0.9989441,0.0000060240864],"about_ca_topic_score_codex":0.0016894492,"about_ca_topic_score_gemma":0.0019891341,"teacher_disagreement_score":0.23095724,"about_ca_system_score_codex":0.0014113958,"about_ca_system_score_gemma":0.0034268931,"threshold_uncertainty_score":0.7726289},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039706282,0.004886181,0.53007394,0.24549562,0.003666716,0.00020822855,0.0007331113,0.0017982662,0.17343162],"genre_scores_gemma":[0.7324427,0.0037644508,0.22132428,0.00744117,0.003928567,0.00024055933,0.0007201212,0.0006699694,0.029468242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946062,0.0033418005,0.00023874106,0.0006742313,0.0008298757,0.0003092074],"domain_scores_gemma":[0.95156026,0.035308175,0.0015634586,0.0074195475,0.003465821,0.0006827523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011233872,0.0007177852,0.0011407677,0.0017709362,0.0036482064,0.007786543,0.0033216544,0.003927671,0.015005865],"category_scores_gemma":[0.048952647,0.0007644534,0.0017214344,0.0022428264,0.018722657,0.031533614,0.0029990487,0.007114904,0.004251679],"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.000020367703,0.000030103121,0.00025117092,0.00008480718,0.000018375154,0.000023392431,0.0003969446,0.0010775198,0.00005864341,0.9692457,0.009414483,0.019378547],"study_design_scores_gemma":[0.0000037672703,0.0000019442798,0.000029975907,0.00001665279,0.0000037007694,0.0000088119,0.00009464727,0.0011910461,0.00006264161,0.9952285,0.0033545662,0.0000038116993],"about_ca_topic_score_codex":0.002208352,"about_ca_topic_score_gemma":0.0017288662,"teacher_disagreement_score":0.015005865,"about_ca_system_score_codex":0.002430632,"about_ca_system_score_gemma":0.0029782322,"threshold_uncertainty_score":0.05941105},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107275106,0.0021677248,0.80883473,0.0025909871,0.0003435323,0.00024979925,0.0006702441,0.0016896157,0.07617819],"genre_scores_gemma":[0.7819553,0.0017352214,0.17727073,0.0007324896,0.00041464562,0.00028769264,0.00097000616,0.0005366568,0.036097318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842656,0.00046391148,0.000041588344,0.00036723976,0.00033641473,0.0003644653],"domain_scores_gemma":[0.9928941,0.00425768,0.0005115229,0.0011545722,0.000497326,0.00068468397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018044035,0.0012082187,0.001232486,0.0014690078,0.0017934922,0.002408795,0.0034622224,0.0018212169,0.013591347],"category_scores_gemma":[0.016164115,0.0006692608,0.0009494039,0.0015539563,0.0019501157,0.006452081,0.0033108378,0.0027957004,0.002325874],"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.00040310647,0.00028887045,0.0016774669,0.00031668716,0.0000910361,0.0001515655,0.00044904015,0.16778973,0.0038623044,0.7064401,0.030960066,0.087570086],"study_design_scores_gemma":[0.00005456384,0.000083624225,0.0005515595,0.000070651535,0.000044361608,0.0001637442,0.00015099834,0.4653029,0.002242917,0.5234369,0.007871916,0.000025832329],"about_ca_topic_score_codex":0.004693445,"about_ca_topic_score_gemma":0.004024976,"teacher_disagreement_score":0.013591347,"about_ca_system_score_codex":0.0026499096,"about_ca_system_score_gemma":0.0012293889,"threshold_uncertainty_score":0.045467615},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28175968,0.015542071,0.25391617,0.01706505,0.0030701775,0.0036940589,0.17770876,0.19986,0.04738398],"genre_scores_gemma":[0.28654912,0.0041531143,0.41526356,0.0019726155,0.00027904983,0.0014989258,0.27988756,0.0061679366,0.0042281016],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98774,0.0027105322,0.0017878051,0.0018095184,0.005079074,0.0008731612],"domain_scores_gemma":[0.97560966,0.0063291434,0.001245589,0.0068758307,0.008180672,0.0017591595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009638308,0.002542031,0.0016099066,0.0072384155,0.0024829037,0.0065293936,0.011824075,0.0029076696,0.0033345183],"category_scores_gemma":[0.037216887,0.0013295036,0.0015205004,0.018788561,0.0018580933,0.010999561,0.0045426,0.0030863392,0.002071219],"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.0022246935,0.0016983219,0.016302552,0.004033655,0.00066610205,0.0005101313,0.0008135554,0.11248363,0.011149425,0.066812046,0.65661216,0.12669367],"study_design_scores_gemma":[0.0012293871,0.00090987067,0.010583764,0.00044744098,0.00034267743,0.00083191635,0.0017265651,0.6745069,0.03783845,0.07693589,0.19439636,0.0002508093],"about_ca_topic_score_codex":0.06042713,"about_ca_topic_score_gemma":0.041991193,"teacher_disagreement_score":0.06042713,"about_ca_system_score_codex":0.0067048734,"about_ca_system_score_gemma":0.0056724143,"threshold_uncertainty_score":0.120150805},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063302657,0.00037124119,0.9912894,0.00014885825,0.00005325562,0.00003766724,0.00006894024,0.00087786384,0.0008224925],"genre_scores_gemma":[0.17823842,0.00081857824,0.81790614,0.00015550315,0.000091076385,0.00010624518,0.00037030765,0.00038474298,0.0019289756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985507,0.00025046358,0.000098000186,0.00048595693,0.00053507794,0.00007983232],"domain_scores_gemma":[0.9980414,0.0008050378,0.00023944891,0.0005178259,0.00028877545,0.00010741712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010760009,0.00085816067,0.0015953667,0.003159926,0.0006035541,0.0021234318,0.0017140384,0.002149624,0.0035492645],"category_scores_gemma":[0.0053741205,0.00070068106,0.0014867109,0.0033107812,0.0014284668,0.0024922062,0.0023803827,0.0013602206,0.001053775],"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.00013261322,0.00008625193,0.0012879254,0.00030889976,0.00010185812,0.00031763906,0.00024005574,0.3964761,0.013710117,0.04378969,0.0030227161,0.54052615],"study_design_scores_gemma":[0.000007919015,0.000031765543,0.0005009322,0.000014412696,0.0000106493535,0.00022578107,0.00004272512,0.9623263,0.003982896,0.029165598,0.0036732964,0.000017656715],"about_ca_topic_score_codex":0.0028960593,"about_ca_topic_score_gemma":0.0021614817,"teacher_disagreement_score":0.0035492645,"about_ca_system_score_codex":0.0009570791,"about_ca_system_score_gemma":0.0007326039,"threshold_uncertainty_score":0.011873543},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011320621,0.0014145545,0.47638595,0.0018080603,0.00060836703,0.0011871805,0.059023615,0.38401446,0.06423719],"genre_scores_gemma":[0.16195416,0.0024613717,0.5034648,0.0036011762,0.0002670735,0.0024284478,0.23352683,0.05170367,0.040592525],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99768174,0.0002816035,0.00021681048,0.00069638604,0.0009065296,0.00021692629],"domain_scores_gemma":[0.9962579,0.001158477,0.0001925872,0.0014809772,0.0006927307,0.000217331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002884553,0.001898619,0.0010766186,0.00218541,0.0010541902,0.0034445047,0.005682576,0.0014168223,0.032908585],"category_scores_gemma":[0.008734173,0.0015116913,0.0018256778,0.002098137,0.0010292414,0.0076066,0.0042247456,0.0021914376,0.01103755],"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.0016556744,0.00042780678,0.005319701,0.0014766416,0.00025792152,0.00036557703,0.0006340359,0.019708535,0.010792919,0.18256536,0.49776196,0.27903393],"study_design_scores_gemma":[0.00037224946,0.00022736184,0.0016999061,0.00024175817,0.000104718834,0.0005337134,0.00015382854,0.11490686,0.023335334,0.17679368,0.6814816,0.00014892491],"about_ca_topic_score_codex":0.00878629,"about_ca_topic_score_gemma":0.00893779,"teacher_disagreement_score":0.032908585,"about_ca_system_score_codex":0.002067487,"about_ca_system_score_gemma":0.0024735841,"threshold_uncertainty_score":0},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021430966,0.70745623,0.108314574,0.0049461834,0.0019145826,0.00027290694,0.004932104,0.008740676,0.14199175],"genre_scores_gemma":[0.06151335,0.76404893,0.08495032,0.0035044681,0.0017712925,0.00023389637,0.020479191,0.004586805,0.05891178],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985354,0.0002305922,0.00007685237,0.00043701724,0.00058187306,0.00013827454],"domain_scores_gemma":[0.99622345,0.0017748501,0.00016721,0.0007302945,0.0007790175,0.00032512337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023698446,0.0008669834,0.00077861414,0.0070011895,0.0005988936,0.0023408162,0.0023008129,0.0009374499,0.021347838],"category_scores_gemma":[0.005083504,0.00093518576,0.00073990185,0.009482662,0.00074135646,0.006793869,0.0021390773,0.0016091986,0.008812829],"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.00008879876,0.00013575274,0.002176973,0.002499305,0.000043280485,0.00006671359,0.00014179721,0.0021100952,0.0016695895,0.04189873,0.0890458,0.8601233],"study_design_scores_gemma":[0.00000898699,0.00007297001,0.0011574727,0.0004815539,0.000022873744,0.00042851456,0.000078830955,0.0014455238,0.0015005511,0.006052099,0.98873365,0.000017061824],"about_ca_topic_score_codex":0.0023600447,"about_ca_topic_score_gemma":0.0023983377,"teacher_disagreement_score":0.021347838,"about_ca_system_score_codex":0.001023199,"about_ca_system_score_gemma":0.0018834117,"threshold_uncertainty_score":0.07141566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07462963,0.0009590916,0.899529,0.00042751705,0.00023099949,0.00014369632,0.0011699302,0.010288468,0.012621645],"genre_scores_gemma":[0.32296693,0.00069984974,0.6670806,0.00024430265,0.00005321554,0.00022611202,0.0027709703,0.00047989044,0.0054782764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995728,0.000058962807,0.00004046735,0.00007536597,0.0002024317,0.000049912684],"domain_scores_gemma":[0.99917346,0.00015113318,0.000051452265,0.00021080002,0.00036180808,0.00005125822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002736708,0.00039855164,0.00053349935,0.0010203307,0.0005543256,0.0010410645,0.0010640864,0.0004507938,0.0043989206],"category_scores_gemma":[0.0016215707,0.00023556105,0.00057978026,0.0028610416,0.00035706337,0.0015213477,0.0008363672,0.00058214914,0.001341142],"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.00080205675,0.0001994497,0.0039662477,0.0006785925,0.00015563809,0.0006566646,0.0008471112,0.1312937,0.07925168,0.08277288,0.055439737,0.64393634],"study_design_scores_gemma":[0.00008827035,0.0001635012,0.0011135918,0.00004223287,0.000030012834,0.0002667502,0.00019103526,0.8808092,0.0297727,0.045127,0.04235615,0.000039604136],"about_ca_topic_score_codex":0.005493764,"about_ca_topic_score_gemma":0.006012483,"teacher_disagreement_score":0.005493764,"about_ca_system_score_codex":0.0006588327,"about_ca_system_score_gemma":0.0010159609,"threshold_uncertainty_score":0.01471585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3784541,0.035776034,0.39256448,0.09783509,0.0044182604,0.0012299783,0.0059882677,0.039569184,0.04416467],"genre_scores_gemma":[0.5833915,0.007270352,0.37967038,0.011171542,0.0006698359,0.00037663832,0.010385234,0.0033476918,0.003716838],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9845991,0.0047600246,0.0010782948,0.0022083456,0.0056736404,0.0016805832],"domain_scores_gemma":[0.95443875,0.013229886,0.0018488172,0.016279424,0.010926477,0.003276707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014663902,0.0013868548,0.0020544445,0.0015928646,0.0014755952,0.0076479292,0.012173564,0.0037210423,0.008127791],"category_scores_gemma":[0.048260912,0.0011306729,0.0011606036,0.0060188924,0.0015438169,0.03213454,0.00356775,0.0043794955,0.0033887445],"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.0034343065,0.002003536,0.03552684,0.003928714,0.00058900483,0.0006836799,0.0012920575,0.024831101,0.024593107,0.15499671,0.17759939,0.5705215],"study_design_scores_gemma":[0.0015261482,0.0019876924,0.015070042,0.0015117147,0.00079545315,0.0030308228,0.01001175,0.2371403,0.077914484,0.30420202,0.3463992,0.00041041223],"about_ca_topic_score_codex":0.0069142748,"about_ca_topic_score_gemma":0.0075752726,"teacher_disagreement_score":0.014663902,"about_ca_system_score_codex":0.0024949494,"about_ca_system_score_gemma":0.0043803086,"threshold_uncertainty_score":0.07755107},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010533436,0.00044810734,0.98411924,0.00027695193,0.00014519764,0.0002341181,0.00027158562,0.0011748034,0.0027965887],"genre_scores_gemma":[0.38318384,0.00043673202,0.6054027,0.00043007414,0.00026447437,0.0008090346,0.0012688972,0.00055248605,0.0076517435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952943,0.0026434725,0.0001706243,0.00083612103,0.0007286287,0.0003268913],"domain_scores_gemma":[0.97812325,0.016057655,0.0009509528,0.00322776,0.0009679088,0.0006723853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006842057,0.0012051293,0.0024537656,0.0019954275,0.0011899871,0.0017434118,0.0036425223,0.0025466052,0.010587558],"category_scores_gemma":[0.033024255,0.0016432162,0.0018371282,0.0028314863,0.001862165,0.004556014,0.0027291118,0.0024747541,0.0022120527],"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.0014277791,0.00048330083,0.003613725,0.0004579747,0.0004566892,0.0002800399,0.0002085238,0.6634895,0.0019116688,0.1739114,0.010259414,0.14349993],"study_design_scores_gemma":[0.00007580241,0.0000458356,0.00019950829,0.000016153492,0.000040583043,0.000054130574,0.00001426675,0.9025744,0.00069175847,0.094615996,0.001658826,0.0000127245685],"about_ca_topic_score_codex":0.007480386,"about_ca_topic_score_gemma":0.012888621,"teacher_disagreement_score":0.010587558,"about_ca_system_score_codex":0.0016581772,"about_ca_system_score_gemma":0.0029948514,"threshold_uncertainty_score":0.03618473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063880836,0.00021530142,0.9407098,0.0005895848,0.00010923865,0.00016811836,0.0014546122,0.04686168,0.0035035352],"genre_scores_gemma":[0.13864186,0.00057808345,0.8399936,0.000971331,0.00013006004,0.0002947964,0.010865074,0.0059762266,0.0025489181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963993,0.0006722561,0.00039619015,0.00079769525,0.0014859582,0.0002486966],"domain_scores_gemma":[0.9939628,0.0016176266,0.00025276165,0.0028587508,0.0010664053,0.00024160767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038809374,0.0013315901,0.000874934,0.0017205987,0.0010088556,0.0045322636,0.0035468354,0.00092454196,0.003519642],"category_scores_gemma":[0.010969381,0.00090872473,0.0017581608,0.0027890892,0.0016094552,0.008589801,0.0043276725,0.0027473294,0.0019486072],"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.00080074335,0.0005619231,0.010961068,0.0012666496,0.0007096108,0.0008499136,0.0011366908,0.22260106,0.036891192,0.28289717,0.11628208,0.32504192],"study_design_scores_gemma":[0.00010306265,0.00006190158,0.0006983447,0.000074003445,0.000103218845,0.0002244966,0.00030338028,0.7005505,0.031278756,0.21283787,0.05367385,0.00009061654],"about_ca_topic_score_codex":0.010647793,"about_ca_topic_score_gemma":0.016939234,"teacher_disagreement_score":0.010647793,"about_ca_system_score_codex":0.0015879181,"about_ca_system_score_gemma":0.002948797,"threshold_uncertainty_score":0.02117163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05258435,0.0041624825,0.6763907,0.001697054,0.0011391771,0.00028474093,0.0012964474,0.0022023218,0.2602426],"genre_scores_gemma":[0.35210505,0.0038890322,0.48264974,0.0011417542,0.0007684222,0.00032206776,0.0028752435,0.0018443777,0.15440427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997009,0.000057712474,0.000011876648,0.00008833744,0.00008474961,0.00005638089],"domain_scores_gemma":[0.9996629,0.00005988605,0.00002126309,0.000116016105,0.000088454624,0.000051589028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002667481,0.000852351,0.0008281782,0.0012684538,0.0010200809,0.0015775873,0.0010129652,0.00059547316,0.017747276],"category_scores_gemma":[0.0007496157,0.0005300746,0.0007337159,0.001834789,0.0010867406,0.002288232,0.0017448805,0.0022294808,0.0054227426],"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.00011743892,0.000059694026,0.00020019292,0.00038927438,0.0000332834,0.00010194408,0.00032263054,0.008115798,0.005809602,0.7645046,0.042966757,0.17737873],"study_design_scores_gemma":[0.000016837941,0.000026676744,0.00034309604,0.0000700206,0.000026652331,0.00020420334,0.0001466776,0.020050012,0.0021953029,0.9181426,0.058762588,0.000015280892],"about_ca_topic_score_codex":0.0015605177,"about_ca_topic_score_gemma":0.002884605,"teacher_disagreement_score":0.017747276,"about_ca_system_score_codex":0.00086572446,"about_ca_system_score_gemma":0.00063911924,"threshold_uncertainty_score":0.059370577},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051134534,0.5899597,0.25860384,0.058074847,0.0012367122,0.00011520617,0.0018430515,0.0013665102,0.03766572],"genre_scores_gemma":[0.30216563,0.5546473,0.12019776,0.008320748,0.006998458,0.0001373027,0.0028668102,0.0005662181,0.004099707],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978035,0.00058306433,0.000100893754,0.0007293304,0.0006286118,0.0001545708],"domain_scores_gemma":[0.96814716,0.025942622,0.0011529954,0.0024630039,0.0016408637,0.0006534325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003521405,0.0008484069,0.0015252125,0.003811397,0.0010943662,0.004307706,0.0026868416,0.0021509258,0.0038704684],"category_scores_gemma":[0.0199426,0.0010335068,0.0007591307,0.007085608,0.0036709548,0.014969991,0.0024975247,0.0029257261,0.0012778296],"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.000164054,0.00017945888,0.0126058245,0.004672566,0.00019318289,0.00026728405,0.0004383849,0.018742736,0.0019274188,0.2863099,0.04613047,0.62836874],"study_design_scores_gemma":[0.000021561282,0.0000994178,0.0060193962,0.00088910694,0.00009043835,0.0014783939,0.0007428388,0.04954101,0.0016104669,0.71150386,0.22793522,0.000068347224],"about_ca_topic_score_codex":0.0023606038,"about_ca_topic_score_gemma":0.0028264483,"teacher_disagreement_score":0.004307706,"about_ca_system_score_codex":0.0015874488,"about_ca_system_score_gemma":0.0014598825,"threshold_uncertainty_score":0.018623173},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0507546,0.0006659002,0.94355357,0.00021563677,0.00003939799,0.00025654995,0.00057020044,0.0011766012,0.0027675654],"genre_scores_gemma":[0.14461216,0.0004586426,0.8515928,0.00009284822,0.00001871425,0.00012140229,0.001472444,0.00016806612,0.0014628859],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941695,0.00015529439,0.0000586603,0.00016181004,0.00012861237,0.00007868233],"domain_scores_gemma":[0.9990441,0.00051607005,0.00010977888,0.00012602317,0.0001351196,0.000068830406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006386732,0.0009331915,0.0010011152,0.0018754471,0.0012069012,0.00087488064,0.0009981118,0.0008435216,0.002828909],"category_scores_gemma":[0.0029904123,0.00058676343,0.00093717483,0.0016237228,0.0004030437,0.0023149732,0.0010302416,0.0006147414,0.0008169121],"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.0002511878,0.0002967256,0.004054739,0.0014507028,0.0001907835,0.0007064685,0.0006902337,0.19146644,0.029969867,0.043979373,0.008989322,0.7179542],"study_design_scores_gemma":[0.000112624395,0.00043632087,0.0019951067,0.0001538841,0.00018034388,0.001835863,0.0007017366,0.73933345,0.02601762,0.20640184,0.022748597,0.000082712926],"about_ca_topic_score_codex":0.0016438884,"about_ca_topic_score_gemma":0.0033853804,"teacher_disagreement_score":0.002828909,"about_ca_system_score_codex":0.00042357817,"about_ca_system_score_gemma":0.0012876722,"threshold_uncertainty_score":0.009463608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075507864,0.00093158457,0.9056692,0.0024820503,0.00017201187,0.00038614578,0.00030697996,0.0020164046,0.0125278225],"genre_scores_gemma":[0.48466963,0.0006254312,0.50289935,0.0007303961,0.0002463975,0.00083803915,0.00076488627,0.0006209838,0.008604835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948691,0.0012142028,0.0003459483,0.0010443178,0.0018099501,0.0007164894],"domain_scores_gemma":[0.9880492,0.007940753,0.0006061398,0.0020419941,0.0010326672,0.00032928213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039709457,0.0013638987,0.0013817515,0.0009434355,0.002432597,0.0032728892,0.00300795,0.0016020614,0.0071942233],"category_scores_gemma":[0.017832838,0.00090856146,0.0014702834,0.002670432,0.0019793212,0.0086358255,0.0039646253,0.003019598,0.0018014155],"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.0014554948,0.00055771996,0.0023951288,0.0007964535,0.00019425456,0.00039519687,0.0011704172,0.49068952,0.015725864,0.28802726,0.016481923,0.18211077],"study_design_scores_gemma":[0.00009140948,0.00010825897,0.00018427224,0.000016290707,0.00003735415,0.00009255246,0.00016647356,0.80661213,0.0052834423,0.18265839,0.0047276556,0.000021752026],"about_ca_topic_score_codex":0.00342472,"about_ca_topic_score_gemma":0.0031346749,"teacher_disagreement_score":0.0071942233,"about_ca_system_score_codex":0.0020153162,"about_ca_system_score_gemma":0.0022386208,"threshold_uncertainty_score":0.024067044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061281648,0.0009850943,0.8605872,0.0007336088,0.0007520687,0.00035543134,0.0013328391,0.060003564,0.013968521],"genre_scores_gemma":[0.40231788,0.00053763925,0.5747615,0.0005942461,0.00017005614,0.00044160665,0.00280169,0.004664654,0.0137108015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992206,0.00018922202,0.00003998927,0.00014476836,0.00026276914,0.00014256526],"domain_scores_gemma":[0.99776757,0.00059943483,0.000085266365,0.0010283659,0.00032138242,0.00019796324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076316285,0.00091135595,0.00089169457,0.00081509986,0.00082260114,0.0014524984,0.003202759,0.00096958794,0.009792801],"category_scores_gemma":[0.0040494273,0.0006539209,0.0006254456,0.0011971227,0.000736717,0.0031264797,0.002679767,0.0018372638,0.0024345627],"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.0033659227,0.0011598414,0.0041248584,0.0010796039,0.0003337245,0.00041833514,0.0010050538,0.10206456,0.06830974,0.07244558,0.12849012,0.61720276],"study_design_scores_gemma":[0.00034065617,0.0003396975,0.0008482365,0.000067765235,0.000100517194,0.0001325494,0.00015890494,0.8370861,0.052408975,0.06836628,0.04008151,0.0000687079],"about_ca_topic_score_codex":0.008337434,"about_ca_topic_score_gemma":0.021720426,"teacher_disagreement_score":0.009792801,"about_ca_system_score_codex":0.0008119355,"about_ca_system_score_gemma":0.0021011133,"threshold_uncertainty_score":0.032760203},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005425214,0.008389932,0.8814861,0.0026035262,0.00027039144,0.00013617339,0.00040918164,0.001088068,0.100191414],"genre_scores_gemma":[0.1644897,0.019980054,0.6682597,0.0007672185,0.00041929772,0.00041874862,0.0017653599,0.0005699162,0.14333005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935955,0.00021417238,0.000040018025,0.00015516616,0.00019183611,0.00003924745],"domain_scores_gemma":[0.9992974,0.00043846597,0.000028363063,0.00013627052,0.000076876626,0.000022692917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094009296,0.0006678355,0.000657377,0.0012816736,0.00062013586,0.0034025204,0.0016118851,0.0013452541,0.022235611],"category_scores_gemma":[0.003043001,0.0006623309,0.0006636303,0.0034207446,0.0015933271,0.005437694,0.0011321672,0.0012016784,0.004089326],"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.000026994385,0.000071184375,0.00024873173,0.00064737425,0.000042316762,0.0000966566,0.00029457422,0.028299252,0.0013712103,0.5715966,0.029395565,0.36790946],"study_design_scores_gemma":[0.000013418197,0.000022450518,0.00017371339,0.00014122528,0.000038134734,0.00013380495,0.00015757704,0.0556076,0.0011665212,0.8262714,0.11626019,0.000013972026],"about_ca_topic_score_codex":0.0055808327,"about_ca_topic_score_gemma":0.006376044,"teacher_disagreement_score":0.022235611,"about_ca_system_score_codex":0.001551316,"about_ca_system_score_gemma":0.001469718,"threshold_uncertainty_score":0.074385524},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017320466,0.0008600163,0.9467037,0.003974302,0.0006547072,0.00010014603,0.0021574937,0.023633182,0.020184422],"genre_scores_gemma":[0.02315899,0.002598169,0.9326879,0.0030405698,0.00033104973,0.00034458408,0.005922935,0.010727188,0.021188552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99706095,0.00049067667,0.0002800492,0.00039369304,0.0016248251,0.00014978465],"domain_scores_gemma":[0.99360496,0.0028854946,0.00023592474,0.001777754,0.0011869634,0.00030886932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048096017,0.0011132864,0.001055994,0.0028363222,0.0014340695,0.0069453153,0.004684365,0.0014831016,0.024352465],"category_scores_gemma":[0.016817406,0.0013364207,0.002373019,0.0044556204,0.0017768288,0.014239717,0.0053462447,0.005125489,0.010728607],"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.00014048276,0.000091918635,0.001864243,0.0009147514,0.000104926636,0.0005083552,0.0009813345,0.009736629,0.0032882486,0.45473275,0.25246033,0.27517596],"study_design_scores_gemma":[0.000025883244,0.000018366505,0.00045077832,0.00022442857,0.00003655299,0.00063953723,0.00028148,0.044022184,0.004049624,0.4818282,0.46836066,0.00006233113],"about_ca_topic_score_codex":0.0049926057,"about_ca_topic_score_gemma":0.0089046145,"teacher_disagreement_score":0.024352465,"about_ca_system_score_codex":0.0018355874,"about_ca_system_score_gemma":0.0025651155,"threshold_uncertainty_score":0.08146709},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009342531,0.0005095216,0.93878496,0.0010669851,0.00034494555,0.00022342123,0.0011248267,0.04307842,0.0055244076],"genre_scores_gemma":[0.08238585,0.0004977148,0.90541947,0.0005135756,0.00014428777,0.0002896242,0.0037395593,0.0032987795,0.0037110646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997615,0.00035106932,0.00018617397,0.0004973259,0.0011269081,0.00022355988],"domain_scores_gemma":[0.9966497,0.0007293883,0.00014598544,0.0012280066,0.00092472037,0.00032225114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001962899,0.0013098894,0.0013480971,0.0015256847,0.00092161976,0.0034340038,0.0042934786,0.0011582103,0.0054448396],"category_scores_gemma":[0.008636932,0.00097565254,0.0019382484,0.0024770082,0.0011077083,0.0059060757,0.003939529,0.0031229537,0.0039743795],"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.0014283751,0.0006014119,0.0031870124,0.0013221982,0.0003329526,0.00075405656,0.0010205786,0.19662365,0.031432286,0.16444002,0.1404814,0.4583761],"study_design_scores_gemma":[0.00020560138,0.00009620871,0.00040195568,0.000044843426,0.00003576041,0.00020000851,0.00022386416,0.79614455,0.01673087,0.13580886,0.05005089,0.000056583915],"about_ca_topic_score_codex":0.007796794,"about_ca_topic_score_gemma":0.0080248285,"teacher_disagreement_score":0.007796794,"about_ca_system_score_codex":0.0014423638,"about_ca_system_score_gemma":0.0023476656,"threshold_uncertainty_score":0.018214881},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29222766,0.00047908947,0.69869614,0.0010701901,0.00008152809,0.00018079224,0.00023022329,0.0035749497,0.0034594247],"genre_scores_gemma":[0.88404226,0.000066141,0.11472083,0.0001132869,0.00004586818,0.00009535775,0.00018812841,0.0001899793,0.00053824205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945194,0.0014629398,0.00032601503,0.0014855472,0.0013790103,0.0008270432],"domain_scores_gemma":[0.9841303,0.009797818,0.0011652568,0.003268433,0.0010741879,0.0005639633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051711127,0.0010677436,0.001618126,0.00097423175,0.0012556537,0.0027694218,0.0030585013,0.0013887198,0.0015918564],"category_scores_gemma":[0.021312904,0.0006748031,0.0008730162,0.0013365141,0.0029224132,0.005713324,0.002883933,0.0012594872,0.00030526306],"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.0013296445,0.0002738374,0.0048997803,0.00014033649,0.00011458104,0.00018183282,0.00031675166,0.87225056,0.01727868,0.023750922,0.0024786885,0.07698438],"study_design_scores_gemma":[0.000032656702,0.00005097751,0.00016216401,0.0000034652207,0.000012611875,0.000023362965,0.00004155096,0.9792029,0.004240832,0.01601687,0.00020643981,0.0000061358073],"about_ca_topic_score_codex":0.0037516118,"about_ca_topic_score_gemma":0.0044871,"teacher_disagreement_score":0.0051711127,"about_ca_system_score_codex":0.0026276845,"about_ca_system_score_gemma":0.0026788306,"threshold_uncertainty_score":0.027347744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010563898,0.00008204305,0.9826089,0.0002841459,0.000058044337,0.0001255616,0.00025395484,0.0016356756,0.0043878085],"genre_scores_gemma":[0.4150858,0.00035129426,0.5731136,0.0002600214,0.00016507755,0.00067916233,0.0010050952,0.0004746267,0.008865364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986505,0.00033517863,0.00009116962,0.00030753203,0.00047787646,0.00013783031],"domain_scores_gemma":[0.9980756,0.00047967187,0.0001334657,0.0006895941,0.00046805383,0.00015361032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014797978,0.00064613833,0.0005401305,0.0007187524,0.00080075173,0.0014844701,0.0024059194,0.00056901394,0.0040211356],"category_scores_gemma":[0.0036526688,0.00044439646,0.00077855773,0.0012551934,0.0009613745,0.0029161882,0.0013806309,0.0011058432,0.0011907348],"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.0004082555,0.00024673433,0.0022098823,0.00023963397,0.00008133053,0.00028069402,0.0003614902,0.59618515,0.011792276,0.3013165,0.015830755,0.071047395],"study_design_scores_gemma":[0.000046446807,0.000048711176,0.000151684,0.0000059715394,0.000017402761,0.000037954756,0.00003078616,0.9415348,0.001887108,0.050600007,0.0056293337,0.000009842701],"about_ca_topic_score_codex":0.005496365,"about_ca_topic_score_gemma":0.008096073,"teacher_disagreement_score":0.005496365,"about_ca_system_score_codex":0.0013448443,"about_ca_system_score_gemma":0.0027296518,"threshold_uncertainty_score":0.013452053},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84785545,0.0047564683,0.08458008,0.002198449,0.00054581877,0.0007575949,0.013719632,0.028936924,0.016649622],"genre_scores_gemma":[0.8909446,0.00093860173,0.086692855,0.00031778647,0.0000780999,0.00030615833,0.018356306,0.0011683328,0.0011973433],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.97727215,0.00870185,0.0023401775,0.0031166072,0.007487454,0.0010818596],"domain_scores_gemma":[0.9637254,0.015740238,0.0012942968,0.0104608685,0.0068257716,0.0019534503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01590448,0.0019084977,0.0012235245,0.004855127,0.0014873078,0.005531318,0.004579682,0.0014836673,0.0020078907],"category_scores_gemma":[0.036383025,0.0005844463,0.0010066398,0.008649652,0.0014238328,0.005570252,0.0035290783,0.0014666665,0.0011530201],"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.009700246,0.005131599,0.12670195,0.004707428,0.0025240495,0.0015323228,0.0049733557,0.2312836,0.033898484,0.039125003,0.07555745,0.4648645],"study_design_scores_gemma":[0.00059541216,0.001773709,0.054482248,0.00024183653,0.000356789,0.00093899295,0.004626337,0.82509416,0.053944934,0.023553265,0.034183573,0.00020873634],"about_ca_topic_score_codex":0.008464919,"about_ca_topic_score_gemma":0.005570316,"teacher_disagreement_score":0.01590448,"about_ca_system_score_codex":0.0019533844,"about_ca_system_score_gemma":0.002241716,"threshold_uncertainty_score":0.08411199},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019168437,0.00011163252,0.97612345,0.00012530456,0.000043529548,0.000114838964,0.00021417844,0.0011752212,0.0029232553],"genre_scores_gemma":[0.13576825,0.00010852963,0.8600842,0.00006390163,0.00002806029,0.00017749809,0.0012342461,0.00045303776,0.0020823127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918586,0.00014387532,0.00004358692,0.00020374777,0.00031133968,0.00011155186],"domain_scores_gemma":[0.9979672,0.0007185362,0.00017115336,0.00045270557,0.0006051039,0.00008525992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064706453,0.0009338412,0.00089291163,0.002015564,0.001090083,0.0015333388,0.0015613113,0.00079954707,0.0059490665],"category_scores_gemma":[0.0047620423,0.00055835035,0.00085354655,0.001963995,0.00046675728,0.0019657481,0.0012127513,0.0013385032,0.0017766367],"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.00020824296,0.000230885,0.004771912,0.00049427967,0.00014302613,0.00033818127,0.0008600822,0.36074746,0.048835307,0.046885345,0.013327956,0.52315724],"study_design_scores_gemma":[0.000038179638,0.00012884609,0.0021064812,0.000045167937,0.000049646456,0.0002061389,0.00045648447,0.9100365,0.027773064,0.041398656,0.01771781,0.00004307333],"about_ca_topic_score_codex":0.0061384006,"about_ca_topic_score_gemma":0.015794342,"teacher_disagreement_score":0.0061384006,"about_ca_system_score_codex":0.0007982753,"about_ca_system_score_gemma":0.0013314672,"threshold_uncertainty_score":0.019901633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96361834,0.000705831,0.020584967,0.00071594416,0.00036191,0.00056009233,0.0031789655,0.0030807033,0.007193227],"genre_scores_gemma":[0.9654979,0.00030889385,0.024569703,0.0001605938,0.0001104004,0.0004484296,0.0070443377,0.00035971767,0.0014999247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99135184,0.0032717602,0.0007378667,0.0016647258,0.0022721586,0.0007016224],"domain_scores_gemma":[0.96718544,0.015040848,0.001331463,0.008356257,0.0067812875,0.0013046545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049434965,0.0010889875,0.00092530856,0.0016594345,0.001717818,0.0012721997,0.0026432953,0.0008901576,0.0032248392],"category_scores_gemma":[0.023942985,0.0004373534,0.00053696305,0.0033026969,0.0016182924,0.0029288018,0.0016899607,0.0014840327,0.00090928294],"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.0076341876,0.010585439,0.054434918,0.004821795,0.0012731779,0.0011130349,0.00262308,0.5547334,0.082930416,0.019111393,0.06210752,0.19863163],"study_design_scores_gemma":[0.0017931634,0.0063975696,0.042815283,0.00017175716,0.0003345361,0.00085201976,0.0031087638,0.80391574,0.09328342,0.023327233,0.023790658,0.00020988607],"about_ca_topic_score_codex":0.004570648,"about_ca_topic_score_gemma":0.0037153086,"teacher_disagreement_score":0.0049434965,"about_ca_system_score_codex":0.0017186546,"about_ca_system_score_gemma":0.0012700701,"threshold_uncertainty_score":0.026143968},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077940123,0.00067934865,0.9488155,0.00046253542,0.00040176423,0.00012701892,0.0013532661,0.034383323,0.0059832903],"genre_scores_gemma":[0.12858622,0.0013322281,0.8368887,0.00038983027,0.0003546454,0.00025014058,0.0055633625,0.006418593,0.020216286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954385,0.00005597432,0.000023059769,0.00012605879,0.00021355039,0.000037498226],"domain_scores_gemma":[0.99908054,0.00040390217,0.000041114236,0.00026493182,0.00013777675,0.000071700466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006171577,0.0012615968,0.0011063489,0.0011825461,0.0005884921,0.0016529197,0.0019758109,0.0008396244,0.013441465],"category_scores_gemma":[0.002830164,0.00070209143,0.0008426115,0.0016683612,0.000636536,0.0030435114,0.002027169,0.0018707722,0.0044026766],"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.00062877126,0.00021460852,0.0008077157,0.0005744205,0.00016227996,0.00028648175,0.0002860182,0.1525787,0.024266126,0.053951807,0.13979246,0.6264506],"study_design_scores_gemma":[0.000089205045,0.00005742947,0.00033645317,0.000034970566,0.000026883583,0.00014175769,0.00006154999,0.85128677,0.012551121,0.098999,0.036379516,0.000035364807],"about_ca_topic_score_codex":0.0029925571,"about_ca_topic_score_gemma":0.0038549097,"teacher_disagreement_score":0.013441465,"about_ca_system_score_codex":0.00060137006,"about_ca_system_score_gemma":0.0007044529,"threshold_uncertainty_score":0.04496622},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6819987,0.032953348,0.19540484,0.008621032,0.0010856868,0.0003258499,0.0023265325,0.02287859,0.054405365],"genre_scores_gemma":[0.8531688,0.0037711423,0.13431725,0.0010557116,0.00015814342,0.00010418982,0.0022830137,0.0018647806,0.0032769847],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969891,0.00088313455,0.00012264085,0.0007435349,0.0008623897,0.00039925298],"domain_scores_gemma":[0.9934936,0.0030796104,0.00042726056,0.0012962138,0.0012000281,0.00050326507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043602698,0.0012993327,0.001127604,0.0019308976,0.0006460644,0.003348658,0.0020082623,0.0018773815,0.002309938],"category_scores_gemma":[0.023129223,0.0005808616,0.000797984,0.002946726,0.0007885785,0.006756385,0.0010704212,0.0009820566,0.0017872159],"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.0020337028,0.0006996943,0.03373627,0.0012711049,0.0008254241,0.00013388778,0.00047694857,0.17788154,0.008438223,0.02364535,0.04589716,0.7049607],"study_design_scores_gemma":[0.00032186945,0.0009956469,0.021661578,0.00034416595,0.00036959111,0.00044488226,0.0012185387,0.86615956,0.013652506,0.053716246,0.040936206,0.00017925669],"about_ca_topic_score_codex":0.011643871,"about_ca_topic_score_gemma":0.016799677,"teacher_disagreement_score":0.011643871,"about_ca_system_score_codex":0.0011720374,"about_ca_system_score_gemma":0.001953599,"threshold_uncertainty_score":0.023152173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042312354,0.000811877,0.9553674,0.00025112907,0.000030048779,0.000034990815,0.00009793129,0.00031279938,0.0007813935],"genre_scores_gemma":[0.56464005,0.00085280935,0.4327051,0.00012057041,0.00009212032,0.00007170774,0.0003583664,0.000063641295,0.0010955955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987458,0.0004274614,0.00007945422,0.0003063661,0.0003678315,0.00007319784],"domain_scores_gemma":[0.9967175,0.00207536,0.00028412387,0.0004341943,0.00038765158,0.0001011348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013621994,0.00037635793,0.001015419,0.0037194744,0.0006209772,0.0016813339,0.0012540371,0.0015499236,0.00090921624],"category_scores_gemma":[0.008397693,0.00047764916,0.0008262927,0.0035965901,0.0013590002,0.0035724214,0.001277517,0.00087986444,0.00026459456],"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.00025045552,0.00009401688,0.0020260264,0.00020274751,0.00008843237,0.00018075798,0.00032928915,0.48469704,0.0056086266,0.13310057,0.001954047,0.37146804],"study_design_scores_gemma":[0.000011816835,0.000027796525,0.00044455825,0.0000165328,0.000013130299,0.00007602731,0.000047791276,0.8491522,0.0015746228,0.14740728,0.0012104756,0.00001783093],"about_ca_topic_score_codex":0.0043712924,"about_ca_topic_score_gemma":0.0023333335,"teacher_disagreement_score":0.0043712924,"about_ca_system_score_codex":0.0014256638,"about_ca_system_score_gemma":0.0004913552,"threshold_uncertainty_score":0.010343969},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15992759,0.00058508565,0.8274297,0.00085604575,0.0000841735,0.00023648415,0.0009616364,0.00542403,0.004495275],"genre_scores_gemma":[0.5527877,0.0004165529,0.43873712,0.0002528307,0.00005218238,0.00032071004,0.002627997,0.00044657395,0.0043583172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987999,0.00024819485,0.00008482573,0.00034366548,0.00032424222,0.00019927254],"domain_scores_gemma":[0.9967264,0.0012942333,0.00030049623,0.0009715089,0.00050034176,0.00020700326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006562368,0.0006812023,0.00085031166,0.001318931,0.0010093171,0.0011916743,0.0017618337,0.00065183954,0.002588041],"category_scores_gemma":[0.0050647995,0.00044413222,0.00072363624,0.0019992085,0.0008612851,0.004051041,0.0020218897,0.0008265829,0.000791176],"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.00055957964,0.0002502761,0.008487561,0.00069074356,0.00016017524,0.00056164846,0.0011707646,0.5629785,0.02795366,0.069433816,0.01769184,0.31006145],"study_design_scores_gemma":[0.000053274856,0.000069014364,0.00079641177,0.000019855694,0.000026829035,0.00017930863,0.00031053164,0.8937838,0.007976204,0.09074271,0.006024022,0.00001806494],"about_ca_topic_score_codex":0.00465644,"about_ca_topic_score_gemma":0.00631414,"teacher_disagreement_score":0.00465644,"about_ca_system_score_codex":0.001003861,"about_ca_system_score_gemma":0.0010884948,"threshold_uncertainty_score":0.0092586875},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26738137,0.00010025182,0.7194062,0.00021024716,0.000033610813,0.00006070868,0.00015721546,0.0021329927,0.010517428],"genre_scores_gemma":[0.67294997,0.00010278223,0.32148448,0.000047662892,0.000011773273,0.00007691186,0.00030216377,0.00017394472,0.0048503126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988365,0.000016168957,0.0000056455306,0.000024301107,0.000048311056,0.000021949405],"domain_scores_gemma":[0.99968994,0.000092279384,0.00003988991,0.000077176686,0.00007871583,0.000021931113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013386438,0.00035433922,0.0003038209,0.00048168117,0.00033440164,0.00029999536,0.0006334477,0.00031790225,0.0028861568],"category_scores_gemma":[0.0007732618,0.00020961511,0.0003244306,0.00056450226,0.00034488723,0.0008751917,0.00044984062,0.00047110024,0.00055338355],"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.00014648124,0.000094206414,0.0017279843,0.00013228871,0.000025366799,0.00027585207,0.00014661456,0.8094789,0.033106532,0.029744236,0.004485304,0.120636225],"study_design_scores_gemma":[0.0000126251425,0.000039510523,0.00039367317,0.000004001072,0.0000046453542,0.000048796057,0.000035822668,0.97898865,0.007833065,0.011211,0.0014227473,0.000005499077],"about_ca_topic_score_codex":0.003624171,"about_ca_topic_score_gemma":0.008638908,"teacher_disagreement_score":0.003624171,"about_ca_system_score_codex":0.00055066857,"about_ca_system_score_gemma":0.000447856,"threshold_uncertainty_score":0.009655118},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005942479,0.00025332024,0.9819686,0.00031732113,0.00006977863,0.00012588395,0.0008405499,0.008499428,0.001982581],"genre_scores_gemma":[0.16885234,0.00042742354,0.81750995,0.0004384119,0.00010262332,0.0005908218,0.004430906,0.0017811104,0.005866496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987679,0.0005012301,0.000048209815,0.00036654278,0.00025252235,0.000063548716],"domain_scores_gemma":[0.99611354,0.0026430928,0.00014619676,0.000698062,0.00024974742,0.0001493472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021074032,0.001706421,0.0015299524,0.0019232781,0.00096252054,0.0020675815,0.0042243605,0.0023998157,0.008803271],"category_scores_gemma":[0.0137193315,0.0015211675,0.002196143,0.0016876165,0.0012887961,0.005258532,0.0042028106,0.004099417,0.0032477737],"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.00045902963,0.0004024482,0.0015355565,0.00084444135,0.0003513109,0.000258793,0.00023815347,0.42439505,0.0031895912,0.12509063,0.040537477,0.4026975],"study_design_scores_gemma":[0.00003503173,0.00002481491,0.000049539,0.000020033232,0.00001960858,0.00003292502,0.000011725993,0.8652967,0.00089869404,0.13102356,0.0025794113,0.0000079610045],"about_ca_topic_score_codex":0.0038054595,"about_ca_topic_score_gemma":0.008860666,"teacher_disagreement_score":0.008803271,"about_ca_system_score_codex":0.0014056902,"about_ca_system_score_gemma":0.001957057,"threshold_uncertainty_score":0.02944988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12695362,0.0059648156,0.815181,0.0116147045,0.0014069456,0.00018447843,0.0023679684,0.013510084,0.02281642],"genre_scores_gemma":[0.4950655,0.0031398472,0.4784057,0.00150911,0.00059312885,0.00016452523,0.0022107232,0.009651237,0.009260209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833906,0.00053231564,0.00010730815,0.0005032901,0.000334192,0.00018378308],"domain_scores_gemma":[0.9887349,0.004031895,0.0008174358,0.003789405,0.0017245559,0.0009018734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013443085,0.0012575333,0.0021384442,0.0015952907,0.0010516755,0.003564761,0.0020000364,0.0032176417,0.016099181],"category_scores_gemma":[0.023099784,0.0015160395,0.0011887313,0.0028685671,0.0016049065,0.009945655,0.0019726295,0.0017919069,0.010826795],"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.0012007171,0.00025038474,0.008098957,0.0015796085,0.00017286625,0.00047816004,0.0007630592,0.069891095,0.041924305,0.08510171,0.075968616,0.7145704],"study_design_scores_gemma":[0.0005113964,0.0005641284,0.0031654846,0.00038416614,0.00024342994,0.0014711994,0.002347897,0.3031407,0.040454805,0.584405,0.06304732,0.00026439864],"about_ca_topic_score_codex":0.000863023,"about_ca_topic_score_gemma":0.0025073348,"teacher_disagreement_score":0.016099181,"about_ca_system_score_codex":0.0007488246,"about_ca_system_score_gemma":0.0007586082,"threshold_uncertainty_score":0.053857148},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0439357,0.0005700364,0.94248855,0.00079175463,0.00020361807,0.0004242458,0.00082351954,0.007216991,0.003545572],"genre_scores_gemma":[0.10546883,0.00019587956,0.8862645,0.00038589572,0.000046308123,0.0002585233,0.0027572138,0.001035067,0.0035877214],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833125,0.00033578064,0.00011758952,0.0005071878,0.0005053352,0.00020287056],"domain_scores_gemma":[0.9956542,0.0018253048,0.0003488569,0.001419445,0.00053707074,0.00021509224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001669146,0.0016559047,0.0014989811,0.0033135172,0.0015369019,0.0018011163,0.0030577339,0.0017571277,0.0075575234],"category_scores_gemma":[0.01214654,0.000829996,0.0016361863,0.0031244755,0.0012312979,0.0034260938,0.0026753754,0.0020799134,0.0025724862],"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.0006380033,0.00072347035,0.0092471475,0.00095299486,0.00026490146,0.0006658603,0.0008002178,0.15257093,0.023937386,0.04168345,0.04530552,0.7232101],"study_design_scores_gemma":[0.00012648008,0.00020211343,0.00081394025,0.00009875345,0.000084755164,0.00042120504,0.00042393612,0.8896874,0.012977995,0.07728876,0.017845599,0.000029036588],"about_ca_topic_score_codex":0.0047091497,"about_ca_topic_score_gemma":0.013252745,"teacher_disagreement_score":0.0075575234,"about_ca_system_score_codex":0.0008504409,"about_ca_system_score_gemma":0.0026644964,"threshold_uncertainty_score":0.025282383},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1218998,0.002798672,0.7852403,0.0036575196,0.00045960696,0.0002815152,0.0015223947,0.008539527,0.075600676],"genre_scores_gemma":[0.77936655,0.0012072427,0.18224344,0.0012896538,0.00016170915,0.0004922925,0.0012740948,0.002313188,0.031651784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974195,0.00044940942,0.00012858762,0.0004584916,0.0012013591,0.00034270893],"domain_scores_gemma":[0.991699,0.0019421938,0.00043309675,0.0033303266,0.0023004785,0.00029506395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016356449,0.0004895455,0.00060018076,0.00084524025,0.0013913773,0.0019755627,0.002731515,0.0008252155,0.010326759],"category_scores_gemma":[0.0103939045,0.0006742988,0.00056139764,0.0018372069,0.0022290503,0.006548276,0.0047901818,0.0017216614,0.0029402128],"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.00082733156,0.00036370123,0.010531906,0.0010326585,0.0001388666,0.0005474343,0.0019483377,0.09309191,0.061138753,0.55400974,0.057158273,0.21921112],"study_design_scores_gemma":[0.00014702821,0.00027495206,0.0022375092,0.00014185284,0.00011546894,0.0010495089,0.00084981613,0.3091029,0.08621796,0.4623379,0.13737886,0.00014631094],"about_ca_topic_score_codex":0.0028450168,"about_ca_topic_score_gemma":0.0048544933,"teacher_disagreement_score":0.010326759,"about_ca_system_score_codex":0.001681389,"about_ca_system_score_gemma":0.0023001092,"threshold_uncertainty_score":0.034546494},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018720042,0.088145584,0.21112652,0.04347519,0.18544134,0.00039170845,0.0017988344,0.0016143781,0.44928643],"genre_scores_gemma":[0.09264094,0.07166506,0.11264183,0.0054715923,0.061315876,0.0004625148,0.0043586697,0.0015530599,0.6498905],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990507,0.00027685027,0.000043732027,0.0001898347,0.00031463947,0.00012431522],"domain_scores_gemma":[0.9968851,0.0009973409,0.000115365954,0.00047922815,0.00084761885,0.0006752318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024131783,0.0013817515,0.00202537,0.001501865,0.0012357202,0.005740234,0.0017984265,0.0015095903,0.053557806],"category_scores_gemma":[0.0035134712,0.0004582087,0.0009269508,0.0016170886,0.0014583861,0.0032406652,0.0017290242,0.0037855906,0.015641652],"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.00051798613,0.0003535756,0.0011122646,0.00058187556,0.00015668393,0.00022652467,0.00018266641,0.004575702,0.0029686396,0.115240656,0.6259298,0.24815372],"study_design_scores_gemma":[0.000069854184,0.00012373786,0.0014227189,0.00031242587,0.00011068248,0.00046383898,0.0001578834,0.021896018,0.0017854272,0.08866021,0.88495517,0.0000419268],"about_ca_topic_score_codex":0.0023695799,"about_ca_topic_score_gemma":0.0060834154,"teacher_disagreement_score":0.053557806,"about_ca_system_score_codex":0.002022497,"about_ca_system_score_gemma":0.0015568117,"threshold_uncertainty_score":0.17916876},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010266275,0.13797043,0.33927503,0.028116986,0.0942934,0.0014994292,0.006097288,0.010593967,0.37188718],"genre_scores_gemma":[0.055343598,0.10036547,0.17701225,0.0059358785,0.028528405,0.001371276,0.015577682,0.0049935626,0.61087185],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99663275,0.0007827535,0.00028054576,0.0004575765,0.0016017236,0.0002447059],"domain_scores_gemma":[0.995559,0.0011487221,0.00015424134,0.001149698,0.0013185943,0.0006696598],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0035942222,0.00203879,0.002427743,0.0014725162,0.0012483639,0.007142106,0.0022650806,0.0015294418,0.11062874],"category_scores_gemma":[0.0069229505,0.0010845559,0.0012660808,0.0022590011,0.0014824028,0.0048467363,0.0030646606,0.005875323,0.053104777],"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.00021493652,0.0001567755,0.00060724636,0.0007125635,0.00016673838,0.000116120085,0.00018904082,0.0016370412,0.0029277094,0.029928157,0.699975,0.26336873],"study_design_scores_gemma":[0.00003568841,0.00008743515,0.0005587298,0.00020361898,0.000030336749,0.00025021782,0.000068618814,0.0045885458,0.00088708824,0.018591536,0.9746705,0.000027556569],"about_ca_topic_score_codex":0.0016998645,"about_ca_topic_score_gemma":0.0020991245,"teacher_disagreement_score":0.8893713,"about_ca_system_score_codex":0.0015559847,"about_ca_system_score_gemma":0.0036572653,"threshold_uncertainty_score":0.37009},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014331965,0.108798005,0.25161493,0.020590961,0.10048283,0.0008740556,0.0029381036,0.0055835866,0.49478555],"genre_scores_gemma":[0.1586245,0.08920301,0.09642235,0.0051569804,0.018555358,0.00091655424,0.013249837,0.0013002927,0.6165712],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985072,0.0003268893,0.00012426122,0.00025545715,0.0006471285,0.00013893761],"domain_scores_gemma":[0.9978713,0.00047049325,0.00009202029,0.0004335431,0.00080167927,0.00033091355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016376605,0.0013838506,0.0012454138,0.0012212332,0.000765056,0.004804946,0.0012629438,0.0014284526,0.08307272],"category_scores_gemma":[0.0032220325,0.00033443095,0.00077507226,0.0009577104,0.0012007572,0.0026763259,0.0023456328,0.0027441827,0.030351449],"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.00022476552,0.0001897608,0.0014885004,0.00076236,0.00019650407,0.0004466766,0.00025972328,0.0031110458,0.00481618,0.03635777,0.51228905,0.4398576],"study_design_scores_gemma":[0.000013307799,0.00007462185,0.0009245848,0.00020918975,0.000041903637,0.00035902136,0.00011349817,0.004007288,0.0011281971,0.009744607,0.9833604,0.000023428418],"about_ca_topic_score_codex":0.0014825489,"about_ca_topic_score_gemma":0.001679746,"teacher_disagreement_score":0.08307272,"about_ca_system_score_codex":0.0006910504,"about_ca_system_score_gemma":0.0017243524,"threshold_uncertainty_score":0.27790594},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014814367,0.00033133905,0.98231024,0.00008168893,0.00010308481,0.000050511007,0.00017725377,0.0007393632,0.0013921647],"genre_scores_gemma":[0.18814175,0.00067068776,0.8050734,0.00012634913,0.000101229976,0.00013151517,0.0013990796,0.0004018033,0.0039541493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987973,0.00013656467,0.00008028821,0.0003340369,0.0005806599,0.00007117898],"domain_scores_gemma":[0.99920976,0.00011525031,0.00007673731,0.00014510738,0.00036021817,0.00009293835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003710036,0.00082471984,0.0013335395,0.0033500255,0.0005830623,0.0012995383,0.001691622,0.0010469276,0.0038225332],"category_scores_gemma":[0.0015498077,0.00038876943,0.001199794,0.0032103518,0.00070219924,0.0021529368,0.0016887529,0.0010372917,0.0015735106],"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.0005165295,0.0002365293,0.0026107007,0.0004567382,0.00019311147,0.00019549292,0.00018184153,0.06347989,0.07465143,0.045000266,0.009507687,0.80296975],"study_design_scores_gemma":[0.000031048014,0.0001595371,0.0020896432,0.000026543936,0.000054015472,0.00039188022,0.000103187565,0.943839,0.022380473,0.020849245,0.010013953,0.00006139861],"about_ca_topic_score_codex":0.0039480836,"about_ca_topic_score_gemma":0.0049334792,"teacher_disagreement_score":0.0039480836,"about_ca_system_score_codex":0.00078346493,"about_ca_system_score_gemma":0.0009522875,"threshold_uncertainty_score":0.01278764},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065331603,0.00715445,0.7235852,0.0031820124,0.0012267785,0.00080356793,0.01654686,0.03777002,0.20319794],"genre_scores_gemma":[0.06646349,0.008599948,0.6414112,0.0019056951,0.0007154127,0.00045595967,0.051332578,0.0064848396,0.22263093],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991347,0.000083459636,0.00004360227,0.00024523766,0.0004151009,0.000077977595],"domain_scores_gemma":[0.9991799,0.00019520907,0.000024029578,0.00033648044,0.00022037083,0.00004402913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052873004,0.001380623,0.0010388879,0.0027204251,0.00092717784,0.0032624244,0.0021878777,0.0008940916,0.07428903],"category_scores_gemma":[0.0017937945,0.0005641402,0.0011632235,0.0046380847,0.00054428825,0.0031038919,0.0017105232,0.0014800386,0.049505357],"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.00010532122,0.00013849483,0.00025130424,0.00048849126,0.00005421591,0.000087702174,0.00010163283,0.005001697,0.008074966,0.058981385,0.38296384,0.54375094],"study_design_scores_gemma":[0.000053066713,0.00007736892,0.000765693,0.00015588223,0.00007722399,0.0005886189,0.00018538452,0.08513573,0.019882692,0.20301054,0.6900064,0.00006142699],"about_ca_topic_score_codex":0.0049180305,"about_ca_topic_score_gemma":0.007448235,"teacher_disagreement_score":0.07428903,"about_ca_system_score_codex":0.0011296301,"about_ca_system_score_gemma":0.0012006189,"threshold_uncertainty_score":0.24852157},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63716614,0.0023069694,0.2434985,0.002220518,0.00053068186,0.00006797581,0.0015123632,0.0006458588,0.112051025],"genre_scores_gemma":[0.9507453,0.00080596976,0.033312596,0.00023246113,0.00025871675,0.000060485156,0.00084233476,0.00018492172,0.013557211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840146,0.00044307337,0.00008707571,0.0003771193,0.00047445498,0.00021677454],"domain_scores_gemma":[0.9946148,0.0019810356,0.0007878272,0.00094078324,0.000956408,0.0007191008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011472715,0.00045993002,0.00069174357,0.0027565605,0.0012824978,0.0030337262,0.0012941819,0.0010536064,0.008631887],"category_scores_gemma":[0.008546933,0.000335456,0.0004642898,0.0023982602,0.0017428825,0.0063731717,0.0021982726,0.0014694822,0.0016259855],"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.00022577902,0.00006640772,0.0029776837,0.00014628319,0.00004363826,0.00014189344,0.00055377174,0.004048621,0.0031117196,0.94921243,0.0067272717,0.03274456],"study_design_scores_gemma":[0.000021014406,0.00009803294,0.0027150894,0.000056664387,0.00007075143,0.00080543745,0.00048618097,0.0389254,0.003878388,0.935058,0.01783437,0.00005072237],"about_ca_topic_score_codex":0.0009509478,"about_ca_topic_score_gemma":0.0010358493,"teacher_disagreement_score":0.008631887,"about_ca_system_score_codex":0.0011788096,"about_ca_system_score_gemma":0.00041678402,"threshold_uncertainty_score":0.028876543},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010152973,0.053426076,0.00993562,0.038649246,0.8284637,0.00012447935,0.0027684816,0.0005130001,0.06510423],"genre_scores_gemma":[0.016848614,0.049075328,0.004891424,0.008439296,0.3227687,0.00023672008,0.0053870617,0.0018452867,0.5905076],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882084,0.00022639146,0.000081226855,0.00028812807,0.0004562249,0.00012718947],"domain_scores_gemma":[0.99552935,0.00071414385,0.00022482937,0.00040573953,0.002041041,0.0010850591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019121186,0.0023801993,0.0018315389,0.0039986903,0.0018433619,0.004870044,0.0014704325,0.0017701978,0.1402796],"category_scores_gemma":[0.0074614417,0.00048461393,0.001226007,0.0031733087,0.00080718094,0.003019096,0.003232199,0.0040239017,0.07699511],"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.00004008115,0.00002048893,0.000088290326,0.00017434901,0.000008141753,0.000021789272,0.000017173626,0.00035116353,0.0001313565,0.002656585,0.9672442,0.029246353],"study_design_scores_gemma":[0.00002063051,0.0000781569,0.0010332643,0.00054898474,0.0000213338,0.00007934909,0.00007192067,0.0010072767,0.00029703017,0.011350012,0.98546845,0.000023613262],"about_ca_topic_score_codex":0.0030227508,"about_ca_topic_score_gemma":0.0058263396,"teacher_disagreement_score":0.1402796,"about_ca_system_score_codex":0.003501811,"about_ca_system_score_gemma":0.0023138677,"threshold_uncertainty_score":0.46928203},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07612525,0.00048534793,0.91517514,0.0005021378,0.000033298595,0.0001871142,0.00033849175,0.0020392817,0.005113865],"genre_scores_gemma":[0.43606952,0.0002487486,0.56055015,0.00015596337,0.00004560248,0.00015690908,0.00078392465,0.0006559375,0.0013332999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598914,0.0010854651,0.0002369245,0.0005998036,0.0016312641,0.0004574387],"domain_scores_gemma":[0.9970925,0.0016106172,0.00027613746,0.00059544866,0.00029067465,0.00013466478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030855648,0.0011165709,0.0011239804,0.0014560437,0.0007433302,0.0019458486,0.0014830445,0.000747141,0.0016819736],"category_scores_gemma":[0.0066724545,0.00056275976,0.001069676,0.0024688942,0.0014855235,0.0037444513,0.0021021112,0.0012296863,0.00031350553],"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.00039778324,0.0003077616,0.0041110814,0.00017040868,0.000111334106,0.00013539716,0.00021435194,0.7894086,0.009425192,0.037484422,0.0042027165,0.15403098],"study_design_scores_gemma":[0.00003492396,0.00011963766,0.00039996798,0.000010285746,0.00003700939,0.00006235905,0.000083954175,0.9513783,0.0059392643,0.04003942,0.0018791937,0.0000157058],"about_ca_topic_score_codex":0.004872337,"about_ca_topic_score_gemma":0.00897921,"teacher_disagreement_score":0.004872337,"about_ca_system_score_codex":0.0017563791,"about_ca_system_score_gemma":0.0019502484,"threshold_uncertainty_score":0.016318262},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026371193,0.0015467831,0.38156494,0.0020920113,0.0009964313,0.00046544123,0.031163145,0.46471372,0.11482037],"genre_scores_gemma":[0.07660173,0.0029454601,0.44693676,0.0036457318,0.00044861174,0.0017355153,0.14602374,0.16053274,0.16112974],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987392,0.00019749081,0.000094825824,0.00034728297,0.00048608152,0.00013516287],"domain_scores_gemma":[0.99808925,0.0004538456,0.000090895155,0.00078652514,0.00043233868,0.00014713034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010307668,0.0017253911,0.001026832,0.0016313865,0.0010063675,0.003595114,0.0036588053,0.0018081564,0.14816497],"category_scores_gemma":[0.0059504034,0.0012400298,0.001629813,0.0017910635,0.0008448255,0.004807245,0.003554601,0.0032243473,0.106186666],"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.00044495167,0.00013453052,0.00068589393,0.00095746276,0.00013280174,0.00028298202,0.00018447333,0.0052583325,0.0060998336,0.07285897,0.7323582,0.18060155],"study_design_scores_gemma":[0.00021191948,0.00006497522,0.0003358457,0.0001272381,0.000038924667,0.00039209405,0.00007481298,0.028629942,0.008944746,0.09770822,0.86340463,0.00006667649],"about_ca_topic_score_codex":0.0036883892,"about_ca_topic_score_gemma":0.005277497,"teacher_disagreement_score":0.14816497,"about_ca_system_score_codex":0.0012567377,"about_ca_system_score_gemma":0.0017586808,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033351395,0.0002782765,0.9603362,0.0003032445,0.000055085748,0.00007393775,0.00050602586,0.002008709,0.0030870335],"genre_scores_gemma":[0.32822293,0.00041716424,0.6556738,0.00015446328,0.00006454542,0.00016667349,0.001984605,0.0010653444,0.012250438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951506,0.00010509066,0.00001981711,0.00014630047,0.00014856682,0.00006523273],"domain_scores_gemma":[0.9978398,0.00095031364,0.00020545242,0.0005705086,0.00028669304,0.00014720303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064602686,0.0010910664,0.0013615057,0.0019007166,0.00084564014,0.0013064115,0.0019074796,0.001633152,0.009486807],"category_scores_gemma":[0.004795693,0.0010584646,0.0012079846,0.001766781,0.00084843155,0.0036729889,0.0022215587,0.0018755721,0.002534476],"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.00031438385,0.00015736028,0.0015457834,0.0005328522,0.00014019625,0.0004120271,0.00045372455,0.5595476,0.014580895,0.14051059,0.022281425,0.2595232],"study_design_scores_gemma":[0.000014138916,0.000018298722,0.00025570174,0.000016457807,0.000013188526,0.00005660375,0.00006138925,0.89983296,0.0013982173,0.09628674,0.0020377962,0.000008554759],"about_ca_topic_score_codex":0.00550708,"about_ca_topic_score_gemma":0.011310986,"teacher_disagreement_score":0.009486807,"about_ca_system_score_codex":0.00091441156,"about_ca_system_score_gemma":0.0008044319,"threshold_uncertainty_score":0.031736493},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06718592,0.000800984,0.90273285,0.00085886754,0.00018277208,0.00023751854,0.0060379766,0.016866107,0.0050969827],"genre_scores_gemma":[0.5367213,0.0006366976,0.44801158,0.00043027487,0.00009603825,0.00018464764,0.009308462,0.0014101886,0.0032008279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707234,0.0005604219,0.0003472651,0.0007876286,0.00096606463,0.00026619338],"domain_scores_gemma":[0.99104184,0.0040560053,0.0006810969,0.0029187435,0.0009131641,0.00038920814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017906893,0.00091325486,0.0016699503,0.0031904958,0.0011046655,0.0050837523,0.0028563873,0.001443567,0.004687216],"category_scores_gemma":[0.012007124,0.0007691614,0.0013993857,0.0054174857,0.0011151764,0.009564656,0.0040428615,0.0015845562,0.0013107993],"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.0022537848,0.00097310956,0.014570143,0.0012903693,0.00044350207,0.0015533275,0.001518125,0.19007505,0.04252799,0.34176534,0.038590424,0.36443883],"study_design_scores_gemma":[0.00015484629,0.00016854603,0.0013322037,0.00011908162,0.00013494321,0.00055670366,0.0007439991,0.64474124,0.031287093,0.2991899,0.021448543,0.00012283614],"about_ca_topic_score_codex":0.005014636,"about_ca_topic_score_gemma":0.006521227,"teacher_disagreement_score":0.0050837523,"about_ca_system_score_codex":0.0013529378,"about_ca_system_score_gemma":0.0012276979,"threshold_uncertainty_score":0.015680313},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1929357,0.0055877594,0.76447403,0.0041012205,0.00024367418,0.000064811284,0.0016626886,0.0012012402,0.029728811],"genre_scores_gemma":[0.83344066,0.0032016477,0.14031489,0.0010175525,0.0002705513,0.00009052909,0.0025630859,0.00038776014,0.018713325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996762,0.000094753996,0.00001841215,0.0000824391,0.00007728073,0.000050875988],"domain_scores_gemma":[0.99618214,0.0022999907,0.00035506312,0.00044341348,0.00047403053,0.0002453307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007377533,0.0005474107,0.00072304654,0.0014110712,0.00086615264,0.001342452,0.0015188992,0.0014725772,0.004650464],"category_scores_gemma":[0.0076465365,0.0008054628,0.00048717097,0.0014250259,0.0014059639,0.005446838,0.0016639315,0.0024005966,0.0010481012],"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.00026715442,0.00012391801,0.0032674607,0.00031568026,0.00009875065,0.00020616037,0.00037706856,0.13164483,0.0045039984,0.707347,0.023473388,0.12837456],"study_design_scores_gemma":[0.000012957412,0.000031393218,0.00065963576,0.00004868699,0.000022300352,0.00006131828,0.000038856946,0.28119978,0.0008204139,0.7140484,0.0030459245,0.00001037205],"about_ca_topic_score_codex":0.00482487,"about_ca_topic_score_gemma":0.011897519,"teacher_disagreement_score":0.00482487,"about_ca_system_score_codex":0.0012503988,"about_ca_system_score_gemma":0.00067608093,"threshold_uncertainty_score":0.015557408},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045446984,0.0004804722,0.9245686,0.0005215305,0.00019048523,0.00026253462,0.0010288493,0.016215373,0.0112852305],"genre_scores_gemma":[0.24241336,0.00032113318,0.7430702,0.00029316798,0.00006740246,0.0002903765,0.0053651263,0.001043384,0.007135803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994892,0.000075648415,0.000023049603,0.00014704812,0.00017240856,0.00009269274],"domain_scores_gemma":[0.99945444,0.000112910166,0.0000387244,0.00023562614,0.00009822828,0.00006012751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033228574,0.0009860623,0.000805436,0.0011222082,0.0009053481,0.0010522903,0.0018043624,0.00078947394,0.0050857835],"category_scores_gemma":[0.0015549813,0.00038631266,0.0009187278,0.002331951,0.00061194773,0.0019502651,0.0022502772,0.001334807,0.0014937851],"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.00042479238,0.000469343,0.004726264,0.000409777,0.00019457568,0.00037156232,0.00044720643,0.17509483,0.046076853,0.0719249,0.07175436,0.6281056],"study_design_scores_gemma":[0.00009835282,0.00013626176,0.000863026,0.0000148153185,0.00003108318,0.00020973412,0.000154373,0.9080333,0.018809248,0.047787786,0.02383143,0.00003059859],"about_ca_topic_score_codex":0.006701968,"about_ca_topic_score_gemma":0.012706707,"teacher_disagreement_score":0.006701968,"about_ca_system_score_codex":0.0009452776,"about_ca_system_score_gemma":0.0018486697,"threshold_uncertainty_score":0.017013669},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8520004,0.0038972052,0.11489761,0.0006372804,0.00056823075,0.00093449745,0.0038494223,0.006446876,0.016768448],"genre_scores_gemma":[0.8668201,0.0010594284,0.121624336,0.00013063251,0.00010769513,0.00035776926,0.00700152,0.00071888184,0.002179662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962399,0.0010732815,0.00032989527,0.00063593825,0.0012994921,0.00042145848],"domain_scores_gemma":[0.97933424,0.011226161,0.00094099174,0.004240565,0.0037308736,0.00052715675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025225878,0.0011124642,0.0009064565,0.0015418511,0.0009942856,0.0008575819,0.0016287497,0.00076750445,0.0033365914],"category_scores_gemma":[0.018706298,0.00030741407,0.00051256194,0.0027695692,0.0007085652,0.0020762812,0.0008923869,0.0010245616,0.000932616],"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.005493894,0.0040141693,0.008887535,0.0031334045,0.00053393265,0.00039147987,0.0005564985,0.41626272,0.10471386,0.011471739,0.028790038,0.4157507],"study_design_scores_gemma":[0.0003568357,0.0025486837,0.006873012,0.00007164893,0.00011434875,0.0004907156,0.0003916589,0.91006964,0.060811237,0.00895396,0.00926017,0.00005809355],"about_ca_topic_score_codex":0.003351333,"about_ca_topic_score_gemma":0.0029584316,"teacher_disagreement_score":0.003351333,"about_ca_system_score_codex":0.0012433408,"about_ca_system_score_gemma":0.00097542343,"threshold_uncertainty_score":0.01334089},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015803704,0.00025289098,0.9809638,0.000099533834,0.000050173676,0.00019566812,0.00006136448,0.0009427638,0.0016300059],"genre_scores_gemma":[0.22744319,0.00016663127,0.76782054,0.00016620103,0.000056812292,0.0003468859,0.00043649634,0.00025712152,0.0033061453],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992562,0.00014284266,0.000047599446,0.00020201356,0.00022056806,0.00013069298],"domain_scores_gemma":[0.99906343,0.00038110188,0.00008950832,0.00015564742,0.00022905585,0.000081231636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006332835,0.0011599681,0.0014260244,0.0019610184,0.0008421439,0.0009934249,0.002379106,0.0013511581,0.0037586568],"category_scores_gemma":[0.0018426059,0.0005898353,0.0010136329,0.0016441637,0.0006418004,0.0017149093,0.0013591633,0.0007400682,0.0009668786],"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.00043293842,0.000366909,0.0018882302,0.000310526,0.00013737743,0.00031167208,0.00029762404,0.43660367,0.024616146,0.011636572,0.007922786,0.5154756],"study_design_scores_gemma":[0.000045266264,0.00006321157,0.00023255467,0.000009542809,0.0000278407,0.00009076858,0.000048800204,0.9915183,0.0029418168,0.0035399147,0.0014644564,0.00001745358],"about_ca_topic_score_codex":0.004821419,"about_ca_topic_score_gemma":0.0077294274,"teacher_disagreement_score":0.004821419,"about_ca_system_score_codex":0.0007574535,"about_ca_system_score_gemma":0.0016032944,"threshold_uncertainty_score":0.012574017},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15686187,0.0013615618,0.668575,0.0007509441,0.00024551636,0.0007005913,0.0024035345,0.15702154,0.01207941],"genre_scores_gemma":[0.42480606,0.00045495553,0.55698514,0.00036410536,0.00010040686,0.0002840843,0.0057886527,0.005940446,0.005276208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986847,0.0003282765,0.0000736204,0.00029696367,0.0004648065,0.00015175348],"domain_scores_gemma":[0.9956535,0.0013329738,0.00023005302,0.002184419,0.00039004273,0.00020899813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015504372,0.0013732119,0.0008518318,0.0013652296,0.0009456362,0.0016551819,0.0031337913,0.00086413877,0.0037548873],"category_scores_gemma":[0.0065307515,0.00070469367,0.0011116798,0.0015329994,0.0010151926,0.0038826044,0.0033645811,0.0010305704,0.001974027],"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.0023136453,0.00073204417,0.0069302535,0.0011922477,0.0003186857,0.00058394077,0.0014766516,0.24396402,0.11727061,0.019662397,0.085730925,0.5198246],"study_design_scores_gemma":[0.00030734556,0.0005052934,0.0024391848,0.000037978196,0.00006860167,0.0005186093,0.00046007163,0.9123783,0.04170295,0.017695736,0.023818394,0.00006742748],"about_ca_topic_score_codex":0.0057112826,"about_ca_topic_score_gemma":0.009301656,"teacher_disagreement_score":0.0057112826,"about_ca_system_score_codex":0.000970391,"about_ca_system_score_gemma":0.0010347329,"threshold_uncertainty_score":0.012561321},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40945786,0.00092160044,0.56697243,0.00053875544,0.00014299416,0.00006509818,0.0002912119,0.00495973,0.016650256],"genre_scores_gemma":[0.6965245,0.00015682803,0.29840627,0.00015224086,0.000027488251,0.00008907356,0.00037575868,0.00024412421,0.004023742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972636,0.00007039193,0.000009681304,0.000054813187,0.00008256024,0.000056218778],"domain_scores_gemma":[0.9995308,0.00019174731,0.000029148536,0.00010342769,0.00010398103,0.00004080115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038047583,0.0005276275,0.00041373554,0.00052746636,0.0003454208,0.0007721772,0.0010083873,0.0006600875,0.002955207],"category_scores_gemma":[0.0013882417,0.00026992246,0.00032048183,0.0008867233,0.00040360907,0.001141589,0.0008366904,0.000555749,0.00080457143],"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.0006404862,0.00023775296,0.0031694833,0.00018297358,0.00012899448,0.00019506137,0.0002080713,0.768304,0.04035834,0.03082816,0.01167565,0.14407103],"study_design_scores_gemma":[0.00004305206,0.00003726275,0.00019656279,0.0000032758667,0.0000053700364,0.000021696856,0.00002347272,0.9894853,0.0017796088,0.007413729,0.0009863449,0.000004285443],"about_ca_topic_score_codex":0.0042801346,"about_ca_topic_score_gemma":0.008654477,"teacher_disagreement_score":0.0042801346,"about_ca_system_score_codex":0.0006505272,"about_ca_system_score_gemma":0.0007299772,"threshold_uncertainty_score":0.009886146},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13485287,0.0046774778,0.7980631,0.016979015,0.00082534866,0.0006234088,0.013267533,0.0050002863,0.02571094],"genre_scores_gemma":[0.55418026,0.0036544965,0.3942907,0.0017456497,0.0012064745,0.00079511636,0.024494193,0.0017219261,0.017911255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99501246,0.0010920482,0.00035764137,0.0012379107,0.0016444146,0.0006556124],"domain_scores_gemma":[0.9864189,0.0075112483,0.00080861646,0.0037100932,0.0009444029,0.0006066634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029675146,0.002041796,0.004011011,0.0039453115,0.0029917406,0.009933848,0.005837002,0.005258083,0.016919656],"category_scores_gemma":[0.026262026,0.0015489241,0.0033806572,0.012772967,0.0028702905,0.025686957,0.005355635,0.00812346,0.0034028066],"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.0013784445,0.0011437366,0.0024679184,0.0012936649,0.00025626415,0.00024395352,0.0008477133,0.120192215,0.0021104082,0.42465687,0.11250111,0.33290774],"study_design_scores_gemma":[0.00012527904,0.000035435623,0.0002719418,0.00007532268,0.00008665182,0.00013976115,0.00024593188,0.22888511,0.0009212508,0.763729,0.0054634283,0.000020908394],"about_ca_topic_score_codex":0.005502016,"about_ca_topic_score_gemma":0.007920612,"teacher_disagreement_score":0.016919656,"about_ca_system_score_codex":0.0047986247,"about_ca_system_score_gemma":0.0046949014,"threshold_uncertainty_score":0.056601822},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024941575,0.0009058603,0.8444397,0.00060725474,0.0003740774,0.00038495532,0.006472891,0.10876902,0.013104668],"genre_scores_gemma":[0.2015332,0.00059881614,0.7537618,0.0005785051,0.000121780686,0.000490735,0.016744843,0.006785525,0.019384814],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995634,0.000072103714,0.000020396834,0.00011062024,0.00017595776,0.000057537047],"domain_scores_gemma":[0.99886596,0.00035784882,0.00006936905,0.00037505312,0.00023520707,0.00009653495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004004501,0.0013822477,0.0008622445,0.0018102161,0.0009059544,0.0013807234,0.003149648,0.0007906081,0.018415947],"category_scores_gemma":[0.0028350628,0.0007559914,0.0009331982,0.001905351,0.0006321071,0.0021883743,0.0021384098,0.0012811414,0.0069840546],"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.0011576783,0.0004750733,0.0021421812,0.0008962018,0.00020182808,0.00028735306,0.0002552702,0.06994438,0.033813402,0.03191028,0.25103325,0.60788316],"study_design_scores_gemma":[0.00017690919,0.00017542033,0.0008114921,0.0000509257,0.000056942827,0.00015965503,0.0001762684,0.87822056,0.02886278,0.058694962,0.032563493,0.000050524188],"about_ca_topic_score_codex":0.0078084306,"about_ca_topic_score_gemma":0.022858372,"teacher_disagreement_score":0.018415947,"about_ca_system_score_codex":0.00083834596,"about_ca_system_score_gemma":0.0014891919,"threshold_uncertainty_score":0.06160754},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4244186,0.00067109975,0.56414026,0.00059039996,0.00007747464,0.000572879,0.00052180106,0.0043955566,0.00461197],"genre_scores_gemma":[0.8938685,0.00018667929,0.10331629,0.00009559473,0.000036440415,0.00020692719,0.0011318384,0.00016212699,0.000995703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996902,0.0007838918,0.00026567598,0.0005489317,0.0011250743,0.00037440922],"domain_scores_gemma":[0.995526,0.0015731285,0.0003292008,0.0011342652,0.0011164059,0.00032095416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002020942,0.0009230914,0.0008707805,0.0016654134,0.0011814496,0.0014412373,0.0019461495,0.0006243489,0.0008394063],"category_scores_gemma":[0.0077303904,0.0003267973,0.0004974548,0.0019207057,0.00057746784,0.0023924226,0.001529739,0.0004908485,0.0002139365],"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.001590213,0.0009352522,0.03263576,0.00043283726,0.0001995098,0.00077797327,0.0011891066,0.35128778,0.122787215,0.017433913,0.009666668,0.4610637],"study_design_scores_gemma":[0.00003491327,0.000082229846,0.0023251064,0.00000712195,0.000028392436,0.00022457537,0.00035241386,0.97343916,0.016466757,0.0053108595,0.0017102914,0.000018226436],"about_ca_topic_score_codex":0.0035229279,"about_ca_topic_score_gemma":0.0040385188,"teacher_disagreement_score":0.0035229279,"about_ca_system_score_codex":0.0012760784,"about_ca_system_score_gemma":0.0012868108,"threshold_uncertainty_score":0.010687888},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22513123,0.0025822287,0.68975645,0.0065378784,0.0003896267,0.00038119455,0.0032866807,0.003768115,0.068166584],"genre_scores_gemma":[0.8143554,0.0011320952,0.16819741,0.0011743839,0.00068589614,0.00038460392,0.0018980165,0.0007661955,0.011406049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99582124,0.0007102926,0.00018828356,0.0011636862,0.0012425627,0.00087397854],"domain_scores_gemma":[0.9811772,0.012028937,0.0012317254,0.0034757212,0.0012533162,0.00083303504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024521856,0.0019081716,0.0014477673,0.0021972677,0.0016595663,0.004451206,0.0028668165,0.0016273577,0.01430996],"category_scores_gemma":[0.022148715,0.00093210343,0.0014405203,0.0026063405,0.002836139,0.013257291,0.0031781856,0.004582493,0.003144251],"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.0011863385,0.0004313738,0.008261227,0.0009833276,0.00018701701,0.00044846276,0.0012845269,0.053933464,0.031116977,0.72937423,0.024165498,0.14862758],"study_design_scores_gemma":[0.00009763132,0.00027374906,0.0015830806,0.00011569145,0.00011088365,0.00047680733,0.00019955097,0.22224101,0.013034343,0.75074315,0.011000034,0.00012410211],"about_ca_topic_score_codex":0.001512257,"about_ca_topic_score_gemma":0.002472749,"teacher_disagreement_score":0.01430996,"about_ca_system_score_codex":0.002302599,"about_ca_system_score_gemma":0.002110702,"threshold_uncertainty_score":0.04787165},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22274317,0.00035054985,0.7712385,0.0008984917,0.000041455318,0.00015444499,0.0008409153,0.0012753055,0.0024571244],"genre_scores_gemma":[0.7983884,0.00025080665,0.19667631,0.00013397241,0.00006220072,0.00013007881,0.0017769155,0.00020908649,0.0023721813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999022,0.0003563571,0.00004557236,0.00027379245,0.00016797631,0.00013430313],"domain_scores_gemma":[0.9951389,0.003629703,0.00033849478,0.00042698602,0.00025580698,0.00021019403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010919055,0.0006430629,0.00094370963,0.0010282325,0.0005583136,0.00093391514,0.0012275747,0.000859744,0.002093161],"category_scores_gemma":[0.0077938735,0.0004184824,0.0006741918,0.0020585936,0.0008402894,0.002583186,0.001145252,0.0008227998,0.00022098339],"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.00031505304,0.00016101096,0.0030725144,0.00022149338,0.00007559405,0.00033101896,0.0002426373,0.8885345,0.005197696,0.037136093,0.0035278092,0.061184645],"study_design_scores_gemma":[0.000025005205,0.000020737298,0.00023599736,0.0000028841027,0.000007318848,0.000028600965,0.000049752838,0.96155715,0.0007824805,0.036923096,0.0003627558,0.000004169442],"about_ca_topic_score_codex":0.009177228,"about_ca_topic_score_gemma":0.010553715,"teacher_disagreement_score":0.009177228,"about_ca_system_score_codex":0.0010604131,"about_ca_system_score_gemma":0.0015455289,"threshold_uncertainty_score":0.018247664},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026155943,0.0002662366,0.4515039,0.0002694284,0.00013977695,0.00014442188,0.018409103,0.5166513,0.010000306],"genre_scores_gemma":[0.08527077,0.0012194405,0.593092,0.0011947543,0.00014049582,0.001384399,0.13686362,0.15211275,0.028721787],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941576,0.00008326668,0.000043206343,0.00012589188,0.00026174288,0.00007016025],"domain_scores_gemma":[0.9986168,0.00048091955,0.00011246974,0.00042460373,0.00027486891,0.000090237976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006312786,0.0019840572,0.00076939084,0.002430196,0.0006345514,0.0015776685,0.003142004,0.00082455523,0.055425726],"category_scores_gemma":[0.0037283993,0.0009839362,0.0014118468,0.0023636613,0.0005185404,0.0031431809,0.0019466885,0.0020235067,0.027904047],"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.00035296695,0.00021858189,0.0023796353,0.0017531344,0.0002070765,0.00043511676,0.00028712105,0.02459396,0.01203192,0.038277656,0.7078439,0.21161889],"study_design_scores_gemma":[0.00038979787,0.00012353722,0.002727799,0.000281933,0.00010506978,0.00071184954,0.00021075853,0.24278554,0.038482778,0.11207862,0.6018956,0.000206777],"about_ca_topic_score_codex":0.005115515,"about_ca_topic_score_gemma":0.009245584,"teacher_disagreement_score":0.055425726,"about_ca_system_score_codex":0.00080766977,"about_ca_system_score_gemma":0.0016718794,"threshold_uncertainty_score":0.18541753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004917012,0.00015693909,0.9835527,0.00028917508,0.00007884051,0.000112252616,0.00025072315,0.008043588,0.0025987762],"genre_scores_gemma":[0.16132152,0.00042201384,0.8323319,0.00024629798,0.0001378177,0.0002392574,0.0012426468,0.0012234454,0.0028351669],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988257,0.0002728574,0.00006951553,0.0002913057,0.00044899018,0.00009153858],"domain_scores_gemma":[0.9951499,0.0017170139,0.00023643968,0.0019323244,0.000795006,0.00016939064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012880537,0.0009765858,0.0006903605,0.0016610397,0.0008657488,0.0025043897,0.0028736633,0.0008876586,0.0055899993],"category_scores_gemma":[0.008849061,0.0006106337,0.00084747165,0.001674896,0.00094221416,0.0040072585,0.0021079148,0.0018885739,0.0022997283],"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.00044137638,0.0003645471,0.0044207796,0.0005558703,0.0001783223,0.00027972754,0.0006531037,0.17360915,0.031252317,0.18886131,0.038516656,0.56086683],"study_design_scores_gemma":[0.00003598005,0.000085937456,0.00073978683,0.000038607,0.00004920479,0.00015257632,0.00012539962,0.801759,0.015419197,0.15129519,0.030256363,0.000042756063],"about_ca_topic_score_codex":0.0040795305,"about_ca_topic_score_gemma":0.007468553,"teacher_disagreement_score":0.0055899993,"about_ca_system_score_codex":0.0011519376,"about_ca_system_score_gemma":0.0017532945,"threshold_uncertainty_score":0.018700361},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072891355,0.00037239495,0.87327754,0.00049805513,0.00010235228,0.0003798805,0.00074873783,0.049344398,0.0023853888],"genre_scores_gemma":[0.309564,0.00017296305,0.6838745,0.00027922235,0.000033748725,0.00025528908,0.0020287423,0.0015372038,0.002254344],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984333,0.00036526544,0.00010912074,0.0004353862,0.00053208467,0.00012485615],"domain_scores_gemma":[0.996874,0.0009565736,0.0002695132,0.0011964146,0.0005269249,0.00017655194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013712745,0.0010979783,0.00067992095,0.001423866,0.0008232531,0.0010168256,0.0030280824,0.0009241654,0.0029785212],"category_scores_gemma":[0.006438981,0.00051929866,0.0005312807,0.0020343473,0.00056848,0.0026314063,0.0015733031,0.0010574441,0.0010384208],"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.0013790041,0.0008223874,0.0057877107,0.00052367954,0.00017019018,0.00038371296,0.00076027535,0.13553672,0.14671896,0.011786297,0.03251888,0.6636122],"study_design_scores_gemma":[0.000109670276,0.00018205652,0.0013514133,0.00001127148,0.000028051996,0.0001809575,0.0001626675,0.94433576,0.038253717,0.007893997,0.007464036,0.000026450101],"about_ca_topic_score_codex":0.0037644801,"about_ca_topic_score_gemma":0.005777189,"teacher_disagreement_score":0.0037644801,"about_ca_system_score_codex":0.001072621,"about_ca_system_score_gemma":0.0011254482,"threshold_uncertainty_score":0.009964168},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013440857,0.00013340604,0.9756994,0.00045648165,0.00004389047,0.00027008244,0.0010970882,0.0065266276,0.0023320597],"genre_scores_gemma":[0.16903107,0.00023549062,0.82234496,0.00034054246,0.000049397444,0.000379941,0.0039356947,0.0012185145,0.0024643294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993026,0.0015686895,0.0006098966,0.0016961618,0.00251958,0.0005796941],"domain_scores_gemma":[0.98272437,0.009591994,0.0013835673,0.0039004195,0.0020489849,0.00035074633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032078854,0.0013656567,0.0013298221,0.0027339722,0.0017581041,0.004251257,0.004190778,0.0013131015,0.00625209],"category_scores_gemma":[0.025639992,0.001073674,0.00254038,0.0040526805,0.0020248804,0.008414513,0.00426001,0.0021908153,0.001955022],"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.00055932027,0.00037781653,0.007645614,0.0012333448,0.00027962917,0.00091766584,0.000644568,0.32374737,0.02333977,0.19585046,0.020577068,0.4248273],"study_design_scores_gemma":[0.000065323686,0.00005416877,0.00039628925,0.000055488264,0.000058983915,0.0001701038,0.00020234415,0.77128553,0.016757213,0.20278129,0.008131511,0.00004166141],"about_ca_topic_score_codex":0.011286127,"about_ca_topic_score_gemma":0.016654845,"teacher_disagreement_score":0.011286127,"about_ca_system_score_codex":0.0018267549,"about_ca_system_score_gemma":0.0047737225,"threshold_uncertainty_score":0.02244091},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77541095,0.03001356,0.1416622,0.0036732722,0.001741746,0.0015342311,0.009987494,0.013757043,0.022219539],"genre_scores_gemma":[0.81327313,0.0025342149,0.16695122,0.00052733545,0.00026204597,0.00031120804,0.0134060355,0.00038085127,0.0023539285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.96882355,0.011150079,0.0039678556,0.004956451,0.009671747,0.0014303413],"domain_scores_gemma":[0.9303657,0.052126937,0.00271519,0.0069019394,0.005975848,0.0019144273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01957219,0.0025907957,0.004006983,0.010942462,0.0018028214,0.003671443,0.0050805286,0.0037395037,0.005023197],"category_scores_gemma":[0.074587345,0.00060164405,0.0014289402,0.014305266,0.0011788163,0.009629718,0.0028124696,0.0012388794,0.0011358557],"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.009024603,0.003987796,0.03277577,0.003152034,0.0014034165,0.00090404693,0.00040979317,0.24894215,0.007949774,0.012627545,0.047081597,0.63174146],"study_design_scores_gemma":[0.00053428265,0.0010989979,0.006736073,0.00008535911,0.0002259451,0.00057220977,0.0004904343,0.9719087,0.005390056,0.008479563,0.0044335173,0.000044833636],"about_ca_topic_score_codex":0.01577646,"about_ca_topic_score_gemma":0.011088645,"teacher_disagreement_score":0.01957219,"about_ca_system_score_codex":0.0040238844,"about_ca_system_score_gemma":0.0028197325,"threshold_uncertainty_score":0.10350883},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028435092,0.0001980502,0.96601725,0.0005925591,0.00006875795,0.00022470018,0.00057730265,0.0013638278,0.0025224285],"genre_scores_gemma":[0.37947774,0.00037535498,0.61502534,0.00019278805,0.00007702302,0.00028163425,0.0016821986,0.0002942048,0.0025937916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947583,0.0014434546,0.00057699066,0.0014143212,0.0013806635,0.00042624146],"domain_scores_gemma":[0.9848251,0.0066129304,0.002092601,0.0043493346,0.001647136,0.0004730174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002676037,0.0012107446,0.001317666,0.0056630517,0.0013879859,0.0035275074,0.0024037769,0.002576675,0.0033996722],"category_scores_gemma":[0.024194947,0.0007150205,0.0015482242,0.0044403244,0.0021793055,0.010401372,0.0035999494,0.0020556767,0.00076321623],"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.000402767,0.0004662827,0.025263656,0.0005928094,0.00023148501,0.00087774254,0.0010280819,0.21841562,0.0067027337,0.39268297,0.009306512,0.34402928],"study_design_scores_gemma":[0.000029031204,0.000085473235,0.00091536884,0.00006137688,0.000054278564,0.0007144632,0.00027710077,0.6886175,0.003917834,0.29811502,0.0071677137,0.00004483988],"about_ca_topic_score_codex":0.003446104,"about_ca_topic_score_gemma":0.003232073,"teacher_disagreement_score":0.0056630517,"about_ca_system_score_codex":0.0014947924,"about_ca_system_score_gemma":0.001593205,"threshold_uncertainty_score":0.014152408},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009234971,0.0026000051,0.9407158,0.0033397847,0.0011084583,0.00041233146,0.005109787,0.022289654,0.015189282],"genre_scores_gemma":[0.12143849,0.0039901435,0.8435921,0.0023908473,0.00036746744,0.00040097506,0.011967137,0.0038390993,0.0120137585],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975326,0.00042786926,0.0003156443,0.00046525427,0.0011146404,0.00014410281],"domain_scores_gemma":[0.99671704,0.0005398389,0.0001211792,0.0015549978,0.00086061936,0.00020628063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019686588,0.0006273961,0.00061144895,0.002424289,0.0007721312,0.0044305963,0.0026111347,0.00085809524,0.005715308],"category_scores_gemma":[0.0068045887,0.0005028304,0.0010005787,0.004760567,0.0008258023,0.00589251,0.003569215,0.0020659803,0.0036064256],"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.0005724602,0.00029064209,0.0036833114,0.0013111745,0.00022388081,0.0022412606,0.001695461,0.00859179,0.021901365,0.26602158,0.17093228,0.5225348],"study_design_scores_gemma":[0.00013148192,0.0001313552,0.0017970463,0.00033326974,0.00017148067,0.0027938285,0.0011232402,0.04633382,0.045043454,0.17865367,0.72332424,0.0001631123],"about_ca_topic_score_codex":0.0047913436,"about_ca_topic_score_gemma":0.003492263,"teacher_disagreement_score":0.005715308,"about_ca_system_score_codex":0.0007231771,"about_ca_system_score_gemma":0.0012023579,"threshold_uncertainty_score":0.01911962},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011177834,0.022216765,0.03335076,0.022098595,0.015928345,0.00023907,0.006771306,0.012219116,0.87599814],"genre_scores_gemma":[0.075618744,0.011842896,0.012334704,0.005114868,0.0031958534,0.00022113776,0.0041043926,0.0027913875,0.88477606],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871993,0.00016405727,0.000065295324,0.0005668113,0.00035045287,0.00013350563],"domain_scores_gemma":[0.9985821,0.00038484664,0.00015019854,0.00026284327,0.0003507762,0.0002691393],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00065353775,0.001278565,0.0010387573,0.0017771306,0.0015154869,0.0039809654,0.0016779308,0.002326123,0.3953781],"category_scores_gemma":[0.0032458,0.00043452322,0.00064915605,0.0011871646,0.00088992994,0.0030876922,0.0025395078,0.002053165,0.2738654],"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.0004918769,0.0001367595,0.0012890106,0.0010109671,0.000040610004,0.0010399853,0.0004933457,0.0014034583,0.0035390053,0.05419915,0.514095,0.42226088],"study_design_scores_gemma":[0.000017640934,0.000036922385,0.00038285382,0.00013098565,0.000012852609,0.0007094853,0.00007226819,0.0007332131,0.0016582101,0.007593143,0.98863363,0.000018654837],"about_ca_topic_score_codex":0.0012261285,"about_ca_topic_score_gemma":0.0012926032,"teacher_disagreement_score":0.6046219,"about_ca_system_score_codex":0.0013273628,"about_ca_system_score_gemma":0.0010993116,"threshold_uncertainty_score":0},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009185429,0.00091990066,0.47537997,0.00080249057,0.00035871495,0.00044584848,0.008804558,0.46929905,0.034804136],"genre_scores_gemma":[0.18294932,0.0015857258,0.59283847,0.0024824378,0.00016410399,0.0010794958,0.081052706,0.093815066,0.044032726],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99867344,0.0001610974,0.000071844945,0.00043557442,0.0005145524,0.00014360911],"domain_scores_gemma":[0.99840873,0.0004224636,0.00008174506,0.00066311,0.00028401086,0.00013999936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009812658,0.0015734215,0.0007134693,0.0013457009,0.0006001559,0.0023268887,0.0048885457,0.0010169515,0.03669678],"category_scores_gemma":[0.004363192,0.0011787602,0.001521137,0.0010346427,0.0008729962,0.005543541,0.0046075573,0.0026650766,0.015466705],"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.0012573111,0.00043208798,0.0043832725,0.0015170833,0.0003050341,0.00056812743,0.000690204,0.026523862,0.026898813,0.09313189,0.46748918,0.3768032],"study_design_scores_gemma":[0.00034505065,0.00022118153,0.001975511,0.0001763149,0.00006914811,0.00059684797,0.00020573451,0.2050121,0.025857478,0.07643342,0.68894047,0.00016673892],"about_ca_topic_score_codex":0.0033809962,"about_ca_topic_score_gemma":0.0067918007,"teacher_disagreement_score":0.03669678,"about_ca_system_score_codex":0.0009960448,"about_ca_system_score_gemma":0.0013692576,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030772742,0.00021255447,0.87498647,0.0002009675,0.00007007511,0.00020013055,0.0015336196,0.11803631,0.001682669],"genre_scores_gemma":[0.05792679,0.00030774728,0.9209162,0.00022112811,0.000052591244,0.0005567049,0.0071094735,0.009587699,0.003321708],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990577,0.0001642618,0.00006584853,0.0003579882,0.00026338958,0.00009068752],"domain_scores_gemma":[0.99766004,0.0008729044,0.00014873354,0.00082770415,0.00025101073,0.00023949875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019340503,0.0020883658,0.0011034796,0.0020881165,0.0011564101,0.002378378,0.0055121956,0.0012856416,0.0135155525],"category_scores_gemma":[0.0064705824,0.0016237206,0.0022464402,0.0025374577,0.0014551579,0.0051282765,0.003597048,0.002222544,0.0051587075],"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.0018752833,0.00038363022,0.0067139342,0.0024657256,0.00064589625,0.000635956,0.0013500939,0.12568842,0.034973163,0.10076081,0.22938293,0.4951242],"study_design_scores_gemma":[0.0004968214,0.00013960162,0.0012669303,0.00009348772,0.000102922444,0.00033865968,0.00021057033,0.8030759,0.013061706,0.11618161,0.06491665,0.0001150985],"about_ca_topic_score_codex":0.0058491286,"about_ca_topic_score_gemma":0.012011259,"teacher_disagreement_score":0.0135155525,"about_ca_system_score_codex":0.001110663,"about_ca_system_score_gemma":0.0020893875,"threshold_uncertainty_score":0.045214057},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069235116,0.001136486,0.03194841,0.00372552,0.0029283075,0.00053781114,0.007989313,0.007551071,0.9372597],"genre_scores_gemma":[0.07738261,0.0018415616,0.023437573,0.004433373,0.0007169144,0.0005674273,0.0183241,0.0028286157,0.87046784],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986859,0.00016089888,0.00008324937,0.00037728698,0.00046209595,0.00023064586],"domain_scores_gemma":[0.9982363,0.00022089292,0.00008754603,0.0005013713,0.00069561915,0.00025821058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010112739,0.00094954413,0.0006517414,0.0014406822,0.0020756016,0.0045997393,0.0020744877,0.001958848,0.43846464],"category_scores_gemma":[0.004137967,0.0004187009,0.000711045,0.0013725093,0.0007114103,0.003251241,0.0032091604,0.0013980337,0.27387685],"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.00041817932,0.00017165534,0.002781169,0.0005589495,0.00003447464,0.00043297312,0.0006113672,0.001190553,0.0040482716,0.10353398,0.50137115,0.38484722],"study_design_scores_gemma":[0.00002290991,0.000042595097,0.00073068077,0.000099199155,0.0000111323525,0.00019552492,0.00019574974,0.0007987027,0.0013682161,0.0103032235,0.9862179,0.00001421543],"about_ca_topic_score_codex":0.0032607752,"about_ca_topic_score_gemma":0.003791735,"teacher_disagreement_score":0.43846464,"about_ca_system_score_codex":0.0013623481,"about_ca_system_score_gemma":0.0020561032,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043112583,0.00059386884,0.92021066,0.00067107787,0.00041638658,0.00013101225,0.0009614378,0.019979455,0.013923503],"genre_scores_gemma":[0.25142458,0.0003655234,0.73219883,0.00043995524,0.00008185219,0.00032001655,0.002874428,0.0025414221,0.009753316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994672,0.00007864158,0.0000312119,0.00011429936,0.00020661026,0.00010208782],"domain_scores_gemma":[0.9991842,0.00018426927,0.000041882173,0.00025259776,0.00026373388,0.00007324674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048071382,0.0012912435,0.0006883256,0.00067976903,0.00042853513,0.0015069849,0.0017042737,0.0006351477,0.015764253],"category_scores_gemma":[0.0028476028,0.00043696168,0.0007702958,0.0015092079,0.00060522516,0.0020946267,0.0014649649,0.0017373413,0.0058288258],"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.00094896194,0.00031911655,0.003693715,0.0005866369,0.00016424395,0.0003155943,0.00041794864,0.2389547,0.049926523,0.06542263,0.11128376,0.5279662],"study_design_scores_gemma":[0.00010597805,0.00009933468,0.00047674685,0.00002434129,0.000021922846,0.000083969164,0.00012499848,0.9284353,0.013151846,0.031978033,0.02547197,0.000025619041],"about_ca_topic_score_codex":0.0058148466,"about_ca_topic_score_gemma":0.011646757,"teacher_disagreement_score":0.015764253,"about_ca_system_score_codex":0.0010094095,"about_ca_system_score_gemma":0.0015396139,"threshold_uncertainty_score":0.0527367},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9020274,0.00024883906,0.088957824,0.00014906986,0.00007404499,0.00013575815,0.00011584027,0.003543132,0.0047480217],"genre_scores_gemma":[0.96599966,0.000059896127,0.03312394,0.000035535915,0.0000086889395,0.000027271599,0.00013720602,0.0000939032,0.0005139142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992505,0.0001667449,0.000049374004,0.00015963634,0.00019915303,0.0001746147],"domain_scores_gemma":[0.99852294,0.0005168952,0.00014422165,0.00032531394,0.00029115824,0.00019944274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008485545,0.0007697227,0.0004231564,0.0007820853,0.0006631441,0.00092081924,0.0016871933,0.00025943067,0.0015644961],"category_scores_gemma":[0.002593033,0.0002465528,0.0002793153,0.000946879,0.0005381379,0.0011988705,0.00064690545,0.0003729718,0.00029384394],"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.0022418874,0.0008042822,0.016698776,0.00035265446,0.00016333308,0.0005690825,0.00036528488,0.6715553,0.09364281,0.007254307,0.0057163686,0.20063591],"study_design_scores_gemma":[0.000097039716,0.0005101444,0.0033564377,0.000009184473,0.00003940852,0.000073113886,0.0002059042,0.95099306,0.040310547,0.0026672108,0.0017162177,0.000021801528],"about_ca_topic_score_codex":0.0054159337,"about_ca_topic_score_gemma":0.008427123,"teacher_disagreement_score":0.0054159337,"about_ca_system_score_codex":0.0011237251,"about_ca_system_score_gemma":0.0011001371,"threshold_uncertainty_score":0.010768831},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02579989,0.00032534183,0.87564415,0.00039686885,0.0003618453,0.00006716075,0.00024778757,0.0020021556,0.09515475],"genre_scores_gemma":[0.29737285,0.00089296355,0.5729382,0.00037787313,0.00033744486,0.00027989506,0.001072639,0.0024131674,0.12431492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995751,0.00009203098,0.000019312094,0.00007583775,0.00016457037,0.0000731793],"domain_scores_gemma":[0.9992767,0.0002620454,0.000030301917,0.00023774871,0.00012526242,0.00006797079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036430362,0.0007027086,0.00079090305,0.0014721432,0.0011884408,0.0017061188,0.0015266364,0.00068217056,0.016847646],"category_scores_gemma":[0.001913629,0.00046889108,0.0008562355,0.0022960957,0.0009808845,0.0032378125,0.00263626,0.0025186338,0.0049365447],"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.00003407994,0.000031656735,0.00014609197,0.00009522709,0.000007759977,0.00008085102,0.00014782815,0.007636331,0.0029153528,0.89269847,0.010740792,0.08546551],"study_design_scores_gemma":[0.000007129422,0.000012185092,0.00009826107,0.0000306712,0.000007668642,0.00010422089,0.00006228574,0.061735354,0.0022900342,0.91099405,0.024646329,0.000011817666],"about_ca_topic_score_codex":0.0014553955,"about_ca_topic_score_gemma":0.0025673076,"teacher_disagreement_score":0.016847646,"about_ca_system_score_codex":0.0008369839,"about_ca_system_score_gemma":0.00050385785,"threshold_uncertainty_score":0.05636096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056640737,0.008614898,0.8329788,0.004006911,0.0012975917,0.00019968458,0.004680851,0.018329315,0.07325122],"genre_scores_gemma":[0.3968823,0.00461554,0.5142094,0.0004939491,0.0009997468,0.00023729881,0.0060068876,0.0023611493,0.07419374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999191,0.00018189599,0.00005956264,0.00015544522,0.0003000786,0.00011204138],"domain_scores_gemma":[0.9979518,0.00068576174,0.000095677344,0.0007970478,0.00033885418,0.00013092568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092067575,0.0005506353,0.0010539417,0.0012227626,0.001008973,0.0033049092,0.0015642846,0.001024243,0.014062551],"category_scores_gemma":[0.0073873713,0.0005180192,0.0004829319,0.002869151,0.0005899829,0.0059789526,0.0013912547,0.0014667796,0.005433941],"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.00023455055,0.00015458671,0.00138694,0.00045871598,0.00007083161,0.0001608455,0.00029622382,0.1529716,0.0041535986,0.25380346,0.17899682,0.40731195],"study_design_scores_gemma":[0.000027830974,0.000039527058,0.00056943914,0.00006311715,0.000023395769,0.00019086649,0.000084753294,0.61092407,0.0024350234,0.335183,0.050430946,0.000028058728],"about_ca_topic_score_codex":0.0045596357,"about_ca_topic_score_gemma":0.008148032,"teacher_disagreement_score":0.014062551,"about_ca_system_score_codex":0.0014954887,"about_ca_system_score_gemma":0.0010541104,"threshold_uncertainty_score":0.04704392},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013102788,0.00006781791,0.9849615,0.00006181679,0.000019516643,0.000022222783,0.000041419073,0.00040495675,0.0013179943],"genre_scores_gemma":[0.29011938,0.00041623192,0.70466393,0.00008298013,0.000048300295,0.000063974745,0.00043585297,0.00030135567,0.0038679175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996008,0.0000675286,0.000017319044,0.0001464881,0.00013589785,0.00003200182],"domain_scores_gemma":[0.99946815,0.00013755495,0.000076070035,0.00017963335,0.000107953914,0.000030776602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000301733,0.00058003946,0.0005482963,0.0016253624,0.00032854793,0.0008966078,0.0006677776,0.0007989221,0.0021437327],"category_scores_gemma":[0.00161672,0.00036614912,0.0010175402,0.0012809016,0.00090960873,0.0012829395,0.00094787544,0.0010246797,0.0010333871],"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.00018696584,0.00009106731,0.001656668,0.00021561419,0.00009672944,0.0005051463,0.00040219002,0.23164402,0.13903277,0.13530497,0.0038560862,0.4870078],"study_design_scores_gemma":[0.000014445388,0.00007146319,0.0009688724,0.000016550162,0.000029115108,0.00046559965,0.00008651122,0.9229181,0.024567874,0.044689238,0.0061435546,0.000028639128],"about_ca_topic_score_codex":0.0011599495,"about_ca_topic_score_gemma":0.0015076409,"teacher_disagreement_score":0.0021437327,"about_ca_system_score_codex":0.00030231354,"about_ca_system_score_gemma":0.0003909287,"threshold_uncertainty_score":0.0071715117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18862331,0.0021220318,0.74349487,0.0008115811,0.0002307048,0.00044265715,0.0025052754,0.050518915,0.011250669],"genre_scores_gemma":[0.48470262,0.000734021,0.50561166,0.00026717785,0.0001315337,0.00030888454,0.0032708154,0.0015629067,0.0034103438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980586,0.00046058587,0.00022010255,0.00030321217,0.00077167636,0.00018581747],"domain_scores_gemma":[0.9959506,0.0012434406,0.00028651126,0.0018088667,0.00047734412,0.00023319804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016821144,0.00074983254,0.0005865599,0.0017527179,0.0011581243,0.0031821902,0.0033738744,0.00075896364,0.0028996167],"category_scores_gemma":[0.0066427104,0.0005387171,0.0004125147,0.0043954444,0.000920817,0.0061814496,0.002671729,0.0010304075,0.0012573645],"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.0018573893,0.00076593563,0.0094592525,0.0008140139,0.00017670398,0.00036908366,0.0012824282,0.12567843,0.08301679,0.13120496,0.06270982,0.5826652],"study_design_scores_gemma":[0.00044225878,0.0006943155,0.0029190835,0.00007421731,0.00013892328,0.0004969477,0.00052425475,0.7469584,0.08343969,0.090410106,0.0737389,0.00016291154],"about_ca_topic_score_codex":0.0047942293,"about_ca_topic_score_gemma":0.0055552754,"teacher_disagreement_score":0.0047942293,"about_ca_system_score_codex":0.0014329576,"about_ca_system_score_gemma":0.0015655027,"threshold_uncertainty_score":0.010396838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22072889,0.005166359,0.72648644,0.00073625275,0.0007842824,0.00019704226,0.00088182435,0.021743104,0.023275835],"genre_scores_gemma":[0.6209747,0.0010695128,0.36295745,0.00034560412,0.0000892571,0.000080520105,0.0008899476,0.00021256752,0.013380507],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99971634,0.000030570445,0.00002264448,0.000069573194,0.0001020825,0.000058692087],"domain_scores_gemma":[0.99952376,0.00012948211,0.00002648499,0.00012555212,0.00016695839,0.000027774593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027995437,0.00059799163,0.00040983013,0.0011330994,0.0004408884,0.0011761362,0.0009901645,0.00036007803,0.009720615],"category_scores_gemma":[0.0009123225,0.00027797557,0.00034833964,0.0012223904,0.00018028963,0.0010597081,0.00035877235,0.00045821854,0.0018900271],"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.0012387974,0.00023669234,0.006039962,0.00040298374,0.0001738751,0.00027523018,0.00014731081,0.021152388,0.09615169,0.01290344,0.025282545,0.8359951],"study_design_scores_gemma":[0.0002641547,0.0009333757,0.0060794987,0.00014878596,0.0002818963,0.00094471034,0.00034047835,0.7023188,0.2065157,0.018531036,0.06355913,0.00008246187],"about_ca_topic_score_codex":0.007161114,"about_ca_topic_score_gemma":0.011732205,"teacher_disagreement_score":0.009720615,"about_ca_system_score_codex":0.00074969034,"about_ca_system_score_gemma":0.000993777,"threshold_uncertainty_score":0.032518744},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011045421,0.00035329742,0.9752842,0.0002948031,0.00004593158,0.00015321042,0.0007982652,0.010379128,0.00164577],"genre_scores_gemma":[0.085213,0.00029904593,0.90962833,0.00017662313,0.000028774068,0.00021971297,0.002316628,0.0007817409,0.0013361407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988514,0.0002433347,0.000121600475,0.00033007344,0.00037930833,0.000074273354],"domain_scores_gemma":[0.997276,0.0009834305,0.00020918026,0.0012289693,0.00024475367,0.000057637695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096910587,0.00086077634,0.0007003089,0.0018979062,0.00073257776,0.0009807018,0.0017408478,0.0006448366,0.004489582],"category_scores_gemma":[0.0060935463,0.0006447192,0.0012536824,0.0031830615,0.00081953686,0.004003287,0.0017991071,0.0014057799,0.0015166447],"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.0003150131,0.00022167491,0.003917957,0.0006267204,0.0001163968,0.00028999313,0.0003091875,0.04640916,0.030439062,0.06410334,0.022380907,0.83087057],"study_design_scores_gemma":[0.00009273164,0.00015325242,0.0013327983,0.00006072884,0.0000658884,0.0006715236,0.00014929571,0.6591947,0.03741203,0.26225892,0.03856561,0.000042624975],"about_ca_topic_score_codex":0.0015155078,"about_ca_topic_score_gemma":0.002732119,"teacher_disagreement_score":0.004489582,"about_ca_system_score_codex":0.00065477024,"about_ca_system_score_gemma":0.0010113978,"threshold_uncertainty_score":0.015019119},"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":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023145644,0.106357895,0.3078909,0.45289847,0.017144864,0.00015261295,0.0024367278,0.005697962,0.084274955],"genre_scores_gemma":[0.48171854,0.085785285,0.2698524,0.08724675,0.018158916,0.00036866943,0.0045031183,0.004166299,0.04820006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99628395,0.0012503165,0.00009090354,0.0005986728,0.0012767717,0.00049952336],"domain_scores_gemma":[0.9704283,0.014532004,0.0008014298,0.006175839,0.00427067,0.0037917853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007913732,0.000834813,0.0010330628,0.0018703439,0.0027221953,0.007211911,0.002409007,0.0044641756,0.019731063],"category_scores_gemma":[0.030501137,0.0007099941,0.0006796123,0.002413703,0.0071338904,0.036177386,0.0063971556,0.0068263505,0.00735206],"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.000204819,0.0000674461,0.0012579333,0.0006926771,0.000072041126,0.00012714979,0.0005978203,0.004099139,0.0021560753,0.5207117,0.342995,0.12701821],"study_design_scores_gemma":[0.000015677191,0.000025061354,0.00048200125,0.00020673666,0.000016169011,0.00010920657,0.0007209374,0.0058315042,0.0007910514,0.71839225,0.27336884,0.000040554136],"about_ca_topic_score_codex":0.0024417718,"about_ca_topic_score_gemma":0.0037051698,"teacher_disagreement_score":0.019731063,"about_ca_system_score_codex":0.001939831,"about_ca_system_score_gemma":0.0029389998,"threshold_uncertainty_score":0.06600702},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042172433,0.010395746,0.01986353,0.027137047,0.058644705,0.001794793,0.028810998,0.010734256,0.8384016],"genre_scores_gemma":[0.012438909,0.005013454,0.0039582844,0.0022722345,0.008798596,0.00043163312,0.009685926,0.001473883,0.9559271],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99948704,0.00008460366,0.000022640064,0.0001459356,0.00014924456,0.00011045589],"domain_scores_gemma":[0.99744606,0.00051796774,0.000056937617,0.00040446362,0.0005697708,0.001004727],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011745207,0.0020118828,0.0018572578,0.0009730574,0.0014880735,0.0042260396,0.0014840495,0.0028287033,0.80540395],"category_scores_gemma":[0.003120084,0.00031902775,0.0013126289,0.0014330081,0.0003211425,0.0018325285,0.0021119718,0.0024188533,0.6584736],"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.00018542426,0.00014646655,0.00009873857,0.00016943508,0.0000138210635,0.000039867442,0.000013126566,0.00011678133,0.00081343774,0.00079938327,0.9393979,0.05820559],"study_design_scores_gemma":[0.00009486829,0.00020618516,0.00087763503,0.000108031185,0.00001865886,0.00011470516,0.00003978557,0.0006946629,0.0010693594,0.0031991876,0.993561,0.000015847672],"about_ca_topic_score_codex":0.0010380247,"about_ca_topic_score_gemma":0.0027131063,"teacher_disagreement_score":0.19459605,"about_ca_system_score_codex":0.0007426242,"about_ca_system_score_gemma":0.0013338063,"threshold_uncertainty_score":0.27756757},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29222766,0.00047908947,0.69869614,0.0010701901,0.00008152809,0.00018079224,0.00023022329,0.0035749497,0.0034594247],"genre_scores_gemma":[0.88404226,0.000066141,0.11472083,0.0001132869,0.00004586818,0.00009535775,0.00018812841,0.0001899793,0.00053824205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945194,0.0014629398,0.00032601503,0.0014855472,0.0013790103,0.0008270432],"domain_scores_gemma":[0.9841303,0.009797818,0.0011652568,0.003268433,0.0010741879,0.0005639633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051711127,0.0010677436,0.001618126,0.00097423175,0.0012556537,0.0027694218,0.0030585013,0.0013887198,0.0015918564],"category_scores_gemma":[0.021312904,0.0006748031,0.0008730162,0.0013365141,0.0029224132,0.005713324,0.002883933,0.0012594872,0.00030526306],"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.0013296445,0.0002738374,0.0048997803,0.00014033649,0.00011458104,0.00018183282,0.00031675166,0.87225056,0.01727868,0.023750922,0.0024786885,0.07698438],"study_design_scores_gemma":[0.000032656702,0.00005097751,0.00016216401,0.0000034652207,0.000012611875,0.000023362965,0.00004155096,0.9792029,0.004240832,0.01601687,0.00020643981,0.0000061358073],"about_ca_topic_score_codex":0.0037516118,"about_ca_topic_score_gemma":0.0044871,"teacher_disagreement_score":0.0051711127,"about_ca_system_score_codex":0.0026276845,"about_ca_system_score_gemma":0.0026788306,"threshold_uncertainty_score":0.027347744},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04186416,0.00010022989,0.9567745,0.000089991096,0.0000147879555,0.000019533341,0.00009879216,0.00034685267,0.00069118995],"genre_scores_gemma":[0.9294767,0.00020290271,0.06869407,0.000039955703,0.00001828008,0.00010065681,0.0002649949,0.000057975583,0.0011444723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998265,0.000044467586,0.000009193205,0.000055724762,0.00004641171,0.00001779081],"domain_scores_gemma":[0.9994438,0.00030790083,0.00009130045,0.00008208084,0.000056455698,0.00001848714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031077192,0.0005072979,0.00072107645,0.00049133296,0.00019235749,0.0005071508,0.0004806467,0.00072154764,0.0009171361],"category_scores_gemma":[0.0023226852,0.00039278096,0.00066725054,0.00039124393,0.00039729642,0.0007327219,0.00077589473,0.0006750617,0.00026397395],"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.000067691915,0.000038273338,0.0010489086,0.000079506455,0.0000851141,0.000096044605,0.00006912518,0.9267421,0.009259906,0.020005425,0.00035080867,0.042157073],"study_design_scores_gemma":[0.0000021171898,0.0000077532195,0.0002804107,0.0000026001603,0.00000463018,0.000009442378,0.0000039189986,0.9928013,0.0004886191,0.00628828,0.00010797617,0.0000029444575],"about_ca_topic_score_codex":0.0030503497,"about_ca_topic_score_gemma":0.0036432266,"teacher_disagreement_score":0.0030503497,"about_ca_system_score_codex":0.0003636731,"about_ca_system_score_gemma":0.0005012956,"threshold_uncertainty_score":0.00606519},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017735137,0.0006202755,0.9774759,0.00021165346,0.000080057885,0.00007741183,0.0005115244,0.0020612397,0.0012268281],"genre_scores_gemma":[0.20066045,0.00072074356,0.78956187,0.00020546852,0.00012892074,0.00017270399,0.0035446144,0.00047692284,0.004528372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991054,0.0001403621,0.000052052437,0.0003040238,0.00033687017,0.00006127033],"domain_scores_gemma":[0.9991493,0.00021130453,0.00011839214,0.00019497165,0.00026801345,0.00005800737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037648226,0.0011650076,0.0012073289,0.004426892,0.00055674487,0.0012235373,0.0015831242,0.00142574,0.00217839],"category_scores_gemma":[0.0017754956,0.00038375283,0.0011829479,0.0037130993,0.0006102374,0.0018876133,0.0012067845,0.0013134067,0.0016397795],"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.00016148147,0.00022171013,0.0022214137,0.0002558916,0.00014420021,0.00017735778,0.000141653,0.1028035,0.024584511,0.012212009,0.0098274555,0.8472488],"study_design_scores_gemma":[0.0000103922075,0.00006791846,0.0008445748,0.000015154846,0.000021168991,0.00018818873,0.00005631304,0.97192746,0.0061876928,0.01490882,0.005748857,0.00002338073],"about_ca_topic_score_codex":0.0031525702,"about_ca_topic_score_gemma":0.004233732,"teacher_disagreement_score":0.004426892,"about_ca_system_score_codex":0.0006656506,"about_ca_system_score_gemma":0.0005124442,"threshold_uncertainty_score":0.0072875023},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3344406,0.07169494,0.5719479,0.0025648533,0.00086456514,0.00083458686,0.0016162627,0.0015357166,0.014500712],"genre_scores_gemma":[0.41013217,0.022559593,0.560777,0.00020722614,0.00032337225,0.0006024905,0.0024780703,0.0003250696,0.0025950656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99237895,0.0034886023,0.0006945282,0.0006186872,0.002640166,0.00017904874],"domain_scores_gemma":[0.97642493,0.017590035,0.00084975554,0.0018405115,0.0029847997,0.00031005745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011216397,0.0014520143,0.0012251175,0.0066801864,0.0005977987,0.0021692943,0.0008306156,0.0012632128,0.0013805204],"category_scores_gemma":[0.027371792,0.0003327654,0.0014576364,0.006069103,0.00067521416,0.0030814193,0.0015770362,0.0011022929,0.0006301197],"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.002003926,0.0006588312,0.011068436,0.0028720086,0.0018313439,0.00009684408,0.00068799185,0.054613195,0.0060677216,0.015115678,0.005279154,0.8997049],"study_design_scores_gemma":[0.0009766693,0.004377232,0.056400623,0.0008392864,0.0013989926,0.0010501696,0.0016903018,0.8367925,0.019766504,0.05244319,0.02384939,0.0004151802],"about_ca_topic_score_codex":0.0016521425,"about_ca_topic_score_gemma":0.002311876,"teacher_disagreement_score":0.011216397,"about_ca_system_score_codex":0.0007388519,"about_ca_system_score_gemma":0.00090807985,"threshold_uncertainty_score":0.05931872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022453643,0.0006067167,0.91020936,0.00042249993,0.00022299182,0.00022674505,0.0011989735,0.04945886,0.015200182],"genre_scores_gemma":[0.23580113,0.0004661588,0.7415427,0.00043105407,0.00005130934,0.0003538157,0.0036056158,0.0040549506,0.013693331],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996779,0.00005850029,0.000019282701,0.00007342899,0.00013768778,0.000033268654],"domain_scores_gemma":[0.9993849,0.00019410063,0.00003282478,0.00021849001,0.00012001025,0.00004965085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055451266,0.00084008364,0.0004669184,0.00073380047,0.00055202784,0.0011687824,0.0021324058,0.0005887244,0.010115371],"category_scores_gemma":[0.001847317,0.00038367984,0.0008210443,0.0007751528,0.00061314047,0.0020537141,0.0015025889,0.000968338,0.002933494],"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.0007182235,0.00040120978,0.003634833,0.0012599217,0.00034566165,0.00039179504,0.00039608352,0.26085708,0.036352623,0.18734945,0.06966677,0.43862635],"study_design_scores_gemma":[0.00013010098,0.000108373875,0.0005346093,0.000051729574,0.00004554031,0.00014277996,0.000077537035,0.84298867,0.016763099,0.09433379,0.04477796,0.00004585855],"about_ca_topic_score_codex":0.004918238,"about_ca_topic_score_gemma":0.010896642,"teacher_disagreement_score":0.010115371,"about_ca_system_score_codex":0.00089806766,"about_ca_system_score_gemma":0.0013359669,"threshold_uncertainty_score":0.033839345},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012116607,0.03502611,0.58145154,0.01105653,0.08820539,0.00081292406,0.0020865684,0.008914083,0.26033023],"genre_scores_gemma":[0.0657812,0.022676636,0.22382994,0.0030602834,0.012362858,0.00091259123,0.009526706,0.0036165453,0.6582333],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99843496,0.00036893904,0.00011693799,0.0002529691,0.00064780965,0.00017838209],"domain_scores_gemma":[0.9969368,0.00053745904,0.000093538736,0.0006881008,0.0013632221,0.00038083378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018543431,0.0016210567,0.002202893,0.0014581472,0.001164087,0.005073577,0.0016021874,0.0013254333,0.09645306],"category_scores_gemma":[0.0036498273,0.00061427016,0.0011448616,0.0020790652,0.0011098783,0.0028142515,0.0020754691,0.003071882,0.045236193],"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.0006654449,0.00036272436,0.000800135,0.00054946943,0.00014584232,0.00012026847,0.00011250707,0.0033347958,0.00810912,0.022886766,0.43774056,0.52517223],"study_design_scores_gemma":[0.00008882712,0.00020268763,0.0012064961,0.00025402318,0.00014488,0.00031508258,0.00010391679,0.031270094,0.0096177235,0.028266989,0.9284905,0.000038874437],"about_ca_topic_score_codex":0.0019682315,"about_ca_topic_score_gemma":0.0025052489,"teacher_disagreement_score":0.09645306,"about_ca_system_score_codex":0.0008058709,"about_ca_system_score_gemma":0.0021800396,"threshold_uncertainty_score":0.32266766},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12668863,0.0006995634,0.80182683,0.00065571757,0.00017435047,0.0005235078,0.0018645866,0.06511262,0.002454259],"genre_scores_gemma":[0.4443191,0.0002725469,0.5458831,0.00024852162,0.000096380405,0.00038034655,0.0036696065,0.0017811767,0.0033491843],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990709,0.00013324291,0.00008250265,0.00023386483,0.0003977276,0.000081760896],"domain_scores_gemma":[0.9973978,0.0008003916,0.00016759496,0.0009416493,0.00043834466,0.00025409853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010066149,0.00093642547,0.00094932923,0.001314389,0.0007698287,0.0014019923,0.0033549534,0.0008396744,0.0033476301],"category_scores_gemma":[0.0044226698,0.0005565913,0.0005146963,0.0018029631,0.0006040291,0.0031465504,0.002470179,0.0011609155,0.0010604034],"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.0030477082,0.0010091563,0.007400671,0.00072179164,0.00021109417,0.00063193415,0.0011044528,0.123514004,0.1542224,0.01387947,0.04524042,0.64901686],"study_design_scores_gemma":[0.00018460899,0.00016493854,0.0007182073,0.000014910173,0.000025033029,0.00016963114,0.00018320451,0.9555231,0.030246634,0.0053698393,0.007364026,0.00003589627],"about_ca_topic_score_codex":0.0032026097,"about_ca_topic_score_gemma":0.0044745803,"teacher_disagreement_score":0.0033549534,"about_ca_system_score_codex":0.00086225604,"about_ca_system_score_gemma":0.0010171133,"threshold_uncertainty_score":0.011198938},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16842912,0.0019765617,0.7834568,0.001636789,0.00033280512,0.00039315014,0.000246764,0.0011862227,0.042341862],"genre_scores_gemma":[0.44194236,0.0014883121,0.5332602,0.0004677422,0.00015380456,0.00032227492,0.0010087909,0.0005206417,0.02083585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999456,0.00016062893,0.00002896549,0.0001294821,0.00009311147,0.00013173268],"domain_scores_gemma":[0.99776745,0.0015625742,0.0001526305,0.00022542724,0.0001644549,0.00012746349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000876529,0.0009899692,0.0011382235,0.000975924,0.0017142066,0.0013849805,0.0012344797,0.0014444586,0.006799341],"category_scores_gemma":[0.0055481014,0.000433002,0.000781575,0.001454137,0.0015518648,0.0036166285,0.0020363224,0.0015994253,0.0010280195],"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.00036352072,0.00019712551,0.0011797115,0.00041181062,0.000063170366,0.00027168798,0.0005935119,0.67683375,0.0041186013,0.12227604,0.01562356,0.17806748],"study_design_scores_gemma":[0.00008078873,0.00012298103,0.00025126874,0.000039725106,0.000016683625,0.00015203565,0.00031292453,0.88152343,0.0019286033,0.1087771,0.0067744614,0.000019963802],"about_ca_topic_score_codex":0.005315754,"about_ca_topic_score_gemma":0.004932328,"teacher_disagreement_score":0.006799341,"about_ca_system_score_codex":0.0010190672,"about_ca_system_score_gemma":0.0012434894,"threshold_uncertainty_score":0.022746086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4324325,0.011204494,0.5191647,0.0074808737,0.00062884524,0.00015029273,0.00046987025,0.009575997,0.018892476],"genre_scores_gemma":[0.87392575,0.001817559,0.119194314,0.0006268875,0.00022297495,0.00008012734,0.00031491276,0.0011354951,0.0026819955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971512,0.00096567866,0.00011773527,0.0006437314,0.0005457227,0.0005760567],"domain_scores_gemma":[0.9805979,0.010072692,0.0011261349,0.005623634,0.0020894255,0.00049019745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035620977,0.0009826659,0.0011486624,0.0014959566,0.0015807381,0.0024621028,0.003077584,0.0014659531,0.0032118093],"category_scores_gemma":[0.028434623,0.0006318086,0.0006915633,0.0024247216,0.0021809475,0.01651293,0.0019401034,0.0016466767,0.0012731616],"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.0015223436,0.00083021756,0.020850725,0.0012697732,0.0004580791,0.00015235638,0.0010770144,0.18953332,0.039659176,0.10888093,0.034183066,0.601583],"study_design_scores_gemma":[0.00021908712,0.00067618414,0.004643396,0.0001348866,0.00039355617,0.00035715546,0.0009826897,0.5677442,0.07662041,0.3264494,0.021630965,0.0001480489],"about_ca_topic_score_codex":0.004014072,"about_ca_topic_score_gemma":0.0063874037,"teacher_disagreement_score":0.004014072,"about_ca_system_score_codex":0.001912186,"about_ca_system_score_gemma":0.0020207048,"threshold_uncertainty_score":0.018838346},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079781786,0.0006375266,0.90928215,0.0005463997,0.000064220854,0.00024570452,0.00046647782,0.0022308347,0.0067448583],"genre_scores_gemma":[0.4450021,0.0002994135,0.54986274,0.00019258112,0.000059953498,0.0002407262,0.0009073002,0.0007447496,0.0026903795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962053,0.00086631696,0.00018918808,0.00072882045,0.001415471,0.000594979],"domain_scores_gemma":[0.9970862,0.0017033081,0.00024226592,0.00047418437,0.00031312724,0.00018100892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025964652,0.0015618103,0.0015441969,0.0008175771,0.0007957364,0.002458572,0.0019460799,0.0010209044,0.0027350334],"category_scores_gemma":[0.0055252705,0.00063550856,0.0016029296,0.0015959806,0.0015643463,0.0035974958,0.0021619753,0.0018770599,0.0004317099],"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.00035931254,0.0002692761,0.0017231804,0.00017814364,0.00009899172,0.00015542738,0.00021670105,0.8705576,0.0066692284,0.033021964,0.0035747613,0.08317532],"study_design_scores_gemma":[0.000036344827,0.000109692446,0.00019476847,0.000008450147,0.000024596573,0.000044639677,0.000084725936,0.973066,0.0027957424,0.022275575,0.0013466544,0.000012757833],"about_ca_topic_score_codex":0.008217824,"about_ca_topic_score_gemma":0.0099940235,"teacher_disagreement_score":0.008217824,"about_ca_system_score_codex":0.002204553,"about_ca_system_score_gemma":0.0027765092,"threshold_uncertainty_score":0.016339958},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053883452,0.0029295448,0.9108504,0.0037403973,0.00011971963,0.00013750621,0.00051045,0.017958803,0.009869734],"genre_scores_gemma":[0.15113226,0.0013478555,0.84005207,0.00082647504,0.000056375025,0.00009545124,0.00096422574,0.0017085735,0.003816721],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983348,0.00051739183,0.0000976513,0.00036248972,0.00051812775,0.00016941836],"domain_scores_gemma":[0.9957956,0.0017285034,0.00018829021,0.0019431778,0.00024620682,0.00009828902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016724534,0.0008720808,0.0008480355,0.0013014997,0.00063196884,0.0022753878,0.0031749154,0.0010388378,0.00540759],"category_scores_gemma":[0.0064097857,0.00093326665,0.0014620445,0.0019737678,0.0014136874,0.010393271,0.0021458666,0.0025463642,0.0014608226],"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.00064785086,0.00054666435,0.0064593377,0.0011043623,0.00025806273,0.00030862037,0.0011417666,0.055294517,0.040681463,0.1548487,0.032490734,0.70621794],"study_design_scores_gemma":[0.00023578302,0.0005779941,0.0024661354,0.00034836103,0.00018580345,0.0011805381,0.0006183952,0.51542306,0.050941523,0.2983034,0.12957804,0.0001409723],"about_ca_topic_score_codex":0.002460348,"about_ca_topic_score_gemma":0.0072764563,"teacher_disagreement_score":0.00540759,"about_ca_system_score_codex":0.00092662673,"about_ca_system_score_gemma":0.0014723459,"threshold_uncertainty_score":0.018090248},"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":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022385214,0.004507581,0.027852574,0.044822436,0.112899,0.0006323908,0.005158567,0.0034498218,0.7984391],"genre_scores_gemma":[0.013274397,0.0033438075,0.012192597,0.0072338087,0.010516055,0.00022732599,0.0067699095,0.0011547924,0.9452873],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99748355,0.0002974838,0.000112691705,0.00060137216,0.0011926221,0.00031227994],"domain_scores_gemma":[0.99311227,0.00050766685,0.00019680016,0.0010193436,0.003037212,0.002126705],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027445913,0.0009360848,0.0006278908,0.0016968505,0.002641545,0.007989174,0.0026532137,0.0035599743,0.4482824],"category_scores_gemma":[0.008011592,0.0004191699,0.0008091589,0.0015784092,0.0007761429,0.0051502427,0.0035848662,0.0028035813,0.2895384],"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.00007507822,0.000060016995,0.00035412106,0.00015076793,0.0000094797715,0.00010742763,0.00009367627,0.00025054804,0.0006005645,0.02989798,0.8412607,0.12713967],"study_design_scores_gemma":[0.000009328121,0.000024958988,0.000102354104,0.00005192696,0.00000384592,0.0000712451,0.00005921711,0.00015061516,0.00028306353,0.004699761,0.9945378,0.000005928478],"about_ca_topic_score_codex":0.0023938767,"about_ca_topic_score_gemma":0.0038534612,"teacher_disagreement_score":0.4482824,"about_ca_system_score_codex":0.0025514825,"about_ca_system_score_gemma":0.0046793967,"threshold_uncertainty_score":0.7869582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018929638,0.0005133375,0.9196235,0.000701956,0.00022206876,0.00038651327,0.0018092181,0.04724519,0.01056861],"genre_scores_gemma":[0.18946853,0.0004660792,0.78244793,0.0012385041,0.00017390796,0.00055903266,0.007436774,0.0074058883,0.010803208],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938273,0.0010457693,0.0005366091,0.0014363404,0.0025740857,0.00057999033],"domain_scores_gemma":[0.9911287,0.0016373362,0.00043869315,0.005068283,0.0013617851,0.00036511774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044118953,0.0010212074,0.0009503035,0.0013999249,0.0008389937,0.0043659625,0.004161675,0.0013103861,0.0059115286],"category_scores_gemma":[0.011331145,0.0008168828,0.0010036215,0.0019232158,0.0013398157,0.007754253,0.00546887,0.001799711,0.0020008846],"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.001987058,0.0004020478,0.01000082,0.00083805504,0.00026638008,0.00056098984,0.0010194277,0.026568128,0.03824884,0.3482353,0.11085744,0.46101546],"study_design_scores_gemma":[0.000464687,0.00045831618,0.0036693872,0.00017092208,0.0001860558,0.0009488221,0.0004853896,0.43736386,0.11042384,0.14015293,0.30544025,0.00023558516],"about_ca_topic_score_codex":0.010343585,"about_ca_topic_score_gemma":0.011993076,"teacher_disagreement_score":0.010343585,"about_ca_system_score_codex":0.0014962023,"about_ca_system_score_gemma":0.002819639,"threshold_uncertainty_score":0.023332596},"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":"software","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1811897,0.008304811,0.21610445,0.0066123744,0.0033291667,0.002711344,0.16488361,0.24404848,0.17281608],"genre_scores_gemma":[0.36516833,0.001913449,0.24284862,0.004057257,0.00037564329,0.001615081,0.33813202,0.020106267,0.025783382],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9887267,0.0020205493,0.0008076545,0.001430849,0.005975242,0.001039111],"domain_scores_gemma":[0.9875651,0.002436097,0.00044813176,0.004125799,0.004597187,0.00082761876],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0044073174,0.0020894483,0.0012999009,0.0037614359,0.0014996721,0.004477963,0.0052139563,0.0017506535,0.013982159],"category_scores_gemma":[0.016025696,0.0009780425,0.0011521275,0.006330107,0.0011861004,0.007316808,0.0037621988,0.0028080055,0.009346275],"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.001999092,0.0014420303,0.014458412,0.002253225,0.00032750732,0.0003469658,0.00037621264,0.040295925,0.025754882,0.046289362,0.6708227,0.19563363],"study_design_scores_gemma":[0.00079233164,0.0011904974,0.010824259,0.0002716131,0.00014654957,0.0008554396,0.00056005514,0.31567022,0.038883347,0.05786665,0.5727035,0.00023564398],"about_ca_topic_score_codex":0.018370101,"about_ca_topic_score_gemma":0.016433904,"teacher_disagreement_score":0.9860178,"about_ca_system_score_codex":0.0028191898,"about_ca_system_score_gemma":0.0033407642,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053625375,0.00093879213,0.9226995,0.0004701619,0.00016985723,0.00018183701,0.0017532741,0.016184954,0.003976256],"genre_scores_gemma":[0.2506102,0.00047083333,0.73201287,0.00021592152,0.000113155766,0.00016808017,0.008931499,0.0011686285,0.0063088126],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994653,0.00008234102,0.000034008266,0.00012887153,0.00023270104,0.00005685349],"domain_scores_gemma":[0.9986772,0.0003609837,0.00012792023,0.00045497427,0.00031362986,0.00006542984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042722136,0.001179988,0.0009659449,0.0024685632,0.0007062054,0.0013666404,0.0014063817,0.00081520283,0.0053452714],"category_scores_gemma":[0.0032042144,0.00042011563,0.0006965788,0.0026002366,0.0004409426,0.0031307004,0.001473743,0.0009569351,0.0027020152],"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.00044688612,0.00015965472,0.0016901193,0.0006459068,0.00016230615,0.00033802516,0.00051633257,0.09947786,0.07349512,0.014804086,0.026209956,0.78205365],"study_design_scores_gemma":[0.00008490392,0.000286101,0.0015309146,0.00004041543,0.000086970256,0.00036246388,0.0005191515,0.857252,0.056641575,0.06339408,0.019746333,0.00005503185],"about_ca_topic_score_codex":0.002256199,"about_ca_topic_score_gemma":0.005605359,"teacher_disagreement_score":0.0053452714,"about_ca_system_score_codex":0.00067411567,"about_ca_system_score_gemma":0.00070821145,"threshold_uncertainty_score":0.017881751},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6504115,0.00084680464,0.3103521,0.00074992765,0.00033553617,0.000176441,0.0007085278,0.024781419,0.011637681],"genre_scores_gemma":[0.9542924,0.00011290882,0.04305464,0.000093882016,0.000032350457,0.00007389947,0.00032612975,0.00041105156,0.0016027214],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991992,0.00014905013,0.00004745378,0.00018186434,0.00024657077,0.0001758618],"domain_scores_gemma":[0.99494666,0.0022039239,0.00023766267,0.0015336134,0.0007277695,0.00035031533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008012799,0.0007039379,0.00050508766,0.0007953626,0.00071771163,0.0013680428,0.002237604,0.0005476442,0.006032044],"category_scores_gemma":[0.00611162,0.000384024,0.00026844087,0.0010261417,0.0006053581,0.00280784,0.0012012922,0.0008195985,0.0005940809],"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.0061106654,0.001602696,0.00922463,0.0005867092,0.00018141027,0.0004024049,0.0007388023,0.1939015,0.22920345,0.039332114,0.031980883,0.48673478],"study_design_scores_gemma":[0.00008854166,0.00018060653,0.0007875437,0.0000154108,0.000040064093,0.000046014648,0.000105317326,0.93019736,0.05003307,0.016532864,0.001953464,0.000019707857],"about_ca_topic_score_codex":0.0035582508,"about_ca_topic_score_gemma":0.0062998612,"teacher_disagreement_score":0.006032044,"about_ca_system_score_codex":0.00090846897,"about_ca_system_score_gemma":0.0015820835,"threshold_uncertainty_score":0.020179212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007414207,0.00018001006,0.9867785,0.0003022402,0.000048623413,0.0000403647,0.00031885537,0.0029637178,0.0019535238],"genre_scores_gemma":[0.40833482,0.00037156994,0.58225185,0.00036321636,0.00007741726,0.00020662104,0.0019649246,0.0013851814,0.0050443686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897647,0.00036101544,0.00006617227,0.00025058968,0.00029050457,0.000055251374],"domain_scores_gemma":[0.99625444,0.0026567287,0.00018673461,0.0004423639,0.00039459515,0.000065047716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021486864,0.0005402062,0.0006118147,0.0013510179,0.000508321,0.0015389184,0.0014893281,0.001056164,0.0069936384],"category_scores_gemma":[0.009618805,0.0005245096,0.000842204,0.0010185951,0.001202681,0.0042260415,0.0015784679,0.0022108972,0.0017287312],"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.00014800263,0.00007806572,0.0012537584,0.00043233755,0.00008825437,0.00018764453,0.00023141352,0.22379723,0.009192979,0.46764433,0.010163071,0.28678298],"study_design_scores_gemma":[0.000011012764,0.000023572156,0.00014553238,0.00003104846,0.000019136101,0.000048262693,0.000012737889,0.6498701,0.003780791,0.3415232,0.0045198305,0.000014835088],"about_ca_topic_score_codex":0.0018124715,"about_ca_topic_score_gemma":0.004475674,"teacher_disagreement_score":0.0069936384,"about_ca_system_score_codex":0.0016818807,"about_ca_system_score_gemma":0.001616359,"threshold_uncertainty_score":0.023396075},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038072877,0.0003454687,0.94375765,0.0003569526,0.00022851316,0.00022879885,0.00034554646,0.0063632685,0.0103009865],"genre_scores_gemma":[0.23386656,0.00015696966,0.75505245,0.00022977614,0.00007161008,0.00016818062,0.0008425478,0.0013165509,0.008295277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986603,0.00032335427,0.00006637365,0.00034685046,0.00041785176,0.00018513046],"domain_scores_gemma":[0.9958359,0.0010503822,0.00022675071,0.0020575374,0.0006620355,0.00016741104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011386886,0.001101215,0.0013495794,0.0017789707,0.0014489444,0.0014856735,0.0043468783,0.0011376564,0.014554553],"category_scores_gemma":[0.005326397,0.0008440048,0.0011358015,0.0031726602,0.0009080972,0.0026329446,0.003238208,0.0018585674,0.0026190022],"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.0011437245,0.0005764323,0.0020658532,0.0005773305,0.00022749061,0.00026857783,0.0002807222,0.21025614,0.032946635,0.036632188,0.028620144,0.6864047],"study_design_scores_gemma":[0.00020389828,0.00014456404,0.0005991218,0.00003598751,0.00007562433,0.00018923842,0.00016954182,0.912644,0.028014695,0.050722595,0.0071619484,0.00003871692],"about_ca_topic_score_codex":0.0046666,"about_ca_topic_score_gemma":0.008407665,"teacher_disagreement_score":0.014554553,"about_ca_system_score_codex":0.000794577,"about_ca_system_score_gemma":0.0023278035,"threshold_uncertainty_score":0.048689842},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085209357,0.000038900682,0.9974201,0.00009534253,0.000016006288,0.00009987096,0.000065191496,0.0008554175,0.00055712607],"genre_scores_gemma":[0.03913304,0.00015338925,0.9576921,0.000095125455,0.00004331307,0.00038831972,0.0005289815,0.0005148509,0.0014508733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957854,0.0012183652,0.00050704513,0.0006066679,0.0016232217,0.00025935582],"domain_scores_gemma":[0.99584526,0.0010190152,0.00023969043,0.0015013306,0.0011579155,0.00023676697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062480564,0.0011431719,0.00078749104,0.0014114697,0.0013138622,0.0037346608,0.0040807244,0.0012195238,0.002298909],"category_scores_gemma":[0.008519907,0.0012249973,0.0017450085,0.0016765832,0.0015123038,0.0046473746,0.0033247182,0.002628407,0.000950874],"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.0001472718,0.00028057984,0.0021282083,0.00043131807,0.00010204206,0.00044134818,0.0017013103,0.21350713,0.020144625,0.59614754,0.012964351,0.15200442],"study_design_scores_gemma":[0.000024371042,0.00003621463,0.0001701846,0.000050154573,0.000027056336,0.00014542023,0.00017795149,0.8345289,0.0067383824,0.13055956,0.027499452,0.000042337215],"about_ca_topic_score_codex":0.0035527253,"about_ca_topic_score_gemma":0.00577983,"teacher_disagreement_score":0.0062480564,"about_ca_system_score_codex":0.0018228412,"about_ca_system_score_gemma":0.0028411124,"threshold_uncertainty_score":0.033043265},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010127374,0.00007300273,0.98718566,0.000053053063,0.000010218099,0.000039016082,0.000058595993,0.0006424137,0.0018106689],"genre_scores_gemma":[0.21521588,0.00015929835,0.78023124,0.00007348203,0.000027869946,0.00011675162,0.00047555362,0.00032465105,0.0033752576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996891,0.000045996367,0.000014086361,0.000068603316,0.0001442523,0.0000380723],"domain_scores_gemma":[0.99925345,0.00027163062,0.000108782835,0.00013944342,0.00017148317,0.00005511395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041007125,0.00075430685,0.00072781317,0.0013415867,0.00054444594,0.00077826134,0.0010267602,0.00065618235,0.0034902738],"category_scores_gemma":[0.0018800176,0.00041871527,0.00067995465,0.001003937,0.0005952938,0.0013454708,0.0014599999,0.0010119949,0.0009814949],"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.00008110889,0.00006333023,0.0010805287,0.00015111241,0.000052701558,0.00014890675,0.0001833007,0.6807003,0.013897686,0.030526213,0.0040987204,0.26901612],"study_design_scores_gemma":[0.000005304338,0.000018642251,0.00013789808,0.0000074585178,0.0000041663775,0.00003885086,0.000026492973,0.9783683,0.002388077,0.01796698,0.0010316661,0.0000061383116],"about_ca_topic_score_codex":0.00564939,"about_ca_topic_score_gemma":0.010512769,"teacher_disagreement_score":0.00564939,"about_ca_system_score_codex":0.0008449693,"about_ca_system_score_gemma":0.00087340135,"threshold_uncertainty_score":0.011676133},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022233054,0.000054987515,0.96222144,0.00016954802,0.0000318663,0.000108483815,0.001520384,0.030916784,0.002753074],"genre_scores_gemma":[0.09559629,0.00040437558,0.8707596,0.00059786777,0.00006610933,0.0006122204,0.010471209,0.013475761,0.008016566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998396,0.0003075944,0.0001913945,0.00028937298,0.00069095317,0.00012477579],"domain_scores_gemma":[0.99684465,0.0016474843,0.00023157841,0.00068697176,0.00048695385,0.0001023076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019005012,0.0013895354,0.0005614619,0.0011856774,0.0006127613,0.00271485,0.0028614225,0.0010347984,0.010068738],"category_scores_gemma":[0.005636946,0.0011035033,0.0024177788,0.00082186895,0.0016527568,0.003521049,0.0023919279,0.0027237972,0.0041044895],"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.00042844034,0.00022769133,0.0037882165,0.0015567857,0.00015895392,0.0005798016,0.0013185185,0.09339957,0.029802468,0.54860616,0.09645029,0.22368306],"study_design_scores_gemma":[0.00013321645,0.00016313262,0.0007184201,0.00023571434,0.00007108185,0.0005689586,0.0002887036,0.45032638,0.046654537,0.27841845,0.22231394,0.00010741805],"about_ca_topic_score_codex":0.0034117785,"about_ca_topic_score_gemma":0.0069022593,"teacher_disagreement_score":0.010068738,"about_ca_system_score_codex":0.0009920001,"about_ca_system_score_gemma":0.0023158577,"threshold_uncertainty_score":0.0336833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08536405,0.00013905892,0.90565425,0.00036644028,0.00006789533,0.00009973041,0.00033352693,0.0026901404,0.0052850246],"genre_scores_gemma":[0.32586554,0.00013733379,0.6640814,0.00012606615,0.00003214851,0.00017243101,0.0014941673,0.00052090024,0.007570028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99945205,0.000096001,0.000022614327,0.0001679709,0.00017108611,0.00009021565],"domain_scores_gemma":[0.9981365,0.00085284514,0.00014521385,0.0004949863,0.00022888415,0.00014151352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048389702,0.00055567006,0.00076771626,0.0006859273,0.000900101,0.0010412193,0.0015783574,0.0009417013,0.0057240934],"category_scores_gemma":[0.0028130836,0.00033181914,0.00073589256,0.0011320869,0.0005831643,0.0020213327,0.0017290127,0.00089121633,0.0015964418],"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.0005116653,0.0003222759,0.0045056636,0.0004655925,0.00010473589,0.0006741912,0.0005981745,0.62170607,0.035467044,0.047017585,0.013042893,0.27558416],"study_design_scores_gemma":[0.000042838106,0.000076460026,0.0006633874,0.000012704374,0.000018700079,0.00022960319,0.00020953633,0.9403104,0.010066434,0.042522803,0.005831702,0.000015454947],"about_ca_topic_score_codex":0.0019336351,"about_ca_topic_score_gemma":0.0046457537,"teacher_disagreement_score":0.0057240934,"about_ca_system_score_codex":0.0007438404,"about_ca_system_score_gemma":0.00081142853,"threshold_uncertainty_score":0.019149005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032992877,0.0015124129,0.953822,0.0010794945,0.00015416801,0.00015449504,0.0005201806,0.005105034,0.0046594],"genre_scores_gemma":[0.22235718,0.0015793771,0.7673827,0.0007778205,0.00024633622,0.00021364925,0.0012464112,0.0006452319,0.005551349],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932325,0.0001231797,0.00005995003,0.000107532935,0.00029914503,0.000087022796],"domain_scores_gemma":[0.99770576,0.0006479514,0.00021135088,0.00096828886,0.0003910663,0.00007563711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000583603,0.0005296627,0.0004315663,0.001385988,0.00078732864,0.002143348,0.0017669634,0.00043741718,0.003710844],"category_scores_gemma":[0.002871273,0.00040358174,0.0004248376,0.0033650198,0.0008326918,0.0036484457,0.0014058441,0.0009672403,0.0009807523],"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.0004798562,0.00029971014,0.0037295476,0.0006806629,0.00009835382,0.00024369493,0.00071935303,0.0675694,0.07469368,0.1982266,0.03517022,0.61808896],"study_design_scores_gemma":[0.00008374858,0.00039099198,0.0016081545,0.000091891445,0.00010821502,0.0007497866,0.0003778181,0.6278543,0.11830019,0.17307921,0.07724177,0.000113899376],"about_ca_topic_score_codex":0.003211176,"about_ca_topic_score_gemma":0.0051962133,"teacher_disagreement_score":0.003710844,"about_ca_system_score_codex":0.0011380343,"about_ca_system_score_gemma":0.0013372902,"threshold_uncertainty_score":0.012413979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036845834,0.0001944793,0.9894035,0.00017800515,0.00011804602,0.00012645166,0.00010173155,0.00073409243,0.005459045],"genre_scores_gemma":[0.07752409,0.00030735924,0.9129355,0.00021338784,0.00013247442,0.00046933218,0.0007477546,0.00028006642,0.0073900498],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986009,0.00033096797,0.00009293294,0.00031016607,0.00043541653,0.0002296014],"domain_scores_gemma":[0.99881315,0.000366237,0.000075422045,0.00023137656,0.00044824177,0.00006555324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010494195,0.0011420018,0.0011577052,0.0014744751,0.0011363779,0.0012685987,0.003196075,0.0013588448,0.012992401],"category_scores_gemma":[0.0037655872,0.00044348682,0.0011059954,0.0020392498,0.0007117141,0.002617294,0.0023827222,0.0023465178,0.0033744916],"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.00031794247,0.0002573916,0.00077072106,0.00033809475,0.000076729426,0.0002423058,0.00022532459,0.21677913,0.0056342976,0.1276084,0.03358217,0.6141676],"study_design_scores_gemma":[0.00012856048,0.00012750734,0.00025195995,0.000035945282,0.000048386086,0.0003344132,0.0000669036,0.89743793,0.0031868755,0.06638978,0.03195076,0.000040947965],"about_ca_topic_score_codex":0.0032753542,"about_ca_topic_score_gemma":0.0030262936,"teacher_disagreement_score":0.012992401,"about_ca_system_score_codex":0.0008763336,"about_ca_system_score_gemma":0.0022895008,"threshold_uncertainty_score":0.043463945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030010985,0.00053042494,0.9467801,0.00038785816,0.00013448884,0.0003358011,0.0005558533,0.017607614,0.003656923],"genre_scores_gemma":[0.13595916,0.00025225428,0.85545737,0.00021611397,0.00008488161,0.00032141458,0.0020647116,0.0018255296,0.0038185383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910957,0.00015934068,0.000041247233,0.00023333721,0.0003419291,0.000114613686],"domain_scores_gemma":[0.99617165,0.0014619387,0.0003070816,0.0010894507,0.0007808714,0.00018896676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011560236,0.001809825,0.00091640797,0.0037670706,0.0014929667,0.002104315,0.0033464993,0.0016152875,0.0060552573],"category_scores_gemma":[0.0070598666,0.0008216681,0.0011817783,0.0034888112,0.0011418413,0.003742251,0.002366339,0.0017828633,0.002309783],"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.0004538606,0.0003107832,0.0028921019,0.000450717,0.00015248425,0.00017451322,0.00043145832,0.14605144,0.019026957,0.031802777,0.026751144,0.77150166],"study_design_scores_gemma":[0.00011190237,0.00007437022,0.00038110887,0.0000368891,0.00003076362,0.00012210174,0.000113492904,0.94381195,0.014746891,0.032628052,0.00791271,0.000029715975],"about_ca_topic_score_codex":0.011337594,"about_ca_topic_score_gemma":0.019445304,"teacher_disagreement_score":0.011337594,"about_ca_system_score_codex":0.0016993524,"about_ca_system_score_gemma":0.0030169021,"threshold_uncertainty_score":0.022543252},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037150603,0.0013768579,0.949917,0.0011381442,0.00015085822,0.00015246365,0.0005296417,0.004682949,0.004901476],"genre_scores_gemma":[0.23746188,0.0014295004,0.752681,0.0007250279,0.00023641402,0.00020755883,0.0012232834,0.000631992,0.0054033254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993217,0.00012233439,0.000058043388,0.00011284921,0.00030057784,0.00008456813],"domain_scores_gemma":[0.99767107,0.00067867886,0.00021148709,0.00097576936,0.00038724852,0.00007582442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005704334,0.0005204297,0.0004269451,0.0014054728,0.0007995017,0.0021364437,0.0017214024,0.00044843316,0.0036044165],"category_scores_gemma":[0.0029320787,0.00037991334,0.00040911345,0.0035194412,0.0008539273,0.0036847813,0.0013977396,0.0009849295,0.0009645646],"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.00044148669,0.00031865473,0.0037314193,0.0006329263,0.000093035786,0.00022320381,0.0006892276,0.0736011,0.06836281,0.22617461,0.03361387,0.5921176],"study_design_scores_gemma":[0.00007395762,0.00031263515,0.00144304,0.00007761655,0.000089848494,0.0006359426,0.00032823507,0.6306939,0.10233244,0.19933258,0.06458386,0.00009594506],"about_ca_topic_score_codex":0.002881681,"about_ca_topic_score_gemma":0.004564792,"teacher_disagreement_score":0.0036044165,"about_ca_system_score_codex":0.0011949815,"about_ca_system_score_gemma":0.0013253827,"threshold_uncertainty_score":0.01205796},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6460091,0.004758042,0.17975359,0.004207768,0.0017200368,0.0016577132,0.038572088,0.068316504,0.055005223],"genre_scores_gemma":[0.5702212,0.0017919802,0.3298368,0.0009984693,0.00014205252,0.0013684739,0.081381805,0.0073545356,0.0069046714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972294,0.00083246926,0.00021854645,0.00037457576,0.00097475154,0.00037022313],"domain_scores_gemma":[0.9947919,0.0021849028,0.00028303274,0.0010137899,0.0013760587,0.00035021643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029268474,0.0022639935,0.0006617299,0.0020218021,0.00076729164,0.0014496393,0.005733687,0.001302733,0.002428398],"category_scores_gemma":[0.010094297,0.0007050954,0.001118906,0.0038450072,0.00096876983,0.0023163622,0.0016315404,0.0022522479,0.0008912596],"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.0012189366,0.0015661146,0.012287347,0.0027030527,0.00043835645,0.0006096273,0.0004318022,0.6005908,0.014556224,0.03228062,0.22146378,0.11185333],"study_design_scores_gemma":[0.0004811344,0.00041565316,0.0032676884,0.000094881674,0.00005996011,0.0001540875,0.0002230263,0.93363136,0.012725696,0.013119583,0.035778064,0.000048810587],"about_ca_topic_score_codex":0.017826049,"about_ca_topic_score_gemma":0.020910945,"teacher_disagreement_score":0.017826049,"about_ca_system_score_codex":0.0017402935,"about_ca_system_score_gemma":0.0024629063,"threshold_uncertainty_score":0.035444558},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009279658,0.3173659,0.5135481,0.014351106,0.0053638644,0.0003439002,0.0024461867,0.004161048,0.13314027],"genre_scores_gemma":[0.092981264,0.3791229,0.42335874,0.0072708377,0.011738198,0.00065916096,0.011809957,0.0017763128,0.07128257],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99745435,0.00047772028,0.0001669832,0.00048452307,0.0011589251,0.0002575081],"domain_scores_gemma":[0.9969158,0.0015343892,0.00006695254,0.0006181527,0.0007060169,0.00015874732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022785454,0.001663058,0.0014238558,0.0037369821,0.001171775,0.004163948,0.0030197273,0.0015159487,0.02106316],"category_scores_gemma":[0.007673648,0.0012941394,0.0009983644,0.010635634,0.0010852531,0.007526571,0.0024676225,0.0036992587,0.012339766],"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.00013359834,0.00027565056,0.000558469,0.0021919906,0.000056883735,0.00006955597,0.00009243607,0.01216381,0.0018581393,0.09348668,0.16131286,0.72779983],"study_design_scores_gemma":[0.000051096606,0.0001813022,0.00094479026,0.00095856865,0.00006257157,0.0008257151,0.00014210946,0.05153824,0.0025868167,0.22750624,0.71513796,0.00006466119],"about_ca_topic_score_codex":0.0033196784,"about_ca_topic_score_gemma":0.0041308776,"teacher_disagreement_score":0.02106316,"about_ca_system_score_codex":0.002564548,"about_ca_system_score_gemma":0.003540304,"threshold_uncertainty_score":0.07046324},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22910376,0.00076091674,0.7602554,0.0007249078,0.000057551606,0.00021700823,0.0004953737,0.0029359073,0.005449181],"genre_scores_gemma":[0.7459303,0.00043382047,0.24903262,0.00016407312,0.00007024762,0.00027291523,0.0010816976,0.0007765273,0.0022376806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977648,0.000720286,0.00011776807,0.0004924506,0.0006814395,0.00022328342],"domain_scores_gemma":[0.95916086,0.029516548,0.003642564,0.0040251794,0.0026662506,0.00098867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030052871,0.00047319237,0.00074940687,0.003007441,0.0012444515,0.0021012062,0.0014094226,0.0013000935,0.004119676],"category_scores_gemma":[0.037040662,0.0006980278,0.00060333346,0.003082675,0.0020560485,0.0055268975,0.0014104714,0.0011258401,0.00064617035],"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.0013075691,0.0004340476,0.046706814,0.0008146503,0.00014966425,0.00047358367,0.0019627542,0.36231247,0.041069318,0.26320615,0.010795627,0.27076733],"study_design_scores_gemma":[0.00008994421,0.00019545044,0.01002851,0.000049253642,0.000046208443,0.00062744337,0.00023782268,0.8764509,0.013395074,0.09418637,0.0046240846,0.00006894893],"about_ca_topic_score_codex":0.0018231502,"about_ca_topic_score_gemma":0.0024490268,"teacher_disagreement_score":0.004119676,"about_ca_system_score_codex":0.0014992281,"about_ca_system_score_gemma":0.00065796904,"threshold_uncertainty_score":0.015893638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22910376,0.00076091674,0.7602554,0.0007249078,0.000057551606,0.00021700823,0.0004953737,0.0029359073,0.005449181],"genre_scores_gemma":[0.7459303,0.00043382047,0.24903262,0.00016407312,0.00007024762,0.00027291523,0.0010816976,0.0007765273,0.0022376806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977648,0.000720286,0.00011776807,0.0004924506,0.0006814395,0.00022328342],"domain_scores_gemma":[0.95916086,0.029516548,0.003642564,0.0040251794,0.0026662506,0.00098867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030052871,0.00047319237,0.00074940687,0.003007441,0.0012444515,0.0021012062,0.0014094226,0.0013000935,0.004119676],"category_scores_gemma":[0.037040662,0.0006980278,0.00060333346,0.003082675,0.0020560485,0.0055268975,0.0014104714,0.0011258401,0.00064617035],"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.0013075691,0.0004340476,0.046706814,0.0008146503,0.00014966425,0.00047358367,0.0019627542,0.36231247,0.041069318,0.26320615,0.010795627,0.27076733],"study_design_scores_gemma":[0.00008994421,0.00019545044,0.01002851,0.000049253642,0.000046208443,0.00062744337,0.00023782268,0.8764509,0.013395074,0.09418637,0.0046240846,0.00006894893],"about_ca_topic_score_codex":0.0018231502,"about_ca_topic_score_gemma":0.0024490268,"teacher_disagreement_score":0.004119676,"about_ca_system_score_codex":0.0014992281,"about_ca_system_score_gemma":0.00065796904,"threshold_uncertainty_score":0.015893638},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010137591,0.0027228184,0.039420713,0.030185709,0.019082319,0.0010984225,0.062255453,0.015894532,0.8192024],"genre_scores_gemma":[0.042488776,0.0021408524,0.03376593,0.0028626905,0.0038563653,0.00066033704,0.12960307,0.007089519,0.7775325],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979395,0.0003059171,0.00006477794,0.00035033823,0.0009656254,0.00037369676],"domain_scores_gemma":[0.9939201,0.00070774526,0.00007504919,0.0010372658,0.0017455171,0.0025144184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035211423,0.0012037336,0.0012079823,0.0021021902,0.0024009484,0.0051305974,0.0028983736,0.0020356828,0.23730461],"category_scores_gemma":[0.006116467,0.000510517,0.0009640832,0.0028978938,0.0005095957,0.0026574237,0.002849625,0.0032335094,0.14913201],"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.000088815636,0.00011122026,0.00009324218,0.00004749966,0.0000051043376,0.000030052146,0.000017143147,0.00042794587,0.00026871715,0.0048413207,0.9595225,0.034546535],"study_design_scores_gemma":[0.00007869554,0.00006395401,0.0006276409,0.000037319165,0.000009346927,0.00007395871,0.000082844526,0.0029316533,0.0011853629,0.011647208,0.98324895,0.000013060504],"about_ca_topic_score_codex":0.013169856,"about_ca_topic_score_gemma":0.021655057,"teacher_disagreement_score":0.23730461,"about_ca_system_score_codex":0.0019882983,"about_ca_system_score_gemma":0.003941595,"threshold_uncertainty_score":0.793863},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016301889,0.0023425955,0.93644243,0.0049466207,0.0013673324,0.00012115181,0.00082588074,0.01848826,0.019163879],"genre_scores_gemma":[0.28192383,0.0022071435,0.66753215,0.0036032586,0.0015400558,0.00025599272,0.002175549,0.0061009047,0.03466114],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942502,0.0015747951,0.00037849369,0.001332965,0.00198423,0.00047935784],"domain_scores_gemma":[0.9828326,0.0033806656,0.0008282046,0.010232616,0.0022577418,0.00046811462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048830025,0.0013019138,0.0014283076,0.0013235335,0.0015182723,0.0049302685,0.002460871,0.0016553719,0.018847965],"category_scores_gemma":[0.025423964,0.0009029434,0.00087985984,0.002159103,0.001986353,0.016150372,0.0037915634,0.0032723898,0.011060769],"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.00065184484,0.00022325783,0.0026756776,0.00086653436,0.0002068054,0.00020108723,0.000570634,0.023438042,0.010553127,0.24603385,0.116550274,0.59802884],"study_design_scores_gemma":[0.00033238798,0.00036158087,0.0009220293,0.00023816295,0.00014297069,0.0006468007,0.00038786876,0.14588453,0.016893575,0.62845206,0.20558876,0.00014935194],"about_ca_topic_score_codex":0.0016610065,"about_ca_topic_score_gemma":0.004310605,"teacher_disagreement_score":0.018847965,"about_ca_system_score_codex":0.00109716,"about_ca_system_score_gemma":0.0018299251,"threshold_uncertainty_score":0.06305277},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009429111,0.00007239809,0.98879695,0.000103522485,0.000032228094,0.00003057053,0.000029771172,0.0006052394,0.0009002912],"genre_scores_gemma":[0.5690651,0.00018314159,0.42426232,0.0002669014,0.00007738065,0.00016654188,0.0003365729,0.00036643114,0.005275549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982496,0.00035469982,0.000075170436,0.0006069098,0.00057221926,0.00014124182],"domain_scores_gemma":[0.99750984,0.000880355,0.0003388809,0.0007146817,0.00044639627,0.000109772845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011841744,0.00085917435,0.0015668074,0.0021394305,0.0006123112,0.0011928241,0.0024349864,0.001982767,0.002256783],"category_scores_gemma":[0.0063378164,0.00068938354,0.0011072804,0.0016767397,0.0011496488,0.0022965763,0.0026676166,0.0014155492,0.0011181585],"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.00050867855,0.00020697906,0.00093605544,0.00020945922,0.00025393948,0.00028640332,0.00018151749,0.48342186,0.059834678,0.036660228,0.0051812027,0.41231897],"study_design_scores_gemma":[0.000017429962,0.00004183029,0.00016263324,0.0000040129034,0.000016728854,0.00005066353,0.000016498863,0.9742983,0.007605722,0.017254679,0.0005187569,0.000012806925],"about_ca_topic_score_codex":0.0022796623,"about_ca_topic_score_gemma":0.0020953424,"teacher_disagreement_score":0.0024349864,"about_ca_system_score_codex":0.0007852756,"about_ca_system_score_gemma":0.0009721011,"threshold_uncertainty_score":0.007549703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23042764,0.002330381,0.73841405,0.001688148,0.0005980041,0.00033147063,0.0017406206,0.008649687,0.015820052],"genre_scores_gemma":[0.6009744,0.0006167842,0.39025867,0.00026667526,0.00027405497,0.00021869682,0.0017742552,0.00029250304,0.0053239563],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935347,0.00014653512,0.0000364339,0.00010886721,0.00028802693,0.000066606655],"domain_scores_gemma":[0.99808747,0.0008916894,0.00012124332,0.00052603055,0.00031300882,0.000060506343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038593315,0.00072592346,0.0004657568,0.0014011086,0.00038132645,0.0008092703,0.00080548547,0.00051697524,0.007028652],"category_scores_gemma":[0.0036417143,0.00016046669,0.00034767893,0.002615472,0.0005324117,0.0016682666,0.000892227,0.00075883564,0.0012798626],"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.0012573603,0.00040396917,0.0016133653,0.0005238594,0.00009189203,0.0005408237,0.00031609854,0.11895335,0.043873854,0.104688995,0.036990255,0.6907462],"study_design_scores_gemma":[0.000143223,0.00027380625,0.0011570628,0.000050964587,0.000031147258,0.00061976333,0.00015487989,0.81929016,0.05467337,0.108586885,0.014986758,0.00003206006],"about_ca_topic_score_codex":0.0020384397,"about_ca_topic_score_gemma":0.0023817986,"teacher_disagreement_score":0.007028652,"about_ca_system_score_codex":0.00056867214,"about_ca_system_score_gemma":0.00051844557,"threshold_uncertainty_score":0.023513138},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040541054,0.008587663,0.21666503,0.0025887992,0.0017884097,0.00023270947,0.0011858583,0.002301889,0.76259553],"genre_scores_gemma":[0.07405977,0.015498863,0.15553315,0.0015541139,0.0011588089,0.00023726316,0.004396183,0.0017926593,0.7457692],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949586,0.000060339044,0.000017156068,0.00017500056,0.00020140097,0.000050229624],"domain_scores_gemma":[0.9996815,0.00007093109,0.000017937935,0.00012704219,0.00007368615,0.000028951146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032089857,0.0008973282,0.0006417552,0.0019544035,0.0010443332,0.0018790674,0.0015061952,0.0010705262,0.0737506],"category_scores_gemma":[0.0012336376,0.0004947784,0.00062644936,0.0034083494,0.00090614986,0.005083974,0.0019829548,0.001462041,0.036001638],"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.000032362655,0.00006902433,0.00010373892,0.0003181973,0.000021935939,0.000054126744,0.00010273764,0.00249637,0.0020178265,0.35231417,0.1713355,0.47113407],"study_design_scores_gemma":[0.000008390407,0.000018911662,0.00017833433,0.00014844947,0.000020599016,0.00025554592,0.000072755196,0.0049109105,0.0029682238,0.3545126,0.63689035,0.000014933501],"about_ca_topic_score_codex":0.0012131984,"about_ca_topic_score_gemma":0.0018456542,"teacher_disagreement_score":0.0737506,"about_ca_system_score_codex":0.0012325458,"about_ca_system_score_gemma":0.0009917548,"threshold_uncertainty_score":0.24672031},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011827507,0.014964815,0.10464596,0.005220721,0.008009397,0.00015427242,0.0045005064,0.0039039655,0.85741746],"genre_scores_gemma":[0.015159281,0.024065001,0.044598542,0.002555706,0.003512689,0.00033300696,0.0066115973,0.002729009,0.90043527],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997594,0.000032731783,0.000010698752,0.00007587842,0.00010424483,0.00001702659],"domain_scores_gemma":[0.9997459,0.00006536602,0.000015080234,0.000069962094,0.00007227737,0.00003144052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019318057,0.0014605348,0.0005423659,0.0016337562,0.0007211331,0.0032973238,0.0010843896,0.0011103753,0.13395725],"category_scores_gemma":[0.0010537936,0.000422153,0.00034363105,0.0024624541,0.0008750245,0.0055793063,0.001711872,0.001851713,0.098298356],"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.000010806541,0.000016946491,0.000036270725,0.00040367965,0.0000064882515,0.0000471707,0.00007000839,0.0011527005,0.00077928434,0.20530462,0.6066968,0.18547527],"study_design_scores_gemma":[0.0000019994857,0.0000040807636,0.000034211178,0.00006802512,0.0000032187186,0.0000870604,0.000019734385,0.00038916775,0.00016644452,0.05452262,0.9446985,0.000004959244],"about_ca_topic_score_codex":0.0009433909,"about_ca_topic_score_gemma":0.0019269997,"teacher_disagreement_score":0.13395725,"about_ca_system_score_codex":0.0008536754,"about_ca_system_score_gemma":0.00067539955,"threshold_uncertainty_score":0.44813168},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042294627,0.018998997,0.22357704,0.006185921,0.005302032,0.00034572466,0.00577304,0.006520709,0.7290671],"genre_scores_gemma":[0.035415065,0.017339082,0.1365534,0.0021452236,0.0030956806,0.00029577373,0.017126024,0.0028723897,0.7851574],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955827,0.00004599605,0.000015215016,0.00015629182,0.00018444782,0.000039765135],"domain_scores_gemma":[0.9993861,0.00013414134,0.000025986043,0.00020394044,0.00018874038,0.000061135346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036665544,0.001159798,0.00084153976,0.002834777,0.0010006397,0.0026711763,0.0016770725,0.0009716113,0.09051489],"category_scores_gemma":[0.0014695829,0.00044854943,0.0007958338,0.003687441,0.00073517556,0.0036050468,0.0014279819,0.0020479797,0.069601536],"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.000018303374,0.000038661427,0.000120269826,0.00023563413,0.000014536094,0.000020620844,0.000039875664,0.0013091022,0.0009965999,0.0600207,0.45065054,0.48653507],"study_design_scores_gemma":[0.000006018939,0.000016493947,0.00043970076,0.00016319232,0.000017188046,0.0001954222,0.00005697022,0.006020633,0.0017667733,0.1617355,0.8295653,0.00001693358],"about_ca_topic_score_codex":0.0018093066,"about_ca_topic_score_gemma":0.0034381023,"teacher_disagreement_score":0.09051489,"about_ca_system_score_codex":0.0012583643,"about_ca_system_score_gemma":0.0011053692,"threshold_uncertainty_score":0.3028025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15041335,0.00031028438,0.80309343,0.0013493374,0.00023169586,0.00016156508,0.0005400428,0.019107921,0.024792427],"genre_scores_gemma":[0.5381199,0.00018768098,0.45193055,0.00027526193,0.00005457845,0.00022630791,0.0007418582,0.00089085154,0.0075729634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999451,0.00011768582,0.000027160468,0.00013821085,0.00019660703,0.000069342925],"domain_scores_gemma":[0.9986577,0.00041131637,0.00006966968,0.0005115523,0.00023441421,0.00011541886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004783976,0.0006412691,0.0005498994,0.00049390906,0.0011136449,0.001263072,0.0016510087,0.00079329434,0.006891537],"category_scores_gemma":[0.002552369,0.0003758773,0.00071432645,0.0009287724,0.0009722113,0.0020530967,0.0014281947,0.0011802965,0.001546231],"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.0004838121,0.000265649,0.003195245,0.000369263,0.00013945925,0.00049042533,0.0005530711,0.6594095,0.044508718,0.115005895,0.023664305,0.15191449],"study_design_scores_gemma":[0.00005514966,0.000039753086,0.00052997016,0.000008867567,0.000012073528,0.000054330692,0.00008027175,0.9351137,0.007605349,0.04865185,0.007831846,0.000016735628],"about_ca_topic_score_codex":0.005187567,"about_ca_topic_score_gemma":0.007512,"teacher_disagreement_score":0.006891537,"about_ca_system_score_codex":0.0013114517,"about_ca_system_score_gemma":0.0013270312,"threshold_uncertainty_score":0.02305454},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004321455,0.0039584166,0.15242736,0.0029257778,0.0012356415,0.00008134161,0.0011616955,0.0009377121,0.8329506],"genre_scores_gemma":[0.13208571,0.010722385,0.05526022,0.0016838461,0.0012890577,0.00025464955,0.0030834542,0.0011266745,0.794494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974114,0.00005429969,0.0000071213603,0.0000733642,0.000094038944,0.000030015719],"domain_scores_gemma":[0.9995652,0.00016322096,0.000023802986,0.00010109637,0.0001020658,0.00004449906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002336987,0.0006949364,0.00037819796,0.0011431592,0.00091052096,0.0016447619,0.000718039,0.00069574214,0.06721376],"category_scores_gemma":[0.0013464694,0.00041457335,0.00039333536,0.0013038763,0.00094564876,0.0026451652,0.0009828556,0.0015316781,0.020021275],"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.000008243756,0.000013973839,0.000042588366,0.000058080142,0.0000046460236,0.000020695215,0.000062447725,0.0014693815,0.00034588244,0.8871585,0.061299976,0.049515545],"study_design_scores_gemma":[0.0000035227517,0.000005851244,0.000083935876,0.000047765046,0.0000057587827,0.0000673716,0.000035471436,0.0032918449,0.0003779552,0.7620587,0.23401375,0.0000081350145],"about_ca_topic_score_codex":0.0018799799,"about_ca_topic_score_gemma":0.0026923416,"teacher_disagreement_score":0.06721376,"about_ca_system_score_codex":0.0012926433,"about_ca_system_score_gemma":0.0010168533,"threshold_uncertainty_score":0.22485244},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013257128,0.0028099113,0.93691236,0.0015899967,0.00029321664,0.00010859068,0.0008599193,0.0024352728,0.041733682],"genre_scores_gemma":[0.19712077,0.0054843226,0.7600086,0.0006602227,0.00034881258,0.00025330886,0.0031120947,0.0012104932,0.031801436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921393,0.0002392757,0.00004731444,0.000182465,0.00023251609,0.00008444321],"domain_scores_gemma":[0.9984352,0.00090094784,0.00007336304,0.00038009626,0.00016468806,0.000045754776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005814348,0.0006448092,0.00067434314,0.0014131651,0.000853207,0.0031577323,0.0015373256,0.0010523499,0.012833138],"category_scores_gemma":[0.004229695,0.0004717017,0.0010621647,0.0038341295,0.0016118062,0.0060512954,0.0015903512,0.0020191541,0.0032211596],"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.000042952895,0.000028881628,0.00012813316,0.00020637238,0.000009332485,0.000054684802,0.000197736,0.011779829,0.0012565838,0.8507198,0.010208168,0.12536749],"study_design_scores_gemma":[0.0000110731535,0.000012337383,0.0000929769,0.00005110739,0.000011017535,0.00008299101,0.00005325845,0.042705704,0.0013274226,0.92715454,0.028480966,0.000016573273],"about_ca_topic_score_codex":0.0045861467,"about_ca_topic_score_gemma":0.004556094,"teacher_disagreement_score":0.012833138,"about_ca_system_score_codex":0.0022077395,"about_ca_system_score_gemma":0.0010966695,"threshold_uncertainty_score":0.04293114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7880979,0.0008727662,0.12386093,0.0014953179,0.00036907275,0.00020970931,0.00330944,0.0015429166,0.080242015],"genre_scores_gemma":[0.9702275,0.00016658806,0.021464696,0.00006489282,0.000011245494,0.00004207365,0.0005267039,0.00013368505,0.007362716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998258,0.000025939773,0.000005695213,0.000027788576,0.000090014895,0.000024834302],"domain_scores_gemma":[0.99959654,0.00021179041,0.000028226495,0.000056188324,0.000069396956,0.0000379362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025138492,0.00030866073,0.00038216583,0.00037591474,0.00048789292,0.0010112576,0.00082744425,0.0010008634,0.0107169375],"category_scores_gemma":[0.0009411232,0.00028651187,0.00033448677,0.0006724909,0.00047587857,0.00060550845,0.00032243188,0.0005031531,0.0005919924],"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.00026019724,0.00010286304,0.0018977029,0.00018073578,0.000033623328,0.0006835826,0.00011970368,0.9405109,0.027828716,0.019351276,0.0025670603,0.0064637125],"study_design_scores_gemma":[0.000038569095,0.000044378998,0.00078868715,0.0000075035036,0.000007020605,0.00006920814,0.00003040064,0.98277414,0.01247656,0.0020663892,0.0016819439,0.000015244431],"about_ca_topic_score_codex":0.0073514963,"about_ca_topic_score_gemma":0.0057926895,"teacher_disagreement_score":0.0107169375,"about_ca_system_score_codex":0.0012410241,"about_ca_system_score_gemma":0.00090826943,"threshold_uncertainty_score":0.035851777},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008285706,0.004596268,0.6873234,0.0016984674,0.004029358,0.00011381432,0.0016225851,0.0028522778,0.28947818],"genre_scores_gemma":[0.20026802,0.013807606,0.30298212,0.0011121043,0.002215427,0.00026728516,0.004251396,0.003059573,0.47203645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996247,0.0000515142,0.00001700862,0.00010967289,0.00016111879,0.000035942132],"domain_scores_gemma":[0.9990115,0.0003131672,0.0000703467,0.00033790217,0.0002069147,0.00006019649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034519954,0.0007037538,0.0003502148,0.0014215615,0.0006260703,0.0016089389,0.000980153,0.00063355186,0.031388372],"category_scores_gemma":[0.0024777234,0.00043854487,0.0003579449,0.0022161736,0.0010482975,0.003617823,0.0009970479,0.0016236542,0.009355581],"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.00003355324,0.000011223289,0.000047267316,0.0001156892,0.000007140777,0.00004480193,0.000098782424,0.005661764,0.0018055196,0.852255,0.041562907,0.098356396],"study_design_scores_gemma":[0.0000091630345,0.000018918343,0.00008500863,0.000066078755,0.000012370245,0.00015096136,0.000049635004,0.013348655,0.003131499,0.64833575,0.3347743,0.000017689586],"about_ca_topic_score_codex":0.0010308729,"about_ca_topic_score_gemma":0.0011889883,"teacher_disagreement_score":0.031388372,"about_ca_system_score_codex":0.0010139584,"about_ca_system_score_gemma":0.0007588967,"threshold_uncertainty_score":0.10500455},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009300636,0.00029121406,0.9882752,0.000088784705,0.00002880238,0.00006107207,0.00003967631,0.0007498382,0.0011647452],"genre_scores_gemma":[0.06512206,0.00039151483,0.9326489,0.0000656849,0.000026854286,0.00010817284,0.00025129796,0.00036480787,0.0010208103],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952447,0.0016467987,0.00026391543,0.00073046325,0.0018052675,0.0003089259],"domain_scores_gemma":[0.9927215,0.004051199,0.000491461,0.0014813859,0.0009593121,0.00029511674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004179054,0.0009064901,0.0018003903,0.0022205103,0.0008208437,0.0017242506,0.0034477552,0.0021011662,0.0035976614],"category_scores_gemma":[0.013809365,0.0008408694,0.0016586557,0.0036488913,0.0010170523,0.0061624353,0.001983976,0.0028909016,0.0010126405],"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.00073030504,0.00056613336,0.0008147634,0.00041972616,0.00020849738,0.000055565135,0.00029457983,0.4101385,0.012824096,0.070578724,0.004235399,0.49913365],"study_design_scores_gemma":[0.00008514687,0.00019084486,0.00024599422,0.000017805269,0.000035548193,0.000082541424,0.000045484307,0.97258425,0.006090639,0.017671587,0.0029201491,0.00003001482],"about_ca_topic_score_codex":0.0040469356,"about_ca_topic_score_gemma":0.0056660166,"teacher_disagreement_score":0.004179054,"about_ca_system_score_codex":0.0016241821,"about_ca_system_score_gemma":0.0024072004,"threshold_uncertainty_score":0.022101223},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00238557,0.010743407,0.34526494,0.0039738365,0.0020681093,0.00012324272,0.001390948,0.00279186,0.6312581],"genre_scores_gemma":[0.05374649,0.015322708,0.1583706,0.0017399644,0.0018801205,0.00022051614,0.004273184,0.002913689,0.76153284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961036,0.000064606684,0.000010870443,0.0001117084,0.0001737197,0.000028772742],"domain_scores_gemma":[0.9995521,0.00012306804,0.000015073011,0.00015551786,0.00012742689,0.00002696885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034263232,0.0011379464,0.0006987839,0.00287008,0.0009882023,0.0020474722,0.001215693,0.0007093344,0.06829067],"category_scores_gemma":[0.0012393526,0.0005160393,0.0008302468,0.0025941394,0.0013550686,0.002436815,0.001283921,0.0019516969,0.039961018],"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.0000151710865,0.000035515077,0.00013364371,0.00021803916,0.000025891242,0.000038711216,0.00012283289,0.00305122,0.001306877,0.41682816,0.2662036,0.3120204],"study_design_scores_gemma":[0.000004094186,0.0000074003897,0.00025282794,0.00010323597,0.000016108968,0.00011058168,0.000065203574,0.005335649,0.0013993719,0.5200367,0.47265533,0.000013553021],"about_ca_topic_score_codex":0.0017135041,"about_ca_topic_score_gemma":0.0031732635,"teacher_disagreement_score":0.06829067,"about_ca_system_score_codex":0.0014021023,"about_ca_system_score_gemma":0.0008839403,"threshold_uncertainty_score":0.22845507},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034386858,0.01581283,0.27452806,0.0036625222,0.0034046709,0.000056942783,0.0005852099,0.0017383088,0.69677275],"genre_scores_gemma":[0.08798672,0.022296386,0.11749172,0.0020822294,0.0042266482,0.00015782469,0.002011599,0.0027549528,0.760992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997352,0.000048648344,0.0000064587425,0.0000686756,0.00012130469,0.000019692896],"domain_scores_gemma":[0.9996543,0.00009811486,0.000013186747,0.00009265193,0.00010983095,0.00003187429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028141172,0.0010273233,0.00066732464,0.0024653338,0.00090972014,0.0021179747,0.0008566672,0.00077762833,0.03863458],"category_scores_gemma":[0.0010488154,0.00038694145,0.0005319815,0.0023377447,0.0014757738,0.0024445865,0.0011500184,0.0021627767,0.025719311],"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.000010649913,0.000029198562,0.00007479616,0.00015936168,0.0000147338715,0.000022329234,0.00009748423,0.0017850146,0.001090158,0.6590908,0.17257223,0.16505322],"study_design_scores_gemma":[0.0000024818703,0.00000569033,0.00016792695,0.000078041616,0.000009848938,0.00009049593,0.00005849268,0.004602765,0.0008210447,0.6909854,0.3031665,0.000011336167],"about_ca_topic_score_codex":0.0007131681,"about_ca_topic_score_gemma":0.0013697526,"teacher_disagreement_score":0.03863458,"about_ca_system_score_codex":0.0011146277,"about_ca_system_score_gemma":0.0006210547,"threshold_uncertainty_score":0.12924552},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01341321,0.008902615,0.10704267,0.01397019,0.035726238,0.0012689463,0.027198782,0.022238309,0.7702391],"genre_scores_gemma":[0.081207566,0.005315429,0.027822841,0.0012885266,0.0040991455,0.00059397874,0.018308824,0.004895913,0.8564678],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966156,0.000052741892,0.000015414438,0.00008405366,0.00009406509,0.000092230235],"domain_scores_gemma":[0.998995,0.00019236452,0.0000177316,0.00021139202,0.00024810297,0.00033548934],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047011537,0.0016387594,0.0024008742,0.00058345613,0.0013173341,0.0030705624,0.0014725849,0.001817258,0.66621184],"category_scores_gemma":[0.0019106086,0.00030053811,0.001047165,0.001479156,0.00033330132,0.001563438,0.0016708696,0.001814203,0.25176653],"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.00082748826,0.00013625207,0.00030671732,0.00039102766,0.00004346194,0.00008675199,0.00003862762,0.001337791,0.00565409,0.008756308,0.9051512,0.07727022],"study_design_scores_gemma":[0.00038501166,0.00020145914,0.0011386421,0.00011963388,0.000048805683,0.00017481005,0.000051885545,0.015705373,0.0052581187,0.017256653,0.9596202,0.00003929599],"about_ca_topic_score_codex":0.0013728288,"about_ca_topic_score_gemma":0.0026969728,"teacher_disagreement_score":0.66621184,"about_ca_system_score_codex":0.00068790687,"about_ca_system_score_gemma":0.00088861695,"threshold_uncertainty_score":0.47610825},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0100431945,0.14934619,0.35164282,0.02536505,0.08342149,0.001585039,0.006423024,0.011426389,0.3607469],"genre_scores_gemma":[0.059099365,0.11111671,0.197504,0.0063173017,0.029022751,0.0014997933,0.017800646,0.005305986,0.5723335],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964114,0.0008422327,0.00032138822,0.00048796824,0.0016786584,0.0002583385],"domain_scores_gemma":[0.9954627,0.0011966502,0.00016972417,0.0012199866,0.001291487,0.0006594591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036297801,0.0022227617,0.0025776864,0.0015542391,0.0012556167,0.0075254356,0.0024620525,0.0016125552,0.11306133],"category_scores_gemma":[0.0072056423,0.0011416859,0.0013464155,0.0024199064,0.0015203679,0.005092087,0.0033383172,0.005864388,0.05342286],"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.00024600365,0.00017912293,0.0006547266,0.0008906965,0.00020001328,0.00014374769,0.00022232464,0.0019461948,0.0033687642,0.034788713,0.66764545,0.28971422],"study_design_scores_gemma":[0.000039291455,0.0000952412,0.00055305153,0.00023638383,0.000034725155,0.0002849792,0.00007234397,0.0049085133,0.0009320888,0.021738827,0.97107464,0.000029881672],"about_ca_topic_score_codex":0.0017248163,"about_ca_topic_score_gemma":0.002029479,"teacher_disagreement_score":0.11306133,"about_ca_system_score_codex":0.0015662451,"about_ca_system_score_gemma":0.0036886064,"threshold_uncertainty_score":0.37822783},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006626647,0.00647579,0.3924377,0.0024146666,0.0010037267,0.00020185811,0.0011039706,0.0034400236,0.58629566],"genre_scores_gemma":[0.11520023,0.01187023,0.31833023,0.0012333925,0.0005892483,0.0003601158,0.0037802074,0.0030998955,0.5455364],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997546,0.000044465996,0.0000069268167,0.00006957918,0.00010020826,0.000024202434],"domain_scores_gemma":[0.99964535,0.00013110398,0.000011411945,0.00011908805,0.00006337845,0.000029609822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024307659,0.00097590685,0.00051501184,0.0013103879,0.00074614666,0.0013230647,0.0010263299,0.000583922,0.05608906],"category_scores_gemma":[0.0011138932,0.0003984037,0.0008142297,0.0016952269,0.00079923664,0.0026061796,0.0021478331,0.0015820859,0.017457495],"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.00005526519,0.00005616344,0.00017416046,0.00047091383,0.00003182502,0.00008787431,0.00021944862,0.010638037,0.0033917567,0.3203097,0.1622747,0.5022902],"study_design_scores_gemma":[0.000016181555,0.000027801549,0.00024120716,0.00020584266,0.000024162515,0.00031364054,0.00012299312,0.021042215,0.0043951557,0.4445085,0.52907926,0.000022981174],"about_ca_topic_score_codex":0.0010224564,"about_ca_topic_score_gemma":0.0023840284,"teacher_disagreement_score":0.05608906,"about_ca_system_score_codex":0.0006980028,"about_ca_system_score_gemma":0.0008231602,"threshold_uncertainty_score":0.18763661},"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":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064771296,0.0031161597,0.022118034,0.001986545,0.0017043358,0.00021489007,0.12264042,0.026704207,0.8208677],"genre_scores_gemma":[0.004088528,0.0055886637,0.0142329,0.0009700358,0.000608865,0.00024064397,0.15933007,0.014610865,0.8003293],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99954885,0.00004355758,0.000020403346,0.00009436509,0.0002549926,0.000037824208],"domain_scores_gemma":[0.99859685,0.00029403082,0.00006378852,0.00042520752,0.00040253656,0.00021757984],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042045975,0.0018165989,0.0013112114,0.008753047,0.0010040891,0.0036810297,0.0029728042,0.0011496685,0.78840894],"category_scores_gemma":[0.0031230948,0.0007446588,0.0006965439,0.0097938925,0.00043174654,0.003623186,0.0023669063,0.0018256824,0.71147406],"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.000009892999,0.000023137614,0.000031558124,0.00023175743,0.0000047407952,0.00002006362,0.000017344186,0.00022842496,0.00029482768,0.006356601,0.9230376,0.069744095],"study_design_scores_gemma":[0.00000801775,0.000004509576,0.00007586035,0.00008978662,0.0000060707634,0.00005625679,0.000020069365,0.00034984542,0.0003640911,0.011434533,0.98758245,0.000008702969],"about_ca_topic_score_codex":0.0025798157,"about_ca_topic_score_gemma":0.0055997805,"teacher_disagreement_score":0.78840894,"about_ca_system_score_codex":0.0009858477,"about_ca_system_score_gemma":0.0013210443,"threshold_uncertainty_score":0.30180895},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002377271,0.0035826499,0.37741244,0.0019493471,0.001620722,0.00018589247,0.0021292067,0.004308131,0.6064343],"genre_scores_gemma":[0.05623334,0.009127029,0.21644293,0.0011793509,0.00084362406,0.00031778097,0.00890532,0.0027094537,0.70424116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977416,0.000038131497,0.000008569688,0.00006622442,0.000092680006,0.000020178883],"domain_scores_gemma":[0.9998023,0.000033066393,0.000007338251,0.00008280062,0.000060056387,0.000014432059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020426915,0.00096190086,0.00047712564,0.0016154667,0.0006890847,0.0022585692,0.0012106708,0.00071367295,0.08136377],"category_scores_gemma":[0.0007049439,0.00035930306,0.00054486026,0.0021505174,0.00074886065,0.0031316902,0.0012262313,0.0015246964,0.041049942],"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.000017762597,0.000032059295,0.000039724702,0.00022135644,0.000010957798,0.0000510672,0.00011249382,0.0030648697,0.0025778261,0.4793671,0.19665785,0.31784692],"study_design_scores_gemma":[0.0000059295157,0.000011581384,0.00007621746,0.000094173636,0.000012600544,0.00015331616,0.0000678689,0.005918711,0.0021097215,0.2982414,0.6932946,0.0000139553285],"about_ca_topic_score_codex":0.001693963,"about_ca_topic_score_gemma":0.0022561871,"teacher_disagreement_score":0.08136377,"about_ca_system_score_codex":0.0009096651,"about_ca_system_score_gemma":0.0006999602,"threshold_uncertainty_score":0.2721889},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018539439,0.019961657,0.19667268,0.0039029995,0.0032739146,0.00012915353,0.0011025232,0.0024655145,0.77063763],"genre_scores_gemma":[0.031367805,0.025682356,0.12922442,0.0020550096,0.0024710542,0.0002580522,0.0032962917,0.002272856,0.8033721],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938023,0.00010605069,0.000017891174,0.0001555666,0.0002875607,0.000052686286],"domain_scores_gemma":[0.999448,0.0001731596,0.000016423517,0.00018328725,0.00013287524,0.000046199784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039657255,0.0014491699,0.0008725284,0.0019359447,0.00094607467,0.002474674,0.0016416063,0.0009905532,0.08364065],"category_scores_gemma":[0.0014596622,0.00056698435,0.00069653,0.003403486,0.0011490646,0.0032252946,0.0016388326,0.0026623255,0.056659993],"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.000018296014,0.00006316964,0.00009209431,0.0003111944,0.000020571548,0.000027761915,0.00008919007,0.0029271112,0.00079436495,0.23076679,0.36474484,0.40014464],"study_design_scores_gemma":[0.00000756942,0.000011505886,0.00016801478,0.00015112558,0.00001222249,0.000103416176,0.000044690576,0.0037876188,0.0008014628,0.28269517,0.7122063,0.0000109869325],"about_ca_topic_score_codex":0.0012529644,"about_ca_topic_score_gemma":0.0025295096,"teacher_disagreement_score":0.08364065,"about_ca_system_score_codex":0.001689051,"about_ca_system_score_gemma":0.0012754234,"threshold_uncertainty_score":0.27980584},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019492878,0.00048846396,0.9703884,0.0008780646,0.0001321316,0.00018613826,0.0032758461,0.0021073096,0.0030507697],"genre_scores_gemma":[0.23331645,0.00091002515,0.74766564,0.0003059298,0.00017639824,0.0005513455,0.011331004,0.00053130067,0.0052118716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726343,0.00037634527,0.0004379338,0.0005662825,0.0011437021,0.00021227503],"domain_scores_gemma":[0.9927604,0.001294014,0.0009383614,0.0032905815,0.0013389641,0.00037766068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018598808,0.0009841017,0.00238284,0.0029404631,0.0022586414,0.0040572598,0.004460879,0.0014624853,0.007422395],"category_scores_gemma":[0.013535943,0.00090118265,0.0016105567,0.0059692995,0.0015040024,0.014357692,0.0045096087,0.003116378,0.0032295175],"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.00078888977,0.00030622917,0.0025976507,0.0007060982,0.000119595104,0.0001864935,0.00053591345,0.14167137,0.0045363363,0.6165607,0.025465649,0.20652506],"study_design_scores_gemma":[0.00011915516,0.00014470822,0.00041180316,0.000060862563,0.000042592408,0.00029380567,0.0002619828,0.37515566,0.0047024037,0.59420896,0.024523865,0.00007421501],"about_ca_topic_score_codex":0.00303305,"about_ca_topic_score_gemma":0.0029590942,"teacher_disagreement_score":0.007422395,"about_ca_system_score_codex":0.0017083479,"about_ca_system_score_gemma":0.002336126,"threshold_uncertainty_score":0.024830341},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00526895,0.0008562899,0.00029637874,0.00046151428,0.0001883763,0.00013244314,0.9877065,0.00045162285,0.004637868],"genre_scores_gemma":[0.021148093,0.00067981466,0.0010737218,0.0005268533,0.00009683862,0.0006016005,0.9715973,0.00008404624,0.0041917153],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815136,0.00028439725,0.0004953509,0.0005625138,0.00033508267,0.00017127264],"domain_scores_gemma":[0.993785,0.002138907,0.001466301,0.0010295644,0.0012615847,0.00031863802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013731682,0.0010729899,0.001077457,0.0029145333,0.0006487203,0.002075891,0.0020855307,0.0014834724,0.027204776],"category_scores_gemma":[0.019120097,0.00034569914,0.0015774355,0.003825621,0.000306378,0.0018346136,0.0009822582,0.0019067652,0.0146796405],"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.0007808671,0.00012590886,0.034014948,0.0031766326,0.0002621027,0.000092695336,0.00009391608,0.0011255639,0.00014338094,0.0017774919,0.9299126,0.028493848],"study_design_scores_gemma":[0.001075674,0.00027091848,0.13509709,0.0025587159,0.0004952066,0.00086417876,0.0004374048,0.005173036,0.0011504217,0.007836095,0.8448533,0.00018808313],"about_ca_topic_score_codex":0.016552525,"about_ca_topic_score_gemma":0.027795918,"teacher_disagreement_score":0.027204776,"about_ca_system_score_codex":0.0014463045,"about_ca_system_score_gemma":0.00148482,"threshold_uncertainty_score":0.09100908},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063998806,0.020564517,0.68869376,0.0014855821,0.0017770691,0.0004258028,0.0029452883,0.022434058,0.25527406],"genre_scores_gemma":[0.05569054,0.0153645305,0.4458634,0.0011048629,0.0009620858,0.00033980364,0.011164515,0.002723449,0.46678674],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947196,0.000042359785,0.000035895813,0.00013743615,0.0002583779,0.000053983826],"domain_scores_gemma":[0.99955183,0.000095296426,0.000015205765,0.00017596009,0.00013103458,0.00003053232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041505275,0.0013345992,0.0010923856,0.001313453,0.0007556363,0.0030803282,0.0020646604,0.0007673696,0.062630855],"category_scores_gemma":[0.00089533755,0.0006884109,0.000635829,0.0032858008,0.00036783458,0.0026342361,0.0014050371,0.001381818,0.04933685],"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.00014035558,0.00012709416,0.0001769931,0.00052243547,0.000048119116,0.00010772176,0.00011078438,0.0024381562,0.017541654,0.032180373,0.20775968,0.7388466],"study_design_scores_gemma":[0.000055431483,0.00011967048,0.0008416005,0.00018426219,0.00007515746,0.0009571908,0.0000916912,0.04205064,0.024578998,0.07272061,0.8582713,0.00005341801],"about_ca_topic_score_codex":0.0011766808,"about_ca_topic_score_gemma":0.0020770906,"teacher_disagreement_score":0.062630855,"about_ca_system_score_codex":0.0006296602,"about_ca_system_score_gemma":0.0008093251,"threshold_uncertainty_score":0.20952111},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046252124,0.0005960738,0.9393801,0.0008273863,0.00020360717,0.00042004196,0.0008913281,0.007773927,0.0036553459],"genre_scores_gemma":[0.105771,0.00019710389,0.88610697,0.0003803961,0.000043636817,0.00024825847,0.002756642,0.0010258966,0.0034701254],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834025,0.00033387705,0.00012008929,0.0005015083,0.0005013369,0.00020281668],"domain_scores_gemma":[0.9956352,0.001802777,0.00034299388,0.0014893244,0.00052008586,0.0002095693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016913209,0.0016074704,0.0015094868,0.0030964215,0.001521646,0.0018264775,0.0031372388,0.0017431986,0.0073315147],"category_scores_gemma":[0.012115489,0.0008244162,0.0016222477,0.0030281257,0.0012116936,0.0035213379,0.002697515,0.0020168677,0.002573676],"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.0006528489,0.0007156144,0.0097533,0.0010117023,0.0002603946,0.0006591959,0.00081829075,0.14181964,0.025744487,0.041469373,0.045409884,0.7316853],"study_design_scores_gemma":[0.0001327285,0.00021745861,0.00089738955,0.000105220824,0.000092136455,0.00046090948,0.00048156866,0.87794405,0.015381697,0.08436446,0.019890882,0.00003143907],"about_ca_topic_score_codex":0.004458654,"about_ca_topic_score_gemma":0.012791464,"teacher_disagreement_score":0.0073315147,"about_ca_system_score_codex":0.0008336504,"about_ca_system_score_gemma":0.002667042,"threshold_uncertainty_score":0.024526358},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042156316,0.019628393,0.21732952,0.0071508437,0.0066290777,0.00036992296,0.006840427,0.00739587,0.7304404],"genre_scores_gemma":[0.036634136,0.018121855,0.13645762,0.0024884907,0.003850337,0.00032456976,0.020738382,0.0032834795,0.77810115],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995247,0.000048121998,0.000016367238,0.00017374476,0.00019503152,0.00004206195],"domain_scores_gemma":[0.99929035,0.00015521668,0.000029539438,0.00023884395,0.00021179338,0.000074211806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039809957,0.0012043982,0.0008445732,0.0028578057,0.0010098395,0.0029176816,0.0017415573,0.0010465417,0.09905607],"category_scores_gemma":[0.0017024105,0.00045554707,0.0008592059,0.003679605,0.0007427166,0.0038235702,0.0015178582,0.0022113011,0.081823885],"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.000020331327,0.000041963372,0.00012230026,0.0002606876,0.000015531972,0.000020411759,0.000038302278,0.001255022,0.001009316,0.058846053,0.4840192,0.45435083],"study_design_scores_gemma":[0.0000062871663,0.000017709877,0.0004283519,0.00016456988,0.000017426368,0.00018623701,0.000051641437,0.005646421,0.0016610296,0.15463026,0.8371737,0.00001643557],"about_ca_topic_score_codex":0.0016084418,"about_ca_topic_score_gemma":0.0029534919,"teacher_disagreement_score":0.09905607,"about_ca_system_score_codex":0.0012706012,"about_ca_system_score_gemma":0.0011408683,"threshold_uncertainty_score":0.33137554},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014123671,0.010570618,0.007743024,0.041430302,0.30182812,0.00054439815,0.011330262,0.0015014089,0.6236395],"genre_scores_gemma":[0.0057321475,0.004061727,0.002458326,0.008076322,0.032947395,0.00027079973,0.0062620332,0.00072490855,0.93946636],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99926025,0.00011273911,0.000043020573,0.00012865133,0.00038729448,0.00006808411],"domain_scores_gemma":[0.9943481,0.00080831506,0.00019076109,0.00047563462,0.003191506,0.0009857414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013400523,0.0008901092,0.00056870026,0.0029267278,0.0023474959,0.0031827178,0.0012114178,0.0009368499,0.44632158],"category_scores_gemma":[0.0118421065,0.00023775335,0.0004847608,0.0017085668,0.0005509862,0.0022049,0.0021403693,0.0025624947,0.30010673],"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.000026215592,0.000017755858,0.00008412471,0.00006948512,0.0000014707136,0.000025942538,0.000039699255,0.0000439946,0.00009911397,0.0043669892,0.9605202,0.03470499],"study_design_scores_gemma":[0.000004167729,0.000011809212,0.00020550516,0.00008759728,0.0000017035318,0.000030303023,0.000054526976,0.000024886729,0.00008670448,0.0036520471,0.99583685,0.0000039811284],"about_ca_topic_score_codex":0.003230692,"about_ca_topic_score_gemma":0.00468156,"teacher_disagreement_score":0.44632158,"about_ca_system_score_codex":0.0017600198,"about_ca_system_score_gemma":0.002209422,"threshold_uncertainty_score":0},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018708258,0.020346185,0.17547473,0.004592864,0.004172914,0.00013034754,0.0013368558,0.0025516723,0.7895236],"genre_scores_gemma":[0.03166135,0.026018614,0.11705897,0.0022920077,0.0030955076,0.00026269263,0.0038957628,0.0024818652,0.8132332],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993518,0.0001078256,0.000018139383,0.0001699891,0.00029666026,0.00005558093],"domain_scores_gemma":[0.999363,0.00019609164,0.000018971003,0.00021493244,0.00014833019,0.000058740712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042667394,0.0014856848,0.0008697502,0.001926522,0.0009718488,0.0028030707,0.0016832255,0.0010648065,0.094926454],"category_scores_gemma":[0.001657026,0.0005671035,0.0007353524,0.003394771,0.0011721385,0.0033881792,0.0017570674,0.0028432033,0.06903932],"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.000019714009,0.00006584089,0.00009347424,0.00034325445,0.00002114218,0.000027691292,0.00008802423,0.0026718003,0.0007822806,0.24007113,0.3993971,0.35641846],"study_design_scores_gemma":[0.000007383662,0.0000112510315,0.00015942406,0.00014572426,0.000011766437,0.00009464164,0.00004088098,0.0030931504,0.0006841391,0.2813217,0.71442,0.000009905914],"about_ca_topic_score_codex":0.0010796306,"about_ca_topic_score_gemma":0.0020762377,"teacher_disagreement_score":0.094926454,"about_ca_system_score_codex":0.0016934695,"about_ca_system_score_gemma":0.001321661,"threshold_uncertainty_score":0.3175606},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040053753,0.004023595,0.15024261,0.0024683438,0.0010211782,0.000073312185,0.0009541631,0.00081847614,0.83639294],"genre_scores_gemma":[0.124368206,0.010826775,0.05467427,0.0014181444,0.0010636211,0.00022483071,0.0024716917,0.0009776816,0.8039748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99976903,0.00004967472,0.000006405685,0.00006273314,0.00008548336,0.0000266415],"domain_scores_gemma":[0.99964607,0.00013371395,0.00001973026,0.000080842845,0.00008483091,0.000034721827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020823562,0.000666661,0.00036369302,0.001105125,0.00086602475,0.0014434666,0.0006804973,0.0006188756,0.061985664],"category_scores_gemma":[0.0011243337,0.00040165483,0.00035633193,0.0012880414,0.0009159815,0.0024281507,0.0008991671,0.0014162658,0.016865442],"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.0000076108868,0.000013768674,0.000041996827,0.00005470549,0.0000045095376,0.000021501986,0.00006392427,0.0016411633,0.000363683,0.877921,0.06210901,0.05775709],"study_design_scores_gemma":[0.0000032992573,0.000005510356,0.000084513726,0.000047690224,0.000005436299,0.00007057454,0.000037185204,0.0035945044,0.00040317784,0.75363535,0.24210452,0.000008313044],"about_ca_topic_score_codex":0.0020456216,"about_ca_topic_score_gemma":0.0031694164,"teacher_disagreement_score":0.061985664,"about_ca_system_score_codex":0.0012464498,"about_ca_system_score_gemma":0.0009603776,"threshold_uncertainty_score":0.20736271},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005278439,0.002686126,0.14621967,0.005787056,0.00095584005,0.00015197786,0.0016724255,0.00042604795,0.8368224],"genre_scores_gemma":[0.24785234,0.011115483,0.037373576,0.0023825723,0.0015538923,0.00070588157,0.0034505671,0.00034468932,0.6952211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949026,0.00014450146,0.000015755999,0.00011846722,0.00016387158,0.000067214096],"domain_scores_gemma":[0.9993698,0.00020754572,0.000053920277,0.00015707783,0.00014865519,0.00006297892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048810296,0.0013654045,0.0006136575,0.001404809,0.00104282,0.002965054,0.001808814,0.0015971328,0.055005718],"category_scores_gemma":[0.002539293,0.00033925957,0.0005375512,0.0018005908,0.001250606,0.0052285763,0.0014219439,0.0019771303,0.012847633],"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.000004892338,0.000013296356,0.000050365994,0.0000308095,0.0000046510377,0.000034070952,0.000036919355,0.003361924,0.00006171866,0.96051854,0.024781972,0.011100785],"study_design_scores_gemma":[0.0000048408847,0.0000053876965,0.000047678277,0.00002620614,0.0000060906495,0.000067469606,0.000055525295,0.010143835,0.00006305915,0.90209883,0.08747595,0.00000515605],"about_ca_topic_score_codex":0.0032858176,"about_ca_topic_score_gemma":0.0029659052,"teacher_disagreement_score":0.055005718,"about_ca_system_score_codex":0.0017755707,"about_ca_system_score_gemma":0.0008938573,"threshold_uncertainty_score":0.18401247},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012620295,0.01304176,0.12959312,0.0044674673,0.0058410107,0.00016234531,0.004244792,0.0038724907,0.83751494],"genre_scores_gemma":[0.016594341,0.022258952,0.05468122,0.0022948592,0.0025652533,0.0003481912,0.006105532,0.0024851924,0.8926665],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997862,0.000030226083,0.000009668726,0.0000652003,0.00009303446,0.000015615646],"domain_scores_gemma":[0.9997843,0.000055617398,0.000013139225,0.000059776346,0.00006284182,0.000024459254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017648682,0.0013912289,0.0005341308,0.0015747043,0.0006885034,0.0029557478,0.0010616174,0.0010321185,0.11890578],"category_scores_gemma":[0.00091131375,0.0004113643,0.00032533842,0.0024112263,0.0008360246,0.005288651,0.0015969648,0.0016957507,0.080124326],"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.000010924017,0.000017367327,0.000037625534,0.0003887797,0.000006963662,0.00005680652,0.00007431491,0.0014937066,0.00086185895,0.23524721,0.55532646,0.20647804],"study_design_scores_gemma":[0.0000021956814,0.0000043003292,0.000035839923,0.000068429064,0.00000369348,0.00010171349,0.000022727381,0.00054729526,0.00020855092,0.062532745,0.9364669,0.000005600338],"about_ca_topic_score_codex":0.0011109075,"about_ca_topic_score_gemma":0.0023004408,"teacher_disagreement_score":0.11890578,"about_ca_system_score_codex":0.0008166536,"about_ca_system_score_gemma":0.00063926453,"threshold_uncertainty_score":0.39777946},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005461401,0.004202866,0.38579747,0.001553462,0.0012567139,0.0001906367,0.0009374044,0.0018059786,0.598794],"genre_scores_gemma":[0.094454676,0.009488216,0.36006948,0.0018002284,0.0011068489,0.00037445076,0.005352454,0.0035119413,0.52384174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997571,0.000033078708,0.0000075711096,0.00008461877,0.00008263887,0.00003493705],"domain_scores_gemma":[0.999655,0.000056604356,0.000013866865,0.00010916136,0.00012178004,0.00004366835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025852697,0.00094325206,0.0005548259,0.0013556354,0.0007687283,0.0018266767,0.00093380344,0.00063114025,0.038411908],"category_scores_gemma":[0.00078663195,0.00047706283,0.0006565915,0.0014401877,0.0008104244,0.002800304,0.0016589344,0.002186373,0.02065721],"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.000032038388,0.000047524838,0.00009110417,0.00030044783,0.000017802278,0.00005418993,0.00014000441,0.0020653636,0.002933022,0.58991504,0.14006767,0.26433578],"study_design_scores_gemma":[0.00000921068,0.000016580316,0.00020190985,0.00015914999,0.000022305634,0.00023895894,0.00008492032,0.0066139675,0.0029555946,0.5356257,0.45406076,0.000010846945],"about_ca_topic_score_codex":0.00091444637,"about_ca_topic_score_gemma":0.0019114992,"teacher_disagreement_score":0.038411908,"about_ca_system_score_codex":0.0009302142,"about_ca_system_score_gemma":0.0009594008,"threshold_uncertainty_score":0.12850064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043379124,0.0022964268,0.5496589,0.0018221226,0.00096403883,0.00041211318,0.0024631661,0.005367002,0.43267828],"genre_scores_gemma":[0.08658777,0.0037964925,0.3080335,0.0011561016,0.00062426564,0.0007750041,0.0063118148,0.0023597642,0.5903554],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895096,0.0002204086,0.000048406633,0.00020304411,0.00045479726,0.00012245822],"domain_scores_gemma":[0.99927825,0.0001910823,0.000040115112,0.00029974754,0.00013483802,0.000055919863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093164796,0.0011864597,0.0008878409,0.001101543,0.0006283125,0.0033002682,0.001547086,0.0014256088,0.1524563],"category_scores_gemma":[0.004244277,0.00045063312,0.000686224,0.0017872654,0.00041446544,0.0029624288,0.002156723,0.0016891845,0.06572938],"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.00016104741,0.00014556263,0.00022815749,0.00020322841,0.00004435897,0.00005101607,0.000027298345,0.022985108,0.0011286899,0.1954645,0.17965518,0.5999057],"study_design_scores_gemma":[0.00011632367,0.00014520047,0.0002394234,0.00013171873,0.00003527177,0.0003282739,0.000043429434,0.11363768,0.0035309487,0.44740492,0.43436316,0.000023595878],"about_ca_topic_score_codex":0.00040060765,"about_ca_topic_score_gemma":0.00067703164,"teacher_disagreement_score":0.1524563,"about_ca_system_score_codex":0.0007216453,"about_ca_system_score_gemma":0.0012193548,"threshold_uncertainty_score":0.51001716},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010445672,0.018124392,0.041922025,0.004563061,0.002409111,0.00003823547,0.00041749986,0.00043910093,0.9310421],"genre_scores_gemma":[0.046812788,0.027384616,0.029543454,0.0031036022,0.0027016713,0.00016926027,0.0011912723,0.0010077474,0.8880856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995981,0.00011036971,0.00000967447,0.00008597503,0.00015801801,0.000037904905],"domain_scores_gemma":[0.9997396,0.000095438925,0.000009917413,0.00006653916,0.00006236878,0.000026239026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000275829,0.0011647186,0.0007679061,0.0020226634,0.0013588093,0.0029264314,0.0012254613,0.001106047,0.059151042],"category_scores_gemma":[0.00085550116,0.00046007233,0.00051381346,0.0029484243,0.0023706611,0.0037788888,0.0014227363,0.0029665218,0.02766178],"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.0000051287725,0.000015819216,0.000035303045,0.00013861303,0.0000069084713,0.000015817812,0.00012743985,0.0005121417,0.00020242321,0.75428617,0.17480044,0.069853775],"study_design_scores_gemma":[0.0000025345935,0.0000034114423,0.00005902925,0.00008496613,0.000004153965,0.00004072752,0.00005968976,0.0004919003,0.00013573925,0.54684955,0.4522636,0.0000046229634],"about_ca_topic_score_codex":0.0017825689,"about_ca_topic_score_gemma":0.0031743224,"teacher_disagreement_score":0.059151042,"about_ca_system_score_codex":0.0022773806,"about_ca_system_score_gemma":0.0011398059,"threshold_uncertainty_score":0.19787991},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012053205,0.0036699336,0.20388132,0.0013199027,0.0014631974,0.0001350525,0.0012907224,0.003703814,0.78333074],"genre_scores_gemma":[0.028037477,0.0086124325,0.14206003,0.0009515105,0.0008901804,0.00021425009,0.00466336,0.0026700408,0.81190073],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997459,0.00002988895,0.000007117164,0.00007776981,0.000119788165,0.000019542163],"domain_scores_gemma":[0.999731,0.00006218229,0.000008200048,0.00009187721,0.00007855618,0.000028205399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019294494,0.0012712888,0.00053900445,0.0017693681,0.00076293596,0.0021611936,0.0015085837,0.00085557083,0.17314707],"category_scores_gemma":[0.0009751502,0.0005703067,0.0006540951,0.002534323,0.0006581769,0.002519118,0.0012710503,0.0018455733,0.08241643],"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.000014250926,0.000030348034,0.000056949364,0.00022657031,0.000012570894,0.000049410657,0.00008465401,0.003532332,0.0014181836,0.19767772,0.3645554,0.43234164],"study_design_scores_gemma":[0.0000064863034,0.000008035298,0.000101418926,0.00009217547,0.000009727832,0.00011991043,0.000040436767,0.0047936877,0.0010989438,0.1671686,0.8265505,0.000010114495],"about_ca_topic_score_codex":0.0014076199,"about_ca_topic_score_gemma":0.0030703372,"teacher_disagreement_score":0.17314707,"about_ca_system_score_codex":0.00078982604,"about_ca_system_score_gemma":0.0006152405,"threshold_uncertainty_score":0.57923466},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002410827,0.003608126,0.36791563,0.0022351176,0.0019676173,0.0001950553,0.0024942423,0.0047748666,0.6143984],"genre_scores_gemma":[0.058182556,0.009295765,0.2152352,0.0013521321,0.0010146218,0.0003391792,0.010477563,0.0030136525,0.7010894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997619,0.00003933296,0.00000907032,0.00007167735,0.00009673845,0.000021245594],"domain_scores_gemma":[0.9997749,0.000037105965,0.0000082417555,0.000095489275,0.00006717395,0.00001704489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021895884,0.0009866956,0.00048215917,0.001649279,0.00070173724,0.00245351,0.001236293,0.0007653327,0.087930806],"category_scores_gemma":[0.0008026988,0.00036426037,0.0005759202,0.0021574928,0.0007486045,0.0032620046,0.001283245,0.0016093212,0.046978097],"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.000019277259,0.000034219047,0.000041523996,0.00023838984,0.000011690475,0.000051397685,0.000109428496,0.0029440403,0.0025530695,0.48929942,0.2096237,0.29507387],"study_design_scores_gemma":[0.000006104199,0.000012205434,0.00007500853,0.00009461896,0.000013073296,0.00014840718,0.00006311294,0.005432826,0.001988105,0.28978458,0.70236844,0.0000134684915],"about_ca_topic_score_codex":0.0015217635,"about_ca_topic_score_gemma":0.001955693,"teacher_disagreement_score":0.087930806,"about_ca_system_score_codex":0.0009084135,"about_ca_system_score_gemma":0.000726076,"threshold_uncertainty_score":0.2941578},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006078847,0.007816839,0.31675705,0.0021818331,0.0016422397,0.00028032088,0.0017663446,0.0034306925,0.6600459],"genre_scores_gemma":[0.1082456,0.016487494,0.259411,0.0016420333,0.001434972,0.0003291578,0.009458739,0.00278633,0.60020465],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994628,0.000062206775,0.000019176929,0.00019129904,0.00020977874,0.00005474039],"domain_scores_gemma":[0.99960667,0.00008280827,0.000020294412,0.00017526984,0.000083572755,0.000031462292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033081122,0.0009102456,0.00067663006,0.0018457692,0.00088965864,0.0017149812,0.0016153097,0.0009963557,0.0635914],"category_scores_gemma":[0.001320433,0.00048475066,0.0007463835,0.0035869924,0.00080957427,0.0047230786,0.0020436,0.0014547076,0.031653095],"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.000042096024,0.00007418159,0.00014215581,0.00039796674,0.000032535772,0.000064815904,0.000107348846,0.0036622928,0.0030170912,0.31539118,0.16380933,0.5132591],"study_design_scores_gemma":[0.000011573977,0.000027047543,0.00026482882,0.0001546323,0.000034015313,0.0003829673,0.000080998776,0.008413341,0.0052173426,0.39133322,0.59406203,0.000017917342],"about_ca_topic_score_codex":0.001168222,"about_ca_topic_score_gemma":0.0018116098,"teacher_disagreement_score":0.0635914,"about_ca_system_score_codex":0.0011251668,"about_ca_system_score_gemma":0.00094978476,"threshold_uncertainty_score":0.2127344},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065262117,0.0063131936,0.3748323,0.002668383,0.0011717139,0.00020800631,0.0012639471,0.0037353402,0.6032808],"genre_scores_gemma":[0.11833315,0.011821503,0.30930337,0.0013865324,0.0006853407,0.00038751215,0.0043856306,0.003441891,0.55025506],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997377,0.000047456582,0.0000074654945,0.00007629634,0.00010525872,0.000025777446],"domain_scores_gemma":[0.9995895,0.0001493376,0.000012751169,0.00014194244,0.00007096909,0.000035476303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026355273,0.0010063463,0.0005169819,0.0013041637,0.0007506901,0.001445225,0.001053341,0.0006202526,0.0620583],"category_scores_gemma":[0.0012816015,0.00040666107,0.0008585786,0.0017027622,0.00079673907,0.0027764074,0.002289698,0.0016900164,0.02041845],"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.00006028602,0.000060790095,0.00018079737,0.00051467435,0.00003358198,0.00009195976,0.00022160517,0.010263962,0.0033997155,0.33842355,0.1726922,0.47405687],"study_design_scores_gemma":[0.000016575108,0.000028623055,0.0002323212,0.0002063637,0.000024396639,0.00030703854,0.000115975905,0.019158848,0.0040305206,0.44158357,0.5342741,0.000021684587],"about_ca_topic_score_codex":0.00092014746,"about_ca_topic_score_gemma":0.0021196364,"teacher_disagreement_score":0.0620583,"about_ca_system_score_codex":0.00070758734,"about_ca_system_score_gemma":0.00087399664,"threshold_uncertainty_score":0.20760572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002449748,0.010687844,0.32680634,0.004625877,0.0025094978,0.00012962072,0.0016478907,0.0029829103,0.6481603],"genre_scores_gemma":[0.056750283,0.01562544,0.15319403,0.002006456,0.0023030199,0.00023379868,0.0050268965,0.0032322963,0.7616278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995819,0.000068851565,0.000011666455,0.00012339043,0.000183154,0.00003105947],"domain_scores_gemma":[0.9994709,0.00014328297,0.000017593386,0.00018707845,0.00014768064,0.000033508164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037546828,0.0011489394,0.0006986906,0.0029189677,0.0010097048,0.002252174,0.001252727,0.00076312973,0.07383237],"category_scores_gemma":[0.0014456683,0.00051876093,0.0008816906,0.002621497,0.0013820595,0.0025825223,0.0013560369,0.0020609589,0.04637156],"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.000016169035,0.00003782036,0.0001376598,0.00023128065,0.000026696138,0.00003913069,0.00012382111,0.0028000297,0.0012984945,0.43640253,0.27994838,0.27893803],"study_design_scores_gemma":[0.000004176814,0.000007639699,0.00025150538,0.00010230308,0.000016224221,0.00010549538,0.0000628944,0.0047767772,0.0012984182,0.51627004,0.47709167,0.000012846122],"about_ca_topic_score_codex":0.0015707075,"about_ca_topic_score_gemma":0.0027283577,"teacher_disagreement_score":0.07383237,"about_ca_system_score_codex":0.0014231876,"about_ca_system_score_gemma":0.0009234973,"threshold_uncertainty_score":0.24699384},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004757245,0.003866877,0.39575076,0.0036486525,0.0020421853,0.00017497512,0.0031105948,0.0034213362,0.58322746],"genre_scores_gemma":[0.10100571,0.009233239,0.13597213,0.0013326546,0.0012738967,0.00024674681,0.009041635,0.0022073782,0.73968667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963915,0.00005257198,0.000014329951,0.000120827186,0.00014667449,0.000026465146],"domain_scores_gemma":[0.99945325,0.0001441494,0.000019150484,0.00018646117,0.00014764773,0.00004937489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003202946,0.0006886707,0.00038052193,0.0014538621,0.00094644824,0.0021372004,0.0010047667,0.0004769046,0.059659727],"category_scores_gemma":[0.0017238607,0.0003416484,0.00040504427,0.0023561497,0.000845556,0.0043283445,0.0014645681,0.0016198794,0.02265253],"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.000021865188,0.000040250347,0.0001156365,0.00019065183,0.000012262358,0.000042031574,0.00015292972,0.003297475,0.000866348,0.5953787,0.15079372,0.24908824],"study_design_scores_gemma":[0.0000047360695,0.000007256591,0.000104974984,0.000069543414,0.000011139731,0.00008853524,0.000059889033,0.0040256344,0.0010180194,0.43694225,0.5576585,0.000009577731],"about_ca_topic_score_codex":0.0018428091,"about_ca_topic_score_gemma":0.0024378619,"teacher_disagreement_score":0.059659727,"about_ca_system_score_codex":0.0011280591,"about_ca_system_score_gemma":0.0010297823,"threshold_uncertainty_score":0.19958162},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057638255,0.004609732,0.52112764,0.0013582418,0.0013167891,0.0004863958,0.002222731,0.0045915064,0.45852324],"genre_scores_gemma":[0.06601122,0.008359616,0.5319649,0.0011138143,0.0006201229,0.00048445718,0.010533482,0.0034297002,0.37748265],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996921,0.00003360808,0.00001046641,0.00011484599,0.00011803256,0.00003106467],"domain_scores_gemma":[0.9996549,0.000056437468,0.000010522957,0.00015017188,0.000100874684,0.000027188556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025027955,0.0011185698,0.00060756615,0.0016004697,0.00096009625,0.0013116003,0.0015037325,0.000671075,0.06710996],"category_scores_gemma":[0.0007650316,0.00057077926,0.0007807364,0.0020460521,0.000536904,0.002182031,0.0015497457,0.0013929033,0.036393583],"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.000082423576,0.00008959188,0.00015362346,0.0005714836,0.000037128408,0.000102841106,0.00013701564,0.008785052,0.012021159,0.14014395,0.17664753,0.6612282],"study_design_scores_gemma":[0.000022589657,0.00006270592,0.0005058217,0.00020139031,0.00004828175,0.0005989361,0.0001384509,0.020093322,0.014125636,0.17494938,0.7892255,0.000027949356],"about_ca_topic_score_codex":0.0013361145,"about_ca_topic_score_gemma":0.002447026,"teacher_disagreement_score":0.06710996,"about_ca_system_score_codex":0.0007024231,"about_ca_system_score_gemma":0.0007725441,"threshold_uncertainty_score":0.22450519},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033466544,0.015701486,0.2947846,0.0030511373,0.002665175,0.000054001008,0.0004812741,0.00160334,0.6783123],"genre_scores_gemma":[0.0831337,0.021566035,0.12324581,0.0017558732,0.0031826792,0.00014542248,0.0016298501,0.00241167,0.7629291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975866,0.000045374516,0.000005916036,0.000059644295,0.00011270814,0.000017624114],"domain_scores_gemma":[0.9997187,0.00008000196,0.000010832191,0.00007439238,0.00009166534,0.000024342651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002523041,0.0009882677,0.00064999645,0.0023998625,0.00086917856,0.0018239791,0.00082104857,0.0006978914,0.034446504],"category_scores_gemma":[0.0008672539,0.00037967708,0.00048453355,0.0022961022,0.0014198872,0.0022355448,0.0010495225,0.0020014122,0.02105597],"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.000009939936,0.000028636858,0.00007637508,0.00014799624,0.000014521326,0.000023630804,0.00010057838,0.002046667,0.0011729063,0.6318893,0.16891226,0.19557714],"study_design_scores_gemma":[0.0000024324086,0.0000055625424,0.00017479964,0.000078543795,0.000009692812,0.000098472876,0.00006232049,0.0053915353,0.00094908976,0.68227875,0.31093663,0.000012167681],"about_ca_topic_score_codex":0.0007971886,"about_ca_topic_score_gemma":0.0016827696,"teacher_disagreement_score":0.034446504,"about_ca_system_score_codex":0.0010717175,"about_ca_system_score_gemma":0.00058716314,"threshold_uncertainty_score":0.11523503},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040267576,0.008749385,0.20656821,0.0029312754,0.0021456254,0.0002343807,0.0012953395,0.002396806,0.7716522],"genre_scores_gemma":[0.07680155,0.015738672,0.14822106,0.0017558184,0.0013959623,0.00024629087,0.0048814267,0.0019096254,0.7490496],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994685,0.00006233279,0.00001791842,0.00018926138,0.00020923968,0.000052880012],"domain_scores_gemma":[0.99964,0.000079050114,0.00001978014,0.00014542927,0.00008183712,0.000033858214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034497352,0.00091373525,0.00064453366,0.0019765752,0.0010596486,0.0020467746,0.0015450565,0.0011467389,0.078230694],"category_scores_gemma":[0.0014030146,0.00050484075,0.0006620624,0.003413676,0.0009244626,0.0053730477,0.0020792086,0.001565186,0.04095651],"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.000035252786,0.00007097819,0.00010544158,0.00034759322,0.000023410097,0.00005332589,0.00010357507,0.0023734078,0.0019785576,0.37648708,0.18052103,0.43790042],"study_design_scores_gemma":[0.000008378632,0.000019270254,0.00017492962,0.00014412763,0.000020861165,0.0002433475,0.000067817455,0.004325175,0.002685251,0.36251277,0.629784,0.000014067475],"about_ca_topic_score_codex":0.0010693321,"about_ca_topic_score_gemma":0.0015691837,"teacher_disagreement_score":0.078230694,"about_ca_system_score_codex":0.001258938,"about_ca_system_score_gemma":0.0010106305,"threshold_uncertainty_score":0.26170772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5911013,0.019439043,0.09185303,0.0053373463,0.006793496,0.0031236869,0.03478106,0.18746004,0.06011104],"genre_scores_gemma":[0.63832086,0.0032507386,0.25918657,0.0021484136,0.0007136446,0.0016085266,0.07805502,0.007748478,0.008967795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.987463,0.004607412,0.000852805,0.0026943993,0.0035295642,0.00085276196],"domain_scores_gemma":[0.97303265,0.012057734,0.0007362869,0.007517966,0.0053810473,0.0012741857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008280262,0.0032635848,0.0021373508,0.004591688,0.002616954,0.0030305237,0.0052129696,0.0029601664,0.0064668283],"category_scores_gemma":[0.03757396,0.000896173,0.0013336323,0.0061209765,0.001964335,0.0072010453,0.0029364873,0.0030819497,0.0052763135],"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.009531014,0.0040583233,0.01867218,0.0067487042,0.0020065426,0.00040979637,0.00091675564,0.14395842,0.013814102,0.01887036,0.38500148,0.39601222],"study_design_scores_gemma":[0.0028879633,0.006024755,0.02169623,0.0005206639,0.0006536106,0.0015167298,0.0018883464,0.76925343,0.039126646,0.032791547,0.123242445,0.00039762165],"about_ca_topic_score_codex":0.01037465,"about_ca_topic_score_gemma":0.012680987,"teacher_disagreement_score":0.01037465,"about_ca_system_score_codex":0.002453552,"about_ca_system_score_gemma":0.0026058871,"threshold_uncertainty_score":0.043790758},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027021938,0.0036409968,0.31341806,0.0034541355,0.0016939241,0.00013307642,0.0072225826,0.013378281,0.65435684],"genre_scores_gemma":[0.033633407,0.006705819,0.16462654,0.0020122628,0.0006137681,0.00023122909,0.016796706,0.008030955,0.7673493],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979204,0.000021604616,0.0000071279264,0.00007336465,0.00008241171,0.000023480505],"domain_scores_gemma":[0.99967,0.00007700599,0.00001087944,0.00013259499,0.00007289585,0.00003661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023201735,0.0011030035,0.00042236247,0.0010978616,0.0007852842,0.0020687515,0.0012042657,0.0008649905,0.14745842],"category_scores_gemma":[0.001228501,0.0006089981,0.00057125796,0.0015581502,0.00060666667,0.004241424,0.0018188502,0.0024832676,0.087186664],"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.000023198456,0.000034553203,0.000090406065,0.0002307792,0.000012163209,0.000034504734,0.00007151258,0.0027276133,0.0015195853,0.18583043,0.4569122,0.352513],"study_design_scores_gemma":[0.0000053879385,0.0000068949,0.00009890802,0.00010116447,0.000009800283,0.00009384118,0.000025526771,0.0045261593,0.0017268803,0.18014656,0.8132471,0.00001187173],"about_ca_topic_score_codex":0.0020486778,"about_ca_topic_score_gemma":0.005932624,"teacher_disagreement_score":0.14745842,"about_ca_system_score_codex":0.0009084247,"about_ca_system_score_gemma":0.0011314033,"threshold_uncertainty_score":0},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020448784,0.049769584,0.017805157,0.0070524327,0.0052480674,0.000042386222,0.00038096812,0.0003843884,0.91727215],"genre_scores_gemma":[0.032448944,0.043756224,0.009729804,0.0028244278,0.004400294,0.00009776999,0.0006804119,0.00054370327,0.90551835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99974924,0.000058275204,0.000006507523,0.000054865275,0.00010340679,0.000027646622],"domain_scores_gemma":[0.99973935,0.000103256374,0.000014022665,0.00004736609,0.000051497605,0.000044479355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020125596,0.00089600607,0.0005748637,0.0017678619,0.001112981,0.0031874538,0.00079313444,0.0009268713,0.062681794],"category_scores_gemma":[0.0009881073,0.0003839321,0.00036779305,0.0031360367,0.0016823668,0.0039539197,0.0012997474,0.0022904836,0.025945943],"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.000007560397,0.000020024054,0.000073235235,0.00018414321,0.0000069851994,0.000027611197,0.00030287853,0.00053403864,0.00028717247,0.63446164,0.27103075,0.093063995],"study_design_scores_gemma":[0.0000024958565,0.0000049904966,0.00012262253,0.000110639485,0.0000038300996,0.000050832336,0.000102640864,0.00027749463,0.00008066337,0.30878913,0.6904508,0.0000038227427],"about_ca_topic_score_codex":0.0015168807,"about_ca_topic_score_gemma":0.0032238325,"teacher_disagreement_score":0.062681794,"about_ca_system_score_codex":0.0015596449,"about_ca_system_score_gemma":0.00089990074,"threshold_uncertainty_score":0.20969146},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018898781,0.0012356988,0.9181775,0.00074896327,0.00018571693,0.00028060822,0.0060391114,0.046687685,0.007745977],"genre_scores_gemma":[0.28436974,0.0017384226,0.6805334,0.00043420482,0.000111308495,0.00034166293,0.023756765,0.0017820757,0.006932422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864346,0.00019992045,0.00015255282,0.00038197194,0.0005367883,0.000085357984],"domain_scores_gemma":[0.99807787,0.0002700843,0.00013302772,0.0010124448,0.00038786372,0.00011866264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094749994,0.00085669494,0.0011353699,0.004756741,0.00094050105,0.004635569,0.0033174688,0.0009936132,0.005307793],"category_scores_gemma":[0.0033642186,0.0005428598,0.001226094,0.006403014,0.0005038643,0.0065092724,0.0031452063,0.001073562,0.0027765632],"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.00084521464,0.00045856708,0.0058960547,0.0010201709,0.00035172468,0.0010349848,0.0010454237,0.039888553,0.02547161,0.10724159,0.095630705,0.72111547],"study_design_scores_gemma":[0.00016550992,0.00021134304,0.002575577,0.00016226935,0.00025833945,0.0014507432,0.0008649374,0.63710535,0.042302106,0.12691648,0.18773097,0.00025647442],"about_ca_topic_score_codex":0.008536509,"about_ca_topic_score_gemma":0.006612454,"teacher_disagreement_score":0.008536509,"about_ca_system_score_codex":0.0010505053,"about_ca_system_score_gemma":0.0012733381,"threshold_uncertainty_score":0.017756343},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013676319,0.0001567244,0.97331816,0.00059030496,0.00010063965,0.00021070015,0.00083476934,0.006011961,0.0051003178],"genre_scores_gemma":[0.33067814,0.00034921026,0.6554381,0.0011046391,0.00013136322,0.0005862762,0.0021716834,0.0038691908,0.0056713643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99354917,0.002179135,0.0007913626,0.0012788393,0.0016764845,0.00052494666],"domain_scores_gemma":[0.99027526,0.0052595427,0.00068992155,0.0025884963,0.0009592777,0.00022747618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062693404,0.0008751329,0.0011894515,0.0012996539,0.001671346,0.00424475,0.003336552,0.0020176098,0.0062971455],"category_scores_gemma":[0.0153542645,0.0007979532,0.0016982543,0.0015972485,0.0033013476,0.013430491,0.0060644993,0.0025024037,0.0010837255],"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.000356657,0.000087446075,0.002106968,0.00039619257,0.000053091404,0.00039986568,0.0020583803,0.011249923,0.0065844078,0.9215208,0.0081460485,0.04704012],"study_design_scores_gemma":[0.00007779599,0.000155644,0.00040693552,0.00019347682,0.00009851644,0.00066728925,0.0009481668,0.10355123,0.023054352,0.7682017,0.10251861,0.00012625656],"about_ca_topic_score_codex":0.0036829507,"about_ca_topic_score_gemma":0.006337426,"teacher_disagreement_score":0.0062971455,"about_ca_system_score_codex":0.0016449678,"about_ca_system_score_gemma":0.0016057458,"threshold_uncertainty_score":0.0331558},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043741455,0.0037356329,0.0201544,0.009438245,0.0057233996,0.0004436599,0.016585175,0.020209977,0.91933525],"genre_scores_gemma":[0.026325593,0.0034357253,0.01726141,0.004601296,0.0015491936,0.0003838227,0.024865175,0.006828772,0.914749],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99866617,0.00014572468,0.00007417649,0.0003240019,0.0006068163,0.00018318596],"domain_scores_gemma":[0.9969014,0.00037492337,0.00018334105,0.00064900634,0.0009441302,0.0009471026],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015444153,0.0009854101,0.00088475674,0.0023609484,0.0023240035,0.005751574,0.002641472,0.0026759289,0.624985],"category_scores_gemma":[0.0047810227,0.0006594286,0.0009009436,0.0018949393,0.00072119705,0.0034878363,0.004192645,0.0022700832,0.46474415],"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.00044624222,0.00011944561,0.001033662,0.00048365258,0.000024681929,0.00038786008,0.00017968623,0.00033605535,0.0033689032,0.022693496,0.7138073,0.257119],"study_design_scores_gemma":[0.000041722687,0.00003047654,0.00039056691,0.000073307776,0.000007753681,0.00022129601,0.000039518265,0.00034606765,0.0006620851,0.0031746007,0.99500257,0.000010060136],"about_ca_topic_score_codex":0.0020339612,"about_ca_topic_score_gemma":0.002428555,"teacher_disagreement_score":0.37501502,"about_ca_system_score_codex":0.0011068465,"about_ca_system_score_gemma":0.0025286616,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005053189,0.0012315077,0.05501346,0.0011420378,0.00175756,0.000073549134,0.00058458553,0.0010774669,0.9340668],"genre_scores_gemma":[0.075562745,0.001960281,0.0416627,0.0014209128,0.00038000767,0.00012552302,0.0014765797,0.0019903244,0.8754209],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998092,0.000021389298,0.0000043906093,0.00005861341,0.00008120533,0.000025196696],"domain_scores_gemma":[0.9998184,0.000037087626,0.000009537479,0.00007128696,0.000035963567,0.00002769873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016847,0.0006598017,0.00053570117,0.0010189348,0.0014194692,0.0014598338,0.0012375925,0.0008886899,0.14925227],"category_scores_gemma":[0.00071274955,0.00043031908,0.0006658775,0.0009461819,0.0010539868,0.0026181021,0.0014815722,0.0024600225,0.034545433],"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.00004593633,0.000037706966,0.00006771575,0.00016768907,0.000011596428,0.00005645455,0.00009075509,0.0015152285,0.0026057141,0.8080468,0.106195755,0.081158735],"study_design_scores_gemma":[0.000015949385,0.000022862438,0.00013924766,0.000092222814,0.00000963956,0.0002483677,0.00008053735,0.0049942774,0.0031020541,0.6299953,0.36128333,0.000016351205],"about_ca_topic_score_codex":0.0006431932,"about_ca_topic_score_gemma":0.0014905453,"teacher_disagreement_score":0.14925227,"about_ca_system_score_codex":0.0007140508,"about_ca_system_score_gemma":0.0005222848,"threshold_uncertainty_score":0.49929857},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058523812,0.0033093493,0.23236889,0.002048459,0.00083254534,0.00028376328,0.004368687,0.01035747,0.7405784],"genre_scores_gemma":[0.05655368,0.0045654615,0.28134996,0.001385595,0.000372165,0.00019873223,0.012902349,0.0043508527,0.63832116],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996284,0.00003374577,0.000012400909,0.00012886651,0.00016125884,0.000035336037],"domain_scores_gemma":[0.9994754,0.00015235294,0.000017777844,0.00021614642,0.00009524852,0.000043186137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025594857,0.0009796357,0.0007701856,0.0020771765,0.00095804484,0.0020465984,0.001755074,0.0010066882,0.18568084],"category_scores_gemma":[0.0016840043,0.0005300602,0.0008699495,0.0033910032,0.00057471194,0.0034985093,0.0016686083,0.001253449,0.090028085],"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.00006932074,0.00010084473,0.00020696002,0.00039592126,0.000026482468,0.00008357253,0.00008610092,0.0030713244,0.0037162462,0.09314578,0.3464063,0.55269116],"study_design_scores_gemma":[0.000033928813,0.00005079759,0.00050776015,0.0002104267,0.000042979376,0.00070948823,0.00015651953,0.026047537,0.010209944,0.20218472,0.7598118,0.000034097287],"about_ca_topic_score_codex":0.0018706786,"about_ca_topic_score_gemma":0.0041054916,"teacher_disagreement_score":0.18568084,"about_ca_system_score_codex":0.0008552265,"about_ca_system_score_gemma":0.0009292305,"threshold_uncertainty_score":0.6211643},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04002466,0.001340172,0.94336474,0.0012640448,0.00018845199,0.00019305848,0.00060506404,0.0051247277,0.007895167],"genre_scores_gemma":[0.26482552,0.0015139322,0.72214866,0.00076832034,0.000240794,0.00026076668,0.0014705278,0.0006711409,0.008100402],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939084,0.00010945114,0.000047290425,0.000105985695,0.00025669206,0.000089671645],"domain_scores_gemma":[0.9982383,0.0005198116,0.0001463645,0.00073794567,0.00029140885,0.00006613473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048927404,0.00047554917,0.0003504498,0.0010760357,0.00076113903,0.0020861577,0.0018048271,0.00043666808,0.0047162245],"category_scores_gemma":[0.0021178275,0.0003253043,0.00039858505,0.0024829628,0.0008122586,0.0036630123,0.0013287638,0.00091615657,0.001100253],"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.0003609356,0.0003317031,0.0027031875,0.00063478254,0.000080285776,0.00021014472,0.0006626812,0.07730821,0.05782082,0.34123096,0.039409786,0.47924656],"study_design_scores_gemma":[0.000072487106,0.00025298315,0.00096840085,0.00006177781,0.000070510636,0.00042375975,0.00025601475,0.66705066,0.073775195,0.18536451,0.071621776,0.0000819952],"about_ca_topic_score_codex":0.004182391,"about_ca_topic_score_gemma":0.0063414597,"teacher_disagreement_score":0.0047162245,"about_ca_system_score_codex":0.001542153,"about_ca_system_score_gemma":0.0013665538,"threshold_uncertainty_score":0.01577729},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0116692195,0.0001551098,0.98419166,0.00011772312,0.000038122704,0.000042592474,0.00012020217,0.0008191321,0.0028462696],"genre_scores_gemma":[0.38318563,0.00027687388,0.6091279,0.00014259967,0.00010322515,0.00018460158,0.0006213535,0.00044346842,0.0059144325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991653,0.00016242072,0.000040710027,0.00015863706,0.00037847218,0.00009438367],"domain_scores_gemma":[0.99797624,0.0006090135,0.00017646405,0.0006898076,0.00041358173,0.00013497594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096137734,0.0006913165,0.0018176957,0.0014826257,0.0008380573,0.001635729,0.0022094261,0.0009503908,0.0054688053],"category_scores_gemma":[0.004161977,0.0006647219,0.00088928017,0.0019362587,0.00088679173,0.0037726148,0.002561056,0.0013098976,0.0012193432],"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.0003462147,0.00023686628,0.00080935797,0.00018887167,0.00011281367,0.00011707229,0.00013954003,0.5953601,0.009983049,0.14922418,0.012343562,0.23113836],"study_design_scores_gemma":[0.00001181578,0.000016751383,0.000060683466,0.000003713433,0.0000072447037,0.000023684866,0.00001213093,0.9549565,0.0008092101,0.043369185,0.00072244136,0.000006628179],"about_ca_topic_score_codex":0.0028293033,"about_ca_topic_score_gemma":0.0045773457,"teacher_disagreement_score":0.0054688053,"about_ca_system_score_codex":0.0010281355,"about_ca_system_score_gemma":0.0013837208,"threshold_uncertainty_score":0.01829499},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009915147,0.00069672335,0.24282807,0.0004434531,0.0005617974,0.0002845186,0.030861985,0.6848626,0.02954574],"genre_scores_gemma":[0.12791167,0.00071527815,0.37844136,0.000885723,0.0001876944,0.0012901778,0.15996006,0.3082831,0.022324903],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966479,0.0005577227,0.0002333998,0.0009794685,0.0011547694,0.000426865],"domain_scores_gemma":[0.9969553,0.0008209325,0.00007452741,0.0013297634,0.0006373108,0.00018226205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002021928,0.003510953,0.0016168777,0.0017727579,0.0010440209,0.003563364,0.005106975,0.0014400862,0.06207627],"category_scores_gemma":[0.009180065,0.0015960269,0.0024968525,0.0033206851,0.0010280743,0.00341975,0.00276228,0.0030563255,0.046909533],"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.0009079163,0.0001757256,0.0014448722,0.000977257,0.00023743608,0.00023068159,0.00034789718,0.031036347,0.0105357915,0.019398263,0.8389883,0.09571943],"study_design_scores_gemma":[0.0012052091,0.00020550124,0.0021621287,0.00016793203,0.00013208883,0.00038888873,0.00029703524,0.44381058,0.052252088,0.050963905,0.44819328,0.00022136753],"about_ca_topic_score_codex":0.012926774,"about_ca_topic_score_gemma":0.013936282,"teacher_disagreement_score":0.06207627,"about_ca_system_score_codex":0.0016376793,"about_ca_system_score_gemma":0.0024435634,"threshold_uncertainty_score":0.2076658},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067232777,0.00010634692,0.98794705,0.00025059798,0.00005591815,0.00008728517,0.00021262134,0.0009453708,0.0036715867],"genre_scores_gemma":[0.049051393,0.00013831686,0.9453843,0.00018021622,0.00003667759,0.00013116312,0.0008589935,0.0005638193,0.0036550616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981864,0.00031935834,0.00012051452,0.00040305164,0.00080645434,0.00016419745],"domain_scores_gemma":[0.9960912,0.0017741711,0.00023161464,0.001217394,0.000573825,0.000111756875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012955478,0.0011259387,0.000960589,0.0013246357,0.0011418386,0.0015910342,0.0019720588,0.0009355476,0.008793752],"category_scores_gemma":[0.007360556,0.0006958453,0.0016869346,0.0014585722,0.0015827344,0.002993505,0.003126997,0.0028662866,0.0032322526],"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.0002492004,0.00027279853,0.0018739507,0.00077923056,0.00009124744,0.0003419595,0.00065476174,0.18331018,0.02834248,0.25542736,0.027082214,0.5015747],"study_design_scores_gemma":[0.000077679026,0.00014103773,0.00031043592,0.00009760151,0.000035678324,0.00042287924,0.00029502297,0.5671241,0.027576678,0.34810424,0.055771112,0.0000434742],"about_ca_topic_score_codex":0.0021132524,"about_ca_topic_score_gemma":0.0045039267,"teacher_disagreement_score":0.008793752,"about_ca_system_score_codex":0.0009363087,"about_ca_system_score_gemma":0.0015867505,"threshold_uncertainty_score":0.029417992},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45470476,0.0004855754,0.530319,0.00049811887,0.00005660763,0.00018066754,0.00048471347,0.009462462,0.00380809],"genre_scores_gemma":[0.82943827,0.00011333669,0.1673791,0.00012345162,0.000027339342,0.00008994128,0.00072192564,0.00043036466,0.0016762568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983014,0.00033367972,0.00013654662,0.00036733242,0.0005321595,0.00032887168],"domain_scores_gemma":[0.99487525,0.0023896478,0.00032261477,0.0016695895,0.0005984526,0.00014449388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014353764,0.0006404418,0.00083086727,0.00059456716,0.0006881561,0.0015860428,0.0029057665,0.00066994625,0.0013459796],"category_scores_gemma":[0.006833139,0.0004469022,0.000501299,0.001704797,0.0010575273,0.0043434463,0.0020710328,0.0010391397,0.00028733857],"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.0020481185,0.00049998367,0.010727127,0.0003765768,0.00012787562,0.00048637867,0.0011048486,0.3858628,0.100468375,0.059219033,0.013188185,0.42589074],"study_design_scores_gemma":[0.00010824379,0.00016899518,0.000930892,0.000007949253,0.00004213504,0.000098996155,0.00020354793,0.94541043,0.03184085,0.019101784,0.002063633,0.00002245],"about_ca_topic_score_codex":0.007123776,"about_ca_topic_score_gemma":0.009598757,"teacher_disagreement_score":0.007123776,"about_ca_system_score_codex":0.0013636429,"about_ca_system_score_gemma":0.0016121162,"threshold_uncertainty_score":0.014164627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14800163,0.00052159245,0.8231774,0.00040833734,0.00009611965,0.0003797877,0.00042993823,0.019735372,0.007249931],"genre_scores_gemma":[0.46292654,0.00020310849,0.52836156,0.00016887809,0.00003901511,0.00023265227,0.0019841683,0.0011004404,0.0049836766],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922884,0.00012915424,0.0000560246,0.00018973857,0.0002519969,0.00014422661],"domain_scores_gemma":[0.99746776,0.00087243156,0.00016775286,0.00097084075,0.00035203298,0.00016907438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063942024,0.0012768515,0.00084312656,0.0006088742,0.0006967597,0.0011774001,0.0024714472,0.000694931,0.00292793],"category_scores_gemma":[0.0027734204,0.00048809504,0.00061487034,0.0009114818,0.00048672492,0.0030423542,0.001808789,0.0010606252,0.0015309833],"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.001493029,0.0008048574,0.0043422137,0.00045324359,0.0001263253,0.00020233446,0.00036643102,0.27298406,0.07950774,0.013693411,0.019048866,0.60697746],"study_design_scores_gemma":[0.0000710128,0.00011271612,0.0006957454,0.000007552524,0.00001974796,0.000081564234,0.000061607265,0.97112083,0.015731053,0.009444385,0.0026380406,0.000015678339],"about_ca_topic_score_codex":0.0032127653,"about_ca_topic_score_gemma":0.0090277335,"teacher_disagreement_score":0.0032127653,"about_ca_system_score_codex":0.0008651661,"about_ca_system_score_gemma":0.0019097641,"threshold_uncertainty_score":0.009794891},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28556988,0.003092913,0.47540888,0.0009473081,0.00042127262,0.00088876096,0.003698082,0.20950584,0.02046709],"genre_scores_gemma":[0.5644484,0.0007305921,0.4107598,0.0005722932,0.00011788315,0.00032505958,0.009373522,0.0059037465,0.0077686184],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987618,0.00025149915,0.00006794575,0.00027530076,0.00045918324,0.00018420666],"domain_scores_gemma":[0.9968046,0.00092781475,0.00018988157,0.0015511175,0.00032149078,0.00020504033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001107252,0.0015075958,0.00080515514,0.0012601394,0.00096225657,0.0015945723,0.0034452213,0.0008042794,0.003836055],"category_scores_gemma":[0.0046955566,0.00058263534,0.0009294978,0.0014692463,0.00091489643,0.0037899988,0.0029550847,0.0010264002,0.001983841],"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.0029355532,0.0010166585,0.0072629317,0.0012443352,0.0002893276,0.0006593119,0.0015486932,0.17375676,0.15585598,0.01310924,0.10254136,0.53977984],"study_design_scores_gemma":[0.00034320817,0.00079965283,0.0034113054,0.000049949922,0.00009019783,0.00065152236,0.00079862506,0.8858766,0.06561288,0.008608273,0.033655703,0.00010210952],"about_ca_topic_score_codex":0.008844943,"about_ca_topic_score_gemma":0.013555989,"teacher_disagreement_score":0.008844943,"about_ca_system_score_codex":0.0010262766,"about_ca_system_score_gemma":0.0011390971,"threshold_uncertainty_score":0.017586946},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004947854,0.3072491,0.023405002,0.110465355,0.40266037,0.00012698652,0.00095752644,0.0006044886,0.14958337],"genre_scores_gemma":[0.044287592,0.16774452,0.009308075,0.019314563,0.64153945,0.00016769784,0.0016255251,0.00085987855,0.11515277],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986297,0.00030216022,0.000058471724,0.0004345923,0.00047290223,0.000102312384],"domain_scores_gemma":[0.99505544,0.0026667016,0.00025483835,0.00048761567,0.0008288273,0.000706615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017136623,0.0014396653,0.0020696889,0.0029927506,0.0021238371,0.005764451,0.001544002,0.0033971872,0.030151734],"category_scores_gemma":[0.005451906,0.0006522074,0.0012787416,0.0032286365,0.002788328,0.0062456643,0.0028103655,0.007022461,0.010382674],"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.00003731073,0.00008859561,0.00043366294,0.00066564936,0.000080001155,0.00011286298,0.000103180355,0.00084394653,0.00031878488,0.11676271,0.8146446,0.06590867],"study_design_scores_gemma":[0.000024245057,0.00010026799,0.00165052,0.0006752974,0.00006861539,0.00083056424,0.00013772842,0.0020809097,0.0004876809,0.29661065,0.69728917,0.00004441048],"about_ca_topic_score_codex":0.00081551634,"about_ca_topic_score_gemma":0.0011950749,"teacher_disagreement_score":0.030151734,"about_ca_system_score_codex":0.0026748397,"about_ca_system_score_gemma":0.0019588368,"threshold_uncertainty_score":0.10086757},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003119178,0.0014508459,0.007659225,0.013811773,0.009274037,0.00020100543,0.004813813,0.0040293164,0.95564085],"genre_scores_gemma":[0.019311009,0.0006849586,0.0048103225,0.00080965564,0.0018559219,0.00023622147,0.002902774,0.0015490445,0.96784014],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998662,0.00021448304,0.000021104312,0.0001203438,0.00073662866,0.00024538452],"domain_scores_gemma":[0.99829954,0.00022077635,0.000070300914,0.000249559,0.00062277785,0.0005371067],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014905921,0.0009413124,0.0005815502,0.0020554261,0.0044182693,0.0077626407,0.001338226,0.0014406252,0.42808342],"category_scores_gemma":[0.0031629722,0.0003841672,0.0008560524,0.0015419899,0.00086949376,0.0026965726,0.005476165,0.0024223572,0.14986776],"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.000036679554,0.00001166731,0.000028258877,0.000043832282,0.0000030283527,0.000032511627,0.00006442259,0.00010114182,0.00025946338,0.010673063,0.9770355,0.011710322],"study_design_scores_gemma":[0.000005476816,0.000009482467,0.00033008787,0.000016444532,0.0000013476371,0.000021929756,0.000088170826,0.00016021806,0.00026293594,0.0024555991,0.99663997,0.00000835705],"about_ca_topic_score_codex":0.0039550466,"about_ca_topic_score_gemma":0.011362936,"teacher_disagreement_score":0.42808342,"about_ca_system_score_codex":0.0028414326,"about_ca_system_score_gemma":0.0017901532,"threshold_uncertainty_score":0.81576955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11053087,0.0072841044,0.6948405,0.007846558,0.00089081575,0.00060073554,0.0028347052,0.005086621,0.17008504],"genre_scores_gemma":[0.6653328,0.006204668,0.23040618,0.0018523857,0.0013889322,0.00092429534,0.007311795,0.0024268103,0.08415217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9923239,0.002904681,0.00034292857,0.001238299,0.0023411235,0.0008489984],"domain_scores_gemma":[0.9809764,0.009913703,0.00074471714,0.005254509,0.001624894,0.0014857621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004600709,0.0014817289,0.0030647293,0.003276355,0.0016759424,0.0060513467,0.0033342661,0.0026247855,0.03156391],"category_scores_gemma":[0.037345294,0.0011162774,0.0018762399,0.0050972737,0.002250228,0.010345695,0.00660171,0.0043703215,0.007823988],"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.0012029287,0.00045584753,0.0028736417,0.0005969858,0.00016990768,0.00012345237,0.00022169302,0.06467335,0.0019752681,0.5890233,0.043699853,0.29498377],"study_design_scores_gemma":[0.00010668599,0.0001612872,0.00051504886,0.0000919961,0.000055220222,0.00012965193,0.000076721706,0.1109396,0.0013025195,0.8661312,0.020472908,0.000017096983],"about_ca_topic_score_codex":0.0008732133,"about_ca_topic_score_gemma":0.0010124447,"teacher_disagreement_score":0.03156391,"about_ca_system_score_codex":0.002940055,"about_ca_system_score_gemma":0.0033338193,"threshold_uncertainty_score":0.105591774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032131426,0.00021637404,0.9613371,0.00036941253,0.000085616906,0.000093550276,0.00043387234,0.002283506,0.0030491145],"genre_scores_gemma":[0.38063866,0.00030124595,0.6142834,0.00011333018,0.00011015157,0.00024156821,0.0015704511,0.00040045643,0.002340655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99846715,0.0002807246,0.00007099732,0.00017462882,0.00088954036,0.00011698581],"domain_scores_gemma":[0.99532735,0.0022189633,0.00042328905,0.0007938131,0.0010200333,0.00021657375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085940567,0.0008167681,0.0006216475,0.0027646336,0.0009680091,0.0017887937,0.0016593523,0.00073385955,0.0036427977],"category_scores_gemma":[0.015946329,0.0003956444,0.00041210258,0.0030062003,0.0007232757,0.002902018,0.0018198609,0.001092905,0.0015016418],"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.00026601445,0.000114893155,0.006547414,0.00027904357,0.00007860231,0.0004073751,0.00046223804,0.55220956,0.014133354,0.07568189,0.0137073295,0.33611226],"study_design_scores_gemma":[0.000011746288,0.000021631984,0.00036749482,0.00000838542,0.000004395668,0.00006367078,0.00006378436,0.9679911,0.0034931188,0.025633454,0.0023334445,0.000007750239],"about_ca_topic_score_codex":0.007259506,"about_ca_topic_score_gemma":0.013640878,"teacher_disagreement_score":0.007259506,"about_ca_system_score_codex":0.0014043829,"about_ca_system_score_gemma":0.0014285954,"threshold_uncertainty_score":0.014434516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042974167,0.002379293,0.938783,0.0010711666,0.00020003409,0.0003892776,0.00030957902,0.0029159174,0.010977667],"genre_scores_gemma":[0.26852107,0.00073628087,0.72365254,0.0003375548,0.00017691002,0.0006319877,0.0010093522,0.00059529685,0.004338992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771094,0.0005686238,0.00012330497,0.0005021398,0.00064293103,0.00045202792],"domain_scores_gemma":[0.9962618,0.0023120353,0.00022872021,0.00048627338,0.00043857004,0.00027253022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022755773,0.0022450138,0.0026621681,0.0018055077,0.0014928714,0.0028166173,0.0032659417,0.0015749909,0.0073016407],"category_scores_gemma":[0.005927112,0.0007772134,0.0012565952,0.0027109447,0.00089095393,0.0035382444,0.0027743357,0.0023185473,0.0014516659],"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.0007608481,0.00060199754,0.0010374312,0.00050297054,0.00015588879,0.0002274871,0.00026579504,0.629071,0.0054716896,0.032800227,0.012842819,0.31626192],"study_design_scores_gemma":[0.00008554394,0.000061602004,0.00010678919,0.000009259888,0.000021635973,0.000038383114,0.000044761142,0.9809132,0.0007185286,0.016698087,0.0012950319,0.000007263306],"about_ca_topic_score_codex":0.006131713,"about_ca_topic_score_gemma":0.007897889,"teacher_disagreement_score":0.0073016407,"about_ca_system_score_codex":0.0016962603,"about_ca_system_score_gemma":0.003861676,"threshold_uncertainty_score":0.0244264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022385642,0.00027918105,0.9694801,0.00022974753,0.000090112284,0.000049088136,0.0001303154,0.00057032285,0.0067854784],"genre_scores_gemma":[0.38103437,0.00038096137,0.6124202,0.0001331157,0.00007010846,0.00020431941,0.00036768866,0.00029496895,0.005094208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998356,0.00004410553,0.000007780575,0.000025994557,0.000057629,0.000028819242],"domain_scores_gemma":[0.9997141,0.0001244615,0.00002383904,0.000035784178,0.00008119403,0.000020694619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029667042,0.0005313964,0.00058484916,0.000595516,0.00054012536,0.0005751265,0.00077992777,0.00049028057,0.004356862],"category_scores_gemma":[0.0008913943,0.00022990312,0.00066258287,0.00060353044,0.00037535143,0.00081328984,0.00071317796,0.0005100666,0.0006149849],"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.00017490001,0.00010022937,0.0012845189,0.0002341117,0.00009248244,0.00023733989,0.00016895305,0.7701112,0.008578488,0.046336316,0.0060191187,0.16666238],"study_design_scores_gemma":[0.000018199109,0.000010258558,0.0001479252,0.0000051794846,0.0000055131695,0.000021072154,0.00001550443,0.9922009,0.0006684312,0.005597403,0.0013052609,0.000004398182],"about_ca_topic_score_codex":0.00929022,"about_ca_topic_score_gemma":0.01149295,"teacher_disagreement_score":0.00929022,"about_ca_system_score_codex":0.00050364586,"about_ca_system_score_gemma":0.0009262515,"threshold_uncertainty_score":0.018472314},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19961762,0.0036957548,0.31327865,0.005761168,0.0032170021,0.0002224943,0.0029905692,0.00845007,0.46276665],"genre_scores_gemma":[0.8439293,0.0010290362,0.05981514,0.0013159434,0.00064626086,0.00022520061,0.0012954705,0.0004995956,0.09124409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977916,0.000036192196,0.000011967881,0.000054575874,0.000064286774,0.00005390935],"domain_scores_gemma":[0.9991817,0.00012199199,0.000045096207,0.00038683732,0.00016120014,0.00010311506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019010167,0.00048461987,0.0005928399,0.00072481856,0.0011990932,0.0017895501,0.001139414,0.00060858496,0.04753424],"category_scores_gemma":[0.0014650124,0.00024450076,0.00030017731,0.0011274688,0.0007053061,0.0027463406,0.002343111,0.00084481627,0.005692853],"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.000517957,0.00012186383,0.00088601315,0.00028444728,0.000058884998,0.00026665296,0.00015088583,0.012964688,0.010304103,0.7814981,0.081340276,0.11160616],"study_design_scores_gemma":[0.00008113494,0.000096925396,0.0005075233,0.00005620697,0.000045148063,0.0003101657,0.00015272373,0.08515365,0.009688584,0.8426264,0.06125027,0.000031256095],"about_ca_topic_score_codex":0.0007558499,"about_ca_topic_score_gemma":0.0012895132,"teacher_disagreement_score":0.04753424,"about_ca_system_score_codex":0.00052073784,"about_ca_system_score_gemma":0.00064338045,"threshold_uncertainty_score":0.15901786},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109198056,0.001268806,0.87756866,0.0008722232,0.00006646331,0.0003762359,0.0028307182,0.0032951562,0.004523651],"genre_scores_gemma":[0.34851038,0.0005967922,0.6324998,0.0003551975,0.00010267775,0.00031208456,0.011108029,0.0007493508,0.0057656635],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887973,0.0002051044,0.00006108952,0.0004404192,0.00027680447,0.00013685472],"domain_scores_gemma":[0.99692875,0.0014883977,0.00036658937,0.0006039793,0.0004123631,0.00019990596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008482772,0.00125586,0.0018267019,0.0033440161,0.0010439075,0.0015886765,0.0017805963,0.0013901315,0.0040504388],"category_scores_gemma":[0.0065092016,0.0008901958,0.0014556886,0.002899232,0.0009628981,0.00255263,0.0019464059,0.0010708475,0.0012117686],"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.0005797053,0.00038405886,0.01795869,0.0012077701,0.00037689062,0.000906969,0.0010070488,0.24027906,0.024201006,0.046220917,0.043137643,0.6237403],"study_design_scores_gemma":[0.00008365513,0.00011589315,0.003048462,0.000090019385,0.000118728305,0.0006564417,0.00053050875,0.8785716,0.0072766985,0.09777113,0.011704789,0.00003194502],"about_ca_topic_score_codex":0.007617219,"about_ca_topic_score_gemma":0.016005235,"teacher_disagreement_score":0.007617219,"about_ca_system_score_codex":0.00096695736,"about_ca_system_score_gemma":0.0020518377,"threshold_uncertainty_score":0.015145719},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023124909,0.0014626987,0.9536057,0.00065981736,0.00020506953,0.00028163657,0.0015949758,0.015818741,0.0032464156],"genre_scores_gemma":[0.17170508,0.0006688097,0.81123304,0.0003198661,0.00023080186,0.00023869304,0.008927389,0.0014635938,0.0052127526],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985663,0.00019751802,0.00010719541,0.00050955894,0.0005012594,0.000118069445],"domain_scores_gemma":[0.9969386,0.0008733531,0.00032940236,0.0010732284,0.0006387477,0.00014666615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088213175,0.0017030224,0.0012322002,0.0026143368,0.00088415085,0.001901187,0.0022094208,0.0012520631,0.003004466],"category_scores_gemma":[0.006183981,0.0006758538,0.00077966653,0.0028569293,0.0006424216,0.004319291,0.0017336154,0.0013520927,0.0019893649],"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.0004363509,0.00023937711,0.0014273502,0.0005648188,0.00013129924,0.000265557,0.00038723752,0.12499929,0.040473033,0.011786106,0.048517,0.7707726],"study_design_scores_gemma":[0.0001423235,0.000272836,0.0012197008,0.000045536854,0.00011443433,0.00055485877,0.00035851102,0.8907195,0.036271766,0.043233953,0.027003428,0.00006319459],"about_ca_topic_score_codex":0.003365779,"about_ca_topic_score_gemma":0.0068220836,"teacher_disagreement_score":0.003365779,"about_ca_system_score_codex":0.0009780048,"about_ca_system_score_gemma":0.0011650588,"threshold_uncertainty_score":0.010050952},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2038114,0.0018116848,0.6502605,0.0014217229,0.00079733785,0.00045862776,0.018492287,0.109893024,0.013053267],"genre_scores_gemma":[0.44849268,0.0009018884,0.514886,0.00037382255,0.00016302355,0.0003496671,0.01852325,0.009886716,0.006422928],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99972814,0.00005195421,0.000011631221,0.00006994231,0.00010102013,0.000037169397],"domain_scores_gemma":[0.99904794,0.00036999333,0.00006563372,0.00012173998,0.00018179243,0.00021294427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047662607,0.0013455932,0.00069569604,0.0032466715,0.00095494726,0.0019461624,0.0013663762,0.0009595842,0.010324702],"category_scores_gemma":[0.0025283187,0.0006203088,0.00090568815,0.0028892253,0.00034896322,0.002108345,0.0016316854,0.0014847599,0.0017591562],"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.0022367053,0.0011117129,0.01574815,0.0023640597,0.0010901949,0.0013604012,0.0028017606,0.22841558,0.08507348,0.045000196,0.26183274,0.3529649],"study_design_scores_gemma":[0.00018148097,0.00007799856,0.0020477157,0.00007947856,0.00005681598,0.00021933728,0.0004356536,0.921768,0.009144028,0.045885943,0.020044075,0.000059437858],"about_ca_topic_score_codex":0.008501503,"about_ca_topic_score_gemma":0.019100929,"teacher_disagreement_score":0.010324702,"about_ca_system_score_codex":0.0003948198,"about_ca_system_score_gemma":0.00096734945,"threshold_uncertainty_score":0.03453952},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017534206,0.0065281736,0.86063004,0.006518565,0.000566421,0.0002619645,0.0026101277,0.0018828412,0.103467636],"genre_scores_gemma":[0.29840586,0.015000883,0.54503417,0.0020183935,0.0016726289,0.0014134863,0.007414139,0.0018156666,0.12722479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987496,0.00040844313,0.00006824962,0.00031367026,0.00033890328,0.00012123654],"domain_scores_gemma":[0.9966793,0.0021424645,0.000177558,0.0005930081,0.0002506803,0.0001570223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010825725,0.0018930986,0.0014614905,0.002371868,0.0018516734,0.0065373043,0.0033062194,0.0027569735,0.016931167],"category_scores_gemma":[0.0063655516,0.0011325463,0.002137436,0.0049369615,0.0020570662,0.010706367,0.002264586,0.0049958355,0.004619882],"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.000031858865,0.000059672908,0.00015431503,0.0001741409,0.000019141795,0.00005847873,0.00012481827,0.016640162,0.0002784423,0.92815495,0.020940501,0.03336356],"study_design_scores_gemma":[0.000009587112,0.000004007349,0.000034133554,0.000019380133,0.0000067004316,0.000042309202,0.000025190502,0.027570935,0.00008677874,0.96430725,0.007888306,0.0000053719314],"about_ca_topic_score_codex":0.0044670757,"about_ca_topic_score_gemma":0.0040751994,"teacher_disagreement_score":0.016931167,"about_ca_system_score_codex":0.003202279,"about_ca_system_score_gemma":0.0014144549,"threshold_uncertainty_score":0.056640446},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010532966,0.00069963315,0.9095429,0.0008440487,0.00019590126,0.00027641212,0.0077932687,0.06297661,0.0071382998],"genre_scores_gemma":[0.17987105,0.0009321161,0.77389985,0.0010123358,0.00029107596,0.0014461349,0.016905632,0.012685577,0.012956137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964747,0.0007696256,0.00060440996,0.00064454926,0.0010992133,0.0004076224],"domain_scores_gemma":[0.98376393,0.005152342,0.0009666042,0.008585968,0.0010720475,0.0004591851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047716135,0.0028222613,0.002210466,0.0023810442,0.0017883197,0.005288551,0.005927775,0.0024506338,0.024569115],"category_scores_gemma":[0.015576502,0.0021549566,0.0035543477,0.004426207,0.0025624777,0.01726184,0.0076846112,0.0044119875,0.008164411],"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.003083406,0.00044957755,0.0053986544,0.0018137856,0.0003468681,0.0004367848,0.0011984607,0.082140364,0.009472828,0.4968828,0.09376898,0.3050075],"study_design_scores_gemma":[0.00050175807,0.0003031767,0.00072730874,0.00031192743,0.00016098001,0.00028217072,0.00029813725,0.21099448,0.025434425,0.6424685,0.11828769,0.00022940633],"about_ca_topic_score_codex":0.0049804593,"about_ca_topic_score_gemma":0.008352307,"teacher_disagreement_score":0.024569115,"about_ca_system_score_codex":0.0036880248,"about_ca_system_score_gemma":0.003070577,"threshold_uncertainty_score":0.082191885},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001810855,0.012117647,0.008382005,0.043449115,0.20789056,0.0007142028,0.019312838,0.003027989,0.7032948],"genre_scores_gemma":[0.010098883,0.008725048,0.0042250664,0.009570042,0.03669656,0.00049988634,0.021043338,0.0019721342,0.907169],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983479,0.0002460076,0.00014808938,0.00033069734,0.0007581333,0.00016925907],"domain_scores_gemma":[0.99344784,0.00088090036,0.000266947,0.0006481479,0.003675585,0.0010806498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020419357,0.0013317182,0.001081401,0.0029492318,0.0029259583,0.0051369634,0.0019678916,0.002029169,0.55799377],"category_scores_gemma":[0.01468184,0.00042123164,0.0009082062,0.002534922,0.0009307572,0.004507539,0.0029077774,0.0034789382,0.42579007],"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.000027523785,0.000013334777,0.00009022009,0.00010810109,0.0000024939372,0.00004371842,0.00008185556,0.000050052673,0.000072615236,0.0036390887,0.9647797,0.031091338],"study_design_scores_gemma":[0.0000041223566,0.000013153165,0.00021022838,0.00011160843,0.000001518138,0.00006292756,0.00008501693,0.00002531799,0.000046942478,0.0016517821,0.9977829,0.00000451229],"about_ca_topic_score_codex":0.002893073,"about_ca_topic_score_gemma":0.0029308146,"teacher_disagreement_score":0.55799377,"about_ca_system_score_codex":0.0025751719,"about_ca_system_score_gemma":0.002958025,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011812052,0.00038838614,0.974494,0.00029686713,0.00015811894,0.00037656585,0.0005069369,0.008724117,0.0032429735],"genre_scores_gemma":[0.095039815,0.00026980854,0.89553154,0.00022372438,0.00009884742,0.000397001,0.0021815752,0.0016249099,0.0046327114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714845,0.00035662387,0.00026624114,0.00062562287,0.0011106607,0.0004923353],"domain_scores_gemma":[0.99361914,0.0016208508,0.00043493466,0.002716841,0.0013116046,0.00029666894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016284666,0.0022074403,0.0020263367,0.0031484698,0.0016547636,0.0031228065,0.0045924727,0.0013856646,0.015083421],"category_scores_gemma":[0.009311376,0.0012664365,0.0025646873,0.0036738403,0.0017744184,0.0058698556,0.005246006,0.002511791,0.005898289],"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.00061433075,0.0004414536,0.0026329586,0.0006715283,0.00009983462,0.00029948744,0.00062284543,0.13766861,0.016317824,0.066983916,0.028161034,0.7454862],"study_design_scores_gemma":[0.00026266807,0.00016441345,0.0006499355,0.00006809086,0.00009064166,0.00032442476,0.00020669459,0.85994446,0.014570163,0.10246746,0.021169756,0.0000813046],"about_ca_topic_score_codex":0.011741995,"about_ca_topic_score_gemma":0.015156167,"teacher_disagreement_score":0.015083421,"about_ca_system_score_codex":0.002384339,"about_ca_system_score_gemma":0.0051804623,"threshold_uncertainty_score":0.050459087},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03052348,0.003176313,0.42391863,0.0020292539,0.0004961025,0.0006481927,0.06270939,0.44815758,0.028340992],"genre_scores_gemma":[0.26994628,0.0027941964,0.48344493,0.0017297684,0.00017963687,0.00070044096,0.20500045,0.02220157,0.014002775],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99841905,0.00022741739,0.0002061473,0.0004075674,0.00063173275,0.00010809791],"domain_scores_gemma":[0.9961966,0.00078245165,0.00022074157,0.0018348064,0.0006414589,0.0003240025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018188485,0.00087143877,0.0007977335,0.003365005,0.00074562035,0.0039970763,0.005469285,0.0009477075,0.0089140115],"category_scores_gemma":[0.0073566264,0.0006647105,0.00090995245,0.00501042,0.0006926687,0.0065879025,0.0050063203,0.0013219808,0.0042110584],"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.0015897643,0.00042053088,0.0062648403,0.0018692953,0.0005235531,0.0005904809,0.0006131586,0.021646732,0.011098761,0.103154905,0.46437556,0.3878524],"study_design_scores_gemma":[0.00083138334,0.00027474336,0.005197859,0.0003121137,0.00025230122,0.0008957455,0.0008320047,0.2335411,0.030652206,0.14971592,0.5771801,0.0003146057],"about_ca_topic_score_codex":0.01095378,"about_ca_topic_score_gemma":0.011239753,"teacher_disagreement_score":0.01095378,"about_ca_system_score_codex":0.0013605212,"about_ca_system_score_gemma":0.002285185,"threshold_uncertainty_score":0.029820383},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018609468,0.00029351565,0.9661211,0.00017898362,0.00012468407,0.00018579327,0.00030815636,0.009735154,0.0044431095],"genre_scores_gemma":[0.1456926,0.00019592862,0.8444413,0.0001556718,0.000048586975,0.00032614652,0.0013637352,0.0012135999,0.0065624965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968827,0.000059969017,0.000018667826,0.0000655871,0.00010993056,0.0000576199],"domain_scores_gemma":[0.99948394,0.00013835033,0.000028493218,0.00016520903,0.00012216861,0.0000618259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004522857,0.0009592445,0.00085959694,0.0009258532,0.0010089619,0.0010657609,0.0021553144,0.0007666909,0.0066928924],"category_scores_gemma":[0.0015001277,0.0005084787,0.00058000576,0.0010950565,0.0004440107,0.0014501329,0.0022012042,0.0009671748,0.0025110648],"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.0011004,0.0003220978,0.001278254,0.00034678957,0.00015757009,0.00016840742,0.0002730241,0.23520063,0.030124173,0.018299486,0.035293523,0.6774357],"study_design_scores_gemma":[0.00017815769,0.00011113823,0.0003130554,0.000014469448,0.000029080642,0.00007848727,0.000047125086,0.9737458,0.0072698765,0.010173425,0.0080216285,0.000017768913],"about_ca_topic_score_codex":0.00661754,"about_ca_topic_score_gemma":0.010949369,"teacher_disagreement_score":0.0066928924,"about_ca_system_score_codex":0.00081647426,"about_ca_system_score_gemma":0.0015462112,"threshold_uncertainty_score":0.022389948},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033856276,0.00081336376,0.95417225,0.0012882294,0.00021312365,0.00012582874,0.0005188637,0.0027014047,0.0063106664],"genre_scores_gemma":[0.7209112,0.0006347652,0.2683524,0.0005156191,0.00025675303,0.00020030637,0.001072827,0.0007759798,0.0072801146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878603,0.00039706193,0.000057691508,0.00030278016,0.00020376979,0.0002527009],"domain_scores_gemma":[0.9948132,0.003836277,0.00024832843,0.00045198854,0.0002917787,0.00035844924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027979813,0.0012495304,0.0012130851,0.0009921665,0.0012283805,0.0022954545,0.0026526786,0.0013825203,0.008134706],"category_scores_gemma":[0.012701582,0.00063120824,0.000728134,0.0012871178,0.0013883144,0.0055993847,0.0026728904,0.002050562,0.0009957027],"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.0010500697,0.0001999803,0.0014585241,0.00035255408,0.00008015268,0.00028519868,0.00050678826,0.66186005,0.0044518416,0.17991076,0.018383477,0.13146064],"study_design_scores_gemma":[0.000029792991,0.000023405782,0.00006831518,0.000010140888,0.000008058432,0.000025997684,0.00003182094,0.9162548,0.0004929698,0.08162899,0.0014180068,0.000007684953],"about_ca_topic_score_codex":0.005110729,"about_ca_topic_score_gemma":0.005926525,"teacher_disagreement_score":0.008134706,"about_ca_system_score_codex":0.0014256666,"about_ca_system_score_gemma":0.0013996923,"threshold_uncertainty_score":0.027213275},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15795866,0.00093230425,0.82361776,0.0005114204,0.00014726633,0.0003442429,0.000853216,0.010801581,0.004833547],"genre_scores_gemma":[0.5224911,0.00041896277,0.4677385,0.00022619599,0.000069604335,0.00018645382,0.0025466606,0.0009930567,0.005329482],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985672,0.00020459313,0.000093335344,0.0004530132,0.0004459848,0.0002357243],"domain_scores_gemma":[0.9936186,0.0013988012,0.0005842248,0.0031014027,0.00096725574,0.00032978153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012137648,0.0009300435,0.001063332,0.0020361536,0.0014166051,0.0013531484,0.0024679746,0.00064717495,0.0020567088],"category_scores_gemma":[0.0064835246,0.00075930834,0.0007569877,0.0024975722,0.0011358254,0.0041409843,0.0021275117,0.001050721,0.00074649585],"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.0008626737,0.0005543278,0.008529469,0.00051427115,0.00010666067,0.00028431346,0.00087033445,0.22800308,0.040210415,0.04950518,0.02207097,0.6484883],"study_design_scores_gemma":[0.00013334054,0.00020099807,0.0020826317,0.000028912587,0.000079391684,0.00040230737,0.0002620829,0.87691075,0.027674591,0.0815503,0.010627354,0.00004731958],"about_ca_topic_score_codex":0.013016729,"about_ca_topic_score_gemma":0.016748048,"teacher_disagreement_score":0.013016729,"about_ca_system_score_codex":0.0015520797,"about_ca_system_score_gemma":0.0030929851,"threshold_uncertainty_score":0.025881946},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042461822,0.0009338787,0.0023710974,0.060529955,0.9276131,0.000026584767,0.0018142972,0.0005009915,0.0057855565],"genre_scores_gemma":[0.07399168,0.008973571,0.013210236,0.085789286,0.52545065,0.00034628774,0.0059065823,0.0031163106,0.28321546],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99652183,0.00060561445,0.00041702538,0.00079201726,0.0012365908,0.00042703171],"domain_scores_gemma":[0.9686156,0.0073960065,0.0010933013,0.0030466488,0.018368172,0.0014803387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027418258,0.0022412112,0.0020508461,0.0046857037,0.0040214276,0.0042652725,0.005106597,0.005915927,0.08318632],"category_scores_gemma":[0.056211863,0.0011741879,0.0016095012,0.005103461,0.0036624137,0.004630026,0.0025633897,0.009225949,0.026501771],"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.000052788713,0.0000045823253,0.0000623618,0.0001323843,0.000017201011,0.00011175445,0.0000411678,0.0001525729,0.000046577123,0.0042568566,0.9908757,0.0042459867],"study_design_scores_gemma":[0.00009535024,0.000020816822,0.00082393124,0.00019796673,0.00007848601,0.0004201296,0.00012169513,0.0011473257,0.00042025984,0.018009186,0.9785972,0.00006751511],"about_ca_topic_score_codex":0.023289109,"about_ca_topic_score_gemma":0.021242986,"teacher_disagreement_score":0.08318632,"about_ca_system_score_codex":0.006266133,"about_ca_system_score_gemma":0.005153432,"threshold_uncertainty_score":0.27828598},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1760089,0.0007527731,0.8093615,0.0008215164,0.00017876313,0.00007878487,0.0010218624,0.0045320964,0.007243796],"genre_scores_gemma":[0.9049727,0.00037089788,0.08812968,0.000098118486,0.00015070489,0.00005117129,0.0011072838,0.00031041203,0.0048090992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984883,0.00044072044,0.000062133666,0.00034329333,0.0004463235,0.00021915631],"domain_scores_gemma":[0.9947501,0.0031501027,0.00048901606,0.00073231285,0.0005925854,0.000285934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001166094,0.0006804505,0.00077616243,0.001961203,0.0007071084,0.001934194,0.0010419898,0.00070232974,0.0023935237],"category_scores_gemma":[0.012295116,0.0004351539,0.00035873594,0.0017389355,0.0011529926,0.0038501262,0.0012401864,0.0009204999,0.0007896952],"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.0003472268,0.000100359204,0.0032290285,0.00023265017,0.000055938108,0.00046305053,0.00028839445,0.78307045,0.011659015,0.10265285,0.00937153,0.08852945],"study_design_scores_gemma":[0.0000109167695,0.000020493302,0.00038275667,0.000004800212,0.000004346775,0.0000568036,0.000025954552,0.9494616,0.0009897914,0.048238337,0.0007966014,0.000007598056],"about_ca_topic_score_codex":0.0053761597,"about_ca_topic_score_gemma":0.009153115,"teacher_disagreement_score":0.0053761597,"about_ca_system_score_codex":0.0009410586,"about_ca_system_score_gemma":0.0006636818,"threshold_uncertainty_score":0.010689735},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003491066,0.07006422,0.20510675,0.008020054,0.007822033,0.00012517734,0.00094037945,0.0010733721,0.703357],"genre_scores_gemma":[0.07583113,0.098430954,0.14485301,0.005258043,0.008996167,0.0005018563,0.0021536644,0.0015951449,0.66238004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99974805,0.000049589897,0.0000097052825,0.000054661996,0.00011720696,0.000020907106],"domain_scores_gemma":[0.999622,0.00021175174,0.000018089533,0.0000473473,0.00006417169,0.000036542457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025945815,0.0013017816,0.00089384714,0.002818084,0.0010073171,0.0027443026,0.00119181,0.00081392366,0.02969552],"category_scores_gemma":[0.0009562306,0.00045228263,0.0005192984,0.006034455,0.001997106,0.005776597,0.0010549874,0.0026323225,0.012994015],"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.000004928069,0.000017075781,0.000034173798,0.0002696525,0.000007975158,0.000025277412,0.00010220993,0.00076315127,0.00041699022,0.8231117,0.11174931,0.06349754],"study_design_scores_gemma":[0.0000036963067,0.000006248023,0.00008720427,0.000092439586,0.000008319309,0.00010607736,0.000056343066,0.0014147208,0.00020194534,0.67469597,0.3233209,0.000006044679],"about_ca_topic_score_codex":0.000875313,"about_ca_topic_score_gemma":0.0013669365,"teacher_disagreement_score":0.02969552,"about_ca_system_score_codex":0.0015341004,"about_ca_system_score_gemma":0.0007344812,"threshold_uncertainty_score":0.09934139},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":"reporting","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":"reporting","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022691288,0.003925513,0.94021714,0.00294161,0.0055860286,0.00015812046,0.002673344,0.015069512,0.027159601],"genre_scores_gemma":[0.06800226,0.009030559,0.8940635,0.0014567733,0.002210532,0.0007911106,0.0034448165,0.004737289,0.016263146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965384,0.001992879,0.0003437809,0.0004157453,0.00057833525,0.00013094976],"domain_scores_gemma":[0.9802225,0.012620867,0.0013425249,0.0028805267,0.002384825,0.0005487493],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0037433875,0.0027041943,0.0015408209,0.009964721,0.0019040031,0.011760223,0.0026140409,0.0022386773,0.04395414],"category_scores_gemma":[0.036479518,0.0013711622,0.0018774415,0.011672792,0.003960082,0.015882434,0.0032557854,0.003611182,0.015074206],"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.000099966615,0.00002784553,0.00031714578,0.00090721616,0.000063484746,0.0002335775,0.000465458,0.0125230765,0.00093962805,0.8439819,0.061995942,0.078444675],"study_design_scores_gemma":[0.000040018294,0.000018370702,0.00011343422,0.00032402072,0.000058888418,0.000102785925,0.00014354795,0.021793332,0.0015973427,0.72213227,0.2536181,0.0000579557],"about_ca_topic_score_codex":0.0031130426,"about_ca_topic_score_gemma":0.002207418,"teacher_disagreement_score":0.9962566,"about_ca_system_score_codex":0.0019182347,"about_ca_system_score_gemma":0.002056199,"threshold_uncertainty_score":0.1470412},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103602275,0.00039077076,0.88811296,0.00095118897,0.000083469786,0.0004120247,0.0009223179,0.0028236818,0.0027013049],"genre_scores_gemma":[0.85381293,0.00016964815,0.1427158,0.00026751426,0.00006254579,0.00018620338,0.0011851863,0.00009586684,0.0015042254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923884,0.0023672506,0.00062707736,0.001930957,0.0017832947,0.00090287987],"domain_scores_gemma":[0.987812,0.0026503117,0.0011514076,0.0070103817,0.0008622633,0.00051369454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052886237,0.0007092614,0.002016121,0.001185491,0.0026392406,0.0022117125,0.003036169,0.0020995832,0.001419954],"category_scores_gemma":[0.011336552,0.00045274355,0.0014825588,0.003744241,0.0014461426,0.008142866,0.005655533,0.0015191227,0.0005641962],"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.0028491942,0.001012418,0.013484167,0.00055817,0.0003731101,0.0016073065,0.0024021447,0.30387875,0.04466474,0.18368731,0.022681257,0.4228015],"study_design_scores_gemma":[0.00012286591,0.00030813576,0.0017399838,0.000022909506,0.00009502212,0.0010874302,0.00073785905,0.82694566,0.022358363,0.13807231,0.0084259,0.00008359483],"about_ca_topic_score_codex":0.0032857365,"about_ca_topic_score_gemma":0.002391905,"teacher_disagreement_score":0.0052886237,"about_ca_system_score_codex":0.0017864965,"about_ca_system_score_gemma":0.0028375862,"threshold_uncertainty_score":0.0279693},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090080395,0.0056681084,0.4617988,0.0066555957,0.0014873623,0.0013335415,0.00920177,0.3705149,0.05325957],"genre_scores_gemma":[0.4250575,0.0052095884,0.47496137,0.0036058212,0.00077068136,0.0011462013,0.02435787,0.012362369,0.052528646],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99902797,0.00015786223,0.00013949693,0.00019030728,0.00031811107,0.0001662635],"domain_scores_gemma":[0.99765587,0.00030691532,0.00015883791,0.0009994588,0.0006059163,0.00027284573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017600391,0.0007086145,0.0008048905,0.0013742939,0.0011821908,0.002929693,0.0027506629,0.0008713491,0.015912335],"category_scores_gemma":[0.0056450074,0.0009097132,0.00053859333,0.00216756,0.00058117445,0.010479484,0.0032738382,0.0018943686,0.007322221],"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.0018501998,0.0005859873,0.008052633,0.0014547439,0.00024389224,0.0005235547,0.0015147579,0.006197792,0.048028063,0.0558291,0.42660028,0.44911885],"study_design_scores_gemma":[0.000967418,0.0010674449,0.015498092,0.0004583744,0.00040695549,0.0029269282,0.0014088756,0.13664019,0.03814737,0.04990919,0.75200003,0.0005690629],"about_ca_topic_score_codex":0.0029801328,"about_ca_topic_score_gemma":0.0038544624,"teacher_disagreement_score":0.015912335,"about_ca_system_score_codex":0.0008118528,"about_ca_system_score_gemma":0.0020474235,"threshold_uncertainty_score":0.053232014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041258307,0.00033168963,0.99441355,0.00010770173,0.000056451016,0.000035115678,0.00014507108,0.00032068416,0.00046389108],"genre_scores_gemma":[0.21454158,0.0008853757,0.7799575,0.00021526359,0.00013056198,0.00021941405,0.0016982037,0.0002130501,0.002139054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846774,0.00043090194,0.00007365454,0.0004500431,0.00045870215,0.00011888141],"domain_scores_gemma":[0.9983203,0.00059861434,0.00021852259,0.00022293649,0.0005833547,0.000056282628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015691201,0.0017010804,0.0013504345,0.0016440864,0.0008162549,0.0010760977,0.0011970936,0.001184633,0.0015841939],"category_scores_gemma":[0.0059358226,0.0004330953,0.0014920309,0.0022083416,0.000807197,0.0018352397,0.000858195,0.0013872675,0.00081712654],"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.00025720088,0.00009918512,0.0020342646,0.00052215095,0.00021381561,0.00028092373,0.000314141,0.47653767,0.019667974,0.030351022,0.016822346,0.4528993],"study_design_scores_gemma":[0.0000082548695,0.000023713057,0.00046768232,0.0000137991465,0.00001389897,0.00007205985,0.000034835564,0.98681355,0.0016265458,0.008840738,0.002064076,0.000020744747],"about_ca_topic_score_codex":0.0073320945,"about_ca_topic_score_gemma":0.008439212,"teacher_disagreement_score":0.0073320945,"about_ca_system_score_codex":0.00089247915,"about_ca_system_score_gemma":0.0013196943,"threshold_uncertainty_score":0.014578819},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051374853,0.00047647327,0.9425149,0.00071154785,0.00004679422,0.00011658442,0.00027497901,0.0009441192,0.003539819],"genre_scores_gemma":[0.6109159,0.0007160194,0.3826821,0.00025837464,0.00013932817,0.00027819103,0.00065167143,0.00033630888,0.0040221126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984863,0.0005344134,0.00006601195,0.0003845623,0.00032069205,0.00020804741],"domain_scores_gemma":[0.9912315,0.0067635695,0.0006422575,0.00061714964,0.00051466393,0.0002307752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028873575,0.00081031356,0.0010447113,0.0020078304,0.0012976651,0.0020018904,0.0015200082,0.001123778,0.002282053],"category_scores_gemma":[0.01534643,0.000588703,0.0006954803,0.0021021843,0.0015549562,0.0045441873,0.0021895678,0.0012321356,0.00039326522],"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.00033202153,0.00012585596,0.0016983913,0.00036093,0.000061467996,0.0001597378,0.000385268,0.72222024,0.0078307185,0.13038313,0.005313619,0.13112867],"study_design_scores_gemma":[0.000023543318,0.0000300412,0.00023790522,0.0000143927155,0.00001111409,0.000040242452,0.0000421722,0.83455515,0.002197594,0.16123515,0.0016042799,0.0000083639825],"about_ca_topic_score_codex":0.003104913,"about_ca_topic_score_gemma":0.0029161742,"teacher_disagreement_score":0.003104913,"about_ca_system_score_codex":0.0017004504,"about_ca_system_score_gemma":0.0014654805,"threshold_uncertainty_score":0.015269995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04371993,0.00041096882,0.94710076,0.00030067234,0.000050993083,0.00011892338,0.00020440426,0.00167642,0.0064169136],"genre_scores_gemma":[0.2857211,0.00022162331,0.7089827,0.00011760742,0.00002263159,0.00017172743,0.0003463822,0.00023258795,0.0041837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963856,0.00007258064,0.000021602393,0.000089350324,0.00011762611,0.000060291168],"domain_scores_gemma":[0.99948764,0.00021681839,0.000044628407,0.00010711824,0.000107266475,0.000036485733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004831241,0.00046496702,0.0005906902,0.0008005568,0.0007542152,0.00090492127,0.0014730814,0.0007463052,0.0038449466],"category_scores_gemma":[0.0015459779,0.0003334288,0.0005187525,0.0012784104,0.00055789045,0.0012553163,0.0011494582,0.0005357152,0.000759991],"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.00050723774,0.00026765684,0.0030443827,0.0005171094,0.00014035976,0.0003497306,0.00044278463,0.58424515,0.040124696,0.072503954,0.011070482,0.28678647],"study_design_scores_gemma":[0.00008650407,0.000119711134,0.00025361485,0.000018786268,0.00002124425,0.0001041157,0.000058432754,0.9684839,0.005939957,0.02038799,0.004510991,0.000014742375],"about_ca_topic_score_codex":0.005544346,"about_ca_topic_score_gemma":0.009625025,"teacher_disagreement_score":0.005544346,"about_ca_system_score_codex":0.0008482323,"about_ca_system_score_gemma":0.0022835298,"threshold_uncertainty_score":0.012862623},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021687765,0.00004906563,0.996705,0.00008012522,0.000016959975,0.00001552439,0.000030387866,0.00013477547,0.0007993884],"genre_scores_gemma":[0.19574451,0.00039483004,0.7968519,0.00026539416,0.00009144946,0.00026629394,0.00057430635,0.0003340732,0.0054773083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992544,0.00031780894,0.000023374423,0.00016386603,0.00017362622,0.0000668245],"domain_scores_gemma":[0.9986418,0.000847221,0.00012033046,0.00015214503,0.00017363632,0.00006477427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011620871,0.0013317575,0.0010417402,0.0012024993,0.00051133445,0.001026745,0.0010416127,0.0012800369,0.0036095094],"category_scores_gemma":[0.004152608,0.0006479893,0.0008955409,0.0013976396,0.0009862582,0.0016739953,0.0012436351,0.0016917413,0.0012967434],"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.00010495515,0.00008227942,0.0005287398,0.0001451787,0.000074149735,0.00012410192,0.0001019109,0.82969534,0.0051086145,0.06857528,0.007220619,0.088238835],"study_design_scores_gemma":[0.0000061306896,0.000009804983,0.000044005286,0.0000041480266,0.0000033505805,0.000015937478,0.000011898056,0.98071414,0.0003098612,0.018160101,0.00071660883,0.000003990404],"about_ca_topic_score_codex":0.0033382361,"about_ca_topic_score_gemma":0.004073771,"teacher_disagreement_score":0.0036095094,"about_ca_system_score_codex":0.00083416846,"about_ca_system_score_gemma":0.0011139362,"threshold_uncertainty_score":0.012075007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025067327,0.00011198813,0.00011867737,0.00013000454,0.000036385558,0.000018022312,0.9979334,0.0003309856,0.0010698707],"genre_scores_gemma":[0.000531854,0.00007848371,0.00037969564,0.000057251167,0.000009180345,0.00006554352,0.99810225,0.000038274244,0.00073759636],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987795,0.00022578354,0.00016819229,0.00038344436,0.00027815293,0.00016497298],"domain_scores_gemma":[0.99772936,0.00064314407,0.00021165218,0.0005666013,0.000635664,0.00021358354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096752506,0.0018566729,0.001293012,0.0037123444,0.00086686685,0.0019032347,0.0028812373,0.0020961172,0.057579663],"category_scores_gemma":[0.006060747,0.0004816814,0.0013464296,0.0058478643,0.00039476785,0.0016097127,0.0017273591,0.0019095943,0.07541851],"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.00005036471,0.000036413665,0.0009459252,0.00053639285,0.000027482127,0.00002880462,0.00002231666,0.00042976858,0.00009947564,0.0007801457,0.99336493,0.0036780692],"study_design_scores_gemma":[0.00017189486,0.000021993497,0.0040614707,0.00022091258,0.000023923447,0.00010210614,0.0001246392,0.00089454075,0.00024098634,0.0018367085,0.99228066,0.000020103991],"about_ca_topic_score_codex":0.01754845,"about_ca_topic_score_gemma":0.042918373,"teacher_disagreement_score":0.057579663,"about_ca_system_score_codex":0.0015938804,"about_ca_system_score_gemma":0.0021591266,"threshold_uncertainty_score":0.1926232},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08552732,0.004883336,0.011861602,0.0046487125,0.0009981209,0.00085940235,0.82975006,0.033166792,0.028304692],"genre_scores_gemma":[0.03280069,0.00060594303,0.018649122,0.0007062114,0.00007119522,0.00039388653,0.9411602,0.0009067484,0.004705987],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998026,0.00043171842,0.000111386355,0.0006823482,0.00049889064,0.00024975656],"domain_scores_gemma":[0.9974433,0.0007692068,0.000194633,0.00074964954,0.0006039618,0.00023926732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015266975,0.0044892263,0.0012819489,0.0032063322,0.0019008006,0.0020049307,0.006890153,0.0045449333,0.008365433],"category_scores_gemma":[0.007219826,0.00075906375,0.0024969617,0.004910823,0.0011689634,0.0026926897,0.0019714714,0.0036701267,0.008398677],"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.00037796365,0.0005989291,0.0027794351,0.0015143178,0.00026372014,0.00023416866,0.00009189094,0.02553624,0.0014790919,0.0045954613,0.9327993,0.029729526],"study_design_scores_gemma":[0.0021859487,0.0007598157,0.017276887,0.0006644193,0.00030465913,0.0011538854,0.00078346615,0.27465558,0.013106596,0.03626714,0.65265423,0.00018734724],"about_ca_topic_score_codex":0.052013874,"about_ca_topic_score_gemma":0.09672965,"teacher_disagreement_score":0.052013874,"about_ca_system_score_codex":0.0037099097,"about_ca_system_score_gemma":0.0024768973,"threshold_uncertainty_score":0.103422225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006783961,0.0003627605,0.00027213708,0.00028908098,0.00008614227,0.0000401771,0.99301034,0.0036861305,0.0015748389],"genre_scores_gemma":[0.0009803004,0.00012562703,0.0006560195,0.000095723786,0.000013268016,0.000089893736,0.9973028,0.00022626024,0.0005100925],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985114,0.00030997474,0.00012846472,0.00048657935,0.00035042033,0.0002132098],"domain_scores_gemma":[0.99746394,0.00069487887,0.00024394029,0.00095454673,0.00039847937,0.00024413162],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011627018,0.005306003,0.0021811062,0.006204452,0.001778952,0.0036875287,0.007053108,0.004539787,0.05122554],"category_scores_gemma":[0.007192746,0.0009978256,0.0025493538,0.0077621,0.0009047299,0.0023714674,0.0027441294,0.0034334133,0.08223289],"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.00007846181,0.000059283553,0.0004522776,0.0010050092,0.000059940678,0.000042304335,0.000029394881,0.00082846236,0.00018479464,0.00080990413,0.9930496,0.0034005118],"study_design_scores_gemma":[0.0008878095,0.00010117674,0.0034583588,0.0004783261,0.00010182655,0.00033983446,0.00015508522,0.004181517,0.0012686382,0.0059061814,0.9830518,0.00006958744],"about_ca_topic_score_codex":0.020090297,"about_ca_topic_score_gemma":0.039726924,"teacher_disagreement_score":0.94877446,"about_ca_system_score_codex":0.0021145097,"about_ca_system_score_gemma":0.0021390284,"threshold_uncertainty_score":0.17136651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63232183,0.0016831434,0.32978982,0.00063111325,0.000087957786,0.000032371718,0.00026858106,0.00015158819,0.03503357],"genre_scores_gemma":[0.9780759,0.000744708,0.017169613,0.00005211715,0.00005584218,0.000029776646,0.00013630434,0.000061389204,0.003674268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968445,0.00007127122,0.000010848505,0.000078098514,0.00009441138,0.000060954528],"domain_scores_gemma":[0.99791414,0.0012802794,0.00021824815,0.00022110865,0.00022924095,0.00013692571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005237143,0.0003249435,0.00030506903,0.0013686058,0.00058220536,0.0006587458,0.0006527646,0.0003710678,0.0035645966],"category_scores_gemma":[0.0036886483,0.00016183627,0.0003713102,0.00093556714,0.0011625389,0.0024453145,0.00069803005,0.00068582135,0.00025389314],"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.000191067,0.000059186637,0.0047776117,0.00030983274,0.000046284276,0.00038594776,0.0006431537,0.103913635,0.015775966,0.8152901,0.002200114,0.056407094],"study_design_scores_gemma":[0.000016253412,0.000093180875,0.0062133763,0.000045769826,0.000034394037,0.0008392439,0.00040851583,0.207684,0.0068773744,0.77321833,0.0045276973,0.000041827512],"about_ca_topic_score_codex":0.000497364,"about_ca_topic_score_gemma":0.00054045336,"teacher_disagreement_score":0.0035645966,"about_ca_system_score_codex":0.00052635744,"about_ca_system_score_gemma":0.0002002856,"threshold_uncertainty_score":0.011924744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013883134,0.00068734656,0.91326374,0.0008360457,0.00012158692,0.0005280518,0.00406208,0.06080292,0.0058150413],"genre_scores_gemma":[0.07737002,0.00037988016,0.90607667,0.0004461277,0.00009168645,0.00048716163,0.008838853,0.0034308727,0.002878772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971891,0.00071898807,0.00019801005,0.0007940966,0.0008884471,0.00021129019],"domain_scores_gemma":[0.99251056,0.0040349225,0.00043208175,0.0021737453,0.000634461,0.00021428413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020306932,0.0017987516,0.001432944,0.0027796307,0.0015145125,0.002813992,0.0053059803,0.0018543625,0.008149909],"category_scores_gemma":[0.014132583,0.0014289607,0.0018078439,0.003972645,0.0014531473,0.0059042275,0.004158542,0.0024166727,0.0040663974],"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.0009612144,0.000748959,0.007317543,0.0030573152,0.0004996533,0.00077077287,0.0007647769,0.098905385,0.023345442,0.09838002,0.16478959,0.6004593],"study_design_scores_gemma":[0.00022704313,0.00019702666,0.0007887443,0.00011563043,0.000098071025,0.00064326305,0.00022200587,0.817399,0.018321889,0.11820002,0.043722097,0.000065246015],"about_ca_topic_score_codex":0.0045626624,"about_ca_topic_score_gemma":0.011388849,"teacher_disagreement_score":0.008149909,"about_ca_system_score_codex":0.0007540531,"about_ca_system_score_gemma":0.003146899,"threshold_uncertainty_score":0.027264178},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019639019,0.002810786,0.24605739,0.0012343886,0.00090096286,0.0007039175,0.14461884,0.49559397,0.08844073],"genre_scores_gemma":[0.098919146,0.0032059725,0.30830824,0.0012815063,0.00020698435,0.0020894753,0.42964777,0.11158112,0.044759847],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793917,0.00034249647,0.00019906416,0.0003553427,0.00085735694,0.00030661127],"domain_scores_gemma":[0.9966574,0.0011263359,0.00014104371,0.0010814336,0.0007535158,0.00024032188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016496661,0.003132643,0.0012445683,0.0049846293,0.0011236415,0.0027480363,0.0068097375,0.0018954247,0.047488857],"category_scores_gemma":[0.008014715,0.0015945171,0.0016751081,0.0068176524,0.0007303339,0.006075005,0.0032846984,0.0025521575,0.022610119],"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.00061341986,0.00039163922,0.0015199861,0.0019962506,0.00011374711,0.00016577863,0.00013544297,0.028826986,0.00502618,0.028488966,0.7715543,0.16116737],"study_design_scores_gemma":[0.00089236075,0.000336182,0.0018373041,0.00043416696,0.00018646994,0.00046515456,0.00025696386,0.20496538,0.03670019,0.0728853,0.6808262,0.00021433411],"about_ca_topic_score_codex":0.010631445,"about_ca_topic_score_gemma":0.012780606,"teacher_disagreement_score":0.047488857,"about_ca_system_score_codex":0.0019321571,"about_ca_system_score_gemma":0.0025769656,"threshold_uncertainty_score":0.15886611},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049040258,0.006372926,0.856475,0.0014118971,0.00048380237,0.00066193816,0.014455715,0.06573944,0.005359046],"genre_scores_gemma":[0.26986894,0.0029315997,0.6911725,0.00088505534,0.00022862882,0.00047628756,0.028453406,0.0015624928,0.0044210884],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997528,0.00030532063,0.00035800776,0.00058778055,0.0010796668,0.00014116206],"domain_scores_gemma":[0.99363744,0.0008581755,0.0003552745,0.0038859497,0.00091772986,0.00034545298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019651467,0.0011129805,0.0013472763,0.0036003839,0.0008500204,0.0035628239,0.0056851846,0.0009373467,0.0028486173],"category_scores_gemma":[0.009798744,0.00089421,0.001211187,0.0064705117,0.00056147954,0.011152656,0.004389247,0.0013038459,0.001543176],"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.0019157314,0.0006551513,0.0111011835,0.0012501772,0.00045672382,0.00050082995,0.0007077223,0.037339002,0.034789864,0.046406377,0.09848747,0.76638985],"study_design_scores_gemma":[0.00043519546,0.00069366646,0.004773089,0.00013639122,0.00032473286,0.0015780157,0.0008156126,0.73991454,0.042334918,0.06726614,0.14144833,0.00027943283],"about_ca_topic_score_codex":0.009742966,"about_ca_topic_score_gemma":0.010355107,"teacher_disagreement_score":0.009742966,"about_ca_system_score_codex":0.0009225484,"about_ca_system_score_gemma":0.001979907,"threshold_uncertainty_score":0.019372523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18130277,0.0014127599,0.73919,0.003901778,0.00030341948,0.00019759439,0.0014185801,0.00044632622,0.07182674],"genre_scores_gemma":[0.9095294,0.0012031902,0.049888976,0.00044735157,0.00030491297,0.00021071133,0.00067005504,0.0001619799,0.037583422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935466,0.0002566732,0.000010172875,0.00014582822,0.000087344146,0.00014544585],"domain_scores_gemma":[0.9982432,0.000844066,0.00024362524,0.00018663921,0.00020745335,0.00027511557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094783393,0.0010352549,0.0014670045,0.001510356,0.0015266074,0.0021213263,0.0035481348,0.002724314,0.009985469],"category_scores_gemma":[0.004052852,0.00066391024,0.0012597704,0.0017291658,0.0016841871,0.0044315136,0.0017146864,0.0025322277,0.0009259815],"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.00014382943,0.00008043301,0.00040556557,0.000083094405,0.000037624635,0.00019854159,0.00011770225,0.27751204,0.0008519228,0.7060342,0.006681454,0.007853622],"study_design_scores_gemma":[0.000022097205,0.000028440068,0.00015252162,0.000020356665,0.000020891866,0.00007576023,0.00004046241,0.791407,0.00016189751,0.20545924,0.002590922,0.000020373487],"about_ca_topic_score_codex":0.0118717775,"about_ca_topic_score_gemma":0.011560693,"teacher_disagreement_score":0.0118717775,"about_ca_system_score_codex":0.0023701254,"about_ca_system_score_gemma":0.001245553,"threshold_uncertainty_score":0.033404768},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009536625,0.48622808,0.18891583,0.24303026,0.0075419582,0.00007767544,0.0019737883,0.003326846,0.059368957],"genre_scores_gemma":[0.24806932,0.47527698,0.19683532,0.034838784,0.020845013,0.00021945479,0.0036204536,0.0013860647,0.01890877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960277,0.001579631,0.00013487179,0.000724041,0.0012957581,0.00023802917],"domain_scores_gemma":[0.9768098,0.015472177,0.00050311856,0.0027296864,0.0032926558,0.0011925129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076404093,0.00089611113,0.0012982195,0.0043583517,0.0011842732,0.0071040425,0.002289797,0.0033232255,0.010571861],"category_scores_gemma":[0.017833967,0.0004935939,0.0011824544,0.004386754,0.00534679,0.021040592,0.0032103597,0.0054251547,0.0037887478],"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.00013236751,0.000075730866,0.0010821603,0.0010859969,0.00007461446,0.00007100741,0.000367852,0.0044947043,0.0005313614,0.6003709,0.10771329,0.28400007],"study_design_scores_gemma":[0.000015328877,0.000029622686,0.00041789425,0.00036193046,0.00001616471,0.00010441535,0.00027709137,0.010250486,0.00025626214,0.73523563,0.25299972,0.000035469642],"about_ca_topic_score_codex":0.0031429122,"about_ca_topic_score_gemma":0.0021437062,"teacher_disagreement_score":0.010571861,"about_ca_system_score_codex":0.0028499016,"about_ca_system_score_gemma":0.002857573,"threshold_uncertainty_score":0.040406823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024359865,0.00012467994,0.00010331569,0.000108746935,0.000038121958,0.000016910579,0.9964156,0.0018731602,0.0010758183],"genre_scores_gemma":[0.00077435066,0.00010961176,0.00042189859,0.000100193174,0.000014300698,0.00009521292,0.9974425,0.00028824428,0.0007537255],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987902,0.00014569248,0.00013804653,0.0004243728,0.00028023834,0.00022143956],"domain_scores_gemma":[0.99737036,0.0007138921,0.00023535713,0.0008526079,0.0005597216,0.00026798184],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008732674,0.005025449,0.002208598,0.0059142783,0.0014164723,0.004145643,0.005634183,0.00396834,0.11271816],"category_scores_gemma":[0.0069627305,0.0011761131,0.0019032311,0.008355885,0.0007041137,0.002420589,0.002667774,0.002596549,0.13529158],"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.000048554277,0.000028006536,0.00036907702,0.00067640934,0.000026321803,0.000014781269,0.000014382336,0.00019265203,0.000100087345,0.00042763742,0.9962037,0.0018984106],"study_design_scores_gemma":[0.000593617,0.000039611125,0.0024522431,0.0003748888,0.000052078467,0.0001280713,0.00008519826,0.001088634,0.0010060996,0.0030772982,0.99105823,0.000044048786],"about_ca_topic_score_codex":0.017679475,"about_ca_topic_score_gemma":0.028271075,"teacher_disagreement_score":0.88728184,"about_ca_system_score_codex":0.0022947546,"about_ca_system_score_gemma":0.0024377643,"threshold_uncertainty_score":0.37707984},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10670628,0.0003630929,0.8690794,0.000290866,0.0000856804,0.00010480488,0.000417049,0.01815825,0.0047945525],"genre_scores_gemma":[0.55740994,0.00018074311,0.43766746,0.0002144488,0.000028719225,0.00012767271,0.0011554157,0.0010419945,0.002173572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923813,0.00012365398,0.00006446915,0.00017466102,0.00029580676,0.00010334161],"domain_scores_gemma":[0.99802446,0.0007388543,0.0001269594,0.0007373149,0.0003221293,0.00005021445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007395723,0.000688198,0.00037127163,0.0006515159,0.0005536513,0.00083107635,0.0017368731,0.00033635536,0.0019185542],"category_scores_gemma":[0.0036416485,0.00032352345,0.0005314803,0.0013245927,0.00075377006,0.0021019822,0.0010610593,0.0008106174,0.00043284806],"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.00097127724,0.00030534947,0.013713177,0.0007601471,0.00015684398,0.00029191858,0.0005634084,0.24409056,0.14376664,0.053750917,0.0187912,0.52283853],"study_design_scores_gemma":[0.00006608876,0.00013743863,0.0015106308,0.000016538666,0.000045015273,0.00012762508,0.00010371434,0.83827525,0.12232206,0.027107583,0.010261656,0.000026339738],"about_ca_topic_score_codex":0.0038393766,"about_ca_topic_score_gemma":0.0074898913,"teacher_disagreement_score":0.0038393766,"about_ca_system_score_codex":0.0011994434,"about_ca_system_score_gemma":0.001409614,"threshold_uncertainty_score":0.008702576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004651988,0.00071149424,0.98898417,0.0013892038,0.00008148942,0.00009615574,0.00029374284,0.0015799911,0.0022118373],"genre_scores_gemma":[0.08421673,0.001715242,0.9079717,0.0010858466,0.00019777336,0.00023365373,0.0014075033,0.00079474086,0.0023767392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98913,0.0040906733,0.00088422967,0.0012535072,0.0040883655,0.0005531796],"domain_scores_gemma":[0.98635614,0.004534296,0.00077154505,0.005301698,0.0025293215,0.00050698855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0096345665,0.0008018757,0.0010940884,0.0036755968,0.0014006003,0.010900147,0.0039717867,0.0020718784,0.0021236108],"category_scores_gemma":[0.023139508,0.0012310975,0.0022238386,0.005104025,0.0028490329,0.015533531,0.007572635,0.0052803718,0.0009649033],"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.00012396339,0.00008812446,0.0018847142,0.00022642394,0.000094804236,0.0002198229,0.0015122407,0.015636884,0.004194294,0.8577414,0.012201091,0.1060762],"study_design_scores_gemma":[0.00004297821,0.000058202055,0.00034507344,0.00015127896,0.000076062766,0.0002948014,0.0007341459,0.13617033,0.007761129,0.7550815,0.099216335,0.000068164925],"about_ca_topic_score_codex":0.0065428037,"about_ca_topic_score_gemma":0.00534558,"teacher_disagreement_score":0.010900147,"about_ca_system_score_codex":0.0020003887,"about_ca_system_score_gemma":0.0025579822,"threshold_uncertainty_score":0.05095309},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08073127,0.0006002677,0.9048095,0.00077303516,0.00016995684,0.00059603737,0.001311842,0.003634014,0.007374144],"genre_scores_gemma":[0.3717441,0.00028169889,0.6165549,0.00032587702,0.00008760746,0.00033336453,0.00426219,0.00088681956,0.0055234237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869764,0.0003026526,0.0000704815,0.0003360729,0.0004116413,0.00018143811],"domain_scores_gemma":[0.997609,0.000773254,0.00011783505,0.0007059043,0.00057542056,0.00021853481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000912176,0.0012269499,0.0013299666,0.001985919,0.0016366349,0.0014973512,0.003036257,0.0011566778,0.005010044],"category_scores_gemma":[0.0052908137,0.0006117238,0.0009310477,0.0023991936,0.0006264473,0.0032355448,0.002441954,0.0010694925,0.0011146372],"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.0010167832,0.0010021083,0.0050675604,0.000742671,0.00021820562,0.00049696036,0.0008206304,0.1674549,0.054757714,0.043455694,0.038105953,0.68686086],"study_design_scores_gemma":[0.000065685286,0.00016769872,0.0008657371,0.000040214425,0.000081098835,0.0003752419,0.00058942335,0.93804854,0.013003333,0.039202146,0.0075313374,0.000029614024],"about_ca_topic_score_codex":0.0046745953,"about_ca_topic_score_gemma":0.011603229,"teacher_disagreement_score":0.005010044,"about_ca_system_score_codex":0.0010133606,"about_ca_system_score_gemma":0.0019326461,"threshold_uncertainty_score":0.01676023},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073211975,0.0037384748,0.8471485,0.0051393174,0.0015110277,0.00013427329,0.0023357815,0.0013830266,0.06539766],"genre_scores_gemma":[0.6637023,0.0035186976,0.29002017,0.0017230704,0.0004516787,0.00036315215,0.0021708717,0.00044917435,0.037600815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976796,0.00006957659,0.0000131658535,0.0000818401,0.000047790116,0.000019749325],"domain_scores_gemma":[0.9997814,0.00008971772,0.000049461287,0.000033032797,0.000027528591,0.000018780891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029302342,0.00061015424,0.0002675777,0.000696016,0.00043179694,0.0010115341,0.00082240946,0.0011217897,0.012472079],"category_scores_gemma":[0.0014179177,0.00031366549,0.00074735284,0.0008344527,0.0016855788,0.0039720302,0.0008436683,0.0013561002,0.0021651685],"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.00007273954,0.000027950171,0.00050993357,0.0002592363,0.00002480637,0.00014750837,0.00012771216,0.03678685,0.0027583488,0.9153617,0.007527814,0.03639544],"study_design_scores_gemma":[0.000012313832,0.000028187262,0.0003299464,0.00003504861,0.000011537499,0.00014364354,0.000049691942,0.17081483,0.0017923905,0.8039237,0.022836152,0.000022466522],"about_ca_topic_score_codex":0.0015314907,"about_ca_topic_score_gemma":0.0026528642,"teacher_disagreement_score":0.012472079,"about_ca_system_score_codex":0.0006822437,"about_ca_system_score_gemma":0.00030905852,"threshold_uncertainty_score":0.04172331},"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":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011457127,0.30924776,0.17339629,0.3927657,0.009988472,0.000040924362,0.00023982106,0.00090725214,0.10195675],"genre_scores_gemma":[0.38949174,0.31800255,0.19110729,0.030778686,0.028648064,0.00015983517,0.0003734763,0.0009626043,0.04047587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99718803,0.0013490606,0.000096077856,0.00032205152,0.00082408165,0.00022074474],"domain_scores_gemma":[0.9831835,0.012276754,0.00027121382,0.0017530381,0.0013211385,0.0011944055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007518928,0.00076969847,0.0010060056,0.001893114,0.0013145688,0.0074886926,0.0017015776,0.0040415404,0.011191986],"category_scores_gemma":[0.010416608,0.00051174354,0.0005631791,0.0019033959,0.0077926093,0.016710022,0.005080618,0.008082005,0.0032388114],"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.000055942495,0.00004944696,0.00052601023,0.00040054278,0.00003030099,0.0000869503,0.00062326906,0.0015502548,0.00048790025,0.7273366,0.04846464,0.22038813],"study_design_scores_gemma":[0.0000148182335,0.000064169864,0.00032002106,0.00040050823,0.000010357252,0.00029776618,0.00072094164,0.006819837,0.00043038558,0.7215323,0.26934537,0.00004360262],"about_ca_topic_score_codex":0.0007920634,"about_ca_topic_score_gemma":0.0013121483,"teacher_disagreement_score":0.011191986,"about_ca_system_score_codex":0.001420702,"about_ca_system_score_gemma":0.0015119193,"threshold_uncertainty_score":0.039764404},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10072067,0.00055522163,0.8815016,0.0009828206,0.00016907476,0.00020824654,0.0020504075,0.0070151063,0.006796888],"genre_scores_gemma":[0.67149955,0.00039723472,0.31074443,0.0006979177,0.00007595194,0.00035398884,0.009278914,0.00070079166,0.006251168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937916,0.00015933884,0.000029123665,0.00022937004,0.000105048515,0.000097952405],"domain_scores_gemma":[0.99804306,0.0010731951,0.00010536147,0.00031895487,0.00036339706,0.00009595283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009317367,0.0014148651,0.0009076456,0.0011609248,0.0006587574,0.00096233864,0.0020443187,0.0015085125,0.0043688053],"category_scores_gemma":[0.0069145234,0.00074426335,0.0011880287,0.0013493404,0.00068628165,0.0019965456,0.001410321,0.00236148,0.001147928],"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.00009301253,0.00007985108,0.0017324848,0.000083495885,0.000039745148,0.00012399985,0.00007308216,0.9015206,0.0015905513,0.00550434,0.0079595065,0.08119936],"study_design_scores_gemma":[0.000004236251,0.000007928796,0.00012280881,0.000005934357,0.0000045536717,0.000008482143,0.000016582746,0.99391806,0.00046518512,0.0048145535,0.00062933273,0.0000023357059],"about_ca_topic_score_codex":0.043134026,"about_ca_topic_score_gemma":0.06497293,"teacher_disagreement_score":0.043134026,"about_ca_system_score_codex":0.0021951706,"about_ca_system_score_gemma":0.0023152085,"threshold_uncertainty_score":0.08576596},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029769728,0.0015639979,0.0066529177,0.011280417,0.00925126,0.00016960612,0.0040912186,0.003544004,0.9604697],"genre_scores_gemma":[0.017737791,0.0006797907,0.0043684277,0.0008000646,0.0015406259,0.00017439047,0.0019848093,0.0013318829,0.9713823],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989347,0.0001519137,0.000017627062,0.00009454169,0.00060232374,0.00019888421],"domain_scores_gemma":[0.998417,0.00017958156,0.00006816063,0.00023498031,0.00060233485,0.00049788185],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014756647,0.00081736443,0.00045334944,0.0019749722,0.0041541425,0.007167833,0.0011087476,0.0013123626,0.39644733],"category_scores_gemma":[0.002585054,0.00035490838,0.000906681,0.0014141122,0.000857082,0.0024565356,0.0049385335,0.0023234056,0.14338933],"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.000034624896,0.000010362821,0.00003291263,0.00003821874,0.0000027829406,0.000038752605,0.00008280352,0.00007446757,0.00023175144,0.008726821,0.97805184,0.012674624],"study_design_scores_gemma":[0.000003952534,0.0000080901345,0.00030284733,0.000014413687,0.0000012531924,0.000027310614,0.00008654351,0.00009876003,0.00023148472,0.0016630439,0.99755484,0.000007416127],"about_ca_topic_score_codex":0.0045317155,"about_ca_topic_score_gemma":0.014328873,"teacher_disagreement_score":0.39644733,"about_ca_system_score_codex":0.0025004677,"about_ca_system_score_gemma":0.001627288,"threshold_uncertainty_score":0.8608946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033480695,0.00019122963,0.9916797,0.00019456475,0.00013045255,0.00012355806,0.00009589256,0.0015912993,0.0026452898],"genre_scores_gemma":[0.04526308,0.00027483664,0.94360214,0.0003599673,0.00019892483,0.0002417264,0.00070660154,0.0009843957,0.008368186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973029,0.0005513922,0.00015388214,0.00083888497,0.00085827825,0.00029467407],"domain_scores_gemma":[0.9974529,0.00045973164,0.00008639909,0.0011093878,0.0007714825,0.00012001266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00207945,0.0015734589,0.002427473,0.0046982476,0.002278149,0.0027487369,0.004934432,0.0031808293,0.008809951],"category_scores_gemma":[0.009770654,0.0011473622,0.002413346,0.005601501,0.0015776121,0.0041516065,0.004621619,0.0029379171,0.0057102344],"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.00029474316,0.00041824667,0.0009039984,0.00036861346,0.00020650441,0.0001525786,0.00041286292,0.18727554,0.013250096,0.13679251,0.029792706,0.63013166],"study_design_scores_gemma":[0.000101757105,0.00007064201,0.0003928936,0.000037725677,0.000041485033,0.00014369072,0.000084335385,0.8485965,0.005195198,0.11613329,0.029153783,0.00004871369],"about_ca_topic_score_codex":0.017124929,"about_ca_topic_score_gemma":0.023069784,"teacher_disagreement_score":0.017124929,"about_ca_system_score_codex":0.0023364138,"about_ca_system_score_gemma":0.0033751477,"threshold_uncertainty_score":0.034050465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10591947,0.00057315297,0.86892533,0.0015027684,0.00014035722,0.0001975946,0.00043492648,0.00076231,0.02154399],"genre_scores_gemma":[0.9096173,0.000551738,0.06799741,0.0004987698,0.000098629585,0.0002917951,0.00048818876,0.00023290615,0.020223236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983481,0.0005242436,0.00006283663,0.0004310778,0.0003481806,0.00028549254],"domain_scores_gemma":[0.9866881,0.009531248,0.0008928365,0.0015350686,0.00068544503,0.00066718436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002636985,0.0011587704,0.0016216742,0.00093581906,0.0011180089,0.0018655412,0.003757173,0.0023772405,0.008745988],"category_scores_gemma":[0.021011716,0.00075592013,0.0011948,0.00068171695,0.0027509835,0.0051201913,0.0031730537,0.0033609744,0.0010421586],"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.00023182371,0.00008585262,0.001266802,0.00011062766,0.000053616066,0.00020513503,0.00021742337,0.66300404,0.0027512163,0.3157581,0.004095196,0.012220176],"study_design_scores_gemma":[0.00001789207,0.000033032284,0.0001596573,0.000016775008,0.000013962093,0.00007318174,0.000032586635,0.91183335,0.00079384947,0.085835606,0.0011756388,0.000014529776],"about_ca_topic_score_codex":0.0033443752,"about_ca_topic_score_gemma":0.0035604802,"teacher_disagreement_score":0.008745988,"about_ca_system_score_codex":0.0027857863,"about_ca_system_score_gemma":0.0010804341,"threshold_uncertainty_score":0.029258251},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031875383,0.0010686619,0.9473914,0.0006023975,0.0003369175,0.00025145887,0.00057525595,0.006956108,0.010942425],"genre_scores_gemma":[0.25538376,0.000439356,0.7279085,0.00036763205,0.00023926265,0.0004060487,0.0032719944,0.0015935549,0.010389959],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978175,0.00078244996,0.00013280899,0.0005110274,0.0004684043,0.00028772966],"domain_scores_gemma":[0.99580425,0.0024013382,0.00013795064,0.00097283977,0.00050934794,0.00017422222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016670965,0.001512257,0.0023400122,0.001808821,0.00097619265,0.0021901221,0.0040642796,0.0018947717,0.014687222],"category_scores_gemma":[0.008839468,0.0006462338,0.0014399559,0.0030167704,0.0006211092,0.0038490873,0.002076069,0.0031234883,0.0039552324],"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.00057962723,0.00057143223,0.0012389096,0.0003486614,0.00016315634,0.00013534885,0.00007482312,0.19503036,0.006165509,0.026207685,0.034925025,0.7345595],"study_design_scores_gemma":[0.00003999891,0.000056005334,0.00017327708,0.0000106097405,0.00002026996,0.000056126595,0.000020631463,0.97689396,0.0019727976,0.018948948,0.001797878,0.0000095735],"about_ca_topic_score_codex":0.0022964976,"about_ca_topic_score_gemma":0.006058125,"teacher_disagreement_score":0.014687222,"about_ca_system_score_codex":0.0014031403,"about_ca_system_score_gemma":0.0026160406,"threshold_uncertainty_score":0.0491336},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01098145,0.014011982,0.53800446,0.004692893,0.00454784,0.0004533513,0.0054879584,0.012655246,0.40916482],"genre_scores_gemma":[0.16976674,0.014814319,0.40341178,0.0033050322,0.0029587927,0.0006031098,0.01974154,0.0056533506,0.37974545],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955446,0.000055120352,0.000017470456,0.00013316762,0.00019820753,0.000041577914],"domain_scores_gemma":[0.9992473,0.00018345362,0.000025452202,0.00032797846,0.00016601068,0.00004975326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033879883,0.0010973827,0.0007397583,0.0023791012,0.00079705915,0.0015790751,0.0014492894,0.0009100799,0.066694796],"category_scores_gemma":[0.0017829651,0.0004820955,0.00065987307,0.0032898914,0.0007912495,0.0026725254,0.0015769056,0.0019827255,0.027517803],"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.00012762516,0.00008076862,0.00014399015,0.00032822756,0.00003800916,0.000106970925,0.000059691225,0.010089678,0.006831394,0.12348661,0.21483336,0.6438737],"study_design_scores_gemma":[0.000053933763,0.000092108414,0.00062079425,0.00022946508,0.00004735104,0.0006942845,0.000102030295,0.06569129,0.022117408,0.3766334,0.5336677,0.000050273902],"about_ca_topic_score_codex":0.0012985751,"about_ca_topic_score_gemma":0.002484085,"teacher_disagreement_score":0.066694796,"about_ca_system_score_codex":0.0008346082,"about_ca_system_score_gemma":0.0007436834,"threshold_uncertainty_score":0.22311634},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2908524,0.0013795837,0.57924145,0.0017186553,0.00037528411,0.0002097204,0.00021394163,0.00090638705,0.12510264],"genre_scores_gemma":[0.8179862,0.0007083195,0.16901252,0.0003166212,0.00016848404,0.00009512669,0.00015884406,0.00016182801,0.011392066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989963,0.0003790675,0.00006290647,0.00019810387,0.00022357989,0.00014011114],"domain_scores_gemma":[0.9984933,0.0007349497,0.0002220243,0.0002939398,0.00010840339,0.00014738459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014661652,0.00055620633,0.00041131274,0.0016408189,0.001043811,0.0019648925,0.000768839,0.0006203254,0.004183897],"category_scores_gemma":[0.0029388992,0.00038599755,0.0010511221,0.00072998635,0.0036145533,0.0033872875,0.0026284305,0.0018203591,0.0010438046],"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.000016334554,0.000013507717,0.00016522773,0.000038926963,0.000005096833,0.000115201445,0.0004729423,0.0013192818,0.002380925,0.9881352,0.0004139715,0.006923329],"study_design_scores_gemma":[0.000026192467,0.00010677515,0.00029843624,0.000035232708,0.000018141021,0.00033096474,0.00033204234,0.008484629,0.0085431365,0.9652066,0.016577657,0.000040131934],"about_ca_topic_score_codex":0.00035884677,"about_ca_topic_score_gemma":0.00056993775,"teacher_disagreement_score":0.004183897,"about_ca_system_score_codex":0.000879623,"about_ca_system_score_gemma":0.00034299854,"threshold_uncertainty_score":0.013996482},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014843728,0.018742705,0.62526387,0.005920996,0.002114898,0.00030774475,0.001598659,0.0054674973,0.3390992],"genre_scores_gemma":[0.020925358,0.020797396,0.57390445,0.004530172,0.0009062534,0.0006836266,0.0043192897,0.0027943363,0.37113914],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927145,0.00013190972,0.00003742296,0.0001433174,0.0003638688,0.000052009233],"domain_scores_gemma":[0.99948657,0.00025873823,0.000016794795,0.000100038465,0.00011055743,0.000027244163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068686326,0.0014423591,0.0007371282,0.0010639466,0.000567812,0.0027789567,0.0014793046,0.0014777292,0.065369576],"category_scores_gemma":[0.0028228087,0.0005803129,0.00084299,0.0019214574,0.000894553,0.0039062295,0.0014377828,0.0033330922,0.051033184],"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.000015974509,0.000056343,0.0001520598,0.00053490733,0.000028074986,0.000050329127,0.000168064,0.0059340135,0.001028745,0.22114128,0.36735377,0.40353644],"study_design_scores_gemma":[0.000012581898,0.000025717032,0.00020480061,0.00027517416,0.000008577197,0.0002408097,0.000062340696,0.009302664,0.0007603974,0.2241804,0.76490915,0.000017389782],"about_ca_topic_score_codex":0.0009731014,"about_ca_topic_score_gemma":0.0019233422,"teacher_disagreement_score":0.065369576,"about_ca_system_score_codex":0.0011401153,"about_ca_system_score_gemma":0.0010457474,"threshold_uncertainty_score":0.218683},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12928706,0.0008816193,0.7630024,0.00041394675,0.000312752,0.00037842183,0.0006651595,0.09691494,0.0081436755],"genre_scores_gemma":[0.6640959,0.00028725952,0.32434583,0.00032724682,0.000078752986,0.00027498047,0.0018663297,0.004532123,0.004191624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843293,0.00022451201,0.000093412375,0.0003008311,0.0006881464,0.00026005428],"domain_scores_gemma":[0.99715793,0.0007802921,0.0002150234,0.0011153104,0.0004108675,0.00032064988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011499806,0.001477039,0.00086022826,0.00095640647,0.0007101122,0.0014829597,0.0036303408,0.0006942621,0.0036553042],"category_scores_gemma":[0.005841348,0.0007376014,0.0010699537,0.0007830011,0.0011403967,0.003181614,0.0032812438,0.0021023543,0.0010568021],"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.003487472,0.0016590493,0.025863647,0.00075104757,0.00053442956,0.0010560394,0.0011848395,0.35464382,0.114913434,0.056472577,0.05113673,0.3882969],"study_design_scores_gemma":[0.00015898791,0.00012914141,0.0012384678,0.00001504282,0.00003182725,0.0000955998,0.000052805746,0.9653706,0.017567554,0.008368411,0.006926924,0.000044633613],"about_ca_topic_score_codex":0.007918102,"about_ca_topic_score_gemma":0.013728206,"teacher_disagreement_score":0.007918102,"about_ca_system_score_codex":0.0011138561,"about_ca_system_score_gemma":0.002366726,"threshold_uncertainty_score":0.01574403},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012029907,0.0018028853,0.98067755,0.00066620135,0.000061912804,0.000035136607,0.0007217121,0.0016914732,0.0023131792],"genre_scores_gemma":[0.61879426,0.0041313814,0.3558535,0.0007827029,0.00024665426,0.00023485611,0.0058661443,0.00068529457,0.013405208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958223,0.00012653845,0.000015120244,0.00013648914,0.00010669475,0.000032993034],"domain_scores_gemma":[0.99877185,0.00083705754,0.000079642836,0.00015562974,0.00011791177,0.00003797973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006829642,0.0010392284,0.0007570307,0.0008882424,0.0003059349,0.000946561,0.0018195108,0.0012661507,0.0026876223],"category_scores_gemma":[0.0035533328,0.0006415858,0.00093816826,0.0014790067,0.0007266748,0.0022936305,0.001014584,0.002430062,0.00095101085],"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.000037399313,0.000043247146,0.001379349,0.00009113233,0.000057758265,0.00005610362,0.00005318912,0.8502906,0.0010391409,0.040548448,0.0072455495,0.09915807],"study_design_scores_gemma":[0.0000020899888,0.0000040173372,0.00009539228,0.000006360828,0.0000043828295,0.00001143656,0.0000031744403,0.9674364,0.00022242514,0.031371325,0.0008399558,0.0000029467944],"about_ca_topic_score_codex":0.012829744,"about_ca_topic_score_gemma":0.024193022,"teacher_disagreement_score":0.012829744,"about_ca_system_score_codex":0.001840179,"about_ca_system_score_gemma":0.0008275495,"threshold_uncertainty_score":0.025510132},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021521675,0.0039591608,0.98693395,0.0011538853,0.00010941919,0.0002231913,0.0011525294,0.0023921889,0.0019235184],"genre_scores_gemma":[0.043677427,0.009787101,0.9396218,0.0006515037,0.00032224928,0.00039182726,0.003769041,0.0004625456,0.0013164137],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927927,0.0015215444,0.00089046964,0.0010329377,0.003441348,0.00032091347],"domain_scores_gemma":[0.9917585,0.003621379,0.00047906075,0.0025854816,0.0014271047,0.00012843453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042251367,0.0015538919,0.0017747056,0.00536889,0.0012798547,0.005981127,0.005632863,0.0018509587,0.004362927],"category_scores_gemma":[0.017763693,0.0012476381,0.0023652767,0.012704536,0.0016885985,0.011576479,0.004429375,0.0030641379,0.0025199915],"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.00023961466,0.00018149216,0.0017217156,0.002958516,0.00031487728,0.00024298854,0.0012069817,0.05793254,0.009144394,0.34209153,0.049683604,0.53428185],"study_design_scores_gemma":[0.00012020886,0.00012867167,0.00053589174,0.00034889768,0.0001491792,0.0008957183,0.0007465205,0.2899482,0.009001044,0.5924486,0.10558039,0.000096640746],"about_ca_topic_score_codex":0.0031782812,"about_ca_topic_score_gemma":0.004391304,"teacher_disagreement_score":0.005981127,"about_ca_system_score_codex":0.0017168827,"about_ca_system_score_gemma":0.0027111433,"threshold_uncertainty_score":0.022344887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9456779,0.00048383913,0.036128912,0.00031284586,0.00015193751,0.0001920551,0.00029548386,0.0035962232,0.013160795],"genre_scores_gemma":[0.9700761,0.00021886385,0.02760098,0.00007981635,0.000012715844,0.00006167306,0.00043725185,0.00021469676,0.0012978079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9979499,0.0006876137,0.00014773615,0.00028374037,0.0005427986,0.00038814478],"domain_scores_gemma":[0.9956227,0.0021418661,0.00027264282,0.00073467055,0.00064467534,0.00058343966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032450086,0.0009766923,0.00052698416,0.0008305593,0.00080009777,0.001664715,0.0015908442,0.000569771,0.0018250071],"category_scores_gemma":[0.0072995806,0.00022686247,0.00030313057,0.00084766065,0.00095875753,0.0022095123,0.0019602354,0.000947119,0.0003718905],"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.0046330877,0.0019096913,0.024356108,0.0010584474,0.00027282946,0.0006479279,0.0007980982,0.7307364,0.042953994,0.015614311,0.008689865,0.16832925],"study_design_scores_gemma":[0.00011502775,0.0015087351,0.005892179,0.00005734002,0.00006061109,0.00022407366,0.00077861553,0.9580768,0.027108729,0.002513524,0.0035934248,0.000070925365],"about_ca_topic_score_codex":0.0052564023,"about_ca_topic_score_gemma":0.005396369,"teacher_disagreement_score":0.0052564023,"about_ca_system_score_codex":0.0015162525,"about_ca_system_score_gemma":0.000989091,"threshold_uncertainty_score":0.017161489},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3222384,0.004099299,0.6285401,0.0036393085,0.00062021654,0.0002202167,0.0034953523,0.0021976994,0.034949332],"genre_scores_gemma":[0.9212818,0.0010671701,0.06582534,0.00027692737,0.0001272811,0.00028881253,0.0013793247,0.0004050681,0.0093481755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997899,0.00007477952,0.000009886277,0.00005065895,0.00003233773,0.000042547545],"domain_scores_gemma":[0.9974226,0.002077353,0.00013143368,0.000074170224,0.0001899589,0.00010450445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013956579,0.0011296812,0.001095655,0.00081899425,0.0006877423,0.0023565555,0.0017143356,0.0025912272,0.007937003],"category_scores_gemma":[0.004673324,0.0006342506,0.0020435972,0.00060575316,0.00096214603,0.0014037538,0.0009792327,0.0018915993,0.0007882508],"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.00002590697,0.000019217936,0.0016520002,0.000032259766,0.000018227027,0.0000385775,0.000027539716,0.9923717,0.00013899432,0.0026623856,0.00045569378,0.0025575114],"study_design_scores_gemma":[0.0000066044763,0.000005353755,0.00018091848,0.000010009689,0.000006472085,0.0000081245735,0.000013228789,0.9984126,0.000025835041,0.0009386277,0.0003882116,0.0000038972207],"about_ca_topic_score_codex":0.08865641,"about_ca_topic_score_gemma":0.047033474,"teacher_disagreement_score":0.08865641,"about_ca_system_score_codex":0.0013800103,"about_ca_system_score_gemma":0.0017018102,"threshold_uncertainty_score":0.1762808},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011567127,0.00051279645,0.9338514,0.00040383617,0.00010557929,0.00021563085,0.0022796355,0.049194742,0.0018691468],"genre_scores_gemma":[0.06400876,0.0002957257,0.9256461,0.00022098048,0.000047188587,0.00021871887,0.004546974,0.001939216,0.0030762241],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992072,0.00009418585,0.00007390519,0.00023613646,0.00030013642,0.00008849098],"domain_scores_gemma":[0.9987626,0.00039237458,0.00007758529,0.00038151396,0.0002766923,0.000109163695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006983445,0.0014919605,0.0013124595,0.0026813387,0.00105655,0.0025273883,0.0040699677,0.001102126,0.007825301],"category_scores_gemma":[0.0033238954,0.0011523283,0.002238541,0.00384706,0.0004997798,0.0029434452,0.0020318099,0.0018628574,0.0035121092],"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.00060743943,0.0004748355,0.006065844,0.0007796966,0.0004903165,0.00046349593,0.00033942895,0.07095297,0.022113694,0.024073951,0.09719057,0.7764478],"study_design_scores_gemma":[0.00012094945,0.00008104272,0.00097154296,0.000042524076,0.00007723334,0.00024301911,0.00011806005,0.9298173,0.0074367705,0.040060706,0.020995935,0.00003486595],"about_ca_topic_score_codex":0.012698234,"about_ca_topic_score_gemma":0.036070865,"teacher_disagreement_score":0.012698234,"about_ca_system_score_codex":0.00081874616,"about_ca_system_score_gemma":0.0019614357,"threshold_uncertainty_score":0.0261783},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023657106,0.00019271496,0.9602427,0.0002743651,0.00006106933,0.00006722356,0.0002440973,0.001750381,0.013510425],"genre_scores_gemma":[0.30563572,0.00037546313,0.67362183,0.00027265554,0.00009283726,0.00017065521,0.0014082312,0.0006649501,0.017757583],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958843,0.00006919127,0.000019200164,0.00009288371,0.00017381714,0.00005652108],"domain_scores_gemma":[0.99929273,0.000209472,0.000049816437,0.00032183563,0.00009005927,0.00003614389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033353973,0.00089741155,0.00060901407,0.0006227544,0.00035375095,0.0007236417,0.000995468,0.00055519096,0.0082236165],"category_scores_gemma":[0.0019126702,0.00043016675,0.00065056386,0.0006710092,0.0007515451,0.0017882533,0.0018417991,0.0014145762,0.0030265758],"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.00034886476,0.00012133056,0.0010937036,0.00032286017,0.0000735914,0.00035340182,0.00032005663,0.29815277,0.041811343,0.21029855,0.025673458,0.42143],"study_design_scores_gemma":[0.00003592332,0.000045944216,0.00020643008,0.000029002778,0.000019108758,0.0002257084,0.00006374849,0.8256359,0.015507794,0.14251734,0.015696675,0.000016395872],"about_ca_topic_score_codex":0.0007702355,"about_ca_topic_score_gemma":0.0016775132,"teacher_disagreement_score":0.0082236165,"about_ca_system_score_codex":0.00044668012,"about_ca_system_score_gemma":0.00052213744,"threshold_uncertainty_score":0.027510762},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048736385,0.1525407,0.66577977,0.11891862,0.0069260015,0.00046377405,0.0051656556,0.0074134246,0.037918407],"genre_scores_gemma":[0.08245387,0.17539732,0.6817009,0.023486003,0.012570184,0.00070892187,0.010366917,0.0023905633,0.010925347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933901,0.0026119228,0.0002968734,0.0012151678,0.002126935,0.00035899354],"domain_scores_gemma":[0.9470007,0.037106264,0.0007934028,0.0067096506,0.0065409252,0.0018490549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008150072,0.002454279,0.0031388095,0.0071502863,0.0013891722,0.00849444,0.0061319745,0.0049211676,0.020377524],"category_scores_gemma":[0.03356067,0.0012971739,0.003171891,0.008868039,0.0045065163,0.025280079,0.006420058,0.010349738,0.009524294],"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.0001727639,0.00028350102,0.0017086641,0.002404097,0.00024567795,0.00015308194,0.00038090342,0.013555537,0.0007621523,0.52482605,0.17305407,0.28245345],"study_design_scores_gemma":[0.000023983719,0.000054405904,0.00047977595,0.00044614155,0.000029562238,0.000101585465,0.00023563937,0.025758311,0.0002258258,0.80530286,0.16729821,0.000043664622],"about_ca_topic_score_codex":0.0055818255,"about_ca_topic_score_gemma":0.0039293296,"teacher_disagreement_score":0.020377524,"about_ca_system_score_codex":0.003148708,"about_ca_system_score_gemma":0.0035848524,"threshold_uncertainty_score":0.068169594},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03453922,0.0013460517,0.7483149,0.00084075896,0.00042943325,0.0005752716,0.00473387,0.20057999,0.008640471],"genre_scores_gemma":[0.17021865,0.00057844137,0.79673684,0.00044853063,0.00008958737,0.0006699946,0.017725358,0.008500356,0.0050322064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990451,0.00013155224,0.00006784372,0.00029268366,0.00036880243,0.00009395528],"domain_scores_gemma":[0.99746644,0.0007032862,0.00013605147,0.0010104183,0.00042267793,0.00026116584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010431956,0.0021654323,0.0009335494,0.0018565942,0.0012049588,0.002099722,0.004115294,0.0011168518,0.0091362195],"category_scores_gemma":[0.005790655,0.0011061508,0.0013273471,0.0023294075,0.00078754063,0.003984512,0.0031799434,0.0023094874,0.0035196904],"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.0014076408,0.00072190724,0.004611598,0.0013564584,0.00052030757,0.00047991754,0.0010014429,0.14299291,0.042845577,0.030369049,0.24087282,0.5328204],"study_design_scores_gemma":[0.0004622455,0.00015505937,0.0013753276,0.00004504548,0.00005652254,0.00022793705,0.00025470473,0.9152912,0.018148351,0.027857568,0.036058865,0.00006714407],"about_ca_topic_score_codex":0.010100594,"about_ca_topic_score_gemma":0.019944701,"teacher_disagreement_score":0.010100594,"about_ca_system_score_codex":0.0013104441,"about_ca_system_score_gemma":0.0021019452,"threshold_uncertainty_score":0.030563712},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8935978,0.0045379396,0.068616904,0.0013678655,0.00093742274,0.0002964783,0.0022544526,0.017253002,0.011138149],"genre_scores_gemma":[0.8946356,0.0010360088,0.09365695,0.00055138924,0.00007195051,0.00013654213,0.005676776,0.001057773,0.003176962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992907,0.00015727675,0.000059890768,0.00022196313,0.00013336669,0.0001367483],"domain_scores_gemma":[0.99640924,0.0019824768,0.00022491501,0.00077280897,0.00044011534,0.00017038886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012439573,0.0015207531,0.00069795526,0.00084330735,0.0005502077,0.00068782596,0.0017889513,0.0010952151,0.0033008626],"category_scores_gemma":[0.008673406,0.000460078,0.0006317204,0.0009800018,0.00057836535,0.0027643105,0.00074320444,0.001660815,0.001146267],"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.002327074,0.0014831186,0.011209928,0.0014676511,0.0003002814,0.00042342828,0.00026723606,0.51455504,0.022043088,0.0031712104,0.030213507,0.41253847],"study_design_scores_gemma":[0.00013805515,0.0006147325,0.0024953636,0.00005625209,0.000079821824,0.00010927791,0.00013756072,0.9662321,0.022618959,0.0032360025,0.004255134,0.000026623986],"about_ca_topic_score_codex":0.011123602,"about_ca_topic_score_gemma":0.019799577,"teacher_disagreement_score":0.011123602,"about_ca_system_score_codex":0.0009887872,"about_ca_system_score_gemma":0.0010194412,"threshold_uncertainty_score":0.022117674},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21289134,0.001406735,0.7139905,0.0010579824,0.00049942394,0.0001852215,0.0023221825,0.03988143,0.027765175],"genre_scores_gemma":[0.41447097,0.00039860257,0.57367724,0.0003117766,0.0000511414,0.0001508204,0.0035827288,0.0012651524,0.006091511],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996742,0.000053127234,0.00001917034,0.00006928629,0.00013336826,0.000050886752],"domain_scores_gemma":[0.9993962,0.00014589075,0.000033826072,0.0001989444,0.00018373187,0.00004141336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026145467,0.00071244093,0.00059039495,0.0007169938,0.00050804974,0.0011261936,0.0016184179,0.0006092036,0.0063623255],"category_scores_gemma":[0.0016283147,0.0003395767,0.0007425893,0.0013425071,0.00031352168,0.0011587098,0.000884525,0.0009982554,0.0016256155],"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.00089754286,0.00034111246,0.0051542586,0.0006559057,0.00027136423,0.0004961293,0.00048593225,0.38867867,0.08278879,0.02819653,0.06601975,0.42601407],"study_design_scores_gemma":[0.00008288384,0.000060617367,0.0010812498,0.000014922925,0.000013681345,0.00008720448,0.0000664535,0.96882194,0.010699644,0.0068448135,0.012211565,0.000015040985],"about_ca_topic_score_codex":0.013922234,"about_ca_topic_score_gemma":0.025739944,"teacher_disagreement_score":0.013922234,"about_ca_system_score_codex":0.0009333467,"about_ca_system_score_gemma":0.0010333187,"threshold_uncertainty_score":0.027682424},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.875041,0.0009440397,0.11841091,0.0003737713,0.00007776453,0.00016157718,0.0005283597,0.0012258247,0.0032366945],"genre_scores_gemma":[0.8694176,0.00047540208,0.1270707,0.000071319766,0.000044925247,0.00012429719,0.0016900927,0.0004248151,0.00068093656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733835,0.00081715605,0.00016838309,0.00064727094,0.00079523114,0.00023364573],"domain_scores_gemma":[0.9443864,0.042704217,0.0031130572,0.005509657,0.0034764367,0.0008101758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036711013,0.00090495485,0.0006674945,0.0016058426,0.0008306998,0.0012399968,0.001147918,0.0008181093,0.0012392688],"category_scores_gemma":[0.04799489,0.0004581515,0.0006489151,0.0021006803,0.00086484186,0.0044851922,0.0010263182,0.0011895745,0.00040896275],"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.0012390761,0.0006128183,0.02517424,0.00039539064,0.00020105546,0.00016795193,0.0001987783,0.8153258,0.01664947,0.006186443,0.0023329216,0.1315161],"study_design_scores_gemma":[0.00006889082,0.0005237192,0.005081997,0.000018063169,0.00007029258,0.00013760076,0.00011416536,0.9702313,0.014146604,0.008473021,0.001115045,0.000019378584],"about_ca_topic_score_codex":0.002838041,"about_ca_topic_score_gemma":0.0059373,"teacher_disagreement_score":0.0036711013,"about_ca_system_score_codex":0.0013197599,"about_ca_system_score_gemma":0.0016744433,"threshold_uncertainty_score":0.019414842},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042619232,0.0009352841,0.9159578,0.00091755623,0.00021333607,0.00048064112,0.0028138151,0.023278715,0.01278361],"genre_scores_gemma":[0.23499116,0.0003526606,0.7482731,0.00039945947,0.00008340839,0.00059951784,0.0075921183,0.0018294099,0.0058792466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992908,0.0001348432,0.000036450136,0.00019980162,0.00019574269,0.000142288],"domain_scores_gemma":[0.99859935,0.0008179424,0.0000926566,0.00021452215,0.000198605,0.000077056626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008355933,0.00142987,0.0011983264,0.0018352153,0.00091381493,0.0015826366,0.002587733,0.0014263714,0.0163229],"category_scores_gemma":[0.00443419,0.0007271916,0.0017857994,0.0021002765,0.00077083294,0.0025355888,0.0024425013,0.0017191916,0.002406888],"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.00033424734,0.00036760583,0.0033222665,0.001068945,0.00013505496,0.00038588225,0.00027135285,0.48957545,0.004987954,0.04791248,0.05561012,0.3960287],"study_design_scores_gemma":[0.00015636516,0.00005953438,0.0002766174,0.000035884368,0.000021584596,0.00008076201,0.00007807726,0.9692496,0.0016216254,0.023431474,0.0049738945,0.000014572285],"about_ca_topic_score_codex":0.008451371,"about_ca_topic_score_gemma":0.016445454,"teacher_disagreement_score":0.0163229,"about_ca_system_score_codex":0.0012456758,"about_ca_system_score_gemma":0.0035927095,"threshold_uncertainty_score":0.054605603},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05425598,0.00040038826,0.9395542,0.0005302823,0.00003258862,0.000049862327,0.00009629087,0.00014005108,0.004940256],"genre_scores_gemma":[0.6886499,0.00079828524,0.29985628,0.00025700845,0.00023108328,0.00025487394,0.00026878933,0.00019327625,0.009490524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921155,0.0003363273,0.000026805248,0.00015291279,0.00019001741,0.00008239049],"domain_scores_gemma":[0.9967462,0.0020930485,0.00027231814,0.0002434697,0.00040649378,0.00023842178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010401148,0.00055063656,0.0008753906,0.0024432566,0.00095306494,0.0017514945,0.001064847,0.0011026574,0.0048878845],"category_scores_gemma":[0.0060768593,0.0006543339,0.0006409795,0.001646567,0.0016789641,0.0026266037,0.0019235179,0.0013983406,0.00055213727],"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.00009672592,0.000066661465,0.0011752077,0.00018319259,0.000070064045,0.00023343394,0.00054597505,0.17129718,0.0046716137,0.79183227,0.0028484205,0.026979236],"study_design_scores_gemma":[0.000013470111,0.000016322698,0.00030205847,0.000023369546,0.00000977074,0.00007838212,0.00012565136,0.4865157,0.0007543085,0.5107038,0.0014448026,0.000012295757],"about_ca_topic_score_codex":0.0017437745,"about_ca_topic_score_gemma":0.0015721635,"teacher_disagreement_score":0.0048878845,"about_ca_system_score_codex":0.0012291811,"about_ca_system_score_gemma":0.00061834673,"threshold_uncertainty_score":0.01635158},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060615353,0.00043979267,0.92625225,0.0002864333,0.00014010433,0.00004801915,0.00003295461,0.00044452044,0.011740635],"genre_scores_gemma":[0.7257719,0.00029035244,0.26844776,0.000192653,0.000089440524,0.00013836789,0.000069305555,0.00019353065,0.004806673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998361,0.00005799401,0.0000069268594,0.00003181257,0.00004651283,0.00002069071],"domain_scores_gemma":[0.9996972,0.0001486696,0.000028280156,0.00006256362,0.000034986067,0.00002830633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041594595,0.0004531704,0.00073981436,0.0002525691,0.0004463075,0.0006758367,0.0009644447,0.00066186645,0.002203592],"category_scores_gemma":[0.0012306559,0.00024837002,0.0005315613,0.00036058234,0.00076573767,0.00092637195,0.00096666766,0.00087945873,0.00028550785],"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.00012579167,0.00009598765,0.00060023495,0.00009505102,0.00006676115,0.000082815444,0.00006681013,0.8707563,0.010715286,0.08471038,0.001577733,0.031106882],"study_design_scores_gemma":[0.0000098708615,0.000013286674,0.00002784596,0.0000018050678,0.0000038956723,0.00000901286,0.0000023047594,0.98870826,0.000708703,0.010117194,0.0003953554,0.0000024790943],"about_ca_topic_score_codex":0.0009532061,"about_ca_topic_score_gemma":0.0010607945,"teacher_disagreement_score":0.002203592,"about_ca_system_score_codex":0.00050266145,"about_ca_system_score_gemma":0.00042504948,"threshold_uncertainty_score":0.0073717237},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058954605,0.00035031256,0.9859979,0.00030511725,0.000079988466,0.00014964062,0.00050730736,0.0050128596,0.0017015047],"genre_scores_gemma":[0.11333547,0.00051996694,0.87387234,0.00024539154,0.00016804582,0.00043870145,0.0046318457,0.0011988021,0.0055893906],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947314,0.001106321,0.0003865367,0.0019803706,0.0011977204,0.0005976344],"domain_scores_gemma":[0.99114555,0.0033080333,0.000893324,0.0032890127,0.0010099796,0.00035403506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024499658,0.0025245873,0.0027794575,0.0033831915,0.0019886722,0.0039332043,0.005529637,0.0025951331,0.01117743],"category_scores_gemma":[0.0150250625,0.0013825465,0.002504079,0.0066819265,0.001405124,0.008886185,0.0064256457,0.0046699718,0.0070985523],"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.0005371292,0.00046179208,0.0018111513,0.0007035229,0.00020301281,0.0002378103,0.00051577605,0.19332634,0.006560741,0.091026545,0.0264811,0.67813504],"study_design_scores_gemma":[0.0001395695,0.0000948977,0.00041209257,0.000043753364,0.000067279325,0.00020170012,0.00024833824,0.7681945,0.005677114,0.2146446,0.010229603,0.00004651795],"about_ca_topic_score_codex":0.004093595,"about_ca_topic_score_gemma":0.005420834,"teacher_disagreement_score":0.01117743,"about_ca_system_score_codex":0.002797364,"about_ca_system_score_gemma":0.004870871,"threshold_uncertainty_score":0.0373922},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074486196,0.000796778,0.89478344,0.00058552553,0.00037370296,0.00020873135,0.00046408683,0.007793788,0.020507779],"genre_scores_gemma":[0.8471102,0.00041843407,0.14370367,0.00032495148,0.000057203924,0.00015546214,0.0013090733,0.0002002794,0.006720774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998286,0.000024249579,0.000011259219,0.000039624447,0.000060459486,0.000035836092],"domain_scores_gemma":[0.9998073,0.00003481806,0.000013636119,0.000035016626,0.0000827536,0.00002658625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002340905,0.00036109384,0.00023247482,0.00043544456,0.0004068311,0.00059094833,0.0012066334,0.000278341,0.0033465105],"category_scores_gemma":[0.0006097273,0.0001219182,0.00020311667,0.0004628656,0.0003214972,0.0013152123,0.0009276037,0.00053056085,0.00068703253],"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.001141419,0.000463618,0.0036176972,0.00032927273,0.000118911485,0.00049829634,0.00034603977,0.15681423,0.06682154,0.072208464,0.06975338,0.6278872],"study_design_scores_gemma":[0.000035990353,0.00012792244,0.0005077494,0.000014473017,0.00003240715,0.00012478883,0.00007594435,0.9457109,0.015889416,0.017648239,0.019802263,0.00002994646],"about_ca_topic_score_codex":0.0043405765,"about_ca_topic_score_gemma":0.00855126,"teacher_disagreement_score":0.0043405765,"about_ca_system_score_codex":0.00061730476,"about_ca_system_score_gemma":0.00086293294,"threshold_uncertainty_score":0.011195183},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06429873,0.00029230132,0.9284319,0.00040212006,0.000037006226,0.00005250078,0.0001488292,0.0008110411,0.0055255033],"genre_scores_gemma":[0.8297811,0.0005383058,0.1599444,0.00035817438,0.00021266105,0.00026224248,0.0005565583,0.00046850558,0.0078780865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817264,0.00045069552,0.00005076334,0.00055322284,0.0004940892,0.0002785266],"domain_scores_gemma":[0.9912149,0.0042239362,0.0010031068,0.0022060934,0.00080338446,0.0005485748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021185684,0.0008281451,0.0013709057,0.0027281607,0.0011657425,0.0014531222,0.0028571996,0.0016704052,0.0057662195],"category_scores_gemma":[0.017303176,0.0007734277,0.0015781793,0.0017005298,0.0026865131,0.0061120307,0.0031545146,0.0026563345,0.0009592862],"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.00017186067,0.00011856163,0.0027799297,0.00017470698,0.00009153837,0.00030944656,0.0004322763,0.23777847,0.007284858,0.71313703,0.004139692,0.03358162],"study_design_scores_gemma":[0.0000125634315,0.0000441906,0.00049628544,0.00001074924,0.000017771006,0.00010285829,0.00004277581,0.6596676,0.0016550457,0.33599007,0.0019368284,0.00002319443],"about_ca_topic_score_codex":0.0021651655,"about_ca_topic_score_gemma":0.0019296774,"teacher_disagreement_score":0.0057662195,"about_ca_system_score_codex":0.0022263592,"about_ca_system_score_gemma":0.0011386946,"threshold_uncertainty_score":0.01928991},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020035908,0.000076130484,0.97600913,0.000068163565,0.000014376238,0.000060634546,0.00019943649,0.0027434772,0.0007927261],"genre_scores_gemma":[0.21092309,0.00015951386,0.78481615,0.000104180246,0.00002037665,0.00016888979,0.001443311,0.0006817205,0.0016827614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948454,0.0000651815,0.000024431221,0.00018514054,0.00016990713,0.00007075013],"domain_scores_gemma":[0.99946743,0.00019784676,0.00007334216,0.00008829036,0.00013794753,0.00003509303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047640438,0.001465154,0.001110988,0.0019439491,0.00055815745,0.0012560335,0.0013392791,0.0012353255,0.0019082769],"category_scores_gemma":[0.0013721903,0.00073591294,0.0015970552,0.0015017556,0.0007497947,0.0012812585,0.0010067842,0.0012313366,0.001031422],"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.000075381635,0.000053881875,0.0013045745,0.00010503148,0.00005791198,0.000080774415,0.00014525412,0.78658295,0.016049786,0.0036498064,0.0026259953,0.18926868],"study_design_scores_gemma":[0.0000034984525,0.000008840047,0.00022200796,0.0000039266547,0.0000042333213,0.000014573772,0.000024449992,0.99568605,0.0018578742,0.0017311339,0.000438359,0.00000510195],"about_ca_topic_score_codex":0.020786691,"about_ca_topic_score_gemma":0.033720817,"teacher_disagreement_score":0.020786691,"about_ca_system_score_codex":0.0011408508,"about_ca_system_score_gemma":0.0016955289,"threshold_uncertainty_score":0.04133141},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029519998,0.0005246323,0.9662483,0.00048034985,0.000037956208,0.00005229132,0.00049204315,0.0010790441,0.0015653003],"genre_scores_gemma":[0.79225856,0.0005949375,0.19820045,0.00042330977,0.00009323083,0.00024248402,0.0018142872,0.0002117617,0.006161025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999215,0.00021527597,0.000041911353,0.0002939156,0.00014977105,0.00008409274],"domain_scores_gemma":[0.9975904,0.0014091998,0.00030112526,0.0002743513,0.00035063038,0.0000743695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011803748,0.0009009633,0.0014714313,0.0012702171,0.00032159808,0.0010400787,0.00299005,0.002099799,0.002185855],"category_scores_gemma":[0.0072772414,0.00053336535,0.0007877789,0.0017755893,0.0009845213,0.003812438,0.0011675117,0.0018501335,0.0006289449],"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.00009127357,0.00003512355,0.0003690043,0.00008144405,0.000029963621,0.000061313076,0.00004373098,0.94794005,0.0009542897,0.010483111,0.0014722114,0.038438432],"study_design_scores_gemma":[0.0000026495961,0.0000059831555,0.000029262772,0.0000020001612,0.0000023628331,0.0000060775096,0.0000033260458,0.99289316,0.00012216927,0.0068430705,0.00008792124,0.0000018750198],"about_ca_topic_score_codex":0.010244955,"about_ca_topic_score_gemma":0.008425625,"teacher_disagreement_score":0.010244955,"about_ca_system_score_codex":0.0017951388,"about_ca_system_score_gemma":0.0010713526,"threshold_uncertainty_score":0.020370662},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41245568,0.001299059,0.54481006,0.0017830372,0.00053347176,0.00031782742,0.0020915985,0.003005503,0.033703763],"genre_scores_gemma":[0.69198173,0.00043977622,0.29003203,0.000597364,0.00012147493,0.00028266563,0.0025755994,0.0008971607,0.013072188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905103,0.00030335883,0.00003903752,0.00017080901,0.00020712208,0.00022860302],"domain_scores_gemma":[0.9966298,0.0015842061,0.00015353413,0.00090204977,0.00037039875,0.00036001025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010675401,0.0014719532,0.0022745088,0.00135545,0.0013042948,0.002344563,0.0029610065,0.0016929545,0.017789727],"category_scores_gemma":[0.007941127,0.00073648954,0.0008862422,0.0021148971,0.001084419,0.003980277,0.0024286509,0.0020271142,0.0026319982],"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.0034160973,0.0007040043,0.0027177047,0.00053251017,0.00016766119,0.00039437728,0.00050451583,0.72071826,0.014485702,0.06560266,0.038697764,0.1520587],"study_design_scores_gemma":[0.0001211803,0.00015908993,0.00033810656,0.000035495934,0.000027178845,0.00013849179,0.00019676071,0.9492885,0.0023670748,0.044905644,0.0024041445,0.000018423794],"about_ca_topic_score_codex":0.0042824093,"about_ca_topic_score_gemma":0.0073303767,"teacher_disagreement_score":0.017789727,"about_ca_system_score_codex":0.0016306232,"about_ca_system_score_gemma":0.0017991276,"threshold_uncertainty_score":0.059512556},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049430836,0.005306741,0.93952864,0.0010763137,0.00007672143,0.00012250103,0.00073599775,0.0011479032,0.0025743558],"genre_scores_gemma":[0.374308,0.0034815473,0.61642236,0.00041047324,0.00026593226,0.00012619367,0.0029621976,0.00041790341,0.0016053498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928308,0.0023191164,0.00035602102,0.0016686297,0.00224763,0.0005777375],"domain_scores_gemma":[0.9802712,0.01187954,0.0013219985,0.0043724817,0.0015594236,0.0005952858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007226887,0.0013427953,0.0030603497,0.0060115173,0.0014232851,0.0044362033,0.0035344535,0.0020352043,0.0024056723],"category_scores_gemma":[0.030223886,0.000913986,0.0019680387,0.0063355854,0.002042448,0.011052832,0.004302676,0.0024707867,0.00057679944],"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.00048325886,0.00063098903,0.017227981,0.001474205,0.0006034713,0.00036465112,0.00096811884,0.46138957,0.012488763,0.23020929,0.012820217,0.26133943],"study_design_scores_gemma":[0.000021961863,0.00006602425,0.0012190549,0.000046710633,0.000092736744,0.00025407432,0.00015500978,0.900622,0.0028892206,0.08992828,0.0046855505,0.00001933171],"about_ca_topic_score_codex":0.005197784,"about_ca_topic_score_gemma":0.009713241,"teacher_disagreement_score":0.007226887,"about_ca_system_score_codex":0.0030155012,"about_ca_system_score_gemma":0.0037645285,"threshold_uncertainty_score":0.03821987},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019299842,0.00033189633,0.9684415,0.00039210616,0.00013104259,0.0002229926,0.00052142143,0.0052712075,0.005387903],"genre_scores_gemma":[0.13585854,0.00015178154,0.8552765,0.00023783586,0.00010976144,0.00039118194,0.001612988,0.00062449416,0.0057368926],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785006,0.00031818205,0.0001513171,0.0006304374,0.0007290445,0.0003209251],"domain_scores_gemma":[0.99647444,0.0010182154,0.00029868766,0.0013398348,0.0006638947,0.00020497144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010415919,0.0016559496,0.0016167706,0.0026663179,0.0012780591,0.0025373467,0.003604642,0.0013275968,0.012030361],"category_scores_gemma":[0.006146848,0.0008749006,0.0012913259,0.0038299721,0.0009519055,0.006178799,0.0034489988,0.0017395514,0.0042522866],"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.00074000226,0.0003360304,0.0020272795,0.0004003229,0.00013257592,0.00026907437,0.00058533635,0.13954385,0.02373864,0.08544931,0.02562875,0.72114885],"study_design_scores_gemma":[0.00013627757,0.00014630811,0.00037742197,0.000028667262,0.000029315417,0.00017913262,0.00009432121,0.8876814,0.005403137,0.096789904,0.009089132,0.000045027173],"about_ca_topic_score_codex":0.009977807,"about_ca_topic_score_gemma":0.013613483,"teacher_disagreement_score":0.012030361,"about_ca_system_score_codex":0.0019007871,"about_ca_system_score_gemma":0.0026337425,"threshold_uncertainty_score":0.040245593},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02847587,0.00052159274,0.9637913,0.0004461709,0.000047734422,0.00033511565,0.00033085738,0.0036543172,0.0023971095],"genre_scores_gemma":[0.15925963,0.00024112882,0.8357441,0.00024805786,0.000055133674,0.00027044502,0.0015203968,0.00050613115,0.0021550008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971667,0.0007294914,0.00016255838,0.0006636289,0.0009005046,0.00037716277],"domain_scores_gemma":[0.99399537,0.002968369,0.0005198902,0.0016609917,0.00061481143,0.00024052127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002120654,0.0015707241,0.0019573597,0.0035475094,0.0013790808,0.0016705755,0.004199226,0.0021680787,0.0032560101],"category_scores_gemma":[0.010186351,0.0010042053,0.0021187004,0.0040586977,0.0016645081,0.0039102854,0.0033354373,0.001960062,0.0012997808],"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.00096120464,0.0008866323,0.004590924,0.0008047934,0.00036287008,0.00076384534,0.0010293091,0.4489129,0.03341317,0.049242273,0.017605608,0.4414265],"study_design_scores_gemma":[0.00011269762,0.00014650862,0.00049024145,0.000047448128,0.00008621269,0.0002889663,0.00014965933,0.95206064,0.006815512,0.036477033,0.0032935247,0.000031516094],"about_ca_topic_score_codex":0.0075197527,"about_ca_topic_score_gemma":0.0145814195,"teacher_disagreement_score":0.0075197527,"about_ca_system_score_codex":0.0015901959,"about_ca_system_score_gemma":0.0038750798,"threshold_uncertainty_score":0.014951944},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01283644,0.032425556,0.5683978,0.12423921,0.10453021,0.0014978191,0.012593195,0.0115096895,0.13197006],"genre_scores_gemma":[0.057556704,0.03474815,0.30022016,0.016248545,0.025176251,0.0016219564,0.057347666,0.012060526,0.49501994],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99104357,0.0039346726,0.00055625505,0.0012847849,0.0025726971,0.0006080988],"domain_scores_gemma":[0.98157996,0.006450792,0.00035505128,0.002601971,0.0050440882,0.0039681504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015427109,0.0014605492,0.0015534785,0.0025879634,0.0018282343,0.009235677,0.0034458307,0.0024888844,0.058558833],"category_scores_gemma":[0.019363755,0.0008778827,0.0016283992,0.0032302085,0.0015020139,0.010746055,0.0055207233,0.00550884,0.027035547],"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.00015976571,0.00016846819,0.00029804418,0.00032829508,0.000036987334,0.00011133783,0.00038788136,0.0011772932,0.0009713453,0.014088248,0.8408648,0.14140756],"study_design_scores_gemma":[0.000023994206,0.000044679105,0.00036381322,0.00017060088,0.000015702459,0.00010216075,0.0002669208,0.0029386473,0.00081308646,0.011749838,0.9834858,0.000024646632],"about_ca_topic_score_codex":0.0048433314,"about_ca_topic_score_gemma":0.009366976,"teacher_disagreement_score":0.058558833,"about_ca_system_score_codex":0.0035463702,"about_ca_system_score_gemma":0.0048287706,"threshold_uncertainty_score":0.19589883},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7463667,0.0014962791,0.1699715,0.003166587,0.00026864777,0.0002692093,0.0034630478,0.0015746418,0.07342338],"genre_scores_gemma":[0.9600589,0.0010841641,0.0142294355,0.00028841192,0.00016460539,0.00025771768,0.0018460307,0.000401114,0.021669537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990061,0.00027101798,0.000042273226,0.00019070916,0.00021141817,0.0002785346],"domain_scores_gemma":[0.9865296,0.007801731,0.0012382846,0.0013897939,0.0014833604,0.0015572868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002068546,0.0009433509,0.00088918826,0.0027386553,0.0022212742,0.002304544,0.0024049124,0.0012427742,0.012107729],"category_scores_gemma":[0.017758276,0.0005084157,0.00065609516,0.0013020458,0.001899605,0.0039311107,0.0016235164,0.001532374,0.0017579844],"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.0009035633,0.00019603895,0.010939598,0.00042456464,0.0001247895,0.0005230084,0.0014663392,0.183334,0.007949606,0.68637097,0.038226474,0.069541],"study_design_scores_gemma":[0.00007856841,0.00022707028,0.003609688,0.00012086853,0.00009679539,0.0006781232,0.00082739064,0.58527756,0.00896658,0.3810637,0.018987041,0.00006662942],"about_ca_topic_score_codex":0.003026855,"about_ca_topic_score_gemma":0.0019894398,"teacher_disagreement_score":0.012107729,"about_ca_system_score_codex":0.00230802,"about_ca_system_score_gemma":0.0009164538,"threshold_uncertainty_score":0.040504396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28975987,0.0006041178,0.66269827,0.0013236633,0.00044413083,0.0003981406,0.00017767497,0.0036232679,0.04097095],"genre_scores_gemma":[0.7318702,0.00009827109,0.2615941,0.0003744679,0.00006701724,0.00026508787,0.00023011935,0.00038086617,0.0051199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986141,0.00060500385,0.000039428403,0.00018463774,0.00031589883,0.00024093957],"domain_scores_gemma":[0.99758077,0.0014971503,0.000081785605,0.00038853832,0.00031597822,0.0001357679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017243491,0.0007451043,0.0017909877,0.00084812153,0.001147319,0.0011630036,0.0025456038,0.00161668,0.008611028],"category_scores_gemma":[0.0044354745,0.00067935296,0.0010110788,0.0012376385,0.0009257875,0.0016084802,0.0016580502,0.001419781,0.00094052573],"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.00049343746,0.00050963304,0.0011939838,0.0001474721,0.000115225404,0.0000929539,0.00016461105,0.8608679,0.0073272567,0.023473399,0.0038794747,0.101734586],"study_design_scores_gemma":[0.000030331523,0.000046849844,0.00010771574,0.0000030903946,0.000012430772,0.000009912972,0.000021321648,0.9949936,0.0006587358,0.003622686,0.00048954,0.0000037414286],"about_ca_topic_score_codex":0.0059790886,"about_ca_topic_score_gemma":0.010754398,"teacher_disagreement_score":0.008611028,"about_ca_system_score_codex":0.0014277379,"about_ca_system_score_gemma":0.0020554194,"threshold_uncertainty_score":0.028806746},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010670344,0.0003634866,0.98588437,0.0006595709,0.00004015462,0.000109552035,0.00017358272,0.00020100205,0.0018980042],"genre_scores_gemma":[0.34191492,0.0011089348,0.64773947,0.00095468323,0.000439857,0.00088442344,0.001448629,0.00038719637,0.005121839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99461234,0.0029918419,0.00018375916,0.0010701183,0.0008405813,0.00030129557],"domain_scores_gemma":[0.9702286,0.024134096,0.0016246386,0.0024170068,0.0010394355,0.00055625144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008084517,0.001882228,0.0033495766,0.0034632012,0.0020080025,0.0021793593,0.005000538,0.0043693716,0.005228998],"category_scores_gemma":[0.050046388,0.0011454239,0.0019125566,0.005401313,0.0050282707,0.008235175,0.005285537,0.004141411,0.0012962858],"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.00025648437,0.00020649527,0.0015547924,0.00027601936,0.00013675292,0.00022652265,0.00026297645,0.39505515,0.0013055148,0.5285511,0.0071820784,0.064986154],"study_design_scores_gemma":[0.00003653034,0.000041944917,0.00016577929,0.000029803765,0.00001458523,0.00006753983,0.000029083085,0.6054608,0.0004183444,0.39267004,0.001046483,0.000018986804],"about_ca_topic_score_codex":0.0034034553,"about_ca_topic_score_gemma":0.0028743478,"teacher_disagreement_score":0.008084517,"about_ca_system_score_codex":0.0027017584,"about_ca_system_score_gemma":0.0030475003,"threshold_uncertainty_score":0.042755544},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013045592,0.026949916,0.9276145,0.021037143,0.0016844522,0.0002430316,0.00067963416,0.0009549171,0.019531906],"genre_scores_gemma":[0.04304901,0.05722025,0.86497295,0.008902432,0.004295376,0.0008048636,0.0015693209,0.0009909847,0.018194793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9895075,0.0043422636,0.0013490277,0.001302235,0.0029369693,0.0005621777],"domain_scores_gemma":[0.99277824,0.0038062248,0.00036588623,0.0011208296,0.0014879334,0.0004408874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01099154,0.0018822504,0.00169483,0.0052507883,0.0032329068,0.018741008,0.0048893294,0.004836864,0.006031438],"category_scores_gemma":[0.016877811,0.0020153038,0.0026880188,0.0071163797,0.00783573,0.03827293,0.0062046926,0.011546339,0.0033482446],"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.00002052702,0.000016739772,0.00008105937,0.00023400411,0.000012381378,0.00013097828,0.0007168479,0.00169591,0.00044327392,0.96312743,0.015215783,0.018305017],"study_design_scores_gemma":[0.000016997614,0.00003881027,0.00009074186,0.00039531488,0.00002741509,0.00051290647,0.00062679447,0.018450623,0.0009481335,0.5696196,0.40921536,0.000057360652],"about_ca_topic_score_codex":0.007211908,"about_ca_topic_score_gemma":0.004004781,"teacher_disagreement_score":0.018741008,"about_ca_system_score_codex":0.0051346347,"about_ca_system_score_gemma":0.004046928,"threshold_uncertainty_score":0.05812955},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.605959,0.0034737147,0.36106515,0.0008971165,0.00020431395,0.00037485504,0.00075317716,0.0205192,0.006753458],"genre_scores_gemma":[0.8870694,0.00029870967,0.10940731,0.00019304383,0.000030274006,0.00010365016,0.00081473385,0.00034171218,0.001741213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989453,0.00024957737,0.00008244689,0.00017517524,0.00035694367,0.00019061264],"domain_scores_gemma":[0.995799,0.001083632,0.00034645037,0.0014218491,0.0011179333,0.00023126623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010312446,0.0005869676,0.00069608865,0.0012909048,0.0011935299,0.0010109195,0.0019419814,0.0006433118,0.0010523599],"category_scores_gemma":[0.0057125767,0.00030407534,0.00038789745,0.0019626056,0.00076169334,0.0018135158,0.00076524017,0.00064301543,0.00037558877],"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.0019163396,0.0010235235,0.030714758,0.0005570562,0.00021874915,0.0005171202,0.00088345906,0.3152662,0.112830244,0.020526072,0.03916757,0.47637898],"study_design_scores_gemma":[0.00014272702,0.00044041532,0.0028711662,0.000025487765,0.00008929006,0.0003987653,0.00029179355,0.94062823,0.036754433,0.008833843,0.009476427,0.000047405312],"about_ca_topic_score_codex":0.011475162,"about_ca_topic_score_gemma":0.025860716,"teacher_disagreement_score":0.011475162,"about_ca_system_score_codex":0.0018718855,"about_ca_system_score_gemma":0.0032958263,"threshold_uncertainty_score":0.022816777},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053276926,0.0014339159,0.7706548,0.00052614306,0.00031694045,0.000777078,0.0031691235,0.15859728,0.011247756],"genre_scores_gemma":[0.2676563,0.0005961309,0.7103581,0.0005919929,0.00012384054,0.00075302506,0.008035665,0.0047465144,0.007138384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831784,0.00020336217,0.00020006503,0.00028979217,0.0008576397,0.00013131401],"domain_scores_gemma":[0.9979875,0.00041020077,0.0001640073,0.0007511929,0.0005390656,0.0001479827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016820993,0.0010189931,0.0007485824,0.0012945574,0.0007281184,0.0026590354,0.0037467817,0.00071649964,0.0049714404],"category_scores_gemma":[0.005775984,0.0006699076,0.000581257,0.0017862746,0.0008047378,0.0044999453,0.002781831,0.0013153151,0.001728324],"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.0023814132,0.0007458909,0.009116405,0.0012570516,0.0003588266,0.0002970961,0.00089104316,0.055569995,0.08858375,0.067277364,0.14374311,0.62977815],"study_design_scores_gemma":[0.00057351287,0.0010100851,0.0025549536,0.0000745843,0.00010176058,0.000435163,0.00026988453,0.78613734,0.08360367,0.03267367,0.09236603,0.00019937231],"about_ca_topic_score_codex":0.0068057007,"about_ca_topic_score_gemma":0.008323879,"teacher_disagreement_score":0.0068057007,"about_ca_system_score_codex":0.0012710007,"about_ca_system_score_gemma":0.0018132405,"threshold_uncertainty_score":0.016631126},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5050397,0.0014558809,0.472182,0.0011221486,0.00009980549,0.00032408122,0.00041638996,0.013500871,0.0058591235],"genre_scores_gemma":[0.8541811,0.00017883112,0.14370163,0.00023113747,0.000028833512,0.00010473051,0.00037407866,0.00032216738,0.00087740395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674916,0.0009958649,0.00023012921,0.0007840532,0.00083057384,0.00041024774],"domain_scores_gemma":[0.996409,0.001333902,0.00032660022,0.0012765203,0.00046582578,0.000188106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030248268,0.00088881596,0.0009470288,0.0008402522,0.001020232,0.002106989,0.0029002123,0.0009856339,0.0011412557],"category_scores_gemma":[0.008354736,0.00061961095,0.0005976301,0.0016720297,0.001305049,0.0038712863,0.0022225694,0.0012299371,0.00040450387],"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.00077930006,0.0004691369,0.005980574,0.00027338768,0.00013039605,0.00024644355,0.0005689008,0.7995254,0.032873668,0.021855006,0.00803037,0.12926747],"study_design_scores_gemma":[0.000057911482,0.000117669515,0.0008444988,0.0000069432863,0.000021608057,0.000059038703,0.00012010322,0.9751037,0.007334762,0.014725793,0.0015878774,0.000020184285],"about_ca_topic_score_codex":0.0077437116,"about_ca_topic_score_gemma":0.009581782,"teacher_disagreement_score":0.0077437116,"about_ca_system_score_codex":0.001783337,"about_ca_system_score_gemma":0.0025150054,"threshold_uncertainty_score":0.015997052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09001614,0.00065431197,0.86910313,0.0012534893,0.000115718874,0.00013299513,0.00020040093,0.00048692364,0.038036887],"genre_scores_gemma":[0.7844237,0.0010580457,0.19226341,0.0006862615,0.0002334531,0.00030709314,0.00022219197,0.00035063212,0.020455254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998747,0.00047691798,0.00004396852,0.0003409662,0.00024938173,0.00014171288],"domain_scores_gemma":[0.9958455,0.002346991,0.00035672114,0.0009015458,0.00022143638,0.00032779932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014592272,0.0006458853,0.00061504764,0.0009396376,0.001138636,0.0020218194,0.0017178433,0.0012214145,0.006365962],"category_scores_gemma":[0.006651936,0.00049028615,0.0011060322,0.0010968877,0.0035908206,0.0059921728,0.0031652716,0.0034200442,0.00075386564],"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.000030763007,0.000033376633,0.00027594162,0.00004961904,0.000013417887,0.00007589964,0.00023108965,0.037915822,0.0015003523,0.94884986,0.0008086995,0.010215143],"study_design_scores_gemma":[0.000014123436,0.000017954026,0.00008736864,0.000014302735,0.000008388121,0.00004753074,0.000048404636,0.11354298,0.000710043,0.8811178,0.0043798103,0.000011234784],"about_ca_topic_score_codex":0.0020775937,"about_ca_topic_score_gemma":0.001912766,"teacher_disagreement_score":0.006365962,"about_ca_system_score_codex":0.0016763343,"about_ca_system_score_gemma":0.00079702534,"threshold_uncertainty_score":0.021296263},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014722324,0.00043959363,0.9509647,0.00017464644,0.00013266118,0.00011455626,0.00073639496,0.026580941,0.006134229],"genre_scores_gemma":[0.12491,0.00027841,0.8614064,0.00025683726,0.000039932398,0.0002469304,0.003723259,0.003370423,0.005767882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966,0.000051220813,0.000016856618,0.00008817206,0.00014313294,0.000040687784],"domain_scores_gemma":[0.9995671,0.00012263171,0.000032267908,0.00017714426,0.00007174537,0.000029042707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034216864,0.0011544906,0.00064494356,0.0008880054,0.00044356103,0.0007689844,0.0021382277,0.0007216388,0.009369136],"category_scores_gemma":[0.0016822579,0.00053887215,0.0009824989,0.0007814346,0.00042724132,0.0018468167,0.002014364,0.0014431257,0.0030977908],"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.00034918124,0.00019175166,0.001634155,0.000879601,0.00021260465,0.000285892,0.00029520362,0.27768898,0.044184215,0.03763548,0.047972493,0.58867055],"study_design_scores_gemma":[0.000077716984,0.0001070315,0.00049071177,0.00005067661,0.000034613135,0.0001475873,0.00008476203,0.93047905,0.013154746,0.028682336,0.026661083,0.00002977508],"about_ca_topic_score_codex":0.0037520183,"about_ca_topic_score_gemma":0.0137742,"teacher_disagreement_score":0.009369136,"about_ca_system_score_codex":0.0005698397,"about_ca_system_score_gemma":0.0007170762,"threshold_uncertainty_score":0.031342864},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00791234,0.0011019396,0.9809444,0.0032269042,0.0002126826,0.0001637754,0.0027611405,0.0013564756,0.0023203243],"genre_scores_gemma":[0.1897068,0.0015152863,0.7815265,0.0019026442,0.00080253993,0.00089217373,0.013910825,0.0012185989,0.008524486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9897113,0.0039399667,0.0007862807,0.003344328,0.001854853,0.0003633233],"domain_scores_gemma":[0.9831634,0.0069097006,0.0013240151,0.0065052104,0.0014360578,0.0006615206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008898872,0.0015529114,0.0024476408,0.0053022094,0.0017819385,0.005054888,0.0051862034,0.0041481163,0.006243578],"category_scores_gemma":[0.040432576,0.00096723984,0.0022370855,0.008363186,0.0027430593,0.010850797,0.0070229694,0.0058252704,0.003283434],"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.0003959837,0.00027651156,0.005838863,0.0007562398,0.0004670131,0.00030130785,0.0005012828,0.14345783,0.0025512194,0.41888288,0.052727442,0.3738435],"study_design_scores_gemma":[0.000048629732,0.00013474382,0.0012317633,0.0001318964,0.000042844145,0.00028812504,0.00015362831,0.42070645,0.0011678657,0.5540191,0.022032216,0.000042726588],"about_ca_topic_score_codex":0.003974806,"about_ca_topic_score_gemma":0.008186965,"teacher_disagreement_score":0.008898872,"about_ca_system_score_codex":0.004339981,"about_ca_system_score_gemma":0.0031356735,"threshold_uncertainty_score":0.047062278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009802565,0.003918383,0.9807279,0.00050479325,0.00011362599,0.000070081165,0.00006800102,0.00032183732,0.0044727214],"genre_scores_gemma":[0.14794753,0.01000633,0.836172,0.00042802948,0.0003251036,0.00019654752,0.000717337,0.00040384702,0.003803341],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990251,0.00030226196,0.00003847289,0.00023211614,0.00032932236,0.00007279305],"domain_scores_gemma":[0.99686193,0.0018187837,0.00016820959,0.00042721047,0.0006617163,0.000062301755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013145525,0.0011786254,0.0010288291,0.0011620257,0.000799661,0.0013117422,0.0013286353,0.00080974854,0.0023774155],"category_scores_gemma":[0.0064293053,0.000658872,0.0007215339,0.0026403365,0.0010869177,0.0030611719,0.0008845271,0.0019555152,0.00089824136],"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.00013151328,0.00017574607,0.0009819525,0.0011614101,0.00014868219,0.000074964395,0.00030763375,0.36903152,0.018036474,0.2269365,0.008608361,0.3744053],"study_design_scores_gemma":[0.000039488634,0.00011704503,0.0004927235,0.00010149139,0.0000388703,0.00015862237,0.00009657998,0.8744736,0.009465449,0.09361849,0.0213721,0.000025557976],"about_ca_topic_score_codex":0.0031800733,"about_ca_topic_score_gemma":0.0030314643,"teacher_disagreement_score":0.0031800733,"about_ca_system_score_codex":0.0010942651,"about_ca_system_score_gemma":0.0013422704,"threshold_uncertainty_score":0.007953286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085751526,0.00117547,0.8995207,0.00052243855,0.00028415004,0.00012350891,0.0006906081,0.0066742953,0.005257315],"genre_scores_gemma":[0.79894817,0.00069059985,0.1844891,0.00073292974,0.000078867066,0.0001638919,0.0026556365,0.00029724208,0.011943591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998273,0.000019831601,0.000006130322,0.000069686714,0.000043719723,0.000033333945],"domain_scores_gemma":[0.99975604,0.00006041418,0.000029366147,0.00004110082,0.00008711381,0.00002599819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027344024,0.0011562465,0.0005364855,0.0006183989,0.00030564223,0.00054414454,0.0014838051,0.0008314121,0.001828157],"category_scores_gemma":[0.0008477628,0.00031934452,0.00060641224,0.0006736221,0.00047190636,0.0010864452,0.00072930625,0.00088142016,0.0005522502],"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.00029986587,0.00019944042,0.003257288,0.00014654364,0.00015535486,0.0003035395,0.00009265072,0.50740874,0.025425937,0.0060313735,0.013874653,0.44280455],"study_design_scores_gemma":[0.0000056494937,0.000036248028,0.0003685713,0.0000049902465,0.000014771701,0.000042237785,0.0000064646492,0.99519914,0.0021728503,0.0013148886,0.0008261839,0.000008100247],"about_ca_topic_score_codex":0.021427356,"about_ca_topic_score_gemma":0.02569182,"teacher_disagreement_score":0.021427356,"about_ca_system_score_codex":0.0010278584,"about_ca_system_score_gemma":0.00077437685,"threshold_uncertainty_score":0.04260528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27550247,0.0054606306,0.588412,0.017745867,0.0006163396,0.00018114563,0.0015091433,0.0015085893,0.109063834],"genre_scores_gemma":[0.90769255,0.0031397622,0.06640654,0.0030130208,0.0014791925,0.00045117666,0.0013043457,0.00091668,0.01559668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9921292,0.0031954974,0.00033677724,0.0015574092,0.0018959816,0.00088502164],"domain_scores_gemma":[0.91989166,0.061109535,0.0046068197,0.0063136066,0.0036284889,0.0044498453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008756345,0.0014075937,0.0046417424,0.0057269656,0.004862749,0.009422247,0.0073592323,0.006046476,0.013678184],"category_scores_gemma":[0.08209982,0.0019487344,0.0015995967,0.006142879,0.010194046,0.029867176,0.009635804,0.007959547,0.0020041019],"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.00015046156,0.00008040219,0.00042907635,0.0001230065,0.00002558128,0.00009342192,0.00026161023,0.009275924,0.00045733,0.9801381,0.002716596,0.006248457],"study_design_scores_gemma":[0.000017938855,0.000020152816,0.00009400345,0.00002792434,0.000010122132,0.00008238528,0.000048278573,0.03367505,0.0001920029,0.96521676,0.00060222775,0.000013200427],"about_ca_topic_score_codex":0.0023347738,"about_ca_topic_score_gemma":0.0015589604,"teacher_disagreement_score":0.013678184,"about_ca_system_score_codex":0.0040382156,"about_ca_system_score_gemma":0.002898904,"threshold_uncertainty_score":0.046308517},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007808077,0.12882906,0.38067618,0.16283494,0.016983585,0.0001423821,0.0022491722,0.0056583267,0.29481825],"genre_scores_gemma":[0.16025037,0.09956154,0.2995181,0.047354553,0.020860538,0.00034161392,0.0042730565,0.004626696,0.36321366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979438,0.0006219581,0.00011033974,0.00046540544,0.0007006831,0.00015771078],"domain_scores_gemma":[0.9958157,0.002003333,0.00016456691,0.0011566847,0.0006176921,0.00024207492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022617283,0.0009308307,0.0016959372,0.0022177505,0.0011609758,0.0062249694,0.0021680077,0.004528593,0.045936856],"category_scores_gemma":[0.015268403,0.000713092,0.00097007304,0.005240318,0.0035501332,0.036192916,0.0039495802,0.0038755417,0.023506705],"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.00012891533,0.000086405744,0.00040620772,0.00060496264,0.000042323616,0.000075596865,0.00020097103,0.00074768456,0.0009988288,0.3861862,0.3085931,0.30192882],"study_design_scores_gemma":[0.00002241391,0.000044985954,0.0002821437,0.00028693138,0.00003082603,0.00049331295,0.00037223773,0.005397298,0.00093515165,0.6347172,0.35737282,0.000044595447],"about_ca_topic_score_codex":0.0022774118,"about_ca_topic_score_gemma":0.0023684495,"teacher_disagreement_score":0.045936856,"about_ca_system_score_codex":0.0011133936,"about_ca_system_score_gemma":0.0010069165,"threshold_uncertainty_score":0.15367407},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01429268,0.00020323506,0.9833123,0.00011703867,0.000025993577,0.000058277372,0.000073219904,0.0006768093,0.0012404384],"genre_scores_gemma":[0.23087896,0.00021133463,0.7649255,0.00008811132,0.000035658974,0.0001341421,0.00051753415,0.0002645944,0.0029441225],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961287,0.000075481636,0.000022840928,0.000100096724,0.00014441254,0.000044229466],"domain_scores_gemma":[0.99951744,0.00012715733,0.000041858442,0.00013629597,0.00013723939,0.000040058643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036237028,0.00053656934,0.00047502926,0.0009791912,0.0010302607,0.0007214047,0.0008748402,0.00041457766,0.0013972704],"category_scores_gemma":[0.0009726973,0.0003069879,0.00049357605,0.0011457098,0.00061840686,0.0016394233,0.0009658548,0.00061249506,0.00039911037],"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.00026375506,0.00016256282,0.0018956927,0.00023519725,0.000090898786,0.00024040035,0.00071071123,0.30136618,0.05391363,0.041651897,0.008515974,0.59095305],"study_design_scores_gemma":[0.000030381243,0.00006168926,0.0004995639,0.000011291527,0.000017186976,0.00011217838,0.00016433753,0.9608588,0.01442472,0.016527167,0.00727099,0.000021661946],"about_ca_topic_score_codex":0.008064539,"about_ca_topic_score_gemma":0.015320706,"teacher_disagreement_score":0.008064539,"about_ca_system_score_codex":0.0007140719,"about_ca_system_score_gemma":0.001097651,"threshold_uncertainty_score":0.0160352},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05279335,0.00048646805,0.93761635,0.0004291514,0.000068615394,0.00016521876,0.0002762662,0.004441978,0.0037225897],"genre_scores_gemma":[0.5715515,0.00019639185,0.42339054,0.00017867771,0.00005438828,0.00013381065,0.0012320416,0.00050599163,0.002756737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821585,0.00041443048,0.000092269336,0.00041227086,0.0006211551,0.0002440632],"domain_scores_gemma":[0.9982527,0.00057143957,0.00011748477,0.000693935,0.00023650064,0.00012805487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001109798,0.0009459912,0.0012995494,0.00092861487,0.0008355133,0.001418368,0.0022462136,0.00082592544,0.002251993],"category_scores_gemma":[0.005080295,0.00035932875,0.0005822243,0.0018568663,0.0006697675,0.0027773674,0.0022503692,0.0010243186,0.00067122537],"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.00052056613,0.0004518672,0.0042042104,0.00026575176,0.00013220073,0.00022424667,0.00032658022,0.453469,0.022425987,0.03577719,0.015545774,0.4666566],"study_design_scores_gemma":[0.000025027766,0.000036172583,0.00022070998,0.00000365164,0.000012346579,0.000050109145,0.00006016877,0.9828249,0.002637144,0.012962824,0.0011593048,0.0000076519655],"about_ca_topic_score_codex":0.0078019826,"about_ca_topic_score_gemma":0.017414141,"teacher_disagreement_score":0.0078019826,"about_ca_system_score_codex":0.0013000786,"about_ca_system_score_gemma":0.0022794649,"threshold_uncertainty_score":0.015513122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04354112,0.0018662969,0.9202977,0.00087907776,0.00055160426,0.00046335944,0.0029485673,0.0062250677,0.0232273],"genre_scores_gemma":[0.70410925,0.00089757645,0.24023597,0.00033563082,0.00037764286,0.00029469142,0.0062883813,0.00048536705,0.046975438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986387,0.00035523827,0.00006421112,0.0003494236,0.00042211183,0.0001702923],"domain_scores_gemma":[0.9970708,0.0009712182,0.00011475621,0.00088314706,0.0007144302,0.00024569244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090589735,0.0010301572,0.0014745978,0.0016949737,0.0010981456,0.0011967181,0.002308112,0.0014461192,0.015988976],"category_scores_gemma":[0.0038905807,0.0004479085,0.0013559568,0.0026868721,0.00040093868,0.0020428512,0.0011489919,0.0010444367,0.006230771],"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.002060875,0.0013515387,0.0067161545,0.00064156216,0.00069791975,0.0003973742,0.0003265499,0.18559341,0.020118617,0.021007938,0.11429563,0.6467925],"study_design_scores_gemma":[0.00007845853,0.00028575087,0.0022071379,0.00003066178,0.00021395014,0.00025830584,0.00017672457,0.958781,0.00762745,0.015316718,0.014967956,0.000055870813],"about_ca_topic_score_codex":0.016806593,"about_ca_topic_score_gemma":0.047432292,"teacher_disagreement_score":0.016806593,"about_ca_system_score_codex":0.00078268995,"about_ca_system_score_gemma":0.0016862609,"threshold_uncertainty_score":0.053488433},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75507855,0.0007097531,0.21240269,0.0006306585,0.00020652433,0.0002683429,0.0014759472,0.011611423,0.017616034],"genre_scores_gemma":[0.9000033,0.00019311294,0.0950965,0.0001216606,0.000034133758,0.00012182536,0.0014193939,0.00036502344,0.0026449373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99951077,0.000091577946,0.000020414092,0.000085227126,0.00019618854,0.00009576131],"domain_scores_gemma":[0.9984244,0.0007549547,0.00011310867,0.00020412265,0.00041840252,0.00008506388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066005293,0.0009807957,0.00035784443,0.00085725967,0.00044446083,0.0006813435,0.0012154857,0.00047660698,0.00407968],"category_scores_gemma":[0.0032951024,0.0002515765,0.0005386159,0.0009660605,0.00041171364,0.0010672712,0.0004661946,0.000838031,0.0007194781],"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.00062936917,0.00048068288,0.012575932,0.0005507166,0.00013517949,0.00036317913,0.0001591334,0.83979315,0.025868876,0.012430798,0.015336314,0.09167671],"study_design_scores_gemma":[0.000007812522,0.00006205394,0.0010463911,0.000003015873,0.000006750692,0.000019407786,0.000020327936,0.9941267,0.0032867428,0.00087704504,0.00054015784,0.0000035929186],"about_ca_topic_score_codex":0.0065637855,"about_ca_topic_score_gemma":0.0064331293,"teacher_disagreement_score":0.0065637855,"about_ca_system_score_codex":0.0011103791,"about_ca_system_score_gemma":0.0014359519,"threshold_uncertainty_score":0.013647854},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00844447,0.007445665,0.94432414,0.0021366945,0.00035767118,0.00075599423,0.005714591,0.017680168,0.013140551],"genre_scores_gemma":[0.1241433,0.010404458,0.8307652,0.0015283336,0.00078935205,0.000857975,0.021923812,0.0032189288,0.0063686366],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99312913,0.000967867,0.0010052607,0.0011865619,0.0031548,0.00055646116],"domain_scores_gemma":[0.9843662,0.0065839794,0.0011181429,0.005517071,0.0021077283,0.00030684072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036570444,0.0020669892,0.0025187284,0.010894653,0.0022868272,0.0067083132,0.005036878,0.0018580324,0.008760945],"category_scores_gemma":[0.01929349,0.0010661844,0.0033398261,0.019183924,0.0020959426,0.020776805,0.0055841734,0.0034949507,0.0053175874],"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.00032984154,0.00044676106,0.002719437,0.0020414158,0.000203416,0.00023464943,0.0010758705,0.021410462,0.009362255,0.25804418,0.06947429,0.6346575],"study_design_scores_gemma":[0.00015168478,0.00028842036,0.0015474578,0.0006334008,0.0002821577,0.0015123636,0.001175062,0.25466296,0.020450078,0.548395,0.17064711,0.00025428744],"about_ca_topic_score_codex":0.00850652,"about_ca_topic_score_gemma":0.008707478,"teacher_disagreement_score":0.010894653,"about_ca_system_score_codex":0.0035206354,"about_ca_system_score_gemma":0.0039478494,"threshold_uncertainty_score":0.02930832},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2170804,0.00029902416,0.7738163,0.0007969622,0.00006611324,0.000071098395,0.00016882818,0.00031531963,0.0073859743],"genre_scores_gemma":[0.93775564,0.0003173893,0.054494496,0.0001705671,0.00008576505,0.0001707826,0.00019743342,0.00013036317,0.006677456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901307,0.00048502552,0.00003998619,0.00017144192,0.00019052235,0.00009984918],"domain_scores_gemma":[0.9930073,0.0049974453,0.00072301045,0.0004099666,0.00036898418,0.00049321627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016246544,0.00051041285,0.0007384222,0.0015869152,0.0007394979,0.0013941302,0.001294548,0.0012617037,0.0031849244],"category_scores_gemma":[0.011664972,0.00046003022,0.0009812331,0.0007539249,0.0020012162,0.0025897105,0.0013240523,0.0012525247,0.00042715194],"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.000051824496,0.00005597555,0.0016270982,0.000056220575,0.00003962094,0.00044883028,0.00041020344,0.21691298,0.003184095,0.76907337,0.0011076946,0.007031943],"study_design_scores_gemma":[0.0000127145795,0.000022676437,0.00020472107,0.00000677617,0.000006015136,0.00007995225,0.00004307403,0.7610583,0.00033395045,0.2375255,0.00069230894,0.000014129339],"about_ca_topic_score_codex":0.0023810938,"about_ca_topic_score_gemma":0.0018594117,"teacher_disagreement_score":0.0031849244,"about_ca_system_score_codex":0.0011672243,"about_ca_system_score_gemma":0.0005137481,"threshold_uncertainty_score":0.010654628},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003985229,0.00064109353,0.98919207,0.00070454646,0.00010616529,0.000072332936,0.0002441414,0.0020247225,0.0030296866],"genre_scores_gemma":[0.12709285,0.0015249914,0.8649963,0.0006337304,0.00022754128,0.00027502998,0.0011156182,0.0009547239,0.0031792265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782145,0.0007038318,0.0001223363,0.0006971771,0.00057879445,0.000076429766],"domain_scores_gemma":[0.9921848,0.0035554157,0.0006143779,0.0029312018,0.0005733107,0.00014098236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002389784,0.0012059296,0.0007517364,0.002511853,0.00093660847,0.0020405864,0.001972591,0.0012980668,0.0051650326],"category_scores_gemma":[0.0118795,0.00065447204,0.0019441157,0.002848506,0.002855813,0.005754116,0.002582848,0.0035501586,0.0016378376],"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.00006487315,0.00007017176,0.0013963636,0.00043693534,0.00007968446,0.00013520132,0.00033942505,0.13081819,0.0039371015,0.63909924,0.010124359,0.21349835],"study_design_scores_gemma":[0.0000101975675,0.000034045486,0.0002514067,0.000095065334,0.000019705518,0.0001716087,0.000057322355,0.18863319,0.002051451,0.77307415,0.035578433,0.000023602666],"about_ca_topic_score_codex":0.0034883008,"about_ca_topic_score_gemma":0.003937247,"teacher_disagreement_score":0.0051650326,"about_ca_system_score_codex":0.0021462026,"about_ca_system_score_gemma":0.0019727994,"threshold_uncertainty_score":0.01727879},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014214221,0.09197261,0.002109676,0.054115348,0.03861331,0.00006380264,0.00088259205,0.0007696075,0.81005156],"genre_scores_gemma":[0.0051579876,0.025305199,0.0010329338,0.008334985,0.004131194,0.00003633601,0.00038270676,0.00041700207,0.9552017],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993197,0.000113671274,0.000033309203,0.00012484894,0.00033082167,0.000077695666],"domain_scores_gemma":[0.99845886,0.00033603856,0.00007551265,0.0002206878,0.0005645966,0.000344383],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008727413,0.00078982837,0.00058085524,0.0022018787,0.0033004107,0.0088531645,0.00091346755,0.0021684882,0.3620529],"category_scores_gemma":[0.0030888594,0.000608614,0.0006750498,0.0027570757,0.0020876254,0.0044133593,0.0021267363,0.0027196426,0.21311258],"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.000010547132,0.000010811696,0.00017656681,0.00012501061,0.0000040104965,0.000025677005,0.00011316721,0.000032907574,0.00010668624,0.007527901,0.9421461,0.04972053],"study_design_scores_gemma":[0.0000016305595,0.0000047389417,0.0004138045,0.00018824055,0.000003131297,0.00007714231,0.00020464286,0.000027443051,0.00004231946,0.0021310616,0.99690104,0.0000048213383],"about_ca_topic_score_codex":0.0151181985,"about_ca_topic_score_gemma":0.055540096,"teacher_disagreement_score":0.3620529,"about_ca_system_score_codex":0.0036953522,"about_ca_system_score_gemma":0.0026216842,"threshold_uncertainty_score":0.90995413},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11965034,0.00021608375,0.87553793,0.0002487597,0.00004904432,0.00017006087,0.0001335629,0.001687125,0.0023069351],"genre_scores_gemma":[0.58010435,0.00019484007,0.41703308,0.00008640997,0.000030444302,0.00015551125,0.00043333342,0.00031459707,0.0016474309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958163,0.00015051803,0.000020886231,0.000077307544,0.000117833966,0.000051856015],"domain_scores_gemma":[0.99904746,0.0004873697,0.00008486619,0.00011709143,0.0001829503,0.00008026606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069737085,0.0005845638,0.00045302458,0.0008639338,0.0006816322,0.00084053323,0.0008744276,0.00043202363,0.00092225487],"category_scores_gemma":[0.0018837057,0.00033577962,0.00042234882,0.0009338408,0.0004974183,0.0008208131,0.00067019626,0.00036739284,0.00023248525],"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.000185212,0.00010440894,0.0016672913,0.00009756497,0.000039566323,0.00010612072,0.00019846277,0.8914217,0.017352875,0.010087605,0.0026992776,0.07603992],"study_design_scores_gemma":[0.0000151157665,0.000018229635,0.00018727843,0.0000024432163,0.0000036952665,0.000012027631,0.000026438905,0.9916015,0.0021397774,0.005427763,0.00056179136,0.0000039098977],"about_ca_topic_score_codex":0.006826955,"about_ca_topic_score_gemma":0.0074986583,"teacher_disagreement_score":0.006826955,"about_ca_system_score_codex":0.0011955064,"about_ca_system_score_gemma":0.0012491054,"threshold_uncertainty_score":0.013574481},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42946345,0.17710206,0.04864031,0.094648294,0.0020015996,0.00083443336,0.017619202,0.0015190917,0.22817163],"genre_scores_gemma":[0.90329033,0.045686834,0.025513507,0.0038143424,0.00060713675,0.00045864767,0.0041203443,0.0002776371,0.016231291],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98032343,0.0091710985,0.0013695674,0.0016578365,0.006204505,0.0012736276],"domain_scores_gemma":[0.93610436,0.033571042,0.007271424,0.0022853073,0.018432453,0.0023353356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018711098,0.0007562224,0.0008294173,0.0047256122,0.0009221274,0.007771107,0.0011154892,0.0015111442,0.017102007],"category_scores_gemma":[0.062186163,0.00045309088,0.0017323409,0.005441569,0.0013433415,0.0042524054,0.0025136662,0.0018600533,0.0024679455],"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.0012833516,0.0002394351,0.27609,0.006406727,0.0015663009,0.00020983562,0.0027752665,0.008099468,0.0023544151,0.039809857,0.04662867,0.61453664],"study_design_scores_gemma":[0.00028230067,0.001548596,0.51875013,0.010482577,0.0021940563,0.0012469293,0.007020867,0.014779128,0.009354895,0.02102397,0.412967,0.00034945356],"about_ca_topic_score_codex":0.032073908,"about_ca_topic_score_gemma":0.024939492,"teacher_disagreement_score":0.032073908,"about_ca_system_score_codex":0.008008519,"about_ca_system_score_gemma":0.012138258,"threshold_uncertainty_score":0.098954976},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006934829,0.00018057521,0.051586036,0.00034808263,0.00045428134,0.00015840265,0.028005652,0.87765396,0.040919475],"genre_scores_gemma":[0.0172077,0.00032939157,0.061974775,0.0010363773,0.00021723566,0.0005195115,0.09162314,0.7249077,0.102184206],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99767965,0.0002737726,0.0001860256,0.0006313712,0.0008895087,0.00033975698],"domain_scores_gemma":[0.9953101,0.0008376607,0.00020704887,0.0017664329,0.0015536895,0.0003250236],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024761893,0.003081194,0.00160604,0.00226687,0.0010918916,0.005516285,0.006352262,0.002321533,0.41776857],"category_scores_gemma":[0.009532416,0.0033503629,0.0020251,0.001956152,0.0011678104,0.00613749,0.0036276388,0.004271196,0.4104813],"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.000577411,0.000057095313,0.00039891448,0.00051991653,0.000038179773,0.00007540974,0.00008330461,0.0005866342,0.002910828,0.006813031,0.9440389,0.043900426],"study_design_scores_gemma":[0.00036760277,0.000054965447,0.0007510995,0.00019511714,0.000035243705,0.00020106445,0.000049395385,0.006227802,0.02362973,0.009044873,0.9592996,0.00014346123],"about_ca_topic_score_codex":0.0071289917,"about_ca_topic_score_gemma":0.0053058723,"teacher_disagreement_score":0.41776857,"about_ca_system_score_codex":0.0028019794,"about_ca_system_score_gemma":0.0021494636,"threshold_uncertainty_score":0.8304825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000899311,0.0019424534,0.0016763306,0.0011221358,0.00097060815,0.000032936314,0.002838385,0.0023531925,0.98816454],"genre_scores_gemma":[0.0042816177,0.0013005935,0.0013561771,0.00025050607,0.00018882645,0.000028384093,0.0022739957,0.0007449037,0.98957497],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994473,0.000084209256,0.00002329872,0.00019510029,0.00016695326,0.00008311301],"domain_scores_gemma":[0.99942553,0.00008067761,0.00004226719,0.00016560762,0.00018563416,0.000100303936],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00046407897,0.0015332315,0.0013053562,0.0029882893,0.0027559942,0.00701597,0.0015946955,0.0018728629,0.7566178],"category_scores_gemma":[0.0014262357,0.00041983696,0.0006540368,0.003830405,0.0007065396,0.003459627,0.002561274,0.0017365292,0.60673475],"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.00021092151,0.00010670816,0.00043794763,0.0003068265,0.000020220443,0.0001411424,0.00015613419,0.00025372847,0.00084797293,0.058037005,0.55972683,0.37975454],"study_design_scores_gemma":[0.000013918644,0.000012621134,0.00027362048,0.00006739895,0.000007566981,0.000064173575,0.000073045136,0.00013836623,0.00029109142,0.0047243554,0.9943287,0.0000052062774],"about_ca_topic_score_codex":0.0052464087,"about_ca_topic_score_gemma":0.008434178,"teacher_disagreement_score":0.9947536,"about_ca_system_score_codex":0.0015568474,"about_ca_system_score_gemma":0.0013535854,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010978933,0.0014063707,0.0046796314,0.005803343,0.0058105453,0.00033896213,0.18439315,0.023143953,0.7733262],"genre_scores_gemma":[0.0050282674,0.0013434524,0.0034719654,0.0036690766,0.002031465,0.00037670668,0.113546394,0.0144977635,0.85603493],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99777406,0.00025961807,0.00014908443,0.00035323354,0.0011122848,0.00035177317],"domain_scores_gemma":[0.986167,0.0025389895,0.0006352784,0.0037215133,0.004726016,0.002211183],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0020618741,0.0013804283,0.0015624356,0.006266187,0.0026920214,0.014120456,0.0020318988,0.0024843344,0.8506513],"category_scores_gemma":[0.017108379,0.0011780137,0.0013259831,0.011484247,0.00086370535,0.008757942,0.0058085453,0.0033393344,0.8618177],"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.000014746451,0.0000114313325,0.00013575931,0.000056725712,0.00000267992,0.000011861633,0.00001595877,0.00003189708,0.00005323006,0.0008365077,0.9783508,0.020478386],"study_design_scores_gemma":[0.000008007584,0.0000074837744,0.0005699605,0.000059588943,0.0000017543099,0.000032864766,0.000033700486,0.000050954834,0.0001191426,0.00088727253,0.9982185,0.000010827309],"about_ca_topic_score_codex":0.0044808355,"about_ca_topic_score_gemma":0.00587588,"teacher_disagreement_score":0.14934868,"about_ca_system_score_codex":0.0014252336,"about_ca_system_score_gemma":0.0021518234,"threshold_uncertainty_score":0.21302778},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009694276,0.001469145,0.8791993,0.0025372496,0.0003308309,0.00016916408,0.015451816,0.0051359516,0.086012214],"genre_scores_gemma":[0.32051247,0.0052320603,0.54249704,0.0017775826,0.00046111865,0.0027279826,0.026446648,0.0077521903,0.092592925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996822,0.00008701306,0.000013939187,0.000059774284,0.00012656751,0.000030570278],"domain_scores_gemma":[0.9994147,0.0002843241,0.00004649695,0.00010217683,0.000115004805,0.00003744214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084988156,0.0005995256,0.0007775164,0.0009736904,0.0005346567,0.0013735063,0.0013653575,0.0009941288,0.037896164],"category_scores_gemma":[0.0025038656,0.0004058807,0.0013063997,0.0007510279,0.00037887838,0.0013763465,0.0009680843,0.0012789742,0.010685301],"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.0000795234,0.0001058717,0.0014440796,0.00040283456,0.00007736341,0.00012108247,0.00008680262,0.2903666,0.0033442292,0.48042825,0.15514566,0.068397686],"study_design_scores_gemma":[0.000025582158,0.000019184925,0.00030668054,0.000042186093,0.000018563644,0.00007670956,0.000022183474,0.7727451,0.0016104756,0.16585812,0.059251707,0.000023502613],"about_ca_topic_score_codex":0.0042496044,"about_ca_topic_score_gemma":0.0039647077,"teacher_disagreement_score":0.037896164,"about_ca_system_score_codex":0.0010272494,"about_ca_system_score_gemma":0.0011171306,"threshold_uncertainty_score":0.12677526},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006758101,0.00024380797,0.00047207755,0.00026093094,0.00015444454,0.00012085922,0.9821421,0.0013597052,0.014570329],"genre_scores_gemma":[0.0030861509,0.00024984675,0.0016707719,0.0002677779,0.000055693723,0.00040616447,0.9830308,0.0005695026,0.010663312],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984195,0.0002322907,0.00023022598,0.0004097843,0.00043154898,0.000276616],"domain_scores_gemma":[0.99403495,0.0020118074,0.0006471686,0.0014639022,0.0013624025,0.00047990444],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000977025,0.0018932032,0.000923222,0.0057701464,0.0012091242,0.0033253157,0.0026492921,0.002211641,0.3202272],"category_scores_gemma":[0.01278099,0.00072553277,0.0013674912,0.005326472,0.00057068304,0.0027822396,0.0029295345,0.0023807748,0.24299484],"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.000051902927,0.00002339243,0.000721569,0.0004083009,0.000008171673,0.000039743434,0.000019533294,0.0000921325,0.000043320557,0.0005846664,0.9922173,0.005789992],"study_design_scores_gemma":[0.00012921516,0.00001591777,0.0018877098,0.000498754,0.000013695411,0.00013029568,0.00016427888,0.0002147711,0.00029641634,0.0019515299,0.99468356,0.000013882707],"about_ca_topic_score_codex":0.0114709865,"about_ca_topic_score_gemma":0.02838006,"teacher_disagreement_score":0.3202272,"about_ca_system_score_codex":0.0013615388,"about_ca_system_score_gemma":0.002483213,"threshold_uncertainty_score":0.9696134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021129056,0.000026176449,0.000054743352,0.000049300954,0.000017726928,0.000013842014,0.9992538,0.00012586403,0.0002471936],"genre_scores_gemma":[0.0015151809,0.000030860134,0.0006199286,0.000081881364,0.000009295223,0.00012111256,0.99700814,0.00005289013,0.0005607287],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910647,0.00015296001,0.00013522948,0.00028919085,0.00016266848,0.00015346936],"domain_scores_gemma":[0.9961475,0.0014441656,0.00054480537,0.0006671764,0.00081747,0.00037881546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014588278,0.0014363348,0.0010930076,0.0022047646,0.00095389923,0.0019901604,0.002766342,0.0021123649,0.1560138],"category_scores_gemma":[0.009974704,0.0005401784,0.0012129291,0.0027836836,0.00040051312,0.0011154116,0.0017824076,0.0016569376,0.06254333],"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.00017801335,0.00007850531,0.006300642,0.0013494273,0.00009995962,0.00005035915,0.00004053373,0.00056662696,0.00019580814,0.00043104938,0.9871917,0.003517517],"study_design_scores_gemma":[0.00096504355,0.000104348816,0.029430617,0.001175505,0.00017544137,0.00026514792,0.00030462566,0.001672925,0.0006970484,0.002638417,0.9624936,0.00007738662],"about_ca_topic_score_codex":0.026000265,"about_ca_topic_score_gemma":0.077118106,"teacher_disagreement_score":0.1560138,"about_ca_system_score_codex":0.0014691568,"about_ca_system_score_gemma":0.0018833318,"threshold_uncertainty_score":0.5219182},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024207076,0.0014630484,0.00008740574,0.00041521998,0.00004852379,0.000033907843,0.9715285,0.00006429143,0.0021520366],"genre_scores_gemma":[0.05371579,0.0021741558,0.0005660898,0.00031013394,0.000051174273,0.00024396332,0.93853575,0.00003747923,0.0043654307],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99861276,0.00020428348,0.0002937561,0.00029177152,0.00036757177,0.00022973664],"domain_scores_gemma":[0.99337864,0.0022780364,0.0011470647,0.00043886586,0.002250303,0.000507067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001526481,0.00071506854,0.00093922054,0.005881136,0.00066175393,0.0014923534,0.0010866206,0.0008763445,0.0064763473],"category_scores_gemma":[0.015897153,0.00045208915,0.00095221034,0.014667273,0.0003398254,0.0007949421,0.0007788363,0.0012020287,0.0030197976],"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.00054098247,0.000094318115,0.33908486,0.0040048724,0.00056119746,0.00016829149,0.0012801446,0.0011871586,0.0003226616,0.0010346442,0.6261683,0.025552573],"study_design_scores_gemma":[0.00015103827,0.00004882809,0.8061448,0.0010928678,0.00021438961,0.00023065956,0.0029619688,0.00045974387,0.00032022304,0.00028760685,0.1880425,0.00004534784],"about_ca_topic_score_codex":0.5067578,"about_ca_topic_score_gemma":0.5617849,"teacher_disagreement_score":0.4932422,"about_ca_system_score_codex":0.0031987303,"about_ca_system_score_gemma":0.0050516604,"threshold_uncertainty_score":0.992294},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041786968,0.00004601029,0.000023304165,0.00003478339,0.000016228854,0.0000052985783,0.9989594,0.000060925773,0.00043602462],"genre_scores_gemma":[0.0011432839,0.000057108857,0.00008835599,0.000021074091,0.0000072269677,0.000024180605,0.9979588,0.000017418628,0.000682465],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.998978,0.000077658144,0.00013354956,0.00030222468,0.00029188272,0.00021678928],"domain_scores_gemma":[0.9967083,0.00040776152,0.0003558834,0.00051234383,0.0017811157,0.00023465915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005761401,0.0017138516,0.0012083034,0.0046459674,0.0007805255,0.001779266,0.0019013814,0.0012352114,0.031726297],"category_scores_gemma":[0.0064797546,0.0005551645,0.0011170785,0.013903542,0.0003807868,0.0010562007,0.00083578407,0.0015635875,0.037942626],"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.00006530953,0.000025399258,0.0039035014,0.00026717372,0.000032025288,0.000020355676,0.000013962381,0.0005237436,0.00006602754,0.00032718357,0.9925795,0.0021757546],"study_design_scores_gemma":[0.00024205024,0.000035120655,0.05458313,0.0004066713,0.00005862898,0.00011565431,0.00031115962,0.0014849982,0.00045111103,0.0008205441,0.9414349,0.00005594267],"about_ca_topic_score_codex":0.29527023,"about_ca_topic_score_gemma":0.3707813,"teacher_disagreement_score":0.7047298,"about_ca_system_score_codex":0.003420756,"about_ca_system_score_gemma":0.004084222,"threshold_uncertainty_score":0.5871031},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036949972,0.00018058995,0.000039846433,0.000117712785,0.000024278295,0.000012623253,0.9951787,0.00008033341,0.0006709669],"genre_scores_gemma":[0.0063259364,0.00018432378,0.0001750712,0.00005458311,0.000011746646,0.00004419971,0.9917207,0.000019559631,0.0014639336],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991499,0.00008333,0.00012232922,0.00021272589,0.00020566587,0.00022598557],"domain_scores_gemma":[0.99682873,0.00059472624,0.00045042622,0.00032480413,0.0014395699,0.0003618831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008329343,0.001233036,0.0011711881,0.004600532,0.0008007331,0.0014090475,0.0017439447,0.0010186062,0.011227985],"category_scores_gemma":[0.0068940017,0.00046782588,0.0009780802,0.008448714,0.00040553705,0.00063751225,0.0010108829,0.0014606398,0.010228587],"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.00024157757,0.000047178957,0.043771632,0.0008919624,0.00012614117,0.000071958806,0.00013523812,0.0007071882,0.00020799525,0.000498672,0.94835395,0.0049466495],"study_design_scores_gemma":[0.00043083206,0.00005138822,0.42742676,0.00061435613,0.0001461908,0.00023062935,0.0014267035,0.0014246946,0.0006015606,0.00067771773,0.56688905,0.00008010488],"about_ca_topic_score_codex":0.4804604,"about_ca_topic_score_gemma":0.57288873,"teacher_disagreement_score":0.5195396,"about_ca_system_score_codex":0.0025740394,"about_ca_system_score_gemma":0.0038621947,"threshold_uncertainty_score":0.95532763},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004496843,0.00002330473,0.00003763796,0.00003057748,0.000013458383,0.000013709935,0.9987618,0.000108834196,0.00056104286],"genre_scores_gemma":[0.0009439393,0.000034169258,0.00011621896,0.000021205109,0.0000076377855,0.00007648023,0.9975048,0.000017694398,0.0012779138],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994168,0.00005393598,0.000074426105,0.00017335809,0.0001595801,0.00012187032],"domain_scores_gemma":[0.9976447,0.0002446327,0.00030638286,0.00043526766,0.0010749354,0.00029410733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048251433,0.0017962663,0.0015366788,0.004743331,0.00079424016,0.0015580744,0.002393962,0.0012999554,0.06388232],"category_scores_gemma":[0.0038577851,0.00069700973,0.00075417024,0.00814534,0.0002770017,0.0009995755,0.001251728,0.0013384778,0.0754533],"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.000041371917,0.000027186783,0.0023444241,0.00015169689,0.00001459604,0.00001660396,0.000015835543,0.00019044007,0.000038019316,0.000114387956,0.9947056,0.0023397102],"study_design_scores_gemma":[0.0003162692,0.000034404624,0.055112507,0.00035891644,0.0000496123,0.00012337642,0.00044478395,0.0017331595,0.0005456112,0.00070159265,0.9405124,0.00006732457],"about_ca_topic_score_codex":0.111961536,"about_ca_topic_score_gemma":0.19368275,"teacher_disagreement_score":0.111961536,"about_ca_system_score_codex":0.0014667852,"about_ca_system_score_gemma":0.002840475,"threshold_uncertainty_score":0.22261971},"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":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002358625,0.007433048,0.0021495617,0.19799201,0.002915181,0.00045626328,0.00871943,0.00077945896,0.77719635],"genre_scores_gemma":[0.04424671,0.010017321,0.010531913,0.08034675,0.00071079255,0.0007383912,0.009746963,0.0005869382,0.8430743],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9755019,0.0019040009,0.0008311613,0.0015887009,0.013919006,0.006255288],"domain_scores_gemma":[0.9467694,0.002916167,0.0008678069,0.0019890515,0.032635868,0.014821635],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.01774967,0.0012342923,0.0009918484,0.009102353,0.016231224,0.02361058,0.005067436,0.008843856,0.05316221],"category_scores_gemma":[0.035195783,0.0010000342,0.0013502159,0.009458883,0.0047037425,0.007359284,0.00874462,0.0058215437,0.0122821685],"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.0000313635,0.000024076577,0.0008538902,0.00012238354,0.000018211638,0.000078176505,0.0002406594,0.0002135211,0.00012845073,0.2502759,0.7193241,0.028689183],"study_design_scores_gemma":[0.000011066944,0.00000507924,0.0014812753,0.00012621772,0.000009833357,0.000017486009,0.0003452974,0.00020132944,0.00006445267,0.0050008968,0.9927099,0.000027178592],"about_ca_topic_score_codex":0.9795163,"about_ca_topic_score_gemma":0.9815407,"teacher_disagreement_score":0.98225033,"about_ca_system_score_codex":0.16532855,"about_ca_system_score_gemma":0.47895196,"threshold_uncertainty_score":0.96810055},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021529758,0.033388276,0.0022451053,0.024041224,0.0029588551,0.00001985824,0.00011696484,0.00007079138,0.91562915],"genre_scores_gemma":[0.40497512,0.032099716,0.0018063064,0.00553425,0.0013904533,0.000029588904,0.00013712744,0.00026288285,0.5537645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995408,0.00019731522,0.000007558565,0.00004409101,0.00009886392,0.000111437716],"domain_scores_gemma":[0.99963367,0.00016162873,0.0000343906,0.000028660252,0.000040550167,0.00010110012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057659,0.0003649209,0.0002145168,0.0008028425,0.006086253,0.0052844784,0.000643279,0.0014712253,0.0094356695],"category_scores_gemma":[0.0014230323,0.00029215726,0.00019924203,0.0018531352,0.009082681,0.004315954,0.0028749683,0.0035528855,0.0014804003],"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.000027003833,0.000008892681,0.00021055783,0.00017173072,0.0000063702646,0.00014279035,0.08677356,0.00021979907,0.0002550801,0.73610705,0.14446567,0.031611588],"study_design_scores_gemma":[0.0000011742006,0.000005050316,0.00039529963,0.00015847318,0.000002179314,0.00009880013,0.011456645,0.00007483444,0.0000769804,0.025938772,0.96178466,0.000007017235],"about_ca_topic_score_codex":0.06762718,"about_ca_topic_score_gemma":0.18517159,"teacher_disagreement_score":0.06762718,"about_ca_system_score_codex":0.0075910585,"about_ca_system_score_gemma":0.0031709266,"threshold_uncertainty_score":0.13446712},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018589959,0.000043827138,0.9947733,0.00006065815,0.00005447233,0.000034933346,0.00006948849,0.0011140034,0.0019902484],"genre_scores_gemma":[0.042009804,0.00014378592,0.9509908,0.00014251996,0.0000445694,0.00023366373,0.00023792786,0.001311592,0.0048852647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967,0.00007205778,0.00001274557,0.00003947827,0.0001770843,0.000028584262],"domain_scores_gemma":[0.99912435,0.00038564455,0.00007870371,0.0001576184,0.00019613141,0.000057466157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007610034,0.0007757073,0.00063756696,0.0009859772,0.0007675816,0.0011305511,0.0022715977,0.0010488309,0.006298784],"category_scores_gemma":[0.002109976,0.00046656604,0.000750245,0.0009539538,0.0009746784,0.0012744088,0.0012062679,0.0015769069,0.0017152368],"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.00013383786,0.00011936731,0.0013322592,0.00030760773,0.000088312074,0.0002425411,0.00026946684,0.52245593,0.012407347,0.23902968,0.017811025,0.20580266],"study_design_scores_gemma":[0.000031208292,0.00001387297,0.00006648169,0.000012933497,0.000005160678,0.00004813624,0.000008911802,0.9727092,0.0021507912,0.014680761,0.010256547,0.0000160256],"about_ca_topic_score_codex":0.0049512996,"about_ca_topic_score_gemma":0.005343461,"teacher_disagreement_score":0.006298784,"about_ca_system_score_codex":0.0009296489,"about_ca_system_score_gemma":0.0017528106,"threshold_uncertainty_score":0.021071494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9975501,0.00011721916,0.0012618711,0.00006509282,0.000006966089,0.000006080232,0.00017895807,0.000030268922,0.00078344747],"genre_scores_gemma":[0.99655664,0.00013242793,0.002089336,0.000018369228,0.000019329245,0.000003747842,0.00071079,0.0000049433597,0.00046443485],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9998859,0.000011673577,0.00001025285,0.00004183819,0.000023291455,0.000027035805],"domain_scores_gemma":[0.99963045,0.00009139547,0.00012539978,0.00005884318,0.000016317474,0.00007757921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013342204,0.00030288676,0.0003179083,0.0006057463,0.0004973332,0.00049323885,0.0003798883,0.00037557713,0.0013481837],"category_scores_gemma":[0.000486124,0.00012911456,0.00013328955,0.000951116,0.00046681333,0.00036169536,0.00059459213,0.00017234907,0.00056376186],"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.00050198246,0.00022619554,0.839043,0.00016779537,0.00014122498,0.033963878,0.00060668646,0.0034100069,0.04425791,0.005091023,0.0025821736,0.07000805],"study_design_scores_gemma":[0.00014890215,0.0005240216,0.822574,0.00003899901,0.0001951167,0.08232284,0.0011654701,0.021779926,0.028849777,0.016895937,0.025452629,0.000052440726],"about_ca_topic_score_codex":0.001153936,"about_ca_topic_score_gemma":0.0020513085,"teacher_disagreement_score":0.0013481837,"about_ca_system_score_codex":0.00021612039,"about_ca_system_score_gemma":0.00011099863,"threshold_uncertainty_score":0.0045101643},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013604673,0.31965718,0.0059162173,0.11808053,0.13663232,0.00023783615,0.0031477283,0.0010405761,0.4016831],"genre_scores_gemma":[0.06725012,0.07543251,0.002000962,0.015405055,0.019385662,0.00014294892,0.0010113842,0.00045973033,0.8189116],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99949753,0.000047110276,0.000023116343,0.00015192336,0.0001805942,0.000099732264],"domain_scores_gemma":[0.9995443,0.000054876633,0.0000442748,0.000021362208,0.00010458941,0.00023041588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005303905,0.0009352508,0.00037074074,0.0014800641,0.0013711276,0.0015976112,0.0005627198,0.0012670628,0.08820632],"category_scores_gemma":[0.001816031,0.0003061161,0.00024571034,0.000616042,0.00073757156,0.0017616258,0.0021859165,0.0017842785,0.057751484],"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.00007825051,0.000022472275,0.00097330444,0.00031016194,0.00000776704,0.0010629122,0.0004052319,0.000105976374,0.0010720101,0.010194847,0.7721772,0.21358992],"study_design_scores_gemma":[0.0000016274106,0.000011737118,0.0005881424,0.000067144334,0.0000018878708,0.001234729,0.000045356064,0.000018886785,0.00029594745,0.0004846334,0.99724436,0.0000055142714],"about_ca_topic_score_codex":0.0018271643,"about_ca_topic_score_gemma":0.0030109046,"teacher_disagreement_score":0.08820632,"about_ca_system_score_codex":0.0011684402,"about_ca_system_score_gemma":0.0013471332,"threshold_uncertainty_score":0.29507953},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76441103,0.0042391545,0.0002376948,0.011949954,0.00008278284,0.00012986286,0.20171179,0.00015979302,0.017078],"genre_scores_gemma":[0.8584958,0.006116813,0.0009525631,0.006734185,0.0001518246,0.0005224787,0.11700565,0.0001097013,0.009910995],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99563223,0.0010589472,0.0007700971,0.0005590486,0.001411712,0.0005679623],"domain_scores_gemma":[0.97383356,0.006375927,0.008378308,0.0010988807,0.0063753463,0.003937961],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0033479133,0.00023991184,0.0005364883,0.0056086057,0.001975838,0.0032961627,0.0016763725,0.0011421421,0.009058389],"category_scores_gemma":[0.014365427,0.00046107065,0.0004228181,0.025556685,0.0007840695,0.0035877032,0.0027455466,0.0014800247,0.0045371284],"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.000301627,0.00031974178,0.7821899,0.0009204523,0.000097758886,0.0003074884,0.007827782,0.00015958055,0.00023665586,0.0011731621,0.17497073,0.03149519],"study_design_scores_gemma":[0.000019368279,0.000031374326,0.92426825,0.0003345977,0.000026962092,0.0001723169,0.018727366,0.00022363504,0.00016179,0.00016712217,0.055837322,0.000029913499],"about_ca_topic_score_codex":0.21343999,"about_ca_topic_score_gemma":0.3306469,"teacher_disagreement_score":0.99670386,"about_ca_system_score_codex":0.005937119,"about_ca_system_score_gemma":0.00486681,"threshold_uncertainty_score":0.42439526},"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":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97920334,0.0002001825,0.0016481018,0.0000689747,0.000030915722,0.000021371603,0.016985448,0.00006447274,0.0017771597],"genre_scores_gemma":[0.94389176,0.00017566288,0.005223797,0.00017820994,0.00004027689,0.0000772472,0.048964392,0.00005970948,0.0013889248],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9996618,0.000027315782,0.000026772712,0.0001645812,0.00006553453,0.000053945958],"domain_scores_gemma":[0.99889475,0.00024154481,0.0002998023,0.00016134253,0.00020475003,0.00019784055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005895767,0.00020570279,0.0002505202,0.0010209141,0.00077115983,0.0005293561,0.0002805577,0.00035412563,0.0036483936],"category_scores_gemma":[0.0008714848,0.0000972624,0.00038779483,0.0012506464,0.0002575775,0.00024591823,0.00031304738,0.00050836604,0.0006212312],"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.0015677031,0.00017291504,0.77567285,0.00037306413,0.00038172177,0.00070075016,0.0015503841,0.0004316258,0.17897886,0.00046286383,0.002977433,0.03672975],"study_design_scores_gemma":[0.000013890503,0.000040916148,0.9900129,0.000013461352,0.00005313786,0.00023489412,0.00014518393,0.00017686829,0.0030210142,0.00007245388,0.0062058377,0.000009544017],"about_ca_topic_score_codex":0.007441699,"about_ca_topic_score_gemma":0.018754814,"teacher_disagreement_score":0.007441699,"about_ca_system_score_codex":0.00043257806,"about_ca_system_score_gemma":0.00025989016,"threshold_uncertainty_score":0.014796793},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12779327,0.0022499752,0.5083483,0.0057916907,0.0019438738,0.00031936873,0.013329073,0.04516333,0.2950612],"genre_scores_gemma":[0.7588963,0.00060981343,0.1901696,0.000735331,0.0001686058,0.00029312432,0.0071489546,0.0038114595,0.03816675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996804,0.0001516901,0.000006700014,0.00005531446,0.000067614725,0.000038366506],"domain_scores_gemma":[0.9993332,0.00029302083,0.000018493525,0.00021759019,0.000075260796,0.000062454594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006448126,0.0006977531,0.0005533854,0.00044774052,0.0007842212,0.0009759844,0.0020466626,0.0013294695,0.030569535],"category_scores_gemma":[0.003499244,0.00033128302,0.00063842064,0.0006934237,0.000661804,0.0015760837,0.001475889,0.0012931598,0.0034373295],"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.0006363918,0.00017468526,0.0026297148,0.00032848492,0.00013539515,0.00022502066,0.00018175971,0.55352974,0.0021285205,0.22661059,0.13704759,0.07637214],"study_design_scores_gemma":[0.0001248505,0.000026666326,0.00015460899,0.000023550932,0.000014573835,0.000030731855,0.00002827751,0.87981987,0.0017326884,0.09194375,0.026088137,0.000012277985],"about_ca_topic_score_codex":0.00782819,"about_ca_topic_score_gemma":0.011695043,"teacher_disagreement_score":0.030569535,"about_ca_system_score_codex":0.00087305147,"about_ca_system_score_gemma":0.0011841553,"threshold_uncertainty_score":0.10226524},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013647665,0.00003996615,0.0002052146,0.00023989983,0.000040754294,0.000085217864,0.99620396,0.0003769922,0.00144319],"genre_scores_gemma":[0.0013167809,0.00003336904,0.00071077625,0.00007588963,0.0000080834225,0.00037789726,0.99631363,0.000043390395,0.0011202089],"study_design_codex":"not_applicable","study_design_gemma":"qualitative","domain_scores_codex":[0.9971156,0.0010031688,0.0003805294,0.0004606927,0.00069042516,0.00034964294],"domain_scores_gemma":[0.9899249,0.003475117,0.00094175537,0.0024949382,0.002476023,0.00068724615],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003470961,0.0013612146,0.0008752167,0.003227797,0.0010997473,0.0021536548,0.00286609,0.0019258215,0.036260787],"category_scores_gemma":[0.016263418,0.0006491492,0.0012114651,0.0050367517,0.00043528748,0.0016799035,0.0028850536,0.0020816796,0.05265557],"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.00011791088,0.0000705135,0.0025792497,0.0005568752,0.000020390871,0.000022747574,0.00013647594,0.000207294,0.000071692404,0.00050586846,0.9915364,0.0041745137],"study_design_scores_gemma":[0.00073610974,0.00009977765,0.036082566,0.0006068158,0.00005063323,0.00011639552,0.0014919883,0.0017121022,0.0006645011,0.0017987514,0.95654285,0.00009759578],"about_ca_topic_score_codex":0.03874306,"about_ca_topic_score_gemma":0.08858929,"teacher_disagreement_score":0.99890023,"about_ca_system_score_codex":0.0021748513,"about_ca_system_score_gemma":0.0027207693,"threshold_uncertainty_score":0.12130439},"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":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74404883,0.0008378303,0.11104778,0.0010945807,0.00013279999,0.00035924814,0.12981917,0.0037191247,0.008940672],"genre_scores_gemma":[0.72835004,0.00031800792,0.13600694,0.00092311244,0.00004653737,0.0010653135,0.13070203,0.0009780842,0.0016098844],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793196,0.0008221185,0.00012556813,0.0006111359,0.0004153931,0.000093728064],"domain_scores_gemma":[0.98716974,0.008777255,0.0009938348,0.0017061861,0.000985226,0.00036778537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072285603,0.00068274164,0.0007117718,0.0012698391,0.0010456314,0.001371703,0.0012988348,0.0010953132,0.005170205],"category_scores_gemma":[0.014120043,0.00036640436,0.0014466895,0.0021453388,0.0009741028,0.0011740219,0.0008773725,0.0015000949,0.002311899],"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.0026343013,0.0010323315,0.536928,0.004954882,0.0034887393,0.0008018894,0.0032466766,0.1014141,0.12005043,0.02074416,0.07661577,0.1280887],"study_design_scores_gemma":[0.000553264,0.00077509927,0.50070006,0.00040572655,0.00063090137,0.001075197,0.0021608076,0.31253183,0.04090392,0.042131383,0.09782108,0.00031065737],"about_ca_topic_score_codex":0.0027728993,"about_ca_topic_score_gemma":0.005394017,"teacher_disagreement_score":0.0072285603,"about_ca_system_score_codex":0.000811729,"about_ca_system_score_gemma":0.0005871492,"threshold_uncertainty_score":0.03822869},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012762267,0.00036128782,0.028642002,0.0019509571,0.0012997024,0.00074009737,0.19121239,0.026042992,0.73698825],"genre_scores_gemma":[0.040595394,0.0006400608,0.064672954,0.00044822835,0.00017122258,0.00049493095,0.2009913,0.009277173,0.6827088],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997478,0.000035449317,0.000014586797,0.000054057156,0.00010805901,0.000039983668],"domain_scores_gemma":[0.99843556,0.0003005233,0.000045901903,0.00047468662,0.0004125585,0.0003307195],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005734078,0.0004633154,0.000323258,0.0038559348,0.0013746409,0.0019539786,0.0009989461,0.0005658209,0.5369716],"category_scores_gemma":[0.0017791274,0.00040339556,0.00046016133,0.003693832,0.0003593065,0.0017605621,0.0022628168,0.0007766322,0.19816084],"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.0000938898,0.000042304313,0.0015201462,0.00015127119,0.0000061881337,0.00021378543,0.00039720596,0.00019198871,0.0014032357,0.0029499999,0.8897205,0.10330955],"study_design_scores_gemma":[0.000018378303,0.000011828618,0.004753342,0.000047530786,0.000006066003,0.00019955827,0.00029727374,0.00029494573,0.0009815003,0.0009839145,0.9923913,0.000014328908],"about_ca_topic_score_codex":0.020404287,"about_ca_topic_score_gemma":0.04980983,"teacher_disagreement_score":0.5369716,"about_ca_system_score_codex":0.00084841007,"about_ca_system_score_gemma":0.0011054034,"threshold_uncertainty_score":0.6604538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034701375,0.0014516417,0.0031126498,0.0065278076,0.012399746,0.00020204959,0.001452857,0.0035274033,0.9678559],"genre_scores_gemma":[0.007058695,0.00039744086,0.0008590062,0.0014331107,0.0015271534,0.000045269015,0.00035246921,0.0010332935,0.9872936],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996716,0.00004667535,0.000009477943,0.000051064842,0.00015526774,0.00006587367],"domain_scores_gemma":[0.9992023,0.000102190104,0.000032312193,0.00007632241,0.0002188999,0.00036792737],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006567474,0.0007989412,0.00043927014,0.00066792336,0.0015220714,0.002768916,0.0007022671,0.00094912713,0.6506736],"category_scores_gemma":[0.0028956449,0.00017983551,0.00045093003,0.000363889,0.00054731284,0.0029109656,0.0023759617,0.0016195725,0.4800932],"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.000086210865,0.000025303583,0.00016858145,0.00010489145,0.000004414621,0.0001395336,0.00018254442,0.000032957494,0.0009311741,0.00246808,0.93002987,0.06582648],"study_design_scores_gemma":[0.0000060477255,0.000022613436,0.00038837333,0.000033261917,0.000001209454,0.00012631866,0.00016875115,0.0000308671,0.00025893678,0.00027310185,0.99868566,0.0000049601845],"about_ca_topic_score_codex":0.0005408584,"about_ca_topic_score_gemma":0.0019456882,"teacher_disagreement_score":0.34932637,"about_ca_system_score_codex":0.0004411167,"about_ca_system_score_gemma":0.0003650406,"threshold_uncertainty_score":0.49827164},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010058581,0.0052315425,0.036724944,0.007845847,0.01086232,0.0021211545,0.015275407,0.019062547,0.8928177],"genre_scores_gemma":[0.008322127,0.002077329,0.011810408,0.0018525053,0.0005662827,0.0004509606,0.007894172,0.003250811,0.96377534],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983551,0.0001285267,0.000088000386,0.00032491266,0.0009453392,0.00015811046],"domain_scores_gemma":[0.99774784,0.00024568912,0.00012414671,0.00022470034,0.0013207921,0.00033672957],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013857874,0.0019565616,0.0013559748,0.0020393566,0.0020075573,0.0021517188,0.0019460892,0.0020867276,0.63975257],"category_scores_gemma":[0.0030977128,0.0012826242,0.00087820133,0.0012833482,0.0005295494,0.0024456286,0.0022317478,0.00239573,0.574129],"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.00025226918,0.00010817696,0.00036130103,0.0010299544,0.0000207866,0.00030346445,0.00013722664,0.00029029857,0.10615232,0.0034484349,0.75052154,0.13737428],"study_design_scores_gemma":[0.000040162653,0.000104879255,0.0004358715,0.00010172763,0.000013984394,0.00026789366,0.00009538907,0.00015836235,0.019641822,0.00045471705,0.97866166,0.000023513021],"about_ca_topic_score_codex":0.0025909103,"about_ca_topic_score_gemma":0.0068797627,"teacher_disagreement_score":0.36024743,"about_ca_system_score_codex":0.001263374,"about_ca_system_score_gemma":0.0026688029,"threshold_uncertainty_score":0.51384926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042331702,0.00019439508,0.00071309984,0.0003314681,0.0005163269,0.00017880645,0.0065437783,0.0079785595,0.9831202],"genre_scores_gemma":[0.0010466554,0.0001726414,0.00031337407,0.00012579924,0.00006295889,0.00007139908,0.004825396,0.001739543,0.99164224],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941504,0.000035062025,0.000022356515,0.00007334027,0.00037675694,0.00007748168],"domain_scores_gemma":[0.9978423,0.00015360882,0.000056298508,0.00029238008,0.0012480516,0.00040731547],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006516097,0.0010818106,0.00066070684,0.0022542677,0.0014986071,0.0043148706,0.0013892507,0.0013248734,0.90961355],"category_scores_gemma":[0.0026617835,0.0006799381,0.0005525037,0.0017922625,0.00037689615,0.0041306675,0.0023354192,0.0012394913,0.8968524],"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.000020696967,0.00002107332,0.000076501514,0.000058350284,0.0000010649206,0.000016283779,0.000021512207,0.00003975908,0.00019582052,0.000607604,0.974376,0.024565294],"study_design_scores_gemma":[0.00000615697,0.00000897373,0.00034370623,0.000029593139,0.000001040887,0.000018681576,0.000034527806,0.000044707453,0.00010336332,0.00011412355,0.9992899,0.000005283631],"about_ca_topic_score_codex":0.007788303,"about_ca_topic_score_gemma":0.016197514,"teacher_disagreement_score":0.09038645,"about_ca_system_score_codex":0.00085432327,"about_ca_system_score_gemma":0.0013624344,"threshold_uncertainty_score":0.12892532},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041827103,0.00050628535,0.00084897777,0.0015943364,0.0044425,0.00015842057,0.0014926208,0.0046445737,0.98589396],"genre_scores_gemma":[0.0007176404,0.00019322574,0.00023598458,0.0005569486,0.0003523975,0.000032725005,0.0005351167,0.0010622339,0.99631387],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994425,0.000029665369,0.000015591933,0.00008233192,0.00032170958,0.00010823689],"domain_scores_gemma":[0.99849963,0.00012860331,0.000037778307,0.00014344261,0.000706816,0.00048377362],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00040136755,0.0012204668,0.0010432419,0.0013271897,0.001875134,0.007369651,0.0016822682,0.002159069,0.91941565],"category_scores_gemma":[0.002476392,0.00075271376,0.0010680004,0.0011980553,0.00061665534,0.0041506877,0.00258486,0.0033441687,0.8902395],"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.000025847887,0.000023030556,0.000025225005,0.000049490474,0.0000013643206,0.00003092307,0.000023576396,0.000020022446,0.00022039557,0.0005121292,0.9808373,0.01823064],"study_design_scores_gemma":[0.000009731678,0.000022171016,0.00023775225,0.000042640655,0.0000016776542,0.000045018915,0.000075681935,0.00002574094,0.0001449346,0.00028962066,0.99909806,0.000006985914],"about_ca_topic_score_codex":0.0034562948,"about_ca_topic_score_gemma":0.007953183,"teacher_disagreement_score":0.08058435,"about_ca_system_score_codex":0.0011607513,"about_ca_system_score_gemma":0.00086916157,"threshold_uncertainty_score":0.1149438},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0129558,0.0008249376,0.26404512,0.00042995528,0.0006128031,0.00029493746,0.025291452,0.6729027,0.02264231],"genre_scores_gemma":[0.15339836,0.00075640087,0.42733726,0.0009882706,0.00018752256,0.001317826,0.114453286,0.2858603,0.01570088],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965624,0.0005859591,0.0002505689,0.0010236524,0.0011272833,0.00045011248],"domain_scores_gemma":[0.9965424,0.0009983715,0.00008658025,0.0014602675,0.0007181316,0.00019427035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022758446,0.0036286125,0.0017455526,0.0016909931,0.0010606939,0.0034815625,0.005478381,0.0014717991,0.05210694],"category_scores_gemma":[0.010198363,0.001720666,0.0027283824,0.003184861,0.0010337805,0.0032166003,0.0028427395,0.0033260535,0.034704726],"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.0013898925,0.00025982785,0.0025807216,0.0014142805,0.0004254675,0.00033407353,0.0004883732,0.045831736,0.015904939,0.02284796,0.7865441,0.121978596],"study_design_scores_gemma":[0.0013945749,0.00026089782,0.0029373998,0.00019353016,0.00019121179,0.00044833266,0.00036930045,0.5288127,0.06012823,0.052038584,0.3529687,0.00025647675],"about_ca_topic_score_codex":0.012765682,"about_ca_topic_score_gemma":0.014095857,"teacher_disagreement_score":0.05210694,"about_ca_system_score_codex":0.0016518325,"about_ca_system_score_gemma":0.0026088778,"threshold_uncertainty_score":0.1743151},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024512972,0.0013357432,0.01113277,0.044110395,0.9287632,0.000054470907,0.0015948014,0.0023448009,0.010418559],"genre_scores_gemma":[0.03471738,0.007620253,0.02671808,0.11300537,0.46632642,0.0005385354,0.009166412,0.010488686,0.3314188],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99213177,0.0018450583,0.00069872517,0.0017194826,0.0030366248,0.0005683416],"domain_scores_gemma":[0.9557192,0.011386663,0.0013976987,0.005802071,0.02389897,0.001795433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035327224,0.0020678018,0.0023182991,0.004421595,0.0029715793,0.0045068865,0.0034013789,0.003483754,0.14581555],"category_scores_gemma":[0.072151765,0.0011691571,0.0022845513,0.0032458154,0.0025880225,0.0039197654,0.003797985,0.0065523596,0.089716375],"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.000021036662,0.0000066283037,0.000027143536,0.000087916545,0.000011628066,0.000048617832,0.000018070807,0.00007381376,0.00006832513,0.0029294468,0.9900802,0.006627192],"study_design_scores_gemma":[0.000022546767,0.000021477621,0.0002918343,0.00012636275,0.000033237695,0.0002556047,0.000032713626,0.000643836,0.0005529604,0.0070466646,0.9909375,0.000035285542],"about_ca_topic_score_codex":0.007998362,"about_ca_topic_score_gemma":0.007815812,"teacher_disagreement_score":0.14581555,"about_ca_system_score_codex":0.006010993,"about_ca_system_score_gemma":0.0027548503,"threshold_uncertainty_score":0.4878016},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024512972,0.0013357432,0.01113277,0.044110395,0.9287632,0.000054470907,0.0015948014,0.0023448009,0.010418559],"genre_scores_gemma":[0.03471738,0.007620253,0.02671808,0.11300537,0.46632642,0.0005385354,0.009166412,0.010488686,0.3314188],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99213177,0.0018450583,0.00069872517,0.0017194826,0.0030366248,0.0005683416],"domain_scores_gemma":[0.9557192,0.011386663,0.0013976987,0.005802071,0.02389897,0.001795433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035327224,0.0020678018,0.0023182991,0.004421595,0.0029715793,0.0045068865,0.0034013789,0.003483754,0.14581555],"category_scores_gemma":[0.072151765,0.0011691571,0.0022845513,0.0032458154,0.0025880225,0.0039197654,0.003797985,0.0065523596,0.089716375],"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.000021036662,0.0000066283037,0.000027143536,0.000087916545,0.000011628066,0.000048617832,0.000018070807,0.00007381376,0.00006832513,0.0029294468,0.9900802,0.006627192],"study_design_scores_gemma":[0.000022546767,0.000021477621,0.0002918343,0.00012636275,0.000033237695,0.0002556047,0.000032713626,0.000643836,0.0005529604,0.0070466646,0.9909375,0.000035285542],"about_ca_topic_score_codex":0.007998362,"about_ca_topic_score_gemma":0.007815812,"teacher_disagreement_score":0.14581555,"about_ca_system_score_codex":0.006010993,"about_ca_system_score_gemma":0.0027548503,"threshold_uncertainty_score":0.4878016},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68120694,0.0019462841,0.010229037,0.008407154,0.0022082238,0.09201853,0.04642218,0.0044987057,0.15306287],"genre_scores_gemma":[0.7013617,0.0016635476,0.042216092,0.0038451317,0.00035613222,0.100155815,0.010181834,0.0001783842,0.14004135],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99947804,0.00012723116,0.000026733733,0.000085353495,0.00008092073,0.00020185579],"domain_scores_gemma":[0.99918634,0.00015605154,0.00006511483,0.000050350252,0.000119357224,0.00042275595],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00093226065,0.0006376368,0.0005237098,0.00039759628,0.0011837622,0.00044812888,0.0010818904,0.00076339376,0.094063066],"category_scores_gemma":[0.0019823913,0.0002874465,0.00066498865,0.000271234,0.00042777148,0.00048707647,0.0014217111,0.0008835765,0.0050057196],"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.014998697,0.021719744,0.012105855,0.0043836953,0.0001987113,0.00030192523,0.004085151,0.00075812044,0.0033881324,0.0017755023,0.12465801,0.81162643],"study_design_scores_gemma":[0.052993014,0.04133822,0.29222557,0.0038084295,0.0013387951,0.00027294233,0.00689533,0.0042938627,0.00763854,0.004333708,0.5846226,0.00023899674],"about_ca_topic_score_codex":0.15835209,"about_ca_topic_score_gemma":0.38143018,"teacher_disagreement_score":0.90593696,"about_ca_system_score_codex":0.0030051372,"about_ca_system_score_gemma":0.010565876,"threshold_uncertainty_score":0.3148607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017492402,0.0018249264,0.929453,0.0013660417,0.000536761,0.00019103044,0.00090513955,0.001548679,0.04668207],"genre_scores_gemma":[0.5630744,0.0009358765,0.3810218,0.00069204124,0.00029669682,0.00045525472,0.0021868008,0.00072830514,0.0506088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924976,0.0003244096,0.00002236939,0.00017325523,0.00014414218,0.00008605924],"domain_scores_gemma":[0.99531096,0.0035148356,0.00012961902,0.0004983892,0.00033337862,0.00021290638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012461458,0.0006264207,0.0012966767,0.0012370952,0.0006302014,0.0015936147,0.0017330181,0.0020956893,0.024472259],"category_scores_gemma":[0.008372105,0.00064514886,0.0006739342,0.0017330148,0.001163485,0.0016362866,0.0011514067,0.0016085759,0.0037245543],"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.00019861032,0.00010462047,0.00074180233,0.00014504849,0.00007822287,0.00008011239,0.00003885215,0.8263165,0.00044057783,0.07487711,0.020515345,0.0764632],"study_design_scores_gemma":[0.000026130954,0.000012088103,0.00008120497,0.000011998701,0.000006147625,0.000017249957,0.000006237585,0.97680354,0.00012183231,0.020958532,0.0019497789,0.000005242059],"about_ca_topic_score_codex":0.011362534,"about_ca_topic_score_gemma":0.01576199,"teacher_disagreement_score":0.024472259,"about_ca_system_score_codex":0.0011337731,"about_ca_system_score_gemma":0.00174431,"threshold_uncertainty_score":0.08186787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99973994,0.000051076368,0.000016884145,0.00002175058,8.618196e-7,0.000004359946,0.000047546928,6.00689e-7,0.000116862015],"genre_scores_gemma":[0.99968255,0.00007524935,0.000033351054,0.000012594139,0.0000010471886,0.000004270596,0.00006422199,6.784643e-7,0.00012598014],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9997023,0.000060380633,0.000030376408,0.00007401864,0.00004686604,0.0000860616],"domain_scores_gemma":[0.9993162,0.00007826311,0.00029996657,0.000023410003,0.0000944136,0.00018768078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026228483,0.00024909142,0.00022613232,0.00036276452,0.00060447457,0.00070759887,0.00018612263,0.00020795704,0.0012943582],"category_scores_gemma":[0.000768821,0.0003834687,0.00015583458,0.0007558301,0.00040663453,0.00032132104,0.0003229832,0.00030963423,0.00010453481],"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.00003763913,0.00004816409,0.9961434,0.000030072299,0.000013524651,0.00044688195,0.0015857995,0.00003130366,0.0005536724,0.000020760228,0.000054355944,0.0010344682],"study_design_scores_gemma":[0.0000022431927,0.000103661245,0.99210256,0.000020627644,0.000006523523,0.0004012489,0.0069249603,0.00011995536,0.00008936696,0.000021385995,0.00020377287,0.0000037256723],"about_ca_topic_score_codex":0.048981305,"about_ca_topic_score_gemma":0.045402475,"teacher_disagreement_score":0.048981305,"about_ca_system_score_codex":0.0008102603,"about_ca_system_score_gemma":0.00073967304,"threshold_uncertainty_score":0.09739244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013841753,0.0004219985,0.0003228239,0.00058076944,0.000054786742,0.000517285,0.9942194,0.00021139473,0.0035330602],"genre_scores_gemma":[0.017012404,0.004646442,0.010250366,0.00584163,0.000554723,0.018515693,0.8978677,0.0016372994,0.04367375],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99843544,0.00042255226,0.00051357364,0.00025609642,0.00025143783,0.00012078752],"domain_scores_gemma":[0.9575524,0.03541329,0.002729414,0.0006479883,0.0031404684,0.00051648903],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002562316,0.0012616807,0.002756858,0.004343186,0.00076258485,0.0021395008,0.0021975865,0.0020083885,0.8807177],"category_scores_gemma":[0.05463948,0.00072341494,0.0021544665,0.007445289,0.0003289645,0.0027386267,0.0014734961,0.0011966366,0.1131568],"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.00048659818,0.000046739693,0.0008763212,0.0360011,0.00015877596,0.000057081936,0.000061612314,0.00041370137,0.000032114687,0.0011951732,0.94415355,0.016517255],"study_design_scores_gemma":[0.017268337,0.000381275,0.016577562,0.08130509,0.0014665353,0.00072572177,0.00054483174,0.002334695,0.00040785602,0.02780793,0.8509292,0.0002510262],"about_ca_topic_score_codex":0.013650075,"about_ca_topic_score_gemma":0.023179337,"teacher_disagreement_score":0.8807177,"about_ca_system_score_codex":0.0020666863,"about_ca_system_score_gemma":0.0033408913,"threshold_uncertainty_score":0.17014176},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15705681,0.00064637413,0.7826139,0.0006001094,0.00023347756,0.00013872495,0.0006609021,0.012224346,0.04582538],"genre_scores_gemma":[0.4886512,0.0002660032,0.4999283,0.00015924819,0.000035920293,0.000118332486,0.0012720098,0.0008630952,0.008705787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965787,0.000038553397,0.000011284665,0.00007265405,0.00016434827,0.000055284472],"domain_scores_gemma":[0.9996711,0.00007421063,0.00001758996,0.000105128216,0.00010773802,0.000024207246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024692074,0.0006486189,0.0005468886,0.000572063,0.00047724976,0.00094256474,0.0011226626,0.0006182059,0.0049864245],"category_scores_gemma":[0.0011125501,0.00029310363,0.00050010154,0.0011941525,0.0004124728,0.0008979869,0.0007728681,0.0006974755,0.0012777762],"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.00046901745,0.00016036144,0.003202965,0.00026565252,0.000099969635,0.0002064671,0.00034361042,0.55213964,0.054138985,0.049032636,0.023560785,0.31637987],"study_design_scores_gemma":[0.000032009462,0.000037198795,0.00050450244,0.000005695802,0.000007110667,0.00004847854,0.000037743535,0.9711354,0.011374128,0.007959739,0.008850885,0.000007144218],"about_ca_topic_score_codex":0.012230786,"about_ca_topic_score_gemma":0.015779562,"teacher_disagreement_score":0.012230786,"about_ca_system_score_codex":0.0013262496,"about_ca_system_score_gemma":0.0011275106,"threshold_uncertainty_score":0.024319172},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16120785,0.00096438493,0.8115552,0.0009485547,0.00017234463,0.0004972859,0.0010999771,0.01729177,0.0062625874],"genre_scores_gemma":[0.5072429,0.0002756221,0.48659742,0.000228854,0.00004824338,0.00035304346,0.0021514902,0.0005289459,0.002573449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700695,0.00053747126,0.00024586514,0.0009065141,0.0008804959,0.00042276617],"domain_scores_gemma":[0.9982973,0.00058012677,0.00012284628,0.00043297064,0.0004067278,0.00016001928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020353913,0.0009253787,0.0014459388,0.00093181,0.0011931219,0.0020916038,0.00310974,0.0008327235,0.002253116],"category_scores_gemma":[0.0036884628,0.00045903365,0.0013457175,0.001857106,0.00066369795,0.0030533094,0.0018589293,0.0011281343,0.0005044583],"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.0022456902,0.0011000924,0.0077155307,0.0007536093,0.0003183863,0.00036272712,0.000663933,0.53693694,0.040098242,0.05525318,0.033194326,0.32135734],"study_design_scores_gemma":[0.00016257283,0.00015495435,0.0005609937,0.0000058916685,0.000033267224,0.00011711123,0.00021668823,0.97393,0.009064585,0.012285355,0.003449231,0.000019400582],"about_ca_topic_score_codex":0.010197179,"about_ca_topic_score_gemma":0.009300685,"teacher_disagreement_score":0.010197179,"about_ca_system_score_codex":0.0017507903,"about_ca_system_score_gemma":0.0038129303,"threshold_uncertainty_score":0.020275652},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016915377,0.00020695437,0.73043746,0.00028745882,0.00007125497,0.00022119754,0.0023131275,0.2416365,0.007910685],"genre_scores_gemma":[0.17600805,0.0004348315,0.77079016,0.00067868247,0.00007609314,0.000464978,0.012686849,0.023896296,0.014964047],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99886346,0.00017326094,0.00009615158,0.00030287958,0.00046012606,0.0001041831],"domain_scores_gemma":[0.9982681,0.00042826968,0.00008685344,0.0008814209,0.00025072866,0.000084524174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011655665,0.0017920817,0.0006934174,0.00075351796,0.000472024,0.0019704942,0.002165011,0.0006532095,0.012527348],"category_scores_gemma":[0.0033293257,0.0007997314,0.0010538081,0.0010495121,0.0007616836,0.0039249277,0.0024541402,0.0012786564,0.0053677266],"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.0011511894,0.00042738582,0.0055417153,0.0011018647,0.00025942095,0.00035841696,0.00085051695,0.047259662,0.062466785,0.04885659,0.11640494,0.7153215],"study_design_scores_gemma":[0.0002569253,0.0003202741,0.0021097066,0.000078543366,0.00011591475,0.00038495322,0.00030230614,0.6471446,0.16371584,0.04032483,0.14509855,0.00014756784],"about_ca_topic_score_codex":0.005083986,"about_ca_topic_score_gemma":0.005949898,"teacher_disagreement_score":0.012527348,"about_ca_system_score_codex":0.00074643147,"about_ca_system_score_gemma":0.0014638053,"threshold_uncertainty_score":0.041908145},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023707433,0.0005563134,0.97011,0.00046680094,0.00004875126,0.00017616413,0.0005218844,0.0024694228,0.0019431907],"genre_scores_gemma":[0.33643606,0.0009468614,0.65721774,0.00015724823,0.00011626525,0.00020705619,0.001598171,0.0003898231,0.002930676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971968,0.0006121177,0.00026326932,0.00062737934,0.0011257924,0.0001746743],"domain_scores_gemma":[0.9955006,0.0019877094,0.0005338553,0.0011565819,0.00062393886,0.00019717227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023464977,0.00062963046,0.0007285144,0.0021467847,0.0010212254,0.0029625923,0.0023720022,0.0007337421,0.0017725561],"category_scores_gemma":[0.011403875,0.0005842229,0.00065890275,0.0024390125,0.00094069954,0.00557188,0.002843794,0.0014131892,0.00048961554],"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.0005173728,0.00016136601,0.006861487,0.0004942186,0.00010909171,0.00043654625,0.0011087663,0.3229171,0.024796985,0.23736337,0.012948953,0.3922848],"study_design_scores_gemma":[0.000014431114,0.000047340644,0.0008602286,0.00004425791,0.000020956739,0.0001965817,0.0002373203,0.91320103,0.0124301305,0.06139113,0.011519302,0.000037274654],"about_ca_topic_score_codex":0.0043817083,"about_ca_topic_score_gemma":0.004558227,"teacher_disagreement_score":0.0043817083,"about_ca_system_score_codex":0.0018556206,"about_ca_system_score_gemma":0.0015800963,"threshold_uncertainty_score":0.013463557},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8511785,0.0007654047,0.12732647,0.0029430473,0.00027046705,0.00076942996,0.0059726723,0.0047879103,0.0059859874],"genre_scores_gemma":[0.7878579,0.00042561503,0.2025423,0.00026839992,0.0000910045,0.00023585015,0.005765341,0.00030837482,0.0025052268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770457,0.0006146614,0.00014328002,0.00055944343,0.00070971006,0.00026830874],"domain_scores_gemma":[0.9912005,0.0052562994,0.00039144227,0.0011225801,0.0013026367,0.000726533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028366176,0.00078875804,0.0007148059,0.0019959032,0.0015497517,0.0017042924,0.002346048,0.0015499671,0.0013552294],"category_scores_gemma":[0.0092872055,0.000381579,0.0011109489,0.004192655,0.0010684131,0.002928778,0.0012420724,0.0017029649,0.00041412778],"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.0017761592,0.0030995084,0.048542164,0.0011844934,0.00048086673,0.006956282,0.0023432411,0.64150167,0.026485585,0.02476726,0.04298397,0.19987886],"study_design_scores_gemma":[0.00010049501,0.00018884713,0.0066107423,0.000017520666,0.00003793317,0.00048213778,0.0009728145,0.9603525,0.01079191,0.013176057,0.0072317915,0.000037148813],"about_ca_topic_score_codex":0.016588246,"about_ca_topic_score_gemma":0.019915871,"teacher_disagreement_score":0.016588246,"about_ca_system_score_codex":0.0013450205,"about_ca_system_score_gemma":0.0011435836,"threshold_uncertainty_score":0.032983363},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7945775,0.009599352,0.017262759,0.019346798,0.00012542107,0.00007031856,0.04085473,0.0009615051,0.11720164],"genre_scores_gemma":[0.9496327,0.0017102737,0.003723936,0.00028856908,0.000027661143,0.00003283852,0.004616229,0.00014181095,0.039825927],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990465,0.00013091152,0.000044850367,0.00021107255,0.0003399828,0.00022654628],"domain_scores_gemma":[0.9898336,0.0035430212,0.0009503778,0.00034397843,0.0046333885,0.0006956511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017443448,0.00019122571,0.00046965378,0.006602438,0.0024529765,0.004122619,0.0010541169,0.0007542051,0.015423399],"category_scores_gemma":[0.009300698,0.00040091728,0.0007233921,0.0094578415,0.0014986935,0.0013737181,0.00086045125,0.0017756359,0.00090505485],"study_design_candidate":"observational","study_design_consensus":"observational","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.00022235776,0.00004652467,0.5388718,0.00025603338,0.00044917222,0.00032739705,0.008341725,0.023806518,0.001009343,0.2760142,0.04264656,0.10800837],"study_design_scores_gemma":[0.000013317659,0.000020973788,0.888318,0.00017080826,0.000092607,0.00009167084,0.0038166796,0.023864627,0.00049951277,0.01017991,0.07285733,0.00007459954],"about_ca_topic_score_codex":0.983558,"about_ca_topic_score_gemma":0.9874888,"teacher_disagreement_score":0.9707185,"about_ca_system_score_codex":0.029281503,"about_ca_system_score_gemma":0.026836151,"threshold_uncertainty_score":0.21245319},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022102203,0.0007954865,0.00071301043,0.0285564,0.0062381346,0.000838244,0.04880886,0.0030546463,0.908785],"genre_scores_gemma":[0.0022138283,0.00027804764,0.0003124263,0.0019839483,0.00038855543,0.00018786572,0.008058222,0.0003841724,0.986193],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977018,0.00024083702,0.00010391209,0.0002012814,0.0012732225,0.00047896325],"domain_scores_gemma":[0.9842255,0.001430688,0.00041360347,0.001659085,0.006051332,0.0062197954],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002923194,0.0008205695,0.00096209755,0.003168371,0.0023470058,0.0040381504,0.002339351,0.002213656,0.756529],"category_scores_gemma":[0.017798495,0.00063791097,0.00066115597,0.0022958957,0.0006677149,0.0024218915,0.0032437118,0.0025346822,0.56112236],"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.000024425863,0.000027284465,0.00014077082,0.000017093455,0.0000019480337,0.0000146859975,0.000018296116,0.000008025198,0.000029607967,0.00071123353,0.98365307,0.015353741],"study_design_scores_gemma":[0.00004751045,0.000059117163,0.002464878,0.00008110955,0.0000048514107,0.000057072757,0.00014713216,0.000053656433,0.00010058874,0.00067327206,0.99630225,0.000008412614],"about_ca_topic_score_codex":0.025062107,"about_ca_topic_score_gemma":0.0756932,"teacher_disagreement_score":0.756529,"about_ca_system_score_codex":0.0027443003,"about_ca_system_score_gemma":0.007307986,"threshold_uncertainty_score":0.3472818},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08967594,0.008475302,0.10277633,0.19411093,0.001007287,0.000064671505,0.0002065196,0.00009587929,0.6035872],"genre_scores_gemma":[0.94451916,0.0043799076,0.010669433,0.0088414205,0.0012332845,0.00010408205,0.00011766033,0.00008072037,0.030054329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99634546,0.0018048133,0.00009528178,0.0006739684,0.0006601191,0.0004203841],"domain_scores_gemma":[0.98959,0.008351325,0.00039672913,0.0007634114,0.00044009963,0.00045838227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00418751,0.0001895337,0.0006732088,0.00094055035,0.006484871,0.008882876,0.001233335,0.0051708524,0.009952361],"category_scores_gemma":[0.015249294,0.00029655703,0.00071425945,0.0018861028,0.021065088,0.013550926,0.004028977,0.0077711255,0.001141756],"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.0000014870706,0.0000043995788,0.000072167604,0.0000042480224,8.0932557e-7,0.000007431419,0.00017112227,0.0002757288,0.000010899452,0.99686146,0.0014227501,0.0011673927],"study_design_scores_gemma":[0.0000018464167,0.0000020139807,0.00006130181,0.0000125014485,0.0000014464275,0.0000090077965,0.0002336847,0.00091878517,0.000027098682,0.99021506,0.008515175,0.0000021005853],"about_ca_topic_score_codex":0.0060867234,"about_ca_topic_score_gemma":0.004862484,"teacher_disagreement_score":0.009952361,"about_ca_system_score_codex":0.004939963,"about_ca_system_score_gemma":0.0040377383,"threshold_uncertainty_score":0.03584206},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022228623,0.0014117085,0.0016059509,0.011227051,0.0019411077,0.000118381184,0.004569273,0.0009075193,0.9559905],"genre_scores_gemma":[0.07819901,0.0008542066,0.001506065,0.0010405568,0.00029725183,0.000015755437,0.0036591045,0.000331492,0.91409653],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934787,0.000022610073,0.000005503047,0.000050808085,0.00041960468,0.00015358758],"domain_scores_gemma":[0.9994398,0.000045399076,0.0000148971385,0.000042800588,0.00021189172,0.00024522858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005452987,0.00035589127,0.0002990761,0.00096625893,0.0037099835,0.003303369,0.00083312835,0.0014380559,0.11749501],"category_scores_gemma":[0.0015070122,0.00021938725,0.00039698294,0.0013433862,0.0006505595,0.0010301454,0.0012469705,0.0013959697,0.023812396],"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.00013608391,0.000038636943,0.001476222,0.000041296833,0.000014315397,0.00031362104,0.00012886549,0.00054361427,0.00083125435,0.020221846,0.9193597,0.056894533],"study_design_scores_gemma":[0.000011467362,0.000012622595,0.003996015,0.000014657387,0.0000033530287,0.000044653316,0.00022181874,0.00051228615,0.00032220833,0.0019625926,0.99288964,0.0000086906275],"about_ca_topic_score_codex":0.625573,"about_ca_topic_score_gemma":0.90081084,"teacher_disagreement_score":0.37442702,"about_ca_system_score_codex":0.008070385,"about_ca_system_score_gemma":0.008876279,"threshold_uncertainty_score":0.7532642},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012400111,0.0033495503,0.0026899765,0.02166556,0.0120668765,0.000047985308,0.007436343,0.0011768314,0.9503268],"genre_scores_gemma":[0.022819312,0.0046627703,0.00279962,0.0029397488,0.0045692082,0.000097311975,0.0076722936,0.0015275308,0.9529122],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973018,0.0002870431,0.00011008424,0.00043447805,0.0014307125,0.00043588915],"domain_scores_gemma":[0.99564445,0.0006863004,0.00019484547,0.0009139827,0.0016452519,0.00091516273],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023603353,0.0019813757,0.0013275367,0.005478648,0.003187699,0.009181739,0.0020215213,0.003201357,0.38789767],"category_scores_gemma":[0.011370529,0.00043523088,0.0013207789,0.0045856615,0.0018202637,0.0045000287,0.0029419356,0.003993128,0.29024073],"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.000056045184,0.000043585682,0.00017128562,0.00006215789,0.000011566536,0.000053303535,0.000015883043,0.0003030661,0.00006928608,0.05328567,0.9069158,0.03901244],"study_design_scores_gemma":[0.000030411955,0.000012956799,0.00042634757,0.00011475219,0.000014693547,0.00007383149,0.000044831533,0.0009615408,0.0005832587,0.08001059,0.9177052,0.00002159488],"about_ca_topic_score_codex":0.011892005,"about_ca_topic_score_gemma":0.016819354,"teacher_disagreement_score":0.38789767,"about_ca_system_score_codex":0.005425886,"about_ca_system_score_gemma":0.0036510848,"threshold_uncertainty_score":0.8730897},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9989969,0.00023725163,0.00003286399,0.000093934264,0.0000025103182,0.000038180897,0.00013799254,5.8128865e-7,0.0004598541],"genre_scores_gemma":[0.9980475,0.0007235721,0.00017246914,0.00007211461,0.0000026704465,0.00004815065,0.00012834076,0.00000197988,0.00080330065],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99964714,0.00007997304,0.000019633408,0.000043247062,0.000045979832,0.00016402565],"domain_scores_gemma":[0.99966097,0.000057444187,0.000081864826,0.000014808199,0.000073217554,0.000111702335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004604127,0.00024769414,0.0003586597,0.0013735887,0.0048671262,0.0010379016,0.0005859366,0.0003591524,0.001565671],"category_scores_gemma":[0.0015910987,0.00045105047,0.00021390326,0.0022926072,0.0010697881,0.00051405054,0.0014025323,0.00037105771,0.000172752],"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.00013345458,0.00014325236,0.57593757,0.00040595848,0.000043068063,0.003334361,0.3983736,0.00013358919,0.0019158829,0.0005566901,0.0015047829,0.017517822],"study_design_scores_gemma":[0.0000065366185,0.00007915448,0.68407714,0.00009015258,0.000015954845,0.0005372448,0.3125153,0.00007264136,0.00010692659,0.000074749514,0.0024121262,0.000012108255],"about_ca_topic_score_codex":0.8409567,"about_ca_topic_score_gemma":0.9198828,"teacher_disagreement_score":0.15904331,"about_ca_system_score_codex":0.0041639004,"about_ca_system_score_gemma":0.004280578,"threshold_uncertainty_score":0.31995988},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98889893,0.00033158046,0.0072516478,0.00020266304,0.00001540122,0.000019738593,0.0009491368,0.000060404578,0.0022704643],"genre_scores_gemma":[0.9868896,0.00021321101,0.010127667,0.000029031737,0.000016818794,0.0000137261695,0.002146696,0.000010416926,0.00055285037],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99968123,0.00007343295,0.000014912636,0.00009276256,0.000092349816,0.000045333418],"domain_scores_gemma":[0.99771786,0.0010295031,0.00061827025,0.00022693044,0.00020457004,0.00020293394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006411209,0.00016595126,0.00031870397,0.0022173147,0.00079075055,0.0005034963,0.0003904529,0.00027873536,0.0011358244],"category_scores_gemma":[0.002712962,0.00018526248,0.00021809812,0.0030371693,0.0003670356,0.00043829222,0.0003522755,0.0003007207,0.00017170215],"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.0014131612,0.00019579666,0.7511545,0.0002645022,0.00044526858,0.0010873855,0.0006474401,0.008959572,0.06783953,0.0105352765,0.004439986,0.15301767],"study_design_scores_gemma":[0.00012249044,0.00030352199,0.89435613,0.00003383058,0.00014025609,0.0008510958,0.0006428677,0.06208068,0.022326076,0.010672833,0.008406911,0.00006320884],"about_ca_topic_score_codex":0.00782018,"about_ca_topic_score_gemma":0.018698778,"teacher_disagreement_score":0.00782018,"about_ca_system_score_codex":0.00046580654,"about_ca_system_score_gemma":0.00053249544,"threshold_uncertainty_score":0.015549362},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005743843,0.0021568744,0.00042227178,0.002936512,0.0027793525,0.000065443564,0.0077509466,0.00054853107,0.9775963],"genre_scores_gemma":[0.0024242038,0.0003585889,0.000090861875,0.00012740468,0.000036984493,0.0000036913364,0.00039687104,0.000053751235,0.9965076],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999696,0.000012070846,0.000007760801,0.00007652312,0.00010082795,0.000106860265],"domain_scores_gemma":[0.9996586,0.000021728512,0.000013327137,0.000027422604,0.00013351277,0.00014545678],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029157317,0.00075839355,0.0005277185,0.0010961561,0.0038114744,0.0023182814,0.0009657071,0.0013627354,0.58333546],"category_scores_gemma":[0.000704412,0.00030856568,0.00040509793,0.0016974168,0.0006944371,0.0007420834,0.0013711074,0.0019930026,0.28758883],"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.00020436189,0.000074642805,0.0017108483,0.000091947775,0.000015826503,0.0007105052,0.00018335872,0.00042165685,0.0006673375,0.01049582,0.82835567,0.15706801],"study_design_scores_gemma":[0.000012564071,0.000022644246,0.003033628,0.00005413708,0.0000060318494,0.00017737766,0.00019346138,0.000080582744,0.00025588975,0.00080211187,0.9953518,0.000009806114],"about_ca_topic_score_codex":0.26944238,"about_ca_topic_score_gemma":0.61061937,"teacher_disagreement_score":0.58333546,"about_ca_system_score_codex":0.004527185,"about_ca_system_score_gemma":0.0053506587,"threshold_uncertainty_score":0.59432137},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017967245,0.10484778,0.0027200119,0.07511823,0.10567119,0.00075905834,0.017134437,0.0015677424,0.67421436],"genre_scores_gemma":[0.03398747,0.028458351,0.0030659086,0.011026814,0.016789695,0.00043430572,0.014562051,0.0019317062,0.88974375],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9862905,0.0011363142,0.0009227616,0.0010291024,0.009338076,0.0012833416],"domain_scores_gemma":[0.9509933,0.005704944,0.0023919037,0.002215804,0.02816574,0.0105283065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012252276,0.0011493153,0.0011188224,0.018577559,0.0045497837,0.011055173,0.0023363382,0.0021352689,0.22599079],"category_scores_gemma":[0.026156804,0.00051260344,0.000929149,0.025897825,0.0011688564,0.0036636875,0.0048743165,0.0020965503,0.096649595],"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.000064723,0.00005995823,0.0011367357,0.00077194744,0.000017765502,0.0001086101,0.00028297465,0.000109655855,0.00038805665,0.002075296,0.90231097,0.09267322],"study_design_scores_gemma":[0.000007833476,0.000016321961,0.0022256603,0.000354842,0.0000039523297,0.00006989383,0.00020311215,0.000035968067,0.00010570354,0.0002458241,0.9967236,0.0000073335086],"about_ca_topic_score_codex":0.0062074102,"about_ca_topic_score_gemma":0.015868928,"teacher_disagreement_score":0.22599079,"about_ca_system_score_codex":0.011535509,"about_ca_system_score_gemma":0.010118775,"threshold_uncertainty_score":0.75601447},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9168464,0.003782368,0.00077571225,0.007864813,0.00011567318,0.00004881236,0.0005635153,0.000035568857,0.069967195],"genre_scores_gemma":[0.9787027,0.0020026679,0.00023367125,0.00058119243,0.00013503442,0.000027002736,0.000289813,0.000013102376,0.018014878],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9956726,0.00148609,0.00024124968,0.0003026685,0.0016211813,0.0006761493],"domain_scores_gemma":[0.94647723,0.022318583,0.02206754,0.0015860844,0.0042080693,0.0033425104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046423944,0.00038681767,0.0004341485,0.0013150051,0.0012659167,0.0063331844,0.0007461001,0.0017802014,0.017542712],"category_scores_gemma":[0.027102351,0.00025149834,0.00038128757,0.001454306,0.0014743676,0.0026882195,0.0018689674,0.0019206301,0.0025025131],"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.0014269182,0.0009292575,0.788615,0.00069510314,0.00059119664,0.0013653756,0.008800911,0.0020895794,0.0014741191,0.032749005,0.01991424,0.14134932],"study_design_scores_gemma":[0.00011293599,0.00096604467,0.8949801,0.00086790684,0.00031048764,0.000689445,0.02074272,0.0031582725,0.0023441766,0.00821445,0.06751554,0.00009787898],"about_ca_topic_score_codex":0.010849348,"about_ca_topic_score_gemma":0.010585895,"teacher_disagreement_score":0.017542712,"about_ca_system_score_codex":0.0021592705,"about_ca_system_score_gemma":0.0014583513,"threshold_uncertainty_score":0.058686256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084877457,0.00075979717,0.0014165217,0.010085832,0.020533623,0.00032765095,0.018448211,0.0029235885,0.944656],"genre_scores_gemma":[0.0015051793,0.00014296918,0.00033668504,0.0012974764,0.0006394572,0.000063050014,0.0038013584,0.00049239467,0.99172133],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977902,0.00017060645,0.000052949996,0.00023126129,0.0012201783,0.0005348734],"domain_scores_gemma":[0.99515355,0.000443225,0.00011372662,0.0005582965,0.0021723,0.0015588774],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017646763,0.0015905525,0.00154309,0.0030331193,0.003262369,0.0068785865,0.0019625048,0.0040643024,0.75454056],"category_scores_gemma":[0.00715182,0.00055224466,0.0014721482,0.0015010315,0.0009659938,0.0020635182,0.0030354431,0.0034975822,0.69331414],"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.00007956189,0.000042988133,0.000056967514,0.00003656848,0.0000040338673,0.000017961765,0.0000037434586,0.00008395976,0.0001287849,0.0010955187,0.9875451,0.010904751],"study_design_scores_gemma":[0.0000502954,0.000058141726,0.00074761006,0.00007424747,0.000007364112,0.000022216369,0.000033369615,0.00050639646,0.00041606143,0.0039285435,0.9941402,0.000015552374],"about_ca_topic_score_codex":0.013477821,"about_ca_topic_score_gemma":0.042173024,"teacher_disagreement_score":0.75454056,"about_ca_system_score_codex":0.0041115438,"about_ca_system_score_gemma":0.0035362558,"threshold_uncertainty_score":0.35011804},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047034822,0.014581512,0.0038305968,0.13516796,0.0022405447,0.00006739661,0.00012350538,0.00015099702,0.7968027],"genre_scores_gemma":[0.5292504,0.0100176,0.0020659768,0.03092255,0.00062510197,0.000045576173,0.00011397048,0.00016384771,0.426795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983072,0.00056262116,0.000040214567,0.00026658917,0.0003811179,0.00044220992],"domain_scores_gemma":[0.99905735,0.0003254564,0.00007838235,0.00011684706,0.00019530393,0.00022663799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019053412,0.0003333617,0.00029406254,0.0006302798,0.015036554,0.006172077,0.0007463084,0.0029988391,0.02829909],"category_scores_gemma":[0.004027096,0.00022168022,0.00037503024,0.00047517303,0.01713881,0.006768857,0.0061246883,0.0065697744,0.0026568207],"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.00002462471,0.00003166492,0.0012013693,0.0000638731,0.00000619636,0.00035004993,0.034473654,0.00006931825,0.0004386521,0.8559778,0.058154553,0.04920837],"study_design_scores_gemma":[0.000010811009,0.00003553123,0.0012088005,0.00018056366,0.000009200375,0.00043796052,0.021622216,0.00012535363,0.00048473466,0.06795327,0.90791047,0.00002093839],"about_ca_topic_score_codex":0.059396073,"about_ca_topic_score_gemma":0.13853754,"teacher_disagreement_score":0.059396073,"about_ca_system_score_codex":0.0067973933,"about_ca_system_score_gemma":0.0068668276,"threshold_uncertainty_score":0.1181007},"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":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05163837,0.0008913646,0.27874956,0.00094359485,0.00054416177,0.0005086518,0.015547994,0.6336499,0.017526384],"genre_scores_gemma":[0.2077021,0.0012911498,0.5710518,0.0013382199,0.00017192919,0.00092317804,0.119698144,0.08133578,0.01648769],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977343,0.00038712515,0.00018845145,0.00051368825,0.00095908245,0.0002173635],"domain_scores_gemma":[0.9931103,0.002347423,0.00027510623,0.0025640533,0.0014256468,0.0002775205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020267796,0.0023863316,0.0010548909,0.0019161655,0.0008181741,0.0021313871,0.0037013537,0.0010811053,0.021116655],"category_scores_gemma":[0.0122305555,0.0007947429,0.0015262775,0.0032940845,0.0007902454,0.0061864424,0.0027744754,0.0019226538,0.011107014],"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.0024778997,0.0010889327,0.0045276154,0.0034673337,0.000527834,0.0007465691,0.0008330812,0.052648917,0.07733214,0.021155847,0.42963606,0.40555775],"study_design_scores_gemma":[0.00070199155,0.000896677,0.0072971,0.00029648305,0.00018106955,0.0007524636,0.00064163463,0.5713649,0.21675986,0.028394092,0.17239875,0.00031494338],"about_ca_topic_score_codex":0.0043088086,"about_ca_topic_score_gemma":0.006828494,"teacher_disagreement_score":0.021116655,"about_ca_system_score_codex":0.0010442133,"about_ca_system_score_gemma":0.0014987726,"threshold_uncertainty_score":0.07064223},"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":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017052855,0.0012341796,0.32192937,0.0013663494,0.0014392065,0.00039930997,0.15295754,0.4592291,0.05973965],"genre_scores_gemma":[0.025069017,0.001941279,0.22954388,0.0010372082,0.00038090115,0.0014265851,0.49719408,0.116655916,0.12675114],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988642,0.00014010785,0.000100344885,0.00021648982,0.0005633781,0.00011557503],"domain_scores_gemma":[0.9965833,0.0014302015,0.000088691035,0.0008747833,0.00089479575,0.00012823207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010656036,0.0026815354,0.0014022633,0.0020734288,0.00065657304,0.0021117418,0.004074098,0.0015503797,0.2605993],"category_scores_gemma":[0.009900129,0.0015516741,0.0016433351,0.0032062726,0.0006325627,0.003034928,0.0030202414,0.0017974414,0.16087995],"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.00013516693,0.000046917863,0.00019217345,0.00042325034,0.00003342526,0.000031865387,0.000032352138,0.0027241062,0.0007643657,0.0057862448,0.93356997,0.05626015],"study_design_scores_gemma":[0.00049110345,0.00008420577,0.00094090286,0.00026428193,0.000050218063,0.00020541881,0.000026635,0.037455432,0.0042056553,0.027843287,0.9283702,0.00006261533],"about_ca_topic_score_codex":0.013147502,"about_ca_topic_score_gemma":0.01823357,"teacher_disagreement_score":0.2605993,"about_ca_system_score_codex":0.0010453968,"about_ca_system_score_gemma":0.0022549552,"threshold_uncertainty_score":0.8717915},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06527476,0.00095785304,0.9150692,0.0009347984,0.00017535001,0.00033174347,0.0021711884,0.010453507,0.004631539],"genre_scores_gemma":[0.27964255,0.0004271126,0.71009463,0.00019575472,0.00010575463,0.00027608054,0.005374791,0.0008761551,0.003007128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910647,0.00022880263,0.000061992505,0.00026252348,0.00023689553,0.00010332158],"domain_scores_gemma":[0.9962064,0.0015517826,0.00024601613,0.0012588417,0.0005114894,0.00022545113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010557887,0.0010183287,0.0010353674,0.0016582018,0.0012861786,0.0012166046,0.0017377066,0.0008762472,0.003534455],"category_scores_gemma":[0.0062427884,0.000472058,0.0009265283,0.0022361723,0.0006285267,0.0030743347,0.0013232739,0.0008751704,0.0013342167],"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.0007202893,0.0002989109,0.004671962,0.0009615795,0.00018334851,0.00053161994,0.00061333727,0.5032439,0.02956835,0.05457347,0.060147703,0.34448555],"study_design_scores_gemma":[0.00010501432,0.00006208917,0.0010088467,0.000020795145,0.000027125188,0.00024367963,0.00022264502,0.89603555,0.006639746,0.08538274,0.010234036,0.000017783077],"about_ca_topic_score_codex":0.0057750503,"about_ca_topic_score_gemma":0.013511407,"teacher_disagreement_score":0.0057750503,"about_ca_system_score_codex":0.0013277587,"about_ca_system_score_gemma":0.001398115,"threshold_uncertainty_score":0.011823952},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006890791,0.16724543,0.6298361,0.03736848,0.011610072,0.0001699257,0.0014508846,0.0012326863,0.14419556],"genre_scores_gemma":[0.15014961,0.17170353,0.5197944,0.008505977,0.0244155,0.0006790344,0.003964149,0.0019360591,0.118851766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986609,0.00044704013,0.000056595654,0.0003159778,0.00042847925,0.00009099181],"domain_scores_gemma":[0.9981238,0.0011968641,0.0000817356,0.00019998704,0.00030807624,0.000089489484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017492173,0.0015895019,0.0011154748,0.0020205113,0.0012462906,0.0038130737,0.0010852076,0.0021791053,0.016365608],"category_scores_gemma":[0.0059577525,0.0008979637,0.0012590165,0.0033691511,0.0027419392,0.0055971285,0.0017273148,0.004870705,0.0045987354],"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.00003793374,0.00004082929,0.00042059622,0.00045703136,0.00006994457,0.000106171305,0.00030042205,0.012011149,0.00062741,0.722486,0.13133045,0.13211209],"study_design_scores_gemma":[0.000008223602,0.000023301614,0.00058992766,0.00021905283,0.000016966762,0.00018142152,0.00013958054,0.01086443,0.00029903252,0.7922494,0.19538257,0.000026079928],"about_ca_topic_score_codex":0.0032070028,"about_ca_topic_score_gemma":0.0030029707,"teacher_disagreement_score":0.016365608,"about_ca_system_score_codex":0.0031143867,"about_ca_system_score_gemma":0.0010138742,"threshold_uncertainty_score":0.054748416},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059693612,0.0054956763,0.5959621,0.0126345055,0.0031697794,0.0020540277,0.042234626,0.16049783,0.11825791],"genre_scores_gemma":[0.21285774,0.0027321803,0.62679183,0.0027488603,0.000849313,0.0018573094,0.07701849,0.010678002,0.0644662],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953614,0.0011932118,0.00026019497,0.001268748,0.001476811,0.00043967305],"domain_scores_gemma":[0.9893981,0.0039735227,0.00039014625,0.0044619013,0.0013105499,0.00046581443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035378376,0.0034429238,0.003135259,0.0034034615,0.0021970784,0.0049064998,0.0048122797,0.0038993096,0.04850529],"category_scores_gemma":[0.022386216,0.0016699218,0.001976138,0.0063477186,0.0018775872,0.0066746734,0.004988109,0.0037994843,0.03993852],"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.0008858957,0.00085110316,0.0020371354,0.0009264189,0.00026209437,0.0003835116,0.00027459697,0.25067508,0.004364265,0.040791716,0.42922792,0.26932028],"study_design_scores_gemma":[0.0008243298,0.00016357616,0.0009152025,0.00016592788,0.000035930927,0.0002996016,0.00013974422,0.8186625,0.0039961385,0.09049402,0.08422089,0.00008217286],"about_ca_topic_score_codex":0.028172754,"about_ca_topic_score_gemma":0.035878666,"teacher_disagreement_score":0.04850529,"about_ca_system_score_codex":0.0051302887,"about_ca_system_score_gemma":0.006284739,"threshold_uncertainty_score":0.16226631},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9108882,0.0001157601,0.08747843,0.00012452585,0.000008871348,0.000027485838,0.00034912495,0.00011850075,0.00088905316],"genre_scores_gemma":[0.9920223,0.00003680651,0.006839729,0.000015876789,0.0000035232777,0.000026137533,0.00022508264,0.000009145287,0.0008212721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999136,0.00003494785,0.000002812063,0.00002742463,0.00000844906,0.000012773039],"domain_scores_gemma":[0.999348,0.0004813378,0.00007320915,0.000021755679,0.000052237014,0.00002345258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000562113,0.00043106265,0.0003643267,0.00027882628,0.00021128035,0.00032439906,0.00048774225,0.0005751616,0.0008268132],"category_scores_gemma":[0.0013712157,0.00029681047,0.00045683837,0.00016402335,0.00026608794,0.00030701805,0.00014537395,0.00030729917,0.00015196404],"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.00002502883,0.000019891319,0.0062251417,0.000006786243,0.000019556208,0.000023368559,0.000008694499,0.9908929,0.0006137564,0.00017269926,0.000054699856,0.0019375221],"study_design_scores_gemma":[0.0000033910383,0.0000149630605,0.0012266573,6.744048e-7,0.000004791886,0.000008428762,0.000003723595,0.9984365,0.00010405408,0.00016415154,0.00003147318,0.0000011419193],"about_ca_topic_score_codex":0.026391014,"about_ca_topic_score_gemma":0.019191206,"teacher_disagreement_score":0.026391014,"about_ca_system_score_codex":0.0006623034,"about_ca_system_score_gemma":0.00051260105,"threshold_uncertainty_score":0.052474856},"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":"commentary","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015154751,0.38800815,0.027116599,0.5171892,0.017155934,0.00028140546,0.0010695615,0.00044135717,0.033582967],"genre_scores_gemma":[0.39376867,0.28307924,0.124201894,0.1407439,0.049117707,0.0007927248,0.0026563948,0.00041607927,0.005223454],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930321,0.002768644,0.0015169007,0.0003964415,0.0018357824,0.00045008256],"domain_scores_gemma":[0.96554273,0.021788938,0.0019961118,0.0012110139,0.007694549,0.0017667024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010696517,0.0005766326,0.0013969908,0.004875605,0.0017044863,0.0017118019,0.0037461126,0.0027058148,0.002598119],"category_scores_gemma":[0.053944543,0.00038310915,0.0007020208,0.0039219013,0.0037875155,0.0019065393,0.0022044752,0.0055094,0.0012654756],"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.0002062629,0.00008420476,0.04346069,0.00235671,0.00012977596,0.011059634,0.002128834,0.0009367124,0.0008991825,0.050566506,0.28325462,0.6049169],"study_design_scores_gemma":[0.00017008536,0.000121288664,0.06561839,0.0135334935,0.0002140622,0.15056436,0.008216685,0.0036095434,0.00078066956,0.13147707,0.62544376,0.0002506477],"about_ca_topic_score_codex":0.009963188,"about_ca_topic_score_gemma":0.013668293,"teacher_disagreement_score":0.010696517,"about_ca_system_score_codex":0.0016890286,"about_ca_system_score_gemma":0.002936282,"threshold_uncertainty_score":0.05656928},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026538577,0.0072574513,0.012343392,0.002090895,0.0022960696,0.0005197086,0.024049925,0.023685493,0.9251032],"genre_scores_gemma":[0.0051745567,0.0034810603,0.0027815225,0.001144625,0.00020508634,0.00028503683,0.01424765,0.0034885216,0.9691919],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999054,0.000066073226,0.00007255119,0.00028141402,0.0003084742,0.00021749393],"domain_scores_gemma":[0.9979755,0.00049399195,0.00011120867,0.0006928676,0.00038900945,0.00033739247],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0019592266,0.0048424443,0.0033699644,0.004089526,0.0032108892,0.0056968867,0.0036486504,0.006334703,0.9455999],"category_scores_gemma":[0.0038350439,0.0023400155,0.0017123137,0.013178076,0.0018324659,0.012812725,0.006786611,0.0036087155,0.964646],"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.00029231305,0.00021926386,0.0005173063,0.00067716284,0.000050008508,0.00019581438,0.00010435688,0.0008227525,0.0010327323,0.00744452,0.7216255,0.26701838],"study_design_scores_gemma":[0.00006457061,0.000043361695,0.0009084235,0.0003511306,0.0000610175,0.00018966036,0.00009696516,0.0011441851,0.0006146906,0.0026805347,0.993802,0.000043484524],"about_ca_topic_score_codex":0.024300216,"about_ca_topic_score_gemma":0.016456194,"teacher_disagreement_score":0.054400086,"about_ca_system_score_codex":0.0038370756,"about_ca_system_score_gemma":0.0015058045,"threshold_uncertainty_score":0.077595055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026161359,0.006559741,0.012195614,0.00190067,0.002005001,0.00054380734,0.0227284,0.022550747,0.9288998],"genre_scores_gemma":[0.0049530054,0.0032891147,0.0029771733,0.0011601656,0.00020147998,0.0003059899,0.012815565,0.0032984612,0.970999],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990345,0.0000668163,0.000080096404,0.0002951466,0.0003098944,0.00021352667],"domain_scores_gemma":[0.9978477,0.00054645084,0.00012910052,0.0007248976,0.00038350208,0.0003683987],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0021533824,0.00489576,0.0033454006,0.0039005359,0.003167677,0.00583355,0.0038099522,0.0067877905,0.95263225],"category_scores_gemma":[0.004078595,0.002533119,0.0017089865,0.012392425,0.0019475687,0.013544465,0.0066070156,0.0036834807,0.9666148],"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.0002996043,0.00022132999,0.00052516133,0.00072054873,0.000052293268,0.00019600654,0.00010798712,0.0008428871,0.001113895,0.008408795,0.7100134,0.27749807],"study_design_scores_gemma":[0.000072947354,0.00005004379,0.0009619533,0.00034954058,0.000060663155,0.00019238652,0.00009661531,0.0011475695,0.0006242188,0.0027018469,0.9936958,0.00004634862],"about_ca_topic_score_codex":0.022495404,"about_ca_topic_score_gemma":0.0151464045,"teacher_disagreement_score":0.04736775,"about_ca_system_score_codex":0.0039376807,"about_ca_system_score_gemma":0.0015168107,"threshold_uncertainty_score":0.06756437},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17628677,0.0013695353,0.8038667,0.0012170686,0.00008962829,0.00034015736,0.0029887608,0.0056116707,0.008229717],"genre_scores_gemma":[0.46681893,0.0005204579,0.5228622,0.00028825208,0.00006978316,0.00019484275,0.0053487723,0.0007461511,0.0031505884],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974833,0.0005003437,0.00018629096,0.00084450236,0.0005976292,0.0003878662],"domain_scores_gemma":[0.9947883,0.0029959506,0.00062889396,0.0010771052,0.00032846656,0.00018126643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013928297,0.00080608093,0.0018878155,0.0023162013,0.0010065176,0.0021686493,0.0024167635,0.0019891947,0.004509356],"category_scores_gemma":[0.012346521,0.0011111054,0.0012636357,0.0042537567,0.0009662694,0.007871931,0.0032784503,0.0011750651,0.0016518853],"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.00095680583,0.0005143409,0.007484715,0.001631563,0.00031869308,0.00072955835,0.0014292215,0.26108104,0.04290818,0.10846029,0.019052502,0.55543315],"study_design_scores_gemma":[0.0001333784,0.00017590928,0.0014803337,0.00010655577,0.00006650993,0.00058633235,0.00080331403,0.5821307,0.014656893,0.38776702,0.012047488,0.000045656972],"about_ca_topic_score_codex":0.0027741708,"about_ca_topic_score_gemma":0.0036913604,"teacher_disagreement_score":0.004509356,"about_ca_system_score_codex":0.0013521943,"about_ca_system_score_gemma":0.0012370452,"threshold_uncertainty_score":0.01508534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14379355,0.0024145665,0.7475565,0.0012223849,0.0009236162,0.0003362514,0.0022423996,0.076457076,0.025053596],"genre_scores_gemma":[0.4276126,0.0010110888,0.5389875,0.000851319,0.00012598121,0.00040806533,0.0055093523,0.014775419,0.010718661],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986664,0.00027281934,0.00011658122,0.00027687577,0.00044198064,0.000225374],"domain_scores_gemma":[0.9984648,0.00055015413,0.00009125836,0.00046921129,0.00036851864,0.000056033576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007953581,0.0016456681,0.0005150668,0.0007285897,0.00052962615,0.0013952698,0.0019216394,0.0005531979,0.005342045],"category_scores_gemma":[0.004188136,0.00068099616,0.0010573062,0.00081692135,0.0007640753,0.002571235,0.0016649227,0.0021896982,0.0023102302],"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.0009324569,0.00046213815,0.008560331,0.0011495769,0.00021875146,0.00051022385,0.00058942987,0.23460045,0.06921814,0.064771526,0.06584581,0.55314106],"study_design_scores_gemma":[0.00011581531,0.00016136847,0.0010465313,0.000105913045,0.0000795848,0.0000997922,0.00015067325,0.8540697,0.06600476,0.043854587,0.034263432,0.000047717083],"about_ca_topic_score_codex":0.0035005813,"about_ca_topic_score_gemma":0.008575288,"teacher_disagreement_score":0.005342045,"about_ca_system_score_codex":0.0014717045,"about_ca_system_score_gemma":0.0026246596,"threshold_uncertainty_score":0.017870903},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010378659,0.00007272231,0.98545986,0.00014067744,0.00003609297,0.000084032545,0.00016956837,0.0014976029,0.0021608549],"genre_scores_gemma":[0.17493665,0.00013999446,0.817734,0.00026334487,0.00004621426,0.00033856265,0.0011316115,0.00089730823,0.004512292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960476,0.00009383836,0.00002429683,0.00009513764,0.00012407839,0.000057917037],"domain_scores_gemma":[0.9990446,0.00043922104,0.000037490543,0.00026242787,0.00017437672,0.00004190217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000607576,0.0009918748,0.0006054825,0.00074679544,0.0006280725,0.0006395662,0.0013292453,0.0009445524,0.0050479835],"category_scores_gemma":[0.0033907273,0.00038778174,0.0008046098,0.0006354719,0.00067384815,0.0011472086,0.001484463,0.0016125477,0.0015610816],"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.00021064581,0.00016458645,0.0019220363,0.00022929434,0.000092006536,0.0006722607,0.00041114623,0.25604346,0.042454824,0.056480743,0.024732085,0.61658686],"study_design_scores_gemma":[0.000028762075,0.000044426786,0.00051252806,0.000023485827,0.000032618347,0.00020022936,0.000073647345,0.92927074,0.017291455,0.043808587,0.008693645,0.00001998241],"about_ca_topic_score_codex":0.0047100508,"about_ca_topic_score_gemma":0.015172111,"teacher_disagreement_score":0.0050479835,"about_ca_system_score_codex":0.0006269944,"about_ca_system_score_gemma":0.0014678409,"threshold_uncertainty_score":0.016887188},"labels":[],"label_agreement":null}]}