{"meta":{"query_hash":"84c791073ed1","filters":{"topic":"Complexity and Algorithms in Graphs"},"cohort_total":755,"direct_labels_cover":0,"predictions_cover":755,"exported":755,"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/84c791073ed1","api":"https://metacan.xera.ac/api/v1/cohort?topic=Complexity+and+Algorithms+in+Graphs"},"results":[{"id":"W1164874588","doi":"10.1007/s00453-017-0302-8","title":"Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","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":"University of Alberta","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Combinatorics; Rounding; Vertex (graph theory); Complement (music); Physics; Mathematics; Graph; Computer science","score_opus":0.04806380619590854,"score_gpt":0.2791472537857054,"score_spread":0.23108344758979682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1164874588","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.055487692,0.002744415,0.91431063,0.0033960778,0.00059398654,0.00026853711,0.00083888124,0.0015217284,0.020837989],"genre_scores_gemma":[0.27145636,0.0015288168,0.7082384,0.0009131804,0.00093230646,0.0005944782,0.00239921,0.0008917552,0.013045548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99541664,0.0015570725,0.0001913783,0.0009230977,0.0011191106,0.0007926996],"domain_scores_gemma":[0.9849417,0.0098930495,0.00090247876,0.0026576247,0.0008869239,0.0007182128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004594886,0.002571038,0.0030808055,0.002702789,0.0021264248,0.005014834,0.009212186,0.0035906925,0.014918524],"category_scores_gemma":[0.023615604,0.0014305933,0.003107868,0.004800005,0.0022264777,0.011165668,0.005181814,0.0074164886,0.002442936],"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.0021745642,0.0012902593,0.0030869083,0.0009347199,0.0003316243,0.00019713498,0.0006924469,0.33742812,0.0035290248,0.29484513,0.050241746,0.30524832],"study_design_scores_gemma":[0.0002986966,0.00010260296,0.0005735984,0.000060912167,0.00013230016,0.00013016685,0.00015899658,0.71861124,0.0012466694,0.27274674,0.00590211,0.000035944315],"about_ca_topic_score_codex":0.004229603,"about_ca_topic_score_gemma":0.008498042,"teacher_disagreement_score":0.014918524,"about_ca_system_score_codex":0.004487986,"about_ca_system_score_gemma":0.003563244,"threshold_uncertainty_score":0.049907446},"labels":[],"label_agreement":null},{"id":"W119341521","doi":"10.1007/978-3-642-40104-6_23","title":"Lift-and-Project Methods for Set Cover and Knapsack","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo","funders":"","keywords":"Knapsack problem; Cover (algebra); Set cover problem; Hierarchy; Rounding; Mathematics; Lift (data mining); Combinatorics; Approximation algorithm; Set (abstract data type); Function (biology); Discrete mathematics; Computer science; Mathematical optimization; Data mining","score_opus":0.048671866014856124,"score_gpt":0.33168279424756447,"score_spread":0.28301092823270835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W119341521","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.0025661879,0.00039447832,0.9856559,0.00014250448,0.00017919755,0.000044253607,0.00008662073,0.0005574144,0.010373381],"genre_scores_gemma":[0.09190288,0.0011150701,0.86672103,0.00021126526,0.00047380532,0.00049120456,0.00073235,0.0020539204,0.03629846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867153,0.00034692328,0.00006311505,0.00018190876,0.00061332475,0.00012316032],"domain_scores_gemma":[0.99839896,0.00083459646,0.00006071763,0.00038450482,0.00022031937,0.00010092393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014447345,0.00195684,0.0018263847,0.002192613,0.0012128628,0.0020674525,0.0028611314,0.0016668623,0.020021023],"category_scores_gemma":[0.0062600113,0.0011256214,0.002766034,0.002407031,0.001879521,0.0038062532,0.0053656423,0.0058559286,0.0054275505],"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.00009214956,0.00012711497,0.00037543,0.00036807623,0.00008067561,0.000083939216,0.00025538495,0.05834672,0.0015567985,0.6505836,0.017748784,0.27038124],"study_design_scores_gemma":[0.000023445496,0.000036992384,0.00011205058,0.00006129182,0.000028498507,0.000067924724,0.000058109625,0.34051648,0.0009602689,0.6436427,0.014470753,0.000021441121],"about_ca_topic_score_codex":0.0023029135,"about_ca_topic_score_gemma":0.004274136,"teacher_disagreement_score":0.020021023,"about_ca_system_score_codex":0.0012466147,"about_ca_system_score_gemma":0.0012145351,"threshold_uncertainty_score":0.066976964},"labels":[],"label_agreement":null},{"id":"W1205694693","doi":"10.1007/s00037-009-0263-7","title":"The Black-Box Query Complexity of Polynomial Summation","year":2009,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University; University of Toronto","funders":"","keywords":"Combinatorics; Degree (music); Mathematics; Polynomial; Field (mathematics); Discrete mathematics; Finite field; Connection (principal bundle); Physics; Pure mathematics","score_opus":0.05658031693308873,"score_gpt":0.2870780996604076,"score_spread":0.23049778272731886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1205694693","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.2978095,0.007877261,0.5925566,0.025018407,0.0008761364,0.00029887774,0.0031677152,0.0022734636,0.07012196],"genre_scores_gemma":[0.9089138,0.0025446822,0.06860623,0.001164846,0.0013796415,0.00029958144,0.0011228226,0.0008520237,0.015116401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918938,0.0021826697,0.0003010891,0.0015911057,0.0024052842,0.001626009],"domain_scores_gemma":[0.94950885,0.04061231,0.0013406976,0.0056537553,0.0016804109,0.0012038447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006393205,0.0012356986,0.0029671902,0.0014914577,0.0018561117,0.00737528,0.005025268,0.0027705005,0.016760655],"category_scores_gemma":[0.04767619,0.0010331839,0.0014908633,0.003558799,0.0042935438,0.026083715,0.0034481925,0.005392257,0.0023803082],"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.0023984374,0.00040605888,0.0026860735,0.0005989663,0.00015554721,0.00019092824,0.0005367241,0.1323644,0.0054372116,0.721662,0.03943738,0.09412638],"study_design_scores_gemma":[0.00012560791,0.00005221307,0.00070663827,0.000043377237,0.000064658525,0.00012756599,0.00008581996,0.3005866,0.0015911474,0.69387805,0.0027039908,0.000034381465],"about_ca_topic_score_codex":0.0035067445,"about_ca_topic_score_gemma":0.0021168122,"teacher_disagreement_score":0.016760655,"about_ca_system_score_codex":0.0055363225,"about_ca_system_score_gemma":0.0051355627,"threshold_uncertainty_score":0.05606997},"labels":[],"label_agreement":null},{"id":"W121484681","doi":"10.3233/sat190001","title":"Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems","year":2005,"lang":"en","type":"article","venue":"Journal on Satisfiability Boolean Modeling and Computation","topic":"Complexity and Algorithms in Graphs","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":"Semidefinite programming; Semidefinite embedding; Satisfiability; Relaxation (psychology); Mathematics; Quadratically constrained quadratic program; Maximum cut; Linear programming; Large margin nearest neighbor; Mathematical optimization; Combinatorics; Computer science; Discrete mathematics; Quadratic programming; Artificial intelligence","score_opus":0.06582800461354198,"score_gpt":0.267172676926121,"score_spread":0.20134467231257902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121484681","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.0015454305,0.0014058006,0.98095655,0.0010681306,0.00013821412,0.000044690987,0.00011895886,0.00008232829,0.014639861],"genre_scores_gemma":[0.19866063,0.0089383265,0.762917,0.0016833993,0.0015209056,0.0007968961,0.0011051485,0.0005798416,0.023797896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975292,0.0012746131,0.0001062094,0.00028644205,0.00066600717,0.00013751861],"domain_scores_gemma":[0.99394435,0.0046927677,0.00032098556,0.00031775166,0.0005664595,0.00015760887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004291086,0.002241384,0.0014314246,0.0012351654,0.0007449885,0.0025548646,0.0023555625,0.0016581931,0.010047245],"category_scores_gemma":[0.008985318,0.001004769,0.0017368648,0.001996575,0.0020533341,0.004044949,0.0024011414,0.0072023273,0.0018960364],"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.000040233168,0.00014545282,0.0001626799,0.00045915376,0.00006895353,0.00008237411,0.00013716094,0.15098149,0.00088230975,0.7864858,0.013091472,0.047462966],"study_design_scores_gemma":[0.00001676169,0.000026598975,0.00004789318,0.00004684436,0.000010310282,0.000046582816,0.000040458766,0.37510338,0.00044668268,0.6171298,0.007069262,0.000015335254],"about_ca_topic_score_codex":0.0010535356,"about_ca_topic_score_gemma":0.0021153884,"teacher_disagreement_score":0.010047245,"about_ca_system_score_codex":0.0016984508,"about_ca_system_score_gemma":0.0014826067,"threshold_uncertainty_score":0.033611417},"labels":[],"label_agreement":null},{"id":"W121999068","doi":"10.1007/11523468_95","title":"Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"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":"Communication complexity; Upper and lower bounds; Tree (set theory); Omega; Combinatorics; Set (abstract data type); Mathematics; Function (biology); Polynomial; Discrete mathematics; Degree (music); Computer science; Physics","score_opus":0.03634676900953568,"score_gpt":0.2618878529731364,"score_spread":0.2255410839636007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121999068","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.055963296,0.014115675,0.55066454,0.030172579,0.0020477264,0.0004191734,0.0020465276,0.001169274,0.34340113],"genre_scores_gemma":[0.7925718,0.012100925,0.09729433,0.005823941,0.004713042,0.0016704826,0.0023899106,0.0020721846,0.08136352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99393564,0.0014180251,0.00025825782,0.001115212,0.0019504207,0.0013224395],"domain_scores_gemma":[0.9600412,0.030759564,0.001469089,0.0041324906,0.002073061,0.0015244607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005412824,0.0032090568,0.0050470135,0.00541437,0.0065567507,0.013194611,0.00730086,0.0071311863,0.03195556],"category_scores_gemma":[0.032389764,0.002188843,0.0040668123,0.007703557,0.006677718,0.036632486,0.009538888,0.024617227,0.0059531657],"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.00003836139,0.000045917346,0.00009858979,0.00011198163,0.000019441959,0.000020694437,0.00012382936,0.0031192573,0.00027072214,0.9847584,0.005717679,0.005675159],"study_design_scores_gemma":[0.000005919936,0.000004475033,0.000041487925,0.000021847136,0.000008670968,0.000016467227,0.000019342278,0.008857563,0.00014020925,0.98946524,0.0014077479,0.000011020982],"about_ca_topic_score_codex":0.0014467129,"about_ca_topic_score_gemma":0.0018505845,"teacher_disagreement_score":0.03195556,"about_ca_system_score_codex":0.008373458,"about_ca_system_score_gemma":0.0027660092,"threshold_uncertainty_score":0.106902},"labels":[],"label_agreement":null},{"id":"W126880940","doi":"10.1142/9789812562494_0012","title":"DERANDOMIZATION: A BRIEF OVERVIEW","year":2004,"lang":"en","type":"article","venue":"WORLD SCIENTIFIC eBooks","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Computer science","score_opus":0.03608390684753471,"score_gpt":0.25986663170532603,"score_spread":0.22378272485779133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W126880940","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.00429348,0.63801765,0.25019524,0.014150243,0.0030121133,0.00025265434,0.00047100062,0.00060416106,0.089003384],"genre_scores_gemma":[0.09078937,0.7774666,0.07272075,0.009974159,0.019688303,0.001084203,0.0016426968,0.00075058814,0.025883365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957365,0.0012868051,0.00032243461,0.0010291124,0.0012359151,0.00038922983],"domain_scores_gemma":[0.99182665,0.006469936,0.00027941074,0.0006941609,0.0005610758,0.00016887666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046703485,0.0018756775,0.0026169827,0.003981572,0.0015905185,0.0048743007,0.002578822,0.0028269228,0.008386625],"category_scores_gemma":[0.010814051,0.0014966413,0.0019320062,0.006632624,0.0041208323,0.011400364,0.0036638044,0.008233326,0.0045113023],"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.00016590818,0.00018405792,0.0011765353,0.0031166417,0.00009623627,0.00020898685,0.0002513953,0.0137572065,0.0012240345,0.6434478,0.051575005,0.28479606],"study_design_scores_gemma":[0.00006092571,0.00021658879,0.0012298678,0.0009964714,0.00009524165,0.0010194252,0.00012032487,0.014881321,0.001291254,0.53777224,0.44222903,0.000087242675],"about_ca_topic_score_codex":0.0013815594,"about_ca_topic_score_gemma":0.00087645516,"teacher_disagreement_score":0.008386625,"about_ca_system_score_codex":0.0039462615,"about_ca_system_score_gemma":0.0021610106,"threshold_uncertainty_score":0.028632224},"labels":[],"label_agreement":null},{"id":"W1480046334","doi":"10.5555/1496770.1496810","title":"Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures","year":2009,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Tree (set theory); Rank (graph theory); Combinatorics; Mathematics; Satisfiability; Upper and lower bounds; Argument (complex analysis); Discrete mathematics; Exponential function","score_opus":0.017158413943393833,"score_gpt":0.26307868204179413,"score_spread":0.24592026809840029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480046334","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.18666947,0.0015507953,0.7357081,0.0061067706,0.00022133072,0.0005343609,0.0009664461,0.0033970827,0.06484553],"genre_scores_gemma":[0.6645664,0.0011383819,0.31545824,0.001611467,0.00021686549,0.00059893157,0.0014839032,0.0017359211,0.013189908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923509,0.0022577117,0.00039511983,0.0011652106,0.0024445723,0.0013864093],"domain_scores_gemma":[0.9371778,0.050552446,0.0022801799,0.006646485,0.0022245648,0.0011185318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006313362,0.0012217707,0.0012432911,0.0016347364,0.0017624267,0.004687236,0.004201049,0.0020234028,0.015194505],"category_scores_gemma":[0.0459591,0.001322972,0.0028355455,0.0016673052,0.004511379,0.014009197,0.005331118,0.007665327,0.002184889],"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.00085411,0.000533386,0.0026979758,0.0007136888,0.00014299416,0.00026460015,0.00087340875,0.12430041,0.013052664,0.77067816,0.0074426257,0.07844598],"study_design_scores_gemma":[0.00010815053,0.00016338295,0.000533734,0.0001295174,0.00010970467,0.00017439944,0.0001686904,0.3304003,0.01655055,0.64602005,0.005584384,0.00005708069],"about_ca_topic_score_codex":0.0016260265,"about_ca_topic_score_gemma":0.0030877332,"teacher_disagreement_score":0.015194505,"about_ca_system_score_codex":0.005186282,"about_ca_system_score_gemma":0.0035426298,"threshold_uncertainty_score":0.050830662},"labels":[],"label_agreement":null},{"id":"W1482466102","doi":"","title":"Probabilistic optimization in graph-problems","year":2010,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Complexity and Algorithms in Graphs","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":"Probabilistic logic; Null graph; Voltage graph; Graph; Mathematics; Graph property; Vertex (graph theory); Computation; Regular graph; Combinatorics; Mathematical optimization; Discrete mathematics; Line graph; Algorithm","score_opus":0.05702908760854954,"score_gpt":0.34465273981799505,"score_spread":0.2876236522094455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1482466102","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.015114927,0.0015947372,0.9716015,0.0022938321,0.000081450504,0.00008299996,0.00024193525,0.00018573785,0.008802903],"genre_scores_gemma":[0.65165824,0.0044550505,0.3276315,0.0011579598,0.00094764173,0.00064255774,0.0009177805,0.00031953305,0.01226977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556726,0.002240198,0.00017850428,0.000794271,0.00081479724,0.00040501333],"domain_scores_gemma":[0.98460686,0.0131394435,0.00084361684,0.00075064145,0.00038519435,0.00027432706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041732593,0.0017135638,0.0016114747,0.0013059872,0.0010447531,0.00360248,0.0022365118,0.0025369304,0.004846787],"category_scores_gemma":[0.016167399,0.0008338113,0.0021762145,0.0027419417,0.004026406,0.00859537,0.002789491,0.00500815,0.0007155914],"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.000038967337,0.000057675625,0.00031760687,0.00020950363,0.000050078976,0.00006950947,0.000098810495,0.17691714,0.0003575416,0.8117218,0.0019517471,0.008209635],"study_design_scores_gemma":[0.00001795954,0.000029701063,0.000121851706,0.000019837393,0.000013587895,0.000040918334,0.000026900518,0.33281067,0.0001877555,0.6641139,0.00260586,0.000011077917],"about_ca_topic_score_codex":0.0024875435,"about_ca_topic_score_gemma":0.0022484171,"teacher_disagreement_score":0.004846787,"about_ca_system_score_codex":0.0038602287,"about_ca_system_score_gemma":0.0015961151,"threshold_uncertainty_score":0.028008103},"labels":[],"label_agreement":null},{"id":"W1487422852","doi":"10.1007/978-3-540-68891-4_10","title":"Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"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":"Combinatorics; Cover (algebra); Vertex cover; Vertex (graph theory); Mathematics; Hierarchy; Relaxation (psychology); Graph; Semidefinite programming; Edge cover; Discrete mathematics; Mathematical optimization; Biology","score_opus":0.022295581302762667,"score_gpt":0.23279295565428937,"score_spread":0.2104973743515267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487422852","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.35258785,0.002130087,0.5423063,0.0063384008,0.000747208,0.000324361,0.0018613834,0.0021376591,0.091566764],"genre_scores_gemma":[0.935119,0.0008260548,0.044917487,0.0008499463,0.00045553825,0.00027663566,0.0008697446,0.0005772267,0.016108595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99601495,0.0007691682,0.00018621389,0.0008230722,0.0011722404,0.0010343974],"domain_scores_gemma":[0.97933257,0.013340219,0.0012811337,0.003139372,0.0012606138,0.0016461476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00301964,0.0014615629,0.0033727763,0.0019596526,0.002290988,0.004852363,0.003412437,0.0028839891,0.013000376],"category_scores_gemma":[0.02537111,0.0012070357,0.0017320911,0.0022865357,0.003090748,0.0070674983,0.0082370285,0.0070327763,0.0015934494],"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.0009396071,0.00016236813,0.0012372494,0.00045924805,0.00012163316,0.00036532726,0.00043075203,0.115746826,0.0075995727,0.8234808,0.014730455,0.03472607],"study_design_scores_gemma":[0.00008594964,0.00009294338,0.0002944855,0.000064879125,0.000045862456,0.00018650516,0.00016283225,0.30965328,0.00200821,0.6834016,0.0039753253,0.000028176815],"about_ca_topic_score_codex":0.0019325174,"about_ca_topic_score_gemma":0.0017503526,"teacher_disagreement_score":0.013000376,"about_ca_system_score_codex":0.0025025608,"about_ca_system_score_gemma":0.00163892,"threshold_uncertainty_score":0.04349059},"labels":[],"label_agreement":null},{"id":"W1497071043","doi":"10.1007/11496915_5","title":"Disjoint Cycles: Integrality Gap, Hardness, and Approximation","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo; University of Alberta","funders":"","keywords":"Combinatorics; Disjoint sets; Omega; Packing problems; Mathematics; Approximation algorithm; Vertex (graph theory); Conjecture; Upper and lower bounds; Binary logarithm; Undirected graph; Discrete mathematics; Graph; Physics","score_opus":0.030069022523276742,"score_gpt":0.2571625246057706,"score_spread":0.22709350208249385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1497071043","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.19266266,0.027590912,0.5028627,0.032229513,0.0012930335,0.0003054752,0.002226964,0.0011218082,0.2397069],"genre_scores_gemma":[0.84500396,0.01663111,0.09988015,0.0024067098,0.0030530347,0.00053112255,0.0027042325,0.00063372625,0.029155947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971517,0.0005049635,0.00012473788,0.0007889705,0.0010221109,0.00040752976],"domain_scores_gemma":[0.9859812,0.010807997,0.00065261044,0.0015851343,0.00045983001,0.00051325397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023267271,0.0016293739,0.0026086534,0.0021994077,0.0023365903,0.006385851,0.0046999687,0.0034218372,0.009929501],"category_scores_gemma":[0.017339585,0.0015812087,0.0020956595,0.0065391753,0.0060329675,0.020230092,0.005482017,0.010820448,0.0010082748],"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.00032531496,0.00017816729,0.0009915307,0.00056422653,0.00006028675,0.00010434812,0.00043737103,0.01724126,0.00074419327,0.9000229,0.018010966,0.06131934],"study_design_scores_gemma":[0.00002960055,0.0000142136905,0.00015589032,0.00005019966,0.00002674819,0.00011493216,0.00007662656,0.011801721,0.00042163947,0.983355,0.0039446587,0.000008858721],"about_ca_topic_score_codex":0.0014417074,"about_ca_topic_score_gemma":0.0011279989,"teacher_disagreement_score":0.009929501,"about_ca_system_score_codex":0.00423217,"about_ca_system_score_gemma":0.0017410393,"threshold_uncertainty_score":0.03321749},"labels":[],"label_agreement":null},{"id":"W1499475083","doi":"10.1007/3-540-44849-7_26","title":"Nearly Bounded Error Probabilistic Sets","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Ottawa","funders":"","keywords":"Connection (principal bundle); Time complexity; Probabilistic logic; Bounded function; Complexity class; Discrete mathematics; Class (philosophy); Combinatorics; Randomized algorithm; Cryptography; Polynomial; Probabilistic analysis of algorithms; Computer science; Computational complexity theory; Mathematics; Algorithm; Artificial intelligence","score_opus":0.02953993998092934,"score_gpt":0.2593161153289079,"score_spread":0.22977617534797856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499475083","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.022669349,0.0014469526,0.90371364,0.0022112494,0.0003960146,0.00008058755,0.00060509384,0.0009703182,0.06790672],"genre_scores_gemma":[0.6266916,0.002460273,0.28304696,0.0018177968,0.0010408683,0.00056256546,0.00216522,0.0013241494,0.08089063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949443,0.0010892992,0.00020244373,0.000842452,0.0025869338,0.00033454606],"domain_scores_gemma":[0.98044854,0.011899176,0.000814621,0.00487711,0.0013794198,0.0005811566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034539783,0.0014804967,0.0021333394,0.0016763278,0.0017212033,0.0038830948,0.0035654658,0.0025377136,0.01260034],"category_scores_gemma":[0.029786775,0.0013385734,0.0013399088,0.00228727,0.0038895297,0.0072230496,0.00896081,0.006371656,0.0028510697],"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.00012225292,0.000023157296,0.0002460268,0.00010295003,0.000026455467,0.000036427267,0.00008202672,0.03314635,0.00097245467,0.9320892,0.004623964,0.0285288],"study_design_scores_gemma":[0.000010681863,0.000018712582,0.00013807949,0.000025957906,0.000010483992,0.00007231341,0.000016785996,0.07682985,0.0011011718,0.9172256,0.004537552,0.000012814813],"about_ca_topic_score_codex":0.0007777487,"about_ca_topic_score_gemma":0.0006868136,"teacher_disagreement_score":0.01260034,"about_ca_system_score_codex":0.0026398846,"about_ca_system_score_gemma":0.0011157426,"threshold_uncertainty_score":0.042152286},"labels":[],"label_agreement":null},{"id":"W1502382854","doi":"10.1007/978-3-540-73545-8_45","title":"On the Complexity of Finding an Unknown Cut Via Vertex Queries","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Vertex (graph theory); Computer science; Matching (statistics); Time complexity; Binary logarithm; Combinatorics; Computational complexity theory; Graph; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics","score_opus":0.0698119103731919,"score_gpt":0.284960043533053,"score_spread":0.2151481331598611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502382854","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.32301816,0.0089996215,0.55052483,0.02845828,0.0012041429,0.0011096502,0.007912337,0.0064131347,0.07235985],"genre_scores_gemma":[0.7012814,0.0042285337,0.25894693,0.0025210353,0.0018946436,0.0007946869,0.006474464,0.0025997073,0.021258641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.989488,0.002941322,0.0006200516,0.0019954026,0.0030644457,0.0018907377],"domain_scores_gemma":[0.8776904,0.1100176,0.0024234692,0.0059864605,0.0022033367,0.0016787202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062780064,0.0028738342,0.0052975914,0.0031716998,0.0033259096,0.011210682,0.009122796,0.005989243,0.025320517],"category_scores_gemma":[0.05726943,0.0021035902,0.0037479997,0.007971979,0.0058632568,0.02983082,0.0089387195,0.008432069,0.0029888705],"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.0077711614,0.0011305566,0.008348284,0.0021985935,0.00066459423,0.0006450373,0.0016777714,0.44506347,0.007175921,0.2241224,0.07360276,0.22759946],"study_design_scores_gemma":[0.0004713456,0.00015486364,0.0008636615,0.00010270975,0.00024357694,0.00030768,0.00037759502,0.65755695,0.0016085873,0.33578026,0.0024767043,0.00005605383],"about_ca_topic_score_codex":0.013850688,"about_ca_topic_score_gemma":0.012063442,"teacher_disagreement_score":0.025320517,"about_ca_system_score_codex":0.00682358,"about_ca_system_score_gemma":0.0057875183,"threshold_uncertainty_score":0.08470559},"labels":[],"label_agreement":null},{"id":"W1517853613","doi":"10.1007/978-3-540-74915-8_29","title":"Relativizing Small Complexity Classes and Their Theories","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"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":"Oracle; Stack (abstract data type); Hierarchy; Bounded function; Class (philosophy); Function (biology); Limit (mathematics); Constant (computer programming); Computer science; Discrete mathematics; Combinatorics; Mathematics; Artificial intelligence; Programming language; Mathematical analysis","score_opus":0.05651785826671054,"score_gpt":0.26455284292850273,"score_spread":0.20803498466179218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517853613","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.09450606,0.010399657,0.42039323,0.014759753,0.0014908443,0.00025299413,0.00084688124,0.000982898,0.4563677],"genre_scores_gemma":[0.81429183,0.0061528455,0.09760336,0.0023830156,0.0032686538,0.0007618617,0.0013686673,0.0006458028,0.07352404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821955,0.00051769585,0.00010019141,0.00034147516,0.00059031334,0.00023070752],"domain_scores_gemma":[0.99631196,0.00226137,0.00021050544,0.0006952131,0.0002867363,0.00023424886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001869906,0.0010363183,0.0013263412,0.0043082563,0.0035274907,0.004307203,0.002097097,0.0018964137,0.008574667],"category_scores_gemma":[0.005702908,0.000918439,0.001968863,0.0033169533,0.00839348,0.014724095,0.005304078,0.008903041,0.0011348493],"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.0000024858077,0.0000030572166,0.000021990769,0.0000111343725,0.0000021149476,0.000004026823,0.00006985501,0.00013124585,0.000028063443,0.9978472,0.00072401017,0.0011548285],"study_design_scores_gemma":[0.0000032035637,0.0000022741206,0.00004080993,0.0000059794997,0.0000039521065,0.000010483366,0.00002146899,0.00037382412,0.000046972615,0.9961683,0.003319476,0.0000033395067],"about_ca_topic_score_codex":0.001614996,"about_ca_topic_score_gemma":0.0011484589,"teacher_disagreement_score":0.008574667,"about_ca_system_score_codex":0.0032841128,"about_ca_system_score_gemma":0.00089043926,"threshold_uncertainty_score":0.028685093},"labels":[],"label_agreement":null},{"id":"W1519655831","doi":"10.1007/11523468_84","title":"A Better Approximation Ratio for the Vertex Cover Problem","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":114,"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":"Cover (algebra); Combinatorics; Vertex cover; Mathematics; Relaxation (psychology); Vertex (graph theory); Binary logarithm; Approximation algorithm; Discrete mathematics; Graph","score_opus":0.021028523623075977,"score_gpt":0.24140401726281083,"score_spread":0.22037549363973485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519655831","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.19755188,0.030024748,0.59386426,0.028803205,0.007434312,0.00061658653,0.0039090905,0.009596889,0.12819907],"genre_scores_gemma":[0.52712166,0.006783166,0.4115467,0.006125395,0.0062723686,0.0006471101,0.0051065604,0.0044603655,0.031936757],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9874227,0.0038843362,0.00045657085,0.0023632578,0.003751588,0.0021215351],"domain_scores_gemma":[0.96862555,0.019054975,0.00095751527,0.008265772,0.0016703587,0.0014259306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006981922,0.004456515,0.005215267,0.0037794076,0.002350057,0.009643315,0.008944208,0.007045251,0.034346968],"category_scores_gemma":[0.036467727,0.0015613448,0.0042494047,0.0075955614,0.0027174887,0.020591574,0.005182549,0.010167603,0.006915081],"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.0073983986,0.0024521905,0.0031366774,0.0015770219,0.00060244196,0.0004372121,0.0005363638,0.16777481,0.022110326,0.1960667,0.14268757,0.45522028],"study_design_scores_gemma":[0.0009878601,0.0006145087,0.0016340689,0.00021766587,0.0005179066,0.0011648366,0.00023641439,0.6637163,0.008259487,0.29573226,0.026776873,0.00014176073],"about_ca_topic_score_codex":0.003925802,"about_ca_topic_score_gemma":0.004193768,"teacher_disagreement_score":0.034346968,"about_ca_system_score_codex":0.007400372,"about_ca_system_score_gemma":0.0037235958,"threshold_uncertainty_score":0.11490208},"labels":[],"label_agreement":null},{"id":"W1522877504","doi":"10.1007/978-3-540-44400-8_6","title":"On the Complexity of Testing Hypermetric, Negative Type, k-Gonal and Gap Inequalities","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Inequality; Type (biology); Mathematics; Semidefinite programming; Time complexity; Polynomial; Combinatorics; Mathematical optimization; Mathematical analysis","score_opus":0.11658553600442273,"score_gpt":0.27467256941307483,"score_spread":0.1580870334086521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522877504","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.52848774,0.0048964834,0.37327793,0.024610963,0.0006833873,0.00072279904,0.008373952,0.0021035052,0.05684325],"genre_scores_gemma":[0.7793128,0.0020317133,0.19633923,0.0013107017,0.001311936,0.00064408977,0.0079464195,0.00076828897,0.01033481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9887744,0.0039548916,0.00091375137,0.0020766591,0.003096089,0.001184185],"domain_scores_gemma":[0.7678067,0.21477605,0.0044228924,0.0073030647,0.0034039936,0.002287241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009912228,0.0018377631,0.00429504,0.0025963068,0.0026655924,0.01035887,0.0067410073,0.0038036301,0.019041987],"category_scores_gemma":[0.083592094,0.001670243,0.00471241,0.005364983,0.0052872165,0.024820251,0.0066959807,0.007431246,0.001163536],"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.0039382414,0.0009845062,0.027235202,0.0022617064,0.00081498653,0.0009438974,0.0018048001,0.28751728,0.004690378,0.46114755,0.0436502,0.16501123],"study_design_scores_gemma":[0.0002568219,0.00011320035,0.0026866272,0.00008076151,0.00015593324,0.00029185432,0.00041081605,0.37597194,0.0010419524,0.61761886,0.0013162949,0.000054968725],"about_ca_topic_score_codex":0.009836773,"about_ca_topic_score_gemma":0.010712798,"teacher_disagreement_score":0.019041987,"about_ca_system_score_codex":0.005642931,"about_ca_system_score_gemma":0.005607558,"threshold_uncertainty_score":0.06370181},"labels":[],"label_agreement":null},{"id":"W153015188","doi":"10.4086/toc.2006.v002a004","title":"","year":2006,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":67,"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":"Mathematical proof; Rank (graph theory); Combinatorics; Mathematics; Pigeonhole principle; Discrete mathematics; Upper and lower bounds","score_opus":0.013459984448297577,"score_gpt":0.2270239102562561,"score_spread":0.21356392580795852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153015188","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.0031118956,0.00024705796,0.9795999,0.001068456,0.00016552523,0.00018867446,0.00030219927,0.0018191513,0.013497099],"genre_scores_gemma":[0.110196345,0.0006039436,0.8739066,0.0013683358,0.00055006606,0.0005712123,0.0012062422,0.0013572742,0.010239906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9892608,0.0022646312,0.0006502735,0.0022438075,0.0047951024,0.00078545226],"domain_scores_gemma":[0.96824586,0.015069944,0.0017724477,0.010943781,0.0031245593,0.0008434561],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0055968445,0.0018360373,0.001432892,0.003537187,0.0022336196,0.0059706774,0.005680564,0.0017593037,0.022189407],"category_scores_gemma":[0.03118616,0.0017137293,0.0032181449,0.0031090144,0.0036643075,0.014450997,0.00796172,0.010718778,0.006573033],"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.00021930602,0.00025085433,0.0009133919,0.0007596196,0.00021208811,0.00019256334,0.00046584354,0.022688145,0.011854667,0.71643645,0.020485157,0.2255219],"study_design_scores_gemma":[0.00009254463,0.00016204956,0.00053235143,0.000116536845,0.00024276185,0.0005592254,0.00015038518,0.1521418,0.028129432,0.7431599,0.07459775,0.00011535273],"about_ca_topic_score_codex":0.0020515497,"about_ca_topic_score_gemma":0.003370554,"teacher_disagreement_score":0.9778106,"about_ca_system_score_codex":0.0029194287,"about_ca_system_score_gemma":0.003229585,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W1531964914","doi":"10.5555/2095116.2095241","title":"Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling","year":2012,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":82,"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":"Set cover problem; Mathematics; Approximation algorithm; Covering problems; Cover (algebra); Combinatorics; Set (abstract data type); Sampling (signal processing); Matching (statistics); Binary logarithm; Discrete mathematics; Computer science","score_opus":0.036789056638086653,"score_gpt":0.2687750987619836,"score_spread":0.23198604212389692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1531964914","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.110666,0.000501176,0.8827129,0.00051682524,0.000058842183,0.00013910959,0.00033747277,0.0012000204,0.0038677005],"genre_scores_gemma":[0.6848792,0.0003308492,0.3100848,0.00023704873,0.000094739815,0.0002659744,0.0010289919,0.00023642223,0.0028420133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998251,0.00048698927,0.00007512375,0.00042915667,0.0004661456,0.00029161968],"domain_scores_gemma":[0.99623257,0.0020752635,0.00028187322,0.00085876585,0.00028037024,0.00027117127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016678785,0.0011037819,0.0013837162,0.0010421566,0.0006304801,0.0016073694,0.003203109,0.001049487,0.0029456178],"category_scores_gemma":[0.007745108,0.00065491785,0.0012073277,0.001939699,0.00089143077,0.0036143865,0.0021455735,0.0016511227,0.00051732693],"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.00055757264,0.0003621374,0.0034427878,0.00025812612,0.000110419016,0.00017357142,0.00023292191,0.79097754,0.011336168,0.0801278,0.0054203947,0.10700059],"study_design_scores_gemma":[0.000024772804,0.000058284124,0.00022122168,0.000005978941,0.000013110469,0.000049546863,0.00001887778,0.9781424,0.0011242727,0.019721424,0.00061348523,0.000006582727],"about_ca_topic_score_codex":0.0038236189,"about_ca_topic_score_gemma":0.0048116017,"teacher_disagreement_score":0.0038236189,"about_ca_system_score_codex":0.0020297263,"about_ca_system_score_gemma":0.0013437766,"threshold_uncertainty_score":0.014726818},"labels":[],"label_agreement":null},{"id":"W1542059531","doi":"10.1007/11814948_29","title":"Efficiency of Local Search","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Local search (optimization); Heuristic; Constant (computer programming); Guided Local Search; Computer science; Search problem; Mathematics; Mathematical optimization; Algorithm; Discrete mathematics; Combinatorics","score_opus":0.01910925632822527,"score_gpt":0.2489409918068747,"score_spread":0.22983173547864943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542059531","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.16488507,0.0049105724,0.6566375,0.0035586406,0.00028351846,0.00026795082,0.0015811566,0.0032912546,0.16458446],"genre_scores_gemma":[0.8557815,0.0017473587,0.103193425,0.00040812758,0.0003203925,0.00038054754,0.0012365738,0.00153712,0.035394933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99466985,0.0021479651,0.00016797711,0.0007614732,0.0015036945,0.00074901845],"domain_scores_gemma":[0.97082597,0.019978656,0.0007313969,0.006384659,0.0013909932,0.00068828993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039818957,0.0008899583,0.002382278,0.0021449672,0.0012676911,0.0045416555,0.0041889935,0.0023650955,0.028512549],"category_scores_gemma":[0.031570695,0.0007678007,0.0013497338,0.0033697034,0.0022624044,0.007952574,0.003131312,0.0025308416,0.005835273],"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.0016109005,0.0003534893,0.002483446,0.000653202,0.000183756,0.00015994419,0.0004077254,0.21835847,0.0094068125,0.53315574,0.028261904,0.20496458],"study_design_scores_gemma":[0.00014308839,0.00013494481,0.0009055754,0.00007043664,0.00013038861,0.0002881976,0.00011605821,0.6098064,0.007591153,0.37500226,0.005774359,0.000037051508],"about_ca_topic_score_codex":0.0016242608,"about_ca_topic_score_gemma":0.0021968882,"teacher_disagreement_score":0.028512549,"about_ca_system_score_codex":0.003182709,"about_ca_system_score_gemma":0.0032403634,"threshold_uncertainty_score":0.09538394},"labels":[],"label_agreement":null},{"id":"W1543181490","doi":"10.1007/978-3-540-73556-4_6","title":"Searching Cycle-Disjoint Graphs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"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":"Combinatorics; Disjoint sets; Computer science; Graph; Time complexity; Vertex (graph theory); Running time; Mathematics; Discrete mathematics; Algorithm","score_opus":0.033346422014682714,"score_gpt":0.2770830695380785,"score_spread":0.24373664752339577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543181490","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.282511,0.0032552634,0.6168687,0.002629911,0.0003220138,0.00064864615,0.0027360406,0.003398786,0.087629735],"genre_scores_gemma":[0.40888965,0.0017426217,0.5531549,0.00054946047,0.00013677558,0.000327138,0.008673893,0.0008049959,0.02572066],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992126,0.00015919018,0.000052097854,0.00022883937,0.00022673894,0.000120420715],"domain_scores_gemma":[0.9975932,0.0015198847,0.00013094343,0.00042246006,0.00018518395,0.00014829799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006586767,0.0011148608,0.0014725351,0.0026093333,0.0011629137,0.0017616878,0.0032133576,0.001909696,0.021678343],"category_scores_gemma":[0.0063226963,0.0010347669,0.0013162437,0.004330599,0.0010457793,0.0046375124,0.0038738432,0.0014248955,0.0026382855],"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.0009107546,0.00045970935,0.0033792574,0.0019324147,0.00024300437,0.0004137398,0.00078079215,0.11231857,0.017869912,0.14267285,0.050197132,0.66882193],"study_design_scores_gemma":[0.00029556573,0.00033484385,0.0013818325,0.0002741946,0.0002369213,0.00089556666,0.0008629895,0.43272823,0.015094877,0.51523876,0.032590777,0.000065369175],"about_ca_topic_score_codex":0.0018020408,"about_ca_topic_score_gemma":0.0036610167,"teacher_disagreement_score":0.021678343,"about_ca_system_score_codex":0.0010901063,"about_ca_system_score_gemma":0.0009531942,"threshold_uncertainty_score":0.07252133},"labels":[],"label_agreement":null},{"id":"W1551570706","doi":"10.1137/070684008","title":"Algebraic Algorithms for Matching and Matroid Problems","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Matroid; Mathematics; Combinatorics; Algebraic number; Intersection (aeronautics); Weighted matroid; Matching (statistics); Discrete mathematics; Simple (philosophy); Oriented matroid; Matrix (chemical analysis); Exponent; Rank (graph theory); Matrix multiplication; Graphic matroid; Matroid partitioning","score_opus":0.028521770577790092,"score_gpt":0.28192901818277,"score_spread":0.2534072476049799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551570706","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.0063124173,0.000989981,0.97457856,0.0017789977,0.00018405673,0.0001944401,0.00017089023,0.0007764049,0.015014303],"genre_scores_gemma":[0.13095927,0.0022303832,0.8549404,0.00079206144,0.00079594436,0.0006363788,0.000983419,0.00035328715,0.008308799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936231,0.0017974873,0.00046859233,0.0014421304,0.0021657078,0.00050296885],"domain_scores_gemma":[0.99044925,0.0051808544,0.0008457548,0.0024135627,0.00077970634,0.00033083328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026017062,0.0013922818,0.001366529,0.001986297,0.002022164,0.0052194297,0.0044035963,0.0022841687,0.012605817],"category_scores_gemma":[0.015580685,0.0008309532,0.0021282285,0.0044363947,0.0033353262,0.014654914,0.005701094,0.005853811,0.0032559172],"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.00009948654,0.00023831011,0.00029081103,0.0004428412,0.000060467853,0.000038793907,0.00018443615,0.021819923,0.0015416369,0.82854253,0.007486299,0.13925442],"study_design_scores_gemma":[0.00007520257,0.0000482628,0.00010342987,0.000040516392,0.000029019839,0.00013107595,0.00008792524,0.10333159,0.0016026623,0.8769279,0.017592391,0.00003007938],"about_ca_topic_score_codex":0.0011887221,"about_ca_topic_score_gemma":0.0017805251,"teacher_disagreement_score":0.012605817,"about_ca_system_score_codex":0.0028454254,"about_ca_system_score_gemma":0.0025556837,"threshold_uncertainty_score":0.042170644},"labels":[],"label_agreement":null},{"id":"W1554277184","doi":"10.1007/978-3-540-73545-8_49","title":"Priority Algorithms for the Subset-Sum Problem","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Computer science; Key (lock); Greedy algorithm; Algorithm; Approximation algorithm; Power (physics); Simple (philosophy); Order (exchange); Mathematical optimization; Theoretical computer science; Mathematics","score_opus":0.046083054014039206,"score_gpt":0.28702786996586904,"score_spread":0.24094481595182984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554277184","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.014633065,0.0016647681,0.9610617,0.0012762097,0.000594766,0.00019686876,0.00023435375,0.0012503641,0.019087855],"genre_scores_gemma":[0.2360728,0.003108773,0.7284222,0.00077894,0.00150887,0.0005146324,0.0010500182,0.0009777996,0.027565997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979796,0.00054468523,0.00013210365,0.00033321066,0.0006746452,0.00033578515],"domain_scores_gemma":[0.9939434,0.0035416454,0.00027854063,0.0011750037,0.0006294484,0.00043202558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031984916,0.0014290104,0.0023728192,0.001422821,0.002068028,0.0043274793,0.004393613,0.0016401346,0.013178584],"category_scores_gemma":[0.010601914,0.00087899674,0.0014507123,0.0030671952,0.0013144221,0.008238085,0.0031911875,0.0051238528,0.0033797657],"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.0007364012,0.0004345312,0.00036235648,0.00054362183,0.000073881216,0.000046462555,0.0003185956,0.034277298,0.0027661882,0.6296897,0.030103315,0.30064765],"study_design_scores_gemma":[0.0002143398,0.00013321041,0.00013646673,0.00004470739,0.000053935124,0.00011368054,0.0000899746,0.14296737,0.0018203757,0.8434103,0.010986545,0.00002896887],"about_ca_topic_score_codex":0.0014544894,"about_ca_topic_score_gemma":0.0020438635,"teacher_disagreement_score":0.013178584,"about_ca_system_score_codex":0.0022620566,"about_ca_system_score_gemma":0.0023892806,"threshold_uncertainty_score":0.044086754},"labels":[],"label_agreement":null},{"id":"W1554407673","doi":"10.1109/sffcs.1999.814580","title":"Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":228,"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":"Transitive closure; Amortized analysis; Combinatorics; Binary logarithm; Integer (computer science); Algorithm; Mathematics; Shortest path problem; Closure (psychology); Discrete mathematics; Data structure; Time complexity; Computer science; Graph","score_opus":0.022925676934881494,"score_gpt":0.27024134900472824,"score_spread":0.24731567206984675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554407673","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.034357417,0.00068614923,0.9556017,0.0002543257,0.0000554948,0.00023499645,0.0012716062,0.0037318612,0.003806498],"genre_scores_gemma":[0.31064588,0.0006096452,0.6814339,0.0001433202,0.00006334409,0.00036096745,0.0033530234,0.00050470704,0.0028852264],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784875,0.0004254262,0.00021753692,0.00064568216,0.000626916,0.00023574528],"domain_scores_gemma":[0.99357456,0.0022995218,0.0006438242,0.0025921485,0.00065258367,0.00023727336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001191873,0.00095094333,0.0010844014,0.0016948906,0.0014143048,0.0020455827,0.0030684597,0.000753486,0.0034440872],"category_scores_gemma":[0.0072935503,0.0009696217,0.0007884718,0.0026492116,0.0011508245,0.0073634484,0.0028856092,0.001189408,0.0010834293],"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.00070388615,0.00028333656,0.002809973,0.0008715009,0.00020009518,0.000253288,0.00074886787,0.12971608,0.021490078,0.16480635,0.015682342,0.66243416],"study_design_scores_gemma":[0.00022116142,0.00036282008,0.0010970669,0.000093773706,0.00015239014,0.0009840234,0.0003495505,0.55369043,0.030126527,0.36839095,0.04439881,0.00013258851],"about_ca_topic_score_codex":0.0025712324,"about_ca_topic_score_gemma":0.0034111917,"teacher_disagreement_score":0.0034440872,"about_ca_system_score_codex":0.001303924,"about_ca_system_score_gemma":0.0015883483,"threshold_uncertainty_score":0.011521578},"labels":[],"label_agreement":null},{"id":"W1554455557","doi":"10.4230/lipics.ccc.2018.15","title":"Hardness of Function Composition for Semantic Read once Branching Programs","year":2013,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tree (set theory); Branching (polymer chemistry); Bottleneck; Computer science; Argument (complex analysis); Upper and lower bounds; Discrete mathematics; Mathematics; Theoretical computer science; Tree traversal; Combinatorics; Algorithm","score_opus":0.03285590300738768,"score_gpt":0.2686928816787141,"score_spread":0.2358369786713264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554455557","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.46847695,0.0011573527,0.47993022,0.0073795873,0.00013094702,0.00030119295,0.0009816869,0.0044297944,0.03721228],"genre_scores_gemma":[0.87940794,0.0006614231,0.10291629,0.0009074635,0.00032287417,0.00043908917,0.0014305247,0.0014856716,0.012428686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915633,0.0019422893,0.0004148866,0.0018598442,0.0024150794,0.0018044837],"domain_scores_gemma":[0.96742666,0.026462445,0.0012903578,0.0028244022,0.0009848105,0.0010113221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004598851,0.0014292083,0.0025042621,0.0014408112,0.003336552,0.007527177,0.003195694,0.0033210183,0.01592088],"category_scores_gemma":[0.027231624,0.0012837254,0.0039771744,0.0018902824,0.0050929543,0.018488975,0.0054424694,0.008417338,0.0021472047],"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.0025845405,0.0007935484,0.007448905,0.0014145585,0.00025908567,0.0009191177,0.0025447549,0.1667967,0.03079724,0.7006916,0.008696602,0.0770534],"study_design_scores_gemma":[0.00015482823,0.00009184763,0.0007328376,0.000050337898,0.00012270521,0.00030291846,0.0002602168,0.28633818,0.013584223,0.6946903,0.0036213074,0.000050339433],"about_ca_topic_score_codex":0.0018324257,"about_ca_topic_score_gemma":0.0016627572,"teacher_disagreement_score":0.01592088,"about_ca_system_score_codex":0.004582772,"about_ca_system_score_gemma":0.0036092713,"threshold_uncertainty_score":0.053260624},"labels":[],"label_agreement":null},{"id":"W1554467813","doi":"","title":"On Survivable Set Connectivity","year":2015,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Approximation algorithm; Discrete mathematics; Disjoint sets; Time complexity; Path (computing); Node (physics); Set (abstract data type); Undirected graph; Reduction (mathematics); Set cover problem; Graph; Computer science; Computer network","score_opus":0.08869594552647594,"score_gpt":0.2866805072558247,"score_spread":0.19798456172934878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554467813","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.05725436,0.0053559644,0.8780729,0.007424013,0.00042015658,0.00041249197,0.0018063704,0.0010297456,0.048224043],"genre_scores_gemma":[0.5560172,0.014320215,0.39846244,0.0023977358,0.0021635692,0.0011901868,0.0041562263,0.00083127536,0.020461038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687576,0.00077805895,0.00015255228,0.0008083036,0.000910831,0.00047438825],"domain_scores_gemma":[0.9874507,0.00967703,0.00061322254,0.0013579549,0.00056009874,0.00034101517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020411205,0.0023534219,0.001663336,0.0022712639,0.0017350238,0.0035126898,0.0039408915,0.002416683,0.014715686],"category_scores_gemma":[0.0146144135,0.0008536177,0.0018571942,0.0054944805,0.00409835,0.01633979,0.004670883,0.0058330772,0.0016250166],"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.00045889404,0.00018273383,0.001301863,0.0009914634,0.00011131649,0.00031616114,0.000615511,0.23315294,0.0044823275,0.6442579,0.019386675,0.09474223],"study_design_scores_gemma":[0.000058908936,0.00015800293,0.00055222656,0.00017160072,0.00005149087,0.00049977325,0.00020923707,0.2693877,0.0023122055,0.7021196,0.024442943,0.000036297726],"about_ca_topic_score_codex":0.0025965949,"about_ca_topic_score_gemma":0.0019381468,"teacher_disagreement_score":0.014715686,"about_ca_system_score_codex":0.0040095733,"about_ca_system_score_gemma":0.0011590122,"threshold_uncertainty_score":0.049228907},"labels":[],"label_agreement":null},{"id":"W1558278838","doi":"10.1145/3095799","title":"An Average-Case Depth Hierarchy Theorem for Boolean Circuits","year":2017,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Hierarchy; Conjecture; Boolean function; Discrete mathematics; Combinatorics; Converse; Bounded function; Boolean circuit; Random variable; Polynomial; Statistics; Mathematical analysis","score_opus":0.05825755211603171,"score_gpt":0.31813863639199086,"score_spread":0.25988108427595913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558278838","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.16768448,0.0017855256,0.79183626,0.004055237,0.00010747691,0.00014316068,0.0010023005,0.0010792649,0.032306366],"genre_scores_gemma":[0.9303669,0.0011301265,0.060957722,0.001178211,0.00039838886,0.00019669563,0.00047927862,0.00024245694,0.0050501823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949479,0.00069462357,0.00020003764,0.0012095863,0.0017663803,0.0011813946],"domain_scores_gemma":[0.98408,0.010483067,0.0009719752,0.0023762293,0.0011491878,0.0009395973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029599722,0.0008417054,0.0013627198,0.0016760366,0.0017791231,0.003856182,0.0030145596,0.0014765693,0.0071170665],"category_scores_gemma":[0.01796636,0.00092794275,0.002485832,0.0017092174,0.003711142,0.013503395,0.0044964603,0.0051883543,0.00083111075],"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.00037090917,0.00012908013,0.0035030295,0.00030438168,0.00010103769,0.00029641,0.0006944785,0.035574976,0.011697986,0.90604687,0.0053064534,0.035974413],"study_design_scores_gemma":[0.00007050685,0.0000822865,0.0011062968,0.000037930036,0.00009890572,0.00043861385,0.00008158434,0.17724183,0.0068214983,0.8085996,0.0053656413,0.000055312015],"about_ca_topic_score_codex":0.003255289,"about_ca_topic_score_gemma":0.0028796499,"teacher_disagreement_score":0.0071170665,"about_ca_system_score_codex":0.004447208,"about_ca_system_score_gemma":0.0014827754,"threshold_uncertainty_score":0.032266915},"labels":[],"label_agreement":null},{"id":"W1558498035","doi":"10.4230/lipics.icalp.2016.74","title":"Approximating Directed Steiner Problems via Tree Embedding","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"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":"Simons Institute for the Theory of Computing, University of California Berkeley; McGill University; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Combinatorics; Steiner tree problem; Mathematics; Logarithm; Modulo; Approximation algorithm; Binary logarithm; Tree (set theory); Matching (statistics); Time complexity; Discrete mathematics; Hierarchy","score_opus":0.09702573959776858,"score_gpt":0.19240859151308234,"score_spread":0.09538285191531376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558498035","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.06366502,0.0025934482,0.9194499,0.0009566642,0.00017411936,0.00013041696,0.0007501493,0.0011896391,0.01109058],"genre_scores_gemma":[0.45584512,0.0027216943,0.53164595,0.0003463693,0.00017097229,0.0002668599,0.0031703727,0.0003327748,0.005499859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887425,0.0003868839,0.000069552334,0.00025298362,0.0002792678,0.00013711315],"domain_scores_gemma":[0.9971455,0.001891265,0.00024668194,0.000387618,0.00020996248,0.000119115255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095050083,0.0012724397,0.0012632308,0.0012602973,0.00044141323,0.001751803,0.0019658622,0.0016750155,0.004065347],"category_scores_gemma":[0.00831092,0.0006830036,0.001062767,0.0026553178,0.00059683056,0.004614896,0.0019866847,0.0020793364,0.0010932538],"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.0002277222,0.00016123883,0.0018779037,0.0004336381,0.00009634284,0.00015509929,0.00015924411,0.7923874,0.0017376958,0.06016923,0.010157096,0.13243738],"study_design_scores_gemma":[0.000023199478,0.00004663241,0.00015667963,0.000025434221,0.000013313335,0.000057935984,0.00004156303,0.94298047,0.00040484293,0.05363368,0.0026097961,0.0000064715186],"about_ca_topic_score_codex":0.0018336402,"about_ca_topic_score_gemma":0.0027831527,"teacher_disagreement_score":0.004065347,"about_ca_system_score_codex":0.0012150968,"about_ca_system_score_gemma":0.0008696168,"threshold_uncertainty_score":0.013599873},"labels":[],"label_agreement":null},{"id":"W1563601717","doi":"10.1016/s0927-0507(05)12007-6","title":"Submodular Function Minimization","year":2005,"lang":"en","type":"book-chapter","venue":"Handbooks in operations research and management science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":112,"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":"Fleischer; Submodular set function; Minification; Function (biology); Computer science; Mathematics; Mathematical optimization; Algorithm; Philosophy; Linguistics; German","score_opus":0.07223204777223924,"score_gpt":0.32228452341118896,"score_spread":0.2500524756389497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563601717","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.00637136,0.010646104,0.67765015,0.0032911827,0.00088539225,0.00010498471,0.0010640845,0.0012719791,0.2987148],"genre_scores_gemma":[0.105262,0.017678177,0.51773643,0.0019938902,0.0013239149,0.0005101713,0.003931345,0.0017436248,0.3498205],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996697,0.000060131453,0.000013350921,0.00008342337,0.00014588323,0.000027614595],"domain_scores_gemma":[0.99969876,0.00013418114,0.0000150022215,0.00007379179,0.000058507587,0.000019722005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005043948,0.0014662301,0.0013359128,0.00093083386,0.0005423803,0.0013598055,0.0013810884,0.00087246404,0.025649358],"category_scores_gemma":[0.0014949485,0.00052861415,0.00066192326,0.0025341867,0.00083066383,0.0024565812,0.0011162753,0.0029711542,0.0092229815],"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.000031553016,0.00010771724,0.000115224786,0.00036565177,0.000029181994,0.000034567365,0.000064923624,0.0132121695,0.0017817888,0.2739197,0.1470956,0.5632418],"study_design_scores_gemma":[0.00002854877,0.00006753051,0.0005265681,0.0002397839,0.000039027946,0.0003202251,0.000058887174,0.065945566,0.003704424,0.7263052,0.20273146,0.000032749776],"about_ca_topic_score_codex":0.0007497786,"about_ca_topic_score_gemma":0.001808548,"teacher_disagreement_score":0.025649358,"about_ca_system_score_codex":0.0009709649,"about_ca_system_score_gemma":0.00095164665,"threshold_uncertainty_score":0.085805714},"labels":[],"label_agreement":null},{"id":"W1568987606","doi":"10.1007/978-3-540-68891-4_7","title":"A Polynomial Algorithm for Weighted Abstract Flow","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"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":"Path (computing); Generalization; Flow (mathematics); Constructive; Oracle; Mathematics; Flow network; Minimum-cost flow problem; sort; Mathematical optimization; Maximum flow problem; Polynomial; Computer science; Algorithm; Arithmetic","score_opus":0.02192116302009429,"score_gpt":0.24524403444849918,"score_spread":0.2233228714284049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568987606","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.010987143,0.00019048386,0.96843195,0.0005218392,0.00017116225,0.00028471719,0.00053583377,0.0041186656,0.01475824],"genre_scores_gemma":[0.082338355,0.00034653445,0.892857,0.00026105982,0.00016009422,0.0005617243,0.0022535594,0.0013063016,0.019915288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982443,0.00023107193,0.0001339283,0.0005909918,0.00050610286,0.00029367374],"domain_scores_gemma":[0.9980959,0.0007736181,0.00009426019,0.00062294665,0.00029119893,0.00012216602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013629743,0.0020520058,0.0016658661,0.0020156463,0.0016069326,0.0036186462,0.0044835974,0.0021447234,0.02593422],"category_scores_gemma":[0.005015381,0.0012583259,0.0028936546,0.0039006951,0.0015547607,0.01002142,0.005158375,0.004482433,0.0072679943],"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.0005113806,0.00048906996,0.00038310754,0.0005240671,0.00008626322,0.000067281435,0.00029170158,0.03296163,0.007844025,0.32318386,0.03260053,0.6010572],"study_design_scores_gemma":[0.00026581844,0.00009907017,0.00027638845,0.00007470823,0.000106129766,0.0001009262,0.00010080529,0.24255334,0.0054889694,0.7289006,0.021981468,0.000051761264],"about_ca_topic_score_codex":0.0038578364,"about_ca_topic_score_gemma":0.0039618355,"teacher_disagreement_score":0.02593422,"about_ca_system_score_codex":0.0028543428,"about_ca_system_score_gemma":0.0028096668,"threshold_uncertainty_score":0.08675861},"labels":[],"label_agreement":null},{"id":"W1574619705","doi":"10.1007/978-3-540-85363-3_19","title":"A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Alberta","funders":"","keywords":"Induced subgraph isomorphism problem; Combinatorics; Subgraph isomorphism problem; Approximation algorithm; Mathematics; Vertex connectivity; Minimum spanning tree; Metric (unit); Graph; Steiner tree problem; Enhanced Data Rates for GSM Evolution; Constant (computer programming); Graph factorization; Discrete mathematics; Computer science; Line graph; Graph power","score_opus":0.024936180216039577,"score_gpt":0.23986739243886984,"score_spread":0.21493121222283026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574619705","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.20823196,0.0036307657,0.70954674,0.0067775957,0.00074131606,0.0011130976,0.006643191,0.011857233,0.051458154],"genre_scores_gemma":[0.38483906,0.0014111776,0.5856543,0.0012383629,0.0004968515,0.0009349459,0.0069649913,0.0020446107,0.016415667],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743515,0.0004957211,0.00011538316,0.00074338284,0.0007864678,0.00042394883],"domain_scores_gemma":[0.99410444,0.0030520598,0.00040560824,0.0015492899,0.00043721235,0.00045141717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017592316,0.003733795,0.0038466654,0.002222916,0.0015229934,0.003797238,0.0073847566,0.0036316637,0.02348296],"category_scores_gemma":[0.012653607,0.0014518056,0.0028533726,0.006524823,0.0017541243,0.008728427,0.0041081617,0.004167554,0.005701521],"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.004087763,0.001676694,0.003226466,0.002708789,0.0004685434,0.00042316155,0.00092747185,0.31705642,0.020578971,0.108391084,0.10257905,0.43787557],"study_design_scores_gemma":[0.0007153144,0.00033532825,0.0014045892,0.00016141318,0.00030001655,0.0006658097,0.00038312734,0.74807274,0.006262299,0.23107408,0.0105498675,0.00007537127],"about_ca_topic_score_codex":0.006848586,"about_ca_topic_score_gemma":0.009749984,"teacher_disagreement_score":0.02348296,"about_ca_system_score_codex":0.0052137985,"about_ca_system_score_gemma":0.0038157788,"threshold_uncertainty_score":0.078558266},"labels":[],"label_agreement":null},{"id":"W1577738218","doi":"10.1007/3-540-45535-3_3","title":"Edge Covers of Setpairs and the Iterative Rounding Method","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"","keywords":"Rounding; Computer science; Enhanced Data Rates for GSM Evolution; Iterative method; Algorithm; Computer graphics (images); Artificial intelligence; Operating system","score_opus":0.02282914659477234,"score_gpt":0.2737104800340561,"score_spread":0.25088133343928376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577738218","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.05318736,0.0012109358,0.8989344,0.00039897044,0.0001762033,0.000098965975,0.0002308391,0.00048383855,0.04527844],"genre_scores_gemma":[0.5071747,0.0017404167,0.46395957,0.00020242127,0.0002470896,0.00034238969,0.00055725634,0.0004759085,0.025300218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981219,0.00069097435,0.0000726539,0.00020839715,0.00065981416,0.00024620653],"domain_scores_gemma":[0.9968041,0.0020654858,0.00012967044,0.0006422542,0.0002680451,0.00009042619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012135463,0.00076947844,0.0011648578,0.0017250142,0.0014970973,0.002786128,0.0019763883,0.0011844571,0.008930592],"category_scores_gemma":[0.0066248723,0.00078081083,0.0013015486,0.0023312066,0.0016051992,0.004086478,0.0031983047,0.003286274,0.0013514007],"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.00024299056,0.000060392395,0.00035560888,0.00020065036,0.000042505177,0.00010930604,0.00022276748,0.1083696,0.0028367015,0.7668904,0.0054246304,0.11524427],"study_design_scores_gemma":[0.000026227444,0.000047291236,0.00019743975,0.000050128543,0.00003062596,0.00014284489,0.00008019822,0.22762388,0.0030538905,0.7608172,0.007899979,0.000030337824],"about_ca_topic_score_codex":0.0014225717,"about_ca_topic_score_gemma":0.0015231748,"teacher_disagreement_score":0.008930592,"about_ca_system_score_codex":0.0011107494,"about_ca_system_score_gemma":0.00063449907,"threshold_uncertainty_score":0.029875815},"labels":[],"label_agreement":null},{"id":"W1584512166","doi":"10.4230/lipics.fsttcs.2014.199","title":"Lift & Project Systems Performing on the Partial Vertex Cover Polytope","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"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; University of Waterloo","keywords":"Combinatorics; Vertex (graph theory); Vertex cover; Polytope; Mathematics; Cover (algebra); Lift (data mining); Approximation algorithm; Relaxation (psychology); Theory of computation; Linear programming relaxation; Graph; Discrete mathematics; Linear programming; Computer science; Mathematical optimization; Algorithm","score_opus":0.10416338469422035,"score_gpt":0.1982802356524526,"score_spread":0.09411685095823225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584512166","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.2768803,0.00046181798,0.6789999,0.0013154979,0.00014462207,0.00038565445,0.0004902164,0.0010747312,0.040247183],"genre_scores_gemma":[0.82131463,0.00038402327,0.16726047,0.0003151911,0.000104650346,0.00039478362,0.0009213945,0.00029670363,0.009008116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984267,0.00035985868,0.00005633653,0.0002879531,0.00039088356,0.00047835842],"domain_scores_gemma":[0.9962929,0.0020823837,0.0003264974,0.0005686732,0.0002770757,0.000452431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021365464,0.0013113687,0.001374483,0.00084946095,0.0012417578,0.0023143168,0.001978919,0.001234712,0.012458596],"category_scores_gemma":[0.010242152,0.0006053264,0.0016450775,0.001034555,0.001770389,0.002970002,0.0057338094,0.0038274985,0.0012278213],"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.0005119099,0.00017748876,0.0020955862,0.0003268552,0.000056196757,0.00020101527,0.0004138837,0.6703984,0.0032905787,0.25546643,0.0054743974,0.061587248],"study_design_scores_gemma":[0.000028225124,0.00013201294,0.00019775954,0.000024884272,0.000012027259,0.000055881912,0.0000816025,0.9296221,0.001392757,0.06674794,0.0016929811,0.000011825953],"about_ca_topic_score_codex":0.0035069578,"about_ca_topic_score_gemma":0.0029296805,"teacher_disagreement_score":0.012458596,"about_ca_system_score_codex":0.0021674847,"about_ca_system_score_gemma":0.0017162879,"threshold_uncertainty_score":0.04167813},"labels":[],"label_agreement":null},{"id":"W1585955818","doi":"10.1007/978-3-642-13036-6_23","title":"Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":19,"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":"Hierarchy; Quadratic equation; Semidefinite programming; Mathematics; Combinatorics; Quadratic programming; Value (mathematics); Discrete mathematics; Mathematical optimization; Statistics; Geometry; Law; Political science","score_opus":0.02057281308764426,"score_gpt":0.271971755758368,"score_spread":0.25139894267072377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585955818","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.04532507,0.0013551353,0.8535431,0.0022594107,0.0007064188,0.000070816954,0.00017151807,0.00090869266,0.09565981],"genre_scores_gemma":[0.62670994,0.0016756541,0.3176761,0.0008004614,0.001069112,0.0002128714,0.0003581608,0.0010279118,0.05046978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988574,0.00025620344,0.00005038718,0.00025273196,0.00041964158,0.00016373518],"domain_scores_gemma":[0.99750453,0.0012996448,0.0001574304,0.00040188388,0.00038949095,0.00024713064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019506448,0.000989247,0.0014525993,0.0018457894,0.0014880593,0.0024529696,0.00215177,0.0011374354,0.010817372],"category_scores_gemma":[0.00851111,0.00061689835,0.0014964117,0.0026406744,0.0024910376,0.0064021344,0.0053261337,0.005952748,0.0015524515],"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.00004646444,0.000064943735,0.00018608564,0.000074168776,0.000007105364,0.000034314224,0.00018297578,0.008392898,0.0007919497,0.938315,0.0037980373,0.04810609],"study_design_scores_gemma":[0.00001072706,0.000024890143,0.00011672937,0.000024132201,0.000009879441,0.00004898046,0.000051978324,0.05578697,0.0008176492,0.93324137,0.009855145,0.000011506677],"about_ca_topic_score_codex":0.0014436996,"about_ca_topic_score_gemma":0.0015680193,"teacher_disagreement_score":0.010817372,"about_ca_system_score_codex":0.002089832,"about_ca_system_score_gemma":0.0010768238,"threshold_uncertainty_score":0.03618771},"labels":[],"label_agreement":null},{"id":"W1598457899","doi":"10.1145/2540088","title":"Graph Isomorphism is Not AC0-Reducible to Group Isomorphism","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","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","keywords":"Nondeterministic algorithm; Upper and lower bounds; Isomorphism (crystallography); Mathematics; Graph isomorphism; Quasigroup; Combinatorics; Discrete mathematics; Bounded function; Group (periodic table); Group isomorphism; Parity (physics); Graph; Automorphism; Automorphism group; Line graph","score_opus":0.02684005737958888,"score_gpt":0.25856516828993625,"score_spread":0.23172511091034736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1598457899","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.4559388,0.0008636385,0.41166395,0.008029073,0.00058355194,0.0005103652,0.0016429564,0.0056390655,0.11512858],"genre_scores_gemma":[0.9054968,0.00038417324,0.07260496,0.0015980983,0.00034486727,0.0002770843,0.0018733861,0.00070097286,0.016719563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951261,0.000783511,0.00030380193,0.0011281897,0.0014924605,0.0011658196],"domain_scores_gemma":[0.98074603,0.011328996,0.0009653561,0.0051411944,0.0011979477,0.000620575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020184577,0.00092592905,0.0011489962,0.0010784735,0.0022076094,0.004209945,0.0023990965,0.0018260918,0.011543009],"category_scores_gemma":[0.010804867,0.000893698,0.0029405372,0.0013992164,0.003404285,0.009514596,0.0045721214,0.006296098,0.00150385],"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.0011842822,0.00079513236,0.0048668617,0.001007818,0.00019483558,0.0007478555,0.00087711227,0.06570696,0.018601052,0.7951568,0.02186597,0.0889953],"study_design_scores_gemma":[0.000109110595,0.00015481941,0.00085482566,0.000043727792,0.00015446605,0.00043777426,0.00019567239,0.08747629,0.017563067,0.8824291,0.010531958,0.00004905577],"about_ca_topic_score_codex":0.0030662694,"about_ca_topic_score_gemma":0.003560595,"teacher_disagreement_score":0.011543009,"about_ca_system_score_codex":0.0029436718,"about_ca_system_score_gemma":0.003008246,"threshold_uncertainty_score":0.038615227},"labels":[],"label_agreement":null},{"id":"W1600160158","doi":"10.1007/3-540-45061-0_17","title":"Approximating Steiner k-Cuts","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Bell (Canada)","funders":"","keywords":"Rounding; Steiner tree problem; Linear programming relaxation; Combinatorics; Mathematics; Approximation algorithm; Generalization; Discrete mathematics; Maximum cut; Minimum weight; Relaxation (psychology); Minimum cut; Linear programming; Graph; Computer science; Algorithm","score_opus":0.0220167658478086,"score_gpt":0.23985756490570773,"score_spread":0.21784079905789913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600160158","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.24610655,0.0021032982,0.6192592,0.0013990991,0.00043834237,0.00028779428,0.0020273493,0.0024965198,0.12588191],"genre_scores_gemma":[0.4954385,0.0016500736,0.4580839,0.00029421056,0.00020458939,0.0002612352,0.004504153,0.0009827917,0.03858056],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988813,0.00020794777,0.00006131444,0.00024900457,0.00042599966,0.00017437649],"domain_scores_gemma":[0.99751735,0.0010932293,0.00020703461,0.00066315866,0.00031721412,0.00020204548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007759192,0.0015863088,0.0018881586,0.001683009,0.00080274005,0.0030455783,0.002679683,0.0014917211,0.023214046],"category_scores_gemma":[0.0061517125,0.0011028979,0.0012736911,0.0041286866,0.0010430188,0.004272827,0.002894304,0.0027960276,0.004220094],"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.0010390353,0.0003475246,0.0029639895,0.0009963519,0.00020646682,0.0003527032,0.00047444977,0.2709857,0.01136607,0.30975184,0.04298609,0.35852978],"study_design_scores_gemma":[0.00011718568,0.00015338419,0.0011260629,0.00011416952,0.00010240611,0.0006286925,0.00029776848,0.59282255,0.0048350715,0.38432065,0.015450731,0.000031305994],"about_ca_topic_score_codex":0.0017204062,"about_ca_topic_score_gemma":0.003396635,"teacher_disagreement_score":0.023214046,"about_ca_system_score_codex":0.0020418959,"about_ca_system_score_gemma":0.00083915243,"threshold_uncertainty_score":0.07765871},"labels":[],"label_agreement":null},{"id":"W1602585208","doi":"10.1007/s00224-003-1126-2","title":"Asymmetric Communication Protocols via Hotlink Assignments","year":2003,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Complexity and Algorithms in Graphs","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":"McGill University; Carleton University","funders":"","keywords":"Computer science; Protocol (science); Communications protocol; Theoretical computer science; Computer network; Distributed computing","score_opus":0.03579338451336043,"score_gpt":0.28659772980480025,"score_spread":0.2508043452914398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602585208","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.08163315,0.0004194348,0.8784667,0.0020248422,0.00035672076,0.0002697949,0.000260152,0.0012704632,0.03529869],"genre_scores_gemma":[0.85452086,0.00062565034,0.113704234,0.0009032237,0.00062414084,0.0006576888,0.0004200863,0.00045754013,0.028086638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941855,0.00256895,0.0002504755,0.0007673334,0.0013468174,0.00088098383],"domain_scores_gemma":[0.97234964,0.015311142,0.001964613,0.00727717,0.0016003676,0.0014970081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004124307,0.0009258536,0.0015363912,0.0019869825,0.0034825208,0.0059738597,0.003654625,0.0023370641,0.015894163],"category_scores_gemma":[0.02018959,0.0011136709,0.0008627249,0.002813976,0.0038921617,0.01712411,0.009587073,0.0048609637,0.00237498],"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.00037421103,0.00014743314,0.00025644223,0.0001000453,0.000026958613,0.0000699444,0.00038421777,0.019024033,0.0015311063,0.94337964,0.0049505974,0.029755384],"study_design_scores_gemma":[0.000060722887,0.000042130403,0.000088832516,0.000017448474,0.000028006745,0.000062546555,0.000113724534,0.09627722,0.0019144268,0.89666486,0.0047013336,0.00002879479],"about_ca_topic_score_codex":0.00040849633,"about_ca_topic_score_gemma":0.0005962853,"teacher_disagreement_score":0.015894163,"about_ca_system_score_codex":0.0016372879,"about_ca_system_score_gemma":0.0012601682,"threshold_uncertainty_score":0.053171337},"labels":[],"label_agreement":null},{"id":"W1606888841","doi":"10.1007/3-540-44842-x_16","title":"An Algorithm for Determining the Controllers of Supervised Entities at the First and Second Levels: A Case Study with the Brazilian Central Bank","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Calgary","funders":"","keywords":"Backtracking; Subroutine; Computer science; Algorithm; Automation; Process (computing); Computational complexity theory; Mathematical optimization; Mathematics; Programming language","score_opus":0.022599433767272428,"score_gpt":0.2451318771842228,"score_spread":0.2225324434169504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606888841","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.054335173,0.0001463314,0.93710357,0.0002800712,0.000033393728,0.00034177216,0.00045871723,0.003144992,0.004156062],"genre_scores_gemma":[0.21875665,0.00006402859,0.7769377,0.000053076303,0.000012520246,0.00019595475,0.0007971287,0.00014508655,0.0030377693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994289,0.00009980124,0.000048718346,0.00021415557,0.000108385204,0.00009994898],"domain_scores_gemma":[0.99810505,0.0010505251,0.00015305974,0.0001611074,0.00044581728,0.000084476844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012704742,0.0009198898,0.0010918649,0.0018851337,0.0015717436,0.0024578471,0.0019441821,0.0021891273,0.006478539],"category_scores_gemma":[0.0049188356,0.0005360837,0.0007668345,0.0012217718,0.00087651104,0.0016047026,0.0015390972,0.00096342206,0.0010437588],"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.00028206047,0.00025378534,0.012346206,0.00024560798,0.000100075675,0.00029033265,0.00075842347,0.25456995,0.007884936,0.03458001,0.00961017,0.6790784],"study_design_scores_gemma":[0.00006826729,0.000050018578,0.0011270507,0.000024907049,0.000044275144,0.00014220976,0.00032196526,0.9746932,0.0038029132,0.01735841,0.0023496014,0.000017214956],"about_ca_topic_score_codex":0.024898479,"about_ca_topic_score_gemma":0.03340334,"teacher_disagreement_score":0.024898479,"about_ca_system_score_codex":0.0016705475,"about_ca_system_score_gemma":0.004231483,"threshold_uncertainty_score":0.04950708},"labels":[],"label_agreement":null},{"id":"W1636181092","doi":"10.1007/978-3-642-25591-5_4","title":"Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Approximation algorithm; Graph; Function (biology); Bounded function; Linear programming relaxation; Tree (set theory); k-minimum spanning tree; Integer (computer science); Discrete mathematics; Algorithm; K-ary tree; Computer science; Binary tree; Tree structure; Mathematical analysis; Linear programming","score_opus":0.021496381944811557,"score_gpt":0.2290866575978369,"score_spread":0.20759027565302535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636181092","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.082387805,0.005698785,0.8418956,0.0048793596,0.001208953,0.000695507,0.0046797846,0.009076213,0.04947808],"genre_scores_gemma":[0.25201398,0.002052975,0.7084011,0.0013640489,0.0007457461,0.0006424287,0.007000537,0.0035150358,0.024264174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960018,0.00097011315,0.00019061059,0.0007236215,0.0011940325,0.0009198885],"domain_scores_gemma":[0.98460305,0.0083687445,0.00061226607,0.004445281,0.0010925414,0.0008781835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042780116,0.0041538486,0.005075942,0.0030011968,0.002214584,0.006011092,0.009541322,0.004569585,0.04069355],"category_scores_gemma":[0.028163727,0.0020549616,0.0043662484,0.0071434854,0.002504278,0.015647115,0.0056326897,0.0076392917,0.008948022],"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.0026566666,0.0011860494,0.0025731176,0.0014397285,0.0003158402,0.00032025395,0.0007524637,0.3959551,0.004221923,0.19344589,0.113565214,0.2835677],"study_design_scores_gemma":[0.0002377027,0.00011422548,0.00043590984,0.00014211267,0.0001658978,0.00019549832,0.00025084033,0.7790907,0.0013009248,0.21047084,0.007549919,0.000045369983],"about_ca_topic_score_codex":0.011195701,"about_ca_topic_score_gemma":0.031894945,"teacher_disagreement_score":0.04069355,"about_ca_system_score_codex":0.0081831245,"about_ca_system_score_gemma":0.006620229,"threshold_uncertainty_score":0.13613349},"labels":[],"label_agreement":null},{"id":"W1650093283","doi":"10.1016/j.jcss.2016.01.001","title":"Separating OR, SUM, and XOR circuits","year":2016,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"Academy of Finland","keywords":"Electronic circuit; Boolean circuit; Mathematics; Monotone polygon; Modulo; Rewriting; Netlist; Circuit complexity; Discrete mathematics; Boolean function; Arithmetic; Algorithm; Computer science","score_opus":0.04163178691523718,"score_gpt":0.27593742014764816,"score_spread":0.234305633232411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1650093283","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.34310573,0.0035438342,0.5479437,0.0041988944,0.0005470722,0.00020266694,0.0010933818,0.0010784593,0.098286286],"genre_scores_gemma":[0.85177034,0.0019914883,0.11063584,0.0008778329,0.00038797662,0.00015042131,0.00069483765,0.0002818848,0.03320946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990095,0.0002475908,0.000080348706,0.00021630667,0.00024387272,0.00020234907],"domain_scores_gemma":[0.99675083,0.0020843276,0.00029389875,0.0004910616,0.00022241753,0.00015747178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009889577,0.0009327742,0.0008653991,0.001155006,0.001102137,0.003063424,0.0011172215,0.0012322617,0.008560256],"category_scores_gemma":[0.0066747046,0.00060270244,0.0009906003,0.0010944318,0.0017930731,0.0070800516,0.002396732,0.0022361479,0.0011783673],"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.00045382293,0.00006686439,0.00060647214,0.0002007345,0.000050429884,0.00012869424,0.00019237808,0.012471119,0.0049718483,0.901923,0.004078058,0.07485662],"study_design_scores_gemma":[0.000035616024,0.00003308208,0.00016517585,0.00003006986,0.00005364976,0.0001466449,0.000048900492,0.02696686,0.0029692056,0.9649999,0.004532959,0.000017874616],"about_ca_topic_score_codex":0.00094210735,"about_ca_topic_score_gemma":0.0015301687,"teacher_disagreement_score":0.008560256,"about_ca_system_score_codex":0.0010037955,"about_ca_system_score_gemma":0.0012580293,"threshold_uncertainty_score":0.028636932},"labels":[],"label_agreement":null},{"id":"W1700848872","doi":"10.1016/j.jpdc.2008.03.002","title":"Computing all the best swap edges distributively","year":2008,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"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; University of Ottawa","funders":"","keywords":"Computer science; Swap (finance); Computation; Routing (electronic design automation); Distributed computing; Computer network; Algorithm","score_opus":0.0480711353341684,"score_gpt":0.27243581450483123,"score_spread":0.22436467917066283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1700848872","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.3689837,0.0006487458,0.59424525,0.0026085682,0.00042395928,0.0005749913,0.000873405,0.0036434783,0.027997982],"genre_scores_gemma":[0.55083656,0.0002607177,0.43130147,0.00056461163,0.00014649772,0.00020975145,0.0011261159,0.00080344477,0.0147508485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972595,0.00067407097,0.00017650556,0.0006525714,0.0006411129,0.0005961968],"domain_scores_gemma":[0.9929395,0.0031262701,0.00032492646,0.0024668765,0.0007821588,0.00036027498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023422262,0.0013967761,0.0022313972,0.0014329037,0.0025922784,0.0035273668,0.0037429393,0.001681414,0.011311701],"category_scores_gemma":[0.009210936,0.0011973863,0.0013094915,0.003157456,0.0022671795,0.0066605564,0.0028609245,0.0021238958,0.001835742],"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.0036911897,0.0014409961,0.0052191387,0.00052175287,0.00039535214,0.00029451426,0.000596409,0.37337098,0.028546244,0.08259413,0.021670876,0.48165846],"study_design_scores_gemma":[0.00040500512,0.0002634373,0.0007495704,0.000036571488,0.00023808816,0.00019718637,0.0005577021,0.6882419,0.024484556,0.27912366,0.005654893,0.00004754254],"about_ca_topic_score_codex":0.0025965823,"about_ca_topic_score_gemma":0.0099403085,"teacher_disagreement_score":0.011311701,"about_ca_system_score_codex":0.001704965,"about_ca_system_score_gemma":0.0041304263,"threshold_uncertainty_score":0.03784144},"labels":[],"label_agreement":null},{"id":"W1706312069","doi":"10.1016/j.dam.2014.05.007","title":"On the van der Waerden numbers<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si167.gif\" display=\"inline\" overflow=\"scroll\"><mml:mstyle mathvariant=\"normal\"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>;</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>","year":2014,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":22,"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":"Van der Waerden's theorem; Conjecture; Combinatorics; Mathematics; Upper and lower bounds; Solver; Heuristic; Algorithm; Discrete mathematics; Mathematical analysis","score_opus":0.017026558341712024,"score_gpt":0.23475725351554888,"score_spread":0.21773069517383686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1706312069","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.0071094795,0.0023200558,0.22661789,0.005070501,0.006317603,0.00012246215,0.0046547134,0.0025801307,0.74520713],"genre_scores_gemma":[0.13197616,0.0054375683,0.17817794,0.0018662727,0.0018276647,0.0004182383,0.00967144,0.007196474,0.66342825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990019,0.00022248531,0.00006134045,0.00020100179,0.00041626144,0.000097104166],"domain_scores_gemma":[0.99878806,0.0005293919,0.000056248457,0.0001965737,0.00034307103,0.00008673665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007467491,0.0010983078,0.0007332996,0.0025246837,0.0014178029,0.00447251,0.0011286966,0.0007978331,0.1820387],"category_scores_gemma":[0.006495078,0.00066457584,0.0008545483,0.0028620332,0.0014454459,0.0057497094,0.0021858902,0.0029663977,0.098480225],"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.000088180364,0.000022162865,0.00017379358,0.00014442785,0.000009788674,0.000102810234,0.00031678713,0.0013563071,0.0011401532,0.68142986,0.23188213,0.0833336],"study_design_scores_gemma":[0.000020033514,0.00001719895,0.00041069998,0.00013555646,0.00000879454,0.0001629794,0.00012176421,0.0046833013,0.0015891221,0.40876347,0.58405685,0.000030209058],"about_ca_topic_score_codex":0.0035641647,"about_ca_topic_score_gemma":0.005411726,"teacher_disagreement_score":0.1820387,"about_ca_system_score_codex":0.001492939,"about_ca_system_score_gemma":0.0009045489,"threshold_uncertainty_score":0.60898006},"labels":[],"label_agreement":null},{"id":"W1719847780","doi":"10.1007/978-3-642-38768-5_24","title":"Approximating the Minimum Independent Dominating Set in Perturbed Graphs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Combinatorics; Dominating set; Mathematics; Independent set; Graph; Discrete mathematics; Approximation algorithm; Running time; Time complexity; Simple (philosophy); Algorithm","score_opus":0.02306009861298433,"score_gpt":0.24525928156052923,"score_spread":0.2221991829475449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1719847780","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.21655868,0.002112488,0.7703322,0.0009638453,0.00022522354,0.00018162109,0.00093506364,0.0009880419,0.00770288],"genre_scores_gemma":[0.71348226,0.0012511228,0.27751365,0.00024191495,0.00020251806,0.00020627164,0.0016272038,0.00040806085,0.0050670113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850637,0.000529386,0.000055484892,0.0003511636,0.00039482306,0.00016270665],"domain_scores_gemma":[0.99403024,0.004115382,0.00043798264,0.0006737388,0.000411992,0.00033073753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016262153,0.0021265857,0.0024355764,0.0017622773,0.0007666255,0.002111147,0.004102122,0.0018676025,0.002126543],"category_scores_gemma":[0.011588194,0.0012055442,0.0010627983,0.0024781607,0.0013366275,0.003219208,0.0026974434,0.0022483992,0.00060441525],"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.00050049333,0.00010168003,0.0010457693,0.00029280904,0.00008224772,0.00010574513,0.00013716161,0.93250823,0.0040650936,0.022606634,0.0036106764,0.034943458],"study_design_scores_gemma":[0.000013713074,0.000037528036,0.00016579512,0.000013271004,0.000014601697,0.00005645474,0.000028365686,0.96715015,0.00085877354,0.031218113,0.0004378379,0.0000053649674],"about_ca_topic_score_codex":0.002115627,"about_ca_topic_score_gemma":0.0020210682,"teacher_disagreement_score":0.004102122,"about_ca_system_score_codex":0.0026467938,"about_ca_system_score_gemma":0.0007541897,"threshold_uncertainty_score":0.019203901},"labels":[],"label_agreement":null},{"id":"W172422417","doi":"","title":"Polynomial Time with Restricted Use of Randomness","year":2009,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","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":"Randomness; Turing machine; Time complexity; Focus (optics); Hierarchy; Computer science; Stack (abstract data type); Polynomial hierarchy; Computation; Time hierarchy theorem; Binary logarithm; DTIME; Discrete mathematics; Random number generation; PSPACE; Theoretical computer science; Mathematics; Algorithm; Computational complexity theory; Universal Turing machine; Statistics","score_opus":0.02529183199500784,"score_gpt":0.24338374597036094,"score_spread":0.2180919139753531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172422417","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.20649871,0.0006668122,0.753258,0.0034183154,0.00006143849,0.00018670408,0.0007086978,0.0015086083,0.03369278],"genre_scores_gemma":[0.9328526,0.0004869777,0.059058513,0.00032018402,0.00017141312,0.0003119824,0.00041631726,0.00024302407,0.0061390055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934036,0.0019864526,0.00034519273,0.0014654238,0.0014907903,0.0013084626],"domain_scores_gemma":[0.96649486,0.022872701,0.0020342602,0.006826992,0.000822309,0.0009489021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037746315,0.0009896524,0.0016114493,0.001087533,0.001476573,0.005438979,0.0027024676,0.0014541175,0.004302208],"category_scores_gemma":[0.016250774,0.000712684,0.0020486396,0.0014993508,0.0043225265,0.010647503,0.003907254,0.0044483035,0.00071532954],"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.00023653284,0.00004860581,0.000859552,0.00012521737,0.00005125959,0.000091997346,0.00021690513,0.08258239,0.0026225494,0.90173334,0.001364693,0.010066892],"study_design_scores_gemma":[0.000059674734,0.000061129685,0.00032620458,0.000017440294,0.00003625145,0.00011174905,0.00004282155,0.24509846,0.0025001972,0.74882245,0.0028962397,0.000027334921],"about_ca_topic_score_codex":0.0013132015,"about_ca_topic_score_gemma":0.0012769452,"teacher_disagreement_score":0.005438979,"about_ca_system_score_codex":0.0035011603,"about_ca_system_score_gemma":0.0025111744,"threshold_uncertainty_score":0.025402844},"labels":[],"label_agreement":null},{"id":"W1750858516","doi":"10.1007/978-3-319-08783-2_29","title":"Primal-Dual Approximation Algorithms for Submodular Vertex Cover Problems with Linear/Submodular Penalties","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Vertex cover; Approximation algorithm; Vertex (graph theory); Dual (grammatical number); Cover (algebra); Time complexity; Computer science; Edge cover; Mathematics; Algorithm; Mathematical optimization; Combinatorics; Graph","score_opus":0.024143704193589348,"score_gpt":0.23782307009736783,"score_spread":0.21367936590377848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1750858516","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.025697177,0.0037704362,0.93811095,0.001796623,0.00051678723,0.00032424167,0.0008032386,0.0014597008,0.027520752],"genre_scores_gemma":[0.23181126,0.0019015546,0.7447509,0.0007986494,0.00053025247,0.00073657127,0.0019881348,0.0010283669,0.016454253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853396,0.0004882058,0.000055562254,0.00030062033,0.0003298389,0.00029181727],"domain_scores_gemma":[0.99714833,0.0018043859,0.00016555945,0.00038879717,0.00026126142,0.00023166022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002747728,0.0026005693,0.0025628714,0.0012975242,0.0009922973,0.003961766,0.003949597,0.0027017747,0.013863427],"category_scores_gemma":[0.007863377,0.0013386403,0.0014890997,0.0031096851,0.0011846968,0.004436641,0.0027849202,0.006199147,0.0027229749],"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.0008743316,0.0012231742,0.001052068,0.00085386116,0.0001697852,0.0001282501,0.00021205329,0.45177186,0.0019024186,0.14728509,0.059573796,0.33495343],"study_design_scores_gemma":[0.00011188582,0.000057337566,0.00011684823,0.00006593392,0.000027254062,0.00007454368,0.00006114925,0.90453804,0.00050114247,0.09122707,0.0032071527,0.000011581064],"about_ca_topic_score_codex":0.0029693411,"about_ca_topic_score_gemma":0.004656007,"teacher_disagreement_score":0.013863427,"about_ca_system_score_codex":0.0030072297,"about_ca_system_score_gemma":0.0026865248,"threshold_uncertainty_score":0.04637772},"labels":[],"label_agreement":null},{"id":"W1803930816","doi":"10.1007/s10107-016-1035-1","title":"Lovász–Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"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":"Office of Naval Research Global; Agencia Nacional de Promoción Científica y Tecnológica; Consejo Nacional de Investigaciones Científicas y Técnicas; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Bipartite graph; Mathematics; Polytope; Operator (biology); Chordal graph; Characterization (materials science); Indifference graph; Strong perfect graph theorem; Discrete mathematics; Graph; 1-planar graph; Physics","score_opus":0.0202639909015393,"score_gpt":0.25145209598900103,"score_spread":0.23118810508746174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1803930816","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.30197376,0.0021281554,0.6112642,0.00758547,0.00034896488,0.000103274695,0.00083665474,0.00030563408,0.07545388],"genre_scores_gemma":[0.90795875,0.001615919,0.06674104,0.0011213599,0.00048096554,0.00013895163,0.00052288285,0.00011667095,0.02130344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991647,0.0003407765,0.000041791824,0.0001582076,0.00018108673,0.00011343903],"domain_scores_gemma":[0.9973912,0.001365383,0.0003336847,0.00024794127,0.00027267972,0.00038921653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015219765,0.0006878298,0.0010697789,0.0016428721,0.0017830399,0.0025030118,0.0014981776,0.0016292025,0.0068130596],"category_scores_gemma":[0.006219465,0.00039066345,0.0010468449,0.0016874141,0.0030064073,0.0056861495,0.0022744287,0.0029412461,0.00060032035],"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.000017025854,0.000014641442,0.0001135392,0.00002812692,0.0000052390606,0.000024875546,0.00006239641,0.0028750538,0.00018964545,0.99331456,0.0010143477,0.0023405014],"study_design_scores_gemma":[0.0000038980493,0.000003986765,0.00004104711,0.00000412403,0.0000022906493,0.000018352011,0.000025987802,0.011254894,0.000056926456,0.9881179,0.00046636886,0.000004180178],"about_ca_topic_score_codex":0.002023423,"about_ca_topic_score_gemma":0.0019085148,"teacher_disagreement_score":0.0068130596,"about_ca_system_score_codex":0.0016403557,"about_ca_system_score_gemma":0.0013702608,"threshold_uncertainty_score":0.022791922},"labels":[],"label_agreement":null},{"id":"W1810597274","doi":"10.4230/lipics.approx-random.2015.915","title":"Separating Decision Tree Complexity from Subcube Partition Complexity","year":2015,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Upper and lower bounds; Mathematics; Combinatorics; Partition (number theory); Computational complexity theory; Discrete mathematics; Randomized algorithm; Time complexity; Algorithm","score_opus":0.1036924692433647,"score_gpt":0.32258378775563157,"score_spread":0.21889131851226687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1810597274","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.11933709,0.0009868573,0.84584135,0.004991753,0.00013155419,0.00020936308,0.00091276213,0.0006495976,0.026939709],"genre_scores_gemma":[0.8906458,0.0013219499,0.096881226,0.0011758883,0.00041188652,0.00058566534,0.0011115529,0.00047601343,0.007389992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9890832,0.0029494003,0.0004779776,0.002486361,0.0034305796,0.001572553],"domain_scores_gemma":[0.94590724,0.03955992,0.0020606485,0.009562601,0.0017266724,0.0011829619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004923667,0.00095898873,0.0020561335,0.0015956074,0.001925323,0.0071181087,0.0038213728,0.002643763,0.007686327],"category_scores_gemma":[0.03338387,0.00080780336,0.0024340658,0.0025737393,0.0050099753,0.016329708,0.0056244484,0.007925807,0.0010166042],"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.00021422298,0.00008497076,0.0013768618,0.00016374388,0.000052588748,0.00006475365,0.00025091317,0.059066597,0.0020832403,0.9133629,0.0031983852,0.020080758],"study_design_scores_gemma":[0.000023524923,0.000032395703,0.00044235148,0.000030208961,0.000029835213,0.0000764481,0.00005515006,0.19270816,0.0019594159,0.80171585,0.0029004365,0.000026245449],"about_ca_topic_score_codex":0.0025761386,"about_ca_topic_score_gemma":0.0025706491,"teacher_disagreement_score":0.007686327,"about_ca_system_score_codex":0.005780852,"about_ca_system_score_gemma":0.0033927953,"threshold_uncertainty_score":0.041943192},"labels":[],"label_agreement":null},{"id":"W1825657983","doi":"10.1007/978-3-319-13075-0_42","title":"Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Submodular set function; Constant (computer programming); Randomized algorithm; Computer science; Algorithm; Approximation algorithm; Deterministic algorithm; Matching (statistics); Maximization; Greedy algorithm; Online algorithm; Running time; Simple (philosophy); Mathematics; Combinatorics; Mathematical optimization","score_opus":0.02816901447274186,"score_gpt":0.26118368632132904,"score_spread":0.23301467184858718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1825657983","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.018063437,0.008221997,0.8771407,0.004071275,0.0010951179,0.00040355354,0.0008564209,0.0015616609,0.08858587],"genre_scores_gemma":[0.30120066,0.0069756145,0.6274583,0.0037147137,0.0019024992,0.0024604304,0.0022315218,0.0032107432,0.050845448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9898296,0.0036226918,0.00047647938,0.0015814292,0.002875948,0.0016138086],"domain_scores_gemma":[0.95603484,0.035393566,0.0009996895,0.0040710364,0.0020425587,0.0014583565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012795674,0.007205611,0.0045526354,0.0026934184,0.0026947856,0.008233485,0.009906427,0.0063253962,0.03154292],"category_scores_gemma":[0.057110235,0.0027936392,0.0036478702,0.0056065903,0.005334492,0.015602011,0.010347349,0.016289651,0.006900691],"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.001749711,0.00073723384,0.001041391,0.0016377929,0.00027307143,0.00018663492,0.0004699469,0.23255937,0.002991469,0.5155066,0.053669423,0.18917742],"study_design_scores_gemma":[0.00021295508,0.00015554101,0.00029679836,0.00028686234,0.000100780875,0.00014972249,0.00007633276,0.5382711,0.0009198182,0.45353928,0.0059410725,0.000049746337],"about_ca_topic_score_codex":0.0022354873,"about_ca_topic_score_gemma":0.004695187,"teacher_disagreement_score":0.03154292,"about_ca_system_score_codex":0.007243063,"about_ca_system_score_gemma":0.006818363,"threshold_uncertainty_score":0.10552162},"labels":[],"label_agreement":null},{"id":"W186506571","doi":"","title":"Using core beliefs for point-based value iteration","year":2005,"lang":"en","type":"article","venue":"International Joint Conference on Artificial Intelligence","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Simplex; Computer science; Mathematical optimization; Partially observable Markov decision process; Set (abstract data type); Heuristic; Core (optical fiber); Simplex algorithm; Bellman equation; Point (geometry); Value (mathematics); Function (biology); Algorithm; Artificial intelligence; Mathematics; Linear programming; Machine learning; Markov chain; Combinatorics; Markov model","score_opus":0.29352949057106004,"score_gpt":0.3825340826528269,"score_spread":0.08900459208176686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W186506571","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.003824142,0.000067795525,0.99433976,0.000048645266,0.000011398675,0.000042533073,0.000014556704,0.00019628795,0.0014548682],"genre_scores_gemma":[0.3108754,0.00024122697,0.68624747,0.00011745823,0.00003814576,0.0004212005,0.00012584015,0.00019871697,0.001734617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974948,0.0010417593,0.00012677978,0.00033540878,0.0007965818,0.00020465172],"domain_scores_gemma":[0.9950606,0.0030650853,0.00034701388,0.0006747434,0.0006993707,0.00015314746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033980461,0.0013040054,0.0014674342,0.0011251898,0.0007280046,0.0017771518,0.0022228516,0.001431184,0.0040503815],"category_scores_gemma":[0.013433164,0.0008955863,0.0010855658,0.0008868449,0.0020726556,0.002911749,0.0032591561,0.002606089,0.00095653767],"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.00024373404,0.000108671324,0.00081239414,0.00022032812,0.00009199502,0.000107930784,0.0004192802,0.66230327,0.003304459,0.21408738,0.0015118934,0.116788685],"study_design_scores_gemma":[0.000031311072,0.00005106386,0.000042338557,0.000025805452,0.000011544037,0.000020929763,0.000023395378,0.9130246,0.0015009012,0.08408537,0.0011710068,0.000011724868],"about_ca_topic_score_codex":0.0023825273,"about_ca_topic_score_gemma":0.002719816,"teacher_disagreement_score":0.0040503815,"about_ca_system_score_codex":0.0013340134,"about_ca_system_score_gemma":0.0015500445,"threshold_uncertainty_score":0.0179708},"labels":[],"label_agreement":null},{"id":"W1872088823","doi":"10.1007/978-3-540-85363-3_30","title":"Improved Separations between Nondeterministic and Randomized Multiparty Communication","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Nondeterministic algorithm; Constant (computer programming); Computer science; Function (biology); Combinatorics; Set (abstract data type); Computable function; String (physics); Discrete mathematics; Mathematics; Algorithm; Programming language","score_opus":0.02753479408787502,"score_gpt":0.27092340219700467,"score_spread":0.24338860810912966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872088823","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.026987381,0.0011805887,0.93115646,0.0018704175,0.0012093511,0.00019546792,0.00033303845,0.0019450356,0.035122357],"genre_scores_gemma":[0.6058956,0.0011208751,0.35456374,0.001229078,0.001467049,0.0007786967,0.0007725395,0.0015610253,0.032611467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98444104,0.005702021,0.00072816265,0.0031754223,0.0039913515,0.001962057],"domain_scores_gemma":[0.9527335,0.030815024,0.0013768835,0.011851108,0.0015677058,0.0016557997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009562922,0.0021549237,0.0037466467,0.0015328579,0.0035826236,0.0057106433,0.007268164,0.0044320375,0.013005645],"category_scores_gemma":[0.031502828,0.0021761595,0.0031926895,0.002285622,0.00526082,0.015203856,0.013836712,0.018972391,0.0044858735],"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.0012175757,0.00029043062,0.00021941679,0.0002789288,0.0000702286,0.00011151127,0.00026194818,0.031912528,0.0045850715,0.9131089,0.007011334,0.040932238],"study_design_scores_gemma":[0.00015768905,0.000118581265,0.00015135016,0.000058507707,0.000052966865,0.000103773134,0.00004237866,0.14275362,0.0043943184,0.8459523,0.0061532296,0.00006133813],"about_ca_topic_score_codex":0.00058317615,"about_ca_topic_score_gemma":0.0007925863,"teacher_disagreement_score":0.013005645,"about_ca_system_score_codex":0.0035589917,"about_ca_system_score_gemma":0.0041642445,"threshold_uncertainty_score":0.050574183},"labels":[],"label_agreement":null},{"id":"W1892871566","doi":"10.1109/spdp.1993.395504","title":"Parallel network dual simplex method on a shared memory multiprocessor","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Concordia University","funders":"","keywords":"Computer science; Simplex algorithm; Dual (grammatical number); Multiprocessing; Scope (computer science); Simplex; Parallel computing; Extension (predicate logic); Distributed memory; Parallel algorithm; Theoretical computer science; Mathematical optimization; Distributed computing; Algorithm; Linear programming; Shared memory; Programming language; Mathematics","score_opus":0.06083322208946867,"score_gpt":0.2889409379408651,"score_spread":0.22810771585139644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1892871566","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.006911303,0.000103590675,0.9850044,0.0000968201,0.000048564656,0.000046189554,0.000072809686,0.0006670853,0.0070492355],"genre_scores_gemma":[0.114323914,0.00017933823,0.87476045,0.00005304809,0.000034824472,0.00029156756,0.00019499609,0.00025817764,0.009903707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996929,0.00008174551,0.000011099425,0.000041308176,0.0001361532,0.00003690731],"domain_scores_gemma":[0.9997663,0.00006769441,0.000016846325,0.000052672563,0.000074804935,0.000021695529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027978732,0.0005007073,0.0005971085,0.00056951935,0.00050101784,0.00070618145,0.0010262477,0.00046351043,0.0072481055],"category_scores_gemma":[0.0008206223,0.00034807393,0.0004942342,0.00076971063,0.0004359187,0.0009170417,0.0010748708,0.00081188674,0.001972012],"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.00022579575,0.00011141049,0.0005509578,0.00016364057,0.00007435976,0.00018152007,0.00012472719,0.6818602,0.011257185,0.08575039,0.008327586,0.21137214],"study_design_scores_gemma":[0.000048227208,0.000020106852,0.00005375118,0.0000045417937,0.0000071195464,0.000038499507,0.000011870275,0.975227,0.0021549554,0.014738271,0.0076877545,0.000007901405],"about_ca_topic_score_codex":0.0037377046,"about_ca_topic_score_gemma":0.004496435,"teacher_disagreement_score":0.0072481055,"about_ca_system_score_codex":0.00062381563,"about_ca_system_score_gemma":0.0010936753,"threshold_uncertainty_score":0.024247348},"labels":[],"label_agreement":null},{"id":"W1897679864","doi":"10.5555/1496770.1496787","title":"Comparison-based time-space lower bounds for selection","year":2009,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Upper and lower bounds; Binary logarithm; Combinatorics; Log-log plot; Mathematics; Mathematical proof; Streaming algorithm; Space (punctuation); Selection (genetic algorithm); Discrete mathematics; Running time; Randomized algorithm; Computer science; Algorithm","score_opus":0.023164110130631292,"score_gpt":0.2960447433243519,"score_spread":0.2728806331937206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1897679864","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.08559227,0.006627266,0.83152544,0.013271348,0.00064898207,0.00050871365,0.0016099052,0.004031649,0.05618447],"genre_scores_gemma":[0.7003488,0.0040951357,0.26091158,0.003850467,0.002511378,0.0019043488,0.002109388,0.0030827553,0.021186106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97822714,0.0051939916,0.0009816268,0.0044751316,0.006503787,0.0046182224],"domain_scores_gemma":[0.890547,0.0821036,0.005507317,0.01560146,0.0036799859,0.0025606176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011457094,0.0034390842,0.004160339,0.0031510468,0.004132826,0.008905671,0.008180888,0.004320368,0.025144361],"category_scores_gemma":[0.06077116,0.001957396,0.004663611,0.0067589935,0.0067688376,0.032627635,0.009695901,0.011691919,0.0051888833],"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.005077617,0.0014825944,0.008814303,0.001844814,0.00042411603,0.00052752206,0.0011200065,0.21473405,0.027078822,0.5169636,0.032505527,0.18942699],"study_design_scores_gemma":[0.00036984318,0.0007133671,0.0018400147,0.0002031534,0.0003140667,0.0007625874,0.00028392975,0.42510945,0.017657546,0.5398659,0.012749906,0.00013019436],"about_ca_topic_score_codex":0.0019192648,"about_ca_topic_score_gemma":0.0022838037,"teacher_disagreement_score":0.025144361,"about_ca_system_score_codex":0.008246317,"about_ca_system_score_gemma":0.006603486,"threshold_uncertainty_score":0.08411628},"labels":[],"label_agreement":null},{"id":"W1899845837","doi":"10.1007/s00145-001-0007-6","title":"Complexity Bounds on General Hard-Core Predicates","year":2001,"lang":"en","type":"article","venue":"Journal of Cryptology","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"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":"Kungliga Tekniska Högskolan; McGill University; University of Texas at Austin; National Science Foundation","keywords":"Predicate (mathematical logic); Boolean function; Mathematics; Discrete mathematics; Combinatorics; Monotone polygon; Core (optical fiber); Hard core; Computer science","score_opus":0.08349018298500696,"score_gpt":0.30711456702709455,"score_spread":0.2236243840420876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1899845837","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.25090444,0.009193669,0.46861434,0.03648305,0.0013472544,0.0008315144,0.0055383802,0.0035506245,0.22353666],"genre_scores_gemma":[0.8799818,0.006183045,0.07145858,0.0048664683,0.0030111275,0.00080424297,0.0049548494,0.0025755514,0.026164366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98994774,0.001691599,0.00034171058,0.0018191069,0.003058449,0.0031413054],"domain_scores_gemma":[0.88144433,0.09748183,0.002768735,0.010927817,0.0035028376,0.0038743676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007107592,0.0029334186,0.004481378,0.005472562,0.0051756576,0.013170085,0.007371981,0.0048081004,0.024849873],"category_scores_gemma":[0.054252263,0.0024132587,0.00420678,0.0070292572,0.007771983,0.050775968,0.011973813,0.016565407,0.003371576],"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.0018761888,0.0005793921,0.0025269086,0.00084485195,0.00016258,0.00018710953,0.00063410297,0.047868636,0.0037690422,0.8727549,0.03035945,0.03843694],"study_design_scores_gemma":[0.00011228374,0.000056275207,0.00054658024,0.00006934298,0.00010525311,0.00011790374,0.00010345315,0.06271227,0.0015146023,0.9306458,0.0039745243,0.00004168643],"about_ca_topic_score_codex":0.0034266065,"about_ca_topic_score_gemma":0.004804506,"teacher_disagreement_score":0.024849873,"about_ca_system_score_codex":0.0100945225,"about_ca_system_score_gemma":0.0056784847,"threshold_uncertainty_score":0.083131075},"labels":[],"label_agreement":null},{"id":"W1906705979","doi":"10.1109/lics.2004.1319632","title":"VTC/sup O/: a second-order theory for TC/sup 0/","year":2004,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Order (exchange); Combinatorics; Physics; Mathematics; Discrete mathematics","score_opus":0.019732397253852948,"score_gpt":0.2514702293808242,"score_spread":0.23173783212697124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1906705979","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.22152217,0.0016538182,0.5946367,0.002116412,0.00054326403,0.00020887116,0.0010004789,0.0013575541,0.1769608],"genre_scores_gemma":[0.8765132,0.00036252735,0.08992672,0.0007227069,0.00023712074,0.00014262939,0.0010656486,0.00022524943,0.030804213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990119,0.00012260194,0.00005655122,0.00020262242,0.0003861423,0.00022019053],"domain_scores_gemma":[0.9990963,0.00026276623,0.000092185815,0.00013046249,0.00029460154,0.00012367735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070899137,0.00047756082,0.00034416592,0.0015011079,0.0011762589,0.0027188293,0.0011141563,0.00079347275,0.0038610448],"category_scores_gemma":[0.0011768803,0.00028607514,0.0009250945,0.0009241276,0.0032131132,0.0030121985,0.0015081047,0.0020277847,0.00054442056],"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.000011178328,0.000009627787,0.00025390324,0.000021232492,0.0000037226976,0.000059820584,0.00019268304,0.00043321887,0.0012371902,0.99449205,0.00054643303,0.0027388881],"study_design_scores_gemma":[0.000033139066,0.000083299354,0.00088762544,0.000045258508,0.00002903309,0.00034118554,0.00037320453,0.016985439,0.0090906015,0.8988619,0.07323245,0.000036946738],"about_ca_topic_score_codex":0.0073934374,"about_ca_topic_score_gemma":0.005100653,"teacher_disagreement_score":0.0073934374,"about_ca_system_score_codex":0.0031544245,"about_ca_system_score_gemma":0.0015912948,"threshold_uncertainty_score":0.022887051},"labels":[],"label_agreement":null},{"id":"W1914444769","doi":"10.48550/arxiv.1507.01309","title":"Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part II","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Mathematics; Relaxation (psychology); Combinatorics; Tree (set theory); Linear programming relaxation; Lift (data mining); Discrete mathematics; Algorithm; Linear programming; Computer science","score_opus":0.12767938969733542,"score_gpt":0.21251196647232504,"score_spread":0.08483257677498962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1914444769","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.1117695,0.00036834157,0.8761698,0.00096329453,0.000101394646,0.00014464205,0.00024896604,0.0009702602,0.009263768],"genre_scores_gemma":[0.5219028,0.00029939794,0.47028702,0.0003074594,0.00011910932,0.0003060222,0.0006703796,0.00034241175,0.0057654777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914,0.00024415873,0.000030982534,0.00020681384,0.00019631394,0.00018173481],"domain_scores_gemma":[0.9979602,0.0011153904,0.00015638457,0.0004684413,0.00014164095,0.00015780753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012397782,0.00081133185,0.0011499028,0.0005832571,0.0006246298,0.0014108844,0.0015767374,0.0011235372,0.0070237042],"category_scores_gemma":[0.005803203,0.00044917004,0.0009378921,0.0011447956,0.0011978118,0.0032333452,0.0025003501,0.0024019547,0.0007879535],"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.00045757208,0.00032538784,0.002089394,0.00038594118,0.00006102765,0.00021632272,0.00031748886,0.6183272,0.011470639,0.17186567,0.01088713,0.18359627],"study_design_scores_gemma":[0.000027008748,0.00006581431,0.0002145856,0.000022175089,0.000010502818,0.00007970819,0.000058704514,0.91073304,0.0022797862,0.08419206,0.0023076497,0.000008938313],"about_ca_topic_score_codex":0.0015417762,"about_ca_topic_score_gemma":0.001893167,"teacher_disagreement_score":0.0070237042,"about_ca_system_score_codex":0.0010865487,"about_ca_system_score_gemma":0.0010798939,"threshold_uncertainty_score":0.023496568},"labels":[],"label_agreement":null},{"id":"W1919479762","doi":"10.1109/parbse.1990.77154","title":"A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Queen's University","funders":"","keywords":"Bipartite graph; Speedup; Combinatorics; Cardinality (data modeling); Parallel algorithm; Computer science; Computation; Mathematics; Discrete mathematics; Algorithm; Graph; Parallel computing","score_opus":0.05374301300305884,"score_gpt":0.24984191510868212,"score_spread":0.19609890210562328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919479762","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.018103065,0.00015392748,0.9734611,0.00021624399,0.00007572816,0.000121067045,0.00008157504,0.001943714,0.0058436296],"genre_scores_gemma":[0.096032344,0.00010522151,0.89815366,0.00011181719,0.000054528675,0.0001944494,0.00027726588,0.00019032233,0.0048803035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938893,0.00012352414,0.000034592373,0.00019402814,0.00015921386,0.000099838275],"domain_scores_gemma":[0.9994999,0.00017311459,0.000047041605,0.00014201962,0.00010271471,0.000035109504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053220725,0.00077032216,0.0006315488,0.0005562248,0.00078426267,0.0007334233,0.0014605201,0.0007290453,0.006571629],"category_scores_gemma":[0.0012701796,0.00036643285,0.00053361955,0.0011617795,0.00071301655,0.0015996676,0.0010902045,0.00095718546,0.0016725878],"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.00053890276,0.00029587222,0.000930072,0.00027620333,0.00010353239,0.00013665912,0.00015224476,0.19294904,0.02414034,0.070606455,0.023618286,0.6862524],"study_design_scores_gemma":[0.00021306628,0.00012636984,0.00042447585,0.0000149853,0.00003628057,0.00016969863,0.000049287064,0.91152143,0.011626668,0.061132353,0.01466657,0.000018773564],"about_ca_topic_score_codex":0.0021347723,"about_ca_topic_score_gemma":0.0027725697,"teacher_disagreement_score":0.006571629,"about_ca_system_score_codex":0.00072206627,"about_ca_system_score_gemma":0.001313981,"threshold_uncertainty_score":0.02198428},"labels":[],"label_agreement":null},{"id":"W1928219016","doi":"10.1007/978-3-642-13036-6_29","title":"Hypergraphic LP Relaxations for Steiner Trees","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"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":"Steiner tree problem; Mathematics; Combinatorics","score_opus":0.020650835062804664,"score_gpt":0.24624998155214245,"score_spread":0.2255991464893378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1928219016","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.029205224,0.002583702,0.85905796,0.003924155,0.0005577389,0.00028116,0.0014763473,0.0006251391,0.10228866],"genre_scores_gemma":[0.33411387,0.0073192045,0.5563768,0.0023345288,0.0021673886,0.0018153867,0.0055551357,0.0016392607,0.088678464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879706,0.0004986651,0.000061632694,0.00020814649,0.0002737036,0.00016067756],"domain_scores_gemma":[0.99680054,0.0022216565,0.0002227139,0.00029937155,0.00021990058,0.0002357745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019086619,0.0022044028,0.001552691,0.0012800413,0.0008935009,0.0032321494,0.0026614582,0.0022201238,0.028370908],"category_scores_gemma":[0.009381659,0.0015522306,0.0016378531,0.003026377,0.0014748977,0.006902047,0.0031357894,0.008595256,0.0030243495],"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.00021557306,0.0003017936,0.00025917598,0.0007600948,0.000072964394,0.00016662358,0.00053029426,0.14169219,0.001439489,0.7036889,0.048748806,0.102124065],"study_design_scores_gemma":[0.00007626334,0.00006024556,0.00012671108,0.00013410418,0.000029048731,0.00008398991,0.00019063827,0.19278957,0.00041306595,0.79289246,0.013183835,0.000019994071],"about_ca_topic_score_codex":0.0019706676,"about_ca_topic_score_gemma":0.0023504223,"teacher_disagreement_score":0.028370908,"about_ca_system_score_codex":0.0019727938,"about_ca_system_score_gemma":0.0012171257,"threshold_uncertainty_score":0.094910145},"labels":[],"label_agreement":null},{"id":"W1964180408","doi":"10.1016/j.ipl.2007.08.014","title":"Improved FPT algorithm for feedback vertex set problem in bipartite tournament","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","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":"Tournament; Bipartite graph; Vertex (graph theory); Feedback vertex set; Mathematics; Algorithm; Combinatorics; Set (abstract data type); Vertex cover; Feedback arc set; Approximation algorithm; Computer science; Graph","score_opus":0.01527569381448809,"score_gpt":0.25495503024486904,"score_spread":0.23967933643038095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964180408","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.09074248,0.0012991701,0.8804411,0.001917384,0.00067304453,0.0005620232,0.0012090511,0.0045203506,0.018635346],"genre_scores_gemma":[0.43848696,0.00031797437,0.54874736,0.00066916033,0.00039732398,0.00071431743,0.002360997,0.00044567185,0.007860194],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790657,0.0004997966,0.00011150172,0.0005080615,0.0005101826,0.00046394987],"domain_scores_gemma":[0.9969132,0.0017507293,0.00013454714,0.000527698,0.00043455587,0.00023917665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014613166,0.0011424435,0.0025474217,0.001315277,0.0015133201,0.0025279846,0.0038265917,0.0026305965,0.011474123],"category_scores_gemma":[0.0061932807,0.00049202173,0.0014802135,0.002079001,0.0007496857,0.0029804332,0.001835942,0.0021776843,0.0012692998],"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.001958509,0.001214207,0.002640978,0.00074244157,0.00020013764,0.00048470992,0.00029290185,0.31668982,0.009313174,0.050982744,0.06080863,0.55467176],"study_design_scores_gemma":[0.00033378735,0.00015502411,0.00039950278,0.000029390494,0.000052213894,0.00020463887,0.000059999897,0.95179003,0.0018098749,0.04254597,0.002599711,0.000019843406],"about_ca_topic_score_codex":0.0062958268,"about_ca_topic_score_gemma":0.005243391,"teacher_disagreement_score":0.011474123,"about_ca_system_score_codex":0.0019999307,"about_ca_system_score_gemma":0.0028076877,"threshold_uncertainty_score":0.038384795},"labels":[],"label_agreement":null},{"id":"W1964276725","doi":"10.1007/s00453-011-9526-1","title":"A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"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 New Brunswick","funders":"","keywords":"Submodular set function; Approximation algorithm; Theory of computation; Facility location problem; Mathematics; Linear programming relaxation; Relaxation (psychology); Dual (grammatical number); Exponential function; Integer (computer science); Algorithm; Mathematical optimization; Function (biology); Combinatorics; Linear programming; Computer science","score_opus":0.035183989583035154,"score_gpt":0.2237815915891898,"score_spread":0.18859760200615466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964276725","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.0109656565,0.00043712792,0.98197377,0.0007906586,0.00015275768,0.00012009428,0.00022265699,0.00053331756,0.00480398],"genre_scores_gemma":[0.14662652,0.0003738645,0.84566265,0.00033970844,0.00020357786,0.00038787635,0.00063009455,0.00027985766,0.0054959184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984675,0.0005770791,0.00005873136,0.0003095874,0.00034973436,0.00023746151],"domain_scores_gemma":[0.9973424,0.001602563,0.00016304605,0.0003429337,0.00029263602,0.00025650545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027980956,0.0016565084,0.00269721,0.0012421298,0.0009873605,0.002807825,0.0035247079,0.0029178842,0.008012298],"category_scores_gemma":[0.007507813,0.0011402072,0.001183047,0.002657377,0.0011291293,0.0033045763,0.0029734138,0.004779473,0.0016390083],"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.00072208187,0.0009058387,0.0010506023,0.00036758333,0.00012265074,0.00012340836,0.00014227859,0.650927,0.0020929421,0.10240282,0.026423503,0.21471927],"study_design_scores_gemma":[0.000109045446,0.00004611176,0.00008149178,0.000015826176,0.00001610319,0.00004840787,0.000020873167,0.9644903,0.00032427866,0.033421863,0.0014158475,0.0000099391455],"about_ca_topic_score_codex":0.0036959858,"about_ca_topic_score_gemma":0.004459228,"teacher_disagreement_score":0.008012298,"about_ca_system_score_codex":0.002373026,"about_ca_system_score_gemma":0.0039857593,"threshold_uncertainty_score":0.026803792},"labels":[],"label_agreement":null},{"id":"W1965026568","doi":"10.1016/j.dam.2011.05.004","title":"Analysing local algorithms in location-aware quasi-unit-disk graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"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; Mitacs","keywords":"Unit disk graph; Algorithm; Vertex (graph theory); Mathematics; Set (abstract data type); Matching (statistics); Graph; Approximation algorithm; Computer science; Combinatorics; Wireless network","score_opus":0.04545922886075514,"score_gpt":0.2643196687415958,"score_spread":0.21886043988084064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965026568","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.48437187,0.0009047455,0.50291985,0.0014147835,0.00004984885,0.00013829497,0.00031360355,0.00063088967,0.009256123],"genre_scores_gemma":[0.9452705,0.00031290593,0.050156873,0.00012869893,0.000056226647,0.00008509254,0.00034040975,0.00021118228,0.0034381775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975534,0.0009311365,0.00010478304,0.00056849245,0.00045896112,0.0003832561],"domain_scores_gemma":[0.9657122,0.02513876,0.0031923587,0.002993026,0.0018030703,0.0011606107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022190434,0.00077768945,0.0014032645,0.0016738797,0.0015061937,0.00402493,0.0043984293,0.0020763592,0.005229712],"category_scores_gemma":[0.02711967,0.0007628338,0.00090026273,0.0024737702,0.0027482898,0.0076206475,0.0027943726,0.0021146527,0.0005994016],"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.0006244604,0.00029755518,0.0058674295,0.00045312964,0.000116660725,0.00022815894,0.0008816034,0.5449777,0.004677441,0.40685838,0.0036742236,0.03134317],"study_design_scores_gemma":[0.000056796198,0.000067121764,0.0010850537,0.000024348243,0.00004207228,0.00009059135,0.00034459628,0.7547467,0.0014511214,0.2411242,0.00094610103,0.000021305745],"about_ca_topic_score_codex":0.004159867,"about_ca_topic_score_gemma":0.0043978156,"teacher_disagreement_score":0.005229712,"about_ca_system_score_codex":0.0030084134,"about_ca_system_score_gemma":0.0018387878,"threshold_uncertainty_score":0.021827638},"labels":[],"label_agreement":null},{"id":"W1965608008","doi":"10.1007/s00453-013-9850-8","title":"Approximating Minimum-Cost Connected T-Joins","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","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":"Approximation algorithm; Combinatorics; Mathematics; Rounding; Degree (music); Steiner tree problem; Discrete mathematics; Theory of computation; Path (computing); Undirected graph; Graph; Algorithm; Computer science","score_opus":0.017538724247570543,"score_gpt":0.22843547818148097,"score_spread":0.2108967539339104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965608008","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.4011061,0.0016470673,0.5675992,0.0027233546,0.0002486478,0.00030313275,0.0017781524,0.0016037824,0.022990596],"genre_scores_gemma":[0.6843985,0.0008322417,0.3025637,0.00031052873,0.0002671911,0.00025336316,0.0025605874,0.00048052077,0.008333433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984376,0.00036253632,0.00008909382,0.0003700578,0.0005029893,0.00023772834],"domain_scores_gemma":[0.98645025,0.009774302,0.0007865509,0.0013678396,0.0007968022,0.00082427077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015885896,0.0012971997,0.0019525412,0.0017745814,0.0012677702,0.003798104,0.0035747513,0.0025197566,0.012785449],"category_scores_gemma":[0.017686026,0.0007972737,0.0012274511,0.0037542419,0.001272207,0.0064406465,0.0031014625,0.0028488976,0.0016310713],"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.0022964505,0.0008047623,0.005877136,0.0010731729,0.00016538355,0.00038138902,0.00073591823,0.54064965,0.010359135,0.21513551,0.022747973,0.19977348],"study_design_scores_gemma":[0.00017136813,0.00015772379,0.00046399178,0.000050683528,0.00006887893,0.00020834676,0.0002538579,0.7710604,0.002989858,0.22173935,0.002819613,0.000015952297],"about_ca_topic_score_codex":0.0014007104,"about_ca_topic_score_gemma":0.003107156,"teacher_disagreement_score":0.012785449,"about_ca_system_score_codex":0.0018331986,"about_ca_system_score_gemma":0.0016665182,"threshold_uncertainty_score":0.04277152},"labels":[],"label_agreement":null},{"id":"W1965641578","doi":"10.1016/j.dam.2007.05.001","title":"Flows over edge-disjoint mixed multipaths and applications","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","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 New Brunswick; University of Windsor","funders":"","keywords":"Disjoint sets; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Theoretical computer science; Computer science; Telecommunications","score_opus":0.016258153685711853,"score_gpt":0.2561109614297292,"score_spread":0.23985280774401738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965641578","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.3384742,0.002768643,0.63408977,0.0012472079,0.00025766372,0.00013092226,0.00043318607,0.00051179883,0.022086615],"genre_scores_gemma":[0.8828971,0.0021514408,0.10319001,0.00018429075,0.00031343996,0.00013627629,0.00023647181,0.000110469315,0.01078047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991351,0.00024252146,0.00005922445,0.00018193039,0.00019206994,0.00018913546],"domain_scores_gemma":[0.9936941,0.0037799766,0.0007328699,0.0004626479,0.0007023471,0.00062798266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001071126,0.0010312437,0.0010351223,0.003620333,0.0018524402,0.003150093,0.0015977131,0.0013385275,0.0042784424],"category_scores_gemma":[0.009171009,0.0008165661,0.00071783614,0.0041436045,0.0014462548,0.005599969,0.003924911,0.0017368195,0.00033858573],"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.00033450953,0.000083063205,0.0017736244,0.00017738764,0.000062063256,0.00023916262,0.00029283957,0.12110938,0.0030219683,0.8252709,0.0026410301,0.04499421],"study_design_scores_gemma":[0.000041299143,0.000046040725,0.00039836243,0.000039009912,0.000049390997,0.00025667236,0.00018039689,0.3394863,0.0012503755,0.65410995,0.0041144337,0.000027821918],"about_ca_topic_score_codex":0.0016786724,"about_ca_topic_score_gemma":0.0015413206,"teacher_disagreement_score":0.0042784424,"about_ca_system_score_codex":0.0015736484,"about_ca_system_score_gemma":0.00090746064,"threshold_uncertainty_score":0.014312863},"labels":[],"label_agreement":null},{"id":"W1967648182","doi":"10.1007/s00373-007-0714-3","title":"Efficient Many-To-Many Point Matching in One Dimension","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre for Interdisciplinary Research in Music Media and Technology; Queen's University; McGill University","funders":"","keywords":"Combinatorics; Mathematics; Cardinality (data modeling); Matching (statistics); Dimension (graph theory); Point (geometry); Context (archaeology); 3-dimensional matching; Line (geometry); Discrete mathematics; Bipartite graph; Computer science; Graph; Statistics; Geometry","score_opus":0.016632490546493427,"score_gpt":0.23473731553534669,"score_spread":0.21810482498885325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967648182","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.34075356,0.0014205526,0.6011994,0.0028037452,0.0003277693,0.00046133567,0.0017781063,0.005254494,0.04600111],"genre_scores_gemma":[0.68485737,0.0007422398,0.29381365,0.00050783774,0.00010812855,0.00025258557,0.001532741,0.00047856153,0.017706998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799585,0.0004498321,0.00013829184,0.00050259987,0.00048623234,0.0004272834],"domain_scores_gemma":[0.99706346,0.0011483995,0.00025183122,0.0010927963,0.0002126486,0.00023079332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090206583,0.0011573023,0.0026830838,0.0013052454,0.0017269843,0.0038427808,0.0036493766,0.0024763825,0.011077258],"category_scores_gemma":[0.005170639,0.00073833147,0.0011236052,0.0038846922,0.0012563588,0.008936671,0.0043924116,0.0017472235,0.002964672],"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.0022470702,0.0010670016,0.0032320216,0.0012035561,0.00033673103,0.00036147077,0.00064981676,0.17240866,0.025670921,0.39856288,0.033705484,0.3605544],"study_design_scores_gemma":[0.0003090526,0.00018845561,0.00067245826,0.000045928726,0.00015774177,0.0002497142,0.0003002383,0.39449665,0.009987272,0.5861783,0.007358825,0.000055350763],"about_ca_topic_score_codex":0.0023295349,"about_ca_topic_score_gemma":0.0032200054,"teacher_disagreement_score":0.011077258,"about_ca_system_score_codex":0.0017718568,"about_ca_system_score_gemma":0.0018737671,"threshold_uncertainty_score":0.0370571},"labels":[],"label_agreement":null},{"id":"W1968226734","doi":"10.1109/hpcc.2010.44","title":"Exploiting Parallelism in Iterative Irregular Maxflow Computations on GPU Accelerators","year":2010,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Manitoba","funders":"","keywords":"Computer science; Parallel computing; Graphics processing unit; CUDA; Graph; General-purpose computing on graphics processing units; Iterative method; Pointer (user interface); Graphics; Computation; Parallel algorithm; Out-of-core algorithm; Algorithm; Theoretical computer science; Computer graphics (images)","score_opus":0.0252760637902123,"score_gpt":0.2674711484262791,"score_spread":0.24219508463606682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968226734","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.29194003,0.00017647087,0.6976216,0.0002635097,0.000038081864,0.000040769428,0.000037174235,0.00061540667,0.009266951],"genre_scores_gemma":[0.82417417,0.00010479911,0.17383352,0.00004265275,0.00002184927,0.00004172534,0.000057806003,0.00007141248,0.0016521052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975115,0.00008764688,0.000012196278,0.00002711463,0.000076744116,0.00004518176],"domain_scores_gemma":[0.99912304,0.00055936514,0.00008115083,0.000100214886,0.00009396297,0.00004228979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000569787,0.0003273408,0.00034139448,0.0003979812,0.0005795551,0.0006762336,0.00062259653,0.0003661966,0.0009410891],"category_scores_gemma":[0.002783629,0.00026365576,0.00028475648,0.00067155104,0.0007385785,0.0009597433,0.00077736157,0.00036337573,0.00017598672],"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.00026638934,0.00006325588,0.0028659143,0.00006321282,0.000030627543,0.00023248943,0.00023478709,0.8600643,0.013653983,0.051330265,0.0012306545,0.06996422],"study_design_scores_gemma":[0.0000068151685,0.000010702967,0.00012626324,0.0000015104525,0.0000015671403,0.000013895268,0.00000819016,0.99010885,0.0014032928,0.007972753,0.0003440724,0.0000020766663],"about_ca_topic_score_codex":0.00282568,"about_ca_topic_score_gemma":0.0050264723,"teacher_disagreement_score":0.00282568,"about_ca_system_score_codex":0.0005450906,"about_ca_system_score_gemma":0.0006859478,"threshold_uncertainty_score":0.005618453},"labels":[],"label_agreement":null},{"id":"W1969972789","doi":"10.1109/tkde.2011.260","title":"The Minimum Consistent Subset Cover Problem: A Minimization View of Data Mining","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Computer science; Cluster analysis; Bipartite graph; Cardinality (data modeling); Clique; Set cover problem; Set (abstract data type); Theoretical computer science; Artificial intelligence; Graph; Mathematics; Data mining; Combinatorics","score_opus":0.08975363559799747,"score_gpt":0.27409211179744,"score_spread":0.1843384761994425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969972789","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.012004011,0.0017443243,0.98172647,0.0017443451,0.00005357345,0.00018973088,0.00036560252,0.00013341407,0.002038577],"genre_scores_gemma":[0.21411562,0.0026130618,0.77759606,0.0006819157,0.0005299131,0.00071133184,0.0018414754,0.00017932191,0.0017313651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99315107,0.0031666665,0.0003710716,0.0013769395,0.001664158,0.00027016958],"domain_scores_gemma":[0.98994714,0.0077707088,0.00054658466,0.0010366964,0.00051114603,0.000187757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050019235,0.0013713602,0.0030405615,0.002578443,0.001032122,0.0028304886,0.0032203575,0.002302014,0.0018687574],"category_scores_gemma":[0.014256622,0.00093323644,0.0020733105,0.00524364,0.0028660751,0.0059729926,0.0025606188,0.00270591,0.00038896798],"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.00026203867,0.00033816588,0.0043979306,0.0016569719,0.0006726508,0.00043106792,0.00054398447,0.45074216,0.0039005573,0.33166638,0.013024544,0.19236358],"study_design_scores_gemma":[0.000048301084,0.00014504227,0.0006379319,0.00012968441,0.00010337302,0.00044821604,0.00015948719,0.593562,0.0022404264,0.39376384,0.008724886,0.0000367187],"about_ca_topic_score_codex":0.0013114923,"about_ca_topic_score_gemma":0.0011890959,"teacher_disagreement_score":0.0050019235,"about_ca_system_score_codex":0.0015749787,"about_ca_system_score_gemma":0.0015248008,"threshold_uncertainty_score":0.026452959},"labels":[],"label_agreement":null},{"id":"W1971426115","doi":"10.1145/1146381.1146410","title":"Oracle size","year":2006,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"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é du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Institut national de recherche en informatique et en automatique (INRIA); Université du Québec en Outaouais","keywords":"Oracle; Computer science; Dissemination; Node (physics); Broadcast communication network; Task (project management); Communication complexity; Computer network; Measure (data warehouse); Network topology; Telecommunications network; Time complexity; Distributed computing; Theoretical computer science; Data mining; Algorithm; Telecommunications","score_opus":0.02255457743138917,"score_gpt":0.25477995277378834,"score_spread":0.23222537534239918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971426115","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.08402198,0.004169997,0.82772636,0.010895155,0.00075844413,0.0005608303,0.0047272583,0.0048154714,0.062324565],"genre_scores_gemma":[0.70523494,0.002796605,0.2532383,0.0022976906,0.001568974,0.0009645738,0.006503865,0.0030835855,0.024311548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9872255,0.0037671733,0.0009543622,0.00307506,0.0031946988,0.0017832062],"domain_scores_gemma":[0.8762348,0.09899709,0.005028823,0.011787484,0.004319931,0.0036318086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007871462,0.0019134925,0.0033590584,0.0018861791,0.001609403,0.007967703,0.0073671606,0.0036640551,0.03874749],"category_scores_gemma":[0.08074261,0.0011076819,0.0022257396,0.002400858,0.0033265292,0.021965457,0.004597356,0.005462038,0.004560627],"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.0020447331,0.00053906796,0.008414202,0.0022551345,0.00033091728,0.0005047258,0.00079721754,0.1753545,0.007112909,0.568434,0.047531612,0.18668102],"study_design_scores_gemma":[0.00022088252,0.00040698602,0.0015198243,0.00019594065,0.00018208928,0.00085037126,0.00023698229,0.32751054,0.0052584265,0.64317805,0.02035382,0.00008601314],"about_ca_topic_score_codex":0.001782898,"about_ca_topic_score_gemma":0.0012909018,"teacher_disagreement_score":0.03874749,"about_ca_system_score_codex":0.0037838107,"about_ca_system_score_gemma":0.0031759976,"threshold_uncertainty_score":0.1296233},"labels":[],"label_agreement":null},{"id":"W1971650774","doi":"10.1137/s0097539702415950","title":"Counting Complexity Classes for Numeric Computations I: Semilinear Sets","year":2003,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","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":"Toronto Metropolitan University","funders":"","keywords":"Betti number; Complexity class; Completeness (order theory); Computation; Mathematics; Class (philosophy); Discrete mathematics; Characterization (materials science); Counting problem; Euler's formula; Euler characteristic; Combinatorics; Model of computation; Transfer (computing); Computational complexity theory; Time complexity; Algorithm; Computer science; Physics; Mathematical analysis","score_opus":0.059710073086277904,"score_gpt":0.3185660829249645,"score_spread":0.2588560098386866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971650774","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.4190437,0.0010251431,0.52363986,0.0021393024,0.00012659418,0.00018406805,0.0009988266,0.00057005393,0.052272446],"genre_scores_gemma":[0.93058443,0.00035817872,0.059646036,0.00024857835,0.00022456369,0.00025866504,0.0007468959,0.00009926983,0.007833388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984238,0.00019594024,0.000110678695,0.00036152732,0.0006333642,0.00027477933],"domain_scores_gemma":[0.99483865,0.0025386664,0.0006936411,0.0009806276,0.00054231164,0.00040602975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009790722,0.0007369586,0.00071241375,0.002491046,0.0014243326,0.00525387,0.0016423013,0.0009561085,0.005935541],"category_scores_gemma":[0.0051413425,0.000373401,0.0014757034,0.002871377,0.0035538545,0.008290591,0.0024813607,0.0034605497,0.0005638263],"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.00003839201,0.000035202946,0.0007988144,0.000059314712,0.000007775138,0.00002379512,0.00017787161,0.0041281716,0.0011613871,0.9831215,0.0008309089,0.0096169505],"study_design_scores_gemma":[0.000011731965,0.000025737212,0.00089480926,0.000024655845,0.000013605478,0.00009860138,0.0000949296,0.053065196,0.003837056,0.937092,0.004817506,0.000024114432],"about_ca_topic_score_codex":0.0010255998,"about_ca_topic_score_gemma":0.00079420995,"teacher_disagreement_score":0.005935541,"about_ca_system_score_codex":0.0047292733,"about_ca_system_score_gemma":0.0009563294,"threshold_uncertainty_score":0.03431344},"labels":[],"label_agreement":null},{"id":"W1972068724","doi":"10.1007/s00037-007-0220-2","title":"A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness","year":2006,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":44,"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; University of Washington; National Science Foundation","keywords":"Corollary; Communication complexity; Upper and lower bounds; Mathematics; Product (mathematics); Direct product; Combinatorics; Function (biology); Discrete mathematics; Simple (philosophy); Computer science","score_opus":0.0649624365213801,"score_gpt":0.2936631913235376,"score_spread":0.22870075480215746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972068724","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.0676839,0.0005575976,0.9037819,0.0030969006,0.000102434446,0.00018459595,0.0002218202,0.00035275353,0.024018167],"genre_scores_gemma":[0.85906947,0.0006927602,0.12755398,0.00092368084,0.000367737,0.0011665535,0.00035341707,0.0004055068,0.009466883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9864928,0.005180871,0.0006247348,0.0028639457,0.003401206,0.0014364879],"domain_scores_gemma":[0.86483383,0.10920408,0.0050071976,0.01613224,0.0029849357,0.001837762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010014251,0.0013962628,0.0022775647,0.001529192,0.002094837,0.0053912015,0.0041228444,0.0023060543,0.008307949],"category_scores_gemma":[0.052718725,0.0013232726,0.0035350332,0.0016836349,0.010264329,0.018240422,0.010572224,0.010546567,0.0014765721],"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.00031671787,0.00015292095,0.0009514508,0.00024406418,0.000071252514,0.00016027139,0.00047642575,0.038642116,0.0036645574,0.93494946,0.0023883362,0.017982455],"study_design_scores_gemma":[0.0000835664,0.00010814645,0.0004107888,0.00004891601,0.000054056858,0.00025765854,0.00005747467,0.17804375,0.0066609858,0.8109513,0.0032748207,0.000048590828],"about_ca_topic_score_codex":0.00066020613,"about_ca_topic_score_gemma":0.00042914794,"teacher_disagreement_score":0.010014251,"about_ca_system_score_codex":0.0037300207,"about_ca_system_score_gemma":0.0022690205,"threshold_uncertainty_score":0.05296105},"labels":[],"label_agreement":null},{"id":"W1972661641","doi":"10.1002/net.20099","title":"The multiroute maximum flow problem revisited","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"","keywords":"Maximum flow problem; Flow network; Vertex (graph theory); Flow (mathematics); Combinatorics; Disjoint sets; Mathematics; Path (computing); Arc (geometry); Multi-commodity flow problem; Minimum-cost flow problem; Integer programming; Mathematical optimization; Computer science; Graph","score_opus":0.01131194124672325,"score_gpt":0.22609503827198374,"score_spread":0.2147830970252605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972661641","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.1099164,0.0011870861,0.8700362,0.0023844922,0.000117228745,0.0001931867,0.00035918623,0.00044340533,0.015362842],"genre_scores_gemma":[0.6444521,0.0010085502,0.343343,0.000299284,0.0002193359,0.00033400772,0.00054884143,0.00018764076,0.009607235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986401,0.00071545906,0.000040546158,0.0002331682,0.00020916297,0.00016146054],"domain_scores_gemma":[0.9964085,0.0027126262,0.000334645,0.0001985423,0.0002069947,0.00013860302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015784363,0.0007204442,0.0012673398,0.0009586256,0.0007008133,0.001492261,0.0015959259,0.0017994154,0.0058145816],"category_scores_gemma":[0.0065203765,0.00054112554,0.00065895804,0.0013001647,0.0010952809,0.003318929,0.0013216453,0.0015552205,0.0004282619],"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.0002614705,0.00018016223,0.0008329727,0.00041084486,0.00006742817,0.00035589433,0.00022675033,0.69217116,0.001233997,0.2090727,0.007486448,0.08770015],"study_design_scores_gemma":[0.00007310779,0.000047557227,0.00026718577,0.000031162985,0.000014927714,0.00021107064,0.00005538375,0.83882254,0.0007519532,0.15440714,0.005304244,0.000013769956],"about_ca_topic_score_codex":0.0021704114,"about_ca_topic_score_gemma":0.0020750398,"teacher_disagreement_score":0.0058145816,"about_ca_system_score_codex":0.0013757665,"about_ca_system_score_gemma":0.00087461807,"threshold_uncertainty_score":0.019451737},"labels":[],"label_agreement":null},{"id":"W1973129994","doi":"10.1007/bf02896389","title":"Generalizedk-multiway cut problems","year":2006,"lang":"en","type":"article","venue":"Journal of Applied Mathematics and Computing","topic":"Complexity and Algorithms in Graphs","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 Lethbridge","funders":"","keywords":"Mathematics; Theory of computation; Vertex (graph theory); Combinatorics; Local search (optimization); Set (abstract data type); Simple (philosophy); Greedy algorithm; Approximation algorithm; Graph; Independent set; Discrete mathematics; Mathematical optimization; Algorithm; Computer science","score_opus":0.016441978761371778,"score_gpt":0.22698239764784522,"score_spread":0.21054041888647346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973129994","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.3897227,0.0045898296,0.5443865,0.01018223,0.00078292016,0.0007377847,0.0035102505,0.00067900727,0.045408737],"genre_scores_gemma":[0.76050013,0.0027422162,0.18256888,0.0012741785,0.00085957977,0.00096152944,0.0050766165,0.00056444004,0.04545243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972037,0.0008604917,0.00014507966,0.0007604118,0.00048241825,0.0005480296],"domain_scores_gemma":[0.9917195,0.004550338,0.00084630295,0.0012214344,0.0007450887,0.0009173225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002336924,0.0024502198,0.0039268443,0.0015558456,0.0023250221,0.0061440873,0.0068619745,0.004430712,0.024030779],"category_scores_gemma":[0.010653667,0.0014014596,0.0026821627,0.0039893156,0.003442356,0.011324875,0.0064825024,0.0066825124,0.0015397809],"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.00074527034,0.00038899158,0.0021795286,0.0016316792,0.00024443117,0.0006922218,0.00075672765,0.17554623,0.0025273836,0.7022848,0.029287472,0.08371528],"study_design_scores_gemma":[0.00015470949,0.000053113163,0.00091568806,0.00008022618,0.000054668657,0.0004200718,0.00033871963,0.14217688,0.000876978,0.8489655,0.005914109,0.000049225426],"about_ca_topic_score_codex":0.002124391,"about_ca_topic_score_gemma":0.0027844964,"teacher_disagreement_score":0.024030779,"about_ca_system_score_codex":0.0030533008,"about_ca_system_score_gemma":0.0019006697,"threshold_uncertainty_score":0.08039093},"labels":[],"label_agreement":null},{"id":"W1974465585","doi":"10.1007/s40305-014-0053-z","title":"Simultaneous Approximation of Multi-criteria Submodular Function Maximization","year":2014,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":20,"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 New Brunswick","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Maximization; Mathematics; Function (biology); Approximation algorithm; Characterization (materials science); Mathematical optimization; Combinatorics; Physics","score_opus":0.04455253395858549,"score_gpt":0.32998570413484907,"score_spread":0.2854331701762636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974465585","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.024669943,0.00092763634,0.9687817,0.00030945064,0.00008565953,0.00009292766,0.00019939507,0.00028583524,0.004647374],"genre_scores_gemma":[0.61236376,0.00075840804,0.3783029,0.00027500905,0.00019931348,0.0005247626,0.00081379747,0.00024984256,0.0065123076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975236,0.0011071571,0.00008901574,0.00044835525,0.00051958655,0.00031224333],"domain_scores_gemma":[0.9961248,0.002727646,0.0002556934,0.00028903535,0.00041225343,0.00019054489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030350825,0.0023676734,0.0037603122,0.0017524359,0.0007745189,0.0022529692,0.0035020723,0.0022381458,0.0044288174],"category_scores_gemma":[0.00899506,0.0015979132,0.0021988375,0.0035567365,0.0010041341,0.0027349475,0.002892989,0.0024670218,0.00067797885],"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.0002359778,0.00025736255,0.00090746395,0.00036092428,0.00021591726,0.00015504962,0.000101009005,0.9034742,0.0012389576,0.023024268,0.005875125,0.064153746],"study_design_scores_gemma":[0.000010428422,0.000030221372,0.00006181426,0.0000071987306,0.000014887467,0.000023524153,0.000009027759,0.99473,0.00013601143,0.004740237,0.00023242431,0.00000419865],"about_ca_topic_score_codex":0.004691554,"about_ca_topic_score_gemma":0.004723688,"teacher_disagreement_score":0.004691554,"about_ca_system_score_codex":0.0017233603,"about_ca_system_score_gemma":0.0021535216,"threshold_uncertainty_score":0.016051233},"labels":[],"label_agreement":null},{"id":"W1974542877","doi":"10.5555/1283383.1283520","title":"Approximation algorithms for prize collecting forest problems with submodular penalty functions","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":37,"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":"Submodular set function; Rounding; Penalty method; Steiner tree problem; Approximation algorithm; Mathematical optimization; Function (biology); Computer science; Mathematics; Algorithm; Minification; Dual (grammatical number); Tree (set theory); Combinatorics","score_opus":0.03007951308552398,"score_gpt":0.2687336219725512,"score_spread":0.2386541088870272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974542877","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.036146786,0.0011197126,0.9547768,0.00067090493,0.000096526965,0.00014270522,0.00023996859,0.0005733344,0.006233307],"genre_scores_gemma":[0.41689056,0.0011297923,0.57267517,0.0004079121,0.00021811319,0.0004126112,0.000826919,0.00031579932,0.0071231695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988458,0.00049787253,0.000042990017,0.000164021,0.00020928228,0.00023990167],"domain_scores_gemma":[0.99761707,0.0016828782,0.00021044958,0.00021485444,0.00015160326,0.00012301502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026881783,0.0014825489,0.0020071818,0.00081165397,0.00083268346,0.0018387195,0.0025573533,0.001723316,0.0050324877],"category_scores_gemma":[0.006358935,0.0005984383,0.0010475193,0.0023500388,0.0007701196,0.0036037827,0.0016314596,0.0025954342,0.00077734154],"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.0004116482,0.00038114024,0.0010898747,0.00037305435,0.00009824281,0.0001046891,0.00016304471,0.7495535,0.0011252917,0.09028198,0.011591609,0.14482588],"study_design_scores_gemma":[0.000042744137,0.000045481116,0.00009613809,0.000017205259,0.0000134102065,0.000048042577,0.000038097634,0.94606566,0.00025584994,0.052250996,0.0011183723,0.000008048814],"about_ca_topic_score_codex":0.0025843163,"about_ca_topic_score_gemma":0.00418009,"teacher_disagreement_score":0.0050324877,"about_ca_system_score_codex":0.0015501175,"about_ca_system_score_gemma":0.0014562946,"threshold_uncertainty_score":0.016835332},"labels":[],"label_agreement":null},{"id":"W1975508655","doi":"10.1109/focs.2013.67","title":"An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Approximation algorithm; Mathematics; Undirected graph; Graph; Node (physics); Tree (set theory); Discrete mathematics; Computer science","score_opus":0.025581953325768878,"score_gpt":0.2619176437730184,"score_spread":0.23633569044724953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975508655","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.07208511,0.00094615004,0.9044339,0.0020817851,0.00019685627,0.0003100004,0.0008292845,0.0031421895,0.015974736],"genre_scores_gemma":[0.33731347,0.00036769718,0.6513128,0.00045962894,0.00011311617,0.0004363933,0.0014363563,0.00040616616,0.008154284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990386,0.00030053625,0.000043636974,0.00019188023,0.00020523192,0.00022026298],"domain_scores_gemma":[0.99858236,0.00074966124,0.000119891694,0.0002868585,0.0001361338,0.00012511834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014673434,0.0012132031,0.0016621242,0.00072382484,0.0007614078,0.0014569617,0.0028361336,0.001395416,0.007374051],"category_scores_gemma":[0.004034573,0.0005453832,0.0008327203,0.0020746083,0.0006533138,0.0026544328,0.0017725645,0.001996726,0.0016879058],"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.0012064399,0.0005701825,0.001474651,0.0005081058,0.0001093808,0.00022018215,0.00032909343,0.5708048,0.0052122856,0.062892765,0.03926787,0.31740427],"study_design_scores_gemma":[0.0001174443,0.00006966577,0.0001703102,0.0000193979,0.00001638386,0.00009692968,0.000060858452,0.9628955,0.0008323931,0.033357393,0.0023533537,0.000010388187],"about_ca_topic_score_codex":0.0033014603,"about_ca_topic_score_gemma":0.005251615,"teacher_disagreement_score":0.007374051,"about_ca_system_score_codex":0.0019979426,"about_ca_system_score_gemma":0.0027336837,"threshold_uncertainty_score":0.024668634},"labels":[],"label_agreement":null},{"id":"W1976459503","doi":"10.1007/s00493-006-0016-z","title":"Network Design Via Iterative Rounding Of Setpair Relaxations","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":54,"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; University of Waterloo","funders":"","keywords":"Rounding; Mathematics; Combinatorics; Linear programming relaxation; Vertex (graph theory); Omega; Approximation algorithm; Discrete mathematics; Relaxation (psychology); Linear programming; Integer (computer science); Network planning and design; Vertex connectivity; Undirected graph; Graph; Mathematical optimization; Computer science","score_opus":0.023675307206910665,"score_gpt":0.23164786684606414,"score_spread":0.20797255963915348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976459503","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.014173559,0.00019594806,0.9720081,0.0002310815,0.000096197815,0.000107000844,0.00009831337,0.00030684,0.012782921],"genre_scores_gemma":[0.3112531,0.00039554408,0.67970514,0.00023429269,0.00011147528,0.00046838768,0.0003458321,0.00033501303,0.0071512363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984617,0.00071351626,0.000060997307,0.000230239,0.00033161498,0.00020202223],"domain_scores_gemma":[0.99670106,0.0022147156,0.00020064751,0.0004459297,0.0003154224,0.00012212463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022329988,0.0016616249,0.0014864136,0.0012380995,0.0007842761,0.0021067855,0.0024510978,0.0015582792,0.01151084],"category_scores_gemma":[0.008071011,0.00095546007,0.001338929,0.0013960919,0.00097059447,0.002672438,0.002552279,0.003108945,0.0015411753],"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.00020471719,0.0001434427,0.00027574756,0.000274266,0.000060965813,0.00008704007,0.00021160292,0.7628262,0.0033043176,0.112980396,0.006897138,0.11273411],"study_design_scores_gemma":[0.00003950041,0.00009771458,0.000053569373,0.000043218235,0.000021840176,0.00004744807,0.00007724708,0.9229692,0.0016756036,0.07238744,0.0025715765,0.000015523336],"about_ca_topic_score_codex":0.0012369126,"about_ca_topic_score_gemma":0.0018733401,"teacher_disagreement_score":0.01151084,"about_ca_system_score_codex":0.0012931961,"about_ca_system_score_gemma":0.001047192,"threshold_uncertainty_score":0.03850764},"labels":[],"label_agreement":null},{"id":"W1976584101","doi":"10.1145/2432622.2432628","title":"Steiner Tree Approximation via Iterative Randomized Rounding","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":280,"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":"Office of Naval Research; European Research Council; Division of Computing and Communication Foundations; Alexander von Humboldt-Stiftung; Ministerstwo Edukacji i Nauki; Fundacja na rzecz Nauki Polskiej; École Polytechnique Fédérale de Lausanne","keywords":"Steiner tree problem; Rounding; Mathematics; Combinatorics; Linear programming relaxation; Approximation algorithm; Randomized rounding; Tree (set theory); Sequence (biology); k-minimum spanning tree; Relaxation (psychology); Discrete mathematics; Minimum spanning tree; Iterative method; Mathematical optimization; Tree structure; K-ary tree; Computer science; Linear programming; Binary tree","score_opus":0.01898129140375479,"score_gpt":0.24302492648471866,"score_spread":0.22404363508096387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976584101","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.028208105,0.00046759035,0.96191293,0.0005607992,0.00009299698,0.00016167937,0.00017967794,0.001669955,0.0067462367],"genre_scores_gemma":[0.34962517,0.0004038781,0.6454604,0.0004008299,0.00012324884,0.0005189707,0.00054672465,0.00032933344,0.002591488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99593383,0.0016109779,0.00020059347,0.00060856604,0.0010054881,0.0006405159],"domain_scores_gemma":[0.9933723,0.0043050665,0.0005126798,0.0011672352,0.00048541542,0.00015730303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028378586,0.0015074183,0.0021047986,0.0010952741,0.0009169897,0.0018268758,0.0025180492,0.0015030927,0.0038092684],"category_scores_gemma":[0.011709624,0.0008173664,0.0017664495,0.0018605528,0.0012033908,0.0026376245,0.0023161827,0.0032845594,0.0011190936],"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.0007310292,0.0003268339,0.001066172,0.00027807427,0.00013633342,0.00022447911,0.00019776348,0.81059724,0.0066366023,0.06754618,0.009339406,0.10291981],"study_design_scores_gemma":[0.000077943805,0.00005162478,0.00008015446,0.000015203008,0.000020639447,0.000048442264,0.000023240349,0.97234297,0.0010823237,0.02526216,0.000985727,0.00000955365],"about_ca_topic_score_codex":0.0028099527,"about_ca_topic_score_gemma":0.0028127802,"teacher_disagreement_score":0.0038092684,"about_ca_system_score_codex":0.0017985002,"about_ca_system_score_gemma":0.0023383496,"threshold_uncertainty_score":0.0150081515},"labels":[],"label_agreement":null},{"id":"W1976939532","doi":"10.1016/j.tcs.2015.03.042","title":"Finding median in read-only memory on integer input","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","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":"Sequence (biology); Integer (computer science); Logarithm; Algorithm; Binary number; Mathematics; Combinatorics; Selection (genetic algorithm); Simple (philosophy); Upper and lower bounds; Space (punctuation); Time complexity; Binary logarithm; Computer science; Discrete mathematics; Arithmetic; Artificial intelligence","score_opus":0.035885963671493847,"score_gpt":0.2864995203129722,"score_spread":0.2506135566414784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976939532","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.5410644,0.0037485473,0.3473351,0.006854683,0.0007032679,0.0005051153,0.011587332,0.026776543,0.061424978],"genre_scores_gemma":[0.7526166,0.0006072658,0.22286485,0.0009182982,0.00032292746,0.00028856075,0.005642498,0.0017385983,0.015000419],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787176,0.0003316622,0.00018294617,0.0007350682,0.00034044686,0.0005381515],"domain_scores_gemma":[0.99182546,0.0048853997,0.0006779347,0.0018620603,0.00047976404,0.00026928404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010471512,0.0018633566,0.002164569,0.0012605469,0.0013531762,0.0043148315,0.0025803912,0.0019496462,0.022736493],"category_scores_gemma":[0.008125463,0.0008355865,0.0011634573,0.0032860318,0.0009840572,0.010433318,0.0025193887,0.0017088368,0.005041535],"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.010061832,0.0012586974,0.010050272,0.002727758,0.00048500413,0.00086487056,0.0010181292,0.12164833,0.0588413,0.036679167,0.09280462,0.66356003],"study_design_scores_gemma":[0.0014335562,0.0011811139,0.003466579,0.0003456851,0.00050382584,0.000830727,0.001866932,0.51956457,0.09289171,0.357021,0.020733105,0.00016112473],"about_ca_topic_score_codex":0.0023273947,"about_ca_topic_score_gemma":0.006435861,"teacher_disagreement_score":0.022736493,"about_ca_system_score_codex":0.002070403,"about_ca_system_score_gemma":0.0034684087,"threshold_uncertainty_score":0.07606113},"labels":[],"label_agreement":null},{"id":"W1977673587","doi":"10.1007/s00220-014-2260-1","title":"A Combinatorial Approach to Nonlocality and Contextuality","year":2015,"lang":"en","type":"article","venue":"Communications in Mathematical Physics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":185,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Agence Nationale de la Recherche","keywords":"Kochen–Specker theorem; Quantum nonlocality; Quantum; Formalism (music); Graph; Probabilistic logic; Diagrammatic reasoning; Qubit; Hierarchy","score_opus":0.1682497022073137,"score_gpt":0.3497480707735672,"score_spread":0.18149836856625348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977673587","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.04412895,0.0021896814,0.8545365,0.008687113,0.00036772553,0.00007292916,0.00033212488,0.00035542814,0.089329526],"genre_scores_gemma":[0.8071407,0.0018037321,0.16465431,0.0015134731,0.0021122089,0.00029072317,0.00034692607,0.0004211429,0.02171678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768984,0.0009760018,0.00012578921,0.0005731887,0.00042811854,0.00020698669],"domain_scores_gemma":[0.9877555,0.0073538832,0.0008649285,0.0021233473,0.0010549257,0.00084748206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002217776,0.00084072386,0.0013910129,0.0038692914,0.0032077972,0.0057687024,0.0029279888,0.0020545304,0.011612912],"category_scores_gemma":[0.00966404,0.0010399286,0.0017718357,0.00341699,0.010376076,0.018752988,0.005692108,0.005560557,0.00077338493],"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.0000022979316,0.0000035442195,0.000032100423,0.000013429582,0.0000020400253,0.000013556756,0.000048435584,0.0003210546,0.00005589867,0.9986356,0.00023714367,0.00063478516],"study_design_scores_gemma":[0.0000034959796,0.0000035805026,0.000040977033,0.0000066311927,0.000006168232,0.000039177376,0.000038321108,0.002857201,0.00007097348,0.9949728,0.0019549879,0.0000056855583],"about_ca_topic_score_codex":0.0011954756,"about_ca_topic_score_gemma":0.0013530441,"teacher_disagreement_score":0.011612912,"about_ca_system_score_codex":0.0022343697,"about_ca_system_score_gemma":0.0009497178,"threshold_uncertainty_score":0.038849115},"labels":[],"label_agreement":null},{"id":"W1978372231","doi":"10.1016/j.orl.2009.01.010","title":"An edge-reduction algorithm for the vertex cover problem","year":2009,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Vertex cover; Edge cover; Cover (algebra); Vertex (graph theory); Feedback vertex set; Reduction (mathematics); Algorithm; Combinatorics; Mathematics; Upper and lower bounds; Approximation algorithm; Graph","score_opus":0.057983112540506636,"score_gpt":0.3598596864221159,"score_spread":0.30187657388160927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978372231","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.094365396,0.0010350794,0.86035347,0.002599451,0.00042952813,0.00068198104,0.0012412935,0.0039046803,0.03538908],"genre_scores_gemma":[0.25351572,0.00061469484,0.72523737,0.0006366468,0.00030500363,0.0005798443,0.003684311,0.00072017725,0.0147062335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985216,0.00032456362,0.00007165292,0.0003053081,0.00048500567,0.00029177498],"domain_scores_gemma":[0.99736637,0.0014612937,0.00010368208,0.00058966986,0.00030102947,0.00017801828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008107148,0.0012717552,0.001692529,0.001936372,0.0015393045,0.0028731304,0.0032697795,0.002256257,0.009560433],"category_scores_gemma":[0.0044319322,0.00073651,0.0020452384,0.0027742486,0.0010013575,0.0038674981,0.0031574953,0.003157036,0.0023793797],"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.001516298,0.0013610465,0.0016065688,0.0006125284,0.0002113077,0.00031818784,0.0005143435,0.10579675,0.01614453,0.10062283,0.05029872,0.72099686],"study_design_scores_gemma":[0.00055696524,0.00027211034,0.0014598552,0.00008003944,0.00021002007,0.0004846489,0.00027820191,0.6715924,0.010251005,0.29670948,0.018033318,0.000071974006],"about_ca_topic_score_codex":0.0028096589,"about_ca_topic_score_gemma":0.003377288,"teacher_disagreement_score":0.009560433,"about_ca_system_score_codex":0.0015253912,"about_ca_system_score_gemma":0.0023105785,"threshold_uncertainty_score":0.03198284},"labels":[],"label_agreement":null},{"id":"W1980190601","doi":"10.1145/1721837.1721842","title":"Comparison-based time-space lower bounds for selection","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":42,"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":"Upper and lower bounds; Binary logarithm; Mathematics; Combinatorics; Log-log plot; Streaming algorithm; Running time; Space (punctuation); Mathematical proof; Selection (genetic algorithm); Discrete mathematics; Randomized algorithm; Deterministic algorithm; Time complexity; Algorithm; Computer science","score_opus":0.024947962434627175,"score_gpt":0.2988886896203971,"score_spread":0.27394072718576995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980190601","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.07369122,0.006154881,0.8527517,0.010268671,0.0006889009,0.00051511877,0.0014031654,0.003828711,0.05069763],"genre_scores_gemma":[0.67763245,0.0038816303,0.28080806,0.003990192,0.0028251798,0.0020075715,0.002093577,0.003462176,0.023299046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97882915,0.0047334386,0.00096137205,0.004519468,0.0062972824,0.0046592443],"domain_scores_gemma":[0.8934503,0.080473036,0.0053162556,0.01422699,0.0038612657,0.0026721477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010638444,0.0036657616,0.004645961,0.003003168,0.0039486857,0.008690389,0.008493712,0.004247738,0.026527558],"category_scores_gemma":[0.05833688,0.0019533928,0.004831475,0.006526199,0.006574535,0.033675183,0.009762943,0.0115923835,0.0053468077],"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.004937831,0.0015816633,0.007687297,0.0019903968,0.00044006124,0.0005660555,0.0011063063,0.2530101,0.027883211,0.4696181,0.034481134,0.1966978],"study_design_scores_gemma":[0.00035524918,0.0007681978,0.0015292787,0.00019045536,0.00028786273,0.00067486335,0.00026019788,0.46524003,0.01570187,0.5023503,0.012518583,0.0001230619],"about_ca_topic_score_codex":0.0019681521,"about_ca_topic_score_gemma":0.0023157045,"teacher_disagreement_score":0.026527558,"about_ca_system_score_codex":0.007550335,"about_ca_system_score_gemma":0.0060105743,"threshold_uncertainty_score":0.08874351},"labels":[],"label_agreement":null},{"id":"W1980582286","doi":"","title":"Basis reduction and the complexity of branch-and-bound","year":2010,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"University of British Columbia","funders":"","keywords":"Mathematics; Upper and lower bounds; Lattice reduction; Combinatorics; Matrix (chemical analysis); Integer matrix; Integer (computer science); Reduction (mathematics); Lattice (music); Matrix multiplication; Constraint (computer-aided design); Branch and bound; Discrete mathematics; Mathematical optimization; Symmetric matrix; Computer science; Nonnegative matrix; Eigenvalues and eigenvectors","score_opus":0.03230018893325343,"score_gpt":0.25104429026433395,"score_spread":0.21874410133108052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980582286","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.35245386,0.0026149375,0.57186323,0.011796748,0.00028032254,0.00044900886,0.0019158542,0.0032556152,0.055370495],"genre_scores_gemma":[0.7566933,0.0011308714,0.22737029,0.0010164732,0.00025154787,0.00071934366,0.0024265235,0.00095352635,0.009438179],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954537,0.0018939589,0.00016774434,0.00046357035,0.0011601977,0.0008607447],"domain_scores_gemma":[0.98339003,0.012445436,0.00055103464,0.0023795685,0.0007872087,0.00044680954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037624547,0.0010492826,0.00169774,0.0013098352,0.0014278678,0.0042799804,0.002583637,0.0014144481,0.00674101],"category_scores_gemma":[0.020611592,0.0007333988,0.0012702963,0.0026121307,0.002484241,0.0063125393,0.0033636459,0.0043430687,0.0015736297],"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.0018295629,0.0007153965,0.002920764,0.00056565035,0.00014528735,0.00023772231,0.00065056485,0.41342646,0.0076920623,0.3473005,0.032875508,0.1916405],"study_design_scores_gemma":[0.00011685822,0.000059092345,0.0002523449,0.000031695257,0.00003206838,0.0000415974,0.00008926959,0.69103754,0.0016793323,0.30416265,0.0024766987,0.0000209377],"about_ca_topic_score_codex":0.003343072,"about_ca_topic_score_gemma":0.003272239,"teacher_disagreement_score":0.00674101,"about_ca_system_score_codex":0.0026413666,"about_ca_system_score_gemma":0.0030870815,"threshold_uncertainty_score":0.02255094},"labels":[],"label_agreement":null},{"id":"W1980738047","doi":"10.2168/lmcs-8(3:5)2012","title":"Formalizing Randomized Matching Algorithms","year":2012,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"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":"Bipartite graph; Correctness; 3-dimensional matching; Blossom algorithm; Lemma (botany); Perfect graph theorem; Algorithm; Matching (statistics); Factor-critical graph; Computer science; Discrete mathematics; Mathematics; Theoretical computer science; Graph; Voltage graph; Line graph","score_opus":0.08537728207017845,"score_gpt":0.39757137192269176,"score_spread":0.3121940898525133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980738047","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.0038854233,0.0002940015,0.984519,0.00090678275,0.00012057264,0.00014951253,0.00018861334,0.0007838762,0.009152249],"genre_scores_gemma":[0.27390373,0.0011559562,0.71012104,0.001390999,0.0005283694,0.0010670736,0.0009500904,0.00066478166,0.010218025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98080873,0.0067804093,0.0015197827,0.0038413028,0.0052437102,0.0018060582],"domain_scores_gemma":[0.97700477,0.015370242,0.0011479275,0.0041883537,0.0019456432,0.00034314606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011528247,0.001468442,0.00156954,0.0024989424,0.0019395503,0.007112833,0.00684275,0.003745958,0.009845927],"category_scores_gemma":[0.040041935,0.0014214119,0.0030022087,0.0028776352,0.007599775,0.01683847,0.007191394,0.0060806107,0.0021633396],"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.000015596228,0.000021170672,0.000069130234,0.000049308233,0.000010140435,0.000021376067,0.000062120664,0.00956394,0.00022905182,0.98325044,0.0006008709,0.0061068404],"study_design_scores_gemma":[0.000036064284,0.000019195857,0.000036724072,0.000034452612,0.000015391068,0.00003322971,0.00002954711,0.08366531,0.00086297706,0.9091195,0.006130344,0.000017253164],"about_ca_topic_score_codex":0.0039170035,"about_ca_topic_score_gemma":0.0029964964,"teacher_disagreement_score":0.011528247,"about_ca_system_score_codex":0.005875064,"about_ca_system_score_gemma":0.005593563,"threshold_uncertainty_score":0.06096798},"labels":[],"label_agreement":null},{"id":"W1981850523","doi":"10.1007/s00037-007-0222-0","title":"The Complexity of Tensor Circuit Evaluation","year":2007,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"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":"Semiring; Mathematics; Discrete mathematics; Combinatorics; Tensor (intrinsic definition); Boolean circuit; Matrix exponential; Kleene algebra; Complexity class; Diagonal; Matrix (chemical analysis); Boolean function; Time complexity; Pure mathematics","score_opus":0.16958956963516084,"score_gpt":0.3361128090989626,"score_spread":0.16652323946380174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981850523","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.35940257,0.0037378008,0.5147291,0.015260356,0.0006802946,0.00022153056,0.0020975298,0.0025794061,0.10129139],"genre_scores_gemma":[0.9091459,0.0014618452,0.07086065,0.00070078723,0.00063651265,0.00015844415,0.0010933022,0.0007395907,0.015202916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951599,0.0014576856,0.0002462485,0.0006821735,0.0015680237,0.0008858502],"domain_scores_gemma":[0.9729865,0.019361794,0.0008817229,0.004218553,0.0018423924,0.0007090737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033926244,0.00082816085,0.0016086464,0.0016384488,0.0019001785,0.0070917765,0.0029695865,0.0016825421,0.016435483],"category_scores_gemma":[0.026994381,0.0007684445,0.0017384811,0.0032554143,0.0037864628,0.021084094,0.002936399,0.0037386317,0.0013931447],"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.00055353646,0.00011532801,0.0017186931,0.00031576937,0.00006212349,0.00011430248,0.00032070317,0.052151144,0.0020359769,0.86203486,0.014280823,0.06629678],"study_design_scores_gemma":[0.000025312816,0.000017872098,0.0003004623,0.000020907954,0.00003214417,0.000056184275,0.000047171474,0.1120214,0.0010222374,0.8845143,0.0019235619,0.00001852328],"about_ca_topic_score_codex":0.005548585,"about_ca_topic_score_gemma":0.0050620367,"teacher_disagreement_score":0.016435483,"about_ca_system_score_codex":0.0056526433,"about_ca_system_score_gemma":0.0036634563,"threshold_uncertainty_score":0.054982126},"labels":[],"label_agreement":null},{"id":"W1982713256","doi":"10.1016/j.disopt.2010.08.001","title":"The minimum spanning tree problem with conflict constraints and its variations","year":2010,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":76,"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 New Brunswick; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Time complexity; k-minimum spanning tree; Clique; Steiner tree problem; Bounded function; Spanning tree; Graph; Minimum spanning tree; Heuristic; Discrete mathematics; Mathematical optimization; Tree structure; K-ary tree; Binary tree","score_opus":0.01236291145485941,"score_gpt":0.23366009205835583,"score_spread":0.22129718060349643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982713256","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.05027585,0.0067553697,0.9160095,0.0032744373,0.00030854405,0.00006524428,0.0005294501,0.00015319129,0.022628378],"genre_scores_gemma":[0.5958053,0.008354646,0.37535635,0.0008041437,0.0016704473,0.00031247476,0.0010431408,0.00035149138,0.01630199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984176,0.0006336678,0.00007909257,0.00028817824,0.00045881976,0.00012256746],"domain_scores_gemma":[0.9940252,0.004437894,0.00058319664,0.00039019366,0.00031007506,0.00025343307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021239857,0.0010015406,0.0018998601,0.001165006,0.0008828785,0.0029108205,0.0026513075,0.0022932235,0.0034911947],"category_scores_gemma":[0.010137032,0.00071158155,0.0010240274,0.0047167055,0.001709621,0.00757996,0.0022225736,0.0037479675,0.00044573075],"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.00020429552,0.00018355262,0.00048626933,0.0003603371,0.00008751558,0.0001681802,0.00014333628,0.39287776,0.0012329817,0.5328387,0.010457985,0.060958955],"study_design_scores_gemma":[0.00003559254,0.0000276556,0.00023192634,0.000024767349,0.00002203694,0.00015486075,0.000040718027,0.51382864,0.00025246124,0.48069304,0.004668837,0.00001945087],"about_ca_topic_score_codex":0.0018004366,"about_ca_topic_score_gemma":0.0015353485,"teacher_disagreement_score":0.0034911947,"about_ca_system_score_codex":0.0013234284,"about_ca_system_score_gemma":0.001183654,"threshold_uncertainty_score":0.011679232},"labels":[],"label_agreement":null},{"id":"W1983574453","doi":"10.5555/982792.982947","title":"Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ","year":2004,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"University of British Columbia","funders":"","keywords":"Bandwidth (computing); Computer science; Network packet; Computer network; Upper and lower bounds; Scheduling (production processes); Bandwidth allocation; Real-time computing; Dynamic bandwidth allocation; Algorithm; Mathematics; Mathematical optimization","score_opus":0.020722902244617942,"score_gpt":0.24388518050995478,"score_spread":0.22316227826533683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983574453","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.28958285,0.00070479733,0.69942075,0.0009072898,0.00016380122,0.00031209958,0.00023699032,0.0005871651,0.008084214],"genre_scores_gemma":[0.9317135,0.00024195608,0.06577755,0.00012194043,0.00006098025,0.00012808091,0.000118854805,0.00017185569,0.0016652513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837434,0.0004665412,0.000090996764,0.00030120212,0.00028608495,0.00048078835],"domain_scores_gemma":[0.9931244,0.0042926683,0.0006960907,0.0005912549,0.00064156216,0.00065404834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025489633,0.001551609,0.0017671258,0.00058712036,0.0008729863,0.0021598388,0.002212518,0.0015525467,0.0031145834],"category_scores_gemma":[0.010267919,0.0008737177,0.00026662656,0.0007490634,0.001243782,0.0027142705,0.0015985242,0.0014999348,0.0004044759],"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.00068512576,0.00028525616,0.000942368,0.00019832062,0.000053671392,0.00007438328,0.0001281918,0.9178649,0.02808415,0.022263674,0.0019663938,0.027453557],"study_design_scores_gemma":[0.00003067533,0.00008583114,0.00012679769,0.0000052021173,0.000009842526,0.000009100739,0.000033583085,0.99228513,0.0024196133,0.0046722246,0.0003133844,0.000008493815],"about_ca_topic_score_codex":0.00398767,"about_ca_topic_score_gemma":0.0043242467,"teacher_disagreement_score":0.00398767,"about_ca_system_score_codex":0.0027446735,"about_ca_system_score_gemma":0.0023415366,"threshold_uncertainty_score":0.01991409},"labels":[],"label_agreement":null},{"id":"W198434069","doi":"10.1007/978-3-642-22935-0_26","title":"Improved Approximation Algorithms for the Min-Max Tree Cover and Bounded Tree Cover Problems","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Alberta","funders":"","keywords":"Cover (algebra); Combinatorics; Bounded function; Tree (set theory); Mathematics; Approximation algorithm; Discrete mathematics; Upper and lower bounds; Graph; Vertex cover; Algorithm","score_opus":0.033483422496557655,"score_gpt":0.2419623660101153,"score_spread":0.20847894351355767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W198434069","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.03767296,0.0060204663,0.9298982,0.0018751103,0.0005426738,0.00027274512,0.0011473463,0.0026884573,0.01988203],"genre_scores_gemma":[0.20816164,0.0027214664,0.7698247,0.00062884035,0.00086608896,0.0005953161,0.003238399,0.0011151984,0.012848311],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964605,0.00088269915,0.00018004426,0.0006163232,0.0012747468,0.0005856645],"domain_scores_gemma":[0.99131536,0.005593882,0.00040048725,0.001673111,0.00066306774,0.0003540225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034960483,0.0025841307,0.003592179,0.0025165956,0.0014142212,0.0043467386,0.0071668047,0.0027828773,0.012762083],"category_scores_gemma":[0.015824167,0.0014407487,0.0028204126,0.0065734503,0.001426423,0.010115017,0.004006267,0.0067157843,0.0026706504],"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.001759296,0.0007874398,0.0013883547,0.0009064275,0.00020079856,0.000110555135,0.00038757353,0.29073334,0.003700348,0.14546785,0.04689814,0.5076599],"study_design_scores_gemma":[0.00016289989,0.0000865305,0.00041279226,0.0000589748,0.000098449935,0.00013671782,0.00006657327,0.866586,0.0013856193,0.12491301,0.0060671614,0.000025183755],"about_ca_topic_score_codex":0.005308656,"about_ca_topic_score_gemma":0.0083544785,"teacher_disagreement_score":0.012762083,"about_ca_system_score_codex":0.0054910393,"about_ca_system_score_gemma":0.0028929613,"threshold_uncertainty_score":0.042693377},"labels":[],"label_agreement":null},{"id":"W1986273263","doi":"10.1007/s00493-003-0030-3","title":"Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*","year":2003,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","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 British Columbia","funders":"","keywords":"Submodular set function; Mathematics; Time complexity; Minimum-cost flow problem; Combinatorics; Flow (mathematics); Disjoint sets; Algorithm; Flow network; Discrete mathematics","score_opus":0.02942264740207311,"score_gpt":0.2672352279507417,"score_spread":0.2378125805486686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986273263","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.07080487,0.0010074435,0.8994856,0.0017291644,0.00042507105,0.0006576858,0.00087184313,0.0050865514,0.019931756],"genre_scores_gemma":[0.23292865,0.00042967702,0.7542557,0.0006092748,0.00023677018,0.0005628281,0.0015236634,0.0011073826,0.008345947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983394,0.0004765059,0.000090726084,0.00033180843,0.00040495564,0.00035652207],"domain_scores_gemma":[0.9933437,0.004142151,0.00038760007,0.0012607803,0.0005118681,0.00035379914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032258418,0.0024401266,0.0026522218,0.0023799266,0.001922437,0.0026486358,0.0044380887,0.002389494,0.016561663],"category_scores_gemma":[0.010352971,0.001050578,0.0019407895,0.0031624038,0.0016426702,0.006118578,0.0036146494,0.0040929397,0.0020005172],"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.0017782348,0.0007919966,0.0010740447,0.00081011327,0.00013039485,0.00010441173,0.00033249104,0.16127385,0.008755679,0.123007804,0.041261584,0.66067934],"study_design_scores_gemma":[0.000441397,0.00024917567,0.000309408,0.00006325219,0.00006444611,0.000091555085,0.00008831366,0.73965824,0.00488783,0.24779686,0.0063041025,0.00004546613],"about_ca_topic_score_codex":0.0049678516,"about_ca_topic_score_gemma":0.0065939277,"teacher_disagreement_score":0.016561663,"about_ca_system_score_codex":0.0026906263,"about_ca_system_score_gemma":0.0039000544,"threshold_uncertainty_score":0.055404246},"labels":[],"label_agreement":null},{"id":"W1986446280","doi":"10.1016/j.disopt.2012.05.002","title":"Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem","year":2012,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Clique problem; Clique; Combinatorics; Approximation algorithm; Greedy algorithm; Enhanced Data Rates for GSM Evolution; Time complexity; Integer (computer science); Branch and bound; Mathematical optimization; Discrete mathematics; Algorithm; Chordal graph; Computer science; Graph","score_opus":0.023079159256816015,"score_gpt":0.27368003639205085,"score_spread":0.2506008771352348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986446280","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.04525423,0.0009644039,0.9388779,0.0011872969,0.00014586902,0.00026257377,0.00026123872,0.00064611156,0.012400422],"genre_scores_gemma":[0.4084664,0.00078827265,0.5818174,0.0005878717,0.00028414602,0.0006412001,0.0009366729,0.00051257253,0.005965492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975756,0.00087931886,0.00008121794,0.00030177852,0.000807421,0.00035467467],"domain_scores_gemma":[0.9912122,0.006778435,0.0003677931,0.00065250456,0.000704014,0.00028497548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026964429,0.0014166792,0.0017754177,0.0012480464,0.0011566927,0.0026371954,0.0033846293,0.0021630062,0.007301682],"category_scores_gemma":[0.015428658,0.0008173044,0.0011847949,0.0023501394,0.0013876435,0.0033294302,0.0023310115,0.002136458,0.00096889085],"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.0009094432,0.0003473931,0.0017246946,0.00043296567,0.00013319713,0.00011798755,0.00020863183,0.7743114,0.0046892413,0.09559946,0.012311639,0.10921391],"study_design_scores_gemma":[0.000057814545,0.00005021559,0.00019955142,0.000013466991,0.000022520211,0.00004465181,0.00003104051,0.97069776,0.00040199928,0.027604008,0.0008695076,0.0000075107155],"about_ca_topic_score_codex":0.004313074,"about_ca_topic_score_gemma":0.0053474084,"teacher_disagreement_score":0.007301682,"about_ca_system_score_codex":0.0028463332,"about_ca_system_score_gemma":0.004276153,"threshold_uncertainty_score":0.02442658},"labels":[],"label_agreement":null},{"id":"W1986858995","doi":"10.1016/j.dam.2011.07.004","title":"Randomized algorithms and upper bounds for multiple domination in graphs and networks","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","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":"Acadia University","funders":"","keywords":"Mathematics; Domination analysis; Upper and lower bounds; Combinatorics; Dominating set; Randomized algorithm; Tuple; Graph; Discrete mathematics; Algorithm; Vertex (graph theory)","score_opus":0.02782976408193505,"score_gpt":0.24571431039309174,"score_spread":0.2178845463111567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986858995","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.038384803,0.011376892,0.89083827,0.014495696,0.0012246378,0.0006273899,0.0018959091,0.0022903034,0.03886608],"genre_scores_gemma":[0.5336752,0.010584205,0.403898,0.006089756,0.0047886395,0.0030759084,0.0038396255,0.003062158,0.030986505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9765609,0.00843876,0.0009257957,0.0049454444,0.0053534005,0.0037757785],"domain_scores_gemma":[0.82137054,0.14745463,0.006743875,0.014082519,0.0053492724,0.0049991016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017706085,0.0066310633,0.007277538,0.0073538423,0.0068254774,0.015218419,0.018162103,0.007588569,0.021261165],"category_scores_gemma":[0.104061365,0.004220369,0.0055777854,0.0127066,0.012806707,0.03619957,0.015534202,0.022409663,0.0036809756],"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.001815229,0.0012184825,0.002411175,0.0014518828,0.00043131548,0.00016161747,0.00084304484,0.26266348,0.0030351595,0.60813844,0.034846388,0.0829838],"study_design_scores_gemma":[0.00027621468,0.000098211065,0.00043691174,0.00013877772,0.00017274577,0.00011556211,0.00013061601,0.38441697,0.0013920363,0.6083468,0.0043940013,0.000081085316],"about_ca_topic_score_codex":0.006100632,"about_ca_topic_score_gemma":0.0112793865,"teacher_disagreement_score":0.021261165,"about_ca_system_score_codex":0.015662296,"about_ca_system_score_gemma":0.009683134,"threshold_uncertainty_score":0.11363846},"labels":[],"label_agreement":null},{"id":"W1988044523","doi":"10.1016/j.orl.2007.10.006","title":"The equivalence of semidefinite relaxations of polynomial 0–1 and ± 1 programs via scaling","year":2007,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","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":"Carleton University","funders":"","keywords":"Scaling; Semidefinite programming; Equivalence (formal languages); Semidefinite embedding; Polynomial; Mathematics; Mathematical optimization; Computer science; Combinatorics; Discrete mathematics; Mathematical analysis; Quadratically constrained quadratic program; Geometry","score_opus":0.06701004283141021,"score_gpt":0.35075252352602226,"score_spread":0.28374248069461205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988044523","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.43312702,0.0011385807,0.42398387,0.005845087,0.00048527485,0.00022374082,0.00072714605,0.000785769,0.13368352],"genre_scores_gemma":[0.91338396,0.0007445982,0.06374902,0.0014144842,0.00061547867,0.00033361316,0.0008609689,0.00050340226,0.018394476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765235,0.0008495528,0.00012114194,0.00048760787,0.0004926753,0.0003966116],"domain_scores_gemma":[0.99036574,0.00647996,0.0009795564,0.0008880869,0.0006134591,0.0006732103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028154457,0.0011739195,0.0014554656,0.00092995714,0.0013605264,0.0041791275,0.0018490058,0.0014372872,0.0085388385],"category_scores_gemma":[0.013539248,0.0009812929,0.0012214972,0.0015608126,0.0034074767,0.008209981,0.0031553751,0.0062693916,0.0005651588],"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.00013583104,0.00014891312,0.00021973287,0.00006614865,0.000013666333,0.00004129332,0.00033485488,0.014557751,0.0010803436,0.968298,0.0027564107,0.012347063],"study_design_scores_gemma":[0.000029760318,0.000045655976,0.00024608598,0.000013610008,0.000006295704,0.00004024041,0.0000878924,0.054259364,0.00031247127,0.9437576,0.001187854,0.000013132365],"about_ca_topic_score_codex":0.0015462855,"about_ca_topic_score_gemma":0.001304075,"teacher_disagreement_score":0.0085388385,"about_ca_system_score_codex":0.0020291805,"about_ca_system_score_gemma":0.0012597836,"threshold_uncertainty_score":0.028565288},"labels":[],"label_agreement":null},{"id":"W1989485302","doi":"10.1145/2487241.2487243","title":"The VPN Conjecture Is True","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Conjecture; Mathematics; Context (archaeology); Discrete mathematics; Matrix (chemical analysis); Path (computing); Shortest path problem; Graph; Computer science","score_opus":0.01333278377694644,"score_gpt":0.22806660800660872,"score_spread":0.21473382422966228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989485302","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.16597918,0.003831578,0.6793945,0.042421736,0.002012386,0.000300667,0.00417055,0.0018185325,0.100070864],"genre_scores_gemma":[0.8017211,0.0031557044,0.16030444,0.008029058,0.0023103221,0.000741778,0.004742306,0.0011268768,0.017868534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953542,0.0014057204,0.00018005699,0.0014931242,0.00072060584,0.00084643584],"domain_scores_gemma":[0.9715774,0.020868683,0.0013820345,0.0035606057,0.0015975373,0.0010138568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036884067,0.001737255,0.0026282507,0.00075847557,0.0022748767,0.0033353055,0.0035946749,0.00512144,0.021328202],"category_scores_gemma":[0.035549644,0.0013016434,0.0022481873,0.0017262348,0.0035592725,0.017949408,0.0035055666,0.0066883448,0.0029167149],"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.0008356993,0.00024148583,0.0024595174,0.0013672967,0.0002292628,0.00046020528,0.00062984147,0.13783865,0.0024738754,0.7338157,0.07392701,0.045721415],"study_design_scores_gemma":[0.00012178421,0.00008318937,0.00029921468,0.000092028604,0.00003360991,0.00028804268,0.00016840026,0.10476111,0.0006333541,0.8830005,0.01049221,0.000026673519],"about_ca_topic_score_codex":0.0020586299,"about_ca_topic_score_gemma":0.0019943528,"teacher_disagreement_score":0.021328202,"about_ca_system_score_codex":0.0022951236,"about_ca_system_score_gemma":0.0015608646,"threshold_uncertainty_score":0.07134998},"labels":[],"label_agreement":null},{"id":"W1990177682","doi":"10.5555/1873601.1873636","title":"Asymmetric traveling salesman path and directed latency problems","year":2010,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","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":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Linear programming relaxation; Combinatorics; Approximation algorithm; Binary logarithm; Mathematics; Log-log plot; Path (computing); Upper and lower bounds; Relaxation (psychology); Latency (audio); Linear programming; Discrete mathematics; Computer science; Mathematical optimization","score_opus":0.011671707685845136,"score_gpt":0.23382718519165582,"score_spread":0.2221554775058107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990177682","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.114547886,0.0020633892,0.8603325,0.0022124304,0.00021190559,0.0001401364,0.0005639951,0.0006113754,0.019316383],"genre_scores_gemma":[0.6805435,0.002686653,0.3042235,0.00058988953,0.0005109281,0.00028528034,0.0009581749,0.0002946837,0.00990743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980877,0.00045902608,0.000086905755,0.00042333468,0.0005308358,0.00041216385],"domain_scores_gemma":[0.9932626,0.0046555297,0.00074304565,0.00052852125,0.00041486305,0.00039547417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001828305,0.0016239912,0.0011696094,0.0012250125,0.00078969327,0.0019913684,0.0042983,0.0017779759,0.005401441],"category_scores_gemma":[0.012070308,0.00057821185,0.0010566401,0.0024258452,0.0014109933,0.008027821,0.0022661833,0.004258407,0.00049227406],"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.00041484644,0.00034882338,0.0016072508,0.0005718802,0.00007828547,0.00024258754,0.00036942185,0.48790908,0.0032953024,0.42686856,0.006662276,0.07163171],"study_design_scores_gemma":[0.000046170986,0.00010356917,0.00030022828,0.000046675246,0.000032292173,0.00020267438,0.00015720345,0.7118566,0.0019252313,0.27914307,0.0061673643,0.000018893967],"about_ca_topic_score_codex":0.002918449,"about_ca_topic_score_gemma":0.0018403534,"teacher_disagreement_score":0.005401441,"about_ca_system_score_codex":0.0024872574,"about_ca_system_score_gemma":0.0014503365,"threshold_uncertainty_score":0.018069565},"labels":[],"label_agreement":null},{"id":"W1991263747","doi":"10.1016/j.tcs.2014.09.005","title":"Brushing with additional cleaning restrictions","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Narodowym Centrum Nauki; Ryerson University","keywords":"Brush; Traverse; Graph; Vertex (graph theory); Computer science; Combinatorics; Mathematics; Theoretical computer science; Engineering; Cartography; Mechanical engineering; Geography","score_opus":0.00951835568800899,"score_gpt":0.2215320800433167,"score_spread":0.21201372435530771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991263747","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.038207658,0.00044545397,0.9136978,0.00063485,0.0007682964,0.00018921314,0.0005711988,0.0050844555,0.040401183],"genre_scores_gemma":[0.39369303,0.0006052743,0.52294517,0.0007881387,0.0003442191,0.000377486,0.0018778183,0.005182262,0.07418665],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836284,0.00018049055,0.00013591995,0.0004596727,0.00060326164,0.00025775345],"domain_scores_gemma":[0.99210864,0.0015973072,0.00020910721,0.004966298,0.00069483515,0.00042381964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012095338,0.0011366664,0.0021151952,0.0016653158,0.0019309408,0.0027954439,0.0025176827,0.0024230015,0.048686836],"category_scores_gemma":[0.010714517,0.0010508758,0.0019158873,0.0017396458,0.001662659,0.005865825,0.0045465194,0.0039057564,0.0074755414],"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.0009460297,0.0007181718,0.0017173683,0.0009656531,0.00013665853,0.0006887779,0.0006294547,0.04022776,0.076624036,0.33050412,0.036027547,0.5108145],"study_design_scores_gemma":[0.00015753997,0.00026243905,0.0014259131,0.00021661115,0.00012982968,0.0008468615,0.0003814251,0.31175023,0.049268935,0.5388453,0.096590586,0.00012430103],"about_ca_topic_score_codex":0.0012663195,"about_ca_topic_score_gemma":0.0024053599,"teacher_disagreement_score":0.048686836,"about_ca_system_score_codex":0.0004477529,"about_ca_system_score_gemma":0.0007899612,"threshold_uncertainty_score":0.16287369},"labels":[],"label_agreement":null},{"id":"W1992520347","doi":"10.1145/1290672.1290684","title":"Packing element-disjoint steiner trees","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":31,"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; University of Waterloo","funders":"","keywords":"Combinatorics; Steiner tree problem; Mathematics; Linear programming relaxation; Disjoint sets; Upper and lower bounds; Packing problems; Matching (statistics); Terminal and nonterminal symbols; Approximation algorithm; Discrete mathematics; Linear programming; Binary logarithm; Algorithm; Computer science","score_opus":0.032282289362734744,"score_gpt":0.28109758381179123,"score_spread":0.24881529444905648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992520347","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.29513833,0.0010198377,0.68290263,0.0010927164,0.00020559071,0.00025308115,0.0016241657,0.0019454573,0.015818167],"genre_scores_gemma":[0.5402731,0.0008406709,0.4477778,0.00027248962,0.00009376676,0.0001841606,0.0037370191,0.0002681167,0.006552846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843735,0.00035617335,0.0001515892,0.00044360175,0.00032542384,0.0002858499],"domain_scores_gemma":[0.99756694,0.0010195165,0.00031513604,0.00072888006,0.00014390932,0.00022570026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063624,0.0009501966,0.0020358039,0.0008327945,0.000871489,0.001499927,0.0017423931,0.0017859235,0.006784866],"category_scores_gemma":[0.0053030215,0.00088073796,0.0009217621,0.002453231,0.0007084119,0.0043121525,0.0028740088,0.0014136066,0.0015394703],"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.0021799644,0.0007516471,0.0044853436,0.0008832688,0.00027289032,0.0015824114,0.000825709,0.5638075,0.042697687,0.09296226,0.021434996,0.26811638],"study_design_scores_gemma":[0.00014726925,0.00042263314,0.0011120496,0.00006696256,0.000084909596,0.0009130156,0.0003322941,0.85163283,0.017311182,0.11637325,0.011565515,0.000038155424],"about_ca_topic_score_codex":0.00067213725,"about_ca_topic_score_gemma":0.0009874951,"teacher_disagreement_score":0.006784866,"about_ca_system_score_codex":0.00059677626,"about_ca_system_score_gemma":0.00061972823,"threshold_uncertainty_score":0.022697628},"labels":[],"label_agreement":null},{"id":"W1994002660","doi":"10.1007/s10107-008-0242-9","title":"Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization","year":2008,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":41,"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":"Fleischer; Mathematics; Submodular set function; Algorithm; Function (biology); Minification; Polynomial; Combinatorial algorithms; Time complexity; Extension (predicate logic); Combinatorics; Discrete mathematics; Computer science; Mathematical optimization","score_opus":0.038946646905112035,"score_gpt":0.2594211731772316,"score_spread":0.22047452627211958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994002660","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.042332258,0.0009476809,0.9149286,0.0043597147,0.00022403257,0.00022856976,0.0007719238,0.001293894,0.034913436],"genre_scores_gemma":[0.3932998,0.0013479859,0.5698802,0.0017443644,0.0007164936,0.0010142744,0.0023869346,0.0013777427,0.028232144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968483,0.0011608562,0.000123598,0.0007154365,0.0007030213,0.00044883133],"domain_scores_gemma":[0.98774314,0.0085328575,0.0005843768,0.0019464212,0.00070872536,0.00048442863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030354748,0.002244497,0.001983083,0.0015223258,0.0022231424,0.00564871,0.0053320765,0.0027699603,0.013999281],"category_scores_gemma":[0.019111875,0.0013583938,0.0025382978,0.0030443883,0.0034367202,0.013898341,0.00563289,0.009339146,0.0023524114],"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.00051683356,0.0005451869,0.0008370996,0.00041725533,0.00008468943,0.000056114623,0.0003278609,0.06231426,0.0019123192,0.80024534,0.02472439,0.108018614],"study_design_scores_gemma":[0.000073020885,0.0000379497,0.00018241847,0.000030390467,0.00003249656,0.000048729125,0.000060848764,0.151387,0.0008718615,0.8443739,0.0028819912,0.000019471723],"about_ca_topic_score_codex":0.0029163738,"about_ca_topic_score_gemma":0.005600083,"teacher_disagreement_score":0.013999281,"about_ca_system_score_codex":0.004052667,"about_ca_system_score_gemma":0.0038468644,"threshold_uncertainty_score":0.046832263},"labels":[],"label_agreement":null},{"id":"W1994006656","doi":"10.1007/s00493-012-2552-z","title":"A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks","year":2012,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"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":"Spanning tree; Minimum spanning tree; Steiner tree problem; Minimum weight; Minimum degree spanning tree; k-minimum spanning tree; Connected dominating set; Bounded function; Asymptotically optimal algorithm","score_opus":0.028307662286784503,"score_gpt":0.26016036637486684,"score_spread":0.23185270408808234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994006656","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.2623022,0.013089877,0.6712405,0.014173146,0.0006332561,0.00027340898,0.0017244288,0.0021501263,0.034413077],"genre_scores_gemma":[0.91774815,0.0038319172,0.067026675,0.0023711277,0.001253804,0.00040047299,0.000806177,0.00048942375,0.006072418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941755,0.0015493517,0.0003711362,0.0014696077,0.0013192627,0.0011150951],"domain_scores_gemma":[0.9001576,0.07969949,0.005468741,0.0050278744,0.0033019609,0.0063444343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008214921,0.0020681156,0.004948751,0.0049678893,0.0025318626,0.009545278,0.007217721,0.0064622224,0.0066915895],"category_scores_gemma":[0.091037996,0.0032174382,0.0028734747,0.0039707874,0.007587801,0.022101851,0.007487856,0.010938581,0.0010502943],"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.0010591658,0.00017272921,0.0033661106,0.00085202476,0.00013267905,0.00032249978,0.0010215774,0.035873037,0.007852519,0.9183963,0.009652257,0.021299059],"study_design_scores_gemma":[0.0001172288,0.00013826806,0.0015047948,0.00017170167,0.00012649132,0.0004886337,0.0002424744,0.1525643,0.0027180265,0.8386232,0.0032038398,0.00010102064],"about_ca_topic_score_codex":0.0016136327,"about_ca_topic_score_gemma":0.0014243645,"teacher_disagreement_score":0.009545278,"about_ca_system_score_codex":0.00589032,"about_ca_system_score_gemma":0.0018991946,"threshold_uncertainty_score":0.04344517},"labels":[],"label_agreement":null},{"id":"W1994612875","doi":"10.1006/jagm.2002.1221","title":"Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem","year":2002,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":false,"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; Háskóli Íslands; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Rectangle; Approximation algorithm; Combinatorics; Mathematics; Constant (computer programming); Space (punctuation); Algorithm; Discrete mathematics; Computer science; Geometry","score_opus":0.04323806333478964,"score_gpt":0.25696351552347346,"score_spread":0.21372545218868383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994612875","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.09762152,0.0052261753,0.86085737,0.0037574547,0.00040545734,0.00046099312,0.0008239754,0.003195279,0.027651826],"genre_scores_gemma":[0.31105366,0.0020732144,0.6693249,0.0007474505,0.0003539568,0.0005181904,0.0021086743,0.00092803396,0.012891912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963935,0.0011915109,0.00017389395,0.00070518925,0.0007831039,0.0007528064],"domain_scores_gemma":[0.9917163,0.005261922,0.0006657102,0.0013942638,0.0005284073,0.0004333636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027853516,0.0025576684,0.002921213,0.002222289,0.0018703555,0.0039772876,0.0063334396,0.0038559842,0.016480584],"category_scores_gemma":[0.014856381,0.0014150989,0.0018901168,0.005403939,0.0017658158,0.0113689955,0.003921849,0.004338162,0.0033947823],"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.003027544,0.0011683848,0.0018134253,0.000903621,0.00026536593,0.00020335196,0.0007283081,0.3943657,0.0062868414,0.17092991,0.04311488,0.37719268],"study_design_scores_gemma":[0.0005502034,0.00020265904,0.00046060805,0.00004877859,0.0001260414,0.00021603309,0.00021458835,0.8635612,0.002033246,0.12579334,0.0067487787,0.000044480894],"about_ca_topic_score_codex":0.0072062635,"about_ca_topic_score_gemma":0.008866204,"teacher_disagreement_score":0.016480584,"about_ca_system_score_codex":0.0038643691,"about_ca_system_score_gemma":0.0033538998,"threshold_uncertainty_score":0.055133104},"labels":[],"label_agreement":null},{"id":"W1994932713","doi":"10.1007/s10479-008-0481-4","title":"A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":55,"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":"Direktion für Entwicklung und Zusammenarbeit","keywords":"Mathematics; Semidefinite programming; Rounding; Partition (number theory); Combinatorics; Hyperplane; Disjoint sets; Algorithm; Graph partition; Maximum cut; Partition problem; Branch and cut; Integer programming; Graph; Computer science; Mathematical optimization","score_opus":0.2635310348025377,"score_gpt":0.4164277997338451,"score_spread":0.15289676493130738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994932713","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.013688306,0.00015296708,0.98049015,0.0003902175,0.00007794435,0.00012738873,0.00012470628,0.00042588307,0.004522387],"genre_scores_gemma":[0.114117816,0.00020767337,0.88071084,0.00020820026,0.00008845768,0.00038815572,0.0005649176,0.0003077759,0.0034060734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912244,0.0003297583,0.00004108178,0.00018684813,0.00021618119,0.00010369737],"domain_scores_gemma":[0.99770576,0.0015330596,0.00013576625,0.00019744117,0.000247069,0.00018090165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014514538,0.0014402234,0.0026708446,0.0011831411,0.0012459803,0.0021084987,0.0023938208,0.002014278,0.007648276],"category_scores_gemma":[0.0047172634,0.0011478584,0.0012510475,0.0018801473,0.0010941905,0.00302576,0.0024082975,0.0039214506,0.0013530937],"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.00063444156,0.0007815122,0.0005863391,0.00034683628,0.00011929265,0.00013940714,0.00022377858,0.5308565,0.0052375635,0.12065086,0.020495309,0.3199282],"study_design_scores_gemma":[0.000098553304,0.00008005093,0.000077690056,0.000018483723,0.000017543132,0.00004659455,0.000025200246,0.94717896,0.0006394323,0.050705492,0.0010975982,0.000014433546],"about_ca_topic_score_codex":0.0022038019,"about_ca_topic_score_gemma":0.0034908112,"teacher_disagreement_score":0.007648276,"about_ca_system_score_codex":0.0011593302,"about_ca_system_score_gemma":0.002449812,"threshold_uncertainty_score":0.025586069},"labels":[],"label_agreement":null},{"id":"W1995031698","doi":"10.1145/1255443.1255444","title":"(Almost) Tight bounds and existence theorems for single-commodity confluent flows","year":2007,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"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":"Mathematics; Flow (mathematics); Maximum flow problem; Flow network; Sink (geography); Computer science; Combinatorics; Geometry","score_opus":0.0438101471097265,"score_gpt":0.276298589715113,"score_spread":0.2324884426053865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995031698","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.092229255,0.0026027134,0.8675771,0.0020189735,0.00017697504,0.0002472666,0.00066282117,0.00079096673,0.03369396],"genre_scores_gemma":[0.72117656,0.0040044617,0.2628692,0.00096900953,0.0006625405,0.0006690917,0.001256968,0.0004863846,0.007905684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661094,0.0006880189,0.00016715447,0.00086573215,0.000951443,0.00071673555],"domain_scores_gemma":[0.9806671,0.014063457,0.0012742819,0.0015721541,0.0015101662,0.00091276626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004272271,0.0022230495,0.0016389264,0.0023999389,0.0020214894,0.004107007,0.002652502,0.0016066885,0.007916282],"category_scores_gemma":[0.024755916,0.0012076625,0.0021707965,0.0024048875,0.0039593354,0.012109236,0.005508597,0.006537986,0.0014562919],"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.00064458326,0.00045366978,0.0028400426,0.0012656812,0.00015793752,0.00046360737,0.001452223,0.24119017,0.013529845,0.65784883,0.010621505,0.06953188],"study_design_scores_gemma":[0.000071741015,0.00017013185,0.00086210034,0.00014775194,0.00009532234,0.00031047632,0.0003570277,0.41492102,0.0064490703,0.56841147,0.008147313,0.000056570792],"about_ca_topic_score_codex":0.0017439914,"about_ca_topic_score_gemma":0.0015533987,"teacher_disagreement_score":0.007916282,"about_ca_system_score_codex":0.0026088855,"about_ca_system_score_gemma":0.0018165506,"threshold_uncertainty_score":0.026482582},"labels":[],"label_agreement":null},{"id":"W1996328142","doi":"10.1016/j.tcs.2009.03.018","title":"Efficient enumeration of words in regular languages","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo","funders":"","keywords":"Enumeration; Lexicographical order; Mathematics; Computation; Domain (mathematical analysis); Algorithm; Combinatorics; Computer science; Discrete mathematics","score_opus":0.006969939814450132,"score_gpt":0.25593533423711606,"score_spread":0.24896539442266594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996328142","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.28954223,0.00089716463,0.6697902,0.002916518,0.00019385492,0.00025140817,0.002095501,0.0033902482,0.030922908],"genre_scores_gemma":[0.6081366,0.0007130155,0.35965455,0.0007355263,0.00017341007,0.0003558422,0.0048126644,0.0012345101,0.024184002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774384,0.0007040697,0.00021759975,0.00042741353,0.0004898575,0.00041728758],"domain_scores_gemma":[0.989641,0.0069179805,0.00063558377,0.00165703,0.000846389,0.00030207232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009360135,0.0007084936,0.001229293,0.0012929647,0.0013913917,0.003973896,0.0021986126,0.0013745446,0.0061522597],"category_scores_gemma":[0.008950838,0.0009686854,0.0011885896,0.0030796197,0.0014870182,0.008665682,0.0032717101,0.0025245838,0.002178161],"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.00091813225,0.000512511,0.0032395339,0.0009701719,0.00010257652,0.0003572838,0.0018623011,0.042577986,0.02001184,0.6313822,0.024947736,0.27311772],"study_design_scores_gemma":[0.00007166776,0.000045669378,0.0002812848,0.000052228537,0.000054300282,0.00016789796,0.00027276584,0.08503492,0.0060693906,0.9004872,0.007435831,0.000026942802],"about_ca_topic_score_codex":0.0012167784,"about_ca_topic_score_gemma":0.0035535034,"teacher_disagreement_score":0.0061522597,"about_ca_system_score_codex":0.0012485363,"about_ca_system_score_gemma":0.0018014095,"threshold_uncertainty_score":0.020581424},"labels":[],"label_agreement":null},{"id":"W1999966159","doi":"10.1007/s10107-011-0463-1","title":"Structural and algorithmic properties for parametric minimum cuts","year":2011,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","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 British Columbia","funders":"","keywords":"Mathematics; Parametric statistics; Property (philosophy); Submodular set function; Arc length; Minimum cut; Mathematical optimization; Parametric model; Applied mathematics; Arc (geometry); Combinatorics; Geometry","score_opus":0.09634188982781142,"score_gpt":0.2654593284455053,"score_spread":0.16911743861769388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999966159","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.23677652,0.0008083449,0.7064205,0.0029142092,0.0001590342,0.00023225186,0.00093954155,0.00032645,0.05142317],"genre_scores_gemma":[0.82453257,0.001208166,0.15877141,0.0006018602,0.0005573883,0.0005293323,0.0021403506,0.00039715334,0.011261749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763846,0.0005255089,0.00015673498,0.0005189071,0.000848872,0.00031151218],"domain_scores_gemma":[0.9719173,0.020012645,0.0032188864,0.0020449164,0.0018435743,0.000962762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024001058,0.001004281,0.0011653196,0.0028066959,0.0019815548,0.006090558,0.003207936,0.0023126306,0.011536684],"category_scores_gemma":[0.028558984,0.0016019372,0.0020194915,0.004488996,0.003980606,0.013260262,0.0027670262,0.006299175,0.0010033953],"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.00008810605,0.000095134434,0.0011554305,0.00014522602,0.000021337224,0.000092542396,0.00038369242,0.016188486,0.0017532686,0.96264863,0.0017712713,0.015656846],"study_design_scores_gemma":[0.000018343255,0.000035503046,0.00061326363,0.000029952065,0.000018636207,0.00020285988,0.0001636439,0.025070185,0.0006968606,0.9713111,0.0018242762,0.000015312673],"about_ca_topic_score_codex":0.0007228184,"about_ca_topic_score_gemma":0.00094424025,"teacher_disagreement_score":0.011536684,"about_ca_system_score_codex":0.0015533661,"about_ca_system_score_gemma":0.0013159892,"threshold_uncertainty_score":0.038594067},"labels":[],"label_agreement":null},{"id":"W2000222614","doi":"10.1145/371282.371388","title":"Logics capturing local properties","year":2001,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Complexity and Algorithms in Graphs","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":"University of Toronto","funders":"","keywords":"Locality; Mathematics; Characterization (materials science); Bounded function; Isomorphism (crystallography); Hierarchy; Expressive power; Discrete mathematics; Statement (logic); Pure mathematics; Theoretical computer science; Computer science; Linguistics","score_opus":0.06790359646617276,"score_gpt":0.25965123243288374,"score_spread":0.19174763596671096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000222614","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.13727166,0.00066815916,0.81784797,0.0013127925,0.00008050692,0.00014397656,0.00051918655,0.0017563807,0.040399395],"genre_scores_gemma":[0.8508167,0.00027056923,0.1411841,0.0004950821,0.000103623635,0.00016154579,0.00035504083,0.0001481807,0.0064650276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976954,0.0006149486,0.00017457224,0.0005972386,0.00056051975,0.00035729792],"domain_scores_gemma":[0.9956084,0.002114292,0.00036438816,0.001135846,0.0005309381,0.00024625563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025594619,0.0005739669,0.00060632126,0.0015020545,0.0015764334,0.0026348813,0.0016199904,0.0010629497,0.0029285622],"category_scores_gemma":[0.0054312125,0.0006041382,0.001477101,0.0011061366,0.004513236,0.009289536,0.004078378,0.0025944752,0.0003948307],"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.000038143913,0.000026407914,0.0006709169,0.000082085455,0.000016089349,0.00018265565,0.00064419536,0.0029938046,0.0034075107,0.9775643,0.000583312,0.013790671],"study_design_scores_gemma":[0.000024149747,0.00004004079,0.00040352007,0.00003570136,0.000048889273,0.0003190831,0.00028851346,0.022184175,0.0059824525,0.96133894,0.009307149,0.000027492744],"about_ca_topic_score_codex":0.0018469398,"about_ca_topic_score_gemma":0.0024266648,"teacher_disagreement_score":0.0029285622,"about_ca_system_score_codex":0.0023779427,"about_ca_system_score_gemma":0.0011042394,"threshold_uncertainty_score":0.01725328},"labels":[],"label_agreement":null},{"id":"W2001432254","doi":"10.1016/j.dam.2003.11.009","title":"A note on line broadcast in digraphs under the edge-disjoint paths mode","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"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":"Concordia University; University of Ottawa","keywords":"Digraph; Mathematics; Combinatorics; Disjoint sets; Time complexity; Line (geometry); Approximation algorithm; Enhanced Data Rates for GSM Evolution; Integer (computer science); Node (physics); Discrete mathematics; Tree (set theory); Degree (music); Running time; Algorithm; Computer science","score_opus":0.028447797900540576,"score_gpt":0.27861105444618267,"score_spread":0.2501632565456421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001432254","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.07687211,0.004884921,0.7864501,0.014884129,0.0017465961,0.00017137705,0.0008254979,0.0008387207,0.11332653],"genre_scores_gemma":[0.82376856,0.010170979,0.11978596,0.004352084,0.0050905533,0.00048243962,0.000560782,0.0005121926,0.035276484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977169,0.0008298063,0.000090747024,0.00046903064,0.00050635386,0.0003872056],"domain_scores_gemma":[0.98401296,0.012299281,0.0007117181,0.0015630772,0.0008423348,0.0005706482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022867825,0.0007135872,0.0015038464,0.0013590346,0.0022067472,0.0035297542,0.0024622784,0.0024318392,0.008896643],"category_scores_gemma":[0.01760203,0.0006373315,0.0012433123,0.0031265304,0.0037325998,0.01041278,0.003455712,0.00553427,0.00113117],"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.00027571124,0.0000420938,0.00039718172,0.00016506751,0.000032283733,0.0001295688,0.00037601613,0.013598578,0.0015853487,0.9464137,0.012308378,0.024676181],"study_design_scores_gemma":[0.00006397232,0.0000677752,0.00022473076,0.000052135114,0.000053055606,0.00017540029,0.00017219716,0.056939907,0.0011834186,0.9281248,0.012902052,0.00004051669],"about_ca_topic_score_codex":0.0029207948,"about_ca_topic_score_gemma":0.0019594165,"teacher_disagreement_score":0.008896643,"about_ca_system_score_codex":0.002760338,"about_ca_system_score_gemma":0.001256706,"threshold_uncertainty_score":0.029762268},"labels":[],"label_agreement":null},{"id":"W2001944732","doi":"10.1007/pl00011428","title":"Concavity cuts for disjoint bilinear programming","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"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":"Disjoint sets; Bilinear interpolation; Mathematics; Mathematical optimization; Linear programming; Degenerate energy levels; Optimization problem; Nonlinear programming; Combinatorics; Nonlinear system","score_opus":0.04709839733559648,"score_gpt":0.30241239680414445,"score_spread":0.25531399946854794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001944732","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.08702057,0.001034958,0.8668405,0.0033813645,0.00025523815,0.00013644376,0.000487365,0.00030075698,0.040542837],"genre_scores_gemma":[0.6829575,0.0017707614,0.26670128,0.0012699952,0.0008622137,0.000700104,0.0011421737,0.0005740488,0.044022005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969627,0.0010919392,0.00014045353,0.0005841968,0.00083998195,0.00038067467],"domain_scores_gemma":[0.98526275,0.010459967,0.00090259215,0.0012057888,0.0011267134,0.0010420901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034302936,0.0012867894,0.0018888247,0.0015928783,0.0025926854,0.006038712,0.0027418283,0.0015671686,0.009054913],"category_scores_gemma":[0.017029801,0.0016336294,0.0016842057,0.0024906618,0.004935509,0.012942287,0.0060315663,0.011183013,0.001000207],"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.000068751804,0.000044731594,0.00017654442,0.00006872008,0.000015533218,0.000019420211,0.00016511302,0.0065165763,0.0003286306,0.98237234,0.002109552,0.008114064],"study_design_scores_gemma":[0.000009647522,0.000010668828,0.000059384,0.000009981724,0.0000067623323,0.000018313387,0.000031448562,0.021065785,0.00022027292,0.97707886,0.0014807929,0.000008098873],"about_ca_topic_score_codex":0.0023778477,"about_ca_topic_score_gemma":0.0021809028,"teacher_disagreement_score":0.009054913,"about_ca_system_score_codex":0.0034375077,"about_ca_system_score_gemma":0.0020560944,"threshold_uncertainty_score":0.030291677},"labels":[],"label_agreement":null},{"id":"W2003104918","doi":"10.1007/s00037-001-8195-x","title":"Communication complexity towards lower bounds on circuit depth","year":2001,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":59,"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":"Boolean function; Circuit complexity; Communication complexity; Upper and lower bounds; Omega; Mathematics; Binary logarithm; Bounded function; Function (biology); Discrete mathematics; Boolean circuit; Conjecture; Combinatorics; Characterization (materials science); Electronic circuit; Physics; Mathematical analysis","score_opus":0.1246287817561772,"score_gpt":0.31596490909890745,"score_spread":0.19133612734273026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003104918","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.07169758,0.014746865,0.7164593,0.03154431,0.0016871154,0.00040460585,0.0023198945,0.002563023,0.15857732],"genre_scores_gemma":[0.62144697,0.019326312,0.26059467,0.012020161,0.008723834,0.0023665638,0.003808189,0.005461532,0.0662518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9867776,0.0030829164,0.00037898286,0.0022542982,0.0048176176,0.0026885266],"domain_scores_gemma":[0.8607691,0.11928068,0.002502595,0.009900911,0.004646876,0.0028998996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008463288,0.0051004817,0.004312089,0.0063986653,0.0037848821,0.011449633,0.01060217,0.006134367,0.021460677],"category_scores_gemma":[0.07139127,0.00309061,0.004055646,0.008619263,0.007417938,0.03470306,0.0126313055,0.02305036,0.0041903364],"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.00089674105,0.00043723406,0.0014231884,0.0008922399,0.00011817569,0.00014730041,0.00080999854,0.08635771,0.0043661217,0.805893,0.033862207,0.06479615],"study_design_scores_gemma":[0.0000688101,0.000054424807,0.00048623147,0.00016949262,0.000093915754,0.00008480496,0.00010414141,0.15130875,0.0022082343,0.8360214,0.009360155,0.00003964859],"about_ca_topic_score_codex":0.0049329293,"about_ca_topic_score_gemma":0.006004489,"teacher_disagreement_score":0.021460677,"about_ca_system_score_codex":0.011501924,"about_ca_system_score_gemma":0.0045203953,"threshold_uncertainty_score":0.0834527},"labels":[],"label_agreement":null},{"id":"W2003388935","doi":"10.1145/1978782.1978784","title":"How well can primal-dual and local-ratio algorithms perform?","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","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":"Alterra Power (Canada); University of Toronto","funders":"","keywords":"Approximation algorithm; Combinatorics; Mathematics; Scheduling (production processes); Set cover problem; Steiner tree problem; Algorithm; Upper and lower bounds; Discrete mathematics; Set (abstract data type); Computer science; Mathematical optimization","score_opus":0.039176623895394745,"score_gpt":0.2333518551774825,"score_spread":0.19417523128208775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003388935","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.03605752,0.00425225,0.9162286,0.0056390376,0.00041216973,0.00012097076,0.00021271137,0.0023640795,0.03471271],"genre_scores_gemma":[0.59258795,0.0031450682,0.3941301,0.0019724164,0.0006825105,0.00032448303,0.00042981483,0.0010658563,0.0056617754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98840255,0.0055494234,0.0003943743,0.0021058754,0.0022234146,0.0013244252],"domain_scores_gemma":[0.98013455,0.011909389,0.0011308935,0.004574924,0.0015861605,0.00066413515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017298473,0.0030416138,0.0032243705,0.002384929,0.0017499753,0.009009302,0.004750901,0.0054715704,0.007339685],"category_scores_gemma":[0.060543276,0.001330901,0.0022397703,0.003534818,0.0030348701,0.023326108,0.0043129246,0.004859852,0.006228587],"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.0011417788,0.0007406763,0.003786909,0.0004527938,0.0004289908,0.00009167365,0.0003212919,0.24239856,0.0021717083,0.3788383,0.01770159,0.35192567],"study_design_scores_gemma":[0.00009227427,0.0002262084,0.00043621648,0.000101221274,0.00006877393,0.00016916152,0.00018520768,0.59651065,0.0029417234,0.39296836,0.006254827,0.00004544058],"about_ca_topic_score_codex":0.0020200077,"about_ca_topic_score_gemma":0.0012013797,"teacher_disagreement_score":0.017298473,"about_ca_system_score_codex":0.0021743774,"about_ca_system_score_gemma":0.0029866134,"threshold_uncertainty_score":0.09148419},"labels":[],"label_agreement":null},{"id":"W2003833943","doi":"10.1016/j.ipl.2007.08.023","title":"Feedback arc set problem in bipartite tournaments","year":2007,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Multipartite; Bipartite graph; Arc (geometry); Feedback arc set; Set (abstract data type); Mathematics; Tournament; Combinatorics; Discrete mathematics; Computer science; Quantum entanglement","score_opus":0.01714777052366188,"score_gpt":0.2536164302606104,"score_spread":0.23646865973694856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003833943","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.4042649,0.0016768943,0.55366844,0.0051010796,0.0003629872,0.00054210704,0.0024075303,0.0010985663,0.030877527],"genre_scores_gemma":[0.8857975,0.00078577234,0.09741978,0.00051223085,0.0003266185,0.00049668545,0.0017332033,0.00023539853,0.012692751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996329,0.0017069546,0.00019676468,0.0006531271,0.00059923285,0.00051489135],"domain_scores_gemma":[0.9789108,0.016565247,0.0011545783,0.00094388716,0.0009041799,0.0015212871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035172328,0.0012044813,0.0033975535,0.0015395618,0.0021116724,0.0063283793,0.004750657,0.003750709,0.015016963],"category_scores_gemma":[0.023773927,0.0010077563,0.0015121455,0.0029517233,0.0019471516,0.008423434,0.002669293,0.0030256968,0.0009576912],"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.0025850004,0.0011199901,0.003070467,0.0012433155,0.00031800187,0.0004926744,0.00080743065,0.3686424,0.0037353109,0.5029051,0.024296427,0.09078393],"study_design_scores_gemma":[0.00032898,0.0001560486,0.0005233515,0.000071501854,0.00008555015,0.00016456602,0.00024746615,0.58226144,0.0013841273,0.41246152,0.0022723663,0.000043048054],"about_ca_topic_score_codex":0.0026652503,"about_ca_topic_score_gemma":0.0024554562,"teacher_disagreement_score":0.015016963,"about_ca_system_score_codex":0.0023370886,"about_ca_system_score_gemma":0.0017651485,"threshold_uncertainty_score":0.05023676},"labels":[],"label_agreement":null},{"id":"W2004012902","doi":"10.1145/780542.780629","title":"A new multilayered PCP and the hardness of hypergraph vertex cover","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":68,"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":"Environment and Climate Change Canada","keywords":"Hypergraph; Cover (algebra); Vertex (graph theory); Vertex cover; Edge cover; Computer science; Combinatorics; Mathematics; Algorithm; Theoretical computer science; Engineering; Approximation algorithm; Graph; Mechanical engineering","score_opus":0.012564676074446786,"score_gpt":0.21331606367483305,"score_spread":0.20075138760038627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004012902","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.3316674,0.00076901243,0.64819044,0.0023573197,0.000069951326,0.00014460178,0.0014169125,0.0013063103,0.014078004],"genre_scores_gemma":[0.89598083,0.00038609974,0.09949016,0.00031056517,0.00007672138,0.00012394224,0.0007416,0.00010322258,0.0027869884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973648,0.00042999518,0.00016089028,0.00067550555,0.00088218425,0.00048668365],"domain_scores_gemma":[0.99169415,0.0038848722,0.000918131,0.0023583344,0.00067842926,0.00046610198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011693727,0.0003927145,0.00082566455,0.0008609704,0.0012017791,0.0025057038,0.0016944283,0.001412573,0.0043784063],"category_scores_gemma":[0.010015414,0.0006440799,0.00092635397,0.0016649402,0.001978677,0.0075074467,0.004929562,0.0026622796,0.00050158094],"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.0014399857,0.000256692,0.010127653,0.0005999134,0.00015614806,0.00085957604,0.00076869613,0.22023301,0.04253287,0.54568416,0.011038554,0.1663028],"study_design_scores_gemma":[0.00012677234,0.00029936738,0.0032310241,0.000089289606,0.00009062352,0.0013359172,0.00019760389,0.6320621,0.025492111,0.32732725,0.00963444,0.00011352177],"about_ca_topic_score_codex":0.0029520248,"about_ca_topic_score_gemma":0.002307147,"teacher_disagreement_score":0.0043784063,"about_ca_system_score_codex":0.0020080733,"about_ca_system_score_gemma":0.0014583298,"threshold_uncertainty_score":0.014647245},"labels":[],"label_agreement":null},{"id":"W2004699374","doi":"10.1007/s10107-007-0139-z","title":"The capacitated max k-cut problem","year":2007,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":29,"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; University of Lethbridge","funders":"","keywords":"Mathematics; Numerical analysis; Combinatorics; Mathematical optimization; Applied mathematics; Mathematical analysis","score_opus":0.023004667484770168,"score_gpt":0.2664882864225961,"score_spread":0.2434836189378259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004699374","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.104656525,0.0030151003,0.801531,0.009166197,0.00051108043,0.0002748637,0.003280707,0.0006954009,0.07686911],"genre_scores_gemma":[0.7050945,0.0028819512,0.24234319,0.001473761,0.0009688666,0.0005183289,0.0031699971,0.0005949657,0.04295443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863845,0.0004002,0.00006213152,0.00040992262,0.00027213944,0.00021710947],"domain_scores_gemma":[0.9942286,0.004138719,0.0004365166,0.0004169998,0.00037440273,0.00040474112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013326596,0.0011361543,0.0017089067,0.0011499834,0.0012178174,0.005107108,0.003918099,0.0032182643,0.013732766],"category_scores_gemma":[0.008650244,0.0010439517,0.0010026437,0.0031125115,0.0019316202,0.0072453883,0.0021768513,0.004432309,0.0012791393],"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.0005078846,0.00028063677,0.0011816641,0.0010836715,0.00012922482,0.00027247358,0.00022012921,0.24993709,0.0017375699,0.6102939,0.042705726,0.09165004],"study_design_scores_gemma":[0.00006106285,0.00003522606,0.00040318706,0.00007444382,0.000037176946,0.000275799,0.00010718458,0.2716936,0.00080845156,0.71828836,0.008183212,0.00003237566],"about_ca_topic_score_codex":0.0018170583,"about_ca_topic_score_gemma":0.0019885784,"teacher_disagreement_score":0.013732766,"about_ca_system_score_codex":0.0021960218,"about_ca_system_score_gemma":0.001819354,"threshold_uncertainty_score":0.045940638},"labels":[],"label_agreement":null},{"id":"W2005509629","doi":"10.1007/s10107-002-0370-6","title":"Approximating disjoint-path problems using packing integer programs","year":2004,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":81,"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":"Disjoint sets; Mathematics; Bin packing problem; Combinatorics; Integer (computer science); Path (computing); Approximation algorithm; Packing problems; Vertex (graph theory); Integer programming; Discrete mathematics; Mathematical optimization; Algorithm; Computer science; Bin; Graph","score_opus":0.05865507247347649,"score_gpt":0.2737072331314133,"score_spread":0.21505216065793684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005509629","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.12947744,0.0014734732,0.84731025,0.0014214905,0.0001808645,0.00017473254,0.00044935266,0.0012618967,0.018250473],"genre_scores_gemma":[0.43646166,0.0010749381,0.55367845,0.00028050668,0.00018615443,0.00032275927,0.0010941614,0.0004908002,0.0064106556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800783,0.0006947898,0.000091570975,0.00033154263,0.0005284661,0.0003457834],"domain_scores_gemma":[0.9912845,0.0069327946,0.00052673754,0.00071172504,0.00030724445,0.00023705992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021992968,0.0018001077,0.0021858395,0.0018253573,0.0009319551,0.0033491356,0.0024773604,0.0020498158,0.007081305],"category_scores_gemma":[0.015178596,0.0013041743,0.0014880012,0.0036329562,0.0011682115,0.008684224,0.0023871604,0.003566096,0.00080505345],"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.00045364964,0.000469961,0.0016390677,0.0002974857,0.0000803123,0.000082652616,0.00017091657,0.7905889,0.0013521027,0.089564905,0.006372939,0.108927116],"study_design_scores_gemma":[0.00003089202,0.00004266788,0.00011389935,0.000016160093,0.000017355382,0.000026740809,0.0000433862,0.9333862,0.00060112594,0.064672634,0.0010433289,0.000005640134],"about_ca_topic_score_codex":0.0029823086,"about_ca_topic_score_gemma":0.004472892,"teacher_disagreement_score":0.007081305,"about_ca_system_score_codex":0.0022287692,"about_ca_system_score_gemma":0.0016141298,"threshold_uncertainty_score":0.02368933},"labels":[],"label_agreement":null},{"id":"W2005606079","doi":"10.1016/j.tcs.2013.03.014","title":"Fast balanced partitioning is hard even on grids and trees","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":25,"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":"Combinatorics; Mathematics; Grid; Partition (number theory); Time complexity; Limit (mathematics); Reduction (mathematics); Approximation algorithm; Maximum cut; Graph partition; Discrete mathematics; Running time; Graph; Mathematical optimization","score_opus":0.012910397604447118,"score_gpt":0.23486422708311516,"score_spread":0.22195382947866804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005606079","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.6718516,0.0038424374,0.25984845,0.020735994,0.00084297307,0.000302758,0.006018068,0.0027494465,0.03380834],"genre_scores_gemma":[0.842642,0.0023439098,0.12278534,0.0018861678,0.0013250429,0.00036674496,0.007863024,0.001423486,0.01936434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975969,0.00040202343,0.00017447713,0.00078703056,0.0004599377,0.0005796059],"domain_scores_gemma":[0.9612544,0.030034179,0.0022817664,0.00379438,0.0012008358,0.0014345167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017622547,0.0021908258,0.0042471737,0.0013968693,0.0034165632,0.0068033678,0.0034629297,0.004152918,0.012268404],"category_scores_gemma":[0.020746868,0.0022656184,0.0020249016,0.0039453637,0.0033697565,0.019287268,0.0047151656,0.004992113,0.0023896112],"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.0076845116,0.0010310601,0.01069733,0.0034297798,0.0006250481,0.0015747787,0.0018511346,0.41465136,0.025487999,0.29488716,0.09253469,0.14554517],"study_design_scores_gemma":[0.0003731965,0.00010721113,0.001307715,0.00007638032,0.00007732283,0.00036761284,0.00049764727,0.22724701,0.002655786,0.7632121,0.004036059,0.000042019412],"about_ca_topic_score_codex":0.0037474763,"about_ca_topic_score_gemma":0.004438109,"teacher_disagreement_score":0.012268404,"about_ca_system_score_codex":0.0019314435,"about_ca_system_score_gemma":0.0020743941,"threshold_uncertainty_score":0.04104185},"labels":[],"label_agreement":null},{"id":"W2006228567","doi":"10.1287/moor.25.1.76.15208","title":"Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow","year":2000,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Complexity and Algorithms in Graphs","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 British Columbia","funders":"","keywords":"Mathematics; Minimum-cost flow problem; Flow (mathematics); Algorithm; Mathematical optimization; Flow network; Geometry","score_opus":0.08106170843672988,"score_gpt":0.37544963839231127,"score_spread":0.2943879299555814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006228567","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.0118742855,0.00029564876,0.98104894,0.0002055983,0.00006784556,0.00011944459,0.00007319014,0.000980634,0.005334442],"genre_scores_gemma":[0.12671989,0.00032463722,0.8671579,0.0002474188,0.0001408938,0.0003136535,0.00044991198,0.000591935,0.0040538637],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774206,0.0006238528,0.00016131903,0.0003602356,0.0009014066,0.00021115347],"domain_scores_gemma":[0.99664176,0.0015064979,0.00029103295,0.000828404,0.00056833925,0.00016393492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021754839,0.0013948339,0.0011578089,0.001555556,0.001004837,0.001366647,0.0023369784,0.000899371,0.007226764],"category_scores_gemma":[0.007932363,0.0005398351,0.0012307069,0.0019215561,0.0012157607,0.003481379,0.0020314008,0.0022845003,0.0011001811],"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.00037151,0.00022695464,0.0010841179,0.00028597153,0.00005905533,0.00006592228,0.00023259867,0.15966298,0.0084449025,0.18113646,0.010773248,0.63765633],"study_design_scores_gemma":[0.00012682217,0.00017329262,0.0005259626,0.000041312916,0.000047901292,0.0001757589,0.00006984769,0.79136944,0.009946956,0.1791188,0.018351587,0.000052260588],"about_ca_topic_score_codex":0.0022365437,"about_ca_topic_score_gemma":0.0023861092,"teacher_disagreement_score":0.007226764,"about_ca_system_score_codex":0.0013900237,"about_ca_system_score_gemma":0.0015370563,"threshold_uncertainty_score":0.024175942},"labels":[],"label_agreement":null},{"id":"W2006271461","doi":"10.1145/2422436.2422459","title":"A characterization of approximation resistance for even k-partite CSPs","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint satisfaction problem; Predicate (mathematical logic); Characterization (materials science); Conjecture; Approximation algorithm; Mathematics; Constraint satisfaction; Combinatorics; Discrete mathematics; Computer science; Physics","score_opus":0.017987106922776087,"score_gpt":0.22626357157772153,"score_spread":0.20827646465494545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006271461","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.65075576,0.00094441575,0.32602897,0.0044791535,0.00010241006,0.00019187263,0.0014482429,0.0013966548,0.014652487],"genre_scores_gemma":[0.9598559,0.00040532087,0.036682453,0.00039167245,0.000094856085,0.00013918683,0.00079454604,0.0002345059,0.0014015654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916401,0.0022693344,0.00066001574,0.001883487,0.0019768972,0.0015701653],"domain_scores_gemma":[0.92805237,0.0557077,0.0043571084,0.008162857,0.0018506763,0.0018691871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054526147,0.0011202499,0.00202165,0.002409793,0.0018581854,0.0056215557,0.0026495731,0.0021779537,0.004106334],"category_scores_gemma":[0.047265664,0.0009018114,0.0023082625,0.003416638,0.0037748017,0.007753754,0.0041606217,0.0049801897,0.00069253414],"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.004324938,0.00073204865,0.021294467,0.00082832965,0.00053654495,0.000842261,0.0026228921,0.4953925,0.037196744,0.34912917,0.009841744,0.07725833],"study_design_scores_gemma":[0.00012204822,0.00038426946,0.0032295396,0.00007993942,0.00016228252,0.001024533,0.00047767317,0.64122355,0.01013664,0.33985645,0.0031995575,0.000103503946],"about_ca_topic_score_codex":0.0013726236,"about_ca_topic_score_gemma":0.0007596221,"teacher_disagreement_score":0.0056215557,"about_ca_system_score_codex":0.0021343566,"about_ca_system_score_gemma":0.0016550558,"threshold_uncertainty_score":0.028836548},"labels":[],"label_agreement":null},{"id":"W2008152388","doi":"10.1063/1.2992977","title":"Additivity and distinguishability of random unitary channels","year":2008,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"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":"Unitary state; Additive function; Quantum channel; Circular ensemble; Quantum; Quantum relative entropy; Quantum phase estimation algorithm; Unitary matrix; Entropy (arrow of time)","score_opus":0.0371805067340154,"score_gpt":0.2494014278954573,"score_spread":0.2122209211614419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008152388","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.25808212,0.0007279269,0.6878995,0.0018518426,0.00012598786,0.00016163145,0.00051959296,0.00051137694,0.050120138],"genre_scores_gemma":[0.9518022,0.00052366167,0.040244408,0.00035670272,0.00025912712,0.00026644708,0.00036632316,0.00013471316,0.006046411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99181026,0.002476961,0.000376229,0.0017381156,0.0023118968,0.0012865975],"domain_scores_gemma":[0.9631144,0.02914035,0.002152007,0.0029629418,0.0012266859,0.0014035898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004326054,0.001289857,0.0017398339,0.0026320457,0.002331025,0.005999087,0.002527525,0.0016734002,0.005900484],"category_scores_gemma":[0.021326903,0.001274469,0.0024036122,0.001392951,0.010363285,0.008960843,0.0069437493,0.0062585813,0.0007882607],"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.00010227003,0.00003345194,0.00032072773,0.000056251014,0.000035949663,0.00008470813,0.0001426392,0.0154217845,0.0011059947,0.97901744,0.00038385548,0.003294924],"study_design_scores_gemma":[0.00002629372,0.000041360854,0.0002757234,0.000028975135,0.00003483332,0.0001568502,0.000057022648,0.07854622,0.002969954,0.91661805,0.0012134085,0.000031347012],"about_ca_topic_score_codex":0.00058695977,"about_ca_topic_score_gemma":0.0004308903,"teacher_disagreement_score":0.005999087,"about_ca_system_score_codex":0.002220972,"about_ca_system_score_gemma":0.0012624622,"threshold_uncertainty_score":0.022878647},"labels":[],"label_agreement":null},{"id":"W2009786555","doi":"10.1109/focs.2012.55","title":"A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint","year":2012,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":60,"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":"Matroid; Submodular set function; Greedy algorithm; Monotone polygon; Mathematics; Rounding; Function (biology); Combinatorics; Constraint (computer-aided design); Mathematical optimization; Approximation algorithm; Algorithm; Discrete mathematics; Combinatorial optimization; Computer science","score_opus":0.019811698661797293,"score_gpt":0.25453204224525283,"score_spread":0.23472034358345553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009786555","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.0046631424,0.00018094914,0.989702,0.0002560509,0.000044749282,0.00011123294,0.00008342609,0.00080681755,0.004151729],"genre_scores_gemma":[0.0920386,0.00023318957,0.90356016,0.00028938995,0.000106148866,0.0003845981,0.00033404728,0.0003393115,0.0027146135],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850285,0.00040142838,0.000074402524,0.00034089552,0.00046367268,0.00021683336],"domain_scores_gemma":[0.99812835,0.0011142786,0.00013982797,0.00036105653,0.00015129565,0.00010510521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016839989,0.0018960446,0.0015537929,0.0013513145,0.0006390126,0.0018789638,0.002580305,0.0019536829,0.009193577],"category_scores_gemma":[0.00727708,0.0008560674,0.0014089207,0.0019959384,0.001164189,0.0030513708,0.0031956362,0.0026195156,0.0027819236],"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.0003655298,0.0004803282,0.0007612275,0.00050748885,0.00012745759,0.0001661728,0.00022140458,0.34332022,0.008917786,0.14334518,0.021721538,0.48006567],"study_design_scores_gemma":[0.00012754984,0.000118443975,0.00017206318,0.00002853449,0.000025255265,0.00015150198,0.000040666957,0.91757244,0.0017586257,0.07635234,0.0036315508,0.000020983265],"about_ca_topic_score_codex":0.0017299092,"about_ca_topic_score_gemma":0.0025494448,"teacher_disagreement_score":0.009193577,"about_ca_system_score_codex":0.0017593396,"about_ca_system_score_gemma":0.0022825717,"threshold_uncertainty_score":0.03075558},"labels":[],"label_agreement":null},{"id":"W2010962367","doi":"10.1016/s0304-3975(00)00019-0","title":"A space lower bound for st-connectivity on node-named JAGs","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"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":"University of Toronto","keywords":"Upper and lower bounds; Combinatorics; Mathematics; Turing machine; Discrete mathematics; Path (computing); Logarithm; Directed graph; Space (punctuation); Computation; Computer science; Algorithm","score_opus":0.014345452906201827,"score_gpt":0.2586123640249335,"score_spread":0.24426691111873167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010962367","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.24734291,0.006861178,0.6103158,0.014707546,0.001096306,0.0006259862,0.006905765,0.005769331,0.10637516],"genre_scores_gemma":[0.8329423,0.004221975,0.12770307,0.0024101508,0.0015392908,0.00079379487,0.004534501,0.0019094668,0.02394549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99307597,0.0015488283,0.00034226626,0.0010029365,0.0021341548,0.0018958969],"domain_scores_gemma":[0.9438062,0.038389776,0.0024955063,0.008825491,0.0031983447,0.0032846981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041349595,0.0031531607,0.0043799384,0.004276139,0.004260413,0.00935687,0.0074359463,0.0042905235,0.026189309],"category_scores_gemma":[0.032003418,0.001647362,0.0030004052,0.008818612,0.0051785507,0.02384402,0.010069128,0.008285046,0.003877908],"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.0030778244,0.0006942692,0.0043541263,0.0018496743,0.00037127474,0.00050039537,0.0016043497,0.2411789,0.013189724,0.5798799,0.052379116,0.10092049],"study_design_scores_gemma":[0.00019177083,0.0004010643,0.0011242512,0.00019935498,0.00032222856,0.0005179285,0.00043706302,0.38280624,0.0056325765,0.5969852,0.011283197,0.000099016506],"about_ca_topic_score_codex":0.0036304267,"about_ca_topic_score_gemma":0.005536236,"teacher_disagreement_score":0.026189309,"about_ca_system_score_codex":0.004539959,"about_ca_system_score_gemma":0.003748452,"threshold_uncertainty_score":0.08761191},"labels":[],"label_agreement":null},{"id":"W2010996873","doi":"10.5555/1109557.1109577","title":"Combination can be hard: approximability of the unique coverage problem","year":2006,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":94,"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":"Hardness of approximation; Combinatorics; Approximation algorithm; Mathematics; Bipartite graph; Matching (statistics); Binary logarithm; Set (abstract data type); Discrete mathematics; Logarithm; Maximization; Time complexity; Computer science; Mathematical optimization","score_opus":0.011839585345832392,"score_gpt":0.22527799712169255,"score_spread":0.21343841177586015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010996873","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.26067078,0.0014816301,0.6773912,0.005320068,0.00019928397,0.00036134946,0.002073104,0.0033207028,0.04918182],"genre_scores_gemma":[0.78239816,0.0006964897,0.20254143,0.00071635057,0.000291872,0.0004592724,0.0021398528,0.00064878387,0.010107896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99532616,0.0011002182,0.00023145972,0.001463197,0.0010204557,0.00085856114],"domain_scores_gemma":[0.98946697,0.007098258,0.0007913885,0.0017199627,0.00042357307,0.000499922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026751426,0.0017183559,0.0021214727,0.0012084116,0.0015303042,0.0051061055,0.003701368,0.0023409987,0.012112121],"category_scores_gemma":[0.02008492,0.0011637255,0.0028473497,0.0026720897,0.0016394501,0.00919365,0.003611875,0.004646122,0.0013295669],"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.0016703358,0.0008987318,0.009351426,0.0010473789,0.0005691767,0.00084784924,0.00088368804,0.555603,0.007842246,0.22157702,0.024144202,0.17556505],"study_design_scores_gemma":[0.0001268827,0.000088559056,0.0007786719,0.00007232985,0.00015892042,0.00071526034,0.00016943795,0.699049,0.0045057735,0.28811306,0.0061937403,0.00002849471],"about_ca_topic_score_codex":0.002211783,"about_ca_topic_score_gemma":0.0026431684,"teacher_disagreement_score":0.012112121,"about_ca_system_score_codex":0.0026067037,"about_ca_system_score_gemma":0.0017161473,"threshold_uncertainty_score":0.04051906},"labels":[],"label_agreement":null},{"id":"W2011182146","doi":"10.1145/509907.509911","title":"Dynamic subgraph connectivity with geometric applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.017720459785821974,"score_gpt":0.22338481021640538,"score_spread":0.2056643504305834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011182146","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.049542084,0.00085236505,0.92188764,0.0035158752,0.00017450575,0.00023787166,0.0007445014,0.0015921444,0.021452922],"genre_scores_gemma":[0.55515194,0.0012055514,0.4295408,0.0009233385,0.00058652303,0.0006602536,0.0020212738,0.00044880735,0.0094614485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989316,0.00023164332,0.00004745876,0.00031950686,0.00034677377,0.00012295153],"domain_scores_gemma":[0.9961628,0.0018686629,0.00031372666,0.0011597747,0.00036067524,0.00013439829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006820377,0.0007874434,0.0006767503,0.0012816649,0.0008417736,0.001555473,0.0020107373,0.0011293504,0.01035562],"category_scores_gemma":[0.0076495684,0.00059121364,0.0007354026,0.0029527885,0.0015921209,0.0064484505,0.0037591457,0.0018834459,0.0012701876],"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.00025474036,0.00012148308,0.0020547882,0.00047510184,0.000049027596,0.00027629596,0.00031392716,0.14943813,0.008225888,0.50604177,0.029760873,0.30298802],"study_design_scores_gemma":[0.00006207981,0.000115324874,0.00067524565,0.000043774682,0.000042263433,0.00056188216,0.00013668666,0.42189503,0.0075306403,0.5254616,0.043439277,0.000036280624],"about_ca_topic_score_codex":0.0015170729,"about_ca_topic_score_gemma":0.0018320968,"teacher_disagreement_score":0.01035562,"about_ca_system_score_codex":0.0010728663,"about_ca_system_score_gemma":0.0007264086,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2011204371","doi":"10.1145/2229163.2229166","title":"I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","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":"Dalhousie University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Combinatorics; Mathematics; Binary logarithm; Shortest path problem; Undirected graph; Spanning tree; Minimum spanning tree; Random graph; Path (computing); Bounded function; Enhanced Data Rates for GSM Evolution; Time complexity; Shortest-path tree; Discrete mathematics; Algorithm; Graph; Computer science","score_opus":0.04606075865658251,"score_gpt":0.28554418786670077,"score_spread":0.23948342921011825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011204371","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.02680992,0.00086270407,0.9637966,0.00039820164,0.00007465348,0.00017394208,0.00030324556,0.0024208291,0.0051598665],"genre_scores_gemma":[0.24537545,0.00088968925,0.7471839,0.00022380856,0.00012262071,0.00038304488,0.000899138,0.00049131544,0.0044308836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983595,0.00036761645,0.0001287211,0.00045671946,0.00041794704,0.00026945732],"domain_scores_gemma":[0.9965043,0.0015798023,0.000459091,0.0010002875,0.00029132576,0.00016525495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093687314,0.0019283391,0.0012206481,0.0012365439,0.0008554681,0.0012981156,0.0030634692,0.0011837166,0.0050998908],"category_scores_gemma":[0.0070679807,0.0006329933,0.00093680574,0.002199797,0.00083821896,0.004220094,0.0027416432,0.0012544116,0.0022190467],"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.00073031546,0.0006780012,0.0017026218,0.00087793195,0.00014561649,0.00022316971,0.0003086334,0.35283947,0.03248771,0.06356475,0.017816389,0.5286253],"study_design_scores_gemma":[0.000250477,0.00032922553,0.00038658685,0.000053109357,0.00007704356,0.00037362624,0.00009237145,0.8547023,0.025265623,0.10685069,0.011555784,0.00006310195],"about_ca_topic_score_codex":0.00089305796,"about_ca_topic_score_gemma":0.001637365,"teacher_disagreement_score":0.0050998908,"about_ca_system_score_codex":0.0010136106,"about_ca_system_score_gemma":0.0014030802,"threshold_uncertainty_score":0.017060816},"labels":[],"label_agreement":null},{"id":"W2012511041","doi":"10.1007/s10107-005-0693-1","title":"A 2 + ɛ approximation algorithm for the k-MST problem","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","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":"McMaster University","funders":"","keywords":"Mathematics; Approximation algorithm; Minimum spanning tree; Combinatorics; Triangle inequality; Spanning tree; k-minimum spanning tree; Graph; Algorithm; Discrete mathematics; Tree structure; K-ary tree","score_opus":0.029306888118048803,"score_gpt":0.274109404855013,"score_spread":0.2448025167369642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012511041","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.052056305,0.0011901491,0.9102406,0.002936946,0.0007163587,0.00035577518,0.0010960278,0.004130193,0.027277634],"genre_scores_gemma":[0.13502738,0.0005047527,0.84665596,0.0005297021,0.00030541193,0.00042036778,0.0018179666,0.00039363935,0.014344925],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850404,0.0002436559,0.00009848044,0.00038267273,0.0005279149,0.0002433322],"domain_scores_gemma":[0.9982955,0.0006777773,0.00016474669,0.0004140811,0.00028148585,0.00016650898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010268653,0.001678157,0.001677114,0.0013246388,0.0010938477,0.0024550976,0.0034814815,0.002440007,0.014464374],"category_scores_gemma":[0.0044517764,0.0008884358,0.0017386863,0.0026648345,0.00083839195,0.0043746373,0.002446755,0.0036497735,0.0055649984],"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.0017221654,0.0009056593,0.0015014977,0.0005946725,0.00023038844,0.0001823571,0.0002675345,0.14715627,0.016540036,0.061808035,0.061757363,0.707334],"study_design_scores_gemma":[0.00064084603,0.00032885245,0.0012198477,0.00007396129,0.00015463785,0.0006007425,0.00013935263,0.85877496,0.006916829,0.11040364,0.02066943,0.00007694125],"about_ca_topic_score_codex":0.0029951248,"about_ca_topic_score_gemma":0.005083207,"teacher_disagreement_score":0.014464374,"about_ca_system_score_codex":0.0026716487,"about_ca_system_score_gemma":0.0029930694,"threshold_uncertainty_score":0.048388183},"labels":[],"label_agreement":null},{"id":"W2012939571","doi":"10.1023/a:1009893108387","title":"Steiner k-Edge Connected Subgraph Polyhedra","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":19,"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; Group for Research in Decision Analysis","funders":"","keywords":"Polytope; Polyhedron; Combinatorics; Mathematics; Theory of computation; Discrete mathematics; Graph; Enhanced Data Rates for GSM Evolution; Computer science; Algorithm","score_opus":0.008733764535961423,"score_gpt":0.2215240309997457,"score_spread":0.2127902664637843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012939571","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.45387128,0.0007632834,0.43002176,0.0021893675,0.00023061695,0.00037184634,0.0038589207,0.00079844013,0.10789451],"genre_scores_gemma":[0.7499719,0.0010071306,0.21252339,0.00043543574,0.00010202145,0.00025803733,0.00482841,0.00036077003,0.030512964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993395,0.00018500372,0.000048825845,0.00013293182,0.00017928747,0.00011440514],"domain_scores_gemma":[0.99877673,0.00052794884,0.0001741158,0.00024052948,0.00013249544,0.00014815679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003148282,0.00085523876,0.0012330689,0.00084138504,0.0009989272,0.0021015212,0.0020012883,0.0015036057,0.019680444],"category_scores_gemma":[0.0024158934,0.0008669403,0.0009903413,0.0020374428,0.0009084299,0.003167948,0.0019025891,0.0018562011,0.0026377651],"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.0010191964,0.00036129783,0.0025530318,0.0008990962,0.00019634611,0.0010418246,0.0004977406,0.29721743,0.015041635,0.51568633,0.03104883,0.13443725],"study_design_scores_gemma":[0.00015305646,0.00014484905,0.0017150939,0.00009203619,0.000073746385,0.00090288726,0.00038314454,0.38229007,0.005397953,0.595248,0.013555159,0.000044042525],"about_ca_topic_score_codex":0.0008531822,"about_ca_topic_score_gemma":0.0015099383,"teacher_disagreement_score":0.019680444,"about_ca_system_score_codex":0.0007190172,"about_ca_system_score_gemma":0.00048365773,"threshold_uncertainty_score":0.06583762},"labels":[],"label_agreement":null},{"id":"W2014708079","doi":"10.1007/s10878-014-9774-5","title":"Improved approximations for buy-at-bulk and shallow-light $$k$$ k -Steiner trees and $$(k,2)$$ ( k , 2 ) -subgraph","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","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 Alberta","funders":"","keywords":"Combinatorics; Steiner tree problem; Mathematics; Bounded function; Graph; Integer (computer science); Tree (set theory); Approximation algorithm; Function (biology); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.008175121224844557,"score_gpt":0.21915758837031976,"score_spread":0.2109824671454752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014708079","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.12373678,0.005409786,0.80090666,0.006677188,0.0011072782,0.0006910619,0.004628246,0.00701619,0.049826786],"genre_scores_gemma":[0.4233326,0.0018289436,0.54063916,0.0017750311,0.0006446387,0.00059410214,0.0062986873,0.0030919118,0.021794887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665546,0.0009148462,0.00013275885,0.00059530995,0.0008443396,0.00085731625],"domain_scores_gemma":[0.98486274,0.009631582,0.00061179564,0.002889698,0.001018215,0.000985957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042911307,0.0039326884,0.004636405,0.0024306076,0.0019912517,0.005278484,0.008272212,0.004523527,0.032533444],"category_scores_gemma":[0.029103069,0.002123458,0.0036158727,0.0046994872,0.0025129737,0.012648313,0.004955624,0.006277605,0.005997569],"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.0020373284,0.0008398965,0.0026494926,0.0009891181,0.00023750926,0.000275998,0.0004862663,0.67836845,0.002478867,0.11280472,0.0728059,0.12602647],"study_design_scores_gemma":[0.00010712432,0.00006672575,0.00025504493,0.00006891118,0.00007461969,0.000087025204,0.00012926516,0.91875935,0.0005205619,0.077413484,0.0024965974,0.000021313266],"about_ca_topic_score_codex":0.012801433,"about_ca_topic_score_gemma":0.03336058,"teacher_disagreement_score":0.032533444,"about_ca_system_score_codex":0.0077903047,"about_ca_system_score_gemma":0.006885245,"threshold_uncertainty_score":0.10883516},"labels":[],"label_agreement":null},{"id":"W2015242277","doi":"10.1145/1497290.1497295","title":"Bicriteria approximation tradeoff for the node-cost budget problem","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","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":"Seventh Framework Programme; Israel Science Foundation","keywords":"Approximation algorithm; Combinatorics; Mathematical optimization; Graph; Mathematics; Profit (economics); Binary logarithm; Computer science; Economics","score_opus":0.036657713358995384,"score_gpt":0.282440860536305,"score_spread":0.24578314717730965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015242277","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.117459744,0.0022410168,0.85727614,0.0031441203,0.000107623244,0.0002177749,0.0005466998,0.0012895048,0.017717298],"genre_scores_gemma":[0.54552364,0.0016955573,0.4403849,0.0011699323,0.00017050302,0.00065499323,0.0010364645,0.00069586694,0.00866809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996609,0.0012282539,0.00014579874,0.00059358124,0.00080590585,0.0006175348],"domain_scores_gemma":[0.99266523,0.004540013,0.0005830078,0.0014232708,0.00042446202,0.00036396887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044968897,0.0020221455,0.0030775254,0.0014123961,0.0009696032,0.0026148802,0.003925586,0.002501956,0.005689718],"category_scores_gemma":[0.018671991,0.0010731795,0.0011606148,0.0029517708,0.0014318936,0.0057153893,0.002783808,0.0041314797,0.0020126875],"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.0021089714,0.0006369991,0.0024203884,0.00042392898,0.00016563019,0.00021768399,0.0005316122,0.723331,0.006425151,0.14276133,0.013754089,0.10722322],"study_design_scores_gemma":[0.00011078507,0.00015109606,0.0003233333,0.00005233845,0.00004087813,0.00025418666,0.00009142929,0.9226265,0.0013244331,0.07197549,0.0030296878,0.0000197682],"about_ca_topic_score_codex":0.002667028,"about_ca_topic_score_gemma":0.0029196218,"teacher_disagreement_score":0.005689718,"about_ca_system_score_codex":0.0030610613,"about_ca_system_score_gemma":0.0021171344,"threshold_uncertainty_score":0.023782074},"labels":[],"label_agreement":null},{"id":"W2015423869","doi":"10.1007/s10107-009-0299-0","title":"New geometry-inspired relaxations and algorithms for the metric Steiner tree problem","year":2009,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Mathematics; Bipartite graph; Metric (unit); Linear programming relaxation; Combinatorics; Approximation algorithm; Upper and lower bounds; Algorithm; Relaxation (psychology); Schema (genetic algorithms); Discrete mathematics; Linear programming; Computer science; Graph","score_opus":0.03784171705136553,"score_gpt":0.2851208739396493,"score_spread":0.24727915688828378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015423869","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.01321498,0.0017193981,0.95835745,0.0025757346,0.00045745398,0.00011648406,0.00029425716,0.00028414637,0.022980055],"genre_scores_gemma":[0.12462711,0.0024117054,0.85666907,0.0010131446,0.0011015761,0.0004752729,0.00088422716,0.00057872734,0.01223925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817395,0.0007510717,0.00008235401,0.00027549476,0.0005525758,0.00016448347],"domain_scores_gemma":[0.9961165,0.00230366,0.00040671765,0.0004948,0.00038050866,0.00029786167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027708062,0.001876541,0.0018503617,0.0018364534,0.0012053399,0.0031565137,0.0035887617,0.0023863714,0.007862358],"category_scores_gemma":[0.012970387,0.0012686526,0.0020741178,0.0031559616,0.0020207872,0.0066193547,0.0043020323,0.008053938,0.001471018],"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.00022422556,0.00026589053,0.00040189663,0.00042190304,0.00008290912,0.00008819396,0.0002930022,0.18819267,0.0021593391,0.6698818,0.027446976,0.110541165],"study_design_scores_gemma":[0.00007479238,0.0000719716,0.00018980789,0.00007081525,0.000031154148,0.00010464488,0.00008417109,0.47725216,0.00064031826,0.5059269,0.015516291,0.000036940128],"about_ca_topic_score_codex":0.0014758152,"about_ca_topic_score_gemma":0.0021532143,"teacher_disagreement_score":0.007862358,"about_ca_system_score_codex":0.0023032157,"about_ca_system_score_gemma":0.0015710368,"threshold_uncertainty_score":0.026302218},"labels":[],"label_agreement":null},{"id":"W2016263640","doi":"10.1145/2635822","title":"The complexity of the comparator circuit value problem","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"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":"Seventh Framework Programme; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Complexity class; Combinatorics; Bipartite graph; Conjecture; Discrete mathematics; Class (philosophy); P; Comparator; Oracle; Time complexity; Graph; Computer science","score_opus":0.04217450054507668,"score_gpt":0.2620574507414464,"score_spread":0.2198829501963697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016263640","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.5095769,0.0036761155,0.37988606,0.022041028,0.0003089885,0.0006872402,0.0072404514,0.0017347253,0.074848466],"genre_scores_gemma":[0.9254757,0.0014382252,0.05651293,0.0010360254,0.00048128082,0.0005377944,0.004123434,0.00029799595,0.010096665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541616,0.0009745234,0.0002496397,0.0011255153,0.0014166317,0.00081753306],"domain_scores_gemma":[0.9821713,0.014741998,0.0008169035,0.0011764655,0.00060992537,0.0004834987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001822719,0.00072501955,0.0013233243,0.0011445578,0.0017687045,0.0061499947,0.0025737025,0.0029069646,0.011816188],"category_scores_gemma":[0.018154666,0.0006993582,0.0022302172,0.0020784084,0.0029937082,0.014925595,0.0032415218,0.005090623,0.00070878863],"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.0007122831,0.00035403337,0.0053123296,0.00090882415,0.00019947604,0.00047415833,0.0009703915,0.108872876,0.0043351767,0.78984016,0.017658211,0.070362054],"study_design_scores_gemma":[0.00010735389,0.000059351616,0.0014044,0.000051691328,0.00004812481,0.00032486682,0.00021852874,0.13613956,0.0025405914,0.85147107,0.007594892,0.000039476756],"about_ca_topic_score_codex":0.003168469,"about_ca_topic_score_gemma":0.001631569,"teacher_disagreement_score":0.011816188,"about_ca_system_score_codex":0.0043978845,"about_ca_system_score_gemma":0.0024451576,"threshold_uncertainty_score":0.039529026},"labels":[],"label_agreement":null},{"id":"W2016590269","doi":"10.1109/ccc.2014.34","title":"Mining Circuit Lower Bound Proofs for Meta-algorithms","year":2014,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Algorithm; Mathematical proof; Upper and lower bounds; Boolean function; Circuit minimization for Boolean functions; Computer science; Truth table; Discrete mathematics; Mathematics; Combinatorics; Boolean circuit","score_opus":0.09072336173278771,"score_gpt":0.28257512977703253,"score_spread":0.1918517680442448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016590269","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.06327423,0.002626789,0.91490924,0.0028986349,0.00015837015,0.00037090675,0.0027731326,0.006055906,0.0069328253],"genre_scores_gemma":[0.47105336,0.0018893474,0.51058334,0.0012121762,0.00040908778,0.0007203307,0.008305917,0.0015650638,0.0042613414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900726,0.0029079912,0.00060722267,0.0016119564,0.0041348673,0.0006652774],"domain_scores_gemma":[0.94013906,0.045251764,0.002950212,0.008187027,0.0028629063,0.00060905545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005437011,0.0015819157,0.0015895186,0.0044616605,0.001392207,0.00565615,0.004592015,0.0022993519,0.007254483],"category_scores_gemma":[0.070427194,0.0021173218,0.003064024,0.0043341434,0.002584529,0.010631947,0.0033532383,0.0039618975,0.0018589805],"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.00088966213,0.0004864409,0.008546749,0.002594672,0.0006182769,0.00097341544,0.00080250506,0.19250356,0.012638175,0.434252,0.022262963,0.3234317],"study_design_scores_gemma":[0.00014801035,0.00010630106,0.00062367244,0.0002149992,0.00015924309,0.00033635684,0.000087762506,0.43699846,0.0119850235,0.5375273,0.011766691,0.000046137902],"about_ca_topic_score_codex":0.0010610496,"about_ca_topic_score_gemma":0.0017242695,"teacher_disagreement_score":0.007254483,"about_ca_system_score_codex":0.0028117786,"about_ca_system_score_gemma":0.004018413,"threshold_uncertainty_score":0.028754056},"labels":[],"label_agreement":null},{"id":"W201798103","doi":"10.1007/978-3-319-07557-0_16","title":"A $\\frac{5}{4}$ -Approximation for Subcubic 2EC Using Circulations","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Approximation algorithm; Integer (computer science); Relaxation (psychology); Linear programming relaxation; Discrete mathematics; Linear programming; Algorithm; Computer science","score_opus":0.041494969496302866,"score_gpt":0.2730944437374828,"score_spread":0.23159947424117994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W201798103","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.11201744,0.0033884656,0.6174705,0.0063750525,0.0019299411,0.00045383084,0.0031205425,0.0088964,0.2463478],"genre_scores_gemma":[0.354769,0.0021558562,0.50406075,0.0031597354,0.0008406786,0.0007357764,0.0052259043,0.0047782003,0.124274164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982774,0.00021959093,0.000070878705,0.00037423082,0.0005799676,0.00047784968],"domain_scores_gemma":[0.99746823,0.0012110359,0.000112901784,0.0007449123,0.0002716933,0.0001913334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013075361,0.0024961059,0.002309037,0.0019620052,0.002301149,0.0046981736,0.0039457274,0.0025100424,0.039669283],"category_scores_gemma":[0.0057190373,0.00095982826,0.0025594146,0.0035342164,0.0017397949,0.006570232,0.0049624336,0.0073298635,0.009818024],"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.0010303161,0.00066883274,0.0013185001,0.00086152495,0.00013513169,0.0002445868,0.00049732166,0.029500382,0.0080861645,0.58072615,0.08825604,0.28867513],"study_design_scores_gemma":[0.0001765002,0.00010534163,0.0005418912,0.00022413529,0.00017114199,0.00031580118,0.00015988284,0.12488007,0.005452433,0.8246862,0.043232094,0.000054398533],"about_ca_topic_score_codex":0.0048313127,"about_ca_topic_score_gemma":0.009550758,"teacher_disagreement_score":0.039669283,"about_ca_system_score_codex":0.0037604978,"about_ca_system_score_gemma":0.0030857832,"threshold_uncertainty_score":0.13270694},"labels":[],"label_agreement":null},{"id":"W2020715570","doi":"10.1016/j.tcs.2014.04.009","title":"Multi-Path Algorithms for minimum-colour path problems with applications to approximating barrier resilience","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","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 British Columbia","funders":"","keywords":"Resilience (materials science); Path (computing); Algorithm; Computer science; Mathematics; Computer network; Physics","score_opus":0.020491603163998888,"score_gpt":0.27287342488921645,"score_spread":0.25238182172521756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020715570","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.017337164,0.0010997143,0.97456396,0.0011734241,0.00013984098,0.00013383917,0.00013659375,0.000700723,0.0047146403],"genre_scores_gemma":[0.25612697,0.0011092362,0.7341523,0.00036611813,0.00022796317,0.0005519364,0.00031679912,0.0005392662,0.0066093453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979512,0.00072136236,0.00010983975,0.00049470545,0.00044874765,0.00027417377],"domain_scores_gemma":[0.9802332,0.015171934,0.0011177773,0.0016895245,0.0008522729,0.00093519903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035065964,0.0023112446,0.0023034357,0.0034023523,0.0019036089,0.0027164952,0.0051867794,0.003609832,0.009345302],"category_scores_gemma":[0.026788447,0.0010711184,0.0020123455,0.0043236227,0.0028254997,0.008095978,0.0071490244,0.006822313,0.00095065386],"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.0004681931,0.0003104915,0.001029228,0.0005619761,0.0001081138,0.00010650539,0.00043704512,0.55861044,0.0031550082,0.29265106,0.009711169,0.13285072],"study_design_scores_gemma":[0.000047365847,0.00006034422,0.00012438757,0.0000426748,0.000028726537,0.000049413924,0.00005335332,0.83320713,0.00078081654,0.16363692,0.0019495448,0.000019417059],"about_ca_topic_score_codex":0.0029921972,"about_ca_topic_score_gemma":0.0044309287,"teacher_disagreement_score":0.009345302,"about_ca_system_score_codex":0.0034372495,"about_ca_system_score_gemma":0.0025570067,"threshold_uncertainty_score":0.031263113},"labels":[],"label_agreement":null},{"id":"W2020899710","doi":"10.1145/1328911.1328924","title":"Faster approximation schemes for fractional multicommodity flow problems","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","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":"McMaster University","funders":"","keywords":"Mathematics; Multi-commodity flow problem; Flow (mathematics); Fleischer; Representation (politics); Combinatorics; Upper and lower bounds; Flow network; Time complexity; Discrete mathematics; Tree (set theory); Maximum flow problem; Theory of computation; Approximation algorithm; Algorithm","score_opus":0.06449367461059989,"score_gpt":0.2738331663970109,"score_spread":0.20933949178641098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020899710","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.018238693,0.00058193604,0.97530025,0.00033439184,0.000097305274,0.00009308774,0.00009838394,0.0010462301,0.0042097396],"genre_scores_gemma":[0.27894902,0.0004057135,0.71527725,0.00022489246,0.00011364229,0.00027530547,0.00037480268,0.00035098923,0.0040283217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791497,0.00045003163,0.00012050519,0.00032068836,0.000827963,0.0003658358],"domain_scores_gemma":[0.995764,0.002067747,0.0002601767,0.0013038182,0.00045233424,0.00015179183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025362752,0.0013938699,0.0012715171,0.0010488235,0.0010706577,0.0020498312,0.002891871,0.0017697108,0.0057163644],"category_scores_gemma":[0.010898374,0.0005808616,0.001632078,0.001458638,0.0011892776,0.005388995,0.002669308,0.0030504237,0.0012287648],"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.0007155525,0.0002766789,0.0012364604,0.00039731085,0.000089269575,0.000121387406,0.00063347904,0.5459632,0.009195814,0.16565,0.0070360955,0.26868474],"study_design_scores_gemma":[0.00006167623,0.000043198273,0.000105065,0.000025967174,0.00001507954,0.00004140703,0.000032477237,0.9361392,0.0015473224,0.058505233,0.0034686187,0.0000148183135],"about_ca_topic_score_codex":0.00475008,"about_ca_topic_score_gemma":0.004492473,"teacher_disagreement_score":0.0057163644,"about_ca_system_score_codex":0.0026014252,"about_ca_system_score_gemma":0.0014066409,"threshold_uncertainty_score":0.019123137},"labels":[],"label_agreement":null},{"id":"W2023627355","doi":"10.1145/1993636.1993741","title":"Learning submodular functions","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":101,"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":"Submodular set function; Matroid; Multiplicative function; Upper and lower bounds; Monotone polygon; Learnability; Mathematics; Function (biology); Distribution (mathematics); Product (mathematics); Discrete mathematics; Sample (material); Combinatorics; Computer science; Artificial intelligence","score_opus":0.0434839937141398,"score_gpt":0.21171946030112956,"score_spread":0.16823546658698976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023627355","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.053255297,0.0010646428,0.9380847,0.0017261298,0.00007263328,0.00009786309,0.0004512519,0.0006684725,0.0045789317],"genre_scores_gemma":[0.6288263,0.001593422,0.35922223,0.0009756989,0.00043011422,0.00045975886,0.0019135338,0.00028672421,0.0062922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977768,0.0009477092,0.00009861314,0.0006491433,0.0003398909,0.00018777416],"domain_scores_gemma":[0.98923445,0.008202257,0.00051247654,0.0013472369,0.0004476243,0.00025596507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003417726,0.0013627249,0.00209341,0.00093471946,0.0006697164,0.0019400303,0.0021103455,0.0017281594,0.0035514256],"category_scores_gemma":[0.018543916,0.0007159161,0.0013101066,0.0016054912,0.0016503831,0.0061068167,0.00205254,0.003890622,0.0009797212],"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.00038373886,0.00038479318,0.00438864,0.0005108457,0.00019243934,0.0001303523,0.000305922,0.51153237,0.0024545882,0.22025439,0.012340844,0.247121],"study_design_scores_gemma":[0.00002482531,0.00006173144,0.0002660024,0.000024032437,0.000011390422,0.000052869225,0.000038626018,0.75986695,0.00073439704,0.23707204,0.0018364481,0.000010700067],"about_ca_topic_score_codex":0.0010322507,"about_ca_topic_score_gemma":0.0012120554,"teacher_disagreement_score":0.0035514256,"about_ca_system_score_codex":0.0014695892,"about_ca_system_score_gemma":0.0010505174,"threshold_uncertainty_score":0.01807493},"labels":[],"label_agreement":null},{"id":"W2024091095","doi":"10.1016/s0022-0000(02)00025-9","title":"Uniform constant-depth threshold circuits for division and iterated multiplication","year":2002,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":187,"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":"McGill University; Clay Mathematics Institute; National Science Foundation","keywords":"Modulo; Mathematics; Division (mathematics); Iterated function; Constant (computer programming); Natural number; Discrete mathematics; Electronic circuit; Integer (computer science); Multiplication (music); Boolean circuit; Arithmetic; Combinatorics; Computer science; Boolean function; Mathematical analysis","score_opus":0.05525673498615786,"score_gpt":0.26710998064801583,"score_spread":0.21185324566185798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024091095","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.4257094,0.003069245,0.47583622,0.0033764176,0.00029722435,0.00040315327,0.001484742,0.0033717805,0.08645191],"genre_scores_gemma":[0.93186533,0.0008505343,0.05067149,0.0005889676,0.00014260193,0.00023069404,0.0004943006,0.00028965142,0.014866437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987596,0.0001374218,0.00009769061,0.00036104792,0.00030351712,0.00034064482],"domain_scores_gemma":[0.99534875,0.0030463533,0.00035723718,0.0006602394,0.00027575443,0.0003116749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009472183,0.0008657315,0.0012383667,0.0013605879,0.0015246861,0.0053433115,0.0023739089,0.001762915,0.010116129],"category_scores_gemma":[0.008491115,0.0008334634,0.0010655274,0.0020634446,0.0022909532,0.010375978,0.003342251,0.0031774985,0.0010951734],"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.00051366916,0.000080649006,0.00070261554,0.00022211953,0.000033397988,0.00010007607,0.00040974526,0.007722741,0.005679635,0.93953633,0.0042296755,0.040769324],"study_design_scores_gemma":[0.000088812376,0.00003905191,0.0002966981,0.000044465578,0.00006157799,0.00015520427,0.00006728248,0.027930183,0.006436665,0.9612952,0.0035470903,0.000037788224],"about_ca_topic_score_codex":0.0015796294,"about_ca_topic_score_gemma":0.0025267426,"teacher_disagreement_score":0.010116129,"about_ca_system_score_codex":0.00436308,"about_ca_system_score_gemma":0.0017084203,"threshold_uncertainty_score":0.03384185},"labels":[],"label_agreement":null},{"id":"W2024836278","doi":"10.1142/s1793830912500085","title":"BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Complexity and Algorithms in Graphs","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Bounded function; Mathematics; Algorithm; Vertex (graph theory); Combinatorics; Treewidth; Tree-depth; Graph; Discrete mathematics; Theoretical computer science; Computer science; Pathwidth; Line graph","score_opus":0.03785958332532282,"score_gpt":0.3017967662122005,"score_spread":0.2639371828868777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024836278","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.021598486,0.00023381604,0.97339094,0.00021947123,0.000024326113,0.00016370397,0.00015261596,0.0014059896,0.0028106815],"genre_scores_gemma":[0.16576342,0.0002693141,0.82910585,0.00023388062,0.00004457734,0.0004448449,0.0010544567,0.0007221661,0.0023613642],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997872,0.00061272504,0.00014016757,0.000490746,0.0005771272,0.00030723252],"domain_scores_gemma":[0.9923465,0.0051955925,0.00036220922,0.0015692981,0.000352242,0.00017401112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020551737,0.0010675474,0.0013560343,0.0015095349,0.0009281894,0.001841041,0.0033726576,0.0015089178,0.006340775],"category_scores_gemma":[0.014531808,0.00074587006,0.0017374733,0.0024820536,0.0015304893,0.005318226,0.0031368092,0.0031193262,0.0015813804],"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.000620703,0.00042964672,0.002426459,0.0005191666,0.00009663535,0.00023875797,0.00061475416,0.26672763,0.01514455,0.22034273,0.011176891,0.48166206],"study_design_scores_gemma":[0.0001298952,0.000085700136,0.0002250947,0.000039090195,0.000038136488,0.00013229859,0.000069645015,0.7963997,0.0051201256,0.19397792,0.003757076,0.000025407457],"about_ca_topic_score_codex":0.0026891655,"about_ca_topic_score_gemma":0.0039840103,"teacher_disagreement_score":0.006340775,"about_ca_system_score_codex":0.0015013881,"about_ca_system_score_gemma":0.0021520539,"threshold_uncertainty_score":0.021211982},"labels":[],"label_agreement":null},{"id":"W2026036943","doi":"10.1007/s00037-004-0182-6","title":"Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds","year":2004,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":384,"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":"Mathematics; Polynomial; Arithmetic circuit complexity; Combinatorics; Nondeterministic algorithm; Discrete mathematics; Bounded function; Identity (music); Degree (music); Upper and lower bounds; Arithmetic; Arbitrary-precision arithmetic","score_opus":0.05471051344573013,"score_gpt":0.28800868506642247,"score_spread":0.23329817162069233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026036943","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.10227519,0.0012310651,0.8325782,0.015689967,0.00091702264,0.00047637642,0.0013258295,0.0030263439,0.042480048],"genre_scores_gemma":[0.8415281,0.0014241411,0.1312929,0.0053654956,0.0016299348,0.0008100466,0.0022502863,0.0021829978,0.013516056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9723041,0.0108723175,0.0010734347,0.0059689777,0.005630726,0.0041504833],"domain_scores_gemma":[0.72769433,0.2354011,0.0034361552,0.025582826,0.0054534874,0.0024320567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011215466,0.003161337,0.0040759,0.0025690468,0.0035379736,0.009421405,0.009121137,0.0059020063,0.016705455],"category_scores_gemma":[0.10167631,0.002284436,0.0056227474,0.0036828087,0.01241993,0.025250921,0.013916389,0.019462056,0.0035577915],"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.001336877,0.00068626116,0.0038577698,0.00094360235,0.00026802067,0.00030146158,0.00085644255,0.07379137,0.006289975,0.8242863,0.020352867,0.06702907],"study_design_scores_gemma":[0.00014318073,0.00008412386,0.00036470857,0.00006580207,0.000120600394,0.00011922923,0.0001356754,0.10740147,0.008317246,0.8796413,0.0035614327,0.00004522394],"about_ca_topic_score_codex":0.0023446756,"about_ca_topic_score_gemma":0.0029175847,"teacher_disagreement_score":0.016705455,"about_ca_system_score_codex":0.007584944,"about_ca_system_score_gemma":0.0060493564,"threshold_uncertainty_score":0.059313774},"labels":[],"label_agreement":null},{"id":"W2026365732","doi":"10.1016/j.tcs.2013.05.003","title":"Addendum to “Recursively defined metric spaces without contraction” [Theoret. Comput. Sci. 380 (1/2) (2007) 143–163]","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Addendum; Mathematics; Contraction (grammar); Metric space; Metric (unit); Discrete mathematics; Combinatorics; Algorithm; Algebra over a field; Calculus (dental); Pure mathematics; Engineering","score_opus":0.012924827962777725,"score_gpt":0.25207466812166757,"score_spread":0.23914984015888985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026365732","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.0061048213,0.021790342,0.40238953,0.049009115,0.22004187,0.00029911858,0.0053374,0.004097436,0.2909304],"genre_scores_gemma":[0.115681425,0.031049563,0.34047043,0.036698617,0.13560995,0.0012044724,0.01896425,0.006860655,0.31346068],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983575,0.00036608562,0.000076400116,0.00039909888,0.0006649045,0.00013603098],"domain_scores_gemma":[0.9950015,0.0019303776,0.00027223298,0.0010934286,0.0011882101,0.0005141624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018294846,0.0026680112,0.0016679411,0.0031572941,0.001946708,0.0038347635,0.0046882527,0.0021997425,0.08790705],"category_scores_gemma":[0.0091748405,0.00081903365,0.0028005394,0.003516872,0.0027947607,0.007563337,0.006098103,0.0060810694,0.041187562],"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.00017607994,0.0001705348,0.00043965798,0.00088662974,0.00013225598,0.0004306274,0.00029318052,0.0013412118,0.0023602997,0.2700184,0.6067926,0.11695856],"study_design_scores_gemma":[0.00004896862,0.00013604952,0.0012578042,0.0001855594,0.00012536469,0.0011371038,0.00011240201,0.004209147,0.0020249707,0.24144547,0.74916756,0.00014957941],"about_ca_topic_score_codex":0.0025182983,"about_ca_topic_score_gemma":0.0045413496,"teacher_disagreement_score":0.08790705,"about_ca_system_score_codex":0.0015633061,"about_ca_system_score_gemma":0.0015384422,"threshold_uncertainty_score":0.29407835},"labels":[],"label_agreement":null},{"id":"W2029278215","doi":"10.3390/a1010002","title":"Impact of Locality on Location Aware Unit Disk Graphs","year":2008,"lang":"en","type":"article","venue":"Algorithms","topic":"Complexity and Algorithms in Graphs","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":"Carleton University","funders":"","keywords":"Locality; Unit disk graph; Dominating set; Computer science; Vertex (graph theory); Vertex cover; Connected dominating set; Unit disk; Set (abstract data type); Constant (computer programming); Wireless network; Set cover problem; Cover (algebra); Approximation algorithm; Maximal independent set; Theoretical computer science; Wireless; Graph; Algorithm; Combinatorics; Mathematics; Chordal graph; 1-planar graph; Telecommunications","score_opus":0.05234068564554768,"score_gpt":0.30624244218194935,"score_spread":0.2539017565364017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029278215","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.5430854,0.005058152,0.4266998,0.0046438286,0.000105104766,0.00018006061,0.0005529433,0.0013366588,0.018338135],"genre_scores_gemma":[0.972029,0.0008757333,0.02450653,0.00025407414,0.000094370705,0.00009508148,0.00014963123,0.00015651682,0.0018390194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963973,0.0017819199,0.00010805921,0.0005995251,0.0007114484,0.0004016886],"domain_scores_gemma":[0.9516103,0.038540334,0.0040523154,0.0029783002,0.0014806993,0.0013379811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024025033,0.00061562087,0.0017347555,0.0010971581,0.0017938286,0.0021938195,0.0024314565,0.001457737,0.0030959842],"category_scores_gemma":[0.031494122,0.0006238362,0.00058725214,0.0019837986,0.0022228877,0.0053991154,0.0029340284,0.0017587586,0.0006012044],"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.0011780775,0.00035152622,0.007722456,0.0010214394,0.0001651881,0.0005767012,0.00085777574,0.7929594,0.009134703,0.13203004,0.0067797336,0.047223024],"study_design_scores_gemma":[0.000074461874,0.00023099541,0.001474886,0.00005753567,0.000074517935,0.00047011927,0.00030915067,0.89878255,0.005131841,0.090625554,0.0027348178,0.00003366476],"about_ca_topic_score_codex":0.001539347,"about_ca_topic_score_gemma":0.0019803208,"teacher_disagreement_score":0.0030959842,"about_ca_system_score_codex":0.0019191315,"about_ca_system_score_gemma":0.00079611025,"threshold_uncertainty_score":0.01392436},"labels":[],"label_agreement":null},{"id":"W2030012922","doi":"10.1145/1597036.1597043","title":"A linear-time algorithm to find a separator in a graph excluding a minor","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":29,"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":"Combinatorics; Vertex (graph theory); Mathematics; Time complexity; Graph; Algorithm; Separator (oil production); Minor (academic); Discrete mathematics; Physics","score_opus":0.028380276662102726,"score_gpt":0.29104313032599277,"score_spread":0.26266285366389003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030012922","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.111483194,0.00065181986,0.8617183,0.0011415546,0.00012476378,0.0007689424,0.0015616302,0.011934189,0.010615571],"genre_scores_gemma":[0.16802897,0.00017970393,0.8214245,0.00018284503,0.000055473534,0.0003467589,0.0035941682,0.00043251808,0.0057549947],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989881,0.000122047124,0.000095068805,0.00036218468,0.00020708532,0.00022559155],"domain_scores_gemma":[0.99820435,0.0008065584,0.00023370347,0.00039173962,0.00016939282,0.00019421372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006423175,0.0018011925,0.0013460078,0.0011959426,0.0013546036,0.0015635778,0.0025010672,0.0013421797,0.009559499],"category_scores_gemma":[0.0025823382,0.0009843563,0.0014657709,0.0021454543,0.00077725196,0.0039584558,0.002367627,0.0013134005,0.004066859],"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.0036368743,0.0012352084,0.0051788897,0.001686392,0.0003748035,0.00055280636,0.0010015254,0.10254598,0.06600056,0.024408702,0.032826632,0.7605517],"study_design_scores_gemma":[0.0012474773,0.001069931,0.0023075836,0.00009443112,0.00021749928,0.0010341713,0.0005439824,0.8648168,0.029217456,0.074122764,0.02521732,0.00011062406],"about_ca_topic_score_codex":0.0029241045,"about_ca_topic_score_gemma":0.0053954804,"teacher_disagreement_score":0.009559499,"about_ca_system_score_codex":0.0014897799,"about_ca_system_score_gemma":0.002660609,"threshold_uncertainty_score":0.03197974},"labels":[],"label_agreement":null},{"id":"W2030970869","doi":"10.1145/1597036.1597045","title":"A better approximation ratio for the vertex cover problem","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":156,"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":"Mathematics; Combinatorics; Vertex cover; Cover (algebra); Relaxation (psychology); Vertex (graph theory); Maximum cut; Approximation algorithm; Set cover problem; Set (abstract data type); Discrete mathematics; Computer science; Graph","score_opus":0.027687554589769903,"score_gpt":0.26386242298239165,"score_spread":0.23617486839262175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030970869","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.0799201,0.0066339476,0.8468265,0.012656005,0.0018862834,0.0003286779,0.0013105256,0.0036539263,0.04678413],"genre_scores_gemma":[0.45956498,0.0032030724,0.50500953,0.004404626,0.0021636044,0.0005921061,0.0035359843,0.0024420335,0.019084085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930823,0.0020947708,0.00020931142,0.0016214821,0.0017749779,0.0012171656],"domain_scores_gemma":[0.98602194,0.008052012,0.00059776247,0.003705475,0.0009581965,0.00066470803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051013166,0.003560206,0.002747485,0.0020327643,0.001039317,0.004581069,0.0039832857,0.0041440823,0.024824625],"category_scores_gemma":[0.025420202,0.0008472944,0.0031300292,0.00296978,0.0015443763,0.010881003,0.0035805558,0.008313023,0.005788654],"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.0031411783,0.002080884,0.0031961747,0.0013313389,0.00044951212,0.0004887141,0.00058860396,0.26116347,0.025166823,0.2588535,0.075288445,0.36825138],"study_design_scores_gemma":[0.00035046772,0.0003977418,0.0007308785,0.00012304427,0.00015515024,0.0007621582,0.00015914717,0.7947406,0.0063526174,0.17776358,0.018401671,0.0000629965],"about_ca_topic_score_codex":0.0025627692,"about_ca_topic_score_gemma":0.0029636687,"teacher_disagreement_score":0.024824625,"about_ca_system_score_codex":0.0032544287,"about_ca_system_score_gemma":0.0025721523,"threshold_uncertainty_score":0.083046615},"labels":[],"label_agreement":null},{"id":"W2032198109","doi":"10.1007/s00493-008-2157-8","title":"An algorithm for packing non-zero A-paths in group-labelled graphs","year":2008,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Disjoint sets; Path (computing); Abelian group; Graph; Group (periodic table); Matching (statistics); Induced path; Zero (linguistics); Discrete mathematics; Algorithm; Longest path problem; Shortest path problem; Computer science","score_opus":0.02376304741433146,"score_gpt":0.2586423356285821,"score_spread":0.2348792882142506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032198109","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.07215099,0.00020678504,0.90881765,0.00079858984,0.00014813,0.00048903096,0.0008628506,0.0058171363,0.010708844],"genre_scores_gemma":[0.09664979,0.00011292117,0.8966387,0.00012877629,0.00003250207,0.00027978476,0.0014583627,0.00040539211,0.004293872],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988851,0.00017675853,0.00010150118,0.00033681933,0.00027664445,0.00022329994],"domain_scores_gemma":[0.9969258,0.0012863483,0.00025025065,0.0008752259,0.00030907607,0.0003532447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008463931,0.00161692,0.0016572658,0.0020704484,0.002356894,0.0036032794,0.0038406898,0.003020441,0.014830436],"category_scores_gemma":[0.003981428,0.0011962474,0.0015770557,0.004507965,0.0016140606,0.005613757,0.0047901543,0.0024817241,0.0039078514],"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.0010115744,0.00097447436,0.0028799146,0.000985136,0.00018814635,0.0003915268,0.0011950566,0.0560699,0.026038043,0.11214982,0.03032837,0.76778805],"study_design_scores_gemma":[0.0005989967,0.0004484293,0.0014581301,0.00014495527,0.00023734751,0.0006796551,0.0007686819,0.5042238,0.024516424,0.4467417,0.020041626,0.00014030025],"about_ca_topic_score_codex":0.003493609,"about_ca_topic_score_gemma":0.0050398638,"teacher_disagreement_score":0.014830436,"about_ca_system_score_codex":0.0018482114,"about_ca_system_score_gemma":0.0025235922,"threshold_uncertainty_score":0.04961276},"labels":[],"label_agreement":null},{"id":"W2032923445","doi":"10.2139/ssrn.2160674","title":"Easy with Difficulty Objective Functions for Max Cut","year":2002,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Complexity and Algorithms in Graphs","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; University of British Columbia Hospital","funders":"","keywords":"Mathematics; Computer science; Arithmetic","score_opus":0.014968181310300047,"score_gpt":0.2184014908054379,"score_spread":0.20343330949513783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032923445","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.02768798,0.0010118744,0.9339119,0.0011932598,0.00027328127,0.000244321,0.00091099745,0.0008197051,0.033946622],"genre_scores_gemma":[0.39565766,0.0012848133,0.54898256,0.0007551814,0.0007275441,0.0010223906,0.0025009126,0.00199232,0.047076546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998326,0.0006496165,0.00007125601,0.0002886598,0.00043191924,0.00023255331],"domain_scores_gemma":[0.9934948,0.004564726,0.00039671548,0.0006301107,0.00046193137,0.00045169095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029999772,0.0029498236,0.0017012415,0.0022146262,0.0010039303,0.0031254292,0.0032270364,0.0023625349,0.025572967],"category_scores_gemma":[0.013327017,0.0009591924,0.0016608095,0.0016921858,0.0012115816,0.006482217,0.0037542505,0.005137698,0.0025895245],"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.00054887694,0.0006549336,0.0014040989,0.0011615799,0.00018247412,0.0002361562,0.00025032836,0.324657,0.003063157,0.4089364,0.042521186,0.21638386],"study_design_scores_gemma":[0.00008587028,0.00019475543,0.00058260985,0.00012657359,0.00006160768,0.00018991345,0.000084888314,0.4209009,0.0016658052,0.5665535,0.009519412,0.000034190143],"about_ca_topic_score_codex":0.0010846514,"about_ca_topic_score_gemma":0.0015219583,"teacher_disagreement_score":0.025572967,"about_ca_system_score_codex":0.0014797752,"about_ca_system_score_gemma":0.0010492512,"threshold_uncertainty_score":0.08555007},"labels":[],"label_agreement":null},{"id":"W2033642621","doi":"10.1016/j.dam.2015.04.004","title":"The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases","year":2015,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Generalization; Rank (graph theory); Discrete mathematics; Time complexity; Quadratic equation; Matrix (chemical analysis)","score_opus":0.043573282218933806,"score_gpt":0.2789088800179288,"score_spread":0.235335597798995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033642621","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.410651,0.002623019,0.34662026,0.013382597,0.0007047598,0.0003600278,0.0035726966,0.000571457,0.22151415],"genre_scores_gemma":[0.90858036,0.00074334483,0.053211596,0.0009248177,0.000810283,0.00025715734,0.0018778092,0.0002516998,0.03334293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812144,0.0007435932,0.000059850874,0.00039959932,0.0002825814,0.00039291423],"domain_scores_gemma":[0.9936162,0.004821225,0.0006329637,0.00030752606,0.0003077317,0.00031436075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019304804,0.0013512464,0.0017099736,0.00097638945,0.0015025209,0.0041715596,0.0023157916,0.0045675854,0.01634137],"category_scores_gemma":[0.0120065585,0.00078612874,0.0010882802,0.001909546,0.002240932,0.0039271987,0.0021194536,0.0035547887,0.0010860396],"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.0007490385,0.00051961205,0.001505434,0.00094914396,0.00012850168,0.0009273733,0.00033767652,0.12419275,0.0016616202,0.7882046,0.04090889,0.03991532],"study_design_scores_gemma":[0.00014717961,0.00005537826,0.00059964147,0.00005692724,0.00002593023,0.00025017982,0.00019241679,0.21875444,0.0005358433,0.7759447,0.0034045419,0.00003273983],"about_ca_topic_score_codex":0.0037253827,"about_ca_topic_score_gemma":0.0041899425,"teacher_disagreement_score":0.01634137,"about_ca_system_score_codex":0.0014032926,"about_ca_system_score_gemma":0.0013483089,"threshold_uncertainty_score":0.054667294},"labels":[],"label_agreement":null},{"id":"W2035762900","doi":"10.1145/1595391.1595392","title":"Improved Separations between Nondeterministic and Randomized Multiparty Communication","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","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":"University of Toronto","funders":"Division of Computing and Communication Foundations","keywords":"Mathematics; Nondeterministic algorithm; Constant (computer programming); Combinatorics; Function (biology); Communication complexity; Binary logarithm; Discrete mathematics; Set (abstract data type); Computer science","score_opus":0.023594611815198247,"score_gpt":0.2962639757253391,"score_spread":0.27266936391014085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035762900","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.0647071,0.0010389837,0.89792603,0.00233535,0.00026309033,0.00014597365,0.00029927207,0.0020261072,0.03125805],"genre_scores_gemma":[0.76495975,0.00052012043,0.22055627,0.0006347934,0.00019062235,0.00040267676,0.00032507387,0.00049052725,0.011920235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99229914,0.0026625718,0.00035693048,0.0016320132,0.0020228936,0.0010265255],"domain_scores_gemma":[0.9773187,0.0133804055,0.00097127253,0.0067753745,0.00077852857,0.0007757652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055251787,0.0010904574,0.0016226487,0.0010074505,0.0016563998,0.0036162522,0.003767629,0.0027625326,0.008154783],"category_scores_gemma":[0.021153076,0.0010992661,0.001763693,0.0011721792,0.0037729787,0.012494952,0.0079986155,0.010928228,0.0024038865],"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.0008799177,0.000173126,0.0003619391,0.00021888767,0.00003642899,0.00016298541,0.00035239465,0.044783603,0.0074337963,0.91383135,0.002364812,0.02940087],"study_design_scores_gemma":[0.00015920744,0.00013984278,0.00020270636,0.000061992454,0.000039219074,0.00017247131,0.000057132245,0.23352987,0.014126349,0.7419555,0.009489058,0.00006656391],"about_ca_topic_score_codex":0.0005593744,"about_ca_topic_score_gemma":0.00054367434,"teacher_disagreement_score":0.008154783,"about_ca_system_score_codex":0.0028275454,"about_ca_system_score_gemma":0.0022879492,"threshold_uncertainty_score":0.029220223},"labels":[],"label_agreement":null},{"id":"W2036569687","doi":"10.5555/1283383.1283507","title":"An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem","year":2007,"lang":"en","type":"article","venue":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"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":"Combinatorics; Steiner tree problem; Path (computing); Terminal (telecommunication); Graph; Connection (principal bundle); Connectivity; Mathematics; Enhanced Data Rates for GSM Evolution; Computer science; Set (abstract data type); Discrete mathematics; Computer network; Telecommunications","score_opus":0.10361633555766601,"score_gpt":0.3297581427751367,"score_spread":0.22614180721747068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036569687","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.1608173,0.00033069044,0.82824224,0.0007061191,0.00008942963,0.00062979024,0.00044176844,0.0009788852,0.0077638594],"genre_scores_gemma":[0.7893947,0.00017849318,0.20603143,0.000120219156,0.000041913874,0.00043643446,0.00029009627,0.00008387592,0.0034230223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997326,0.0010239116,0.00017186241,0.00043174406,0.0005772632,0.00046918145],"domain_scores_gemma":[0.9975005,0.000912555,0.00042376562,0.0006481558,0.00018561175,0.0003293445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041169575,0.0010032309,0.0015190503,0.00086390163,0.0012848598,0.0016991331,0.0038582766,0.0017298548,0.0042388593],"category_scores_gemma":[0.005586379,0.00063652475,0.0010053129,0.0018016385,0.0009492122,0.0041960287,0.0023004736,0.001214837,0.00043943556],"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.0017340278,0.0008379874,0.0020154265,0.0005032607,0.00023966112,0.00043689238,0.0005946152,0.48040417,0.012373345,0.30566195,0.01110107,0.18409748],"study_design_scores_gemma":[0.00030898929,0.00037358515,0.00055053545,0.0000350006,0.00006108564,0.00040485166,0.00013866513,0.839356,0.0030476057,0.14873381,0.006926975,0.00006291331],"about_ca_topic_score_codex":0.001230128,"about_ca_topic_score_gemma":0.0012870322,"teacher_disagreement_score":0.0042388593,"about_ca_system_score_codex":0.0016496732,"about_ca_system_score_gemma":0.0019025746,"threshold_uncertainty_score":0.021772802},"labels":[],"label_agreement":null},{"id":"W2037387767","doi":"10.1016/j.jda.2006.05.002","title":"Cut problems in graphs with a budget constraint","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo","funders":"","keywords":"Maximum cut; Approximation algorithm; Constraint (computer-aided design); Mathematics; Mathematical optimization; Constant (computer programming); Combinatorics; Computer science; Graph","score_opus":0.010646582172347409,"score_gpt":0.2290906437144165,"score_spread":0.2184440615420691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037387767","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.122603774,0.0032281957,0.8357934,0.008081479,0.00044258806,0.00045807366,0.0014946042,0.00049154815,0.027406394],"genre_scores_gemma":[0.61606336,0.003562401,0.34920982,0.0012109667,0.0007852582,0.000862247,0.0022226956,0.0006089346,0.025474206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977679,0.00095458183,0.00012351375,0.00039173604,0.00040340362,0.00035883003],"domain_scores_gemma":[0.9750752,0.0212566,0.0009954883,0.0008805722,0.00066059,0.00113154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030792612,0.0014590361,0.0026145792,0.0018678139,0.0016525051,0.005077172,0.003880456,0.004059106,0.010808054],"category_scores_gemma":[0.021734942,0.0019236306,0.0015281441,0.0036745458,0.0023469063,0.011150279,0.003575157,0.0054406347,0.00080591615],"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.00055449875,0.000396313,0.0018140059,0.00083668536,0.00017799252,0.00029143153,0.00039735105,0.21749221,0.0019620797,0.6987667,0.018309431,0.059001226],"study_design_scores_gemma":[0.00014196514,0.000051657295,0.00031828188,0.00009284012,0.0000584341,0.00015481036,0.00015554276,0.2890893,0.0008363927,0.7050731,0.0040018945,0.000025759904],"about_ca_topic_score_codex":0.0031066283,"about_ca_topic_score_gemma":0.0033904086,"teacher_disagreement_score":0.010808054,"about_ca_system_score_codex":0.0023796763,"about_ca_system_score_gemma":0.0018223563,"threshold_uncertainty_score":0.036156535},"labels":[],"label_agreement":null},{"id":"W2037455685","doi":"10.1016/j.orl.2010.03.003","title":"Revisiting a simple algorithm for the planar multiterminal cut problem","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"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":"Simple (philosophy); Planar; Algorithm; SIMPLE algorithm; Mathematics; Maximum cut; Combinatorics; Terminal (telecommunication); Time complexity; Minimum cut; Computer science; Physics; Telecommunications; Graph","score_opus":0.059342137113430476,"score_gpt":0.36125828020580025,"score_spread":0.3019161430923698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037455685","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.017768074,0.00043922424,0.9636018,0.00096473173,0.00048053247,0.000384922,0.00027499217,0.002389603,0.01369605],"genre_scores_gemma":[0.08392651,0.000388295,0.9041422,0.0004229007,0.00027976403,0.00029527393,0.00082462694,0.0006858902,0.0090345945],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982315,0.00030133626,0.00012486022,0.00047039674,0.0006362459,0.00023568865],"domain_scores_gemma":[0.99624616,0.001824871,0.00015435531,0.0010908265,0.00050580513,0.00017796134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001075981,0.0014888516,0.001708483,0.0015139241,0.0014240653,0.0028524282,0.004158315,0.0026944843,0.018369853],"category_scores_gemma":[0.0065768613,0.000821344,0.001887792,0.0029257468,0.0012890146,0.0060178344,0.004864136,0.003665065,0.0053423797],"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.0005934838,0.0005096423,0.00088334584,0.00078588893,0.00012329158,0.00041376802,0.00032882954,0.041915916,0.019247813,0.10548567,0.025321044,0.80439126],"study_design_scores_gemma":[0.00065374735,0.00043851338,0.0012218246,0.00017778162,0.00021609852,0.0009080508,0.00033188838,0.4978348,0.013470399,0.42504105,0.059586994,0.00011893765],"about_ca_topic_score_codex":0.002046986,"about_ca_topic_score_gemma":0.003946704,"teacher_disagreement_score":0.018369853,"about_ca_system_score_codex":0.0012754952,"about_ca_system_score_gemma":0.0021678838,"threshold_uncertainty_score":0.061453283},"labels":[],"label_agreement":null},{"id":"W2037688351","doi":"10.5555/545381.545430","title":"I/O-optimal algorithms for planar graphs using separators","year":2002,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"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":"Planar graph; Planar straight-line graph; Breadth-first search; Planar; Algorithm; Book embedding; Computer science; Embedding; Outerplanar graph; Vertex (graph theory); Depth-first search; Graph; Search algorithm; Pathwidth; Theoretical computer science; Line graph; Artificial intelligence","score_opus":0.047448525013619354,"score_gpt":0.2870264706846065,"score_spread":0.23957794567098717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037688351","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.024048623,0.00052904745,0.9610986,0.00036067664,0.000055349683,0.00015974714,0.00026217112,0.0038729722,0.009612781],"genre_scores_gemma":[0.14285353,0.0006114024,0.847945,0.00015284141,0.00006668486,0.00034642863,0.0013281803,0.0007824156,0.005913518],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989261,0.0001622481,0.00008807305,0.00025483375,0.000336288,0.00023240523],"domain_scores_gemma":[0.9974126,0.0012635009,0.00038781576,0.00057815854,0.0002498331,0.00010813085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065472064,0.002103462,0.0010032902,0.0014702904,0.00095775194,0.0018009165,0.0024032348,0.0014432824,0.011493973],"category_scores_gemma":[0.004960315,0.00071085326,0.0014607093,0.0028641461,0.0012028277,0.0059966,0.0037441005,0.0021698808,0.003191057],"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.0007364142,0.0005016213,0.0013389367,0.0008609644,0.0001492888,0.0001624967,0.00036736022,0.21123642,0.023673533,0.11835226,0.017190047,0.62543064],"study_design_scores_gemma":[0.00026633503,0.00027312696,0.0004723851,0.000106393636,0.00010200832,0.0002778394,0.00024276551,0.6551561,0.038502917,0.28670043,0.017840013,0.00005972583],"about_ca_topic_score_codex":0.0013387882,"about_ca_topic_score_gemma":0.0022538484,"teacher_disagreement_score":0.011493973,"about_ca_system_score_codex":0.0016107468,"about_ca_system_score_gemma":0.0016034418,"threshold_uncertainty_score":0.038451195},"labels":[],"label_agreement":null},{"id":"W2039116808","doi":"10.1006/jcss.2001.1764","title":"On the Complexity of Some Problems on Groups Input as Multiplication Tables","year":2001,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","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":"Université de Montréal","funders":"","keywords":"Mathematics; Iterated function; Multiplication (music); Abelian group; Group (periodic table); Combinatorics; Nilpotent; Associative property; Discrete mathematics; Binary number; Arithmetic; Pure mathematics","score_opus":0.06203262370306753,"score_gpt":0.26828629767360634,"score_spread":0.20625367397053881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039116808","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.8092277,0.0020407909,0.1254017,0.015252197,0.00035253735,0.00057554233,0.004195964,0.0017025919,0.04125104],"genre_scores_gemma":[0.896874,0.000833249,0.08502843,0.00086196215,0.0007052172,0.00035655196,0.00375005,0.0006206622,0.010969923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935336,0.002081628,0.00038078873,0.001069619,0.001585009,0.0013493273],"domain_scores_gemma":[0.8592752,0.12862338,0.0035129776,0.004841231,0.0020769911,0.0016703272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048622536,0.0018349,0.0026205697,0.0022951434,0.0032743753,0.008516548,0.0037809054,0.0040158243,0.019943882],"category_scores_gemma":[0.047852825,0.0012191747,0.0025952603,0.004813728,0.0036985467,0.015870707,0.0038049966,0.005562954,0.0010996273],"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.0062887208,0.0018883379,0.01622337,0.0016607306,0.00055571116,0.0010019791,0.0018100153,0.50451654,0.0071049025,0.2963911,0.052524853,0.110033706],"study_design_scores_gemma":[0.00046823683,0.00017421009,0.00239736,0.00007645521,0.0001633563,0.0003488396,0.00044526724,0.5903552,0.0034176926,0.39929983,0.0027745357,0.000078982725],"about_ca_topic_score_codex":0.0066121067,"about_ca_topic_score_gemma":0.008730153,"teacher_disagreement_score":0.019943882,"about_ca_system_score_codex":0.006302265,"about_ca_system_score_gemma":0.00418858,"threshold_uncertainty_score":0.066718996},"labels":[],"label_agreement":null},{"id":"W2039681975","doi":"10.1145/2591796.2591838","title":"Communication lower bounds via critical block sensitivity","year":2014,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":40,"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":"Computer science; Block (permutation group theory); Sensitivity (control systems); Simplicity; Simple (philosophy); Protocol (science); Upper and lower bounds; Communication complexity; Theoretical computer science; Mathematics; Combinatorics","score_opus":0.01485514328879404,"score_gpt":0.26195787536655696,"score_spread":0.24710273207776293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039681975","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.08208428,0.0021864104,0.8612888,0.0052361954,0.00022206349,0.00039550153,0.0008009189,0.00066312565,0.047122724],"genre_scores_gemma":[0.8913426,0.0017508968,0.08998296,0.0017583513,0.0005067518,0.0018349212,0.00063817756,0.0006342489,0.0115511585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99178654,0.0027237542,0.00030622413,0.0013137864,0.0026066238,0.0012630426],"domain_scores_gemma":[0.92099786,0.06640437,0.0027460416,0.006049138,0.0021488867,0.00165377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049962075,0.001793114,0.0020531113,0.0023399242,0.0021739823,0.0039630965,0.0029977774,0.0025525447,0.012527854],"category_scores_gemma":[0.040809605,0.0009728924,0.00226411,0.0023357435,0.0053608143,0.012835985,0.0068610613,0.0100163035,0.0015753747],"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.00043966615,0.00014599203,0.0014278234,0.00041177118,0.00010179627,0.00023644044,0.0006023025,0.10204935,0.007530709,0.86038357,0.005753141,0.020917533],"study_design_scores_gemma":[0.000058358677,0.000099119046,0.00039393443,0.0000707717,0.000045913795,0.0001193352,0.0000730679,0.2262469,0.003583552,0.76565826,0.0036095146,0.000041263054],"about_ca_topic_score_codex":0.0011613264,"about_ca_topic_score_gemma":0.00082096056,"teacher_disagreement_score":0.012527854,"about_ca_system_score_codex":0.0043510864,"about_ca_system_score_gemma":0.0024366307,"threshold_uncertainty_score":0.041909873},"labels":[],"label_agreement":null},{"id":"W2042361512","doi":"10.1145/1940475.1940488","title":"Optimization techniques for small matrix multiplication","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Complexity and Algorithms in Graphs","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":"Western University","funders":"","keywords":"Strassen algorithm; Multiplication (music); Matrix multiplication; Mathematics; Multiplication algorithm; Base (topology); Matrix (chemical analysis); Code (set theory); Differential (mechanical device); Computer science; Arithmetic; Algebra over a field; Algorithm; Combinatorics; Pure mathematics","score_opus":0.09747031034217751,"score_gpt":0.3175422735804849,"score_spread":0.2200719632383074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042361512","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.029201796,0.0009524521,0.9450979,0.00045452555,0.00015617583,0.00015147826,0.000273046,0.0031397322,0.020572731],"genre_scores_gemma":[0.21946086,0.00059897796,0.7710738,0.00020459954,0.00012441786,0.00028284107,0.00048267285,0.0011647824,0.0066069956],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987943,0.0002731032,0.000066967674,0.00015017802,0.0005044326,0.00021096534],"domain_scores_gemma":[0.99708694,0.0015411814,0.0002500895,0.0005417674,0.0005028221,0.000077259625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012147282,0.0011826217,0.00066381943,0.0011932674,0.00059838354,0.0010640809,0.0013380221,0.00060735364,0.019866025],"category_scores_gemma":[0.007314457,0.00032115536,0.00069068203,0.001744648,0.00064669095,0.002277997,0.00094361964,0.0015845839,0.0036759826],"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.0005094254,0.00034546078,0.0013391597,0.0005288116,0.00006669225,0.00011678776,0.00012883412,0.37798962,0.015296039,0.08405189,0.02103666,0.49859065],"study_design_scores_gemma":[0.00012308899,0.00027882683,0.0005713456,0.000057946672,0.000050408402,0.00016927128,0.00006340183,0.8819818,0.019800788,0.07707047,0.019792588,0.000040149625],"about_ca_topic_score_codex":0.0018347837,"about_ca_topic_score_gemma":0.0035277824,"teacher_disagreement_score":0.019866025,"about_ca_system_score_codex":0.00085919816,"about_ca_system_score_gemma":0.0016553932,"threshold_uncertainty_score":0.06645846},"labels":[],"label_agreement":null},{"id":"W2042788891","doi":"10.1016/j.orl.2010.09.004","title":"Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound","year":2010,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Steiner tree problem; Linear programming relaxation; Hypergraph; Mathematics; Upper and lower bounds; Combinatorics; Bounded function; Relaxation (psychology); Linear programming; Tree (set theory); Approximation algorithm; Discrete mathematics; Algorithm; Mathematical analysis","score_opus":0.06305174887661538,"score_gpt":0.33851725168657865,"score_spread":0.2754655028099633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042788891","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.073907964,0.032731414,0.53445655,0.04021977,0.006077147,0.0003572938,0.0023379154,0.0013528068,0.3085592],"genre_scores_gemma":[0.669572,0.0324809,0.20364946,0.014706049,0.014048659,0.0018496845,0.0025610551,0.0034010606,0.057731155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951138,0.0010082999,0.00020934413,0.0012089788,0.0012083149,0.0012512658],"domain_scores_gemma":[0.97713864,0.01743046,0.0009420301,0.0015978311,0.0014281436,0.001462981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061210115,0.0049881237,0.003982459,0.004509189,0.0037948575,0.009028651,0.006590199,0.0049585337,0.029599205],"category_scores_gemma":[0.03240124,0.002810975,0.0061057922,0.0070353467,0.0070935427,0.024437658,0.01268909,0.027194418,0.004894295],"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.00050930714,0.0003359972,0.0008332932,0.0013898218,0.0001415593,0.0003442807,0.0010051915,0.020885505,0.00500327,0.87792975,0.036802385,0.054819684],"study_design_scores_gemma":[0.00004717759,0.00008598174,0.00065121124,0.0002641452,0.00015240852,0.00024832776,0.00018215738,0.032632895,0.0021535968,0.9499666,0.013544478,0.000071006914],"about_ca_topic_score_codex":0.002166858,"about_ca_topic_score_gemma":0.0017440327,"teacher_disagreement_score":0.029599205,"about_ca_system_score_codex":0.006420056,"about_ca_system_score_gemma":0.0030180581,"threshold_uncertainty_score":0.09901923},"labels":[],"label_agreement":null},{"id":"W2046371296","doi":"10.1023/a:1014895808844","title":"Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","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":"Mathematics; Combinatorics; Relaxation (psychology); Polytope; Theory of computation; Rank (graph theory); Matrix (chemical analysis); Dimension (graph theory); Semidefinite programming; Projection (relational algebra); Discrete mathematics; Algorithm; Mathematical optimization","score_opus":0.015041707881023478,"score_gpt":0.2364874729956339,"score_spread":0.22144576511461045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046371296","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.1762666,0.0011760913,0.69184166,0.0041228877,0.00028943198,0.00026375562,0.0014796668,0.00079123926,0.123768725],"genre_scores_gemma":[0.8172467,0.0016249773,0.119766586,0.0012957691,0.00080040883,0.00058221014,0.0018599494,0.0008057919,0.05601757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982444,0.0006452551,0.00006045967,0.00027369254,0.00051746465,0.00025878262],"domain_scores_gemma":[0.99543625,0.0024670842,0.0007574514,0.00033399244,0.00048229215,0.00052296754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021815877,0.0015216208,0.0016847478,0.0017729669,0.001562211,0.0056099645,0.0030233876,0.0019781308,0.015209977],"category_scores_gemma":[0.009349895,0.0012439478,0.0011347407,0.0016291947,0.0028349215,0.0058985404,0.0029556043,0.0057639894,0.0021047476],"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.00007392558,0.0000456391,0.000072095354,0.00006325114,0.000010964524,0.000039465493,0.00013090725,0.020301957,0.0005367806,0.9684844,0.0047859713,0.005454659],"study_design_scores_gemma":[0.00003585059,0.000034604822,0.00010176966,0.000016512633,0.000007873738,0.00006179121,0.00006534861,0.06889521,0.00032994983,0.92832005,0.0021133518,0.000017721519],"about_ca_topic_score_codex":0.0012428263,"about_ca_topic_score_gemma":0.0010908045,"teacher_disagreement_score":0.015209977,"about_ca_system_score_codex":0.0021976305,"about_ca_system_score_gemma":0.001121075,"threshold_uncertainty_score":0.0508824},"labels":[],"label_agreement":null},{"id":"W2047406446","doi":"10.1016/j.tcs.2012.02.017","title":"On derandomization and average-case complexity of monotone functions","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"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":"Natural Sciences and Engineering Research Council of Canada; Indiana State University; Cisco Systems; National Science Foundation","keywords":"Mathematics; Monotone polygon; Combinatorics; Discrete mathematics; Algorithm; Geometry","score_opus":0.02453344038941696,"score_gpt":0.25747873425363593,"score_spread":0.23294529386421897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047406446","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.38977292,0.0063444865,0.5354517,0.016579049,0.00044025542,0.00034416694,0.0017572253,0.0014498663,0.047860358],"genre_scores_gemma":[0.9334828,0.0027758814,0.04887338,0.0013833481,0.0014264507,0.000551473,0.0015431878,0.0010555097,0.008907945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9797748,0.008951357,0.00095707225,0.0033342976,0.0034395556,0.0035429578],"domain_scores_gemma":[0.70717794,0.25074363,0.008191988,0.021678174,0.006542905,0.0056653237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020373339,0.0026377612,0.005218425,0.004757938,0.004038954,0.010556489,0.009947073,0.0051495517,0.0133445775],"category_scores_gemma":[0.14846912,0.0019158333,0.0040980433,0.0057286737,0.010114549,0.038605932,0.007917012,0.012480358,0.0015325878],"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.0018188279,0.0006382757,0.0076414472,0.0005209293,0.00031014445,0.00025588725,0.0010277388,0.18893214,0.0032597354,0.7442989,0.011276549,0.040019494],"study_design_scores_gemma":[0.000115794996,0.00010579746,0.0010043851,0.00005415523,0.00009778994,0.000182486,0.00013225402,0.27814546,0.0011799532,0.71758544,0.0013346315,0.000061815845],"about_ca_topic_score_codex":0.0032889643,"about_ca_topic_score_gemma":0.0031325761,"teacher_disagreement_score":0.020373339,"about_ca_system_score_codex":0.009930997,"about_ca_system_score_gemma":0.006340024,"threshold_uncertainty_score":0.107745826},"labels":[],"label_agreement":null},{"id":"W2051229026","doi":"10.1016/j.orl.2013.04.011","title":"Network design with a discrete set of traffic matrices","year":2013,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","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":"National Science Foundation","keywords":"Variety (cybernetics); Set (abstract data type); Scheme (mathematics); Time complexity; Computer science; Approximation algorithm; Network planning and design; Computational complexity theory; Polynomial; Mathematical optimization; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence; Computer network","score_opus":0.07737951602445946,"score_gpt":0.3222089761203714,"score_spread":0.24482946009591194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051229026","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.05736671,0.0001710423,0.93186224,0.0009068028,0.00014674613,0.00008380758,0.00022173945,0.00015254543,0.009088395],"genre_scores_gemma":[0.8584936,0.00036573256,0.13360098,0.00021253328,0.00018541071,0.00017197571,0.00013995095,0.000040924006,0.006788834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982475,0.00070541404,0.000058164365,0.00033668848,0.00046444533,0.0001878226],"domain_scores_gemma":[0.996287,0.0019417815,0.00044550435,0.0005013275,0.00051389344,0.00031055158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012964193,0.0008606464,0.0009396681,0.0009903508,0.0006032285,0.0024316565,0.0020694477,0.0014831066,0.0026931008],"category_scores_gemma":[0.0056565255,0.00071980525,0.0006646395,0.0010619259,0.0010938889,0.0022245338,0.0012626708,0.0016881716,0.0004579825],"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.00016756878,0.000115763505,0.00041510627,0.0001013346,0.00005315752,0.00013108933,0.000053856547,0.698648,0.004857791,0.2761223,0.0017596355,0.017574472],"study_design_scores_gemma":[0.000029041988,0.000030498326,0.000052806707,0.000005990455,0.000010403683,0.00003758072,0.000008588971,0.94345856,0.0006054134,0.055223495,0.0005285619,0.000009116044],"about_ca_topic_score_codex":0.0012662864,"about_ca_topic_score_gemma":0.0015919708,"teacher_disagreement_score":0.0026931008,"about_ca_system_score_codex":0.0018242456,"about_ca_system_score_gemma":0.0011240939,"threshold_uncertainty_score":0.013235867},"labels":[],"label_agreement":null},{"id":"W2053637543","doi":"10.1145/2608628.2608673","title":"Linear independence oracles and applications to rectangular and low rank linear systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Rank (graph theory); Row and column spaces; Row; Randomized algorithm; Mathematics; Combinatorics; Matrix (chemical analysis); Solver; Field (mathematics); Algorithm; Discrete mathematics; Computer science; Mathematical optimization","score_opus":0.015951318851620745,"score_gpt":0.25495673060099533,"score_spread":0.2390054117493746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053637543","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.014389584,0.00063169206,0.9728578,0.0023689582,0.00012117435,0.00014085052,0.00037470445,0.0017188792,0.007396485],"genre_scores_gemma":[0.53983355,0.001041257,0.44297287,0.0010557196,0.0007222574,0.00081978337,0.0012200503,0.0006200449,0.011714528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99344206,0.003023684,0.00030158236,0.0010410607,0.001350413,0.0008411046],"domain_scores_gemma":[0.969384,0.024494907,0.0017350425,0.0025098454,0.0011457115,0.00073059136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060348148,0.001512229,0.0017468226,0.0013599615,0.0012293521,0.00250951,0.0027188421,0.0016909417,0.013940142],"category_scores_gemma":[0.032489218,0.0010976571,0.0014767197,0.002868555,0.0037470185,0.005707217,0.0041448083,0.0068426887,0.0022131735],"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.0007946939,0.00032971168,0.0017184381,0.0003337037,0.00007266012,0.00018018213,0.0002325948,0.35932192,0.0017309539,0.5359442,0.012231517,0.08710937],"study_design_scores_gemma":[0.00012171969,0.00006249152,0.00020876167,0.000028486986,0.000014678044,0.000040667226,0.00003090859,0.6968649,0.001139235,0.29934663,0.0021139348,0.000027668602],"about_ca_topic_score_codex":0.003538335,"about_ca_topic_score_gemma":0.0042128167,"teacher_disagreement_score":0.013940142,"about_ca_system_score_codex":0.0025061534,"about_ca_system_score_gemma":0.0026895402,"threshold_uncertainty_score":0.046634495},"labels":[],"label_agreement":null},{"id":"W2053658780","doi":"10.1007/s00037-015-0100-0","title":"Mining Circuit Lower Bound Proofs for Meta-Algorithms","year":2015,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","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":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Mathematical proof; Algorithm; Truth table; Computer science; Upper and lower bounds; Boolean function; Circuit minimization for Boolean functions; Discrete mathematics; Boolean circuit; Mathematics","score_opus":0.30987741822452286,"score_gpt":0.34170317087719915,"score_spread":0.03182575265267629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053658780","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.12458758,0.0063523953,0.81976575,0.008852283,0.0007002945,0.0005644888,0.0073863217,0.00474646,0.02704436],"genre_scores_gemma":[0.66498965,0.0035706828,0.30443588,0.0023062704,0.0012534694,0.0005324611,0.012643577,0.001747701,0.008520328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922551,0.0022975777,0.00053519127,0.001452131,0.002792417,0.0006675972],"domain_scores_gemma":[0.9039083,0.07729338,0.0036792574,0.009201215,0.0048388345,0.0010789855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004082973,0.0016314386,0.0018210948,0.004873542,0.0018947598,0.0073003545,0.0051273713,0.0026216889,0.016273338],"category_scores_gemma":[0.07500808,0.0020086344,0.0031727143,0.005114804,0.002072475,0.014419614,0.0031413813,0.0058611413,0.0033190125],"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.0010520534,0.00087022467,0.014435532,0.0038407864,0.0009811501,0.00081026024,0.0006399944,0.09362995,0.007650958,0.42299822,0.07539633,0.3776946],"study_design_scores_gemma":[0.00014981734,0.00011319887,0.0012055434,0.00034463228,0.00035091463,0.00044448205,0.0001514696,0.17173496,0.005983819,0.80536264,0.0141103575,0.000048199392],"about_ca_topic_score_codex":0.00082802156,"about_ca_topic_score_gemma":0.0020894064,"teacher_disagreement_score":0.016273338,"about_ca_system_score_codex":0.0024675897,"about_ca_system_score_gemma":0.0037669935,"threshold_uncertainty_score":0.054439783},"labels":[],"label_agreement":null},{"id":"W2054116841","doi":"10.2298/yjor1101011d","title":"On-line computation and maximum-weighted hereditary subgraph problems","year":2011,"lang":"en","type":"article","venue":"Yugoslav journal of operations research","topic":"Complexity and Algorithms in Graphs","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 Montréal","funders":"","keywords":"Combinatorics; Induced subgraph isomorphism problem; Computation; Line (geometry); Focus (optics); Mathematics; Graph; Subgraph isomorphism problem; Set (abstract data type); Computer science; Algorithm; Line graph; Physics","score_opus":0.1693381571729664,"score_gpt":0.3650028625847389,"score_spread":0.1956647054117725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054116841","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.24487244,0.00067256147,0.7271088,0.0025661204,0.00011012506,0.00037528906,0.0007787391,0.0010950784,0.022420902],"genre_scores_gemma":[0.73235154,0.0006102792,0.25318575,0.0004599798,0.000259706,0.0003617778,0.0017668498,0.0004315131,0.010572491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99587435,0.0020067801,0.000116969255,0.0007585418,0.00058294274,0.00066045293],"domain_scores_gemma":[0.9878808,0.007718988,0.0013033443,0.0020853614,0.00047699452,0.00053450436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023072853,0.0013573859,0.0015197139,0.0008274679,0.0012557231,0.003011135,0.0045005903,0.0025114527,0.0117433835],"category_scores_gemma":[0.011480701,0.000680979,0.0009853115,0.0026693565,0.0018789896,0.008384179,0.0023968755,0.0018704107,0.0010979243],"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.0011002264,0.0010104702,0.0029608002,0.0005180535,0.00021534723,0.00056919997,0.00037832226,0.58737177,0.004144821,0.28526548,0.016930692,0.09953485],"study_design_scores_gemma":[0.00009078386,0.000112404035,0.00032299737,0.000018560688,0.000023385235,0.00015027271,0.00013262735,0.81895334,0.0022977542,0.17511235,0.002768663,0.00001690031],"about_ca_topic_score_codex":0.0019870545,"about_ca_topic_score_gemma":0.00270094,"teacher_disagreement_score":0.0117433835,"about_ca_system_score_codex":0.0021730587,"about_ca_system_score_gemma":0.0013823385,"threshold_uncertainty_score":0.0392856},"labels":[],"label_agreement":null},{"id":"W2055000959","doi":"10.1145/1435375.1435381","title":"Distributed weighted vertex cover via maximal matchings","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"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":"Vertex cover; Combinatorics; Mathematics; Vertex (graph theory); Feedback vertex set; Edge cover; Binary logarithm; Upper and lower bounds; Undirected graph; Matching (statistics); Minimum weight; Cover (algebra); Graph; Discrete mathematics","score_opus":0.023679275711912053,"score_gpt":0.2385259495041349,"score_spread":0.21484667379222283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055000959","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.10373398,0.00038465552,0.8891002,0.00035801373,0.00005455487,0.00017268873,0.00021195748,0.0010476684,0.004936191],"genre_scores_gemma":[0.7290297,0.00022735781,0.2661659,0.00012547811,0.00006230323,0.00026724255,0.0005093416,0.0001412401,0.003471421],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998401,0.0003747191,0.000072375144,0.00045183592,0.00042240112,0.00027772103],"domain_scores_gemma":[0.9981945,0.00092966424,0.00017215108,0.00044293483,0.00014144187,0.00011919327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011857072,0.0006925328,0.0013580596,0.0009243283,0.0010650809,0.0012931414,0.002200465,0.0009552799,0.0033384995],"category_scores_gemma":[0.0054243905,0.0004634,0.00074632943,0.0018618061,0.0009795121,0.0043924884,0.0031149979,0.0007794916,0.000583633],"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.00124651,0.0002455767,0.0016347059,0.0003610749,0.00016227883,0.00026965345,0.0002919,0.63105905,0.019028224,0.10539531,0.0046225367,0.2356832],"study_design_scores_gemma":[0.000070803435,0.00008458221,0.00019890313,0.000013673455,0.000024661374,0.00010598722,0.00004462371,0.87767684,0.0059380517,0.11362888,0.0021996559,0.000013343533],"about_ca_topic_score_codex":0.0014177355,"about_ca_topic_score_gemma":0.0019137893,"teacher_disagreement_score":0.0033384995,"about_ca_system_score_codex":0.0013541223,"about_ca_system_score_gemma":0.0010426065,"threshold_uncertainty_score":0.011168361},"labels":[],"label_agreement":null},{"id":"W2057952251","doi":"10.1109/focs.2014.20","title":"Circuit Complexity, Proof Complexity, and Polynomial Identity Testing","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"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; Santa Fe Institute; National Science Foundation","keywords":"Proof complexity; Mathematics; Discrete mathematics; Mathematical proof; Polynomial; Upper and lower bounds; Algebraic number; Proof theory; Complexity class; Combinatorics; Identity (music); Boolean circuit; Conjecture; Time complexity; Boolean function","score_opus":0.1470915544222957,"score_gpt":0.3050535386634883,"score_spread":0.15796198424119257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057952251","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.061632413,0.0009348926,0.8812504,0.0064676283,0.00016409528,0.0001392122,0.00042127122,0.0006291189,0.048361093],"genre_scores_gemma":[0.78056484,0.0010008174,0.20807645,0.0009961795,0.0005026663,0.00025059716,0.00047967792,0.00023721471,0.007891571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99534214,0.0011979907,0.00026857527,0.0008596081,0.0016884729,0.00064314535],"domain_scores_gemma":[0.97430044,0.01771804,0.0021020044,0.0033493745,0.001821911,0.00070832623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028613163,0.0006672315,0.0006567542,0.002477464,0.0016949397,0.0051749605,0.0025642859,0.0013181022,0.006506254],"category_scores_gemma":[0.019953148,0.0004781368,0.0013495531,0.002051466,0.0067181922,0.012654597,0.0041490365,0.006130728,0.0007220089],"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.000011567998,0.000015760137,0.00028424265,0.00003567271,0.000005478095,0.000020746638,0.00007249766,0.0024997569,0.0006827424,0.990239,0.00071743544,0.0054149884],"study_design_scores_gemma":[0.000009063709,0.0000222065,0.0003310061,0.000014476418,0.000012546913,0.00008393708,0.000034281027,0.02171924,0.0018025578,0.97091854,0.005034004,0.000018072931],"about_ca_topic_score_codex":0.0024775441,"about_ca_topic_score_gemma":0.0024405874,"teacher_disagreement_score":0.006506254,"about_ca_system_score_codex":0.004802014,"about_ca_system_score_gemma":0.0020209122,"threshold_uncertainty_score":0.03484124},"labels":[],"label_agreement":null},{"id":"W2059154872","doi":"10.1007/s004930170005","title":"Critical Facets of the Stable Set Polytope","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Polytope; Critical graph; Birkhoff polytope; Graph; Facet (psychology); Discrete mathematics; Line graph; Voltage graph; Geometry; Convex set","score_opus":0.028981905935811323,"score_gpt":0.27306865573500755,"score_spread":0.24408674979919623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059154872","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.57007176,0.0014175422,0.21378265,0.002404601,0.00015060524,0.00016291422,0.0017008851,0.0002949256,0.21001409],"genre_scores_gemma":[0.9524209,0.0009324778,0.021025524,0.00016372761,0.00017872575,0.00016051842,0.0014660144,0.00013224363,0.023519823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994893,0.000080273225,0.000021640053,0.000087679255,0.00021228046,0.0001086538],"domain_scores_gemma":[0.9984212,0.00086291914,0.00014729217,0.00013713176,0.00017244589,0.00025899662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004329275,0.00049750553,0.0010463757,0.001888324,0.002097095,0.005650888,0.0010094527,0.0009127172,0.014238566],"category_scores_gemma":[0.0025622146,0.0006403786,0.00079992006,0.0017275648,0.002901568,0.0038838768,0.00176256,0.0025221691,0.0010971272],"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.00006205367,0.000020563855,0.00044583462,0.000048793416,0.000012193318,0.00006482919,0.00016912713,0.0044869934,0.00079200295,0.9864668,0.0025087746,0.004921953],"study_design_scores_gemma":[0.000025045218,0.000010237489,0.00039416566,0.000017539978,0.000008906928,0.00007802117,0.00015497209,0.014478766,0.0006552458,0.98064154,0.0035258878,0.000009635251],"about_ca_topic_score_codex":0.003247789,"about_ca_topic_score_gemma":0.0026750828,"teacher_disagreement_score":0.014238566,"about_ca_system_score_codex":0.0018023794,"about_ca_system_score_gemma":0.00080619275,"threshold_uncertainty_score":0.047632754},"labels":[],"label_agreement":null},{"id":"W2060309802","doi":"10.5555/338219.338663","title":"Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks","year":2000,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Unimodular matrix; Linear programming; Oracle; Convergence (economics); Polynomial; Time complexity; Mathematics; Construct (python library); Algorithm; Computer science; Mathematical optimization; Discrete mathematics","score_opus":0.029279266353768554,"score_gpt":0.2800338732180439,"score_spread":0.25075460686427536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060309802","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.10704677,0.00048487986,0.8674048,0.0023793762,0.00006286704,0.00014800034,0.00032572082,0.001716812,0.02043077],"genre_scores_gemma":[0.5710883,0.00056021404,0.41154182,0.0006076886,0.0001463389,0.00030275658,0.0010446791,0.000767115,0.013941025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997696,0.00060740334,0.000114047725,0.0005731698,0.0006183345,0.0003910617],"domain_scores_gemma":[0.9905166,0.0066318368,0.0005259196,0.0015539418,0.0005224453,0.00024919538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021059858,0.0010298986,0.0009997427,0.0005484897,0.0007944491,0.002454954,0.0022657446,0.001072532,0.008924963],"category_scores_gemma":[0.011477542,0.00044490193,0.0011322168,0.0012237226,0.0017133688,0.007948207,0.0022027798,0.0036344393,0.0013189776],"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.0013174872,0.00035474743,0.0033112122,0.00078660896,0.00010043808,0.00017494474,0.00048021975,0.14900145,0.016713835,0.48451138,0.011062331,0.33218533],"study_design_scores_gemma":[0.0001279686,0.00023601009,0.0007356778,0.000043969496,0.000051242456,0.00028329383,0.00010158856,0.51838195,0.012841648,0.45829248,0.008870689,0.000033546003],"about_ca_topic_score_codex":0.0015650525,"about_ca_topic_score_gemma":0.0021381064,"teacher_disagreement_score":0.008924963,"about_ca_system_score_codex":0.0016433054,"about_ca_system_score_gemma":0.0012810742,"threshold_uncertainty_score":0.02985698},"labels":[],"label_agreement":null},{"id":"W2060363698","doi":"10.1145/1290672.1290685","title":"Approximation algorithms and hardness results for cycle packing problems","year":2007,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","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; University of Alberta","funders":"","keywords":"Approximation algorithm; Combinatorics; Disjoint sets; Mathematics; Upper and lower bounds; Packing problems; Undirected graph; Binary logarithm; Log-log plot; Discrete mathematics; Graph; Algorithm","score_opus":0.041048612578643416,"score_gpt":0.285998406091064,"score_spread":0.24494979351242055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060363698","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.08015478,0.0066114147,0.86532354,0.0062851994,0.00029832227,0.00037616264,0.0019054769,0.002001995,0.037043214],"genre_scores_gemma":[0.5172083,0.007711952,0.44884884,0.0021055895,0.0012559096,0.001259088,0.0059265136,0.0013499518,0.014333881],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99392265,0.0014140268,0.00036479553,0.001490507,0.0017042063,0.0011037971],"domain_scores_gemma":[0.97927815,0.015602867,0.0012592557,0.0023885902,0.0008428048,0.0006283082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035309067,0.003368443,0.0026945933,0.003218844,0.002442701,0.007959092,0.006354414,0.004331031,0.010346232],"category_scores_gemma":[0.026895927,0.00194058,0.0039794436,0.007157277,0.003515933,0.012510637,0.004355549,0.008243607,0.0018675943],"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.0011427205,0.00088469323,0.0033366806,0.0014624737,0.000347228,0.0002965914,0.00096590206,0.5053006,0.004554944,0.3311287,0.026967254,0.1236123],"study_design_scores_gemma":[0.00014729224,0.00007223445,0.0005489192,0.00012145383,0.00008386674,0.00023916489,0.00016387911,0.6395373,0.0017194098,0.3505262,0.0068054427,0.000034827117],"about_ca_topic_score_codex":0.0039715245,"about_ca_topic_score_gemma":0.0026120353,"teacher_disagreement_score":0.010346232,"about_ca_system_score_codex":0.006079181,"about_ca_system_score_gemma":0.0024790636,"threshold_uncertainty_score":0.044107735},"labels":[],"label_agreement":null},{"id":"W2062135503","doi":"10.1145/2528405","title":"Lower bounds for local approximation","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"Helsingin Yliopiston Tiedesäätiö; Suomen Kulttuurirahasto; Academy of Finland","keywords":"Mathematics; Combinatorics; Approximation algorithm; Dominating set; Upper and lower bounds; Discrete mathematics; Numbering; Bounded function; Independent set; Vertex (graph theory); Graph; Algorithm","score_opus":0.02291329635721146,"score_gpt":0.2504942880361266,"score_spread":0.22758099167891516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062135503","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.032780323,0.0054467185,0.91966134,0.0043155686,0.00041260401,0.0002687158,0.00076012046,0.0030857862,0.03326886],"genre_scores_gemma":[0.64228594,0.0041619646,0.32759663,0.002750118,0.0013441176,0.0016850949,0.0021088049,0.003251741,0.014815642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98282695,0.0040107304,0.0009972241,0.0047281915,0.0045395377,0.0028974263],"domain_scores_gemma":[0.93694025,0.04133091,0.0025961648,0.014046839,0.0033180446,0.0017678273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0096310135,0.003753762,0.0046548937,0.0028202853,0.0032803565,0.007433627,0.0079622585,0.0044305567,0.016560297],"category_scores_gemma":[0.060494915,0.0013180012,0.0049738325,0.004655046,0.0050193924,0.019695304,0.0097666,0.012307862,0.0053992667],"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.0022598798,0.0006660101,0.0059082196,0.0020964984,0.0005190447,0.00040136426,0.0013485495,0.37316316,0.011422246,0.4381051,0.020525375,0.14358467],"study_design_scores_gemma":[0.00013752504,0.00033465738,0.0007394127,0.00023063837,0.00023160444,0.00041322288,0.00021559639,0.71719474,0.0060069417,0.26296052,0.011465947,0.000069197056],"about_ca_topic_score_codex":0.001881217,"about_ca_topic_score_gemma":0.0022192239,"teacher_disagreement_score":0.016560297,"about_ca_system_score_codex":0.0069364375,"about_ca_system_score_gemma":0.00349001,"threshold_uncertainty_score":0.055399656},"labels":[],"label_agreement":null},{"id":"W2063494850","doi":"10.1016/j.ipl.2010.05.011","title":"Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs","year":2010,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Combinatorics; Bipartite graph; Mathematics; Indifference graph; Maximal independent set; Interval graph; Permutation graph; Pathwidth; Induced subgraph isomorphism problem; Cograph; Discrete mathematics; Clique-sum; Split graph; Algorithm; 1-planar graph; Line graph; Graph; Voltage graph","score_opus":0.023393805936179624,"score_gpt":0.25343921096351546,"score_spread":0.23004540502733584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063494850","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.10449098,0.001988691,0.8748285,0.002321189,0.00017353099,0.0002734612,0.0012051212,0.0026829694,0.012035466],"genre_scores_gemma":[0.5511084,0.0012530219,0.43619716,0.0004978922,0.00029250752,0.00037011006,0.0031970378,0.0007900426,0.006293855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974401,0.0007311097,0.0001145438,0.00074067403,0.00046007003,0.00051355653],"domain_scores_gemma":[0.9906397,0.0060075065,0.0006720188,0.0018022967,0.00045604893,0.00042235592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023734865,0.0022873047,0.0029673595,0.00198215,0.0013006632,0.003670892,0.005413797,0.0026009318,0.010648029],"category_scores_gemma":[0.014412012,0.0010623701,0.0017141715,0.0057076663,0.0018935555,0.010579954,0.0027155096,0.0036461812,0.0017828837],"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.002605297,0.0010923977,0.0031442693,0.0008670263,0.00028092443,0.0002330865,0.0007225612,0.5615088,0.004436537,0.14768992,0.03292501,0.2444941],"study_design_scores_gemma":[0.00022297644,0.00009898426,0.00040831306,0.000028081779,0.00005795044,0.000105323394,0.0001344872,0.8357042,0.0010050872,0.16032219,0.001890753,0.0000217491],"about_ca_topic_score_codex":0.008779399,"about_ca_topic_score_gemma":0.010314319,"teacher_disagreement_score":0.010648029,"about_ca_system_score_codex":0.0036907448,"about_ca_system_score_gemma":0.0027649545,"threshold_uncertainty_score":0.035621226},"labels":[],"label_agreement":null},{"id":"W2063687001","doi":"10.1007/s10878-012-9526-3","title":"Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"","keywords":"Approximation algorithm; Disjoint sets; Mathematics; Convexity; Theory of computation; Combinatorics; Function (biology); Range (aeronautics); Relaxation (psychology); Algorithm; Discrete mathematics","score_opus":0.02017153551588397,"score_gpt":0.25076873655230497,"score_spread":0.230597201036421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063687001","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.03737251,0.0016983316,0.94417524,0.0015176714,0.00023552826,0.00033035834,0.0010284862,0.002103504,0.011538278],"genre_scores_gemma":[0.18065464,0.0009278738,0.80350715,0.00049897,0.00032549747,0.00053650746,0.0031154903,0.00094650214,0.009487339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654406,0.0011515719,0.0002049748,0.00074948644,0.0007845709,0.00056535314],"domain_scores_gemma":[0.9887455,0.0072465483,0.00076785,0.0018635326,0.0007832446,0.0005932749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050554005,0.0033136304,0.0049960753,0.004048035,0.0022631139,0.005944123,0.009418166,0.004816376,0.020902496],"category_scores_gemma":[0.020736394,0.002387791,0.0033990475,0.008623237,0.0021027874,0.01426122,0.0057462896,0.0064238007,0.003122985],"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.0012128972,0.00088528346,0.0019222732,0.0006496259,0.00021645866,0.00012376944,0.0004455543,0.5756463,0.001672986,0.14328933,0.026060283,0.2478752],"study_design_scores_gemma":[0.00011382801,0.00006193362,0.0002639772,0.000031203686,0.000048040318,0.000057430472,0.00006800891,0.9013087,0.00055018,0.095145285,0.0023271171,0.000024203136],"about_ca_topic_score_codex":0.009274373,"about_ca_topic_score_gemma":0.015849577,"teacher_disagreement_score":0.020902496,"about_ca_system_score_codex":0.0054351185,"about_ca_system_score_gemma":0.005617274,"threshold_uncertainty_score":0.069925785},"labels":[],"label_agreement":null},{"id":"W2063991224","doi":"10.1016/s0304-3975(01)00152-9","title":"Lower bounds for invariant queries in logics with counting","year":2002,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Preorder; Unary operation; Locality; Transitive closure; Mathematics; Discrete mathematics; Complexity class; Expressive power; First-order logic; Binary relation; Transitive relation; Second-order logic; Succinctness; Invariant (physics); Proof theory; Combinatorics; Time complexity; Higher-order logic; Computer science; Mathematical proof; Theoretical computer science; Description logic","score_opus":0.022308949309105132,"score_gpt":0.23628980476978478,"score_spread":0.21398085546067966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063991224","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.08792121,0.010151862,0.7637694,0.03828401,0.0014996099,0.0008676043,0.004355214,0.0069207083,0.08623037],"genre_scores_gemma":[0.71040195,0.007124416,0.21769565,0.0126434835,0.007378161,0.0019803497,0.008350865,0.0073119276,0.02711325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.93068725,0.01777509,0.0038920606,0.010031134,0.022231974,0.01538245],"domain_scores_gemma":[0.57469785,0.3710812,0.00829072,0.025038641,0.010490697,0.010400945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03695344,0.006875473,0.0106745,0.015188629,0.0094334725,0.03565769,0.022810888,0.011151626,0.037248965],"category_scores_gemma":[0.19861214,0.0060212836,0.009559476,0.019220905,0.017259471,0.09404856,0.022729935,0.031895306,0.005980928],"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.003483757,0.0013125732,0.004732781,0.0015324315,0.0005090221,0.00030813395,0.0016917324,0.059736315,0.0032655073,0.8157648,0.033326454,0.07433649],"study_design_scores_gemma":[0.00019199331,0.00009780898,0.00043915617,0.00015678455,0.00035927104,0.00016030128,0.00022208536,0.1356379,0.0018437336,0.85785025,0.002942232,0.00009850121],"about_ca_topic_score_codex":0.0064356746,"about_ca_topic_score_gemma":0.009827159,"teacher_disagreement_score":0.037248965,"about_ca_system_score_codex":0.025024887,"about_ca_system_score_gemma":0.012108693,"threshold_uncertainty_score":0.19543076},"labels":[],"label_agreement":null},{"id":"W2066144963","doi":"10.1090/s0894-0347-2011-00694-2","title":"Non-commutative circuits and the sum-of-squares problem","year":2011,"lang":"en","type":"article","venue":"Journal of the American Mathematical Society","topic":"Complexity and Algorithms in Graphs","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":"University of Calgary","funders":"National Science Foundation","keywords":"Mathematics; Parenthesis; Algorithm; Commutative property; Statistics; Discrete mathematics; Linguistics; Philosophy","score_opus":0.027813818679021912,"score_gpt":0.2585632479588518,"score_spread":0.23074942927982992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066144963","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.13183485,0.004272549,0.76279104,0.012957382,0.0009141282,0.0002783137,0.0023474346,0.0022646887,0.08233968],"genre_scores_gemma":[0.66794425,0.0030530284,0.2758313,0.0038688474,0.001737185,0.00068202004,0.0034721754,0.0018612852,0.041549835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943342,0.0013729683,0.0002891979,0.0016378583,0.0016892181,0.0006765367],"domain_scores_gemma":[0.9540916,0.03812356,0.0015211691,0.0033710336,0.0019214661,0.000971267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00422731,0.0017916246,0.0017913242,0.0013916913,0.0017231241,0.005187687,0.0041676788,0.0017693528,0.024934145],"category_scores_gemma":[0.028505415,0.0010086654,0.0028792447,0.0019759724,0.004244952,0.021535298,0.005459327,0.007492333,0.003346679],"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.00052236527,0.00013960867,0.001229242,0.0007995988,0.000120247045,0.00020731323,0.00041505753,0.020032186,0.004552109,0.9089919,0.012898419,0.050092015],"study_design_scores_gemma":[0.000044794724,0.000045917786,0.00022502958,0.000031179803,0.00004062155,0.000085974585,0.000058650545,0.029783566,0.0031675568,0.9621218,0.004374089,0.000020795416],"about_ca_topic_score_codex":0.0017494556,"about_ca_topic_score_gemma":0.0020518894,"teacher_disagreement_score":0.024934145,"about_ca_system_score_codex":0.0030977332,"about_ca_system_score_gemma":0.0020434929,"threshold_uncertainty_score":0.083413005},"labels":[],"label_agreement":null},{"id":"W2066938865","doi":"10.1007/s00037-001-8191-1","title":"Reducing the complexity of reductions","year":2001,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"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":"Mathematics; Gap theorem; Isomorphism (crystallography); Discrete mathematics; Combinatorics; Invertible matrix; Complexity class; Conjecture; Time complexity; Pure mathematics; Fundamental theorem; Crystallography; Crystal structure","score_opus":0.12454342522397675,"score_gpt":0.3089948682333011,"score_spread":0.1844514430093243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066938865","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.08263636,0.0021690167,0.74206346,0.01144494,0.0011124864,0.0003648598,0.00097219285,0.004191151,0.15504557],"genre_scores_gemma":[0.6265251,0.002608907,0.3157018,0.0026550402,0.0016554305,0.0006102887,0.0024188762,0.0028667997,0.04495769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944121,0.0013398513,0.00021452745,0.0010213344,0.0021520942,0.00085994776],"domain_scores_gemma":[0.9806095,0.011255561,0.00038349684,0.005844169,0.0015428776,0.0003643143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002218084,0.0016145678,0.0016296151,0.0022222437,0.0024817714,0.0051974216,0.0037167473,0.0019372478,0.017202286],"category_scores_gemma":[0.019457612,0.0009288671,0.003957354,0.0022858342,0.0035301584,0.012158574,0.006537159,0.007417475,0.003516053],"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.0002245971,0.00020146774,0.00050434447,0.00034472492,0.00007714609,0.000122049394,0.0004303384,0.02559464,0.002757973,0.8755632,0.021649664,0.07252988],"study_design_scores_gemma":[0.00003391404,0.000019113195,0.00018547144,0.000033557437,0.0000537513,0.00006949609,0.00010165691,0.04086147,0.0020536946,0.94171995,0.014851602,0.000016344486],"about_ca_topic_score_codex":0.002716211,"about_ca_topic_score_gemma":0.0032699334,"teacher_disagreement_score":0.017202286,"about_ca_system_score_codex":0.0032252194,"about_ca_system_score_gemma":0.002822421,"threshold_uncertainty_score":0.05754739},"labels":[],"label_agreement":null},{"id":"W2068462176","doi":"","title":"On distance to monotonicity and longest increasing subsequence of a data stream","year":2008,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":31,"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":"Monotonic function; Longest common subsequence problem; Subsequence; Longest increasing subsequence; Combinatorics; Upper and lower bounds; Mathematics; Conjecture; Sequence (biology); Approximation algorithm; Space (punctuation); Streaming algorithm; Set (abstract data type); Edit distance; Log-log plot; Data stream; Discrete mathematics; Binary logarithm; Algorithm; Computer science; Statistics; Bounded function","score_opus":0.04200296111938706,"score_gpt":0.28511185113436605,"score_spread":0.24310889001497898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068462176","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.2459904,0.0014079275,0.7453572,0.0018417785,0.000082754486,0.00011360396,0.00041482598,0.0011491262,0.0036423248],"genre_scores_gemma":[0.7023569,0.001072816,0.29235083,0.0003937744,0.00028192918,0.00027245237,0.0010551469,0.00032173397,0.0018944588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956143,0.0013422357,0.00032934998,0.0009226226,0.0013334999,0.00045801044],"domain_scores_gemma":[0.94717914,0.040273894,0.0032435807,0.005070662,0.0032034754,0.0010293073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046092025,0.0009356786,0.0015631097,0.0016810779,0.0012876568,0.0019392016,0.0028044975,0.0016012563,0.002437172],"category_scores_gemma":[0.05181065,0.00055205595,0.0008029917,0.0025800278,0.0024152442,0.011571635,0.002073949,0.0029489219,0.0006605825],"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.002353898,0.0004719456,0.022499427,0.00067079335,0.00015270847,0.00049823965,0.0012014443,0.475912,0.021093998,0.22813497,0.0045210635,0.24248949],"study_design_scores_gemma":[0.000032374308,0.00023941507,0.0014026026,0.000044845416,0.000022836834,0.00027537273,0.00012599249,0.88066906,0.006644687,0.109005526,0.0015139356,0.000023438266],"about_ca_topic_score_codex":0.0020848033,"about_ca_topic_score_gemma":0.0010525931,"teacher_disagreement_score":0.0046092025,"about_ca_system_score_codex":0.0018990219,"about_ca_system_score_gemma":0.0016481173,"threshold_uncertainty_score":0.024376035},"labels":[],"label_agreement":null},{"id":"W2071642760","doi":"10.1007/s101070100253","title":"A faster capacity scaling algorithm for minimum cost submodular flow","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":26,"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":"Submodular set function; Mathematics; Minimum-cost flow problem; Maximum flow problem; Scaling; Dijkstra's algorithm; Shortest path problem; Mathematical optimization; Approximation algorithm; Suurballe's algorithm; Flow (mathematics); Flow network; Algorithm; Graph; Combinatorics","score_opus":0.0668083390083673,"score_gpt":0.26281270927000383,"score_spread":0.19600437026163653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071642760","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.032239135,0.00091053604,0.93875325,0.0019091088,0.0005897815,0.00048303904,0.00050031004,0.0048484616,0.019766353],"genre_scores_gemma":[0.18404502,0.000378025,0.8045894,0.0006440558,0.00036188582,0.0007324978,0.0008607991,0.0009342201,0.007454069],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832386,0.00039737832,0.00008393669,0.00038759172,0.0005398274,0.00026745588],"domain_scores_gemma":[0.9964455,0.0016824408,0.00020209861,0.00086793595,0.0005514796,0.00025055074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021709525,0.002172701,0.0023554582,0.0019443487,0.0013245639,0.0024434507,0.003217972,0.00197333,0.020523835],"category_scores_gemma":[0.008947925,0.0009759059,0.0012997783,0.0032209728,0.0010516789,0.005965597,0.00340173,0.004015889,0.0029709972],"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.0007248259,0.0007427308,0.0006813339,0.00053651346,0.00009192531,0.0001151996,0.00027483507,0.24084587,0.0112507185,0.09402691,0.05004032,0.6006687],"study_design_scores_gemma":[0.00020022842,0.0001104529,0.0001901401,0.00003386642,0.000029030765,0.00007828744,0.000056045366,0.91092694,0.002970575,0.078987464,0.006390208,0.000026707308],"about_ca_topic_score_codex":0.004859442,"about_ca_topic_score_gemma":0.0049691084,"teacher_disagreement_score":0.020523835,"about_ca_system_score_codex":0.0022998783,"about_ca_system_score_gemma":0.0034161962,"threshold_uncertainty_score":0.06865913},"labels":[],"label_agreement":null},{"id":"W2072445778","doi":"10.1016/j.disc.2013.08.017","title":"The cluster deletion problem for cographs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Split graph; Time complexity; Partition (number theory); Cograph; Clique graph; Graph; Clique; Discrete mathematics; Chordal graph; Line graph; Graph power; 1-planar graph","score_opus":0.015411901310856943,"score_gpt":0.2459727440412529,"score_spread":0.23056084273039595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072445778","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.4222078,0.0015341293,0.5217515,0.009879804,0.00040780596,0.00030136574,0.002696793,0.00096687226,0.040253982],"genre_scores_gemma":[0.7946183,0.0011463859,0.16986968,0.0010329628,0.00036844882,0.00033949246,0.005580591,0.00060075126,0.026443424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975412,0.0006230899,0.00013068112,0.00074354233,0.0004921418,0.00046935742],"domain_scores_gemma":[0.98635477,0.008274037,0.0009967778,0.0022228893,0.0011342791,0.0010171961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002026845,0.00087142753,0.002211979,0.0016196852,0.0045716786,0.0047172788,0.0051832153,0.0036628768,0.010199797],"category_scores_gemma":[0.015318959,0.00094723806,0.0014197959,0.003976043,0.003465602,0.011982486,0.004309148,0.004177383,0.0014126363],"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.0003921514,0.00014432608,0.002458249,0.0004673018,0.00006784074,0.0003443417,0.00076664315,0.049644377,0.002169814,0.8821141,0.02037685,0.041054048],"study_design_scores_gemma":[0.00006289046,0.000023268143,0.000614868,0.000042507334,0.000034418434,0.0003027241,0.00048829085,0.050958466,0.0017343645,0.9365043,0.009206318,0.000027561673],"about_ca_topic_score_codex":0.00503335,"about_ca_topic_score_gemma":0.004190623,"teacher_disagreement_score":0.010199797,"about_ca_system_score_codex":0.0030424919,"about_ca_system_score_gemma":0.002763682,"threshold_uncertainty_score":0.034121692},"labels":[],"label_agreement":null},{"id":"W2073512309","doi":"10.1089/cmb.2006.13.979","title":"An <i>O</i> ( <i>n</i> log <i>n</i> )-Time Algorithm for the Restriction Scaffold Assignment Problem","year":2006,"lang":"en","type":"article","venue":"Journal of Computational Biology","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"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; McGill University","funders":"","keywords":"Computer science; Algorithm; Scaffold; Combinatorics; Mathematics; Programming language","score_opus":0.01202318925585627,"score_gpt":0.2583048064252301,"score_spread":0.24628161716937386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073512309","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.020681472,0.00045390017,0.9460441,0.00170138,0.00021542776,0.0010874106,0.0012932996,0.013473054,0.015049993],"genre_scores_gemma":[0.049148887,0.00028004203,0.9398547,0.00022689636,0.000101810685,0.0008862028,0.0027811883,0.0007066618,0.006013586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982486,0.00027768844,0.00011763384,0.00066413864,0.00034097387,0.00035095913],"domain_scores_gemma":[0.99651426,0.0017955747,0.00033415842,0.0007759664,0.00027973845,0.00030025328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016350975,0.0033646165,0.0025944037,0.002044278,0.0023064043,0.003838554,0.006713059,0.003344555,0.025955636],"category_scores_gemma":[0.0050562983,0.0013837393,0.0027775986,0.0039066635,0.0016464823,0.0066136415,0.0043965406,0.0036275818,0.008840228],"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.0010962335,0.0011011205,0.0021911585,0.0014731289,0.00024225458,0.00028519912,0.0005042287,0.07579736,0.016397823,0.036011633,0.09004767,0.7748522],"study_design_scores_gemma":[0.0019029947,0.0008130842,0.0023310175,0.0001953575,0.00030918865,0.0015653011,0.0008093793,0.7617485,0.018116942,0.16185853,0.050130375,0.00021935934],"about_ca_topic_score_codex":0.007075232,"about_ca_topic_score_gemma":0.009691231,"teacher_disagreement_score":0.025955636,"about_ca_system_score_codex":0.0032735036,"about_ca_system_score_gemma":0.0055079185,"threshold_uncertainty_score":0.08683032},"labels":[],"label_agreement":null},{"id":"W2075025003","doi":"10.1007/bf02984830","title":"What this country needs is an 18c piece","year":2003,"lang":"en","type":"article","venue":"The Mathematical Intelligencer","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":56,"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; Business","score_opus":0.06498037748851589,"score_gpt":0.3063643580093941,"score_spread":0.24138398052087823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075025003","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.0022579168,0.0050672195,0.001168522,0.62893385,0.05715391,0.000054291413,0.0018114146,0.00034532882,0.30320752],"genre_scores_gemma":[0.03742646,0.008284762,0.006010038,0.28508535,0.015523857,0.00022429555,0.0040282393,0.0009228478,0.64249414],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99871445,0.00021011343,0.000057783287,0.0001173749,0.00043991941,0.00046039582],"domain_scores_gemma":[0.99332494,0.0008269985,0.00022625188,0.0007087901,0.002951192,0.0019618375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024189719,0.00067675195,0.0009652826,0.0013513969,0.006429723,0.009167283,0.0011134297,0.0070264353,0.13579056],"category_scores_gemma":[0.008313761,0.0003952126,0.00086220144,0.0015666897,0.0025119402,0.0068717166,0.0041035875,0.0075369366,0.05398933],"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.000039645685,0.000024548744,0.0002981852,0.00011254395,0.000006915666,0.00008947425,0.00022938722,0.00006653088,0.00020107052,0.024604682,0.9463732,0.027953781],"study_design_scores_gemma":[0.0000068979343,0.000007801921,0.00039053787,0.00014388058,0.000005644348,0.000033143635,0.00065974524,0.000019137518,0.000051599895,0.005187161,0.99348325,0.000011014146],"about_ca_topic_score_codex":0.01952049,"about_ca_topic_score_gemma":0.03364649,"teacher_disagreement_score":0.13579056,"about_ca_system_score_codex":0.0029240989,"about_ca_system_score_gemma":0.010639734,"threshold_uncertainty_score":0.45426464},"labels":[],"label_agreement":null},{"id":"W2075553387","doi":"10.1016/j.jcss.2014.04.027","title":"Randomized diffusion for indivisible loads","year":2014,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council","keywords":"Hypercube; Randomized algorithm; Vertex (graph theory); Mathematics; Computer science; Expander graph; Eigenvalues and eigenvectors; Load balancing (electrical power); Exponential function; Degree (music); Upper and lower bounds; Combinatorics; Discrete mathematics; Graph; Grid","score_opus":0.021908114671098634,"score_gpt":0.2596130867643442,"score_spread":0.23770497209324556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075553387","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.12923831,0.0011837577,0.83935684,0.008174513,0.00064068445,0.00033545957,0.0007339297,0.0018301504,0.018506303],"genre_scores_gemma":[0.87196356,0.0007903238,0.096320316,0.0012237336,0.00063662475,0.0004639284,0.00054599054,0.00062359066,0.027431933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962379,0.001360877,0.00017497575,0.00085681124,0.00071740535,0.0006521021],"domain_scores_gemma":[0.9556519,0.03326728,0.001998379,0.0050133825,0.0021703632,0.0018986663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057720426,0.001542363,0.0033809044,0.0022797566,0.0025264637,0.004526111,0.0047841775,0.0038588059,0.0134576745],"category_scores_gemma":[0.044288315,0.0015897356,0.0015986696,0.0021397357,0.0042483713,0.010765812,0.005152537,0.005696706,0.0012065914],"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.0010783739,0.00035824356,0.0006746695,0.0003182831,0.00009731817,0.00012227264,0.00027842305,0.29815564,0.003951527,0.6552916,0.01301981,0.02665391],"study_design_scores_gemma":[0.00012590887,0.000042568332,0.0001228261,0.00002333286,0.000023612043,0.000034918146,0.000035622772,0.69115925,0.00066368334,0.30675575,0.0009808027,0.00003171251],"about_ca_topic_score_codex":0.004137562,"about_ca_topic_score_gemma":0.0042271013,"teacher_disagreement_score":0.0134576745,"about_ca_system_score_codex":0.0052537974,"about_ca_system_score_gemma":0.003194517,"threshold_uncertainty_score":0.04502046},"labels":[],"label_agreement":null},{"id":"W2075766499","doi":"10.1016/j.endm.2004.03.039","title":"Minimum-Cost Single-Source 2-Splittable Flow","year":2004,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","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":"Minimum-cost flow problem; Mathematical optimization; Mathematics; Flow (mathematics); Vertex (graph theory); Path (computing); Constraint (computer-aided design); Flow network; Enhanced Data Rates for GSM Evolution; Budget constraint; Graph; Computer science; Combinatorics; Economics; Microeconomics; Computer network; Geometry","score_opus":0.01972464748282074,"score_gpt":0.24912374400685244,"score_spread":0.2293990965240317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075766499","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.39591756,0.0010900744,0.51804274,0.003589085,0.00054863846,0.00078734104,0.008231606,0.0023559465,0.06943704],"genre_scores_gemma":[0.75374275,0.0007741058,0.21549094,0.00042075303,0.00017573542,0.0004060264,0.004019746,0.00044219312,0.024527708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954945,0.00008307435,0.000027765005,0.000117824886,0.00010146201,0.00012030448],"domain_scores_gemma":[0.9985594,0.0006470966,0.00015316447,0.0002486036,0.0001924509,0.00019919494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077346887,0.001518036,0.0016416493,0.0013815061,0.001243734,0.0020570112,0.0025932232,0.0022997984,0.022671182],"category_scores_gemma":[0.0030007488,0.00067906163,0.0009849233,0.0018799887,0.00074674457,0.004430815,0.0021628395,0.0015912297,0.0015148447],"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.003581682,0.00083601504,0.0020080085,0.0025883885,0.00036338187,0.00082829414,0.0006594976,0.31609127,0.035162654,0.33761755,0.06581984,0.23444349],"study_design_scores_gemma":[0.000659848,0.00033164513,0.0015041203,0.00015234324,0.00019605036,0.00045531287,0.00025039367,0.5329261,0.01184507,0.4410241,0.010573757,0.00008133206],"about_ca_topic_score_codex":0.00171112,"about_ca_topic_score_gemma":0.0029041476,"teacher_disagreement_score":0.022671182,"about_ca_system_score_codex":0.0015031477,"about_ca_system_score_gemma":0.0017124311,"threshold_uncertainty_score":0.07584268},"labels":[],"label_agreement":null},{"id":"W2076347651","doi":"10.1145/2733693.2733702","title":"Zigzag Form over Families of Parametric Matrices","year":2015,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Complexity and Algorithms in Graphs","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":true,"ca_institutions":"Western University","funders":"","keywords":"Citation; Zigzag; Computer science; Library science; Genealogy; History; Archaeology","score_opus":0.07643292070875024,"score_gpt":0.320113334141787,"score_spread":0.24368041343303676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076347651","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.13762975,0.0013238518,0.5241225,0.002682423,0.0014156725,0.0001800144,0.0010703563,0.0015236083,0.3300519],"genre_scores_gemma":[0.7359428,0.0016869601,0.114408,0.0010930407,0.0009895265,0.0002307375,0.0012579783,0.001005958,0.14338502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942786,0.00014764049,0.000033764944,0.00013319889,0.00016761624,0.00008996243],"domain_scores_gemma":[0.999141,0.00022773814,0.00009512144,0.00020946874,0.00021381679,0.000112822236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000515836,0.00047281996,0.00040638848,0.0010837885,0.0012801144,0.0017933513,0.0005196636,0.00060604105,0.036997832],"category_scores_gemma":[0.002081433,0.0002930684,0.0005720864,0.0013207644,0.0011329429,0.0032412028,0.0017616198,0.0014323368,0.0078352485],"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.000055542187,0.0000143257885,0.00018912827,0.000045783276,0.0000048468205,0.00013741737,0.00022827023,0.001681315,0.0014649852,0.95329607,0.011873105,0.03100925],"study_design_scores_gemma":[0.0000072656094,0.000031430907,0.00016150888,0.000021592774,0.0000042219367,0.00027800378,0.000118591415,0.005426829,0.0008876879,0.95031166,0.042736024,0.000015210565],"about_ca_topic_score_codex":0.00055735366,"about_ca_topic_score_gemma":0.0007502292,"teacher_disagreement_score":0.036997832,"about_ca_system_score_codex":0.00059090497,"about_ca_system_score_gemma":0.00038688665,"threshold_uncertainty_score":0.12377006},"labels":[],"label_agreement":null},{"id":"W2076513440","doi":"10.1016/j.dam.2006.03.003","title":"Approximating the minimum clique cover and other hard problems in subtree filament graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":29,"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; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Chordal graph; Clique-sum; Mathematics; Indifference graph; Maximal independent set; Discrete mathematics; Split graph; Treewidth; Clique problem; Pathwidth; 1-planar graph; Graph; Line graph","score_opus":0.020750884686091344,"score_gpt":0.22998158125748325,"score_spread":0.2092306965713919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076513440","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.58978146,0.0027502736,0.37432513,0.005572112,0.00019540776,0.00022715317,0.0020127275,0.0008137512,0.024322081],"genre_scores_gemma":[0.8713132,0.0010118784,0.116664514,0.00042787526,0.0003267513,0.00019218483,0.0025569838,0.00040392327,0.00710267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988172,0.00040017313,0.00003947688,0.00026185246,0.00027790226,0.0002033673],"domain_scores_gemma":[0.9874456,0.010067429,0.0009287154,0.0006796014,0.00033644054,0.00054225966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016018647,0.0012791838,0.0019736174,0.0017467346,0.001256488,0.002812625,0.0036948796,0.0034952976,0.0073151942],"category_scores_gemma":[0.018204605,0.0011393288,0.0014340155,0.0032314507,0.0018953172,0.006034955,0.0021149686,0.0032072284,0.00047530353],"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.0006732101,0.00039667307,0.005151734,0.0004125184,0.00011998275,0.00025791908,0.00026576116,0.8484166,0.00212145,0.08294776,0.0138082635,0.045428164],"study_design_scores_gemma":[0.000046671837,0.00003662305,0.000722892,0.000019160258,0.000020399024,0.000081452024,0.00007089543,0.9137782,0.00052217214,0.083833955,0.0008590878,0.000008557785],"about_ca_topic_score_codex":0.004523179,"about_ca_topic_score_gemma":0.0066575883,"teacher_disagreement_score":0.0073151942,"about_ca_system_score_codex":0.002732844,"about_ca_system_score_gemma":0.0010950472,"threshold_uncertainty_score":0.02447176},"labels":[],"label_agreement":null},{"id":"W2076901012","doi":"10.1007/s00453-011-9596-0","title":"Two-stage Robust Network Design with Exponential Scenarios","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","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":"University of Alberta","funders":"","keywords":"Steiner tree problem; Theory of computation; Facility location problem; Integer programming; Mathematical optimization; Computer science; Combinatorial optimization; Tree (set theory); Combinatorics; Integer (computer science); Network planning and design; Mathematics; Approximation algorithm; Stage (stratigraphy); Discrete mathematics; Algorithm","score_opus":0.06642916085159743,"score_gpt":0.22959198527262015,"score_spread":0.1631628244210227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076901012","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.010013591,0.0000820321,0.9868622,0.00019638114,0.00001880433,0.00008143091,0.00009431146,0.00009944152,0.00255181],"genre_scores_gemma":[0.76796144,0.00040608027,0.22067147,0.000223994,0.00010448417,0.00054058956,0.00030943617,0.0001293999,0.00965313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971675,0.0013912187,0.000104398445,0.00060602825,0.00040201156,0.00032889063],"domain_scores_gemma":[0.9896924,0.0075206417,0.00081695995,0.0008096798,0.0007738351,0.00038645678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005138453,0.0020275377,0.0018742131,0.00089813315,0.00060736056,0.002082163,0.0040330985,0.003019462,0.0067234924],"category_scores_gemma":[0.0151800355,0.0016640519,0.0014231259,0.00091366866,0.0015009887,0.004653294,0.0034552028,0.0022752155,0.0008016851],"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.00023843719,0.00005338234,0.00020171258,0.00011366629,0.00005444674,0.000096790696,0.00004252952,0.9273937,0.0014173891,0.059038326,0.0009292523,0.0104203895],"study_design_scores_gemma":[0.00003141895,0.000056003664,0.000048010406,0.0000080607015,0.000017269642,0.00002766701,0.0000073677406,0.96826136,0.000535269,0.030677719,0.00031915723,0.000010688129],"about_ca_topic_score_codex":0.0013178926,"about_ca_topic_score_gemma":0.0012535261,"teacher_disagreement_score":0.0067234924,"about_ca_system_score_codex":0.0017960944,"about_ca_system_score_gemma":0.0012797895,"threshold_uncertainty_score":0.027175069},"labels":[],"label_agreement":null},{"id":"W2077484581","doi":"10.1145/2633602","title":"On the One-Way Function Candidate Proposed by Goldreich","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"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":"Division of Computing and Communication Foundations; European Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Discrete mathematics; Satisfiability; Exponential function; Function (biology); Bipartite graph; Backtracking; Combinatorics; Upper and lower bounds; Algorithm; Graph","score_opus":0.016132672164525262,"score_gpt":0.23243034732104328,"score_spread":0.21629767515651802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077484581","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.06913963,0.0019215418,0.91105926,0.001648327,0.00016257097,0.00023564078,0.00027587716,0.0010964288,0.014460706],"genre_scores_gemma":[0.60450256,0.001950407,0.37303272,0.001066196,0.00028531495,0.0005599295,0.0007705712,0.00063283526,0.017199425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955239,0.0013997605,0.00018526886,0.0013726826,0.0009793763,0.0005390087],"domain_scores_gemma":[0.9841344,0.0103827985,0.0006410727,0.0031071776,0.0014277403,0.0003069031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004185856,0.0015545919,0.0023590445,0.0019266282,0.0024072898,0.003373196,0.0028487823,0.002993751,0.007205963],"category_scores_gemma":[0.02181915,0.0009624477,0.0029084436,0.0026767573,0.005050618,0.01166179,0.0030911227,0.00368441,0.00253329],"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.0017500853,0.00022528069,0.0028007545,0.00043669174,0.00008022127,0.00038265696,0.00041897065,0.09177534,0.007271896,0.78971845,0.0082226945,0.09691694],"study_design_scores_gemma":[0.00021450597,0.0006260539,0.0005174899,0.00019051721,0.00016561264,0.00073129305,0.0001003044,0.5039623,0.014055691,0.46255526,0.01673365,0.00014734191],"about_ca_topic_score_codex":0.0020591551,"about_ca_topic_score_gemma":0.0012420784,"teacher_disagreement_score":0.007205963,"about_ca_system_score_codex":0.003363998,"about_ca_system_score_gemma":0.002528433,"threshold_uncertainty_score":0.024407625},"labels":[],"label_agreement":null},{"id":"W2078140591","doi":"10.1016/j.tcs.2014.11.008","title":"Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"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":"Rounding; Mathematics; Bipartite graph; Function (biology); Approximation algorithm; Value (mathematics); Combinatorics; Discrete mathematics; Upper and lower bounds; Boolean function; Time complexity; Integer (computer science); Algorithm; Computer science","score_opus":0.026753670774554365,"score_gpt":0.26676395496704475,"score_spread":0.24001028419249038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078140591","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.31657994,0.0067151664,0.62419015,0.0071452036,0.0006184301,0.0002842575,0.0023151543,0.0010663088,0.041085415],"genre_scores_gemma":[0.82282794,0.0024145986,0.15922733,0.00057530164,0.0006860158,0.0004226486,0.0018625221,0.0005717563,0.011411964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952858,0.0019779587,0.00019195465,0.0008350923,0.0009763157,0.00073279045],"domain_scores_gemma":[0.9597507,0.0331146,0.0019493623,0.0020383955,0.0019895078,0.0011574765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064150384,0.0016090936,0.0026939309,0.002734348,0.0016286791,0.006058785,0.004631041,0.0035338018,0.01099925],"category_scores_gemma":[0.05064586,0.0010235406,0.0017860867,0.004899804,0.0027657698,0.007897452,0.002042378,0.0041126725,0.0007391002],"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.0013142842,0.00036453863,0.0023423147,0.00069111405,0.00023973796,0.00006680803,0.0002917868,0.51903135,0.0016945088,0.38517898,0.015537243,0.07324737],"study_design_scores_gemma":[0.00007690666,0.00010410404,0.00067870575,0.00007291445,0.000055788067,0.00005420082,0.00011048091,0.64733326,0.00090620964,0.3492965,0.0012771618,0.000033714638],"about_ca_topic_score_codex":0.002589617,"about_ca_topic_score_gemma":0.0034766132,"teacher_disagreement_score":0.01099925,"about_ca_system_score_codex":0.0056606974,"about_ca_system_score_gemma":0.003386885,"threshold_uncertainty_score":0.041071415},"labels":[],"label_agreement":null},{"id":"W2078952510","doi":"10.1007/s00453-013-9823-y","title":"Lower Bounds Against Weakly-Uniform Threshold Circuits","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Mathematical proof; Theory of computation; Electronic circuit; Boolean circuit; Mathematics; Discrete mathematics; Computer science; Boolean function; Arithmetic; Algorithm; Electrical engineering","score_opus":0.01584595035044201,"score_gpt":0.22472843624327576,"score_spread":0.20888248589283376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078952510","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.26017058,0.0153256785,0.48269483,0.02935768,0.0016613676,0.0005902411,0.004949678,0.0045194346,0.20073047],"genre_scores_gemma":[0.90305066,0.0052559813,0.049579676,0.0043312768,0.001983391,0.0008784049,0.0034688865,0.0015396496,0.029912042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904924,0.0021727954,0.00042729665,0.001746722,0.0028664013,0.0022943271],"domain_scores_gemma":[0.9212164,0.06217537,0.0028724454,0.007213401,0.0031375194,0.0033847566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005445,0.0041270857,0.0040321522,0.0052235685,0.004593238,0.0124893235,0.009291615,0.0050099613,0.026314614],"category_scores_gemma":[0.054430034,0.0021165623,0.0030570112,0.0071303993,0.006263405,0.02668386,0.011698847,0.011286786,0.0042681005],"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.0028467162,0.0004998814,0.0033052578,0.0012873885,0.00027478707,0.00024106246,0.000837559,0.069021046,0.007038763,0.82145846,0.031066256,0.062122736],"study_design_scores_gemma":[0.00016208737,0.00011205846,0.00050768297,0.00015181198,0.00019750981,0.00016029773,0.0001284743,0.10481036,0.00390982,0.8848735,0.0049387887,0.00004754225],"about_ca_topic_score_codex":0.0020630725,"about_ca_topic_score_gemma":0.0034096988,"teacher_disagreement_score":0.026314614,"about_ca_system_score_codex":0.007934908,"about_ca_system_score_gemma":0.0033912656,"threshold_uncertainty_score":0.08803117},"labels":[],"label_agreement":null},{"id":"W2079241283","doi":"10.1145/2488608.2488662","title":"Every locally characterized affine-invariant property is testable","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"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":"Affine transformation; Mathematics; Invariant (physics); Linear subspace; Bounded function; Discrete mathematics; Property (philosophy); Affine combination; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.020656875713861992,"score_gpt":0.21239289814555204,"score_spread":0.19173602243169005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079241283","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.81862146,0.00020898823,0.1659299,0.0012819425,0.000055306336,0.000117179356,0.0023294624,0.002305065,0.009150711],"genre_scores_gemma":[0.9898601,0.00004071212,0.008320097,0.000085839914,0.000029301642,0.00005613008,0.00084764115,0.0000633986,0.0006968571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978725,0.0002640501,0.00012425259,0.00082177005,0.00045670435,0.0004606831],"domain_scores_gemma":[0.98531103,0.008198636,0.0016397763,0.0031809574,0.000943281,0.0007262476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011099607,0.00066370144,0.0010612827,0.00063844136,0.0009717062,0.0022718743,0.0013391012,0.0010871248,0.0038292971],"category_scores_gemma":[0.009333726,0.00031485254,0.0010958173,0.00087352877,0.0029680722,0.00493513,0.0017166089,0.002064911,0.0006807626],"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.0063073975,0.001417897,0.07463718,0.0011610317,0.00092704035,0.0045218375,0.0026603157,0.12756121,0.21432261,0.364152,0.010371513,0.19196],"study_design_scores_gemma":[0.00037261107,0.0011762376,0.015721995,0.00008178696,0.00036031933,0.0029493412,0.0010646079,0.232427,0.1582013,0.57730275,0.010164559,0.00017750742],"about_ca_topic_score_codex":0.00065148924,"about_ca_topic_score_gemma":0.00049892784,"teacher_disagreement_score":0.0038292971,"about_ca_system_score_codex":0.0012663684,"about_ca_system_score_gemma":0.000984488,"threshold_uncertainty_score":0.01281029},"labels":[],"label_agreement":null},{"id":"W2079817983","doi":"10.1016/j.dam.2013.03.028","title":"Some advances on Lovász–Schrijver semidefinite programming relaxations of the fractional stable set polytope","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Universidad Nacional de Rosario; Consejo Nacional de Investigaciones Científicas y Técnicas; Agencia Nacional de Promoción Científica y Tecnológica; University of Waterloo","keywords":"Polytope; Mathematics; Semidefinite programming; Combinatorics; Operator (biology); Hierarchy; Set (abstract data type); Relaxation (psychology); Birkhoff polytope; Regular polygon; Convex polytope; Discrete mathematics; Convex set; Convex optimization; Mathematical optimization; Computer science","score_opus":0.020210425048021223,"score_gpt":0.24943018901719527,"score_spread":0.22921976396917404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079817983","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.034083992,0.015536602,0.8265309,0.004748282,0.0012713611,0.00013250402,0.00053919404,0.00016797139,0.11698928],"genre_scores_gemma":[0.52673984,0.024784043,0.3953654,0.0024438112,0.0032330635,0.00048609442,0.0016458939,0.0006487081,0.044653185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990023,0.00036814954,0.00004352927,0.00022394017,0.0002563589,0.00010571044],"domain_scores_gemma":[0.9988381,0.0006889084,0.00009226189,0.000115177885,0.00016761097,0.000097929544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002639356,0.0021013443,0.001505238,0.0015001927,0.0011817084,0.002890345,0.0022608698,0.0015502933,0.008794226],"category_scores_gemma":[0.0055994648,0.0007923824,0.0023978974,0.0024645433,0.0018229149,0.0053232275,0.0022263401,0.00610596,0.000985211],"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.000079240934,0.00016116016,0.00022962519,0.00039208992,0.0000501641,0.000080178834,0.00025167112,0.06716773,0.0015854524,0.87820387,0.009675389,0.04212346],"study_design_scores_gemma":[0.00002822395,0.00008359746,0.0002471187,0.00012247865,0.000034613473,0.00007373848,0.00014289371,0.34872466,0.0008297922,0.63007915,0.019587342,0.000046400928],"about_ca_topic_score_codex":0.002231546,"about_ca_topic_score_gemma":0.0024075669,"teacher_disagreement_score":0.008794226,"about_ca_system_score_codex":0.001990437,"about_ca_system_score_gemma":0.001232388,"threshold_uncertainty_score":0.029419601},"labels":[],"label_agreement":null},{"id":"W2082030917","doi":"10.1287/ijoc.13.3.210.12632","title":"Fast Heuristics for the Maximum Feasible Subsystem Problem","year":2001,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":86,"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":"Heuristics; Mathematical optimization; Cardinality (data modeling); Computer science; Set (abstract data type); Linear programming; Mathematics; Algorithm; Data mining","score_opus":0.03735851513923256,"score_gpt":0.2758705309087951,"score_spread":0.23851201576956255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082030917","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.028982304,0.0008809008,0.9603658,0.00029949224,0.000080826634,0.0003043969,0.0003544389,0.002390489,0.006341273],"genre_scores_gemma":[0.12519671,0.00049519166,0.87056386,0.00016441212,0.00006630255,0.0004212462,0.0009786718,0.0003358826,0.0017777815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987274,0.00049478665,0.000057863832,0.00017088056,0.00026377753,0.00028524306],"domain_scores_gemma":[0.996042,0.0028695143,0.00021344937,0.00043970693,0.0003170109,0.00011829777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016695799,0.0016441513,0.0014497353,0.0017164996,0.0009916943,0.0011803646,0.001882039,0.0014208921,0.0059963553],"category_scores_gemma":[0.005549254,0.0009783533,0.0012985868,0.002302965,0.0008001095,0.0024931652,0.0013193765,0.0020375417,0.0010626176],"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.00056839106,0.00024957387,0.0008078709,0.00048649602,0.00012302904,0.00023952487,0.00026046936,0.68848443,0.00657354,0.04931434,0.023025714,0.22986665],"study_design_scores_gemma":[0.00024989416,0.00014142928,0.00039380777,0.000049829152,0.000057364985,0.00011053257,0.0001134176,0.940041,0.0037229843,0.046440355,0.008643202,0.000036235375],"about_ca_topic_score_codex":0.006011101,"about_ca_topic_score_gemma":0.01111024,"teacher_disagreement_score":0.006011101,"about_ca_system_score_codex":0.0015897191,"about_ca_system_score_gemma":0.0029047043,"threshold_uncertainty_score":0.020059764},"labels":[],"label_agreement":null},{"id":"W2082591216","doi":"10.1145/1993636.1993662","title":"Correlation testing for affine invariant properties on F <sub>p</sub> <sup>n</sup> in the high error regime","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Affine transformation; Property testing; Invariant (physics); Correlation; Mathematics; Constant (computer programming); Correlation function (quantum field theory); Degree (music); Discrete mathematics; Combinatorics; Pure mathematics; Statistics; Computer science; Physics; Geometry","score_opus":0.09785208904460113,"score_gpt":0.23437686740069175,"score_spread":0.13652477835609061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082591216","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.61477125,0.00039161305,0.37667257,0.0011444823,0.00004112314,0.00013052938,0.00045208438,0.00085536396,0.0055409987],"genre_scores_gemma":[0.98301184,0.00012568689,0.015719198,0.00014176023,0.00008526588,0.00008338735,0.00025003977,0.000061008643,0.0005217627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9865823,0.0044375453,0.00078219315,0.0030284598,0.00363239,0.001537121],"domain_scores_gemma":[0.81612366,0.14628585,0.014618626,0.014963973,0.0052355933,0.0027722092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009207851,0.0007754963,0.001668227,0.0019956308,0.0012806559,0.002682118,0.0018573384,0.0015506446,0.0018426531],"category_scores_gemma":[0.07731089,0.0004537208,0.0014078096,0.0023563548,0.007076945,0.008380731,0.0025406675,0.0029031066,0.00032585463],"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.0035401364,0.0006302991,0.07663398,0.00062159804,0.0004714194,0.002357731,0.0010977294,0.26812986,0.036768597,0.4756997,0.003536374,0.13051261],"study_design_scores_gemma":[0.00010439418,0.0008325876,0.008782517,0.000047283833,0.00011722497,0.0011505048,0.00029658232,0.6167587,0.03616901,0.33426097,0.0013986495,0.000081546175],"about_ca_topic_score_codex":0.0011495803,"about_ca_topic_score_gemma":0.000639323,"teacher_disagreement_score":0.009207851,"about_ca_system_score_codex":0.0021112703,"about_ca_system_score_gemma":0.0017598573,"threshold_uncertainty_score":0.04869634},"labels":[],"label_agreement":null},{"id":"W2083246371","doi":"10.1007/s10107-013-0703-7","title":"New approaches to multi-objective optimization","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":55,"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":"Matroid; Mathematics; Mathematical optimization; Matching (statistics); Spanning tree; Bipartite graph; Approximation algorithm; Rounding; Combinatorics; Computer science; Graph","score_opus":0.11490132143911759,"score_gpt":0.2635967916886539,"score_spread":0.14869547024953633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083246371","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.0016308683,0.0019311102,0.98911285,0.0008395584,0.00023517774,0.00002093547,0.000038126196,0.00005034545,0.0061411043],"genre_scores_gemma":[0.117892124,0.0072806776,0.8563565,0.00097272353,0.0021511402,0.00036059073,0.00021078975,0.0002745907,0.014500831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835026,0.00065066555,0.00007369098,0.00021236557,0.0006438789,0.00006917077],"domain_scores_gemma":[0.9963708,0.0025303098,0.00026514346,0.0002933413,0.00040555518,0.00013492983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022909727,0.0017418467,0.0015651091,0.0019811427,0.0006986424,0.0031143867,0.002896252,0.0014825382,0.005479633],"category_scores_gemma":[0.0074637583,0.00091447384,0.0017069652,0.0024109753,0.001992721,0.005542716,0.0028222918,0.0055616195,0.0008338836],"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.000024425652,0.00007737062,0.00024259285,0.00030610975,0.00009430575,0.00004167448,0.00010316156,0.16625331,0.00065426907,0.7741138,0.0048387595,0.05325031],"study_design_scores_gemma":[0.000013728073,0.000013983638,0.00008585924,0.000036493828,0.00002135156,0.000029735469,0.000023990478,0.43216676,0.0001987522,0.5588407,0.008554425,0.0000142622],"about_ca_topic_score_codex":0.0011047838,"about_ca_topic_score_gemma":0.0017793357,"teacher_disagreement_score":0.005479633,"about_ca_system_score_codex":0.0018286112,"about_ca_system_score_gemma":0.0010649206,"threshold_uncertainty_score":0.01833123},"labels":[],"label_agreement":null},{"id":"W2084170146","doi":"10.1016/j.tcs.2014.07.025","title":"A second look at counting triangles in graph streams","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Streaming algorithm; Combinatorics; Mathematics; Constant (computer programming); Graph; Space (punctuation); Discrete mathematics; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Computer science","score_opus":0.00985627178227796,"score_gpt":0.2302904869943695,"score_spread":0.22043421521209153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084170146","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.041395497,0.020440454,0.73207945,0.062560245,0.004965373,0.0001977898,0.0020310583,0.0017613338,0.1345688],"genre_scores_gemma":[0.3467933,0.013941297,0.4602021,0.02453594,0.013372541,0.00031919134,0.0024005275,0.0025799514,0.13585517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997773,0.0006401709,0.00011197333,0.00056318066,0.0006457825,0.00026591317],"domain_scores_gemma":[0.9871683,0.007846951,0.0004991542,0.0018977819,0.0016882578,0.00089954847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020864299,0.001461547,0.0024976674,0.006341857,0.0030105223,0.0069901026,0.004074139,0.004157742,0.03556181],"category_scores_gemma":[0.01913656,0.0008337096,0.0021399395,0.008728403,0.005142277,0.034602676,0.0036639958,0.009402795,0.003298907],"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.0001530337,0.00010405294,0.0010756587,0.00030199275,0.000055240496,0.00017690584,0.00048003456,0.0030875166,0.0013209332,0.9145917,0.035738114,0.042914826],"study_design_scores_gemma":[0.000030634426,0.000064092266,0.000538165,0.00014259307,0.000060380007,0.00035108597,0.00037388146,0.01771974,0.0012284744,0.93657637,0.042869434,0.000045078028],"about_ca_topic_score_codex":0.0047202324,"about_ca_topic_score_gemma":0.0048721707,"teacher_disagreement_score":0.03556181,"about_ca_system_score_codex":0.00293347,"about_ca_system_score_gemma":0.0011003535,"threshold_uncertainty_score":0.11896604},"labels":[],"label_agreement":null},{"id":"W2084297766","doi":"10.5555/1283383.1283481","title":"A faster cache-oblivious shortest-path algorithm for undirected graphs with bounded edge lengths","year":2007,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Dalhousie University","funders":"","keywords":"Combinatorics; Shortest path problem; Computer science; Spanning tree; Mathematics; Discrete mathematics; Graph","score_opus":0.018221203110816934,"score_gpt":0.2519232261339546,"score_spread":0.2337020230231377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084297766","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.030346395,0.0006696267,0.96052206,0.0003451433,0.00006711844,0.00012986617,0.00037648223,0.004221247,0.0033220588],"genre_scores_gemma":[0.16241954,0.00036772748,0.83132386,0.0001579951,0.00006336143,0.00029229754,0.0013272599,0.00041958247,0.0036284232],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930215,0.00013379689,0.000044117744,0.00019732681,0.0002240501,0.000098561504],"domain_scores_gemma":[0.99823534,0.0006673029,0.0001642127,0.0005886971,0.00026480723,0.00007967038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004676364,0.0011104409,0.0010885706,0.0011160653,0.00097127573,0.0009914964,0.002300548,0.0011613496,0.00406077],"category_scores_gemma":[0.0031275533,0.0006209962,0.00074405374,0.0020561882,0.000654405,0.0034784325,0.0018401467,0.0012124781,0.0017206159],"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.00064133876,0.00037585897,0.0017400895,0.0007616355,0.00021433226,0.0003393227,0.00054921076,0.3236852,0.03997788,0.049343556,0.02634701,0.55602455],"study_design_scores_gemma":[0.00025456838,0.00021440179,0.0004355835,0.00004097131,0.00006948219,0.00033402693,0.00007723037,0.90809083,0.013060702,0.06468395,0.012675737,0.00006249131],"about_ca_topic_score_codex":0.0036717483,"about_ca_topic_score_gemma":0.0053325086,"teacher_disagreement_score":0.00406077,"about_ca_system_score_codex":0.00097243645,"about_ca_system_score_gemma":0.0016978977,"threshold_uncertainty_score":0.013584673},"labels":[],"label_agreement":null},{"id":"W2086070368","doi":"10.1016/j.comgeo.2015.02.004","title":"On full Steiner trees in unit disk graphs","year":2015,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Complexity and Algorithms in Graphs","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Combinatorics; Mathematics; Gomory–Hu tree; k-minimum spanning tree; K-ary tree; Tree (set theory); Unit disk; Graph; Approximation algorithm; Discrete mathematics; Tree structure; Binary tree","score_opus":0.04795850184395449,"score_gpt":0.28200055814693564,"score_spread":0.23404205630298114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086070368","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.50627875,0.008703259,0.3823641,0.009594758,0.0004165939,0.00022629143,0.0029520218,0.0007340742,0.08873016],"genre_scores_gemma":[0.87829274,0.008438298,0.08388801,0.0010833759,0.0010661683,0.00030018776,0.003237591,0.000565097,0.023128575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981415,0.0006167051,0.00008149902,0.00029009156,0.00052765576,0.00034245063],"domain_scores_gemma":[0.986472,0.010267966,0.0010594794,0.0010077665,0.0005642033,0.0006286248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012844439,0.0014812922,0.0025462734,0.0030142546,0.0020974092,0.005067657,0.0040136217,0.00212719,0.0136920465],"category_scores_gemma":[0.014484073,0.0012657961,0.0013611568,0.006700781,0.0031227905,0.014519304,0.004033445,0.0034714413,0.0012675299],"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.0003702182,0.00015910788,0.0014925912,0.0005647528,0.000072484254,0.00019752182,0.0006437223,0.13156006,0.0015526843,0.8047739,0.018511612,0.040101267],"study_design_scores_gemma":[0.00003524417,0.00002408193,0.00053910806,0.00004926587,0.000024812678,0.00009920633,0.00016985455,0.10915034,0.00036773775,0.88692373,0.002599439,0.00001718688],"about_ca_topic_score_codex":0.003427385,"about_ca_topic_score_gemma":0.0041388413,"teacher_disagreement_score":0.0136920465,"about_ca_system_score_codex":0.0032262956,"about_ca_system_score_gemma":0.0013157136,"threshold_uncertainty_score":0.0458045},"labels":[],"label_agreement":null},{"id":"W2086467753","doi":"10.1109/focs.2011.86","title":"Information Equals Amortized Communication","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":122,"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":"Communication complexity; Computer science; Theoretical computer science; Generalization; Pointer (user interface); Function (biology); Discrete mathematics; Mathematics","score_opus":0.053901524843162935,"score_gpt":0.2720959378801884,"score_spread":0.21819441303702544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086467753","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.1376571,0.00015626763,0.8435864,0.0016536452,0.00008143509,0.0002996707,0.0003217422,0.0010485807,0.015195143],"genre_scores_gemma":[0.82176834,0.00018305752,0.16928993,0.0004325129,0.00010003136,0.000669778,0.0004850553,0.000344053,0.0067272745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99344456,0.0018738173,0.00042579425,0.0015020411,0.0018506915,0.00090315833],"domain_scores_gemma":[0.9744586,0.014627022,0.0013375052,0.0076375073,0.0010783762,0.00086102047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003155836,0.0012055587,0.001193168,0.0009830868,0.0016128186,0.0034110395,0.0033930019,0.002249131,0.008889238],"category_scores_gemma":[0.018676575,0.00068282493,0.0022217277,0.0011316674,0.00468668,0.01011348,0.006103613,0.004515497,0.001252912],"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.0006121984,0.00020732079,0.0013630972,0.00022663019,0.00011846233,0.00021827532,0.0003373236,0.22354788,0.011246764,0.73730314,0.001722123,0.023096843],"study_design_scores_gemma":[0.000070337184,0.00011758845,0.00015042949,0.000021403179,0.0000520844,0.00011341074,0.000034733333,0.5270812,0.013155987,0.45686015,0.0023107566,0.000031879787],"about_ca_topic_score_codex":0.0009874033,"about_ca_topic_score_gemma":0.0008158673,"teacher_disagreement_score":0.008889238,"about_ca_system_score_codex":0.0026488488,"about_ca_system_score_gemma":0.0023650425,"threshold_uncertainty_score":0.029737413},"labels":[],"label_agreement":null},{"id":"W2086871104","doi":"10.1007/s10878-013-9673-1","title":"An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"","keywords":"Rounding; Combinatorics; Semidefinite programming; Approximation algorithm; Mathematics; Maximum cut; Theory of computation; Semidefinite embedding; Bisection; Vertex (graph theory); Discrete mathematics; Graph; Algorithm; Mathematical optimization; Computer science","score_opus":0.015056568378776166,"score_gpt":0.2445863574433526,"score_spread":0.22952978906457644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086871104","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.02090414,0.00033795027,0.96256524,0.00056942215,0.00029126636,0.00020750026,0.00024170558,0.0018278065,0.013054979],"genre_scores_gemma":[0.15666771,0.00022675595,0.8340885,0.00039780687,0.00015181123,0.00035883512,0.00077027647,0.00040131732,0.0069370554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998355,0.000455816,0.000083315805,0.00031038228,0.0005635771,0.0002319328],"domain_scores_gemma":[0.997332,0.0013240257,0.00015688017,0.0005050192,0.00050855597,0.00017351544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016885536,0.0014180763,0.0020733539,0.001213578,0.0010675031,0.0027990912,0.0030048315,0.0017184345,0.010957283],"category_scores_gemma":[0.005809124,0.00084209046,0.0011939359,0.0022458052,0.0006825419,0.002373691,0.0023946534,0.0042417683,0.0024537467],"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.0007964123,0.000855046,0.0006285053,0.0003209145,0.000085957014,0.0001302787,0.00019386901,0.48009712,0.0049529397,0.058329877,0.026783219,0.42682594],"study_design_scores_gemma":[0.00006982725,0.000061048915,0.00006460491,0.000015588546,0.0000113717,0.000034269415,0.00002629588,0.98382586,0.0008532375,0.013347631,0.0016794131,0.000010851159],"about_ca_topic_score_codex":0.0036758888,"about_ca_topic_score_gemma":0.0058787162,"teacher_disagreement_score":0.010957283,"about_ca_system_score_codex":0.0015367138,"about_ca_system_score_gemma":0.0027170146,"threshold_uncertainty_score":0.036655724},"labels":[],"label_agreement":null},{"id":"W2087012565","doi":"10.2178/jsl/1203350791","title":"Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i>","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":69,"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":"Hierarchy; Polynomial hierarchy; Mathematics; Combinatorics; Time complexity; P versus NP problem; Polynomial; Discrete mathematics; Computational complexity theory; Algorithm","score_opus":0.02375080234186978,"score_gpt":0.2625584848825566,"score_spread":0.23880768254068685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087012565","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.5140052,0.0006254839,0.29339567,0.012489181,0.00070686045,0.00058240263,0.0013791512,0.0035638113,0.17325228],"genre_scores_gemma":[0.97509116,0.00020017338,0.020699179,0.0009166394,0.00021967769,0.00012386947,0.0003906115,0.00021192104,0.0021467742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99366826,0.0016032517,0.00037989902,0.0009338428,0.0019699393,0.0014448777],"domain_scores_gemma":[0.9372201,0.04840246,0.0025821326,0.0040003383,0.005286145,0.002508889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048298435,0.00045606302,0.0006028885,0.0011361138,0.002968576,0.0036502925,0.0018350615,0.001486064,0.008770843],"category_scores_gemma":[0.028663777,0.00073836173,0.0013333757,0.0007513343,0.007456217,0.007864632,0.0041897176,0.005457566,0.00068308495],"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.00064761634,0.00037793093,0.006042557,0.000462007,0.00014358484,0.0027634345,0.0015933192,0.007859513,0.013665409,0.9346552,0.00970693,0.022082586],"study_design_scores_gemma":[0.00020079821,0.00015701377,0.0043341275,0.0000935491,0.00010675739,0.0010297073,0.001050924,0.02379804,0.0250147,0.93485266,0.009283664,0.00007799119],"about_ca_topic_score_codex":0.0024460405,"about_ca_topic_score_gemma":0.002326662,"teacher_disagreement_score":0.008770843,"about_ca_system_score_codex":0.0020189015,"about_ca_system_score_gemma":0.0017571277,"threshold_uncertainty_score":0.0293414},"labels":[],"label_agreement":null},{"id":"W2089329646","doi":"10.1016/s0167-6377(00)00059-6","title":"Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks","year":2000,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","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 British Columbia","funders":"","keywords":"Unimodular matrix; Oracle; Linear programming; Mathematics; Polynomial; Convergence (economics); Time complexity; Algorithm; Construct (python library); Computer science; Mathematical optimization; Discrete mathematics","score_opus":0.07014629511236242,"score_gpt":0.3576475601690094,"score_spread":0.28750126505664697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089329646","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.31840208,0.0018459476,0.5807339,0.014447163,0.00066688634,0.0002666501,0.0028654425,0.0054869363,0.075285],"genre_scores_gemma":[0.8927202,0.0008941451,0.082577646,0.0017671898,0.0008490118,0.00019322276,0.0024821975,0.001402501,0.017113965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922043,0.0014610433,0.0004231299,0.002206163,0.0020328432,0.0016724902],"domain_scores_gemma":[0.9361299,0.043916024,0.0040984447,0.010152914,0.0032301543,0.0024724929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045519136,0.0017710684,0.0035056134,0.0010203224,0.0020396584,0.0071957093,0.004233995,0.0027732407,0.018426813],"category_scores_gemma":[0.03835203,0.0011005438,0.0020614385,0.0020572972,0.003667364,0.022264553,0.00422103,0.007077055,0.0027784084],"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.0072613624,0.0009989283,0.007977693,0.0017137346,0.00035492764,0.00053225894,0.000664016,0.06682755,0.03051111,0.6749957,0.03425476,0.17390794],"study_design_scores_gemma":[0.00027159392,0.0002786297,0.0017334808,0.00006975116,0.00016304613,0.0010218703,0.00019531773,0.13447659,0.021120816,0.83317536,0.007407538,0.00008604941],"about_ca_topic_score_codex":0.0010731325,"about_ca_topic_score_gemma":0.0015453169,"teacher_disagreement_score":0.018426813,"about_ca_system_score_codex":0.0027185848,"about_ca_system_score_gemma":0.0031154526,"threshold_uncertainty_score":0.06164378},"labels":[],"label_agreement":null},{"id":"W2090968858","doi":"10.1007/s00493-014-3035-1","title":"On the monotonicity of a data stream","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Subsequence; Combinatorics; Omega; Upper and lower bounds; Monotonic function; Alphabet; Space (punctuation); Binary logarithm; Discrete mathematics; Mathematical analysis","score_opus":0.04818908662102291,"score_gpt":0.26956434263017376,"score_spread":0.22137525600915084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090968858","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.17726533,0.0018214404,0.768139,0.011667212,0.00031305218,0.00017064804,0.0014134684,0.0008242566,0.038385652],"genre_scores_gemma":[0.75893563,0.0026873301,0.21903855,0.0018967971,0.0010909016,0.00033614555,0.0015021298,0.0007248007,0.013787678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99528176,0.0015552321,0.00044014002,0.00087849627,0.0013404662,0.00050383055],"domain_scores_gemma":[0.92432207,0.057795472,0.0028438813,0.0074635106,0.0057050786,0.0018700678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055063306,0.00078679953,0.0015799971,0.003031381,0.00238876,0.005111076,0.002587593,0.0018848493,0.008359399],"category_scores_gemma":[0.05124144,0.0010637454,0.001579379,0.0040310286,0.005572799,0.02652438,0.0043449122,0.0052917902,0.0010663967],"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.00029433792,0.00009791743,0.0026686804,0.0002156213,0.000030808264,0.00019359494,0.00055320736,0.010192391,0.0022371358,0.94497347,0.0044352775,0.034107488],"study_design_scores_gemma":[0.000036977504,0.000047161087,0.00058544334,0.000058658843,0.000035477253,0.00029930891,0.00014823154,0.08645578,0.0019571548,0.9053182,0.005030032,0.000027572643],"about_ca_topic_score_codex":0.0033708133,"about_ca_topic_score_gemma":0.0019891758,"teacher_disagreement_score":0.008359399,"about_ca_system_score_codex":0.0023003148,"about_ca_system_score_gemma":0.0022002575,"threshold_uncertainty_score":0.029120624},"labels":[],"label_agreement":null},{"id":"W2091923232","doi":"10.1007/s00453-009-9334-z","title":"Location-Oblivious Distributed Unit Disk Graph Coloring","year":2009,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","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":"Carleton University","funders":"","keywords":"Graph coloring; Unit disk; Unit disk graph; Combinatorics; Edge coloring; Upper and lower bounds; Computer science; Graph; Chromatic scale; Fractional coloring; List coloring; Theory of computation; Mathematics; Discrete mathematics; Graph power; Algorithm; Line graph","score_opus":0.019290585026594205,"score_gpt":0.250780344982305,"score_spread":0.2314897599557108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091923232","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.19586238,0.0006838365,0.7681898,0.0036527915,0.00031846223,0.00044300375,0.0013939698,0.005333417,0.024122361],"genre_scores_gemma":[0.8216378,0.0002878151,0.1603602,0.00046232506,0.00016815506,0.00032342612,0.0008578791,0.00065146945,0.015250959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696004,0.0009908987,0.00011015835,0.0006503655,0.00067423173,0.0006143108],"domain_scores_gemma":[0.9864741,0.0065549314,0.00084871374,0.004620458,0.00078496296,0.00071683544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019370293,0.0009855593,0.0023810635,0.0008898303,0.00248977,0.0034661682,0.005478843,0.0019666343,0.01075148],"category_scores_gemma":[0.012096248,0.00089481723,0.0008205801,0.0031225514,0.0017401528,0.006610766,0.005368167,0.0023384597,0.0020818184],"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.0034587698,0.0011369854,0.0032766527,0.000789955,0.00016258373,0.00025037903,0.0007612806,0.5958901,0.0119563835,0.20084225,0.040642753,0.14083198],"study_design_scores_gemma":[0.0003015478,0.0000929655,0.0003787453,0.00001591991,0.00006427243,0.00009564471,0.0001627426,0.85087574,0.004021535,0.1414253,0.0025417767,0.000023892166],"about_ca_topic_score_codex":0.004120948,"about_ca_topic_score_gemma":0.0075408295,"teacher_disagreement_score":0.01075148,"about_ca_system_score_codex":0.0038605572,"about_ca_system_score_gemma":0.0045502763,"threshold_uncertainty_score":0.03596729},"labels":[],"label_agreement":null},{"id":"W2093259407","doi":"10.1016/s0166-218x(02)00598-x","title":"Approximating covering integer programs with multiplicity constraints","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":25,"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":"Multiplicity (mathematics); Multiplicative function; Mathematics; Row and column spaces; Integer (computer science); Combinatorics; Linear programming relaxation; Discrete mathematics; Row; Integer programming; Mathematical optimization; Mathematical analysis; Computer science","score_opus":0.02111996281326427,"score_gpt":0.2295895729394317,"score_spread":0.2084696101261674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093259407","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.36321586,0.0009478929,0.60512346,0.0015409573,0.0001727478,0.0001844988,0.000550328,0.0019766376,0.026287643],"genre_scores_gemma":[0.74312,0.00044033577,0.24751124,0.00030064484,0.00014811692,0.00024601838,0.0010801493,0.00067612843,0.0064772847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981187,0.0006321793,0.000079193866,0.00032673002,0.000448069,0.00039505048],"domain_scores_gemma":[0.98902076,0.0084371315,0.00070071325,0.0010877812,0.00041474967,0.00033882115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020240934,0.0016270648,0.0017567739,0.0012539154,0.0008282425,0.0031635934,0.0024540375,0.0018944183,0.0068723937],"category_scores_gemma":[0.018130874,0.0011898244,0.0012051844,0.00298251,0.0012708422,0.005604995,0.0026281984,0.0027040925,0.0006933556],"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.0005141372,0.000234507,0.0024016541,0.0001934005,0.00005939628,0.00016715373,0.00021469781,0.83485234,0.0018061807,0.07497461,0.0054944926,0.07908741],"study_design_scores_gemma":[0.00002709739,0.000038800714,0.00011378851,0.000013490694,0.000015183134,0.000042619242,0.00004897928,0.9553906,0.00067110226,0.04282653,0.00080717914,0.000004758596],"about_ca_topic_score_codex":0.0035603768,"about_ca_topic_score_gemma":0.0045521082,"teacher_disagreement_score":0.0068723937,"about_ca_system_score_codex":0.002689035,"about_ca_system_score_gemma":0.001511086,"threshold_uncertainty_score":0.022990406},"labels":[],"label_agreement":null},{"id":"W2093513625","doi":"10.1088/1742-6596/256/1/012006","title":"Mapping the MPM maximum flow algorithm on GPUs","year":2010,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Complexity and Algorithms in Graphs","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 Manitoba","funders":"","keywords":"Computer science; Speedup; Parallel computing; Exploit; CUDA; Parallelism (grammar); General-purpose computing on graphics processing units; Focus (optics); Algorithm; Computer graphics (images); Graphics","score_opus":0.03487252931024505,"score_gpt":0.24144227632260765,"score_spread":0.20656974701236258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093513625","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.18326211,0.00036973125,0.78898126,0.00072425563,0.0001679169,0.00010916613,0.00020116773,0.0034848896,0.022699514],"genre_scores_gemma":[0.5046184,0.00018770061,0.48797706,0.00011172962,0.000052279996,0.00011147195,0.00026025352,0.00024855766,0.0064325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997943,0.000042432202,0.000009394252,0.000032841675,0.00008288299,0.000038206705],"domain_scores_gemma":[0.9996111,0.00015744347,0.000026755552,0.00009298615,0.00009062835,0.000020990261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002873465,0.00042030108,0.00050229335,0.0005998417,0.0005877656,0.00070845854,0.0009935957,0.0006861688,0.004382861],"category_scores_gemma":[0.0023411335,0.0003394414,0.00041100287,0.0008614787,0.00041513605,0.00089518813,0.0008659117,0.00055327703,0.0005533208],"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.00036735676,0.00016892438,0.0022073842,0.00017076345,0.00004594379,0.00034304857,0.00025552508,0.5954615,0.021333138,0.039821703,0.010435917,0.32938874],"study_design_scores_gemma":[0.000017684619,0.000020951715,0.00017912433,0.0000036320498,0.0000022185154,0.00003187621,0.000015918593,0.9868226,0.0022982205,0.008020453,0.0025836583,0.0000036316583],"about_ca_topic_score_codex":0.010268471,"about_ca_topic_score_gemma":0.009943777,"teacher_disagreement_score":0.010268471,"about_ca_system_score_codex":0.0007961156,"about_ca_system_score_gemma":0.00087148696,"threshold_uncertainty_score":0.020417392},"labels":[],"label_agreement":null},{"id":"W2096411231","doi":"10.1007/s10107-005-0668-2","title":"Optimal 3-terminal cuts and linear programming","year":2005,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":37,"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; Carleton University","funders":"","keywords":"Mathematics; Minimum weight; Linear programming relaxation; Linear programming; Terminal (telecommunication); Combinatorics; Maximum cut; Minimum cut; Relaxation (psychology); Approximation algorithm; Mathematical optimization; Undirected graph; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Computer science","score_opus":0.027349089847701694,"score_gpt":0.28497923140448495,"score_spread":0.25763014155678327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096411231","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.064002395,0.001794872,0.8764941,0.00367561,0.00026064838,0.0001032777,0.00044840062,0.00034941692,0.0528713],"genre_scores_gemma":[0.5128234,0.0026659807,0.4438509,0.0012454217,0.0006605244,0.00041971356,0.0013738079,0.0005151873,0.036445044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843293,0.0006241502,0.00005197238,0.00026983174,0.00037827718,0.00024283153],"domain_scores_gemma":[0.9937848,0.004876372,0.00042352066,0.0003328014,0.00031586955,0.00026671862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018029056,0.0011540332,0.0014691442,0.0014662265,0.0013656932,0.0051482785,0.002203279,0.0023244417,0.0123492135],"category_scores_gemma":[0.011670004,0.0011599903,0.0013724373,0.002832178,0.0029116813,0.0072155446,0.002095815,0.006916744,0.0013327713],"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.000121983845,0.00010312765,0.00027705508,0.00015486211,0.000025692298,0.00004621122,0.00014254531,0.07931405,0.0006733469,0.88683474,0.0074666315,0.024839878],"study_design_scores_gemma":[0.000015537522,0.000010027377,0.00009315386,0.000022655824,0.000006495083,0.000022116297,0.00002876013,0.085132234,0.00022272025,0.912868,0.001570402,0.000007910409],"about_ca_topic_score_codex":0.0025349208,"about_ca_topic_score_gemma":0.0030318205,"teacher_disagreement_score":0.0123492135,"about_ca_system_score_codex":0.003109184,"about_ca_system_score_gemma":0.0014460614,"threshold_uncertainty_score":0.041312277},"labels":[],"label_agreement":null},{"id":"W2097734862","doi":"10.1007/978-3-319-14974-5_3","title":"Constant Approximation for Broadcasting in k-cycle Graph","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Concordia University","funders":"","keywords":"Combinatorics; Computer science; Time complexity; Vertex (graph theory); Discrete mathematics; Graph; Butterfly graph; Mathematics; Line graph; Voltage graph","score_opus":0.043736498008255215,"score_gpt":0.2718830829612063,"score_spread":0.22814658495295106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097734862","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.17536254,0.00869865,0.6910919,0.009614012,0.0012149512,0.00078513427,0.00439808,0.0094671175,0.09936754],"genre_scores_gemma":[0.59152085,0.0053586676,0.34994364,0.0017862968,0.0009955654,0.0010198115,0.0052099125,0.0025215915,0.04164368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779594,0.0003784543,0.00007565737,0.0005705632,0.00063455064,0.0005448089],"domain_scores_gemma":[0.9936492,0.0037749854,0.00028820432,0.001446401,0.00039359572,0.00044757186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015529187,0.0026388564,0.002951695,0.0019254888,0.0021621182,0.0044197543,0.007440153,0.0029331925,0.022029871],"category_scores_gemma":[0.010665716,0.0010328164,0.002051738,0.0057423627,0.0022585692,0.009922023,0.003983783,0.0055933874,0.0045541697],"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.002636325,0.0009261417,0.0019015431,0.0022666727,0.00029700308,0.00026995593,0.001059031,0.26063418,0.012261985,0.32073647,0.11033007,0.28668073],"study_design_scores_gemma":[0.0004215442,0.0001630342,0.00068296376,0.00018482964,0.00025364547,0.00034628616,0.0002685662,0.53800327,0.0041448465,0.44039965,0.015070435,0.0000609248],"about_ca_topic_score_codex":0.010175026,"about_ca_topic_score_gemma":0.011803627,"teacher_disagreement_score":0.022029871,"about_ca_system_score_codex":0.008288694,"about_ca_system_score_gemma":0.004689132,"threshold_uncertainty_score":0.07369727},"labels":[],"label_agreement":null},{"id":"W2098907131","doi":"10.1007/s00453-007-9013-x","title":"Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"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":"Steiner tree problem; Combinatorics; Mathematics; Vertex (graph theory); Approximation algorithm; Integer (computer science); Graph; Theory of computation; Tree (set theory); Binary logarithm; Discrete mathematics; Algorithm; Computer science","score_opus":0.011891468417320541,"score_gpt":0.23298884474574888,"score_spread":0.22109737632842835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098907131","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.5847876,0.0044210874,0.36162156,0.006188586,0.00037645458,0.00029127116,0.0028443476,0.002176259,0.037292767],"genre_scores_gemma":[0.8057961,0.0015358703,0.17456414,0.0007803137,0.00031054873,0.00017297352,0.0034667295,0.0008360646,0.01253722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983525,0.00043751867,0.00007719688,0.00032225455,0.00039907443,0.00041137738],"domain_scores_gemma":[0.98866653,0.0070751165,0.00081749697,0.0017781956,0.0007256276,0.00093707273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002361901,0.001979289,0.00302887,0.0021540166,0.0016103404,0.0043388065,0.0045483373,0.0033095384,0.014646826],"category_scores_gemma":[0.021153536,0.0014824768,0.0017661317,0.004476363,0.0021315687,0.010631735,0.0039696707,0.0039524627,0.0021722629],"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.0036465917,0.0010755117,0.012664821,0.0013424674,0.00028378295,0.00058764307,0.0009980313,0.48454288,0.007178374,0.26539743,0.053990256,0.16829225],"study_design_scores_gemma":[0.00017374581,0.0001274215,0.00092442933,0.0000663368,0.00011427851,0.00022196354,0.0003019248,0.6763538,0.0012986388,0.31739086,0.0030005758,0.000026079388],"about_ca_topic_score_codex":0.0041834675,"about_ca_topic_score_gemma":0.00963479,"teacher_disagreement_score":0.014646826,"about_ca_system_score_codex":0.003486985,"about_ca_system_score_gemma":0.0022379425,"threshold_uncertainty_score":0.048998535},"labels":[],"label_agreement":null},{"id":"W2099335235","doi":"10.1007/s10107-007-0106-8","title":"Approximation algorithms for general packing problems and their application to the multicast congestion problem","year":2007,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","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":"McMaster University","funders":"","keywords":"Multicast; Solver; Approximation algorithm; Mathematics; Block (permutation group theory); Steiner tree problem; Logarithm; Combinatorics; Regular polygon; Algorithm; Discrete mathematics; Mathematical optimization; Computer science","score_opus":0.04118625576138175,"score_gpt":0.2885665262119343,"score_spread":0.24738027045055255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099335235","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.016368134,0.003772407,0.9655235,0.0024714107,0.00034580412,0.00010717233,0.00015638307,0.00033940654,0.010915784],"genre_scores_gemma":[0.24524817,0.0069236797,0.730673,0.001021199,0.0018969816,0.0006985887,0.00070881646,0.0005748604,0.0122546395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997003,0.0014289138,0.00012572,0.0003516864,0.00076548895,0.0003251473],"domain_scores_gemma":[0.9773284,0.018515946,0.0012029639,0.0014061605,0.0010656755,0.0004808608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006679699,0.0021120661,0.0024711534,0.0035786936,0.0017366052,0.0049045444,0.0041194432,0.004255189,0.0063250456],"category_scores_gemma":[0.041220576,0.0014656397,0.0028673671,0.0077937073,0.0029828772,0.009262809,0.003547474,0.007875432,0.0009225691],"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.0002645025,0.00035343145,0.0010715463,0.00034547475,0.00010709865,0.00007751711,0.00035603245,0.38518324,0.00081998983,0.4734344,0.014152573,0.12383416],"study_design_scores_gemma":[0.000042008858,0.000026792346,0.00017095137,0.000037646692,0.00002825661,0.000060589406,0.000045492987,0.7045528,0.0002272934,0.29209056,0.0027004094,0.00001717096],"about_ca_topic_score_codex":0.004168595,"about_ca_topic_score_gemma":0.004230979,"teacher_disagreement_score":0.006679699,"about_ca_system_score_codex":0.004269031,"about_ca_system_score_gemma":0.002383222,"threshold_uncertainty_score":0.035326064},"labels":[],"label_agreement":null},{"id":"W2100899479","doi":"10.1109/icccn.2005.1523811","title":"A simple method for balancing network utilization and quality of routing","year":2006,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Alberta","funders":"","keywords":"Computer science; Routing (electronic design automation); Equal-cost multi-path routing; Path (computing); Shortest path problem; Simple (philosophy); Mathematical optimization; Static routing; Variation (astronomy); Path length; Computer network; Mathematics; Routing protocol; Theoretical computer science","score_opus":0.07856902607221865,"score_gpt":0.3529619154026413,"score_spread":0.27439288933042266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100899479","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.011012611,0.00009039226,0.9849209,0.0002835507,0.000089212816,0.0002276891,0.000037242495,0.0006193524,0.0027190412],"genre_scores_gemma":[0.22743611,0.000119551274,0.76472783,0.00020418035,0.00009174387,0.0006529878,0.000087720786,0.00028412102,0.006395654],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970106,0.00072160334,0.00016086259,0.0005399474,0.0013726057,0.0001943633],"domain_scores_gemma":[0.99521756,0.0014811128,0.0005306153,0.0017273566,0.00077152957,0.00027184916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002382838,0.001446759,0.0011493203,0.0017834269,0.001088216,0.0015425693,0.0024713648,0.0012925995,0.0040878817],"category_scores_gemma":[0.011127138,0.000512883,0.0006602404,0.0015996074,0.0017942113,0.0028381273,0.0027941666,0.0020200922,0.0010045207],"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.0006246171,0.00050496036,0.0017236974,0.00041086908,0.00015248985,0.00017317684,0.0003513327,0.14562523,0.108648315,0.2040083,0.009626435,0.5281506],"study_design_scores_gemma":[0.00023289533,0.0004653937,0.0010264041,0.000040836625,0.00007502772,0.00057315576,0.000072743576,0.85661244,0.042895794,0.07391515,0.023981012,0.000109222696],"about_ca_topic_score_codex":0.0005170129,"about_ca_topic_score_gemma":0.0010793406,"teacher_disagreement_score":0.0040878817,"about_ca_system_score_codex":0.0015827662,"about_ca_system_score_gemma":0.0016366014,"threshold_uncertainty_score":0.013675392},"labels":[],"label_agreement":null},{"id":"W2102501261","doi":"10.1007/978-3-642-13036-6_9","title":"On Generalizations of Network Design Problems with Degree Bounds","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"","keywords":"Rounding; Spanning tree; Degree (music); Matroid; Computer science; Relaxation (psychology); Combinatorial optimization; Mathematical optimization; Intersection (aeronautics); Network planning and design; Algorithm; Mathematics; Discrete mathematics","score_opus":0.04049474481597431,"score_gpt":0.2365318855826842,"score_spread":0.1960371407667099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102501261","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.06632829,0.008933495,0.82143176,0.00829212,0.0010501316,0.0002517126,0.0008440475,0.0003961948,0.092472225],"genre_scores_gemma":[0.6024093,0.02137503,0.29219282,0.0033422236,0.0062015867,0.0008867568,0.0025908148,0.0008083528,0.07019306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968828,0.0014594671,0.00014616197,0.0006325226,0.00056817534,0.00031087542],"domain_scores_gemma":[0.98202723,0.014007771,0.001011643,0.0014995753,0.0006329704,0.0008207949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00465077,0.0028599275,0.002564447,0.0027101494,0.0017150979,0.0035310276,0.004148528,0.0033924538,0.009877355],"category_scores_gemma":[0.02414409,0.0016016893,0.0034001814,0.004961188,0.0033016456,0.011769719,0.004826349,0.008070607,0.0009125737],"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.0000960145,0.00012522844,0.0005325374,0.0003322848,0.000066918685,0.00013895553,0.00024048479,0.097678475,0.0005592751,0.8582147,0.012473469,0.02954171],"study_design_scores_gemma":[0.000020437554,0.000016688296,0.00012221134,0.0000457012,0.000022655473,0.0000613747,0.000040553863,0.07475651,0.00010815787,0.92040306,0.00439241,0.000010267361],"about_ca_topic_score_codex":0.002528689,"about_ca_topic_score_gemma":0.0024824666,"teacher_disagreement_score":0.009877355,"about_ca_system_score_codex":0.0030599802,"about_ca_system_score_gemma":0.0010480104,"threshold_uncertainty_score":0.033043027},"labels":[],"label_agreement":null},{"id":"W2103941607","doi":"","title":"Connectivity of Addable Monotone Graph Classes","year":2007,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Monotone polygon; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.02192203775542063,"score_gpt":0.264636965118337,"score_spread":0.2427149273629164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103941607","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.9227008,0.00021348486,0.062857814,0.00093352684,0.000028788561,0.000114414914,0.0007018114,0.0002294825,0.012219883],"genre_scores_gemma":[0.9897962,0.00012436343,0.007231596,0.00015746774,0.00010305342,0.00015288036,0.0005930171,0.000046497946,0.0017950594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764735,0.0005225911,0.00011761985,0.00066683604,0.0006876928,0.00035798707],"domain_scores_gemma":[0.9757808,0.015257067,0.003316719,0.0019697526,0.0014520694,0.002223601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015008943,0.00046146815,0.00075384043,0.0027386216,0.0017759891,0.0026488197,0.0016877395,0.0014718174,0.006686527],"category_scores_gemma":[0.018537926,0.0005600605,0.0008286826,0.00089792995,0.002632564,0.0039186785,0.0027079722,0.0017082797,0.00039556724],"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.001633959,0.00038230722,0.05839154,0.00046062312,0.00018932043,0.0007777472,0.002367465,0.03328978,0.01861043,0.81681836,0.006540051,0.060538486],"study_design_scores_gemma":[0.00016527329,0.00034293727,0.014398708,0.00009023985,0.00010547513,0.0019507011,0.0005351388,0.25333744,0.0058147996,0.71574104,0.0074492423,0.000069022426],"about_ca_topic_score_codex":0.00080110243,"about_ca_topic_score_gemma":0.00083672674,"teacher_disagreement_score":0.006686527,"about_ca_system_score_codex":0.0013004699,"about_ca_system_score_gemma":0.00043361477,"threshold_uncertainty_score":0.02236873},"labels":[],"label_agreement":null},{"id":"W2105487310","doi":"10.1002/cpe.700","title":"Parallel computation on interval graphs: algorithms and experiments","year":2002,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Complexity and Algorithms in Graphs","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":"Dalhousie University","funders":"","keywords":"Computer science; Myrinet; Clique; Parallel computing; Interval (graph theory); Algorithm; Parallel algorithm; Interval graph; Interconnection; Computation; Graph; Implementation; Theoretical computer science; Mathematics; Chordal graph; Message passing; Combinatorics","score_opus":0.06738285749543127,"score_gpt":0.34179044454621843,"score_spread":0.27440758705078716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105487310","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.9031242,0.0010975176,0.06720021,0.0006563131,0.00017842575,0.0004320344,0.0014426316,0.004963721,0.020905044],"genre_scores_gemma":[0.90829563,0.00044925438,0.087780185,0.00008335298,0.00003572247,0.00024870274,0.0012903949,0.00027707036,0.0015396152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740463,0.0010257708,0.00018381745,0.00041216137,0.00066400034,0.00030957832],"domain_scores_gemma":[0.9883553,0.0074556875,0.00042398056,0.002315757,0.0010575312,0.0003916888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002618508,0.000938979,0.00095822517,0.0009708678,0.0009704303,0.0008696848,0.0019656182,0.0009423366,0.004581391],"category_scores_gemma":[0.009860748,0.00039876084,0.0005419561,0.003482087,0.0010207731,0.0018610131,0.0012613408,0.0012844574,0.0006151722],"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.0033466872,0.00251566,0.0035411073,0.00066729344,0.00018824298,0.0002710802,0.00043382906,0.819559,0.009603524,0.018808194,0.013234158,0.12783132],"study_design_scores_gemma":[0.00062189315,0.0004790687,0.0010470485,0.00001837914,0.000035048928,0.000066884815,0.00015040762,0.97401345,0.008956531,0.011705885,0.00288402,0.000021295424],"about_ca_topic_score_codex":0.0057564084,"about_ca_topic_score_gemma":0.0024091525,"teacher_disagreement_score":0.0057564084,"about_ca_system_score_codex":0.0011779212,"about_ca_system_score_gemma":0.0010416717,"threshold_uncertainty_score":0.0153262615},"labels":[],"label_agreement":null},{"id":"W2105659243","doi":"10.1007/978-3-642-31594-7_13","title":"Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Matroid; Submodular set function; Set function; Rank (graph theory); Maximization; Matroid partitioning; Combinatorics; Function (biology); Set (abstract data type); Weighted matroid; Computer science; Mathematics; Online algorithm; Competitive analysis; Constraint (computer-aided design); Discrete mathematics; Mathematical optimization; Algorithm; Graphic matroid; Upper and lower bounds","score_opus":0.03343926846114101,"score_gpt":0.2580674556177863,"score_spread":0.22462818715664531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105659243","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.006215808,0.00088190485,0.98643523,0.0005223479,0.0001269304,0.00015428667,0.00036577354,0.0013801254,0.003917536],"genre_scores_gemma":[0.13149361,0.0010664045,0.8538486,0.0004930315,0.00049970276,0.000849307,0.0018165774,0.0010160746,0.008916714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962303,0.0012543396,0.00019738189,0.00081314234,0.00094782305,0.0005569709],"domain_scores_gemma":[0.9905003,0.006199713,0.0006046208,0.0014750719,0.00082923117,0.00039099492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045541786,0.0039600786,0.004905268,0.0023201008,0.0011836591,0.005233541,0.008278825,0.0049912957,0.015374376],"category_scores_gemma":[0.019342806,0.0022743228,0.0025079015,0.00685256,0.0019739002,0.010119998,0.004689083,0.006991198,0.0051610894],"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.0007068914,0.000826979,0.0008046953,0.0007453164,0.00019650286,0.00013349146,0.00024771012,0.52496135,0.0019971216,0.09199373,0.030819,0.34656727],"study_design_scores_gemma":[0.00008350495,0.000040395997,0.00007334503,0.000028896626,0.000029941784,0.00004967489,0.000033830198,0.93543607,0.0004257323,0.0626828,0.0011011219,0.000014701793],"about_ca_topic_score_codex":0.004987705,"about_ca_topic_score_gemma":0.007784719,"teacher_disagreement_score":0.015374376,"about_ca_system_score_codex":0.0036687704,"about_ca_system_score_gemma":0.0036204997,"threshold_uncertainty_score":0.05143237},"labels":[],"label_agreement":null},{"id":"W2106960349","doi":"10.1109/reldis.1998.740525","title":"Practical parallel algorithms for minimum spanning trees","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":37,"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":"Spanning tree; Minimum spanning tree; Computer science; Undirected graph; Computation; Graph algorithms; Graph theory; Parallel algorithm; Graph; Prim's algorithm; Simple (philosophy); Algorithm; Efficient algorithm; Distributed minimum spanning tree; Combinatorics; Theoretical computer science; Mathematics","score_opus":0.13022202733975888,"score_gpt":0.3311332125426399,"score_spread":0.200911185202881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106960349","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.05534641,0.0010855467,0.92940646,0.0007959583,0.00008384819,0.00016768526,0.00011714214,0.0009283544,0.012068597],"genre_scores_gemma":[0.44887483,0.0011659865,0.54512817,0.0001657396,0.00013733367,0.00033023744,0.00045868263,0.00022106298,0.0035180359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998882,0.00039504017,0.000061908344,0.00022573868,0.00032093484,0.00011443109],"domain_scores_gemma":[0.99677163,0.0021250346,0.00024780352,0.00042443318,0.0003546451,0.00007640485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012928514,0.00082993275,0.0007047642,0.0007030865,0.00089164276,0.0011928043,0.0014492059,0.0010706879,0.004205378],"category_scores_gemma":[0.010518142,0.0004966375,0.0005013384,0.0019995607,0.00097454916,0.0034578883,0.0010099198,0.0010001374,0.0009860444],"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.00026247423,0.00022007109,0.0012781614,0.0005372863,0.00008426819,0.00016088643,0.0002570269,0.5922781,0.0057432004,0.22329265,0.009381846,0.166504],"study_design_scores_gemma":[0.000074041396,0.00006456294,0.00017628814,0.000017104407,0.000015593861,0.00013436399,0.000055447883,0.7868509,0.0016686663,0.20673452,0.0042013107,0.0000072337434],"about_ca_topic_score_codex":0.0009391042,"about_ca_topic_score_gemma":0.0012961242,"teacher_disagreement_score":0.004205378,"about_ca_system_score_codex":0.0011368641,"about_ca_system_score_gemma":0.0010229738,"threshold_uncertainty_score":0.014068365},"labels":[],"label_agreement":null},{"id":"W2107526127","doi":"10.1145/1374376.1374440","title":"The VPN conjecture is true","year":2008,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"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":"Conjecture; Combinatorics; Computer science; Routing (electronic design automation); Matrix (chemical analysis); Enhanced Data Rates for GSM Evolution; Graph theory; Set (abstract data type); Graph; Discrete mathematics; Undirected graph; Mathematics; Computer network","score_opus":0.02309272676516618,"score_gpt":0.22161664156401192,"score_spread":0.19852391479884574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107526127","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.15179588,0.003818185,0.55477875,0.071940385,0.0032996435,0.00023266736,0.0035816045,0.0018011902,0.2087517],"genre_scores_gemma":[0.8624443,0.0029712413,0.080400765,0.012063294,0.0027715305,0.00055040506,0.004112761,0.0008428651,0.03384296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969025,0.0009062969,0.00011469188,0.0009906449,0.0004608142,0.00062496535],"domain_scores_gemma":[0.98127824,0.011918414,0.0010277642,0.0035839719,0.0013910542,0.00080053345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003127855,0.0011747283,0.0020566687,0.00075782323,0.0024197304,0.0036062065,0.0031204962,0.003951147,0.027309138],"category_scores_gemma":[0.027179511,0.0009531003,0.0017974636,0.0015022204,0.004062207,0.018513506,0.0040105996,0.005687193,0.0037972918],"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.0004701876,0.00013094585,0.0016837744,0.0006052649,0.0001254809,0.00027484135,0.00030031428,0.034441534,0.00091375364,0.85831285,0.070737235,0.03200372],"study_design_scores_gemma":[0.000056487173,0.00003444184,0.00018260248,0.000045556284,0.000018138468,0.00012781828,0.00009106258,0.028188126,0.0002658635,0.96195585,0.009022649,0.000011515731],"about_ca_topic_score_codex":0.0015909584,"about_ca_topic_score_gemma":0.0015584722,"teacher_disagreement_score":0.027309138,"about_ca_system_score_codex":0.0017333251,"about_ca_system_score_gemma":0.0011373828,"threshold_uncertainty_score":0.091358185},"labels":[],"label_agreement":null},{"id":"W2107613637","doi":"","title":"Graph products revisited: Tight approximation hardness of induced matching, poset dimension and more","year":2016,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Subadditivity; Combinatorics; Bipartite graph; Partially ordered set; Mathematics; Discrete mathematics; Graph; Line graph; Matching (statistics)","score_opus":0.02192440881562315,"score_gpt":0.24638131422564905,"score_spread":0.2244569054100259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107613637","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.57083714,0.004158068,0.3660699,0.010452211,0.00038899854,0.0002151682,0.0035735152,0.0012532405,0.043051705],"genre_scores_gemma":[0.92528164,0.0015775748,0.06139924,0.0009189236,0.0005898309,0.0001962832,0.002076293,0.0003999807,0.007560355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99571335,0.0010751323,0.00023670489,0.0012960102,0.0010881562,0.0005906963],"domain_scores_gemma":[0.984026,0.010531505,0.0013124122,0.002685115,0.0005654885,0.0008795076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034271798,0.0016733133,0.0028174277,0.0016596564,0.0014305613,0.005099743,0.003741567,0.0024707338,0.011450042],"category_scores_gemma":[0.018332057,0.000956596,0.0030001642,0.004147441,0.0030817692,0.014087397,0.0032453542,0.0064289947,0.0009659317],"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.0011832137,0.0008839527,0.007911687,0.0011693586,0.0003032232,0.0004818101,0.0012831653,0.18093789,0.005565779,0.6946836,0.019956734,0.08563962],"study_design_scores_gemma":[0.00010305525,0.00019706038,0.0018206873,0.00007342606,0.000107477164,0.00053735485,0.00021648401,0.25102213,0.0031205795,0.7369532,0.005794405,0.00005404049],"about_ca_topic_score_codex":0.0020707233,"about_ca_topic_score_gemma":0.001650695,"teacher_disagreement_score":0.011450042,"about_ca_system_score_codex":0.0035264266,"about_ca_system_score_gemma":0.001596514,"threshold_uncertainty_score":0.03830427},"labels":[],"label_agreement":null},{"id":"W2107744418","doi":"10.22215/etd/2011-09053","title":"Exploring the limits of GPUs with parallel graph algorithms","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Parallel computing; Graph; Parallel algorithm; CUDA; Graphics; Graph algorithms; Computation; General-purpose computing on graphics processing units; Theoretical computer science; Algorithm; Computer graphics (images)","score_opus":0.19433218209741415,"score_gpt":0.27407355760487867,"score_spread":0.07974137550746452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107744418","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.37748688,0.032838825,0.36309838,0.029720997,0.0016966751,0.00019429179,0.00081846444,0.004794524,0.18935092],"genre_scores_gemma":[0.8210087,0.005766202,0.15522106,0.0015952766,0.00077727635,0.00018195633,0.0005015438,0.001155787,0.013792086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996487,0.0015462287,0.00010845891,0.00044393976,0.0009897704,0.00042457067],"domain_scores_gemma":[0.98167026,0.01320455,0.00042990717,0.00261203,0.0013236259,0.0007595629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003324448,0.0011614762,0.0013253904,0.0013932773,0.0011655061,0.006329369,0.003228819,0.002332781,0.0155329555],"category_scores_gemma":[0.030036658,0.0010243151,0.0008424264,0.002273573,0.0021671536,0.010164835,0.0040383674,0.0030996248,0.002304556],"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.0015024584,0.00057053834,0.008438503,0.00073990127,0.00023253834,0.0002909701,0.0006999234,0.22785154,0.006104285,0.5055296,0.04010134,0.20793846],"study_design_scores_gemma":[0.000121112156,0.00012533057,0.0006738638,0.00011426823,0.000050850434,0.000101459504,0.00018996952,0.6790228,0.0018572966,0.29565063,0.022069845,0.000022615954],"about_ca_topic_score_codex":0.0075088255,"about_ca_topic_score_gemma":0.00870621,"teacher_disagreement_score":0.0155329555,"about_ca_system_score_codex":0.0021886555,"about_ca_system_score_gemma":0.0020858957,"threshold_uncertainty_score":0.051962852},"labels":[],"label_agreement":null},{"id":"W2108031738","doi":"10.5555/1496770.1496847","title":"A logarithmic approximation for unsplittable flow on line graphs","year":2009,"lang":"en","type":"article","venue":"TU/e Research Portal (Eindhoven University of Technology)","topic":"Complexity and Algorithms in Graphs","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 Alberta","funders":"","keywords":"Rounding; Bounded function; Approximation algorithm; Mathematics; Bottleneck; Logarithm; Linear programming; Time complexity; Multiplicative function; Discrete mathematics; Mathematical optimization; Linear programming relaxation; Dynamic programming; Randomized rounding; Combinatorics; Maximum flow problem; Computer science","score_opus":0.0520818013227625,"score_gpt":0.30581168286373545,"score_spread":0.2537298815409729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108031738","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.15821499,0.0026149387,0.78662056,0.0054486357,0.00035765296,0.0005021187,0.002995217,0.008958775,0.03428712],"genre_scores_gemma":[0.5843423,0.0012455824,0.3920254,0.0014888118,0.00027475637,0.0004528032,0.004666862,0.0015339842,0.013969412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982262,0.00045868586,0.000054665157,0.00040399865,0.00029073993,0.0005657884],"domain_scores_gemma":[0.99651426,0.0022297017,0.00033986117,0.00047450434,0.00017931523,0.00026238928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001551067,0.0023608205,0.001739169,0.0011009559,0.0011419164,0.0030276608,0.0033885497,0.0018538295,0.012633737],"category_scores_gemma":[0.006825274,0.00079551,0.0011983276,0.0023954054,0.0012717509,0.0074853306,0.001868584,0.0034104867,0.0024817844],"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.0014898189,0.0007634699,0.0012223041,0.00064433814,0.00010363696,0.0002838693,0.0003496712,0.7913257,0.0054517067,0.058664244,0.03024806,0.10945319],"study_design_scores_gemma":[0.00014990242,0.00012616947,0.00018043167,0.000037502563,0.000019292482,0.0000997254,0.00009054954,0.9167208,0.0010907662,0.07698578,0.004482466,0.000016545098],"about_ca_topic_score_codex":0.005235118,"about_ca_topic_score_gemma":0.0060939593,"teacher_disagreement_score":0.012633737,"about_ca_system_score_codex":0.0038197504,"about_ca_system_score_gemma":0.0022215184,"threshold_uncertainty_score":0.042264044},"labels":[],"label_agreement":null},{"id":"W2109533535","doi":"10.1109/sfcs.2001.959928","title":"Tight approximation results for general covering integer programs","year":2001,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"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":"Combinatorics; Linear programming relaxation; Rounding; Multiplicative function; Approximation algorithm; Mathematics; Upper and lower bounds; Integer (computer science); Randomized rounding; Discrete mathematics; Cover (algebra); Binary logarithm; Multiplicity (mathematics); Linear programming; Algorithm; Computer science","score_opus":0.04364182730979306,"score_gpt":0.270655222080916,"score_spread":0.22701339477112298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109533535","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.03557087,0.004319563,0.9252396,0.002603069,0.00026042075,0.00020846317,0.00032525626,0.0015857719,0.0298869],"genre_scores_gemma":[0.43548667,0.004959482,0.54442954,0.0017794103,0.00072883355,0.00059032225,0.001596349,0.0009979765,0.009431366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940408,0.0015989443,0.00022968191,0.0011764627,0.0017315093,0.0012226307],"domain_scores_gemma":[0.99057066,0.006816849,0.00060629414,0.0011010806,0.0005231619,0.0003820011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057051363,0.002583004,0.002839415,0.0019299263,0.0015697135,0.00454464,0.004136028,0.0027881598,0.01038804],"category_scores_gemma":[0.025973182,0.0013754363,0.0027313968,0.004175477,0.002768021,0.008113243,0.0037305998,0.006241365,0.001764952],"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.0006559449,0.00051979214,0.0019753918,0.0007683715,0.00021247256,0.00026368978,0.0005816607,0.57478416,0.0032081422,0.29107606,0.01636633,0.10958793],"study_design_scores_gemma":[0.00006983378,0.00010171256,0.000284186,0.00007129241,0.000059804905,0.00017367271,0.000107186825,0.8463101,0.00096269127,0.14487614,0.0069670416,0.000016236076],"about_ca_topic_score_codex":0.0029838162,"about_ca_topic_score_gemma":0.0026830097,"teacher_disagreement_score":0.01038804,"about_ca_system_score_codex":0.004491955,"about_ca_system_score_gemma":0.001996252,"threshold_uncertainty_score":0.034751475},"labels":[],"label_agreement":null},{"id":"W2110504071","doi":"10.1613/jair.1815","title":"Dynamic Local Search for the Maximum Clique Problem","year":2006,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":158,"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":"Clique problem; Vertex (graph theory); Benchmark (surveying); Clique; Mathematics; Generalization; Mathematical optimization; Computer science; Algorithm; Combinatorics; Graph; Chordal graph","score_opus":0.12490418339223444,"score_gpt":0.40555843590576174,"score_spread":0.28065425251352727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110504071","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.01947948,0.0007971837,0.9714541,0.00045522008,0.00005580708,0.00013513232,0.00014145278,0.0007788165,0.006702901],"genre_scores_gemma":[0.4292706,0.0005799503,0.5614495,0.00048286896,0.00014129328,0.0006730146,0.0008916016,0.00047618724,0.006035013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987953,0.0005842615,0.000030395655,0.00022152517,0.00025513786,0.00011343494],"domain_scores_gemma":[0.9982374,0.0012188478,0.00012308845,0.00013475885,0.00015943586,0.00012654331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017257844,0.00080714165,0.0015520494,0.0011795469,0.00094516104,0.0009807298,0.0021341953,0.0014057343,0.0053288],"category_scores_gemma":[0.0056507383,0.00047877853,0.0007046427,0.0015179522,0.0011166561,0.0019163952,0.0021893138,0.0016494439,0.0009444337],"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.0001472696,0.00014212068,0.00045426603,0.0002536058,0.0000692423,0.000111174675,0.000089716414,0.86239964,0.0014146324,0.06645794,0.008497393,0.059962988],"study_design_scores_gemma":[0.0000389607,0.00003372491,0.000046981364,0.000009594865,0.0000071600907,0.00002959401,0.000015475358,0.9752516,0.0003503914,0.022386145,0.0018231645,0.0000071301497],"about_ca_topic_score_codex":0.0027071263,"about_ca_topic_score_gemma":0.004472312,"teacher_disagreement_score":0.0053288,"about_ca_system_score_codex":0.001339119,"about_ca_system_score_gemma":0.0015623991,"threshold_uncertainty_score":0.017826617},"labels":[],"label_agreement":null},{"id":"W2112263237","doi":"10.1007/978-3-540-31833-0_17","title":"Order-Preserving Transformations and Greedy-Like Algorithms","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Computer science; Greedy algorithm; Mathematical proof; Scheduling (production processes); Mathematical optimization; Graph; Class (philosophy); Set (abstract data type); Expressive power; Dominating set; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Programming language","score_opus":0.02120697823112742,"score_gpt":0.24489360703774543,"score_spread":0.22368662880661802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112263237","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.023865217,0.0008825822,0.9130878,0.0012715756,0.00030167357,0.00010412842,0.00020768492,0.0016049152,0.058674388],"genre_scores_gemma":[0.4365843,0.00228346,0.49481794,0.0010171053,0.0004886628,0.00032314722,0.0009800917,0.0011382146,0.06236719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998833,0.00033555174,0.000060511826,0.0002314639,0.000390568,0.00014898002],"domain_scores_gemma":[0.9979101,0.0010278426,0.00011910749,0.00066337263,0.0001719944,0.00010763237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009425612,0.0009362127,0.0009797259,0.0011010551,0.001116078,0.0022465,0.0017978633,0.0012458212,0.007370199],"category_scores_gemma":[0.004685855,0.0005959816,0.001307797,0.0030172893,0.0023206805,0.0046019843,0.002108942,0.003945746,0.0021262555],"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.00007905455,0.000070167625,0.00010980873,0.000083745465,0.00001606152,0.00003705276,0.0000950765,0.014622724,0.0015876807,0.90268177,0.0068636285,0.073753305],"study_design_scores_gemma":[0.000019387026,0.000017619663,0.000043147946,0.000006959728,0.000007519543,0.000059738115,0.000018789511,0.02266952,0.0012967959,0.97001183,0.0058405176,0.0000082241695],"about_ca_topic_score_codex":0.0007680027,"about_ca_topic_score_gemma":0.00089127955,"teacher_disagreement_score":0.007370199,"about_ca_system_score_codex":0.0011843764,"about_ca_system_score_gemma":0.0009497535,"threshold_uncertainty_score":0.02465576},"labels":[],"label_agreement":null},{"id":"W2112512535","doi":"10.1145/1183278.1183283","title":"The strength of replacement in weak arithmetic","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"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":"Mathematics; Bounded function; Discrete mathematics; Class (philosophy); Axiom; Combinatorics; Complexity class; Polynomial; Integer (computer science); Quantifier (linguistics); Quantifier elimination; P; Time complexity; Computer science","score_opus":0.02121284245199038,"score_gpt":0.25849239291829507,"score_spread":0.2372795504663047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112512535","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.21239434,0.0023524691,0.6196578,0.006577998,0.00065123424,0.00017778354,0.00067260285,0.0017385005,0.1557772],"genre_scores_gemma":[0.91491455,0.0005987988,0.07110613,0.0012625516,0.00039915464,0.0001693449,0.00035932928,0.0001860149,0.0110041825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99158055,0.0022013916,0.0008002331,0.0018625932,0.0026641043,0.00089109736],"domain_scores_gemma":[0.9880377,0.0062362663,0.0006808648,0.0029457023,0.0015679189,0.0005315354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059289862,0.00069846,0.0009807377,0.0020496265,0.0027906692,0.0054113255,0.0023407436,0.0019907563,0.004647048],"category_scores_gemma":[0.0119416835,0.0013410067,0.0023332138,0.0012862111,0.012877796,0.0123562645,0.008455612,0.0064027198,0.0010036735],"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.000041214782,0.000008597606,0.00052294304,0.00007886894,0.000018913533,0.00005163673,0.0003065296,0.0006899486,0.0010742812,0.99196965,0.00061474304,0.0046226275],"study_design_scores_gemma":[0.00003568919,0.00010788854,0.0005474772,0.000058466194,0.000053478983,0.00017004584,0.0002202965,0.007133517,0.0040474143,0.9736022,0.013984095,0.00003935929],"about_ca_topic_score_codex":0.0017843506,"about_ca_topic_score_gemma":0.0013227938,"teacher_disagreement_score":0.0059289862,"about_ca_system_score_codex":0.00267965,"about_ca_system_score_gemma":0.0017206954,"threshold_uncertainty_score":0.031355917},"labels":[],"label_agreement":null},{"id":"W2112983578","doi":"10.1287/mnsc.2020.3820","title":"Maximizing Sequence-Submodular Functions and Its Application to Online Advertising","year":2021,"lang":"en","type":"preprint","venue":"Management Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"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":"Submodular set function; Sequence (biology); Monotonic function; Greedy algorithm; Rewriting; Function (biology); Computer science; Mathematical optimization; Class (philosophy); Simple (philosophy); Online algorithm; Time complexity; Mathematics; Algorithm; Artificial intelligence","score_opus":0.04135716981506005,"score_gpt":0.28827301518375703,"score_spread":0.24691584536869698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112983578","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.019742427,0.0013021638,0.970096,0.0011642937,0.00006484159,0.0000832176,0.00009821902,0.00038459216,0.007064338],"genre_scores_gemma":[0.49776545,0.002598817,0.49055097,0.00063325843,0.00037176433,0.0004021207,0.0003232442,0.00035133466,0.0070030377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980866,0.0010690191,0.0000650036,0.0002939406,0.00032351728,0.00016204218],"domain_scores_gemma":[0.99162745,0.0068386826,0.00041388985,0.0004435058,0.00047099416,0.00020557205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038365652,0.0015652776,0.001766584,0.0011445835,0.0005928018,0.001469951,0.0015474991,0.0013282683,0.0023013602],"category_scores_gemma":[0.012695466,0.00061255024,0.0009664821,0.0022199156,0.0015555959,0.0037118702,0.0014200561,0.0030144406,0.00055494066],"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.0001885186,0.00030776064,0.0009826706,0.00038679698,0.000088144465,0.00013978312,0.00023705442,0.5499175,0.00503922,0.303868,0.008523516,0.13032107],"study_design_scores_gemma":[0.000017929975,0.00005492399,0.00015841909,0.000013993339,0.0000124549115,0.00005304847,0.000018170138,0.88390905,0.0014383878,0.11240487,0.0019051789,0.000013577021],"about_ca_topic_score_codex":0.0020401292,"about_ca_topic_score_gemma":0.0015453898,"teacher_disagreement_score":0.0038365652,"about_ca_system_score_codex":0.002518169,"about_ca_system_score_gemma":0.0019007528,"threshold_uncertainty_score":0.020289958},"labels":[],"label_agreement":null},{"id":"W2113703646","doi":"","title":"On the nonexistence of dimension reduction for $\\ell2_2$ metrics.","year":2008,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Complexity and Algorithms in Graphs","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":"Mathematics; Dimension (graph theory); Metric (unit); Dimensionality reduction; Combinatorics; Dimension function; Metric dimension; Reduction (mathematics); Embedding; Lemma (botany); Discrete mathematics; Effective dimension; Metric space; Euclidean distance; Hausdorff dimension; Computer science; Graph","score_opus":0.08041085738545625,"score_gpt":0.2616961247978016,"score_spread":0.18128526741234532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113703646","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.25823528,0.0060860715,0.56346345,0.014506835,0.00073582644,0.0003168029,0.0014954788,0.0010040611,0.15415613],"genre_scores_gemma":[0.83219856,0.0031735457,0.13258827,0.0039728386,0.0007871447,0.00089931354,0.001966586,0.00072535087,0.02368843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938711,0.001977161,0.00035292265,0.0015010117,0.0016073018,0.00069045374],"domain_scores_gemma":[0.95811355,0.031902622,0.0019541308,0.0046280725,0.001979271,0.0014223534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005236193,0.0013870603,0.0017120611,0.0019524195,0.0024129131,0.003674647,0.0018938115,0.0022441393,0.007327553],"category_scores_gemma":[0.03556725,0.0011428681,0.001929988,0.0013469311,0.0070139877,0.011596159,0.0074776,0.007390956,0.0015613463],"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.00017567695,0.000051893818,0.0010525765,0.00016401525,0.000052813073,0.00012337652,0.0002742179,0.009381831,0.0016691578,0.9660157,0.00805949,0.012979346],"study_design_scores_gemma":[0.000040042138,0.00010999114,0.0012800811,0.000061168685,0.000040302,0.00041776744,0.00011539115,0.054158993,0.0021979723,0.93073165,0.0107834,0.00006332448],"about_ca_topic_score_codex":0.0017280772,"about_ca_topic_score_gemma":0.0014629748,"teacher_disagreement_score":0.007327553,"about_ca_system_score_codex":0.0026181866,"about_ca_system_score_gemma":0.0012746267,"threshold_uncertainty_score":0.02769196},"labels":[],"label_agreement":null},{"id":"W2115404728","doi":"10.1137/s0097539704443057","title":"A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover","year":2005,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":128,"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":"Environment and Climate Change Canada","keywords":"Hypergraph; Combinatorics; Vertex cover; Mathematics; Cover (algebra); Vertex (graph theory); Hardness of approximation; Constant (computer programming); Combinatorial proof; Discrete mathematics; Code (set theory); Approximation algorithm; Graph; Computer science; Set (abstract data type)","score_opus":0.014186560092182231,"score_gpt":0.24357122172902834,"score_spread":0.22938466163684612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115404728","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.20777301,0.0009128733,0.76667094,0.0040902137,0.000107634594,0.00019547886,0.0015149849,0.001656332,0.017078575],"genre_scores_gemma":[0.8306049,0.0005940212,0.16289705,0.00060956285,0.0001773886,0.00017755733,0.0008883076,0.00018632958,0.003864762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961893,0.0006205583,0.00019861679,0.0009937007,0.0013991339,0.00059872953],"domain_scores_gemma":[0.9862385,0.0075341747,0.0013454822,0.0032651892,0.0009943921,0.0006222909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018200869,0.00052392646,0.0009393329,0.0012065679,0.0014252621,0.0031430079,0.002303002,0.001524575,0.006289759],"category_scores_gemma":[0.016629515,0.00094678375,0.0014897302,0.0016577456,0.00254118,0.009352597,0.005460059,0.0038254177,0.0006529469],"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.0012054602,0.00028963896,0.008078534,0.00082570675,0.0002172603,0.00086445484,0.0007667934,0.18409869,0.03292281,0.61437654,0.012032816,0.14432122],"study_design_scores_gemma":[0.00014262919,0.00021620098,0.0023810011,0.000120907054,0.00012287655,0.0009913022,0.00013286289,0.54316217,0.020177398,0.42326638,0.00916701,0.00011937816],"about_ca_topic_score_codex":0.0033635262,"about_ca_topic_score_gemma":0.0030558985,"teacher_disagreement_score":0.006289759,"about_ca_system_score_codex":0.002711235,"about_ca_system_score_gemma":0.0021537594,"threshold_uncertainty_score":0.021041334},"labels":[],"label_agreement":null},{"id":"W2115713772","doi":"10.1016/j.disopt.2008.01.001","title":"A sequential elimination algorithm for computing bounds on the clique number of a graph","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","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":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Clique graph; Clique problem; Mathematics; Clique; Block graph; Simplex graph; Upper and lower bounds; Split graph; Branch and bound; Combinatorics; Graph; Computation; Algorithm; Discrete mathematics; Line graph; Graph power; Pathwidth","score_opus":0.03037697177775578,"score_gpt":0.28519658192086494,"score_spread":0.25481961014310917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115713772","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.012097916,0.00014966688,0.9830525,0.00020116405,0.000059071717,0.00013443768,0.00023539126,0.0008875181,0.003182351],"genre_scores_gemma":[0.1315447,0.00018574567,0.8613989,0.00016291116,0.00013140877,0.00042322834,0.0012701132,0.00040612274,0.0044768737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827874,0.0003619277,0.0000952099,0.00040241657,0.0006429474,0.00021869632],"domain_scores_gemma":[0.99303955,0.0042737103,0.00028209665,0.0012186279,0.00091154705,0.0002744831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00218727,0.0016505804,0.0017430659,0.0024972789,0.0012326104,0.0018576707,0.0031694619,0.0012787733,0.007947572],"category_scores_gemma":[0.00773118,0.0009776964,0.0014658455,0.0034475045,0.0013473372,0.0035232527,0.0024241265,0.0027679512,0.0015218657],"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.0014264556,0.0007176199,0.0024013969,0.00047010294,0.0002518146,0.00012838014,0.00024751984,0.26922482,0.016398948,0.09464179,0.018556131,0.59553504],"study_design_scores_gemma":[0.00019173171,0.00013574916,0.0006076219,0.000021434806,0.00006074715,0.00008984271,0.00003465579,0.91365176,0.0048476793,0.076217376,0.0041139033,0.000027432534],"about_ca_topic_score_codex":0.0063067754,"about_ca_topic_score_gemma":0.012231028,"teacher_disagreement_score":0.007947572,"about_ca_system_score_codex":0.0018142685,"about_ca_system_score_gemma":0.0035451287,"threshold_uncertainty_score":0.026587248},"labels":[],"label_agreement":null},{"id":"W2116060765","doi":"10.1137/090751670","title":"Dynamic Connectivity: Connecting to Networks and Geometry","year":2011,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":29,"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":"Combinatorics; Computer science; Bounded function; Vertex (graph theory); Sublinear function; Geometric networks; Discrete mathematics; Graph; Mathematics; Graph theory","score_opus":0.028243701256946273,"score_gpt":0.25872049542655406,"score_spread":0.23047679416960778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116060765","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.04405372,0.010763789,0.88547784,0.015291748,0.00068847294,0.00015109932,0.0011904052,0.0020142312,0.040368743],"genre_scores_gemma":[0.5435597,0.015813349,0.4135932,0.0021730226,0.001978334,0.00041521856,0.0028658072,0.00118164,0.018419757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977991,0.00062004954,0.000109394954,0.00064873113,0.00063592487,0.00018682163],"domain_scores_gemma":[0.9931312,0.00343341,0.0005263296,0.002098374,0.00049398514,0.00031658224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012648905,0.0009686208,0.0010345012,0.0021556069,0.0016312879,0.004889411,0.0023028322,0.001733366,0.011478256],"category_scores_gemma":[0.012860429,0.0007532961,0.0010597944,0.004374309,0.004889007,0.0227888,0.0052471505,0.003522585,0.0017126708],"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.00006309243,0.000023948282,0.0006955308,0.0001708572,0.000025165484,0.00008750867,0.00035765438,0.021290742,0.0009012154,0.902044,0.012593271,0.0617469],"study_design_scores_gemma":[0.0000097639995,0.000028771374,0.00035829665,0.000043836146,0.000014276249,0.00023795952,0.00017195688,0.036051016,0.0009024873,0.9197417,0.042418532,0.000021488922],"about_ca_topic_score_codex":0.002442686,"about_ca_topic_score_gemma":0.0017536151,"teacher_disagreement_score":0.011478256,"about_ca_system_score_codex":0.0023145105,"about_ca_system_score_gemma":0.00067386415,"threshold_uncertainty_score":0.038398564},"labels":[],"label_agreement":null},{"id":"W2116123253","doi":"10.1109/ccc.2007.26","title":"Quantum t-designs: t-wise Independence in the Quantum World","year":2007,"lang":"en","type":"article","venue":"Proceedings - IEEE Conference on Computational Complexity/Proceedings","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":132,"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; Mitacs","keywords":"Quantum; Independence (probability theory); Computer science; Quantum mechanics; Physics; Mathematics; Statistics","score_opus":0.12154519118298181,"score_gpt":0.31888406789253726,"score_spread":0.19733887670955547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116123253","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.099517874,0.00015123234,0.8913091,0.0009354392,0.000057871108,0.0002671672,0.00034954742,0.00053415383,0.006877643],"genre_scores_gemma":[0.75415325,0.00018138735,0.23880257,0.000529482,0.00011079192,0.0009302797,0.00040820485,0.00020182067,0.0046822303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916909,0.003762029,0.0006234241,0.0014768054,0.0015473343,0.0008996046],"domain_scores_gemma":[0.96820605,0.016509239,0.0021304025,0.010292815,0.0017213197,0.0011400809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006597215,0.0007986831,0.001365234,0.00069346564,0.0018263428,0.0030153422,0.0021972605,0.0023997654,0.0055161547],"category_scores_gemma":[0.02607026,0.0011331474,0.0020631861,0.0012944137,0.0053694807,0.0072138403,0.0056170397,0.004509857,0.0008771837],"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.00076818856,0.00010535977,0.0013340486,0.00011613917,0.00007232568,0.000105816835,0.00028947883,0.038195428,0.0062620463,0.9255592,0.0019760856,0.025215881],"study_design_scores_gemma":[0.00015449063,0.00024903973,0.0002555546,0.000024851075,0.000053234853,0.00013904946,0.000050036135,0.15010846,0.008469277,0.8380708,0.0023727405,0.00005240857],"about_ca_topic_score_codex":0.0005091514,"about_ca_topic_score_gemma":0.0005680031,"teacher_disagreement_score":0.006597215,"about_ca_system_score_codex":0.0019202771,"about_ca_system_score_gemma":0.0022858593,"threshold_uncertainty_score":0.034889877},"labels":[],"label_agreement":null},{"id":"W2117946984","doi":"10.5555/1109557.1109614","title":"All-pairs shortest paths for unweighted undirected graphs in o(mn) time","year":2006,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":57,"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":"Combinatorics; Undirected graph; Mathematics; Graph; Discrete mathematics","score_opus":0.015608472321808337,"score_gpt":0.23422185297186068,"score_spread":0.21861338065005234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117946984","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.14706002,0.0017603613,0.8268509,0.0026462353,0.00033978527,0.00091209094,0.0023591642,0.004165231,0.01390626],"genre_scores_gemma":[0.2517799,0.0011042767,0.7343082,0.000284824,0.00018935588,0.00044398257,0.0036739903,0.00078630686,0.007429181],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977049,0.00062241586,0.00019827012,0.000717767,0.00044802422,0.00030859548],"domain_scores_gemma":[0.99492174,0.0030557476,0.00040774627,0.0009594872,0.00037575566,0.00027953365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012022445,0.0018590647,0.0019601516,0.0014051581,0.0014181904,0.0027981142,0.0030695288,0.0017201793,0.010700868],"category_scores_gemma":[0.0066955495,0.0008063376,0.00132104,0.0026189452,0.0010200829,0.011985631,0.0032279736,0.0016836101,0.0019319529],"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.0014497994,0.0006386881,0.0021606882,0.0031946988,0.00032202143,0.00043377373,0.00097146945,0.22921272,0.0201717,0.0925651,0.043742705,0.60513663],"study_design_scores_gemma":[0.0005701259,0.00032881854,0.0010207781,0.00014943609,0.00016903626,0.00074773293,0.0008252913,0.5502557,0.01582901,0.4042202,0.025788512,0.000095274605],"about_ca_topic_score_codex":0.0026329583,"about_ca_topic_score_gemma":0.0036687704,"teacher_disagreement_score":0.010700868,"about_ca_system_score_codex":0.001791402,"about_ca_system_score_gemma":0.0018210124,"threshold_uncertainty_score":0.035798013},"labels":[],"label_agreement":null},{"id":"W2120741525","doi":"10.1007/s10586-006-9746-3","title":"Finding Hamiltonian paths in tournaments on clusters","year":2006,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Complexity and Algorithms in Graphs","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Scalability; Tournament; Computation; Parallel computing; Computer cluster; Cluster (spacecraft); Parallel algorithm; Graph; Running time; Hamiltonian (control theory); Reuse; Theoretical computer science; Algorithm; Distributed computing; Combinatorics; Mathematical optimization; Mathematics; Operating system","score_opus":0.018802860021966208,"score_gpt":0.25354114527614796,"score_spread":0.23473828525418175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120741525","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.758136,0.0006945514,0.22408542,0.0014375321,0.00010389323,0.0002943719,0.0006873738,0.0005316618,0.014029137],"genre_scores_gemma":[0.8998905,0.00030152022,0.09177774,0.00016101873,0.000069918235,0.00012176234,0.0007684679,0.00015107913,0.006757992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988331,0.0003822391,0.000058579593,0.0002800062,0.00017636477,0.00026966663],"domain_scores_gemma":[0.99133635,0.0061526494,0.0007496109,0.00045070896,0.00036917286,0.0009414643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011204776,0.0006708024,0.0015463495,0.0015171625,0.0023133087,0.0037674839,0.0022612766,0.0015152573,0.007971914],"category_scores_gemma":[0.0100638345,0.0009849637,0.0009245987,0.0026340643,0.0018023726,0.0033633297,0.0020005237,0.0014594544,0.00040854735],"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.0014301349,0.0006557061,0.013431806,0.0008226358,0.00036865077,0.0005761113,0.001398256,0.6006111,0.005681261,0.2705435,0.017610518,0.086870395],"study_design_scores_gemma":[0.00019413434,0.0001237637,0.0015937691,0.000037110527,0.00006153426,0.00013132204,0.00055979757,0.6454397,0.0010689727,0.34855568,0.0022038314,0.000030394574],"about_ca_topic_score_codex":0.0061288746,"about_ca_topic_score_gemma":0.00865258,"teacher_disagreement_score":0.007971914,"about_ca_system_score_codex":0.0015810325,"about_ca_system_score_gemma":0.0012400452,"threshold_uncertainty_score":0.026668727},"labels":[],"label_agreement":null},{"id":"W2122483877","doi":"10.1016/s0304-3975(02)00643-6","title":"Almost k-wise independence and hard Boolean functions","year":2003,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","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":"University of Toronto","funders":"","keywords":"Boolean function; Mathematics; Combinatorics; Discrete mathematics; Linear subspace; Upper and lower bounds; Function (biology); Polynomial; Computable function; Independence (probability theory); Circuit complexity; Affine transformation; Electronic circuit; Pure mathematics","score_opus":0.015241762987331061,"score_gpt":0.23840912940705755,"score_spread":0.22316736641972648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122483877","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.6204779,0.001834323,0.2696033,0.009591315,0.00021018687,0.00010520253,0.0012450245,0.00048683098,0.09644595],"genre_scores_gemma":[0.97115356,0.0006421286,0.013576159,0.0009206984,0.00046022696,0.00014029731,0.00079696794,0.00012071719,0.012189213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975152,0.00082983164,0.00010454106,0.00055050064,0.00059082406,0.00040906225],"domain_scores_gemma":[0.97234726,0.021757826,0.001848858,0.0016347646,0.0008913704,0.0015199844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017246283,0.0008661828,0.0016148699,0.0016169247,0.0022464017,0.004416472,0.0022759214,0.0020294837,0.0077643776],"category_scores_gemma":[0.013512469,0.0012372325,0.0014939245,0.0022117756,0.0046324264,0.010122468,0.0032020542,0.007949809,0.0009941686],"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.00044121966,0.00018299794,0.002325142,0.00021842895,0.00007709716,0.00023142179,0.00056884735,0.011092742,0.0019042437,0.9620646,0.005429773,0.015463406],"study_design_scores_gemma":[0.000031641735,0.000014530309,0.000825641,0.000012438547,0.000018418219,0.00017057922,0.00005935095,0.011826512,0.00045669748,0.9857431,0.0008247658,0.000016247604],"about_ca_topic_score_codex":0.0011153967,"about_ca_topic_score_gemma":0.0014748808,"teacher_disagreement_score":0.0077643776,"about_ca_system_score_codex":0.0018303981,"about_ca_system_score_gemma":0.0010595623,"threshold_uncertainty_score":0.025974393},"labels":[],"label_agreement":null},{"id":"W2124257703","doi":"10.1007/s00224-004-1210-2","title":"A Note on MODp - MODm Circuits","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Electronic circuit; Constant (computer programming); Prime (order theory); Mathematics; Layer (electronics); Prime power; Computer science; Discrete mathematics; Arithmetic; Combinatorics; Physics; Nanotechnology; Materials science; Quantum mechanics","score_opus":0.02779862653046497,"score_gpt":0.26227526526526934,"score_spread":0.23447663873480437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124257703","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.024326691,0.035324227,0.20052208,0.10217873,0.025127228,0.0001343081,0.0010933953,0.00086850935,0.6104248],"genre_scores_gemma":[0.56274265,0.03240059,0.1386903,0.030778656,0.042517733,0.00052978855,0.0010705515,0.0010981244,0.19017154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864703,0.00036305236,0.00005331686,0.0003269257,0.00044933343,0.00016043251],"domain_scores_gemma":[0.9963565,0.0025429279,0.00009121498,0.0006066023,0.00027277353,0.00012997736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016642341,0.001083308,0.0013926857,0.0021117528,0.003111711,0.003619255,0.0024387364,0.0024295452,0.015044529],"category_scores_gemma":[0.0062609543,0.0006156024,0.0013614207,0.0030008415,0.0052232933,0.013205139,0.004012515,0.008613964,0.0028347664],"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.000016380129,0.0000072811886,0.000054212065,0.000060283583,0.000004637112,0.0000353111,0.000040593903,0.00029434802,0.00016327827,0.9681829,0.019850045,0.011290693],"study_design_scores_gemma":[0.000004909682,0.00000784315,0.00006346954,0.000017270859,0.000004846992,0.00007651479,0.0000133970225,0.00083386386,0.00021568441,0.9565008,0.04225472,0.000006682824],"about_ca_topic_score_codex":0.0008870723,"about_ca_topic_score_gemma":0.0012142637,"teacher_disagreement_score":0.015044529,"about_ca_system_score_codex":0.0026477505,"about_ca_system_score_gemma":0.00085935695,"threshold_uncertainty_score":0.05032903},"labels":[],"label_agreement":null},{"id":"W2125063528","doi":"10.1007/s00037-013-0059-7","title":"Is Valiant–Vazirani’s isolation probability improvable?","year":2013,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"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":"Alexander von Humboldt-Stiftung; National Science Foundation","keywords":"Lemma (botany); Combinatorics; Randomized algorithm; Discrete mathematics; Time complexity; Isolation (microbiology); Upper and lower bounds; Mathematics; Satisfiability; Computer science","score_opus":0.07230848095357204,"score_gpt":0.27751235173216143,"score_spread":0.2052038707785894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125063528","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.21647802,0.0043340395,0.52601874,0.04104165,0.0017409015,0.0001234135,0.00048047275,0.00095691025,0.2088258],"genre_scores_gemma":[0.95407706,0.001178825,0.02527441,0.0031380223,0.0011124602,0.00017032461,0.00017374376,0.00041255073,0.014462584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961598,0.0013421,0.00012919669,0.0008720864,0.00080416485,0.00069266645],"domain_scores_gemma":[0.9608077,0.029325094,0.0016309313,0.00496897,0.0016824859,0.0015848903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046818606,0.0010046044,0.002491687,0.00208374,0.0035502026,0.005131048,0.003481098,0.0042294343,0.014809808],"category_scores_gemma":[0.0564464,0.00087290717,0.0017431588,0.0016799371,0.00975119,0.01692701,0.0064415163,0.008209192,0.002596853],"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.000076286386,0.000023049095,0.0004618319,0.000057532445,0.000019869223,0.000047327605,0.00014328957,0.0022024857,0.00027612227,0.9870848,0.00340532,0.006202046],"study_design_scores_gemma":[0.000024926443,0.000015408432,0.00018239036,0.000017523613,0.0000080181535,0.00008200618,0.00005084863,0.008391737,0.0003149632,0.98865926,0.0022383588,0.000014430074],"about_ca_topic_score_codex":0.00048066108,"about_ca_topic_score_gemma":0.00036228323,"teacher_disagreement_score":0.014809808,"about_ca_system_score_codex":0.0022384652,"about_ca_system_score_gemma":0.0016718905,"threshold_uncertainty_score":0.049543798},"labels":[],"label_agreement":null},{"id":"W2125240990","doi":"10.1023/b:joco.0000038911.67280.3f","title":"On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":75,"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":"Technische Universiteit Delft; Universiteit Utrecht; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics; Semidefinite programming; Approximation algorithm; Bounded function; Graph; Relaxation (psychology); Discrete mathematics; Maximum cut; Algorithm; Mathematical optimization","score_opus":0.012230006133804268,"score_gpt":0.21800448995978605,"score_spread":0.2057744838259818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125240990","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.0391659,0.0015598104,0.94976443,0.00113183,0.00017389303,0.00013339391,0.00020010862,0.0009994453,0.006871257],"genre_scores_gemma":[0.34886423,0.0014679612,0.63945353,0.0007520328,0.000320805,0.00042266582,0.00089885504,0.0007315564,0.0070883012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964935,0.0017455668,0.00016228607,0.000506858,0.0007369123,0.00035486688],"domain_scores_gemma":[0.9790069,0.015360117,0.00089585414,0.0029628472,0.0011626198,0.0006116511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047129015,0.0020844808,0.0034258591,0.0019943765,0.0016201216,0.003695635,0.00573985,0.003328848,0.008145647],"category_scores_gemma":[0.028583085,0.0012425102,0.0017719446,0.0046947324,0.0028658216,0.01050966,0.004007641,0.004301536,0.0014661715],"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.001499125,0.00038285588,0.002183439,0.00037957772,0.00016312928,0.00007483061,0.0002837303,0.6374008,0.0026677023,0.16109292,0.009311582,0.18456027],"study_design_scores_gemma":[0.000054813245,0.000056388024,0.00030062706,0.000027956083,0.000035940342,0.000050129787,0.000049368933,0.8777672,0.00061370595,0.11996263,0.0010644222,0.00001667606],"about_ca_topic_score_codex":0.005003412,"about_ca_topic_score_gemma":0.0063650087,"teacher_disagreement_score":0.008145647,"about_ca_system_score_codex":0.0038740933,"about_ca_system_score_gemma":0.00308674,"threshold_uncertainty_score":0.028108656},"labels":[],"label_agreement":null},{"id":"W2125401464","doi":"10.1287/mnsc.49.9.1268.16570","title":"A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems","year":2003,"lang":"en","type":"article","venue":"Management Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":205,"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 Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Mathematics; Integer programming; Mathematical optimization; Separable space; Linear programming; Piecewise linear function; Minification; Duality (order theory); Linear programming relaxation; Piecewise; Branch and price; Lagrangian relaxation; Relaxation (psychology); Regular polygon; Envelope (radar); Convex optimization; Strong duality; Function (biology); Applied mathematics; Discrete mathematics; Optimization problem; Computer science; Mathematical analysis","score_opus":0.06693519417062954,"score_gpt":0.3225695888185658,"score_spread":0.25563439464793625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125401464","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.033645913,0.0025238611,0.94102055,0.0013050111,0.00013110931,0.00008696759,0.00014857211,0.00014277539,0.020995263],"genre_scores_gemma":[0.6726305,0.0041562505,0.31250754,0.00039723795,0.00017324212,0.0003910771,0.00033236912,0.0001897955,0.009221995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845576,0.0008953645,0.000053569256,0.00013065965,0.00034931378,0.00011525948],"domain_scores_gemma":[0.99638665,0.002636895,0.0002924942,0.00027215396,0.00023824873,0.00017354845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033371306,0.0012604953,0.001166108,0.00076869247,0.0005044932,0.002733294,0.0022042852,0.0013793521,0.0043667066],"category_scores_gemma":[0.008618033,0.00066234445,0.0012390658,0.0017699341,0.0012042354,0.0035867316,0.0015592664,0.002216628,0.00038933134],"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.00014029819,0.000098623,0.0003487893,0.00019867577,0.000047795867,0.000048059694,0.00012306895,0.6482651,0.00036585444,0.32236105,0.0015861099,0.026416514],"study_design_scores_gemma":[0.000013893478,0.00006551687,0.00013649419,0.000043942713,0.000016636293,0.000026387073,0.00004760012,0.9374832,0.00021133598,0.059892833,0.0020506529,0.000011445239],"about_ca_topic_score_codex":0.001765541,"about_ca_topic_score_gemma":0.0019873022,"teacher_disagreement_score":0.0043667066,"about_ca_system_score_codex":0.0022745468,"about_ca_system_score_gemma":0.0012306923,"threshold_uncertainty_score":0.017648637},"labels":[],"label_agreement":null},{"id":"W2126546664","doi":"10.1109/ccc.2006.27","title":"Minimizing DNF Formulas and AC^0_d Circuits Given a Truth Table","year":2006,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"University of Toronto","funders":"","keywords":"Boolean function; Truth table; Reduction (mathematics); Mathematics; Combinatorics; Discrete mathematics; Function (biology); Circuit minimization for Boolean functions; Parity function; Boolean circuit; Binary logarithm; Boolean expression; Algorithm","score_opus":0.014438413559991559,"score_gpt":0.21253447467379172,"score_spread":0.19809606111380015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126546664","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.32329118,0.0027597258,0.59265876,0.0068223476,0.00022161637,0.00048068177,0.0044762213,0.0021302288,0.067159265],"genre_scores_gemma":[0.6454161,0.0012912161,0.3288695,0.0010461494,0.00020287727,0.00035606514,0.003341178,0.0003641726,0.019112833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998818,0.00024064496,0.0000740774,0.00036084422,0.00030314352,0.0002033083],"domain_scores_gemma":[0.9949941,0.003902942,0.00029018326,0.00035203545,0.0002891749,0.00017166836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078914897,0.0009771219,0.0007212128,0.00068803935,0.0006115576,0.0017303934,0.0018819091,0.0011445469,0.007727878],"category_scores_gemma":[0.0072206804,0.00066488027,0.0010897523,0.001510545,0.000999734,0.0033101237,0.0013812312,0.0016721125,0.0004963124],"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.00068787276,0.00026757832,0.003955432,0.0011981296,0.00015086403,0.00041130517,0.0003667925,0.35773218,0.009297061,0.39845553,0.024192762,0.20328449],"study_design_scores_gemma":[0.00013629123,0.00013027257,0.0016027988,0.000073780546,0.000088196444,0.0003718241,0.00018931324,0.56263113,0.0066686296,0.4130048,0.015071631,0.000031328633],"about_ca_topic_score_codex":0.006337309,"about_ca_topic_score_gemma":0.008539348,"teacher_disagreement_score":0.007727878,"about_ca_system_score_codex":0.0034084274,"about_ca_system_score_gemma":0.0012236194,"threshold_uncertainty_score":0.025852382},"labels":[],"label_agreement":null},{"id":"W2126874118","doi":"10.1145/2532645","title":"A logarithmic approximation for unsplittable flow on line graphs","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"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; University of Waterloo","funders":"Seventh Framework Programme; Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Mathematics; Bounded function; Approximation algorithm; Bottleneck; Multiplicative function; Combinatorics; Logarithm; Time complexity; Discrete mathematics; Linear programming; Maximum flow problem; Mathematical optimization; Computer science","score_opus":0.038118541435952544,"score_gpt":0.2740565768001746,"score_spread":0.23593803536422203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126874118","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.1589137,0.0022884444,0.7901194,0.005308213,0.0003268725,0.00044943645,0.0027196975,0.007903107,0.03197106],"genre_scores_gemma":[0.5942974,0.0011597191,0.3830407,0.0014389541,0.00026649877,0.0004209216,0.0043280274,0.0014501003,0.013597705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826175,0.00045378553,0.000052654177,0.0003880345,0.0002883056,0.0005554957],"domain_scores_gemma":[0.99651825,0.0022284682,0.00034328355,0.0004714818,0.00017409062,0.00026446543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015547755,0.0022739635,0.0017596545,0.0010770715,0.0011113172,0.0030149524,0.00332975,0.0018711925,0.011977869],"category_scores_gemma":[0.006802588,0.0008044358,0.0011964606,0.0023179816,0.0012949446,0.0072573614,0.0019305014,0.0034557232,0.00228511],"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.0014806442,0.0007421385,0.0012252714,0.00060622254,0.00010124892,0.00029266486,0.00033582989,0.7996597,0.005415522,0.06045847,0.027870413,0.101811826],"study_design_scores_gemma":[0.00013788197,0.000118731645,0.00017467041,0.00003347118,0.000018338367,0.00009562745,0.000083045335,0.915332,0.0010196692,0.07908563,0.0038852885,0.000015650283],"about_ca_topic_score_codex":0.0048531666,"about_ca_topic_score_gemma":0.005555325,"teacher_disagreement_score":0.011977869,"about_ca_system_score_codex":0.0036443486,"about_ca_system_score_gemma":0.0021338866,"threshold_uncertainty_score":0.040069997},"labels":[],"label_agreement":null},{"id":"W2127378345","doi":"","title":"Reductions for the stable set problem","year":2011,"lang":"en","type":"article","venue":"Algorithmic operations research","topic":"Complexity and Algorithms in Graphs","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":"Independent set; Clique; Mathematics; Combinatorics; Graph; Benchmark (surveying); Set (abstract data type); Reduction (mathematics); Clique problem; Discrete mathematics; Mathematical optimization; Computer science; Pathwidth; Line graph","score_opus":0.2833151832057892,"score_gpt":0.39454671468208496,"score_spread":0.11123153147629578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127378345","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.025074864,0.0008501466,0.927381,0.0026665276,0.00029960036,0.0004995905,0.0007878524,0.00082930375,0.041611176],"genre_scores_gemma":[0.28667754,0.0021422652,0.67609054,0.0011506231,0.00094970915,0.0015332031,0.003964113,0.000975708,0.026516298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974247,0.00075740344,0.00012388384,0.0004167686,0.0010049882,0.00027224974],"domain_scores_gemma":[0.9966665,0.0020564068,0.00014866765,0.00064562855,0.0003544432,0.00012836685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019776695,0.0017310173,0.0010542998,0.0017022598,0.0019240673,0.002491079,0.0029736834,0.0015579885,0.012614373],"category_scores_gemma":[0.0055953665,0.00065482734,0.0036832846,0.0017547823,0.0022542388,0.006389907,0.0045192796,0.0071978415,0.0018625453],"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.0001621155,0.0003508487,0.0004246258,0.00060628337,0.00010894699,0.00019528603,0.0004036465,0.07078501,0.0055321124,0.7795721,0.032745756,0.10911321],"study_design_scores_gemma":[0.00004999231,0.00006439736,0.00022923265,0.000045110308,0.000047127465,0.00015371777,0.0001577321,0.08646647,0.0033010698,0.886625,0.022833228,0.000027008906],"about_ca_topic_score_codex":0.0016667243,"about_ca_topic_score_gemma":0.0026181082,"teacher_disagreement_score":0.012614373,"about_ca_system_score_codex":0.0017928429,"about_ca_system_score_gemma":0.001872363,"threshold_uncertainty_score":0.042199254},"labels":[],"label_agreement":null},{"id":"W2127493538","doi":"10.1109/ccc.2006.12","title":"Circuit Lower Bounds via Ehrenfeucht-Fraisse Games","year":2006,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Class (philosophy); Electronic circuit; Mathematics; Order (exchange); Discrete mathematics; Upper and lower bounds; Combinatorics; Computer science","score_opus":0.014180967402070466,"score_gpt":0.2212683814214968,"score_spread":0.20708741401942632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127493538","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.15376106,0.0027872662,0.7258431,0.00470993,0.00032532908,0.0002387497,0.00054571294,0.0009577724,0.11083108],"genre_scores_gemma":[0.8952992,0.0017182144,0.088432394,0.0013419909,0.00041558727,0.00041134335,0.00051160343,0.0002593471,0.0116102705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99457294,0.0012549345,0.000184115,0.0009539957,0.0017035446,0.0013304774],"domain_scores_gemma":[0.9792259,0.017169066,0.0006568097,0.0013930398,0.00096735737,0.0005878081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056487126,0.0023471944,0.0019798665,0.002840675,0.0018303057,0.0054270234,0.0032337029,0.0028242036,0.009018881],"category_scores_gemma":[0.024218999,0.0007810497,0.0023150546,0.001997263,0.0045801923,0.015898064,0.0040236856,0.0075678886,0.0012327507],"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.00010649823,0.000080358725,0.00036313295,0.00009090921,0.000028818087,0.00006043414,0.0001265086,0.024050828,0.0012966804,0.9623572,0.0016543977,0.00978434],"study_design_scores_gemma":[0.000029775822,0.000044786913,0.00016260156,0.00002999914,0.000023617098,0.00005708222,0.000033052787,0.07904098,0.001668852,0.91666776,0.0022206493,0.000020819729],"about_ca_topic_score_codex":0.0026812842,"about_ca_topic_score_gemma":0.002198981,"teacher_disagreement_score":0.009018881,"about_ca_system_score_codex":0.00474925,"about_ca_system_score_gemma":0.0017837088,"threshold_uncertainty_score":0.0344584},"labels":[],"label_agreement":null},{"id":"W2127816126","doi":"10.1145/2907052","title":"Better Balance by Being Biased","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"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; University of Toronto","funders":"","keywords":"Approximation algorithm; Conjecture; Combinatorics; Mathematics; Constraint (computer-aided design); Discrete mathematics","score_opus":0.01799228803662961,"score_gpt":0.24238463663410217,"score_spread":0.22439234859747256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127816126","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.2658714,0.0026109405,0.59252733,0.009429837,0.001264424,0.0007280057,0.0025148469,0.007990498,0.11706269],"genre_scores_gemma":[0.70641124,0.0010360894,0.2313049,0.0041695787,0.00047083045,0.0006273,0.002762461,0.0025259838,0.050691716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646986,0.00090581627,0.0001657679,0.0010082509,0.00072821527,0.00072221004],"domain_scores_gemma":[0.99367106,0.002446278,0.00047587612,0.0022191985,0.0006659676,0.00052161375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027515069,0.0024185933,0.0028501577,0.0015072031,0.0025307308,0.0042222627,0.0031505704,0.0031473942,0.049836442],"category_scores_gemma":[0.018915059,0.001209035,0.0018021873,0.0022625893,0.0019660897,0.012002984,0.0065371185,0.0033925166,0.014505835],"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.0029273168,0.000808524,0.01189074,0.0007257706,0.00033731258,0.0007917697,0.0016544467,0.121818244,0.019650733,0.3595925,0.118201725,0.36160094],"study_design_scores_gemma":[0.00039922522,0.00027425186,0.0010424246,0.00020287848,0.00017586116,0.0005134818,0.000790304,0.4154622,0.00799947,0.5176492,0.055409033,0.00008185529],"about_ca_topic_score_codex":0.003711396,"about_ca_topic_score_gemma":0.0049911425,"teacher_disagreement_score":0.049836442,"about_ca_system_score_codex":0.002085229,"about_ca_system_score_gemma":0.002383695,"threshold_uncertainty_score":0.1667195},"labels":[],"label_agreement":null},{"id":"W2131242765","doi":"10.1145/1064546.1180614","title":"Implementing approximation algorithms for the single-source unsplittable flow problem","year":2005,"lang":"en","type":"article","venue":"ACM Journal of Experimental Algorithmics","topic":"Complexity and Algorithms in Graphs","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":"York University","funders":"","keywords":"Approximation algorithm; Heuristics; Minimum-cost flow problem; Algorithm; Mathematics; Vertex (graph theory); Multi-commodity flow problem; Flow (mathematics); Computer science; Flow network; Enhanced Data Rates for GSM Evolution; Path (computing); Mathematical optimization; Graph; Combinatorics","score_opus":0.04379081623079347,"score_gpt":0.29558070819012355,"score_spread":0.2517898919593301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131242765","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.117215335,0.00085240824,0.86324006,0.0007505214,0.00013351237,0.00026955994,0.0003419328,0.0054775584,0.011718993],"genre_scores_gemma":[0.37999612,0.00038858695,0.615764,0.000205464,0.00004348733,0.0002918755,0.00090403546,0.0003385289,0.0020678726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743646,0.00065418554,0.00016381111,0.0004641069,0.0007178908,0.0005634411],"domain_scores_gemma":[0.99375534,0.0035342379,0.00046119007,0.001300868,0.0007501318,0.00019818594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002702145,0.0014679471,0.0012598868,0.0012421345,0.0013333865,0.002725662,0.0036256006,0.0022223936,0.004831193],"category_scores_gemma":[0.014327081,0.0007410036,0.00091179495,0.0032607892,0.0008872083,0.00399097,0.0017481411,0.0016574836,0.0013555721],"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.0011871752,0.0007965401,0.0026102702,0.00027160838,0.00009284089,0.00009125285,0.00037275878,0.7051436,0.0044137696,0.04104488,0.008152114,0.23582323],"study_design_scores_gemma":[0.00014521269,0.00005980035,0.00016468175,0.000014264425,0.000019387171,0.00004760353,0.00006645405,0.9724087,0.002100163,0.023166759,0.0017962902,0.000010645484],"about_ca_topic_score_codex":0.007196189,"about_ca_topic_score_gemma":0.008507618,"teacher_disagreement_score":0.007196189,"about_ca_system_score_codex":0.0026820567,"about_ca_system_score_gemma":0.0032836527,"threshold_uncertainty_score":0.019459784},"labels":[],"label_agreement":null},{"id":"W2132147722","doi":"10.1007/s10107-015-0944-8","title":"Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"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","keywords":"Mathematics; Combinatorics; Bounded function; Upper and lower bounds; Parametric statistics; Rank (graph theory); Maximum cut; Polynomial; Time complexity; Pareto principle; Graph; Discrete mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.04022054374351302,"score_gpt":0.2952712546187547,"score_spread":0.25505071087524167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132147722","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.083663955,0.0056148274,0.85430354,0.007990994,0.00037502838,0.0002148038,0.0011682127,0.00065305864,0.04601557],"genre_scores_gemma":[0.7328678,0.0057628867,0.23157422,0.001872282,0.0013119208,0.00080473494,0.0018365023,0.0012845881,0.022685079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950885,0.0015745695,0.00015520876,0.0009219485,0.001264118,0.000995684],"domain_scores_gemma":[0.927836,0.061349455,0.0034569432,0.0031166524,0.002321615,0.0019193026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006751909,0.004225361,0.0033492278,0.0035788193,0.0020683056,0.009656841,0.006714181,0.0037569732,0.013706724],"category_scores_gemma":[0.05055624,0.0021801216,0.003176179,0.005436358,0.0057462323,0.019244434,0.006312752,0.013931597,0.0014877194],"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.00097451394,0.0004818258,0.002620798,0.0011966075,0.00020952374,0.00018728428,0.00087360194,0.40529725,0.0033091013,0.5074505,0.014227569,0.06317148],"study_design_scores_gemma":[0.000065042805,0.000092614064,0.0007372839,0.00014162541,0.00009008786,0.000085679334,0.00019685847,0.41367787,0.0010112057,0.5814664,0.002397157,0.00003820159],"about_ca_topic_score_codex":0.0040259776,"about_ca_topic_score_gemma":0.008018481,"teacher_disagreement_score":0.013706724,"about_ca_system_score_codex":0.008559079,"about_ca_system_score_gemma":0.0036474369,"threshold_uncertainty_score":0.062100768},"labels":[],"label_agreement":null},{"id":"W2132274124","doi":"10.1007/s00453-004-1113-2","title":"The Power of Priority Algorithms for Facility Location and Set Cover","year":2004,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"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":"Set cover problem; Facility location problem; Greedy algorithm; Theory of computation; Cover (algebra); Focus (optics); Class (philosophy); Algorithm; Approximation algorithm; Set (abstract data type); Covering problems; Computer science; Time complexity; Mathematical optimization; Dominating set; Point (geometry); Vertex cover; Mathematics; Theoretical computer science; Graph","score_opus":0.02472507854586655,"score_gpt":0.27160109436645713,"score_spread":0.24687601582059057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132274124","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.03296724,0.0029055001,0.9314469,0.005896895,0.00058566075,0.000084098494,0.00028034943,0.0006648575,0.025168505],"genre_scores_gemma":[0.6671596,0.0047185235,0.30494636,0.001500198,0.0028302919,0.00026194088,0.0007813819,0.0008524929,0.016949223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927549,0.0028195058,0.0003194463,0.0012517376,0.0020129671,0.0008415382],"domain_scores_gemma":[0.9462527,0.04135493,0.0021377446,0.006694828,0.0018312113,0.0017285307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007542692,0.001601353,0.0029940784,0.0023792428,0.0029831822,0.00857376,0.00565678,0.0034231304,0.009671121],"category_scores_gemma":[0.047747336,0.0014141822,0.0023873218,0.0044404743,0.0055567403,0.02727931,0.0051856255,0.0077331634,0.0018757479],"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.00043665746,0.000110607376,0.0007169064,0.000249737,0.00005904193,0.000040173385,0.0002543539,0.039991967,0.0008981093,0.90081024,0.006725672,0.049706545],"study_design_scores_gemma":[0.00004888374,0.000033352764,0.00009795699,0.000017835959,0.000022263397,0.00003956122,0.000037209436,0.09011622,0.0004666811,0.90612185,0.0029841224,0.000014000485],"about_ca_topic_score_codex":0.004157521,"about_ca_topic_score_gemma":0.0031991636,"teacher_disagreement_score":0.009671121,"about_ca_system_score_codex":0.0047780965,"about_ca_system_score_gemma":0.0038589232,"threshold_uncertainty_score":0.03988999},"labels":[],"label_agreement":null},{"id":"W2132648308","doi":"10.1109/spdp.1990.143503","title":"The maximum weight perfect matching problem for complete weighted graphs is in PC","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":20,"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":"Speedup; Combinatorics; Matching (statistics); Mathematics; Computation; Time complexity; Parallel algorithm; Minimum weight; Graph; Binary logarithm; Running time; Algorithm; Discrete mathematics; Computer science; Parallel computing","score_opus":0.03078141394729043,"score_gpt":0.23684551531178086,"score_spread":0.20606410136449044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132648308","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.08318443,0.0008025282,0.85326797,0.0028131402,0.00026785798,0.00036501416,0.0014882595,0.0016796129,0.056131177],"genre_scores_gemma":[0.523492,0.0013710584,0.42528394,0.0006156732,0.00033859862,0.0005671511,0.004131939,0.0006480814,0.04355157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845445,0.000263488,0.00007439949,0.0006887646,0.00026814445,0.0002507324],"domain_scores_gemma":[0.99812347,0.000765989,0.00026975866,0.00045920696,0.00029558892,0.000085977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073944865,0.0008095804,0.0011251324,0.00082096335,0.0014658706,0.0028848972,0.0014501053,0.0015536109,0.011877323],"category_scores_gemma":[0.0050849994,0.00041610695,0.00095548294,0.002791796,0.0013775837,0.0062238635,0.0016042397,0.0012813056,0.0021625503],"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.0005670783,0.00021696828,0.0016046133,0.00084386155,0.000141981,0.00029671268,0.00033126996,0.11393624,0.007081135,0.5237001,0.025966162,0.32531393],"study_design_scores_gemma":[0.00006821452,0.0001391048,0.00090114854,0.000056589746,0.00005331021,0.00034127466,0.000292813,0.2399045,0.0090109585,0.7017608,0.047446005,0.00002529822],"about_ca_topic_score_codex":0.0039550276,"about_ca_topic_score_gemma":0.0053660083,"teacher_disagreement_score":0.011877323,"about_ca_system_score_codex":0.0015218491,"about_ca_system_score_gemma":0.0015736388,"threshold_uncertainty_score":0.03973365},"labels":[],"label_agreement":null},{"id":"W2132910148","doi":"10.1109/sct.1989.41812","title":"On the theory of average case complexity","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Complexity class; Nondeterministic algorithm; Time complexity; NP; Mathematics; Computational complexity theory; Structural complexity theory; Equivalence (formal languages); PH; Average-case complexity; PSPACE; Exponential function; Polynomial hierarchy; Hierarchy; Discrete mathematics; Descriptive complexity theory; Time hierarchy theorem; Counting problem; Context (archaeology); Quantum complexity theory; Algorithm; Turing machine; Computation","score_opus":0.05982840385805717,"score_gpt":0.25562887964020414,"score_spread":0.195800475782147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132910148","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.018378193,0.028507523,0.56433064,0.03291263,0.0020051657,0.00011827663,0.0013021961,0.00090795394,0.35153738],"genre_scores_gemma":[0.6896986,0.046819277,0.17148186,0.01172825,0.014777502,0.0010041123,0.0029811272,0.0008515555,0.060657695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962368,0.0011782041,0.00019152522,0.0008090303,0.0011993042,0.0003851523],"domain_scores_gemma":[0.9731621,0.021990735,0.00063561636,0.0019960552,0.0016384127,0.0005770761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039637326,0.0010423944,0.0017063901,0.0030493175,0.0020193001,0.0055501247,0.0022754213,0.0016873555,0.02166944],"category_scores_gemma":[0.013451129,0.00066869025,0.0016649069,0.005978071,0.0064286324,0.014588212,0.0035378558,0.0072898436,0.003482357],"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.000010983946,0.000016808795,0.0001409465,0.00012571744,0.000020605747,0.000037534854,0.00006742717,0.0042473343,0.00006989493,0.9703554,0.011277523,0.013629839],"study_design_scores_gemma":[0.0000028105994,0.000003951827,0.000082761595,0.000027092974,0.0000061263154,0.000024631105,0.000013208067,0.0036395716,0.000033954442,0.9896242,0.0065367627,0.000004982597],"about_ca_topic_score_codex":0.0026636843,"about_ca_topic_score_gemma":0.0015845221,"teacher_disagreement_score":0.02166944,"about_ca_system_score_codex":0.00529736,"about_ca_system_score_gemma":0.0017750671,"threshold_uncertainty_score":0.07249153},"labels":[],"label_agreement":null},{"id":"W2133768373","doi":"10.1109/sfcs.1996.548466","title":"The optimal path-matching problem","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Matroid; Time complexity; Mathematics; Combinatorics; Generalization; Intersection (aeronautics); Weighted matroid; Equivalence (formal languages); Path (computing); Matching (statistics); Context (archaeology); Polynomial; Discrete mathematics; Matroid partitioning; Computer science; Graphic matroid","score_opus":0.022398869810922803,"score_gpt":0.22074983965924472,"score_spread":0.1983509698483219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133768373","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.025825396,0.0004960708,0.93866396,0.0018403804,0.00015522036,0.00032331378,0.001659227,0.0007215908,0.030314876],"genre_scores_gemma":[0.32202858,0.0015366755,0.64180815,0.0005396407,0.00030561417,0.0005856474,0.0052804165,0.00046185285,0.02745345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847037,0.0003304964,0.00008511933,0.0006275304,0.00026650866,0.00021994402],"domain_scores_gemma":[0.9988954,0.0005792942,0.000103539925,0.00022906932,0.000098699784,0.00009391684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008814709,0.0009955387,0.001063173,0.001018028,0.0011206997,0.0022692538,0.001839721,0.002151973,0.022333093],"category_scores_gemma":[0.0046657384,0.0005447434,0.0011311166,0.0021409255,0.0012679966,0.006936201,0.0027361575,0.0024176443,0.0025917015],"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.00015594842,0.00023501315,0.00049793726,0.0004510211,0.000061508654,0.00014153312,0.0001488797,0.0802369,0.0025851163,0.7506389,0.019471189,0.14537612],"study_design_scores_gemma":[0.00004598054,0.000058979465,0.00016670281,0.00003142882,0.000030753865,0.00018395849,0.00010878473,0.114817105,0.0024440994,0.85064274,0.031451717,0.000017728093],"about_ca_topic_score_codex":0.0015598432,"about_ca_topic_score_gemma":0.0016946307,"teacher_disagreement_score":0.022333093,"about_ca_system_score_codex":0.0011400264,"about_ca_system_score_gemma":0.0022594184,"threshold_uncertainty_score":0.07471162},"labels":[],"label_agreement":null},{"id":"W2134098997","doi":"10.1145/2077336.2077337","title":"Pebbles and Branching Programs for Tree Evaluation","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","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":"Université de Montréal; University of Toronto","funders":"","keywords":"Nondeterministic algorithm; Combinatorics; Upper and lower bounds; Mathematics; Branching (polymer chemistry); Boolean function; Tree (set theory); Binary decision diagram; Discrete mathematics; Algorithm","score_opus":0.06058992463226921,"score_gpt":0.31744797888938175,"score_spread":0.25685805425711256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134098997","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.081226714,0.0004557138,0.9010868,0.0018925585,0.00006375406,0.00019573257,0.00027793695,0.002124257,0.012676548],"genre_scores_gemma":[0.48237634,0.0006112,0.5042002,0.00084044493,0.00012417104,0.00075197814,0.00082588487,0.00073283596,0.009536934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973049,0.00067926425,0.0001620911,0.0006225616,0.00064604427,0.0005851613],"domain_scores_gemma":[0.9932249,0.0051522343,0.000389483,0.00066120515,0.00037827453,0.00019377917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015958415,0.0009338738,0.0008248358,0.00080245815,0.0015166339,0.0027427517,0.0016517178,0.0014578286,0.008183741],"category_scores_gemma":[0.010207021,0.00063961436,0.0018209118,0.001603148,0.0037739591,0.0074652988,0.0029797931,0.005769375,0.0009755066],"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.00035405855,0.00023745513,0.0015988786,0.00040059036,0.000036245634,0.0001614249,0.00076215016,0.06221687,0.01151481,0.8280143,0.0034646888,0.091238484],"study_design_scores_gemma":[0.00006392246,0.000098082935,0.0003401013,0.000060521957,0.00003555867,0.00010367371,0.00014094998,0.18806595,0.010407125,0.7938229,0.006824645,0.00003660383],"about_ca_topic_score_codex":0.003986632,"about_ca_topic_score_gemma":0.004539011,"teacher_disagreement_score":0.008183741,"about_ca_system_score_codex":0.0032378465,"about_ca_system_score_gemma":0.0023727831,"threshold_uncertainty_score":0.027377367},"labels":[],"label_agreement":null},{"id":"W2134600856","doi":"10.1016/j.jcss.2011.12.002","title":"The complexity of weighted and unweighted #CSP","year":2011,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Class (philosophy); Computational complexity theory; Computation; Mathematical optimization; Discrete mathematics; Combinatorics; Computer science; Algorithm; Artificial intelligence","score_opus":0.06998880825289108,"score_gpt":0.24769342942031014,"score_spread":0.17770462116741906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134600856","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.56499755,0.0015388497,0.38788,0.008839805,0.00026999466,0.0002592401,0.00319002,0.0010541533,0.03197036],"genre_scores_gemma":[0.9111536,0.00075119466,0.07783191,0.00042851217,0.00033625297,0.00020819188,0.0015084852,0.00036334354,0.0074183564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937644,0.0019653887,0.00043202587,0.00079790456,0.0021472955,0.0008929394],"domain_scores_gemma":[0.94824106,0.04169932,0.0028486783,0.0034902403,0.0022188965,0.0015018152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041943653,0.00092473795,0.0017452262,0.0015403338,0.0016179095,0.007056822,0.004108109,0.002321766,0.008514096],"category_scores_gemma":[0.032982085,0.0011236388,0.0018835353,0.0036366433,0.0029770955,0.018079689,0.0034038837,0.0038173907,0.0005945278],"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.00097092806,0.00024998642,0.0025195295,0.00042322357,0.00015429044,0.00024226279,0.00045816027,0.22835198,0.0027943598,0.712672,0.008944297,0.042219017],"study_design_scores_gemma":[0.00007170622,0.00003835592,0.00049561256,0.000019210938,0.00004247213,0.00013411825,0.00008913334,0.3260218,0.0008016843,0.6709672,0.0012885141,0.000030131183],"about_ca_topic_score_codex":0.0067694527,"about_ca_topic_score_gemma":0.0062211896,"teacher_disagreement_score":0.008514096,"about_ca_system_score_codex":0.004709738,"about_ca_system_score_gemma":0.0045565916,"threshold_uncertainty_score":0.0341717},"labels":[],"label_agreement":null},{"id":"W2134875769","doi":"10.1137/s009753979833920x","title":"Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching","year":2000,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":107,"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; National Science Foundation","keywords":"Combinatorics; Mathematics; Discrete mathematics; Graph factorization; Spanning tree; Matching (statistics); Connectivity; Strongly connected component; Undirected graph; Factor-critical graph; Minimum spanning tree; Line graph; Degree (music); Minimum degree spanning tree; Graph; Graph power","score_opus":0.012816955137912967,"score_gpt":0.24196167584555903,"score_spread":0.22914472070764605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134875769","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.15323713,0.00039182825,0.8361926,0.0004075152,0.000040744137,0.00025252244,0.0005661656,0.0020274434,0.0068840245],"genre_scores_gemma":[0.45966533,0.00018427696,0.5355815,0.000121863886,0.000024210334,0.00017680973,0.0012820397,0.0002804186,0.0026835534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946994,0.00012341709,0.000024859653,0.00014730549,0.000107406144,0.00012704864],"domain_scores_gemma":[0.9987923,0.0006750468,0.00017798941,0.00017279103,0.0001025153,0.000079296144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005632612,0.0008089303,0.0008137709,0.0011438542,0.00048509016,0.0006702959,0.0017352186,0.0011158395,0.003166605],"category_scores_gemma":[0.0033676769,0.0005987929,0.0009347826,0.0020659163,0.00063815416,0.0019891039,0.00091021776,0.00060920505,0.000697212],"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.0003179778,0.00016661297,0.0022185708,0.00023917654,0.000069609785,0.00025567907,0.000125265,0.85131687,0.008531609,0.019009633,0.007163382,0.11058569],"study_design_scores_gemma":[0.000034618693,0.000040085994,0.00035901152,0.000012425323,0.000012652713,0.00009053579,0.000054826392,0.97857827,0.0021338325,0.017605355,0.0010717497,0.000006639117],"about_ca_topic_score_codex":0.006139442,"about_ca_topic_score_gemma":0.0073727667,"teacher_disagreement_score":0.006139442,"about_ca_system_score_codex":0.001214118,"about_ca_system_score_gemma":0.0012416802,"threshold_uncertainty_score":0.012207389},"labels":[],"label_agreement":null},{"id":"W2135050820","doi":"10.1109/infcomw.2011.5928889","title":"Egalitarian stable matching for VM migration in cloud computing","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":48,"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":"Server; Cloud computing; Computer science; Matching (statistics); Virtual machine; Distributed computing; Rank (graph theory); Outcome (game theory); Work (physics); Mathematical optimization; Theoretical computer science; Computer network; Operating system; Mathematical economics; Mathematics","score_opus":0.05727396206257437,"score_gpt":0.26521181441667757,"score_spread":0.2079378523541032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135050820","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.05472364,0.00019587728,0.9423975,0.00042344208,0.000028682785,0.000084854226,0.000032579188,0.00013667242,0.0019767545],"genre_scores_gemma":[0.7999731,0.0002990961,0.19638288,0.00016031723,0.000073749965,0.00016204991,0.00006591791,0.000068530186,0.0028145208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973774,0.0013929097,0.00010956427,0.00044835813,0.00037200993,0.00029968336],"domain_scores_gemma":[0.9959401,0.0024120533,0.00047211506,0.00062118925,0.00031402108,0.00024050074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052068233,0.0006453124,0.0010621025,0.0010018226,0.0014263429,0.0016278303,0.0018774923,0.00143908,0.0019826216],"category_scores_gemma":[0.012108209,0.000353239,0.0007554269,0.0011626475,0.0021565536,0.0032246583,0.0019454086,0.0014066542,0.00035781236],"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.00026628852,0.000120873025,0.0011358875,0.00010634554,0.00007045642,0.000105669606,0.00022467045,0.5649554,0.0026294556,0.37628695,0.0014119392,0.052686088],"study_design_scores_gemma":[0.000021804932,0.00007896662,0.00014473825,0.0000072864273,0.000013162872,0.00003878795,0.000042212076,0.7430471,0.0009882601,0.2548847,0.00072027446,0.000012770225],"about_ca_topic_score_codex":0.0016176138,"about_ca_topic_score_gemma":0.0016958322,"teacher_disagreement_score":0.0052068233,"about_ca_system_score_codex":0.0018189923,"about_ca_system_score_gemma":0.002122859,"threshold_uncertainty_score":0.02753663},"labels":[],"label_agreement":null},{"id":"W2135134090","doi":"","title":"Uniform Hardness Amplification in NP via Monotone Codes","year":2006,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Monotone polygon; Mathematics; Decoding methods; Lemma (botany); Code (set theory); Discrete mathematics; Combinatorics; Algorithm; Computer science","score_opus":0.019169918269632977,"score_gpt":0.25568251152468274,"score_spread":0.23651259325504975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135134090","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.16212122,0.0008232406,0.7902309,0.003622302,0.00012132186,0.00023122343,0.00053893036,0.0016617955,0.040649127],"genre_scores_gemma":[0.8898072,0.0006289134,0.099350706,0.0008172281,0.0003379909,0.00044397105,0.0004427432,0.0003946276,0.0077766315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99246466,0.0015350905,0.00025978242,0.0014743679,0.0029952016,0.0012709586],"domain_scores_gemma":[0.96987027,0.022375684,0.0011057524,0.0045703975,0.0013825243,0.0006953151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029323674,0.0013010987,0.0014913233,0.0015114285,0.0014394115,0.0033733149,0.0027842592,0.0016250329,0.006072147],"category_scores_gemma":[0.02701009,0.00084368116,0.001674005,0.0014833256,0.0045355484,0.010160979,0.0068004234,0.0077375695,0.0010046364],"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.0006484613,0.00022883281,0.0024206573,0.0005935318,0.000097206466,0.00045242617,0.0009293665,0.17516933,0.016943067,0.7296311,0.0045527285,0.068333134],"study_design_scores_gemma":[0.00006268809,0.00014736922,0.00048018966,0.000047320944,0.000038387578,0.0003419562,0.0001079766,0.35432813,0.01160844,0.6278724,0.00491664,0.0000483969],"about_ca_topic_score_codex":0.0011648184,"about_ca_topic_score_gemma":0.0007905342,"teacher_disagreement_score":0.006072147,"about_ca_system_score_codex":0.0030892675,"about_ca_system_score_gemma":0.0013135073,"threshold_uncertainty_score":0.022414267},"labels":[],"label_agreement":null},{"id":"W2136026170","doi":"10.1016/j.tcs.2009.09.033","title":"Priority algorithms for graph optimization problems","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","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":"University of Toronto","funders":"","keywords":"Computer science; Graph; Theoretical computer science; Greedy algorithm; Algorithm; Mathematical optimization; Mathematics","score_opus":0.020045918708397618,"score_gpt":0.2708548621187035,"score_spread":0.2508089434103059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136026170","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.017395556,0.0022097107,0.96338916,0.002150514,0.00049885554,0.00014322347,0.00014725723,0.00076686236,0.0132988],"genre_scores_gemma":[0.42302322,0.0042466926,0.5408823,0.0012696921,0.0016222112,0.000530013,0.0009516903,0.0009631354,0.026511036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739516,0.00095331384,0.00013194511,0.00036744497,0.00071073876,0.00044133427],"domain_scores_gemma":[0.98698527,0.009215435,0.00058509957,0.0013632617,0.0009998954,0.00085107656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044000316,0.0013874612,0.0021351338,0.0016802154,0.0020081955,0.004804303,0.003828075,0.0019656387,0.009390961],"category_scores_gemma":[0.0215774,0.000941883,0.0012544959,0.0027903735,0.0018385821,0.009147679,0.0028041825,0.0056821313,0.0017966118],"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.0006380369,0.00034539477,0.0006279495,0.0005500492,0.000066235014,0.000056130484,0.0003204048,0.07022899,0.0014940434,0.76329243,0.021740887,0.14063945],"study_design_scores_gemma":[0.00016737093,0.00008867894,0.00015933132,0.000031447646,0.000035732653,0.000043494332,0.00006372356,0.21843207,0.00068985857,0.7732954,0.006974947,0.000017857445],"about_ca_topic_score_codex":0.0033275795,"about_ca_topic_score_gemma":0.0039161383,"teacher_disagreement_score":0.009390961,"about_ca_system_score_codex":0.0031176792,"about_ca_system_score_gemma":0.0031744281,"threshold_uncertainty_score":0.03141588},"labels":[],"label_agreement":null},{"id":"W2136811867","doi":"10.1016/s0166-218x(01)00266-9","title":"Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":51,"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; Semidefinite programming; Polytope; Relaxation (psychology); Maximum cut; Intersection (aeronautics); Lagrangian relaxation; Flexibility (engineering); Combinatorics; Metric (unit); Constraint (computer-aided design); Set (abstract data type); Relaxation technique; Feasible region; Regular polygon; Enhanced Data Rates for GSM Evolution; Mathematical optimization; Computer science; Geometry","score_opus":0.03249075521729931,"score_gpt":0.2356156697719298,"score_spread":0.2031249145546305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136811867","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.04358098,0.0005477968,0.90320784,0.0030604568,0.0007146361,0.00017551701,0.00054051424,0.000426568,0.047745664],"genre_scores_gemma":[0.48180935,0.0012529707,0.4691376,0.0015679925,0.0014770981,0.0006648318,0.00118865,0.00051078264,0.042390727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985663,0.00047550825,0.00005883887,0.00022765079,0.00043458628,0.00023711387],"domain_scores_gemma":[0.99770504,0.0010208988,0.00018504317,0.00048341468,0.0003086055,0.00029697752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025456536,0.00161871,0.0013028124,0.0010563929,0.0009165621,0.0025353525,0.0023276117,0.0015396886,0.0110426685],"category_scores_gemma":[0.006216742,0.00073934393,0.0018642179,0.0011671692,0.0015454965,0.00409636,0.0049013337,0.008867021,0.0015753913],"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.00036628725,0.00034194774,0.00022920531,0.00044269074,0.000061483384,0.00021454389,0.0003371474,0.059343275,0.0068344204,0.8352473,0.019656947,0.07692476],"study_design_scores_gemma":[0.000121541,0.00019810024,0.0002677859,0.00009899285,0.000044514334,0.00022129227,0.00012269968,0.26684815,0.002585382,0.71581644,0.013631762,0.00004325016],"about_ca_topic_score_codex":0.0006722791,"about_ca_topic_score_gemma":0.00080538035,"teacher_disagreement_score":0.0110426685,"about_ca_system_score_codex":0.0010449104,"about_ca_system_score_gemma":0.0013792404,"threshold_uncertainty_score":0.03694135},"labels":[],"label_agreement":null},{"id":"W2137517701","doi":"10.1016/j.ejor.2015.05.082","title":"Multi-level facility location as the maximization of a submodular set function","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Concordia University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Set function; Facility location problem; Property (philosophy); Set (abstract data type); Representation (politics); Mathematical optimization; Combinatorial optimization; Function (biology); Maximization; 1-center problem; Mathematics; Computer science; Optimization problem","score_opus":0.3494665569867854,"score_gpt":0.38350349018324087,"score_spread":0.034036933196455454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137517701","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.026610782,0.00041447076,0.96362257,0.00097204244,0.000058156802,0.00009550544,0.0005691044,0.00029137087,0.007366054],"genre_scores_gemma":[0.61321634,0.00064721884,0.3696972,0.00040560216,0.00020827638,0.0004773126,0.00071294943,0.00032907992,0.014306037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979717,0.0010940558,0.000052717704,0.00036864905,0.00025159013,0.00026120772],"domain_scores_gemma":[0.9969319,0.0021705315,0.0002467168,0.00018583582,0.0002083459,0.0002566815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029274612,0.0012283623,0.0029067737,0.0011290971,0.00056018407,0.0031181255,0.0037101055,0.0031937973,0.0076881424],"category_scores_gemma":[0.00724272,0.0012556434,0.0015597296,0.0026384098,0.0015625808,0.0040231547,0.002762343,0.00244499,0.00097560324],"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.00021630572,0.00012643475,0.0005052878,0.0003682124,0.000107056636,0.00014513274,0.000112859736,0.82518166,0.0020655957,0.14644635,0.0062062535,0.018518748],"study_design_scores_gemma":[0.000025315216,0.00004098256,0.00011556679,0.000018309018,0.000017918386,0.000039411112,0.000024085994,0.95349956,0.00030368657,0.045074213,0.00082814804,0.00001270364],"about_ca_topic_score_codex":0.0025746636,"about_ca_topic_score_gemma":0.0032463525,"teacher_disagreement_score":0.0076881424,"about_ca_system_score_codex":0.0034043398,"about_ca_system_score_gemma":0.0017998487,"threshold_uncertainty_score":0.025719345},"labels":[],"label_agreement":null},{"id":"W2137571436","doi":"10.1109/sfcs.1993.366864","title":"Time-space lower bounds for directed s-t connectivity on JAG models","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"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":"Office of Naval Research; Max-Planck-Gesellschaft; University of Toronto","keywords":"Combinatorics; Omega; Upper and lower bounds; Vertex (graph theory); Path (computing); Graph; Directed graph; Mathematics; Space (punctuation); Discrete mathematics; Physics; Computer science","score_opus":0.04273537231301884,"score_gpt":0.23970680874343367,"score_spread":0.19697143643041481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137571436","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.22029525,0.002773512,0.7196771,0.01061386,0.00034028038,0.0007463628,0.0030965114,0.0044155973,0.038041547],"genre_scores_gemma":[0.7777846,0.0022312661,0.20263216,0.0013540703,0.0004417085,0.0009306495,0.0034726835,0.0011127163,0.010040199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99485683,0.0012842568,0.00032932858,0.0011746197,0.0012046023,0.0011503546],"domain_scores_gemma":[0.94933337,0.03884877,0.003089709,0.004384106,0.0020623456,0.002281534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00349214,0.0028258776,0.0024139383,0.0023247323,0.0029565545,0.0057750093,0.005439208,0.003629373,0.014912457],"category_scores_gemma":[0.03363045,0.0013140943,0.0033145314,0.003506393,0.0048548044,0.020048935,0.006769033,0.0055802427,0.002075818],"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.002099157,0.00062080915,0.0072907913,0.0011479792,0.0002644844,0.00068127946,0.001397916,0.38613755,0.015387071,0.45449078,0.03374903,0.096733175],"study_design_scores_gemma":[0.00012576499,0.00022383049,0.0006491108,0.00008030488,0.00014749268,0.00043110628,0.00029908973,0.6459156,0.0066277566,0.33962783,0.0058184564,0.000053716958],"about_ca_topic_score_codex":0.0054706056,"about_ca_topic_score_gemma":0.007389456,"teacher_disagreement_score":0.014912457,"about_ca_system_score_codex":0.005365161,"about_ca_system_score_gemma":0.0030097007,"threshold_uncertainty_score":0.04988712},"labels":[],"label_agreement":null},{"id":"W2137594903","doi":"10.1109/ipps.1999.760446","title":"Coarse grained parallel maximum matching in convex bipartite graphs","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Carleton University","funders":"","keywords":"Bipartite graph; Combinatorics; Binary logarithm; Computation; Matching (statistics); Regular polygon; Mathematics; Graph; Computational complexity theory; Algorithm; Statistics","score_opus":0.022486532528354888,"score_gpt":0.2465879669221275,"score_spread":0.2241014343937726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137594903","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.051447842,0.00019412054,0.94114035,0.00021625827,0.000022241611,0.000113561066,0.00016426758,0.0015228481,0.005178424],"genre_scores_gemma":[0.4099148,0.00014186121,0.58555835,0.00009118025,0.000024876708,0.00019459207,0.00054150197,0.00021101115,0.0033218456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918956,0.00021833045,0.000037134992,0.00020898545,0.00019614307,0.00014982482],"domain_scores_gemma":[0.9992071,0.00030517988,0.00008188301,0.00026307424,0.000087938504,0.00005493969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006823539,0.00064915227,0.0011931371,0.0007307767,0.00095678883,0.0008976049,0.0016806936,0.0007727668,0.0043539735],"category_scores_gemma":[0.0020640444,0.000575007,0.0007109071,0.0017042737,0.0009143153,0.002352165,0.0019668038,0.0008148309,0.001081485],"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.0005136004,0.00016495519,0.0008550458,0.00022047546,0.00006739432,0.00014947864,0.00017881143,0.7480419,0.011642759,0.051642604,0.005495122,0.18102781],"study_design_scores_gemma":[0.000032802138,0.000028597793,0.0001439625,0.0000040722457,0.000008872516,0.00002965931,0.000026217122,0.9513328,0.002651287,0.04434001,0.0013957996,0.000006074606],"about_ca_topic_score_codex":0.0064757774,"about_ca_topic_score_gemma":0.007094087,"teacher_disagreement_score":0.0064757774,"about_ca_system_score_codex":0.0013534114,"about_ca_system_score_gemma":0.0009784633,"threshold_uncertainty_score":0.014565468},"labels":[],"label_agreement":null},{"id":"W2139332235","doi":"10.1007/s00454-011-9352-x","title":"Improved Approximation for Guarding Simple Galleries from the Perimeter","year":2011,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":46,"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; McGill University","funders":"","keywords":"Combinatorics; Mathematics; Perimeter; Approximation algorithm; Polygon (computer graphics); Simple polygon; Binary logarithm; Guard (computer science); Time complexity; Dimension (graph theory); Simple (philosophy); Discrete mathematics; Algorithm; Regular polygon; Geometry; Computer science","score_opus":0.04409133552517794,"score_gpt":0.2635143971703761,"score_spread":0.21942306164519818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139332235","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.20021945,0.00076572684,0.7705725,0.0007084017,0.00025998286,0.00023100013,0.00069744757,0.0028914725,0.02365389],"genre_scores_gemma":[0.5953966,0.0006052858,0.388674,0.00022580486,0.0001296776,0.00019502702,0.0016222592,0.00065513357,0.012496252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999014,0.000197086,0.000050723247,0.00017650408,0.00036998058,0.00019160727],"domain_scores_gemma":[0.996682,0.0016539013,0.00019761965,0.0010509343,0.00019292107,0.00022259145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092827744,0.0014652349,0.0026635902,0.001327052,0.0007357004,0.0022113675,0.0027274184,0.0018936791,0.011001517],"category_scores_gemma":[0.007009465,0.0008198966,0.0017361781,0.0017971882,0.001527546,0.0041722353,0.0054019354,0.0029917066,0.002237027],"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.0014360471,0.0004314761,0.00227731,0.00059500476,0.0001490934,0.00045387802,0.00059678487,0.48083836,0.010987504,0.20168346,0.023038048,0.2775131],"study_design_scores_gemma":[0.00007821384,0.00011354798,0.00024003949,0.000038177062,0.000029519435,0.00012807272,0.00007611983,0.86363244,0.0019126745,0.13101397,0.002719147,0.00001807946],"about_ca_topic_score_codex":0.0023750744,"about_ca_topic_score_gemma":0.002641566,"teacher_disagreement_score":0.011001517,"about_ca_system_score_codex":0.0011703828,"about_ca_system_score_gemma":0.0010074999,"threshold_uncertainty_score":0.036803782},"labels":[],"label_agreement":null},{"id":"W2140591634","doi":"10.1007/11523468_46","title":"Cache-Oblivious Planar Shortest Paths","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Dalhousie University","funders":"","keywords":"Computer science; Cache; Parallel computing; Planar; Operating system","score_opus":0.02048433727542831,"score_gpt":0.23870999180391878,"score_spread":0.21822565452849046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140591634","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.15871415,0.0030057775,0.6801125,0.0029414105,0.00039485746,0.00042862352,0.0033989113,0.007779997,0.14322373],"genre_scores_gemma":[0.65775055,0.00263819,0.26137662,0.00056568166,0.00025852327,0.0005057018,0.003916661,0.0012511972,0.0717369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992342,0.00012042113,0.000030590512,0.00014833723,0.00030587203,0.00016050786],"domain_scores_gemma":[0.9979163,0.00080764055,0.0001377982,0.0008718672,0.00019139142,0.00007503306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005465054,0.0007213304,0.0010209477,0.0008205434,0.0011778319,0.0016823307,0.0026287006,0.001154578,0.011585327],"category_scores_gemma":[0.004320752,0.00063749467,0.00054765464,0.0028008458,0.0008595274,0.005252604,0.0023918094,0.0019225724,0.0028099942],"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.0011024037,0.00029353308,0.00074622047,0.0010498079,0.00011320772,0.00016672371,0.00048222867,0.22221255,0.013803992,0.34821972,0.08090376,0.33090594],"study_design_scores_gemma":[0.00021349451,0.00020054307,0.00044079422,0.00009827721,0.00009596365,0.0002707888,0.0001687644,0.32857135,0.011863434,0.6224373,0.035603356,0.0000359932],"about_ca_topic_score_codex":0.0019683207,"about_ca_topic_score_gemma":0.0038435787,"teacher_disagreement_score":0.011585327,"about_ca_system_score_codex":0.0016226054,"about_ca_system_score_gemma":0.0017335518,"threshold_uncertainty_score":0.038756788},"labels":[],"label_agreement":null},{"id":"W2140887702","doi":"","title":"The space complexity of recognizing well-parenthesized expressions","year":2010,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Conjecture; Parenthesis; Space (punctuation); Mathematics; Expression (computer science); Computer science; Combinatorics; Pure mathematics; Discrete mathematics; Algorithm","score_opus":0.09921090538835141,"score_gpt":0.19820078894952414,"score_spread":0.09898988356117273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140887702","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.40531644,0.0007476773,0.5635566,0.0055396818,0.00027968732,0.00033416713,0.0022421281,0.0068634516,0.0151201645],"genre_scores_gemma":[0.81549174,0.00039722078,0.17217737,0.0006896862,0.00019419943,0.00032583284,0.0025577294,0.0005816731,0.0075844256],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996498,0.00072374655,0.00032978065,0.0009792455,0.00075706997,0.00071217574],"domain_scores_gemma":[0.98483086,0.009058239,0.0011047582,0.0038242263,0.0008071849,0.00037478263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020420426,0.0008772154,0.0010504363,0.00052239787,0.00120916,0.003173752,0.0029887953,0.001964423,0.010227206],"category_scores_gemma":[0.012968109,0.0005691349,0.0017541411,0.0014569563,0.0016372824,0.01089564,0.0030706236,0.0030144663,0.002455421],"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.0051553063,0.0006998864,0.013944679,0.001377708,0.00028389998,0.00081140327,0.0015766498,0.16715792,0.12934707,0.19026414,0.034046207,0.45533517],"study_design_scores_gemma":[0.00018746835,0.00036488453,0.0014689955,0.000055923138,0.00015379574,0.0006010246,0.00039991533,0.66590685,0.060479358,0.2640505,0.006259601,0.00007169772],"about_ca_topic_score_codex":0.0022481114,"about_ca_topic_score_gemma":0.0036380638,"teacher_disagreement_score":0.010227206,"about_ca_system_score_codex":0.0017361359,"about_ca_system_score_gemma":0.0028430151,"threshold_uncertainty_score":0.034213424},"labels":[],"label_agreement":null},{"id":"W2141156487","doi":"10.1145/2650183","title":"Approximating Rooted Steiner Networks","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Combinatorics; Mathematics; Generalization; Undirected graph; Linear programming relaxation; Approximation algorithm; Discrete mathematics; Upper and lower bounds; Linear programming; Graph; Mathematical optimization","score_opus":0.019291360365911194,"score_gpt":0.2397969814353036,"score_spread":0.2205056210693924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141156487","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.13519381,0.0015880752,0.83205074,0.0018743665,0.00011657591,0.00013558993,0.0011357998,0.0010378562,0.026867235],"genre_scores_gemma":[0.7053896,0.0015035742,0.2821474,0.0004279136,0.00015692509,0.00020942537,0.0021801596,0.00039038705,0.0075945444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819994,0.00056921423,0.000082705694,0.00041213457,0.00047917746,0.0002567365],"domain_scores_gemma":[0.99287087,0.0050399513,0.0005517781,0.00078244123,0.00044561308,0.0003093852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013732022,0.00097565394,0.0010949861,0.0009565181,0.0006406549,0.0020226133,0.0023790277,0.0013340972,0.006170398],"category_scores_gemma":[0.013624526,0.0007790649,0.00093279016,0.001860473,0.0010434461,0.005006231,0.0024776538,0.0023902059,0.0008086868],"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.00035951642,0.00013465963,0.001770526,0.00041361933,0.000071947965,0.00015728435,0.00029307386,0.7783766,0.0037517424,0.13705784,0.009215138,0.06839809],"study_design_scores_gemma":[0.000030528776,0.000040554136,0.00035540696,0.000034736688,0.000020259702,0.00009708486,0.000083646744,0.87132794,0.0010303213,0.12365412,0.0033160585,0.000009277849],"about_ca_topic_score_codex":0.0022156883,"about_ca_topic_score_gemma":0.0034474225,"teacher_disagreement_score":0.006170398,"about_ca_system_score_codex":0.0021389644,"about_ca_system_score_gemma":0.00091963075,"threshold_uncertainty_score":0.020642042},"labels":[],"label_agreement":null},{"id":"W2143722695","doi":"10.1109/focs.2013.70","title":"Average Case Lower Bounds for Monotone Switching Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"University of Toronto","funders":"","keywords":"Monotone polygon; Corollary; Mathematics; Boolean function; Upper and lower bounds; Computation; Discrete mathematics; Function (biology); Exponential function; Combinatorics; Applied mathematics; Algorithm; Mathematical analysis","score_opus":0.01514264386887832,"score_gpt":0.23729383755771952,"score_spread":0.2221511936888412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143722695","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.1366783,0.0035832284,0.76653486,0.006605025,0.000293631,0.00026426237,0.0017975281,0.0014729507,0.08277024],"genre_scores_gemma":[0.88532853,0.0034633577,0.09340963,0.0018874985,0.00076212105,0.0006284061,0.0012916111,0.0007498734,0.012479085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935028,0.0009134799,0.00023809171,0.001220962,0.0025049073,0.001619774],"domain_scores_gemma":[0.95618194,0.03231007,0.0021116398,0.0048097586,0.0031760414,0.0014106331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039984244,0.0016772562,0.0017230699,0.0025582123,0.0019086039,0.0042358553,0.0044885213,0.0020191513,0.0122626955],"category_scores_gemma":[0.03672531,0.0008416019,0.0022813862,0.0022152301,0.003172063,0.014074395,0.005192148,0.0071799336,0.0013726975],"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.00077002024,0.00029275517,0.005111958,0.0007960985,0.00014301587,0.00032580525,0.0006525937,0.17062247,0.015902326,0.7182819,0.012258524,0.074842505],"study_design_scores_gemma":[0.000041557978,0.00013232918,0.000993649,0.00010285983,0.00007642393,0.00036325358,0.0001366805,0.4243355,0.010188195,0.5577799,0.0057972856,0.00005239976],"about_ca_topic_score_codex":0.0018964326,"about_ca_topic_score_gemma":0.0022970112,"teacher_disagreement_score":0.0122626955,"about_ca_system_score_codex":0.005607537,"about_ca_system_score_gemma":0.0024539079,"threshold_uncertainty_score":0.041022837},"labels":[],"label_agreement":null},{"id":"W2144918053","doi":"10.1109/acc.2013.6580451","title":"The maximum traveling salesman problem with submodular rewards","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Submodular set function; Travelling salesman problem; Hamiltonian path; Greedy algorithm; Combinatorics; Approximation algorithm; Mathematics; Graph; Curvature; Function (biology); Matching (statistics); Computer science; Mathematical optimization; Discrete mathematics; Algorithm","score_opus":0.008415098594869191,"score_gpt":0.19089546495660148,"score_spread":0.1824803663617323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144918053","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.11739068,0.0011110961,0.8688416,0.0014844399,0.00014668406,0.00018936436,0.0005107439,0.00081399916,0.009511439],"genre_scores_gemma":[0.67587554,0.0006840456,0.31461957,0.00031338562,0.00017505013,0.00023586433,0.0005071174,0.00022033059,0.007369095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916434,0.00034395486,0.00002843921,0.0002204599,0.00011291044,0.00012988293],"domain_scores_gemma":[0.9986059,0.00096261594,0.00014176017,0.000106972824,0.000072329756,0.000110343986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012138053,0.0011272412,0.0015550333,0.00050403894,0.00059864053,0.0012682636,0.0016529519,0.0015891887,0.0043014176],"category_scores_gemma":[0.0042461352,0.00053073815,0.0007604742,0.0012855852,0.0007792179,0.0037439512,0.0012483246,0.0013653596,0.00067990605],"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.00047747642,0.00020488071,0.0008118369,0.00042107722,0.00012658171,0.00035348863,0.0001696175,0.7876072,0.0022632205,0.09619802,0.007960089,0.10340651],"study_design_scores_gemma":[0.000057515175,0.00010314416,0.00021971458,0.000015389562,0.000019225214,0.0001472019,0.00005206797,0.88563865,0.00078623666,0.110246986,0.0027001756,0.000013709785],"about_ca_topic_score_codex":0.0014209063,"about_ca_topic_score_gemma":0.001391916,"teacher_disagreement_score":0.0043014176,"about_ca_system_score_codex":0.001039111,"about_ca_system_score_gemma":0.001090553,"threshold_uncertainty_score":0.014389694},"labels":[],"label_agreement":null},{"id":"W2145866065","doi":"10.1007/s00453-012-9740-5","title":"Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems","year":2013,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":56,"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":"Mathematics; Combinatorics; Cover (algebra); Bounded function; Tree (set theory); Approximation algorithm; Theory of computation; Upper and lower bounds; Discrete mathematics; Graph; Algorithm","score_opus":0.023544572033005622,"score_gpt":0.23902169803769704,"score_spread":0.21547712600469143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145866065","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.059198365,0.0047024386,0.9138435,0.00292172,0.00043107395,0.00024271834,0.0009970166,0.0017213565,0.015941853],"genre_scores_gemma":[0.3678501,0.002386152,0.61238027,0.0008549765,0.0010094155,0.0006043062,0.0028500033,0.0009654165,0.011099452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956683,0.0013618771,0.00020210088,0.00072796305,0.0013466361,0.00069302786],"domain_scores_gemma":[0.9849182,0.0105370525,0.0007925817,0.002273247,0.000882919,0.00059614086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004585013,0.0023614361,0.003174567,0.002699788,0.0014509188,0.0047442922,0.0066722115,0.002882036,0.01017104],"category_scores_gemma":[0.024024595,0.0012742577,0.0026249927,0.0054790433,0.0017954814,0.011724981,0.0044418145,0.00648113,0.0017207593],"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.0021710263,0.0009802533,0.003203803,0.0009125551,0.0002526304,0.00014112458,0.0005599051,0.40576866,0.003697057,0.19631135,0.036006503,0.34999523],"study_design_scores_gemma":[0.00014319572,0.000076760894,0.00046886562,0.000044302637,0.00009739319,0.000105053565,0.000068706315,0.86289716,0.0010351668,0.13156255,0.003479321,0.000021656504],"about_ca_topic_score_codex":0.005012253,"about_ca_topic_score_gemma":0.008408488,"teacher_disagreement_score":0.01017104,"about_ca_system_score_codex":0.005555797,"about_ca_system_score_gemma":0.003373533,"threshold_uncertainty_score":0.040310264},"labels":[],"label_agreement":null},{"id":"W2148177011","doi":"10.1109/sfcs.2001.959906","title":"Approximating directed multicuts","year":2001,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo","funders":"","keywords":"Divide and conquer algorithms; Linear programming; Multi-commodity flow problem; Approximation algorithm; Flow (mathematics); Computer science; Mathematical optimization; Mathematics; Upper and lower bounds; Combinatorics; Discrete mathematics; Flow network; Algorithm","score_opus":0.02410645982831961,"score_gpt":0.2473935594959544,"score_spread":0.2232870996676348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148177011","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.13712211,0.0011951728,0.841604,0.00057247834,0.00011176468,0.00013085197,0.00048789816,0.00085224264,0.01792346],"genre_scores_gemma":[0.67185223,0.00072644115,0.31938466,0.00021097169,0.00007425095,0.00017347108,0.00076923217,0.00022439452,0.006584393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988493,0.00030486527,0.00004703713,0.0002743781,0.00030245443,0.00022194232],"domain_scores_gemma":[0.9959921,0.0025034864,0.00033455095,0.0005570024,0.0004311901,0.00018158481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012704718,0.0009708618,0.0011293058,0.0012792288,0.0010303451,0.001818845,0.0024181618,0.0013744215,0.004002431],"category_scores_gemma":[0.010041204,0.000642372,0.0006965306,0.0024162245,0.0010083119,0.0025726415,0.002191127,0.0014666484,0.0005951716],"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.00031114437,0.00009270234,0.0019100752,0.00022598724,0.00005076473,0.00017056492,0.00020357237,0.7609855,0.0021777805,0.1515392,0.005302821,0.07702987],"study_design_scores_gemma":[0.000011097062,0.000021351709,0.00012348156,0.000017860059,0.00001038228,0.00006244572,0.000044151275,0.9490017,0.0012060289,0.047550034,0.0019458308,0.000005503675],"about_ca_topic_score_codex":0.003937961,"about_ca_topic_score_gemma":0.005149527,"teacher_disagreement_score":0.004002431,"about_ca_system_score_codex":0.0020702041,"about_ca_system_score_gemma":0.000960815,"threshold_uncertainty_score":0.01502043},"labels":[],"label_agreement":null},{"id":"W2149512005","doi":"10.1109/spdp.1994.346125","title":"Good algorithm design style for multiprocessors","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"York University","funders":"","keywords":"Computer science; Constant (computer programming); Style (visual arts); Word (group theory); Parallel computing; Algorithm; Programming language; Mathematics","score_opus":0.06461770496559291,"score_gpt":0.25339448657333097,"score_spread":0.18877678160773806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149512005","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.0010464208,0.00022528024,0.9944559,0.0003959878,0.00010407692,0.000055862005,0.000028149383,0.00045937818,0.0032290192],"genre_scores_gemma":[0.043760907,0.00046393555,0.94716674,0.00089720625,0.00018552793,0.0004983787,0.00012223837,0.0006178025,0.006287298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99486166,0.0021741327,0.00038650972,0.00073853147,0.0016008317,0.0002383887],"domain_scores_gemma":[0.99431664,0.0015138522,0.00023646711,0.002586821,0.001133892,0.00021228819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004047914,0.0015676805,0.0008313218,0.00089858513,0.0010856139,0.0027754942,0.0027941852,0.0017927387,0.008744648],"category_scores_gemma":[0.008711747,0.0009938097,0.0014071581,0.0014395898,0.0022071535,0.004971247,0.0023362928,0.004082025,0.004479813],"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.00020522233,0.00009058776,0.00044095135,0.0006159744,0.00010849756,0.00012696849,0.00028830877,0.052826554,0.00816129,0.79494125,0.016253179,0.12594122],"study_design_scores_gemma":[0.00014512376,0.00018896142,0.00013383676,0.00008969281,0.00007114182,0.00024587067,0.000066626,0.17805299,0.009434148,0.71023333,0.10130367,0.000034523142],"about_ca_topic_score_codex":0.00030714745,"about_ca_topic_score_gemma":0.00067255215,"teacher_disagreement_score":0.008744648,"about_ca_system_score_codex":0.0014331179,"about_ca_system_score_gemma":0.000996397,"threshold_uncertainty_score":0.02925378},"labels":[],"label_agreement":null},{"id":"W2149565746","doi":"10.1145/1824777.1824786","title":"On distributing symmetric streaming computations","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":66,"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; Computation; Sublinear function; Communication complexity; Theoretical computer science; Computational complexity theory; Class (philosophy); Streaming algorithm; Algorithm; Distributed computing; Mathematics; Upper and lower bounds; Discrete mathematics","score_opus":0.020217592333712276,"score_gpt":0.2677943535910513,"score_spread":0.24757676125733902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149565746","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.052179266,0.00023433178,0.9333778,0.001110467,0.00013727705,0.00018672405,0.00018930327,0.0009795272,0.01160531],"genre_scores_gemma":[0.74820936,0.0005464114,0.23854446,0.0006230081,0.00029357368,0.00047938435,0.00048737467,0.0003825309,0.010434054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964309,0.0010610505,0.00022742711,0.000741948,0.0010477182,0.000490984],"domain_scores_gemma":[0.98938763,0.0050167073,0.000654683,0.0033900647,0.0011730262,0.0003778624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031795746,0.00080782955,0.0011855887,0.0007659183,0.0015173402,0.0025352826,0.0021105935,0.0012022491,0.006023813],"category_scores_gemma":[0.018440641,0.0005402242,0.0010359313,0.0014021972,0.0030650862,0.0077213245,0.0036398754,0.0022271643,0.001173383],"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.0004708289,0.00010722416,0.0014321075,0.00015300176,0.00003802632,0.00012419315,0.00028527208,0.17198889,0.004966989,0.7784947,0.003977944,0.0379609],"study_design_scores_gemma":[0.000071567134,0.00007873781,0.00015083868,0.000022991586,0.000017594217,0.00007664783,0.0000560821,0.55206794,0.0030649179,0.43987772,0.0044958494,0.000019032104],"about_ca_topic_score_codex":0.0019360734,"about_ca_topic_score_gemma":0.0014388182,"teacher_disagreement_score":0.006023813,"about_ca_system_score_codex":0.0024259642,"about_ca_system_score_gemma":0.0025368964,"threshold_uncertainty_score":0.020151675},"labels":[],"label_agreement":null},{"id":"W2151077859","doi":"10.1007/11523468_76","title":"How Well Can Primal-Dual and Local-Ratio Algorithms Perform?","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Steiner tree problem; Combinatorics; Scheduling (production processes); Approximation algorithm; Dual (grammatical number); Computer science; Mathematics; Set cover problem; Set (abstract data type); Tree (set theory); Algorithm; Discrete mathematics; Mathematical optimization","score_opus":0.01625972781171476,"score_gpt":0.22452684843186915,"score_spread":0.2082671206201544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151077859","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.068797775,0.015298614,0.75479734,0.022471333,0.002051314,0.00014139927,0.0007152819,0.0039430032,0.13178396],"genre_scores_gemma":[0.6688237,0.005958883,0.29331842,0.0027134295,0.0016578804,0.00022125499,0.0008805306,0.00211446,0.024311457],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924017,0.004295329,0.00020921465,0.0010303477,0.0013412314,0.00072229083],"domain_scores_gemma":[0.98141265,0.01228649,0.00076638855,0.0031254892,0.0018292348,0.00057968975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013459327,0.002166805,0.002716429,0.001403429,0.0013362399,0.0071526095,0.0027161038,0.0041282927,0.011627791],"category_scores_gemma":[0.057045355,0.00084091263,0.0013302724,0.002158193,0.0026033523,0.015330299,0.00259449,0.0036279713,0.00912565],"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.0014989394,0.00073884096,0.0033947797,0.00051942904,0.00031275756,0.00007145177,0.00021550799,0.13148667,0.0015156859,0.34525785,0.05588973,0.45909828],"study_design_scores_gemma":[0.00012755752,0.0001658006,0.0007469909,0.00012155209,0.000074350086,0.00016058807,0.00023788838,0.418604,0.0028023904,0.56537443,0.011544761,0.0000397334],"about_ca_topic_score_codex":0.0013889173,"about_ca_topic_score_gemma":0.0011534975,"teacher_disagreement_score":0.013459327,"about_ca_system_score_codex":0.0014008691,"about_ca_system_score_gemma":0.0019194748,"threshold_uncertainty_score":0.07118058},"labels":[],"label_agreement":null},{"id":"W2151534739","doi":"10.5555/1283383.1283519","title":"Approximation algorithms for node-weighted buy-at-bulk network design","year":2007,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":33,"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":"Approximation algorithm; Logarithm; Node (physics); Network planning and design; Computer science; Approximation theory; Constant (computer programming); Algorithm; Mathematics; Mathematical optimization; Physics; Computer network; Mathematical analysis","score_opus":0.032800880178982764,"score_gpt":0.2760675828761797,"score_spread":0.24326670269719697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151534739","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.019214038,0.00071903877,0.9720091,0.0006151235,0.00008245809,0.00015834768,0.00033428473,0.0019119486,0.0049556172],"genre_scores_gemma":[0.3007548,0.0007846809,0.6894267,0.00038906958,0.00015670751,0.00044096794,0.001678409,0.0005305565,0.0058380365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99748373,0.00076212327,0.00015145972,0.0005844499,0.0005658954,0.00045226407],"domain_scores_gemma":[0.9945879,0.002846535,0.00050531153,0.0014772995,0.00035554855,0.00022730889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024761176,0.0021470166,0.0018556427,0.0011686628,0.00093673065,0.0025184385,0.0038160165,0.0021223046,0.011343919],"category_scores_gemma":[0.009902523,0.0010492702,0.0014907803,0.0030901118,0.0010342657,0.0065443567,0.002542355,0.0028531405,0.0025365744],"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.0012746323,0.00063834805,0.0014877507,0.00068622886,0.00019433642,0.00016317143,0.0002886533,0.63066906,0.0058070393,0.058731046,0.019656146,0.28040358],"study_design_scores_gemma":[0.00015020264,0.00011216031,0.0001688801,0.000023124298,0.000044856315,0.00011671228,0.000051640927,0.9183702,0.001696976,0.076730825,0.0025148261,0.000019541927],"about_ca_topic_score_codex":0.0024670968,"about_ca_topic_score_gemma":0.0037564985,"teacher_disagreement_score":0.011343919,"about_ca_system_score_codex":0.0023892862,"about_ca_system_score_gemma":0.0017574005,"threshold_uncertainty_score":0.037949204},"labels":[],"label_agreement":null},{"id":"W2152454366","doi":"10.1109/lics.2011.12","title":"Formalizing Randomized Matching Algorithms","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Bipartite graph; Correctness; Lemma (botany); Blossom algorithm; 3-dimensional matching; Factor-critical graph; Algorithm; Matching (statistics); Perfect graph theorem; Computer science; Mathematics; Probabilistic logic; Theoretical computer science; Discrete mathematics; Graph; Voltage graph; Line graph; Artificial intelligence","score_opus":0.050079969346586865,"score_gpt":0.24624360883025967,"score_spread":0.1961636394836728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152454366","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.0034816389,0.00035892232,0.9842054,0.00094953325,0.00012408105,0.00015132602,0.00019421458,0.0007497299,0.009785188],"genre_scores_gemma":[0.26932004,0.0012948542,0.7150337,0.0013766994,0.00057916064,0.001050103,0.0009767979,0.00063531817,0.009733326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9813638,0.006559605,0.0014040582,0.0036687846,0.0053053712,0.0016984101],"domain_scores_gemma":[0.9781781,0.014379683,0.001072711,0.0041127405,0.0019067678,0.00035005886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011788181,0.0015079129,0.0017520915,0.0025966614,0.0021293578,0.007137114,0.0066212486,0.0035807076,0.00981042],"category_scores_gemma":[0.041752975,0.001349379,0.0029706159,0.0033557345,0.007718975,0.016716847,0.007051131,0.0060695545,0.002144354],"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.000015828751,0.00001943443,0.00006559434,0.000052816322,0.000009758481,0.000020547632,0.00006335408,0.011008035,0.0001872369,0.98151326,0.0006425674,0.006401472],"study_design_scores_gemma":[0.000033000946,0.000016839971,0.0000308294,0.00003143005,0.0000129263035,0.000030457528,0.000025828864,0.07266652,0.0006390578,0.9202565,0.006241168,0.000015335265],"about_ca_topic_score_codex":0.0039002132,"about_ca_topic_score_gemma":0.0029097272,"teacher_disagreement_score":0.011788181,"about_ca_system_score_codex":0.005956349,"about_ca_system_score_gemma":0.0055849496,"threshold_uncertainty_score":0.062342584},"labels":[],"label_agreement":null},{"id":"W2153601281","doi":"10.1016/j.dam.2014.07.005","title":"About the minimum mean cycle-canceling algorithm","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Function (biology); Constructive; Mathematical optimization; Linear programming; Acceleration; Time complexity; Computer science","score_opus":0.017111570593093244,"score_gpt":0.24394862018535263,"score_spread":0.2268370495922594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153601281","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.15713765,0.0022181326,0.7565204,0.0073993583,0.0011611383,0.0002024302,0.00073582557,0.0010014421,0.07362361],"genre_scores_gemma":[0.69089806,0.0017803832,0.2673426,0.0029286447,0.0012114043,0.00049989286,0.0011953862,0.0010108046,0.033132866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985448,0.0004914301,0.00006184479,0.00036660506,0.0003482622,0.00018694022],"domain_scores_gemma":[0.9888681,0.008175487,0.00043922765,0.0011933708,0.00093212584,0.00039171104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002303023,0.0011056572,0.001685834,0.0011318082,0.0021358787,0.0028767788,0.0034220745,0.0033127596,0.012161505],"category_scores_gemma":[0.024079155,0.0005506602,0.0013617383,0.0018886368,0.002685849,0.0055677835,0.0024761658,0.0043877866,0.0015485995],"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.0007117767,0.00011852371,0.0009418325,0.00032022927,0.00007535694,0.00006385076,0.000193075,0.08370795,0.003069221,0.82789874,0.017615447,0.065283984],"study_design_scores_gemma":[0.000108698885,0.000057104873,0.00022697655,0.000034875367,0.000032910182,0.00006911753,0.00003255712,0.1705115,0.0012544027,0.8250409,0.0026014678,0.000029528926],"about_ca_topic_score_codex":0.002089324,"about_ca_topic_score_gemma":0.0015984747,"teacher_disagreement_score":0.012161505,"about_ca_system_score_codex":0.0017115794,"about_ca_system_score_gemma":0.0028741483,"threshold_uncertainty_score":0.040684223},"labels":[],"label_agreement":null},{"id":"W2153817623","doi":"10.1016/j.dam.2015.01.004","title":"Informative path planning as a maximum traveling salesman problem with submodular rewards","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"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":"Submodular set function; Mathematics; Travelling salesman problem; Greedy algorithm; Mathematical optimization; Hamiltonian path; Graph; Combinatorics","score_opus":0.029510440279979126,"score_gpt":0.2557570293357331,"score_spread":0.22624658905575395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153817623","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.077622175,0.0007085828,0.90077406,0.0018268527,0.00013532164,0.00022300491,0.00088725105,0.0004561899,0.017366502],"genre_scores_gemma":[0.62866056,0.0007507705,0.34548533,0.00032989657,0.00026172635,0.00049005175,0.00087334856,0.00030525608,0.022843122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861765,0.0005799998,0.000055059503,0.0003738211,0.00021396398,0.0001595217],"domain_scores_gemma":[0.9970553,0.0021907722,0.00025122994,0.00014792953,0.0001301127,0.00022463605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016283488,0.0011998301,0.0026745764,0.0011468328,0.0009072765,0.0029688273,0.0032416559,0.0035645321,0.00869057],"category_scores_gemma":[0.0059482832,0.0014852117,0.0014720663,0.0027944485,0.0014182464,0.004416866,0.002072052,0.0028324353,0.0006503484],"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.00023400075,0.00016404843,0.0003670733,0.0003312748,0.00009878391,0.00023192259,0.00014813192,0.78075397,0.0009126958,0.1893675,0.0050504655,0.022340128],"study_design_scores_gemma":[0.000048091068,0.00006002132,0.00010244566,0.000021721495,0.000027610293,0.0000463643,0.000038295424,0.8599496,0.00026415352,0.13818596,0.001240243,0.000015458487],"about_ca_topic_score_codex":0.0034129298,"about_ca_topic_score_gemma":0.0048194947,"teacher_disagreement_score":0.00869057,"about_ca_system_score_codex":0.0019704998,"about_ca_system_score_gemma":0.001957984,"threshold_uncertainty_score":0.029072821},"labels":[],"label_agreement":null},{"id":"W2156206152","doi":"10.1109/icde.2013.6544815","title":"Scalable maximum clique computation using MapReduce","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":86,"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; Amazon Web Services","keywords":"Scalability; Computer science; Clique; Computation; Parallel computing; Graph partition; Key (lock); Fault tolerance; Graph; Theoretical computer science; Algorithm; Distributed computing; Mathematics; Combinatorics","score_opus":0.034483483281057714,"score_gpt":0.26819890879772396,"score_spread":0.23371542551666624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156206152","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.02035044,0.0002846461,0.969627,0.00046522784,0.00013136101,0.00013058673,0.0003076951,0.0025228471,0.0061801514],"genre_scores_gemma":[0.386762,0.00032341157,0.6054281,0.00019840733,0.00015683535,0.00027799176,0.0011348826,0.0006074872,0.005110784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915934,0.00017834238,0.00002666411,0.00016509397,0.00032737118,0.00014321768],"domain_scores_gemma":[0.99922764,0.0002594737,0.000046132587,0.0002352487,0.00014101219,0.00009054479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061427016,0.00086194597,0.0011315246,0.0009256181,0.0016472419,0.00108453,0.0024033617,0.000886749,0.003861727],"category_scores_gemma":[0.0019697384,0.0004814289,0.0013470774,0.0016671338,0.00071366475,0.00222275,0.0019336757,0.0011899088,0.0008185282],"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.00033673958,0.00033371337,0.0011363899,0.00044410877,0.00029246986,0.00050174224,0.00028801901,0.6443832,0.024197286,0.1043412,0.036139842,0.18760534],"study_design_scores_gemma":[0.000055388227,0.000032853546,0.00019448763,0.000008940622,0.000022084696,0.00008349992,0.00005308494,0.9321552,0.0055586775,0.054867834,0.0069489838,0.000018997389],"about_ca_topic_score_codex":0.0071015605,"about_ca_topic_score_gemma":0.01295911,"teacher_disagreement_score":0.0071015605,"about_ca_system_score_codex":0.0010178573,"about_ca_system_score_gemma":0.0019511906,"threshold_uncertainty_score":0.01412046},"labels":[],"label_agreement":null},{"id":"W2156300926","doi":"10.1007/s00453-011-9503-8","title":"A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs","year":2011,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"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":"Combinatorics; Mathematics; Partition (number theory); Polynomial-time approximation scheme; Approximation algorithm; Vertex (graph theory); Clique graph; Unit disk graph; Clique; Upper and lower bounds; Adjacency matrix; Discrete mathematics; Unit disk; Graph; Line graph; Computer science; Graph power","score_opus":0.08879720214434278,"score_gpt":0.26280306556968097,"score_spread":0.1740058634253382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156300926","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.06055091,0.0004188852,0.92549294,0.0014961304,0.00018369094,0.0003743523,0.0009039464,0.001297015,0.009282144],"genre_scores_gemma":[0.60052884,0.0005383921,0.3842064,0.0006506916,0.0003540078,0.00092240504,0.0017823606,0.00075111317,0.010265775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957195,0.0012997848,0.0002287464,0.0013742388,0.00094532495,0.00043246383],"domain_scores_gemma":[0.9897994,0.0048594847,0.00093332573,0.0024874709,0.0010280359,0.00089233276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033610368,0.0020699361,0.004168251,0.0014989446,0.0021809444,0.0052644694,0.005918504,0.0038370064,0.008707983],"category_scores_gemma":[0.019235438,0.0012663961,0.0029457957,0.0026606014,0.00277149,0.0077910717,0.007265693,0.0052299257,0.0017414637],"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.002301493,0.0005175834,0.001999141,0.0009957452,0.0003818343,0.00029239824,0.0007019124,0.45217404,0.019958187,0.37277505,0.023924092,0.12397847],"study_design_scores_gemma":[0.0001002497,0.0002028068,0.00027708025,0.000040218434,0.00007408075,0.00010871183,0.0001028941,0.7820788,0.0023814482,0.21222529,0.0023716558,0.000036773108],"about_ca_topic_score_codex":0.002108656,"about_ca_topic_score_gemma":0.0018635197,"teacher_disagreement_score":0.008707983,"about_ca_system_score_codex":0.0030643793,"about_ca_system_score_gemma":0.003672347,"threshold_uncertainty_score":0.029131055},"labels":[],"label_agreement":null},{"id":"W2157381209","doi":"10.1109/ccc.2011.15","title":"Approximation Algorithms for QMA-Complete Problems","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Approximation algorithm; Constraint satisfaction problem; Polynomial-time approximation scheme; Approximation theory; Class (philosophy); Computer science; Hamiltonian (control theory); Algorithm; Mathematics; Discrete mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.13845659720429343,"score_gpt":0.26490266462009643,"score_spread":0.126446067415803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157381209","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.018454758,0.0010363885,0.972713,0.0011436197,0.00008288186,0.00010490255,0.0002501381,0.0008257011,0.005388614],"genre_scores_gemma":[0.427661,0.0011292011,0.56170666,0.0006227685,0.00031104972,0.00056091615,0.0015994199,0.00054179423,0.005867195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612457,0.0015713086,0.000175578,0.00069704495,0.0009131302,0.00051833404],"domain_scores_gemma":[0.98782396,0.009106641,0.00041724023,0.0017575284,0.0005367981,0.0003579372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037374757,0.0012678644,0.0018118238,0.0012640643,0.0011871713,0.0030290254,0.0039330996,0.0022404736,0.0062934468],"category_scores_gemma":[0.018419798,0.0006918863,0.0016888975,0.0025643066,0.00204435,0.0054335413,0.003225793,0.0045637847,0.0011569837],"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.00042155277,0.00031530234,0.0012123717,0.0005181569,0.0001752304,0.00008459655,0.00039473997,0.43510094,0.0018610692,0.4251098,0.010543444,0.12426281],"study_design_scores_gemma":[0.00005408949,0.000027091173,0.00011355742,0.000019570198,0.000017036367,0.00003781201,0.00004171433,0.76149416,0.00048725225,0.2362193,0.0014803825,0.000008088219],"about_ca_topic_score_codex":0.0029297431,"about_ca_topic_score_gemma":0.004361593,"teacher_disagreement_score":0.0062934468,"about_ca_system_score_codex":0.0030408406,"about_ca_system_score_gemma":0.002208822,"threshold_uncertainty_score":0.022062898},"labels":[],"label_agreement":null},{"id":"W2158685441","doi":"10.4230/lipics.stacs.2012.601","title":"The Power of Local Search: Maximum Coverage over a Matroid","year":2012,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Matroid; Power (physics); Matroid partitioning; Computer science; Mathematics; Combinatorics; Graphic matroid; Physics","score_opus":0.01917763530506628,"score_gpt":0.26032261563785397,"score_spread":0.2411449803327877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158685441","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.042024795,0.00042902867,0.9492443,0.00047563933,0.00001256074,0.00008904185,0.00007873353,0.0012668029,0.0063790716],"genre_scores_gemma":[0.4938725,0.0003152997,0.501862,0.0002062379,0.00004122263,0.00028447897,0.00023699181,0.0003263934,0.002854956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837995,0.00065285235,0.000047866157,0.00024902823,0.00046842164,0.00020190918],"domain_scores_gemma":[0.99679726,0.002059275,0.00023340719,0.00063224556,0.00017173756,0.00010621318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014639574,0.000803374,0.0012892134,0.0010003033,0.0006751566,0.0012627003,0.0022426385,0.0011503334,0.0032882064],"category_scores_gemma":[0.0075378357,0.0005965135,0.0012237238,0.0015715542,0.001244883,0.0030365356,0.0020477136,0.0015687174,0.00077290786],"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.00038128076,0.00023677273,0.0016016042,0.00027090605,0.00008035745,0.0002006986,0.00032042607,0.7586009,0.010903884,0.045869313,0.004959963,0.17657398],"study_design_scores_gemma":[0.000036923524,0.0000774161,0.0001327583,0.00001458228,0.000015760948,0.000086603584,0.000024952062,0.9810929,0.0029129423,0.014520271,0.0010759068,0.000008869407],"about_ca_topic_score_codex":0.003450392,"about_ca_topic_score_gemma":0.0039174594,"teacher_disagreement_score":0.003450392,"about_ca_system_score_codex":0.0014673022,"about_ca_system_score_gemma":0.0012226851,"threshold_uncertainty_score":0.011000156},"labels":[],"label_agreement":null},{"id":"W2158764863","doi":"10.1098/rspa.2005.1546","title":"Quantum computing, postselection, and probabilistic polynomial-time","year":2005,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":319,"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":"Corollary; Postselection; Complexity class; Probabilistic logic; Class (philosophy); Generalization; Axiom; Mathematical proof; Quantum computer; Simple (philosophy); Intersection (aeronautics); Time complexity; Mathematics; Discrete mathematics; Polynomial; Quantum; Computation; Computer science; Algorithm; Quantum mechanics","score_opus":0.007382453605906405,"score_gpt":0.20613534197199818,"score_spread":0.19875288836609178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158764863","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.30534175,0.001845946,0.61283296,0.013889884,0.00024707883,0.0001487128,0.00033352792,0.00036163535,0.06499846],"genre_scores_gemma":[0.9608769,0.00080681033,0.03290701,0.0004406913,0.00024843035,0.00011265908,0.0001535579,0.00006652384,0.004387422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820125,0.0004974521,0.00005939524,0.00036715687,0.00042667455,0.0004480039],"domain_scores_gemma":[0.98672163,0.010216011,0.0011007327,0.0011607459,0.00040252492,0.0003983475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019061882,0.00074448256,0.00076488726,0.0010113684,0.0017613339,0.0028687308,0.002009423,0.0015300928,0.005695296],"category_scores_gemma":[0.012008131,0.00035348342,0.0013688906,0.001879148,0.0053898743,0.010096327,0.0037318869,0.004661893,0.00049890403],"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.00004008269,0.000037863127,0.00047520566,0.00005569061,0.0000147991595,0.00003549274,0.00012003857,0.0071175187,0.00055507646,0.98410517,0.0012382981,0.0062045837],"study_design_scores_gemma":[0.000008221798,0.000022625767,0.0002629038,0.000010047671,0.000010994074,0.00004686608,0.00006193329,0.054151915,0.00097603264,0.94283587,0.0016038971,0.00000868467],"about_ca_topic_score_codex":0.0011175771,"about_ca_topic_score_gemma":0.000888755,"teacher_disagreement_score":0.005695296,"about_ca_system_score_codex":0.0025394692,"about_ca_system_score_gemma":0.0011909725,"threshold_uncertainty_score":0.019052625},"labels":[],"label_agreement":null},{"id":"W2159111594","doi":"10.1007/11534273_3","title":"Heap Building Bounds","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"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":"Heap (data structure); Computer science; Programming language","score_opus":0.020962658027573466,"score_gpt":0.2585022915845295,"score_spread":0.237539633556956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159111594","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.0069354987,0.0048068613,0.5253119,0.0024686444,0.001138002,0.00016938959,0.002572233,0.009241675,0.4473558],"genre_scores_gemma":[0.20701692,0.008940041,0.45238423,0.001682868,0.001441591,0.00059988484,0.011210794,0.010583459,0.3061402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976152,0.00029526942,0.00014968864,0.00052482676,0.0010201806,0.00039483918],"domain_scores_gemma":[0.9957283,0.0013856938,0.00011681433,0.001953441,0.0006321424,0.00018356313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014152593,0.0019550407,0.0014001343,0.002668737,0.002198488,0.006382676,0.004193977,0.0018482035,0.09241145],"category_scores_gemma":[0.0077327937,0.0017448989,0.001492381,0.004439024,0.0015533328,0.013752472,0.0059206737,0.005951171,0.041145343],"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.0001500944,0.000117481715,0.00033035557,0.00043804673,0.00002977959,0.00006909081,0.0003139433,0.005196861,0.0025255107,0.632215,0.09078821,0.26782554],"study_design_scores_gemma":[0.000026493333,0.00003690269,0.0003797832,0.0003433847,0.00007346602,0.00022162867,0.00012110893,0.014778028,0.009494212,0.72718096,0.2472958,0.000048250957],"about_ca_topic_score_codex":0.0016845849,"about_ca_topic_score_gemma":0.00242935,"teacher_disagreement_score":0.09241145,"about_ca_system_score_codex":0.0023416001,"about_ca_system_score_gemma":0.0019208156,"threshold_uncertainty_score":0.30914712},"labels":[],"label_agreement":null},{"id":"W2160532428","doi":"10.1007/s00446-013-0194-z","title":"No sublogarithmic-time approximation scheme for bipartite vertex cover","year":2013,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Complexity and Algorithms in Graphs","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":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Bipartite graph; Vertex cover; Vertex (graph theory); Approximation algorithm; Upper and lower bounds; Expander graph; Theory of computation; Independent set; Matching (statistics); Feedback vertex set","score_opus":0.014160740544779971,"score_gpt":0.23128453283306682,"score_spread":0.21712379228828685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160532428","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.16017738,0.005215833,0.71641463,0.02019079,0.0017375137,0.0009869483,0.005569235,0.010768691,0.07893889],"genre_scores_gemma":[0.6988838,0.0017878022,0.2550275,0.0040578526,0.0012737501,0.001154167,0.004553766,0.0020592497,0.031202171],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9883939,0.0023162155,0.000537881,0.0026176667,0.0035349978,0.0025993327],"domain_scores_gemma":[0.97225934,0.0126471,0.0011383367,0.010944323,0.0011754719,0.0018353313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047222064,0.0026743512,0.0040664608,0.0019662955,0.0039219703,0.009852861,0.010228578,0.0052254545,0.028607542],"category_scores_gemma":[0.023316307,0.0012371441,0.0030517292,0.0062524453,0.0037727833,0.025136251,0.008260536,0.0099137025,0.006274087],"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.0140326265,0.0024803705,0.0045341924,0.002045294,0.00060506654,0.00027218388,0.0011752268,0.18004516,0.023772167,0.33263117,0.08800895,0.35039768],"study_design_scores_gemma":[0.0011194268,0.0003179983,0.0009809621,0.00015248911,0.00042782538,0.00037064168,0.00038160835,0.4792551,0.008992788,0.4921661,0.015736286,0.000098823686],"about_ca_topic_score_codex":0.005837771,"about_ca_topic_score_gemma":0.01195316,"teacher_disagreement_score":0.028607542,"about_ca_system_score_codex":0.012830699,"about_ca_system_score_gemma":0.010623258,"threshold_uncertainty_score":0.095701754},"labels":[],"label_agreement":null},{"id":"W2160909640","doi":"10.1145/1806689.1806703","title":"Hardness amplification in proof complexity","year":2010,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":31,"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":"Mathematical proof; Degree (music); Proof complexity; Discrete mathematics; Rank (graph theory); Mathematics; Resolution (logic); Tree (set theory); Structural proof theory; Proof of concept; Combinatorial proof; Combinatorics; Proof theory; Computer science; Physics; Programming language","score_opus":0.04004660596034626,"score_gpt":0.2741328864339488,"score_spread":0.23408628047360253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160909640","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.03121167,0.0020001046,0.8700223,0.0069248145,0.00050310086,0.00033177796,0.00050641457,0.0044108033,0.08408894],"genre_scores_gemma":[0.65614134,0.0026121545,0.29667246,0.003293608,0.001353612,0.000857505,0.00073860254,0.0025407996,0.035789967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98417205,0.003219016,0.00077687117,0.003181776,0.0069513903,0.0016988836],"domain_scores_gemma":[0.9311942,0.044700906,0.0014297923,0.018132813,0.0034938897,0.0010484944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006997408,0.0018837228,0.0015145246,0.003537259,0.0020207393,0.0059575858,0.0050076274,0.0021345639,0.02906066],"category_scores_gemma":[0.047699533,0.0017728659,0.003203814,0.0027734227,0.007380305,0.020019783,0.0138437925,0.013368953,0.004204595],"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.00025962878,0.00016225415,0.000920234,0.00064790837,0.000073363146,0.0002345159,0.00053037965,0.009881769,0.010347949,0.89439726,0.011159081,0.07138561],"study_design_scores_gemma":[0.00008199878,0.000108890985,0.0006831978,0.00012442989,0.00012138126,0.00069098355,0.00011817468,0.06457689,0.016153514,0.88801134,0.029255398,0.00007386865],"about_ca_topic_score_codex":0.00088020734,"about_ca_topic_score_gemma":0.00067970523,"teacher_disagreement_score":0.02906066,"about_ca_system_score_codex":0.0034925728,"about_ca_system_score_gemma":0.0014933307,"threshold_uncertainty_score":0.09721762},"labels":[],"label_agreement":null},{"id":"W2160921566","doi":"10.1145/1497290.1497300","title":"Algorithms for distributional and adversarial pipelined filter ordering problems","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","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 British Columbia","funders":"Division of Information and Intelligent Systems; National Science Foundation","keywords":"Computer science; Tuple; Filter (signal processing); Algorithm; Context (archaeology); Data stream mining; Set (abstract data type); Mathematics; Data mining; Discrete mathematics","score_opus":0.03906695759045289,"score_gpt":0.27677252201348246,"score_spread":0.23770556442302956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160921566","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.008297978,0.00023247376,0.9868187,0.0006923751,0.00006256039,0.00013096369,0.00024061918,0.0009437482,0.0025806534],"genre_scores_gemma":[0.22553784,0.00045333014,0.76398283,0.00050008233,0.00025575102,0.0005910476,0.0013738305,0.0005188774,0.0067863665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966748,0.0009138053,0.00026223643,0.00084919,0.00074932317,0.0005506551],"domain_scores_gemma":[0.9884998,0.007983839,0.00069267483,0.0016055577,0.00079044345,0.00042764112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004618323,0.0018732713,0.0022918973,0.0014242722,0.0014259246,0.0029530593,0.004540487,0.0032719653,0.0090475315],"category_scores_gemma":[0.015159697,0.0009261708,0.0018939512,0.0028217982,0.0018350694,0.0078190025,0.004104731,0.004458608,0.0015542663],"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.00046382245,0.00038365688,0.0011062857,0.00026692598,0.00009633982,0.00011685525,0.0002654564,0.6506966,0.0016307704,0.1823531,0.013918977,0.14870119],"study_design_scores_gemma":[0.000066882145,0.00004833502,0.00008720107,0.000011468843,0.00001569409,0.000039777125,0.00003554517,0.86454105,0.0006722808,0.13293464,0.0015341089,0.000013083485],"about_ca_topic_score_codex":0.0029976517,"about_ca_topic_score_gemma":0.00532668,"teacher_disagreement_score":0.0090475315,"about_ca_system_score_codex":0.0033474807,"about_ca_system_score_gemma":0.0034492367,"threshold_uncertainty_score":0.03026706},"labels":[],"label_agreement":null},{"id":"W2164286489","doi":"10.1109/lics.2007.47","title":"Symmetric Datalog and Constraint Satisfaction Problems in Logspace","year":2007,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":38,"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; Concordia University; McGill University","funders":"","keywords":"Datalog; Complement (music); Constraint satisfaction problem; Class (philosophy); Combinatorics; Mathematics; Discrete mathematics; Computer science; Theoretical computer science; Artificial intelligence","score_opus":0.023498786149953117,"score_gpt":0.2538012555813005,"score_spread":0.23030246943134738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164286489","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.15418705,0.00082287483,0.81137633,0.0061928523,0.000116468815,0.0001512852,0.0015882143,0.00094961724,0.024615275],"genre_scores_gemma":[0.86497605,0.000568528,0.12501784,0.0008859135,0.00023007255,0.00024561663,0.0012294994,0.00012206459,0.006724398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977957,0.00075766776,0.0001738675,0.00041484533,0.00061460707,0.00024333216],"domain_scores_gemma":[0.99204355,0.0057544983,0.00054288696,0.0009533912,0.0004464176,0.00025916056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018995517,0.00044765198,0.0006536785,0.0007317582,0.00085934147,0.0025887177,0.0014333444,0.00078163337,0.0040794862],"category_scores_gemma":[0.006625566,0.00039597249,0.0012146217,0.0017926107,0.0028208713,0.009381549,0.002013012,0.002929512,0.0003290959],"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.00007454787,0.000073147974,0.00076279015,0.0001097208,0.000015043458,0.00016704103,0.00029535673,0.014479667,0.0010935426,0.968839,0.0016901417,0.0124001205],"study_design_scores_gemma":[0.000020471784,0.000017025364,0.0002198258,0.000010855388,0.000007578622,0.00011835089,0.00010694335,0.0606963,0.0011997991,0.9339035,0.003687147,0.000012156843],"about_ca_topic_score_codex":0.0032369476,"about_ca_topic_score_gemma":0.0029436997,"teacher_disagreement_score":0.0040794862,"about_ca_system_score_codex":0.0025789214,"about_ca_system_score_gemma":0.001690523,"threshold_uncertainty_score":0.018711448},"labels":[],"label_agreement":null},{"id":"W2164903952","doi":"10.1007/s00453-012-9701-z","title":"Multicommodity Flow in Trees: Packing via Covering and Iterated Relaxation","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","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":"Mathematics; Combinatorics; Iterated function; Linear programming relaxation; Vertex (graph theory); Discrete mathematics; Reachability; Approximation algorithm; Packing problems; Steiner tree problem; Tree (set theory); Theory of computation; Graph; Linear programming; Mathematical optimization; Algorithm","score_opus":0.017987103305355853,"score_gpt":0.23938084254718464,"score_spread":0.22139373924182879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164903952","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.12606472,0.0015723908,0.8545319,0.0008741213,0.000101976315,0.00008753188,0.00012934806,0.00019466598,0.016443284],"genre_scores_gemma":[0.6058856,0.001825883,0.38336837,0.00024431164,0.0003574525,0.0002522398,0.00037218397,0.00026110356,0.007432748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872583,0.0005471284,0.00005761743,0.00023028672,0.00022744952,0.00021174196],"domain_scores_gemma":[0.9946338,0.0041591246,0.00035449857,0.00048144264,0.00015798991,0.0002131964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019614897,0.0011168327,0.0017803904,0.0014142347,0.0012697551,0.0028539614,0.0023319875,0.0023048085,0.003498724],"category_scores_gemma":[0.0094897915,0.0015149458,0.002464234,0.0025044302,0.002288783,0.006321055,0.002785797,0.0032055064,0.00041235212],"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.00026484212,0.00032577693,0.0013814174,0.0004778255,0.00012071555,0.0002852805,0.0007198002,0.51110876,0.0032075297,0.39980638,0.005787694,0.076514035],"study_design_scores_gemma":[0.000027801521,0.000052708026,0.0002593826,0.00004094318,0.000038608054,0.00012068119,0.00008695598,0.71375483,0.0007941158,0.28325808,0.0015468714,0.000018977913],"about_ca_topic_score_codex":0.0020709056,"about_ca_topic_score_gemma":0.002086551,"teacher_disagreement_score":0.003498724,"about_ca_system_score_codex":0.001479778,"about_ca_system_score_gemma":0.00090242986,"threshold_uncertainty_score":0.011704445},"labels":[],"label_agreement":null},{"id":"W2165743239","doi":"10.1109/ccc.2006.26","title":"Making Hard Problems Harder","year":2006,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"National Institute for Materials Science","keywords":"Boolean function; Randomness; Function (biology); Discrete mathematics; Combinatorics; String (physics); Advice (programming); Mathematics; Exponential function; Pseudorandomness; Algorithm; Computer science; Pseudorandom number generator; Statistics","score_opus":0.053068382805347446,"score_gpt":0.26245395788897574,"score_spread":0.2093855750836283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165743239","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.02619799,0.0023806123,0.8434598,0.036437962,0.0014087958,0.00043608533,0.0005779181,0.0014044716,0.08769642],"genre_scores_gemma":[0.42521277,0.004641049,0.4856719,0.015125884,0.0059097325,0.0016822381,0.0015815677,0.002014155,0.05816073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9866931,0.004581482,0.0006319066,0.0036789554,0.0031123208,0.0013023273],"domain_scores_gemma":[0.9482994,0.036412816,0.0015882038,0.011025455,0.0016057417,0.0010684249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009437578,0.0021745223,0.0019275271,0.0022662608,0.0036660782,0.007930528,0.0046728407,0.0039504003,0.03176781],"category_scores_gemma":[0.047717396,0.0017440777,0.004203924,0.0017682987,0.012984734,0.024363944,0.013805041,0.01655768,0.0044158995],"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.000058279507,0.00007829407,0.00028263533,0.0002831088,0.000049629813,0.0001030259,0.00036958436,0.008301821,0.00080179435,0.95522135,0.008813453,0.025636952],"study_design_scores_gemma":[0.000032901455,0.000029491774,0.00008606394,0.000051760762,0.000013837393,0.000061239225,0.00007228763,0.008314889,0.00061220955,0.9727792,0.017931229,0.0000148771305],"about_ca_topic_score_codex":0.0010467398,"about_ca_topic_score_gemma":0.000992424,"teacher_disagreement_score":0.03176781,"about_ca_system_score_codex":0.003861175,"about_ca_system_score_gemma":0.0021272313,"threshold_uncertainty_score":0.10627395},"labels":[],"label_agreement":null},{"id":"W2167093538","doi":"10.1109/tit.2008.924653","title":"Worst Case Nonzero-Error Interactive Communication","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Complexity and Algorithms in Graphs","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 Montréal; University of British Columbia","funders":"","keywords":"Emphasis (telecommunications); Mathematics; Computer science; Telecommunications","score_opus":0.0233208811436139,"score_gpt":0.2516708182198281,"score_spread":0.2283499370762142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167093538","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.052454382,0.00077101804,0.87809974,0.004102959,0.0005625363,0.00023945142,0.0011714644,0.004828823,0.057769664],"genre_scores_gemma":[0.87355274,0.0003694488,0.087830745,0.00084472157,0.00035398995,0.00034855705,0.0011235892,0.0008533098,0.034722928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9867905,0.0029160064,0.0007223627,0.0024123369,0.003842897,0.0033159517],"domain_scores_gemma":[0.9550464,0.023208002,0.0018702277,0.013115842,0.0053773737,0.0013821035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055014156,0.0020340919,0.0021771395,0.0013526917,0.0041005076,0.00553732,0.004453252,0.0040250025,0.029775368],"category_scores_gemma":[0.03453516,0.0008614944,0.0011983983,0.001931302,0.0032713497,0.0076508424,0.010163799,0.00378576,0.0063452106],"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.0031430768,0.00026811866,0.0046906173,0.0006415812,0.00024369576,0.002547223,0.0011417478,0.38497695,0.006826237,0.4260625,0.052031297,0.11742695],"study_design_scores_gemma":[0.000098620054,0.00011100625,0.00031389834,0.00005855881,0.000052929918,0.00067898614,0.00021519349,0.7072332,0.0045617875,0.27695766,0.0096540535,0.00006407569],"about_ca_topic_score_codex":0.0035888522,"about_ca_topic_score_gemma":0.004176023,"teacher_disagreement_score":0.029775368,"about_ca_system_score_codex":0.0028504462,"about_ca_system_score_gemma":0.0040590465,"threshold_uncertainty_score":0.0996086},"labels":[],"label_agreement":null},{"id":"W2167508847","doi":"10.1287/moor.26.4.796.10012","title":"When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?","year":2001,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":71,"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":"National Science Foundation","keywords":"Constraint (computer-aided design); Mathematics; Lift (data mining); Integer programming; Mathematical optimization; Integer (computer science); Mathematical economics; Computer science; Geometry; Data mining","score_opus":0.08849708786235158,"score_gpt":0.3650675527512243,"score_spread":0.2765704648888727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167508847","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.13732332,0.00032213723,0.8382339,0.0030111875,0.00026360765,0.00030908955,0.00009490618,0.0005004563,0.019941308],"genre_scores_gemma":[0.55654424,0.00050983357,0.43593928,0.00072368036,0.00021837743,0.00029803556,0.00017577368,0.0004535747,0.0051372466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942059,0.0029119027,0.00035858076,0.00057258736,0.001078394,0.000872644],"domain_scores_gemma":[0.9644104,0.027042447,0.00222546,0.0040235473,0.0015019464,0.0007962708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014609737,0.0011123552,0.0014349035,0.0010551026,0.0025690983,0.002723888,0.0016993855,0.003031218,0.009205751],"category_scores_gemma":[0.07263664,0.0008483378,0.0015751242,0.0016355966,0.004818596,0.011348204,0.0052227513,0.0041457317,0.0019534298],"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.0006743378,0.00037820972,0.002533399,0.0003027138,0.000058774418,0.00032248633,0.0005492585,0.030759387,0.0067844805,0.8184229,0.0037823569,0.13543169],"study_design_scores_gemma":[0.000116653755,0.000462662,0.0006428586,0.00013604989,0.00004533247,0.00037020762,0.0004067721,0.14934868,0.011216508,0.83318937,0.003995471,0.00006948576],"about_ca_topic_score_codex":0.00054668536,"about_ca_topic_score_gemma":0.0007166041,"teacher_disagreement_score":0.014609737,"about_ca_system_score_codex":0.00073230825,"about_ca_system_score_gemma":0.0024322325,"threshold_uncertainty_score":0.07726461},"labels":[],"label_agreement":null},{"id":"W2168874859","doi":"10.1007/s10107-015-0912-3","title":"Stable sets and graphs with no even holes","year":2015,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Mathematics; Decomposition; Node (physics); Polynomial; Combinatorics; Work (physics); Discrete mathematics; Mathematical analysis; Physics","score_opus":0.04060407816370412,"score_gpt":0.26448879829109706,"score_spread":0.22388472012739294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168874859","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.38222733,0.004556245,0.5080875,0.01076456,0.00038556996,0.000137982,0.0008131407,0.00032613604,0.092701435],"genre_scores_gemma":[0.90683085,0.0020988,0.07007428,0.0008980184,0.0006171519,0.00020993172,0.000538155,0.00014142446,0.018591348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989422,0.0003616281,0.000046952715,0.00025399058,0.00026584117,0.00012948233],"domain_scores_gemma":[0.99324846,0.0051565547,0.00051466795,0.00041068997,0.00029813097,0.0003714474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012836691,0.0008540835,0.0011637748,0.0020662537,0.0022209964,0.00509172,0.0016310021,0.001401641,0.0069922414],"category_scores_gemma":[0.006926082,0.00083967636,0.0010877029,0.0024036465,0.0052932263,0.010835669,0.0023927176,0.0036118373,0.00049449527],"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.000014680593,0.000008856473,0.00012019885,0.000024577279,0.00000410529,0.0000148306135,0.00009447229,0.001250119,0.00013433227,0.9958662,0.00058962463,0.0018779925],"study_design_scores_gemma":[0.0000039500073,0.0000023258885,0.000040468756,0.0000047973513,0.000003031402,0.000010273494,0.00003428648,0.0025262686,0.00006305371,0.9966815,0.00062742573,0.0000026123923],"about_ca_topic_score_codex":0.0014319371,"about_ca_topic_score_gemma":0.0018872388,"teacher_disagreement_score":0.0069922414,"about_ca_system_score_codex":0.00199703,"about_ca_system_score_gemma":0.0010421243,"threshold_uncertainty_score":0.023391426},"labels":[],"label_agreement":null},{"id":"W2168958045","doi":"10.1109/focs.2008.59","title":"A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest","year":2008,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Polynomial-time approximation scheme; Scheme (mathematics); Euclidean geometry; Approximation algorithm; Combinatorics; Euclidean distance; Plane (geometry); Time complexity; Steiner tree problem; Mathematics; Polynomial; Binary logarithm; Running time; Discrete mathematics; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.029652950378595926,"score_gpt":0.23294932407953242,"score_spread":0.2032963737009365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168958045","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.074926555,0.0019373794,0.89636344,0.0015861365,0.000235708,0.00037999335,0.002399384,0.008679499,0.013491871],"genre_scores_gemma":[0.36558565,0.0007889184,0.62174624,0.00044711662,0.000118392905,0.00035115727,0.00410838,0.00045031603,0.006403929],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963039,0.0006727635,0.00027695723,0.00096792524,0.0009334676,0.0008449269],"domain_scores_gemma":[0.99690163,0.0010021456,0.00028988905,0.0013321143,0.00026523916,0.00020898372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018566162,0.0013261877,0.0017505101,0.0012556692,0.0013681301,0.0024855835,0.0050944355,0.0019593383,0.011076139],"category_scores_gemma":[0.0062204725,0.00077005464,0.0016005611,0.0037452853,0.0010364155,0.007198813,0.003535053,0.0024821232,0.0034484318],"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.0034277681,0.0007100882,0.0021861952,0.0011468645,0.00031315966,0.00029579405,0.000640816,0.25741863,0.031154122,0.14109635,0.060641106,0.50096905],"study_design_scores_gemma":[0.0007709689,0.00046882773,0.0011465945,0.000075230506,0.00018551543,0.00073658896,0.00022540339,0.8512606,0.014358227,0.11038058,0.02027288,0.00011858694],"about_ca_topic_score_codex":0.0063757934,"about_ca_topic_score_gemma":0.0066081015,"teacher_disagreement_score":0.011076139,"about_ca_system_score_codex":0.0040157745,"about_ca_system_score_gemma":0.0033210954,"threshold_uncertainty_score":0.037053406},"labels":[],"label_agreement":null},{"id":"W2169488047","doi":"10.1145/2462896.2462897","title":"On the usefulness of predicates","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":30,"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":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Predicate (mathematical logic); Mathematics; Combinatorics; Conjecture; Discrete mathematics; Randomness; Negation; Pairwise comparison; Constraint satisfaction problem; Computer science","score_opus":0.031245248534134563,"score_gpt":0.2423059758492957,"score_spread":0.21106072731516112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169488047","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.08384963,0.0033188125,0.86106694,0.006372548,0.00030199593,0.00022937705,0.0006950495,0.0007016548,0.04346401],"genre_scores_gemma":[0.7968336,0.0025002225,0.18693678,0.0020694586,0.0011952833,0.0006242978,0.0008801875,0.00057338586,0.008386749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98403686,0.007658626,0.0009952171,0.0026323202,0.003197254,0.0014797237],"domain_scores_gemma":[0.93702483,0.047955405,0.0026091477,0.008735788,0.0023299686,0.0013448801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011253704,0.0015112638,0.0015796075,0.0025990857,0.0029252225,0.0059082764,0.003132695,0.0025078668,0.0042902897],"category_scores_gemma":[0.040219393,0.0013717897,0.0026521727,0.003115417,0.012013138,0.01939375,0.008594171,0.007202914,0.0007688397],"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.00009544308,0.000029964094,0.00050438545,0.0001380344,0.000023434703,0.00016292975,0.00044030574,0.010289703,0.00084262574,0.97634935,0.0011062673,0.010017495],"study_design_scores_gemma":[0.000044723158,0.000096029864,0.0003364566,0.00009122063,0.00005823273,0.00038760208,0.00018560833,0.046330724,0.0020455203,0.9370075,0.013383984,0.000032401815],"about_ca_topic_score_codex":0.0008860992,"about_ca_topic_score_gemma":0.0006081272,"teacher_disagreement_score":0.011253704,"about_ca_system_score_codex":0.0022510847,"about_ca_system_score_gemma":0.0015121232,"threshold_uncertainty_score":0.059515953},"labels":[],"label_agreement":null},{"id":"W2171769876","doi":"10.1017/s0963548309990204","title":"The Longest Minimum-Weight Path in a Complete Graph","year":2009,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"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 Montréal","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Minimum weight; Path (computing); Path length; Random graph; Discrete mathematics; Computer science","score_opus":0.02440755301033561,"score_gpt":0.2437544791994999,"score_spread":0.2193469261891643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171769876","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.862172,0.00075281516,0.122765325,0.0013832003,0.000051600404,0.0000377839,0.00088484475,0.0001689421,0.011783509],"genre_scores_gemma":[0.9584022,0.0005547088,0.03720811,0.000108609565,0.00006412953,0.00005327518,0.0005516275,0.000048399572,0.0030088627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997664,0.00005248859,0.000008105775,0.00006783944,0.000053136642,0.000052023483],"domain_scores_gemma":[0.9984327,0.00082333025,0.00031701353,0.00011733374,0.00012844554,0.00018127444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031739895,0.00025467842,0.00032206325,0.00060406566,0.00080067007,0.0007737896,0.00067044573,0.0006801138,0.0024533852],"category_scores_gemma":[0.0045903195,0.00020940058,0.00023355347,0.0007568399,0.000825471,0.0023113075,0.0008284047,0.0005817184,0.00026081855],"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.0006346507,0.00011756136,0.008505217,0.00067534664,0.00010491544,0.0010527672,0.0006567642,0.15451415,0.019683296,0.7458602,0.009074884,0.059120238],"study_design_scores_gemma":[0.000059119706,0.00013734095,0.003312541,0.000048586087,0.000031888525,0.00069658214,0.00029730515,0.21647577,0.004717115,0.7657368,0.008448993,0.00003788893],"about_ca_topic_score_codex":0.0006500859,"about_ca_topic_score_gemma":0.0008205942,"teacher_disagreement_score":0.0024533852,"about_ca_system_score_codex":0.00047793722,"about_ca_system_score_gemma":0.00048713636,"threshold_uncertainty_score":0.008207381},"labels":[],"label_agreement":null},{"id":"W2174409790","doi":"10.1007/s10107-012-0537-8","title":"On generalizations of network design problems with degree bounds","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":26,"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; Spanning tree; Degree (music); Combinatorics; Matroid; Rounding; Approximation algorithm; Minimum spanning tree; Discrete mathematics; Bounded function; Mathematical analysis","score_opus":0.08827442949770972,"score_gpt":0.26848629817945724,"score_spread":0.18021186868174752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174409790","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.065012075,0.0055861883,0.8665271,0.008335351,0.0006292006,0.00016734679,0.00059068645,0.00023335971,0.052918673],"genre_scores_gemma":[0.65333194,0.017296005,0.2721326,0.0032483537,0.005553307,0.00084586657,0.0017093592,0.00067578454,0.04520675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962903,0.0018864445,0.00014923088,0.00070173177,0.00060867245,0.00036351525],"domain_scores_gemma":[0.9751857,0.019694988,0.0015628164,0.0017166868,0.00086305116,0.0009767953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057585347,0.0029679323,0.002783915,0.0027989752,0.0017422016,0.0040212804,0.0039498974,0.003292363,0.007942487],"category_scores_gemma":[0.030558195,0.0014850985,0.0035194329,0.0046550636,0.003798649,0.013147416,0.0046866913,0.008297835,0.0006903984],"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.00007376295,0.00013574655,0.00062418764,0.00025005048,0.00006618845,0.00010935186,0.00022086456,0.13472512,0.0004030266,0.83925307,0.0072748894,0.016863666],"study_design_scores_gemma":[0.000017026381,0.000016289272,0.00015163526,0.000037337293,0.000022342261,0.00003887477,0.000038154983,0.13819559,0.0000852224,0.8585446,0.0028411138,0.000011945238],"about_ca_topic_score_codex":0.0035370085,"about_ca_topic_score_gemma":0.003478171,"teacher_disagreement_score":0.007942487,"about_ca_system_score_codex":0.0039805057,"about_ca_system_score_gemma":0.0015931731,"threshold_uncertainty_score":0.030454457},"labels":[],"label_agreement":null},{"id":"W2174864496","doi":"10.1007/3-540-45753-4_5","title":"On the Power of Priority Algorithms for Facility Location and Set Cover","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":20,"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":"Set cover problem; Greedy algorithm; Facility location problem; Cover (algebra); Computer science; Focus (optics); Class (philosophy); Covering problems; Set (abstract data type); Approximation algorithm; Mathematical optimization; Algorithm; Point (geometry); Time complexity; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.03618592476905767,"score_gpt":0.25942953066477664,"score_spread":0.22324360589571896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174864496","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.036822382,0.006092395,0.87384766,0.0078104055,0.0010501858,0.00021699975,0.00036845863,0.0014893387,0.0723022],"genre_scores_gemma":[0.5940554,0.00711027,0.35858858,0.0027887989,0.003850578,0.00046434547,0.0008471902,0.0017166502,0.030578006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99111885,0.0035496845,0.00038856445,0.001084266,0.0026035365,0.0012550021],"domain_scores_gemma":[0.91660595,0.06954191,0.001839446,0.008177366,0.0021930838,0.0016422839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012859528,0.0024034772,0.0043648994,0.0031121592,0.003783025,0.008068122,0.0076911114,0.004261641,0.01551776],"category_scores_gemma":[0.066052176,0.0020076002,0.0031070034,0.006297271,0.007855896,0.029396188,0.007189311,0.009627494,0.0028498853],"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.0007232605,0.00017068461,0.0006398461,0.00030806992,0.00007175623,0.000057604542,0.00030113905,0.051034145,0.0009175866,0.8628406,0.012374203,0.07056122],"study_design_scores_gemma":[0.000107535474,0.000050131453,0.000104679704,0.00003760589,0.000037034093,0.00004813781,0.00004266364,0.11891429,0.00046210465,0.8769563,0.0032195165,0.000020039819],"about_ca_topic_score_codex":0.006410156,"about_ca_topic_score_gemma":0.0054518287,"teacher_disagreement_score":0.01551776,"about_ca_system_score_codex":0.005750358,"about_ca_system_score_gemma":0.004393688,"threshold_uncertainty_score":0.06800848},"labels":[],"label_agreement":null},{"id":"W2177638926","doi":"10.5555/2095116.2095235","title":"Approximating rooted Steiner networks","year":2012,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","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":"McGill University; University of Waterloo","funders":"","keywords":"Steiner tree problem; Combinatorics; Generalization; Linear programming relaxation; Undirected graph; Mathematics; Approximation algorithm; Discrete mathematics; Linear programming; Focus (optics); Relaxation (psychology); Computer science; Mathematical optimization; Graph","score_opus":0.017631252465922377,"score_gpt":0.252691496209125,"score_spread":0.23506024374320264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177638926","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.14625256,0.0017522512,0.81969845,0.0018984353,0.00011616456,0.00012346906,0.001081718,0.00096027815,0.028116677],"genre_scores_gemma":[0.7372486,0.0015881252,0.2510248,0.00038231807,0.00014865753,0.00018255047,0.001894274,0.00035441454,0.007176259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983358,0.00054012245,0.00008002566,0.00037905664,0.0004416384,0.00022346275],"domain_scores_gemma":[0.9922047,0.0055798576,0.0005649867,0.00089596806,0.00044400568,0.0003104197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013572566,0.00089870836,0.0010797422,0.0009871023,0.0006413446,0.0020381585,0.0023211585,0.0013380673,0.0060194465],"category_scores_gemma":[0.014680047,0.00072153803,0.00085736456,0.0019412938,0.0010741067,0.005135025,0.002441752,0.0022919148,0.00075924397],"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.00038656758,0.00012069263,0.0019896224,0.0004078058,0.00007592399,0.00015167003,0.00033245247,0.7355159,0.0036782294,0.17875157,0.0089337565,0.069655806],"study_design_scores_gemma":[0.000030820167,0.000039853232,0.00038868916,0.00003676862,0.000020989664,0.000106956824,0.0000937109,0.83459574,0.0010543226,0.16000725,0.003615214,0.0000096832455],"about_ca_topic_score_codex":0.0019298053,"about_ca_topic_score_gemma":0.0030213285,"teacher_disagreement_score":0.0060194465,"about_ca_system_score_codex":0.0020359987,"about_ca_system_score_gemma":0.00079500006,"threshold_uncertainty_score":0.020137072},"labels":[],"label_agreement":null},{"id":"W2178989601","doi":"10.5539/jmr.v7n4p162","title":"A Strong Class of Lifted Valid Inequalities for the Shortest Path Problem in Digraphs with Negative Cost Cycles","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Complexity and Algorithms in Graphs","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; Inequality; Class (philosophy); Combinatorics; Path (computing); Integer (computer science); Vertex (graph theory); Simple (philosophy); Shortest path problem; Discrete mathematics; Graph; Mathematical analysis; Computer science","score_opus":0.2788467139699767,"score_gpt":0.41430463101506787,"score_spread":0.1354579170450912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178989601","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.058185358,0.001943444,0.9068968,0.001690601,0.00050825614,0.00047599513,0.0017972701,0.0003715798,0.028130664],"genre_scores_gemma":[0.62376994,0.0028574448,0.35391232,0.0018326805,0.000971589,0.00095568475,0.004654303,0.00039259283,0.010653339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655056,0.0007539896,0.00025275114,0.00074393075,0.001070842,0.00062785234],"domain_scores_gemma":[0.991836,0.0055322847,0.0007334156,0.00065949175,0.0008870386,0.000351748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021385602,0.0018686702,0.0011397788,0.0013960878,0.0009948896,0.002879139,0.002332196,0.0013662791,0.008124624],"category_scores_gemma":[0.012256285,0.0007755957,0.0029121188,0.0017161915,0.0013521783,0.005088513,0.002477245,0.006515946,0.0009811948],"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.00073838205,0.0004139237,0.004404082,0.0020765828,0.00041733708,0.0018702707,0.0005537461,0.2713379,0.015802285,0.5050028,0.016486306,0.18089634],"study_design_scores_gemma":[0.00010834751,0.00030055598,0.0014990821,0.00030371294,0.00014772307,0.00067254447,0.00019715428,0.51755047,0.005311386,0.4547491,0.019062508,0.00009740341],"about_ca_topic_score_codex":0.0025260204,"about_ca_topic_score_gemma":0.0026875802,"teacher_disagreement_score":0.008124624,"about_ca_system_score_codex":0.0013603191,"about_ca_system_score_gemma":0.0019211979,"threshold_uncertainty_score":0.02717954},"labels":[],"label_agreement":null},{"id":"W2183636263","doi":"","title":"Approximating Full Steiner Tree in a Unit Disk Graph.","year":2014,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Steiner tree problem; Combinatorics; Gomory–Hu tree; k-minimum spanning tree; K-ary tree; Mathematics; Graph; Tree (set theory); Approximation algorithm; Discrete mathematics; Tree structure; Binary tree","score_opus":0.022043091202608105,"score_gpt":0.23712883532002602,"score_spread":0.2150857441174179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183636263","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.31222877,0.0025966528,0.6685307,0.0009312727,0.00015516713,0.00017212903,0.0015468051,0.0019036593,0.011934907],"genre_scores_gemma":[0.50398004,0.00082884857,0.4869804,0.00015957294,0.00005042357,0.00013403627,0.0025878986,0.00029789572,0.0049809064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929845,0.00019009357,0.00004599453,0.00013842639,0.0002006992,0.00012634],"domain_scores_gemma":[0.9981785,0.00093634747,0.00020384713,0.00034096293,0.00021634201,0.00012400773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007001044,0.00082705554,0.001087618,0.0012173743,0.00057628675,0.0013535738,0.0014810045,0.001017756,0.004337194],"category_scores_gemma":[0.005663836,0.0004410332,0.0005837729,0.0022274377,0.00047283192,0.0031835383,0.0014544666,0.00077499024,0.0011032226],"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.0012441545,0.00030861195,0.004127226,0.0006023216,0.00013558306,0.00051063165,0.0005744516,0.6761711,0.00997898,0.042128682,0.02258653,0.24163178],"study_design_scores_gemma":[0.000043630684,0.000082084895,0.0004626468,0.000025293515,0.00001871987,0.00028358246,0.00014215389,0.95895624,0.0015299105,0.035033703,0.0034123312,0.000009730737],"about_ca_topic_score_codex":0.00390494,"about_ca_topic_score_gemma":0.0052781985,"teacher_disagreement_score":0.004337194,"about_ca_system_score_codex":0.001468905,"about_ca_system_score_gemma":0.0010263064,"threshold_uncertainty_score":0.01450938},"labels":[],"label_agreement":null},{"id":"W2184112757","doi":"","title":"The Vital Core Connectivity Problem","year":2012,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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","funders":"","keywords":"Combinatorics; Upper and lower bounds; Approximation algorithm; Linear programming relaxation; Enhanced Data Rates for GSM Evolution; Mathematics; Core (optical fiber); Graph; Linear programming; Computer science; Discrete mathematics; Algorithm; Artificial intelligence","score_opus":0.03668245112756905,"score_gpt":0.26308185105539345,"score_spread":0.2263993999278244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184112757","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.24450122,0.002500011,0.66212916,0.007659713,0.00026894777,0.0005755582,0.004097414,0.0009114105,0.07735647],"genre_scores_gemma":[0.797519,0.002292329,0.17506881,0.0012896097,0.00027409312,0.0005526594,0.005093277,0.00031309196,0.017597217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989329,0.00028495915,0.000043462536,0.00029621174,0.00019634345,0.00024606608],"domain_scores_gemma":[0.9971648,0.0016386874,0.0002904092,0.00028792396,0.00027036242,0.00034787573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010154466,0.000861059,0.0011676663,0.0008800367,0.00097075215,0.0024085015,0.0024073252,0.0021683006,0.008233512],"category_scores_gemma":[0.007696591,0.0005855184,0.0007352501,0.0016535296,0.0015666471,0.004997426,0.0028181765,0.0020820294,0.00064814894],"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.0006216169,0.00031811217,0.0029349679,0.0011136908,0.00015102957,0.0006729819,0.00072968984,0.23417763,0.005282746,0.5686645,0.052742653,0.13259049],"study_design_scores_gemma":[0.00014951933,0.00015285649,0.0011524758,0.00013946014,0.00007434712,0.0011143057,0.00053143397,0.35649988,0.0032939569,0.60109574,0.03575654,0.000039603117],"about_ca_topic_score_codex":0.0015899786,"about_ca_topic_score_gemma":0.0013710951,"teacher_disagreement_score":0.008233512,"about_ca_system_score_codex":0.0013745781,"about_ca_system_score_gemma":0.0011288153,"threshold_uncertainty_score":0.027543843},"labels":[],"label_agreement":null},{"id":"W2184467059","doi":"","title":"Bounded Arithmetic and Formalizing Probabilistic Proofs","year":2014,"lang":"en","type":"dissertation","venue":"TSpace (University of Toronto)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"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":"University of Toronto","keywords":"Mathematical proof; Bounded function; Probabilistic logic; Arithmetic; Mathematics; Computer science; Discrete mathematics; Calculus (dental); Algebra over a field; Theoretical computer science; Statistics; Pure mathematics; Mathematical analysis","score_opus":0.014761436673336225,"score_gpt":0.23594088355066412,"score_spread":0.22117944687732788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184467059","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.022622677,0.0021023508,0.90302205,0.0051119705,0.00029403332,0.00014091241,0.00046306578,0.0011059989,0.06513691],"genre_scores_gemma":[0.72449017,0.0029113549,0.25255466,0.0017109088,0.0009281763,0.0004664458,0.00089091784,0.00037002095,0.015677284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99401915,0.0018921514,0.00036713015,0.000937269,0.0022353476,0.00054904626],"domain_scores_gemma":[0.9895057,0.007559632,0.0005748013,0.0013067273,0.0008424436,0.0002105924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005148242,0.00085033884,0.0005632645,0.0023373675,0.0014579972,0.0049175685,0.002820367,0.0013732114,0.0076644015],"category_scores_gemma":[0.013134981,0.0008268302,0.0018734531,0.0019250931,0.008740021,0.012740929,0.004553385,0.0048081805,0.0009868174],"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.0000043277732,0.0000056402187,0.000049717848,0.000036893507,0.0000040218356,0.000016267153,0.000119667275,0.0018183874,0.00014714246,0.99497426,0.0003134743,0.0025101644],"study_design_scores_gemma":[0.00000997925,0.000009865453,0.000058623402,0.00004222767,0.00000947078,0.000034561726,0.000047318736,0.0122813685,0.0006910216,0.9778386,0.008964874,0.000012137539],"about_ca_topic_score_codex":0.0026072108,"about_ca_topic_score_gemma":0.0018574133,"teacher_disagreement_score":0.0076644015,"about_ca_system_score_codex":0.004426094,"about_ca_system_score_gemma":0.0027183716,"threshold_uncertainty_score":0.03211367},"labels":[],"label_agreement":null},{"id":"W2185716868","doi":"10.4086/toc.2012.v008a012","title":"","year":2012,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":47,"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; National Science Foundation","keywords":"Mathematics; Combinatorics; Predicate (mathematical logic); Constraint satisfaction problem; Pairwise independence; Discrete mathematics; Hierarchy; Pairwise comparison; Semidefinite programming; Random variable; Omega; Mathematical optimization; Multivariate random variable; Sum of normally distributed random variables; Probabilistic logic; Computer science","score_opus":0.030771538958363084,"score_gpt":0.2621209887200663,"score_spread":0.23134944976170319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185716868","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.072247684,0.0016301285,0.895448,0.0046573263,0.00037013835,0.00012509832,0.0011866746,0.00064674177,0.0236882],"genre_scores_gemma":[0.6794428,0.001385835,0.29934797,0.0013744852,0.00040699885,0.00019733734,0.0018914924,0.00030551836,0.015647572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99848986,0.0004122643,0.00005390877,0.0005013078,0.0002667852,0.00027583254],"domain_scores_gemma":[0.9964857,0.0024066188,0.00024744697,0.00034278815,0.00027458774,0.00024277018],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011960947,0.0009930037,0.0012328962,0.0004979769,0.0010312962,0.0017877019,0.0019721312,0.0017341403,0.012560133],"category_scores_gemma":[0.007977965,0.00038630603,0.001226923,0.0013673349,0.0012613408,0.0037554244,0.0018239253,0.0020593961,0.0010728703],"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.000409631,0.00019563362,0.0019327248,0.0004384945,0.00013564347,0.00036569324,0.00016026158,0.60219854,0.0016576543,0.31434026,0.017460823,0.060704608],"study_design_scores_gemma":[0.000042169886,0.00009514158,0.00029404534,0.000029436296,0.000030427176,0.00017597183,0.00009945605,0.69676816,0.0009548281,0.29146412,0.010031719,0.000014499219],"about_ca_topic_score_codex":0.0049746023,"about_ca_topic_score_gemma":0.0050142007,"teacher_disagreement_score":0.9874399,"about_ca_system_score_codex":0.0016461727,"about_ca_system_score_gemma":0.0013133849,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2198855630","doi":"10.46298/dmtcs.591","title":"On quadratic threshold CSPs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","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":"Toronto Metropolitan University","funders":"European Commission","keywords":"Rounding; Mathematics; Predicate (mathematical logic); Constraint satisfaction problem; Discrete mathematics; Quadratic equation; Hyperplane; Combinatorics; Semidefinite programming; Algorithm; Mathematical optimization; Computer science","score_opus":0.022172371833810458,"score_gpt":0.27425426295176975,"score_spread":0.2520818911179593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198855630","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.02800854,0.00030969203,0.9534609,0.0009811595,0.00008880791,0.00019124807,0.00041268926,0.00088371505,0.015663246],"genre_scores_gemma":[0.49500838,0.000593022,0.4820036,0.00084293296,0.00018808644,0.00043725903,0.0014320828,0.00051533745,0.01897932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774003,0.0005658816,0.00014908078,0.0005636921,0.00061248394,0.000368853],"domain_scores_gemma":[0.99545974,0.0031055617,0.00029026673,0.00052389613,0.00038807027,0.00023243738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002043704,0.0009503605,0.0011835385,0.0008813865,0.00080111047,0.0031181313,0.0019424647,0.0012820618,0.010859245],"category_scores_gemma":[0.011381747,0.0005064988,0.0013200288,0.0019822905,0.0016851103,0.004568115,0.003137288,0.0034581313,0.0012711303],"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.00027243208,0.00014554361,0.00082473765,0.0002681722,0.000041150768,0.00012818628,0.0002810198,0.32399678,0.002192003,0.5678791,0.007467082,0.09650376],"study_design_scores_gemma":[0.000042230295,0.000033312775,0.000081611906,0.000020999827,0.000007642788,0.000035983474,0.00004102902,0.7343865,0.0006772979,0.2620303,0.0026350527,0.000008066483],"about_ca_topic_score_codex":0.0028311727,"about_ca_topic_score_gemma":0.0033175414,"teacher_disagreement_score":0.010859245,"about_ca_system_score_codex":0.0030526156,"about_ca_system_score_gemma":0.0016608016,"threshold_uncertainty_score":0.03632784},"labels":[],"label_agreement":null},{"id":"W2245114686","doi":"10.4230/lipics.stacs.2009.1835","title":"Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs","year":2009,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Bounded function; Steiner tree problem; Combinatorics; Planar graph; Pathwidth; Mathematics; Genus; Chordal graph; 1-planar graph; Indifference graph; Discrete mathematics; Time complexity; Treewidth; Clique-sum; Polynomial; Graph; Line graph","score_opus":0.01680353275891705,"score_gpt":0.24790817499607065,"score_spread":0.2311046422371536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245114686","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.18438798,0.0014498467,0.7960003,0.0023733317,0.00015474693,0.00038909793,0.0011710107,0.003478484,0.010595092],"genre_scores_gemma":[0.6457407,0.0009323612,0.34615874,0.00031601122,0.00015138934,0.00037224856,0.002337919,0.00041542575,0.003575115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795026,0.00045300843,0.00013429347,0.0004382321,0.0005414923,0.0004827327],"domain_scores_gemma":[0.9898122,0.006326037,0.0005910421,0.0024738412,0.000434682,0.0003621376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021505991,0.0015806345,0.0017805877,0.0009029055,0.0014798823,0.003593362,0.004500554,0.0019330712,0.0071701747],"category_scores_gemma":[0.012877305,0.0006312841,0.0019726502,0.002659602,0.0011746914,0.00851693,0.002673653,0.0033207198,0.0012377357],"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.001996503,0.0005169633,0.0042696227,0.0010588977,0.00024369225,0.00023837562,0.0012697373,0.5445245,0.012032576,0.16328359,0.017571004,0.25299457],"study_design_scores_gemma":[0.0001801729,0.00013647729,0.00047294318,0.000047846443,0.00011535992,0.00023661698,0.00023549408,0.84866947,0.005978796,0.13894884,0.0049524256,0.000025597585],"about_ca_topic_score_codex":0.0031322963,"about_ca_topic_score_gemma":0.0048241625,"teacher_disagreement_score":0.0071701747,"about_ca_system_score_codex":0.003566611,"about_ca_system_score_gemma":0.0023490665,"threshold_uncertainty_score":0.025877655},"labels":[],"label_agreement":null},{"id":"W2245981342","doi":"10.4230/lipics.csl.2013.296","title":"Theories for Subexponential-size Bounded-depth Frege Proofs","year":2013,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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; European Commission","keywords":"Mathematical proof; Bounded function; Proof complexity; Mathematics; Discrete mathematics; Class (philosophy); Complexity class; Pigeonhole principle; Proof theory; Computer science; Time complexity","score_opus":0.01360851346926505,"score_gpt":0.2445596853273095,"score_spread":0.23095117185804445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245981342","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.08090493,0.0010107699,0.8832464,0.0025933092,0.00013456945,0.00031999144,0.00067596533,0.0017338543,0.02938026],"genre_scores_gemma":[0.58595645,0.00092810043,0.39723602,0.001473104,0.00041283478,0.0006509124,0.0012495414,0.000591089,0.011501963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952173,0.0007942297,0.0002914758,0.0008774288,0.0021464415,0.00067316194],"domain_scores_gemma":[0.9765062,0.015882434,0.0018358016,0.0036184518,0.0016304523,0.00052671466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030856554,0.0007347945,0.00089333794,0.0024163956,0.0016551275,0.0044683777,0.0028465688,0.0015027333,0.010130655],"category_scores_gemma":[0.021280589,0.0010397057,0.0031348355,0.0015568496,0.0038571386,0.017390773,0.004384911,0.006993996,0.00087056233],"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.000043820077,0.000041725696,0.0008135046,0.00013692895,0.000023140277,0.00005929942,0.00026565514,0.006897385,0.0017506399,0.97589195,0.0015146111,0.012561388],"study_design_scores_gemma":[0.0000368305,0.00003233107,0.00085946394,0.00006044976,0.000059328064,0.00018889192,0.00011300851,0.06915011,0.0046104677,0.91389585,0.010956394,0.000036873345],"about_ca_topic_score_codex":0.0033400056,"about_ca_topic_score_gemma":0.0046419585,"teacher_disagreement_score":0.010130655,"about_ca_system_score_codex":0.0074427132,"about_ca_system_score_gemma":0.0026129882,"threshold_uncertainty_score":0.054000914},"labels":[],"label_agreement":null},{"id":"W2246515892","doi":"10.48550/arxiv.1508.07504","title":"Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part I: Stemless TAP","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Relaxation (psychology); Mathematics; Tree (set theory); Combinatorics; Linear programming relaxation; Type (biology); Discrete mathematics; Linear programming; Algorithm","score_opus":0.14702366040205034,"score_gpt":0.21607720642098246,"score_spread":0.06905354601893213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246515892","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.107213095,0.00034206378,0.88104916,0.0007508389,0.00008709057,0.0001688124,0.0002550056,0.0016065352,0.008527392],"genre_scores_gemma":[0.48413438,0.00022447917,0.5099105,0.00031242802,0.000086082146,0.00023486119,0.0007111225,0.00031876363,0.0040673832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999263,0.0002096614,0.000031414005,0.00019419732,0.00015913778,0.00014253936],"domain_scores_gemma":[0.9977488,0.0012297783,0.00018049275,0.0005260286,0.00014743293,0.00016744318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013060003,0.0010473966,0.0011703338,0.00049403333,0.00055656687,0.0012928939,0.0016297206,0.001341335,0.0055992836],"category_scores_gemma":[0.0057965387,0.0004620822,0.0010183792,0.0011781624,0.0011658331,0.0031228499,0.0025840842,0.0022202155,0.0008654081],"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.0006086773,0.0005017825,0.0028414133,0.00051986374,0.00007259333,0.00030657454,0.00036718143,0.62248665,0.013003032,0.11863546,0.013345497,0.22731116],"study_design_scores_gemma":[0.00003973083,0.0001081146,0.00021037762,0.000018934436,0.000013609249,0.00011397603,0.000071288734,0.9380458,0.0026562032,0.05700102,0.0017119597,0.000008917762],"about_ca_topic_score_codex":0.0015112617,"about_ca_topic_score_gemma":0.002450623,"teacher_disagreement_score":0.0055992836,"about_ca_system_score_codex":0.00087964017,"about_ca_system_score_gemma":0.0011979538,"threshold_uncertainty_score":0.018731475},"labels":[],"label_agreement":null},{"id":"W2249023948","doi":"10.4230/lipics.approx-random.2014.721","title":"Communication Complexity of Set-Disjointness for All Probabilities","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"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":"Communication complexity; Characterization (materials science); Mathematics; Bounded function; Upper and lower bounds; Class (philosophy); Complexity class; Discrete mathematics; Set (abstract data type); Combinatorics; Alpha (finance); Computational complexity theory; Time complexity; Computer science; Algorithm","score_opus":0.05522852973585569,"score_gpt":0.28918484811893547,"score_spread":0.2339563183830798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2249023948","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.4900705,0.00070652727,0.48646322,0.0064958096,0.000097196484,0.00022169018,0.0008750766,0.0005589224,0.014511008],"genre_scores_gemma":[0.96721554,0.00037619038,0.027060797,0.00038938504,0.00023158718,0.00032365188,0.0003410563,0.00016570452,0.0038960455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904974,0.0035415448,0.00038306945,0.0019231923,0.0021301687,0.0015245975],"domain_scores_gemma":[0.9024466,0.08206389,0.0052397824,0.006973353,0.0014623803,0.0018140007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060133953,0.0013790447,0.00198668,0.0013811693,0.0017706158,0.0054176627,0.0038738672,0.0026541613,0.006118221],"category_scores_gemma":[0.039400034,0.00080434687,0.0026758804,0.0015821619,0.0054614292,0.013310825,0.00635508,0.00936303,0.000583549],"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.00052312907,0.00020799469,0.0022554016,0.00023621655,0.0001416942,0.00024214342,0.00066794694,0.17915346,0.0031923347,0.79871696,0.0022072438,0.012455482],"study_design_scores_gemma":[0.00006703153,0.00005254791,0.00036684162,0.000017489838,0.000036570516,0.00006743516,0.00006140632,0.45344734,0.0017187112,0.5434777,0.00065665477,0.00003022858],"about_ca_topic_score_codex":0.0019030944,"about_ca_topic_score_gemma":0.0009425822,"teacher_disagreement_score":0.006118221,"about_ca_system_score_codex":0.005763544,"about_ca_system_score_gemma":0.0023103852,"threshold_uncertainty_score":0.041817665},"labels":[],"label_agreement":null},{"id":"W2251394987","doi":"10.1016/j.ic.2016.01.005","title":"Topology recognition with advice","year":2016,"lang":"en","type":"article","venue":"Information and Computation","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":20,"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é du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Advice (programming); Topology (electrical circuits); Oracle; Computer science; Node (physics); Network topology; Computation; Upper and lower bounds; Graph; Logical topology; Theoretical computer science; Mathematics; Computer network; Combinatorics; Algorithm","score_opus":0.015775602856260954,"score_gpt":0.2353759725628819,"score_spread":0.21960036970662095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2251394987","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.03338823,0.0002676296,0.88337743,0.0009889926,0.0005119851,0.00021126568,0.0015644176,0.025503667,0.054186314],"genre_scores_gemma":[0.4436649,0.00030048573,0.4990744,0.00049935136,0.00024168943,0.0001964182,0.0041980967,0.0029780234,0.048846606],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860114,0.00020235087,0.00010346362,0.00041100095,0.0005269785,0.00015510089],"domain_scores_gemma":[0.99685353,0.00076026144,0.00011218595,0.0014343486,0.00066608,0.00017359635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006894942,0.00087644934,0.0009766147,0.0018852575,0.0009888465,0.002622325,0.0015690207,0.0015158786,0.025422817],"category_scores_gemma":[0.0076248646,0.00050191075,0.0010984773,0.001313516,0.0009876057,0.0039475285,0.0025362002,0.0018302534,0.011287697],"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.0005005954,0.0001888522,0.0026819573,0.00034271742,0.000060073595,0.0004796485,0.0004581205,0.027819734,0.015955066,0.1627736,0.055374794,0.7333649],"study_design_scores_gemma":[0.00006182738,0.00008265057,0.0009083898,0.00010392838,0.000071230024,0.00047457687,0.00023046571,0.34956667,0.03488508,0.52280915,0.09073944,0.000066556415],"about_ca_topic_score_codex":0.002586024,"about_ca_topic_score_gemma":0.004383812,"teacher_disagreement_score":0.025422817,"about_ca_system_score_codex":0.0007806207,"about_ca_system_score_gemma":0.0010040714,"threshold_uncertainty_score":0.08504778},"labels":[],"label_agreement":null},{"id":"W2256514854","doi":"10.4230/lipics.tqc.2015.206","title":"Round Elimination in Exact Communication Complexity","year":2015,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"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":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Institute for Advanced Research","keywords":"Communication complexity; Upper and lower bounds; Alice and Bob; Chromatic scale; Mathematics; Discrete mathematics; Rank (graph theory); Hierarchy; Context (archaeology); Theoretical computer science; Computer science; Combinatorics; Alice (programming language)","score_opus":0.21052348023049255,"score_gpt":0.21842155078974124,"score_spread":0.007898070559248682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256514854","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.2423467,0.0021025697,0.6690948,0.010584799,0.00025659686,0.00037265825,0.00087641913,0.001085688,0.07327979],"genre_scores_gemma":[0.8948316,0.0012577603,0.08559499,0.0011347996,0.0003902965,0.00081395725,0.00055162754,0.0003139234,0.015111107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919972,0.003030306,0.0002919985,0.0011621795,0.0021547698,0.0013636292],"domain_scores_gemma":[0.96223813,0.030281065,0.0013910405,0.004369154,0.0010795023,0.00064113754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049784016,0.0010893844,0.001407004,0.0013215849,0.0022273392,0.004465454,0.0029905648,0.0022163212,0.009058183],"category_scores_gemma":[0.025572674,0.0007312629,0.0017958251,0.0018691461,0.006302859,0.013976605,0.0052528908,0.0058589247,0.0011121184],"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.00009422567,0.000039353607,0.00034060807,0.00012891176,0.000020248577,0.000067832676,0.0002868216,0.022667082,0.00062944874,0.9657718,0.0017557574,0.008197836],"study_design_scores_gemma":[0.000044439428,0.000030930903,0.00015133915,0.000020125948,0.000018987314,0.00005031941,0.00005902537,0.0812101,0.0006935326,0.9154925,0.0022085416,0.000020226254],"about_ca_topic_score_codex":0.0018701294,"about_ca_topic_score_gemma":0.0012956033,"teacher_disagreement_score":0.009058183,"about_ca_system_score_codex":0.0045122444,"about_ca_system_score_gemma":0.0026407007,"threshold_uncertainty_score":0.032738805},"labels":[],"label_agreement":null},{"id":"W2258418267","doi":"10.1109/isit.2016.7541718","title":"A linearithmic time algorithm for a shortest vector problem in compute-and-forward design","year":2016,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Dimension (graph theory); Algorithm; Computer science; Shortest Path Faster Algorithm; K shortest path routing; Mathematics; Shortest path problem; Theoretical computer science; Combinatorics","score_opus":0.022516105161227047,"score_gpt":0.23951301191372812,"score_spread":0.21699690675250108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2258418267","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.0038242491,0.00029786618,0.98767763,0.00036097466,0.00014232569,0.0002009945,0.00011240799,0.0015802808,0.005803187],"genre_scores_gemma":[0.076818906,0.00024753492,0.9165829,0.00022436338,0.000108518114,0.0004210179,0.00046035676,0.00022278495,0.004913629],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983809,0.0003651526,0.00013254679,0.0004186078,0.00050849747,0.00019422953],"domain_scores_gemma":[0.99842536,0.0007563737,0.00012022776,0.00039792046,0.00023895488,0.00006119477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011035233,0.0017913261,0.00093649473,0.0010671685,0.001016934,0.0018282535,0.001592531,0.0014892324,0.015823063],"category_scores_gemma":[0.0043023266,0.0006147458,0.0010930201,0.0016623472,0.0008998973,0.0028828692,0.0017040961,0.002476657,0.0041704406],"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.00048522817,0.0004914301,0.0008486468,0.0006715382,0.00014741799,0.0001501363,0.00023479544,0.11918014,0.0151736,0.09977722,0.034393042,0.72844684],"study_design_scores_gemma":[0.00056845177,0.00048054784,0.00046215154,0.00009769189,0.000110395165,0.0004940138,0.0001358907,0.7607195,0.011545914,0.19512568,0.030175164,0.00008468715],"about_ca_topic_score_codex":0.0024291037,"about_ca_topic_score_gemma":0.005008019,"teacher_disagreement_score":0.015823063,"about_ca_system_score_codex":0.0015561212,"about_ca_system_score_gemma":0.0030219604,"threshold_uncertainty_score":0.052933455},"labels":[],"label_agreement":null},{"id":"W2263246245","doi":"","title":"Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky","year":2021,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":53,"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":"Satisfiability; Randomized algorithm; Deterministic algorithm; Combinatorics; Mathematics; Matching (statistics); Discrete mathematics; Running time; Variable (mathematics); Key (lock); Binary logarithm; Algorithm; Computer science; Statistics","score_opus":0.012097120532414572,"score_gpt":0.2434263904676279,"score_spread":0.23132926993521333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2263246245","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.17754371,0.0007103722,0.7924145,0.003885807,0.00033180267,0.00044539207,0.0011449197,0.0049417103,0.018581858],"genre_scores_gemma":[0.65541005,0.00033589467,0.33250368,0.0010908368,0.000178122,0.0006514442,0.0013454674,0.0010348534,0.0074496125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99508214,0.0022124292,0.0002548802,0.0008892164,0.0010297482,0.00053157244],"domain_scores_gemma":[0.99032265,0.0053866245,0.00057190727,0.002948373,0.00048002147,0.00029055774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042695417,0.0011747199,0.0011884391,0.0009276421,0.0015808782,0.001677569,0.002360441,0.0011534716,0.0080103455],"category_scores_gemma":[0.016228743,0.0007171131,0.0015925317,0.0016165352,0.0026590659,0.0058836956,0.004833837,0.0032221093,0.0019346137],"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.0018838339,0.00028841425,0.0057429504,0.00051451544,0.000224297,0.00026004037,0.00053098646,0.21427001,0.01592569,0.57239425,0.027981827,0.15998326],"study_design_scores_gemma":[0.00018309701,0.00019699706,0.0003969466,0.000036296507,0.000049934406,0.00010042289,0.00007447431,0.45961747,0.005705221,0.526745,0.0068518165,0.000042392363],"about_ca_topic_score_codex":0.0031349177,"about_ca_topic_score_gemma":0.005670145,"teacher_disagreement_score":0.0080103455,"about_ca_system_score_codex":0.002925879,"about_ca_system_score_gemma":0.0038909249,"threshold_uncertainty_score":0.026797295},"labels":[],"label_agreement":null},{"id":"W2276707316","doi":"10.1007/s10107-016-0987-5","title":"On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"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; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Mathematics; Combinatorics; Linear programming relaxation; Approximation algorithm; Discrete mathematics; Vertex (graph theory); Equivalence (formal languages); Bipartite graph; Upper and lower bounds; Relaxation (psychology); Linear programming; Graph; Algorithm","score_opus":0.03293364940603159,"score_gpt":0.24611926579887713,"score_spread":0.21318561639284556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276707316","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.1770768,0.0048657283,0.65516204,0.014964165,0.0008103679,0.00031634627,0.001170281,0.00035462636,0.14527972],"genre_scores_gemma":[0.6979243,0.006732912,0.24970888,0.0037489028,0.001789363,0.0007959595,0.002107867,0.00089523033,0.0362965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726415,0.0013813985,0.00012225505,0.0003789935,0.00048989453,0.00036336112],"domain_scores_gemma":[0.9805015,0.015598129,0.001098686,0.00096934394,0.00077652966,0.0010557056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005728962,0.0016724373,0.0022357118,0.0018880437,0.0018294088,0.0055092033,0.004051418,0.002793965,0.018057156],"category_scores_gemma":[0.030295914,0.0014452477,0.0018242673,0.0034414402,0.0047444184,0.0144217685,0.0055319555,0.009832906,0.0012660747],"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.00017908264,0.00017371525,0.00046265963,0.0002373865,0.000031224896,0.000055880446,0.00041662029,0.03325034,0.000464872,0.93764937,0.007031484,0.020047413],"study_design_scores_gemma":[0.000052687505,0.000053345746,0.00031110705,0.00006674676,0.000020149002,0.00004296855,0.0001696932,0.0923631,0.00016967233,0.9038903,0.002839249,0.000020926045],"about_ca_topic_score_codex":0.004179925,"about_ca_topic_score_gemma":0.0043195416,"teacher_disagreement_score":0.018057156,"about_ca_system_score_codex":0.003142107,"about_ca_system_score_gemma":0.0022212458,"threshold_uncertainty_score":0.06040722},"labels":[],"label_agreement":null},{"id":"W2276905128","doi":"10.4230/lipics.approx-random.2015.265","title":"On Linear Programming Relaxations for Unsplittable Flow in Trees","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Waterloo; University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Linear programming relaxation; Path (computing); Omega; Tree (set theory); Rank (graph theory); Upper and lower bounds; Relaxation (psychology); Linear programming; Approximation algorithm; Binary logarithm; Constant (computer programming); Time complexity; Discrete mathematics; Algorithm; Computer science; Physics","score_opus":0.044742045626293775,"score_gpt":0.2913879659113839,"score_spread":0.2466459202850901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276905128","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.03637589,0.004154014,0.916285,0.0040291725,0.00030231097,0.00033357504,0.0007370118,0.00053356914,0.037249584],"genre_scores_gemma":[0.29927173,0.0075657284,0.66399163,0.0027880443,0.0012990624,0.0014514164,0.0021874493,0.0010043826,0.02044062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739313,0.0010122531,0.00009544767,0.00042900897,0.00050598785,0.0005640628],"domain_scores_gemma":[0.98739713,0.010546939,0.00078923005,0.00044656187,0.0005062089,0.00031393475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040627397,0.0029014386,0.001647067,0.0015407923,0.0013411401,0.0031096647,0.0018469398,0.0021801444,0.009520166],"category_scores_gemma":[0.019305585,0.0014414692,0.0028986586,0.003499938,0.0024456135,0.0065592946,0.0021016332,0.009779396,0.0017173904],"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.00031094748,0.0004655253,0.00071669184,0.0007445348,0.00009932622,0.00036338522,0.00064673164,0.63595355,0.0033001152,0.29409543,0.014905192,0.04839859],"study_design_scores_gemma":[0.0000959067,0.00013973638,0.00031391313,0.00016985193,0.000040410257,0.00016352301,0.00022384757,0.7365228,0.0011822782,0.2491453,0.0119629335,0.000039512644],"about_ca_topic_score_codex":0.005064487,"about_ca_topic_score_gemma":0.004700054,"teacher_disagreement_score":0.009520166,"about_ca_system_score_codex":0.0035149325,"about_ca_system_score_gemma":0.0020366034,"threshold_uncertainty_score":0.031848133},"labels":[],"label_agreement":null},{"id":"W2280059905","doi":"10.4086/toc.2015.v011a001","title":"","year":2015,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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":"Mathematics; Combinatorics; Independent and identically distributed random variables; Completeness (order theory); Discrete mathematics; Bounded function; Distribution (mathematics); Pairwise independence; Pairwise comparison; Joint probability distribution; Uncorrelated; Independence (probability theory); Random variable; Mathematical analysis; Statistics","score_opus":0.06171816415099145,"score_gpt":0.27406741929279277,"score_spread":0.2123492551418013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280059905","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.058040995,0.0005752665,0.9187752,0.0077328417,0.00017803327,0.00021415274,0.0019689251,0.0006865732,0.011827875],"genre_scores_gemma":[0.69945097,0.0008415455,0.2760013,0.0029388124,0.00076784083,0.0005203583,0.0035314853,0.0004936766,0.015453919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99528295,0.0016433509,0.00021426387,0.0015978375,0.00076316943,0.00049843645],"domain_scores_gemma":[0.9676994,0.02493623,0.0016004213,0.003396508,0.0013652525,0.0010022151],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004214255,0.0008098874,0.001608788,0.00081305386,0.0017935263,0.0030615244,0.0032828082,0.0029406182,0.011984975],"category_scores_gemma":[0.02978705,0.00073786505,0.0021371443,0.0015177578,0.0029242618,0.008624562,0.003613717,0.0043884283,0.0015805191],"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.0009000506,0.00029887544,0.0055469074,0.00062843965,0.00018243206,0.00045636995,0.00051649445,0.12645991,0.00272327,0.7388518,0.020775478,0.102660045],"study_design_scores_gemma":[0.00006433839,0.00015326611,0.00068793667,0.000043727265,0.000054982866,0.0003024649,0.00016384525,0.20297459,0.0028962926,0.7851096,0.0075136763,0.00003516538],"about_ca_topic_score_codex":0.0026360268,"about_ca_topic_score_gemma":0.0028474038,"teacher_disagreement_score":0.988015,"about_ca_system_score_codex":0.0026356045,"about_ca_system_score_gemma":0.0026686455,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2284184122","doi":"10.1007/978-3-642-32241-9_35","title":"Lower Bounds against Weakly Uniform Circuits","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Succinctness; Boolean circuit; Electronic circuit; Mathematics; Polynomial; Discrete mathematics; Constant (computer programming); Combinatorics; Time complexity; Connection (principal bundle); Circuit complexity; Boolean function; Computer science; Mathematical analysis; Geometry; Physics","score_opus":0.022416987444804165,"score_gpt":0.23848588699634032,"score_spread":0.21606889955153616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284184122","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.10674273,0.01704855,0.41857466,0.015170535,0.0021168506,0.0004620338,0.003862111,0.0046042744,0.4314183],"genre_scores_gemma":[0.76079786,0.0111499475,0.097434066,0.005177104,0.0036195542,0.0015384636,0.005724515,0.003359311,0.11119934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99399394,0.0014066827,0.00025174304,0.0010509992,0.0020249847,0.0012716381],"domain_scores_gemma":[0.97341126,0.019858254,0.0008853889,0.0033191054,0.0014360745,0.0010898636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033161098,0.0038415529,0.0032355096,0.004784409,0.0038124598,0.007975894,0.006752348,0.003040401,0.03351585],"category_scores_gemma":[0.023158817,0.0018835939,0.0026152509,0.006497451,0.004190193,0.017117545,0.008949598,0.010417237,0.0068535595],"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.0011517153,0.00028043563,0.0007284082,0.0009876966,0.00013016594,0.00012316965,0.00036981233,0.02405825,0.0040493933,0.83785295,0.036876135,0.09339194],"study_design_scores_gemma":[0.00006978954,0.00007251111,0.0002709174,0.00017013976,0.000119054785,0.00010808257,0.00006874085,0.032533284,0.0029288507,0.95192534,0.011701479,0.000031902684],"about_ca_topic_score_codex":0.001342535,"about_ca_topic_score_gemma":0.0021215796,"teacher_disagreement_score":0.03351585,"about_ca_system_score_codex":0.005475181,"about_ca_system_score_gemma":0.0019283886,"threshold_uncertainty_score":0.11212164},"labels":[],"label_agreement":null},{"id":"W2296156273","doi":"10.4230/lipics.icalp.2017.52","title":"Randomized Communication vs. Partition Number.","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Communication complexity; Partition (number theory); Randomized algorithm; Mathematics; Combinatorics; Clique; Upper and lower bounds; Set (abstract data type); Computational complexity theory; Discrete mathematics; Computer science; Algorithm","score_opus":0.040418325749375754,"score_gpt":0.2913102703181808,"score_spread":0.25089194456880504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296156273","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.13811283,0.003092665,0.77912086,0.012764389,0.00097005547,0.00079193665,0.0029345201,0.0037250628,0.058487717],"genre_scores_gemma":[0.8728389,0.00092228706,0.11179359,0.0019519688,0.0007484359,0.000994492,0.0015897243,0.0009450953,0.008215529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98590404,0.005184954,0.000419681,0.0030720495,0.0032410135,0.0021782317],"domain_scores_gemma":[0.9079216,0.067620076,0.004852323,0.015244177,0.0019161014,0.0024457113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006098421,0.0021142492,0.002207789,0.0014297393,0.0028356346,0.0057704225,0.005778044,0.0036758638,0.017416272],"category_scores_gemma":[0.058882464,0.0011832865,0.0017384704,0.0026758143,0.0044295304,0.0145111205,0.0053817565,0.007054313,0.0024695154],"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.0029983516,0.00075007486,0.0029775244,0.0008314077,0.00020862553,0.00018740662,0.00034197685,0.2915904,0.012817128,0.58822906,0.022265103,0.0768029],"study_design_scores_gemma":[0.00026724688,0.00029479837,0.0007627283,0.00008278219,0.00009949033,0.00021465027,0.00007470095,0.56822884,0.0066432036,0.41878033,0.0044882162,0.00006306416],"about_ca_topic_score_codex":0.001709994,"about_ca_topic_score_gemma":0.0029630514,"teacher_disagreement_score":0.017416272,"about_ca_system_score_codex":0.006085685,"about_ca_system_score_gemma":0.0053411555,"threshold_uncertainty_score":0.058263242},"labels":[],"label_agreement":null},{"id":"W2296221246","doi":"","title":"The Approximability and Integrality Gap of Interval Stabbing and Independence Problems","year":2012,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Complexity and Algorithms in Graphs","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":"Mathematics; Rectangle; Combinatorics; Interval (graph theory); Linear programming; Independence (probability theory); Approximation algorithm; Set (abstract data type); Discrete mathematics; Duality (order theory); Independent set; Upper and lower bounds; Plane (geometry); Duality gap; Mathematical optimization; Optimization problem; Graph; Computer science; Statistics; Mathematical analysis","score_opus":0.058811907638360375,"score_gpt":0.2680974723676161,"score_spread":0.20928556472925575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296221246","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.33188218,0.0025731795,0.63639945,0.0024006253,0.000076409,0.00009339845,0.0004619312,0.00058244186,0.025530338],"genre_scores_gemma":[0.8829485,0.0015261677,0.10969681,0.00022554187,0.00019489448,0.00018824862,0.00069294916,0.00023669272,0.0042900937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963812,0.0013160668,0.00014275017,0.0007011275,0.000809752,0.00064918626],"domain_scores_gemma":[0.96987593,0.02541185,0.0014364343,0.0016808056,0.00061388826,0.0009810945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056626596,0.001446644,0.0020290203,0.0020005838,0.0013195983,0.0038333249,0.004294718,0.0018776354,0.0059107775],"category_scores_gemma":[0.0321937,0.0011277212,0.0019003177,0.003407538,0.0036658377,0.009562868,0.0036407004,0.0069489824,0.00047586384],"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.00088514644,0.00031532618,0.0033303401,0.00041011375,0.000106284904,0.00012703933,0.00073088025,0.3283249,0.0034308946,0.6130767,0.0027655251,0.046496816],"study_design_scores_gemma":[0.000051577805,0.00011226912,0.00090951775,0.0000631671,0.000048730726,0.00011743148,0.00018078211,0.6065101,0.0021084584,0.38843676,0.001435219,0.000025884916],"about_ca_topic_score_codex":0.0021589953,"about_ca_topic_score_gemma":0.0011768686,"teacher_disagreement_score":0.0059107775,"about_ca_system_score_codex":0.0036381085,"about_ca_system_score_gemma":0.0013449552,"threshold_uncertainty_score":0.0299474},"labels":[],"label_agreement":null},{"id":"W2300052872","doi":"10.1016/j.dam.2015.10.014","title":"A <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si26.gif\" display=\"inline\" overflow=\"scroll\"><mml:mfrac><mml:mrow><mml:mn>5</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac></mml:math>-approximation for subcubic 2EC using circulations and obliged edges","year":2015,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"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 Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm","score_opus":0.03999557587375012,"score_gpt":0.26736532694127957,"score_spread":0.22736975106752944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2300052872","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.013056437,0.00051343045,0.42572582,0.0038894785,0.00161491,0.00024994975,0.028971514,0.027953934,0.4980245],"genre_scores_gemma":[0.18120322,0.0016135328,0.29190195,0.0017738565,0.0008106875,0.00045664774,0.06856641,0.03141626,0.4222575],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963605,0.000051999392,0.000020487529,0.00009391972,0.00014312023,0.00005437637],"domain_scores_gemma":[0.9986695,0.0004325137,0.00006728294,0.00036100295,0.0003617332,0.00010803268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048498678,0.0007269408,0.00053511397,0.0013716468,0.00071455183,0.0024861607,0.0014782457,0.00085010874,0.29752174],"category_scores_gemma":[0.0030040916,0.00043791908,0.00069049175,0.002581205,0.0004499236,0.0032844343,0.0015371763,0.0018433268,0.09389829],"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.00025274922,0.00011816375,0.0007165173,0.0004958292,0.000024388768,0.00017781551,0.00024475387,0.0039883973,0.006397407,0.28996238,0.5748559,0.122765705],"study_design_scores_gemma":[0.000078753794,0.00004122417,0.0013528763,0.000106326595,0.000021024605,0.00039920246,0.00012753242,0.034735925,0.011723476,0.21581058,0.73555607,0.00004701823],"about_ca_topic_score_codex":0.003959302,"about_ca_topic_score_gemma":0.004954921,"teacher_disagreement_score":0.29752174,"about_ca_system_score_codex":0.0013159247,"about_ca_system_score_gemma":0.00077067345,"threshold_uncertainty_score":0.99530935},"labels":[],"label_agreement":null},{"id":"W2312191997","doi":"10.3138/infor.53.1.40","title":"A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems","year":2015,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Semidefinite programming; Mathematics; Relaxation (psychology); Hierarchy; Combinatorics; Benchmark (surveying); Projection (relational algebra); Maximum cut; Graph; Mathematical optimization; Discrete mathematics; Algorithm","score_opus":0.12726660238011808,"score_gpt":0.33624661440165216,"score_spread":0.20898001202153407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312191997","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.029361231,0.001272526,0.94583756,0.0010678096,0.00007960284,0.0002654324,0.00044926436,0.00054742565,0.021118976],"genre_scores_gemma":[0.28954178,0.0024141467,0.69719756,0.000968027,0.00025515584,0.00074822083,0.0019694015,0.00035781303,0.006547834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807906,0.0007717254,0.00009970495,0.00029507364,0.00052504527,0.00022935013],"domain_scores_gemma":[0.99543947,0.0029592547,0.0003402388,0.00047894183,0.00050097785,0.0002811982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003520843,0.0020985415,0.001489138,0.0011819606,0.0007875965,0.0020455935,0.0019195443,0.0012136966,0.0050285426],"category_scores_gemma":[0.007814801,0.0009607885,0.0017107495,0.0016424444,0.0014126376,0.0030159515,0.0023996765,0.006235645,0.0011139113],"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.0002894976,0.0005281496,0.0007833869,0.00096824387,0.000099301884,0.00023198074,0.00036322494,0.6222599,0.007781086,0.22910324,0.01552361,0.12206844],"study_design_scores_gemma":[0.000056702364,0.00015612175,0.00023277763,0.000073461146,0.000021336495,0.000117179625,0.00007053904,0.8828767,0.0015929765,0.11077843,0.003994699,0.000029147071],"about_ca_topic_score_codex":0.0011670726,"about_ca_topic_score_gemma":0.0024851698,"teacher_disagreement_score":0.0050285426,"about_ca_system_score_codex":0.0015766181,"about_ca_system_score_gemma":0.0016787116,"threshold_uncertainty_score":0.018620253},"labels":[],"label_agreement":null},{"id":"W2338410001","doi":"10.1016/j.tcs.2016.04.005","title":"Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":23,"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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Vertex cover; Cover (algebra); Vertex (graph theory); Mathematics; Edge cover; Approximation algorithm; Dual (grammatical number); Covering problems; Combinatorics; Set cover problem; Mathematical optimization; Algorithm; Computer science; Graph; Set (abstract data type)","score_opus":0.027205835633059547,"score_gpt":0.26314649833605147,"score_spread":0.2359406627029919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338410001","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.030138008,0.001867845,0.9514575,0.0016277345,0.00030833922,0.00029858423,0.00047593744,0.0011180312,0.012707961],"genre_scores_gemma":[0.31601104,0.0010511756,0.6699507,0.0007242805,0.00037695057,0.0007435888,0.0012578627,0.0006567918,0.009227608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836594,0.0005671472,0.000057113797,0.00029728224,0.0003624709,0.00035003264],"domain_scores_gemma":[0.9956676,0.0029145184,0.0002825997,0.0004626571,0.00034840312,0.00032424915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032883813,0.0024795684,0.0028323452,0.0016859216,0.0009762704,0.003901753,0.0037097652,0.002888603,0.009516623],"category_scores_gemma":[0.009707417,0.0013439821,0.0016241511,0.0030802551,0.0012512,0.004597943,0.0028580218,0.00548745,0.0016149614],"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.00080746145,0.0011187941,0.0013274527,0.0006367448,0.0001841644,0.00013297798,0.0001985552,0.68531156,0.0016591023,0.09129788,0.026383128,0.19094223],"study_design_scores_gemma":[0.00007045793,0.00004156431,0.00008001499,0.00003057491,0.00002232946,0.000039366638,0.000037174745,0.96308357,0.0002766704,0.03526084,0.0010499322,0.0000075542225],"about_ca_topic_score_codex":0.004144427,"about_ca_topic_score_gemma":0.0060046515,"teacher_disagreement_score":0.009516623,"about_ca_system_score_codex":0.0033380855,"about_ca_system_score_gemma":0.003303661,"threshold_uncertainty_score":0.03183627},"labels":[],"label_agreement":null},{"id":"W2339293751","doi":"10.1145/3087556.3087563","title":"Impact of Knowledge on Election Time in Anonymous Networks","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Université du Québec en Outaouais","funders":"","keywords":"Leader election; Node (physics); Computer science; Computer network; Task (project management); Simple (philosophy); Port (circuit theory); Path (computing); Sequence (biology); Distributed computing; Engineering","score_opus":0.02824446317044718,"score_gpt":0.31711142227053757,"score_spread":0.2888669591000904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339293751","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.5489767,0.0065647312,0.3414589,0.02153473,0.0010191862,0.00029364025,0.0012633074,0.0011171666,0.077771604],"genre_scores_gemma":[0.9817524,0.0011365636,0.011609983,0.00046138064,0.00032216983,0.00008756969,0.0001921316,0.00024391424,0.0041939598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914097,0.0035830194,0.0002706918,0.0014234303,0.0018694148,0.0014437069],"domain_scores_gemma":[0.793279,0.18415716,0.008119887,0.007410345,0.0034529765,0.0035806277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007954266,0.00088547956,0.00191557,0.0016467277,0.002586076,0.004893345,0.0024895938,0.002587231,0.0071134963],"category_scores_gemma":[0.09471312,0.0007062555,0.00087741436,0.0021646328,0.0039943396,0.012675818,0.0034526228,0.0036373634,0.00070725166],"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.0024690523,0.0005294732,0.005902072,0.00052915793,0.00019705726,0.00054132286,0.0009918144,0.52093333,0.0032719143,0.3937796,0.010606985,0.06024824],"study_design_scores_gemma":[0.00015574241,0.0002119135,0.0010922977,0.00006216156,0.00009251725,0.00019799454,0.00028023034,0.6259005,0.002291492,0.36658734,0.0030769256,0.00005082782],"about_ca_topic_score_codex":0.0020895796,"about_ca_topic_score_gemma":0.0017678662,"teacher_disagreement_score":0.007954266,"about_ca_system_score_codex":0.0040916107,"about_ca_system_score_gemma":0.0028153786,"threshold_uncertainty_score":0.042066693},"labels":[],"label_agreement":null},{"id":"W2369536682","doi":"10.1007/978-3-319-33461-5_4","title":"Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Matroid; Rounding; Spanning tree; Degree (music); Approximation algorithm; Combinatorics; Minimum spanning tree; Mathematical optimization; Reduction (mathematics); Linear programming relaxation; Mathematics; Lagrangian relaxation; Computer science; Tree (set theory); Linear programming","score_opus":0.02235592030043055,"score_gpt":0.23873351660190054,"score_spread":0.21637759630147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2369536682","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.031477805,0.0016356496,0.954457,0.0009098861,0.00022182602,0.00027216144,0.0007989039,0.0007444473,0.009482375],"genre_scores_gemma":[0.19174731,0.0018881754,0.7886991,0.0004966516,0.00048571895,0.00055188383,0.0024204107,0.0011857419,0.012525106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979955,0.0005301837,0.00010388926,0.00056327827,0.00059025065,0.0002170061],"domain_scores_gemma":[0.99416095,0.00388925,0.00033831084,0.0008569143,0.0004606713,0.00029390375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017624341,0.0024531458,0.003102061,0.001475662,0.000925735,0.0030486784,0.0060213837,0.0031486554,0.0111259315],"category_scores_gemma":[0.013112518,0.0016562854,0.0021255326,0.0052029965,0.0013223422,0.007045878,0.0038592864,0.0047339555,0.001954624],"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.00036053633,0.00050011807,0.0008617642,0.0013193062,0.00017424773,0.0001999245,0.0003408249,0.5902627,0.0032446105,0.09495852,0.02792602,0.27985147],"study_design_scores_gemma":[0.00004496081,0.000054185683,0.00016426622,0.00006200037,0.000050815383,0.00010836469,0.00008096404,0.84139776,0.00068469526,0.1538181,0.0035196876,0.000014130826],"about_ca_topic_score_codex":0.0038627707,"about_ca_topic_score_gemma":0.0051547815,"teacher_disagreement_score":0.0111259315,"about_ca_system_score_codex":0.0019997053,"about_ca_system_score_gemma":0.001750156,"threshold_uncertainty_score":0.03721994},"labels":[],"label_agreement":null},{"id":"W2394568608","doi":"","title":"Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits.","year":2014,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Satisfiability; Mathematics; Parity (physics); Electronic circuit; Binary number; Algorithm; Boolean circuit; Boolean function; Correlation; Constant (computer programming); Discrete mathematics; Combinatorics; Arithmetic; Computer science; Physics","score_opus":0.03848540810114379,"score_gpt":0.27544994856066984,"score_spread":0.23696454045952606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394568608","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.0563213,0.001944987,0.9055988,0.0031054434,0.0001670643,0.0002777246,0.0006796778,0.0025688792,0.029336073],"genre_scores_gemma":[0.64869475,0.001673663,0.32762998,0.0031861519,0.00058638386,0.0012417027,0.0023550536,0.0016389404,0.012993388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911299,0.002731244,0.0003663246,0.001709393,0.0025442338,0.0015188976],"domain_scores_gemma":[0.9108474,0.072055034,0.004390238,0.008362629,0.0031380358,0.0012066684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066902265,0.0021703423,0.0017446447,0.0024424829,0.0022959055,0.0045879516,0.00578401,0.0026765424,0.014191646],"category_scores_gemma":[0.052811183,0.0016588579,0.0035081396,0.0046178894,0.0040296274,0.013312778,0.0046796477,0.0082290005,0.0030333702],"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.0013101287,0.0008035974,0.007507139,0.00087278883,0.00036912374,0.0003894721,0.00055401254,0.18658358,0.017349403,0.63191354,0.022311307,0.13003588],"study_design_scores_gemma":[0.00011318747,0.00015634923,0.0016653276,0.00012026897,0.00017674244,0.00028742876,0.00006880189,0.6428296,0.014364677,0.33358097,0.006579404,0.00005729135],"about_ca_topic_score_codex":0.003348504,"about_ca_topic_score_gemma":0.004219517,"teacher_disagreement_score":0.014191646,"about_ca_system_score_codex":0.007153672,"about_ca_system_score_gemma":0.0052710935,"threshold_uncertainty_score":0.051903784},"labels":[],"label_agreement":null},{"id":"W2395991959","doi":"10.1007/s00037-017-0156-0","title":"The Average Sensitivity of Bounded-Depth Formulas","year":2017,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"Simons Institute for the Theory of Computing, University of California Berkeley","keywords":"Bounded function; Omega; Lemma (botany); Mathematics; Boolean function; Combinatorics; Upper and lower bounds; Sensitivity (control systems); Parity (physics); Function (biology); Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.06812620353572955,"score_gpt":0.30958691097718677,"score_spread":0.2414607074414572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395991959","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.49752674,0.0058317003,0.4430909,0.010702122,0.00045418472,0.0001533762,0.002458524,0.0023715294,0.037410885],"genre_scores_gemma":[0.9760335,0.0013471988,0.01775411,0.00088245113,0.0004636454,0.00009763964,0.00053401967,0.00043417665,0.002453173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914534,0.0028723706,0.00035804702,0.0018888322,0.002127817,0.0012996258],"domain_scores_gemma":[0.8078194,0.1682621,0.0050358414,0.010625017,0.00483711,0.0034204896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064604837,0.0016228574,0.0030370653,0.0037607087,0.0015499486,0.0047779446,0.0046536275,0.0031381468,0.007968419],"category_scores_gemma":[0.10927692,0.001964166,0.0021566625,0.0028851153,0.0043578795,0.016764892,0.003975588,0.0067482493,0.0006337503],"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.0013379,0.0002469833,0.00898254,0.0009265189,0.00047607053,0.00046595823,0.00077981316,0.32183954,0.009043304,0.5923295,0.009638545,0.05393338],"study_design_scores_gemma":[0.00003758363,0.00007553414,0.0017177595,0.00006964652,0.00016883377,0.000258027,0.00007516092,0.34883612,0.003186097,0.64434576,0.0011809906,0.000048482067],"about_ca_topic_score_codex":0.0024763767,"about_ca_topic_score_gemma":0.0014393486,"teacher_disagreement_score":0.007968419,"about_ca_system_score_codex":0.0051925397,"about_ca_system_score_gemma":0.0025711418,"threshold_uncertainty_score":0.037674665},"labels":[],"label_agreement":null},{"id":"W2396989770","doi":"","title":"Bounded-depth Frege lower bounds for weaker pigeonhole principles","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Pigeonhole principle; Bounded function; Mathematical proof; Lemma (botany); Mathematics; Upper and lower bounds; Tautology (logic); Discrete mathematics; Argument (complex analysis); Combinatorics; Computer science; Mathematical analysis","score_opus":0.0701979948883009,"score_gpt":0.2544185079142551,"score_spread":0.18422051302595416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396989770","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.08968815,0.0034153985,0.806025,0.01612256,0.00081784424,0.00064054393,0.0012360851,0.0037925644,0.07826184],"genre_scores_gemma":[0.7013258,0.0025694573,0.26808238,0.005621344,0.0015114599,0.0011464112,0.0013475267,0.0017585859,0.016636949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99100786,0.002350422,0.00036416843,0.0016531877,0.0027762463,0.0018480837],"domain_scores_gemma":[0.90496606,0.074919514,0.0026587192,0.012222359,0.0033874237,0.0018459879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00870407,0.0020672076,0.0018585242,0.0027242,0.0035377145,0.0057488615,0.0054549086,0.0030558521,0.029279841],"category_scores_gemma":[0.05743315,0.0016958517,0.0049858997,0.001855784,0.007372648,0.032216966,0.010927351,0.013578548,0.003860977],"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.0009129303,0.0003202,0.0019031639,0.0010131098,0.0001419054,0.00025375542,0.0007911233,0.01955473,0.011300051,0.8827232,0.01897237,0.062113486],"study_design_scores_gemma":[0.0001361638,0.00018932004,0.00071610993,0.00013182317,0.00012933303,0.00034333585,0.0001597068,0.051218025,0.009421759,0.9252286,0.0122457715,0.000080112324],"about_ca_topic_score_codex":0.0016845947,"about_ca_topic_score_gemma":0.0020763553,"teacher_disagreement_score":0.029279841,"about_ca_system_score_codex":0.0046180314,"about_ca_system_score_gemma":0.0031123352,"threshold_uncertainty_score":0.09795076},"labels":[],"label_agreement":null},{"id":"W2397193627","doi":"","title":"Mining Circuit Lower Bound Proofs for Meta-Algorithms.","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Mathematical proof; Truth table; Boolean function; Algorithm; Computer science; Upper and lower bounds; Boolean circuit; Circuit minimization for Boolean functions; Discrete mathematics; Mathematics","score_opus":0.0945715747060616,"score_gpt":0.2774951260997269,"score_spread":0.18292355139366528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397193627","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.04107786,0.0019175038,0.93965065,0.0032188066,0.00016748908,0.00048830826,0.0017661707,0.0036112615,0.008101993],"genre_scores_gemma":[0.5351179,0.0013257747,0.44827124,0.001905821,0.0005159822,0.0009253871,0.0055157696,0.0011026491,0.005319312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9872586,0.0036706298,0.0006253802,0.0018210027,0.006060743,0.0005636837],"domain_scores_gemma":[0.90935344,0.069825515,0.0036626114,0.012491702,0.0039197616,0.00074692833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068820305,0.0013974666,0.0015799219,0.0028340064,0.0012429346,0.004428382,0.0042077806,0.0019687337,0.008712562],"category_scores_gemma":[0.08860913,0.0018793466,0.003208291,0.0030545099,0.0027738477,0.010407519,0.004787173,0.0053415024,0.0017563718],"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.0008633102,0.0004725583,0.008429302,0.002603031,0.0006471175,0.00073680055,0.000803996,0.10510236,0.015571108,0.5495781,0.021549234,0.29364315],"study_design_scores_gemma":[0.000144535,0.00011849225,0.00078681344,0.00019247814,0.00017530065,0.0004086811,0.000087680804,0.36907238,0.0116100935,0.60623795,0.011123783,0.000041801],"about_ca_topic_score_codex":0.00054062676,"about_ca_topic_score_gemma":0.0009899782,"teacher_disagreement_score":0.008712562,"about_ca_system_score_codex":0.0024876879,"about_ca_system_score_gemma":0.0027597593,"threshold_uncertainty_score":0.036396086},"labels":[],"label_agreement":null},{"id":"W2397518487","doi":"","title":"Nonuniform catalytic space and the direct sum for space","year":2015,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","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":"Université de Montréal","funders":"","keywords":"Boolean function; Branching (polymer chemistry); Computation; Space (punctuation); Function (biology); Mathematics; Discrete mathematics; Literal (mathematical logic); Binary decision diagram; Combinatorics; Property (philosophy); Computer science; Algorithm; Biology","score_opus":0.03804816408237615,"score_gpt":0.2734843221984433,"score_spread":0.23543615811606716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397518487","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.2604603,0.0010883309,0.6971858,0.0018758486,0.00010552862,0.00010534983,0.00034262886,0.0006359961,0.03820022],"genre_scores_gemma":[0.91454,0.00055947766,0.072163895,0.00035390793,0.00011211622,0.00018714239,0.00025947235,0.00025213545,0.011571887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745065,0.00071290176,0.00013328028,0.0006239704,0.0006970911,0.00038201082],"domain_scores_gemma":[0.9927832,0.003960217,0.00037107232,0.0021816997,0.00037494904,0.00032888484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019178467,0.0006841681,0.0011324611,0.00074899883,0.0012621087,0.0029244702,0.0023462353,0.0011563766,0.008555349],"category_scores_gemma":[0.010032387,0.00053465285,0.0014821875,0.0013517889,0.0042179488,0.009068564,0.0037942661,0.0025178576,0.00083513046],"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.000092658076,0.00002255094,0.00036410266,0.000061049526,0.0000133878,0.00007366901,0.00012930275,0.023226997,0.0011527806,0.9644239,0.00066592597,0.009773786],"study_design_scores_gemma":[0.000022980106,0.000057167897,0.00010744117,0.000013496701,0.000019240906,0.00014706013,0.000044147415,0.12097292,0.0022087102,0.8730202,0.0033710718,0.00001562557],"about_ca_topic_score_codex":0.0010213602,"about_ca_topic_score_gemma":0.0008304652,"teacher_disagreement_score":0.008555349,"about_ca_system_score_codex":0.0018207429,"about_ca_system_score_gemma":0.0013682676,"threshold_uncertainty_score":0.028620481},"labels":[],"label_agreement":null},{"id":"W2397833257","doi":"10.4230/lipics.ccc.2016.5","title":"A Composition Theorem for Conical Juntas.","year":2015,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Communication complexity; Upper and lower bounds; Context (archaeology); Mathematics; Tree (set theory); Combinatorics; Boolean function; Function (biology); Discrete mathematics; Decision tree model; Computer science; Decision tree; Artificial intelligence","score_opus":0.04365673072524578,"score_gpt":0.28863726379517657,"score_spread":0.24498053306993078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397833257","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.031264413,0.00040662134,0.8940938,0.0017050509,0.00028822583,0.00030868757,0.0004430793,0.0010706908,0.07041943],"genre_scores_gemma":[0.5972743,0.00062615087,0.35872975,0.0028288069,0.0005845299,0.000948328,0.0009991234,0.00094683457,0.03706224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99433124,0.00092537043,0.00027456717,0.0012875934,0.0024051147,0.0007761185],"domain_scores_gemma":[0.98974097,0.0066676075,0.0005766941,0.0016873027,0.00088618865,0.00044124902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033670159,0.0007331682,0.0010855776,0.0012487486,0.0022987942,0.0031515965,0.0024612607,0.0017075236,0.018924227],"category_scores_gemma":[0.017027598,0.0008514196,0.0029683176,0.00122232,0.0045383177,0.010488927,0.0062333466,0.0071142106,0.0035068013],"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.00010916192,0.000041301737,0.0003946467,0.00012211375,0.000020071697,0.00006664246,0.00014709108,0.0046923594,0.004677887,0.9674662,0.0026415472,0.019621037],"study_design_scores_gemma":[0.000030437901,0.00006190611,0.00023159722,0.000036090547,0.000038495204,0.00020081467,0.000051919607,0.04182222,0.007121668,0.93973947,0.010639617,0.000025672427],"about_ca_topic_score_codex":0.001033816,"about_ca_topic_score_gemma":0.00166605,"teacher_disagreement_score":0.018924227,"about_ca_system_score_codex":0.0021521277,"about_ca_system_score_gemma":0.0017926294,"threshold_uncertainty_score":0.06330788},"labels":[],"label_agreement":null},{"id":"W2398812037","doi":"","title":"Is the Valiant-Vazirani Isolation Lemma Improvable?","year":2011,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Lemma (botany); Combinatorics; Witness; Mathematics; Isolation (microbiology); Time complexity; Polynomial; Discrete mathematics; Computer science; Botany; Biology","score_opus":0.0715601453350734,"score_gpt":0.2694981997654061,"score_spread":0.19793805443033272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398812037","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.062176995,0.001221142,0.90090764,0.0085018305,0.00037955312,0.00018550816,0.00022465207,0.0017045856,0.024698028],"genre_scores_gemma":[0.8264758,0.00085105596,0.15904887,0.0032626141,0.00076889317,0.0006385093,0.0003942635,0.0006487982,0.00791128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98479444,0.004896841,0.00054034474,0.0030205816,0.0043000197,0.0024478114],"domain_scores_gemma":[0.91838306,0.05893421,0.0037388743,0.0140941115,0.0036800096,0.0011697896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010368637,0.00083403854,0.0017518064,0.0009990323,0.0022643805,0.003513481,0.00430467,0.0028137942,0.009049986],"category_scores_gemma":[0.052587066,0.0010463792,0.0023454474,0.001030352,0.008500618,0.010444037,0.007406999,0.008690557,0.0016776506],"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.00061198015,0.00019273107,0.0018558503,0.00030250236,0.00013050316,0.00032087616,0.00044460385,0.027920203,0.005356567,0.90930396,0.010051987,0.043508306],"study_design_scores_gemma":[0.00020506723,0.00017684461,0.0006951624,0.00009966063,0.00007448535,0.00034353175,0.00015993835,0.1436791,0.01286034,0.83058625,0.011051829,0.000067762536],"about_ca_topic_score_codex":0.00088231254,"about_ca_topic_score_gemma":0.0006196561,"teacher_disagreement_score":0.010368637,"about_ca_system_score_codex":0.0024131644,"about_ca_system_score_gemma":0.0020032618,"threshold_uncertainty_score":0.0548352},"labels":[],"label_agreement":null},{"id":"W2399132114","doi":"10.1007/s00037-018-0166-6","title":"The Landscape of Communication Complexity Classes","year":2018,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"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":"Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Computer science; Communication complexity; Theoretical computer science","score_opus":0.07522345276282445,"score_gpt":0.31081136914360635,"score_spread":0.23558791638078191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399132114","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.20676187,0.08123181,0.23770532,0.19900519,0.0010142529,0.000098398734,0.002636032,0.0010806296,0.27046657],"genre_scores_gemma":[0.92150295,0.027108243,0.029515153,0.004311176,0.004293586,0.00028206749,0.0008363109,0.0003838782,0.011766658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973694,0.00088501803,0.00008139218,0.0006131273,0.00069575856,0.00035521536],"domain_scores_gemma":[0.9580546,0.03585896,0.0012559744,0.0017354139,0.0016173978,0.0014776475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00294746,0.0008366303,0.0013584398,0.0037482844,0.0019700937,0.009699756,0.0022054957,0.0034521273,0.010891299],"category_scores_gemma":[0.022252563,0.00072221225,0.0006783469,0.0036822243,0.0065317512,0.017604768,0.0025433663,0.0056027207,0.0009472498],"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.00003186426,0.000024256544,0.0005021567,0.000111430265,0.000011800429,0.000019655503,0.00012193218,0.0041216607,0.00013780274,0.97239345,0.005832724,0.016691223],"study_design_scores_gemma":[0.000009318213,0.0000065289287,0.0004603773,0.000039434228,0.0000050015797,0.00003916468,0.00008730496,0.008329585,0.000065466505,0.9844556,0.0064935624,0.000008595105],"about_ca_topic_score_codex":0.002057028,"about_ca_topic_score_gemma":0.0013907307,"teacher_disagreement_score":0.010891299,"about_ca_system_score_codex":0.003996004,"about_ca_system_score_gemma":0.0011632944,"threshold_uncertainty_score":0.036435008},"labels":[],"label_agreement":null},{"id":"W2399132844","doi":"","title":"On Resolution Like Proofs of Monotone Self-Dual Functions.","year":2014,"lang":"en","type":"article","venue":"ISAIM","topic":"Complexity and Algorithms in Graphs","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 Lethbridge","funders":"","keywords":"Mathematical proof; Monotone polygon; Mathematics; Resolution (logic); Discrete mathematics; Boolean function; Class (philosophy); Duality (order theory); Dual (grammatical number); Combinatorics; Computer science","score_opus":0.012318350108671175,"score_gpt":0.22259884430323376,"score_spread":0.21028049419456257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399132844","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.13831185,0.0016199332,0.8298184,0.004784038,0.00021041415,0.0006483414,0.0009774511,0.0018569756,0.02177253],"genre_scores_gemma":[0.5491782,0.0014693887,0.43623376,0.0014194894,0.00037989518,0.0005040469,0.0018988266,0.0007262232,0.008190244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9893215,0.004611415,0.0006118586,0.0014973257,0.0026908794,0.0012671726],"domain_scores_gemma":[0.8862691,0.09544389,0.005363214,0.009035413,0.00251334,0.0013750418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007957894,0.0012184881,0.0014378607,0.0020389073,0.0019068533,0.00626434,0.004165283,0.0022305355,0.015099069],"category_scores_gemma":[0.05262461,0.0013191829,0.0031523006,0.0025951983,0.0039410954,0.02252718,0.0055672023,0.006094575,0.001695984],"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.0008057467,0.00060578086,0.0036990559,0.0015103774,0.0003627674,0.00052631774,0.0011621389,0.04967888,0.019526388,0.8188559,0.007908236,0.0953583],"study_design_scores_gemma":[0.00012214828,0.00018923263,0.0008697291,0.00010825579,0.00014865524,0.00067057833,0.00019987921,0.1264797,0.012417063,0.85219777,0.006517316,0.00007957139],"about_ca_topic_score_codex":0.000825942,"about_ca_topic_score_gemma":0.0014260114,"teacher_disagreement_score":0.015099069,"about_ca_system_score_codex":0.003320291,"about_ca_system_score_gemma":0.0025362931,"threshold_uncertainty_score":0.05051142},"labels":[],"label_agreement":null},{"id":"W2400880491","doi":"10.1007/978-3-662-48971-0_53","title":"Constant Query Time $$(1+\\epsilon )$$ -Approximate Distance Oracle for Planar Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"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":"Combinatorics; Oracle; Binary logarithm; Time complexity; Graph; Constant (computer programming); Mathematics; Physics; Computer science","score_opus":0.03021250463092352,"score_gpt":0.25719653106098656,"score_spread":0.22698402643006305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400880491","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.116592735,0.008329487,0.6957428,0.01734517,0.0017435701,0.0006740196,0.012112301,0.022322714,0.12513715],"genre_scores_gemma":[0.54763687,0.0038424002,0.36129922,0.0027825017,0.0012982016,0.00068920146,0.013329065,0.0040138913,0.06510863],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925936,0.0010511122,0.00042625857,0.0019590221,0.0025948868,0.0013751565],"domain_scores_gemma":[0.9847247,0.007285635,0.00055012037,0.0058833263,0.0010109469,0.0005452462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002541794,0.0026341996,0.0042912997,0.0015396813,0.0019762348,0.006127036,0.009228534,0.003957134,0.04665676],"category_scores_gemma":[0.015352202,0.0012208284,0.0029309148,0.005690419,0.0026105386,0.020531872,0.0068595014,0.007996319,0.01308417],"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.004118911,0.0009881606,0.0024029287,0.0027079023,0.00038489306,0.00027682015,0.0005172752,0.08725421,0.023855148,0.21419778,0.15276942,0.51052654],"study_design_scores_gemma":[0.00083176524,0.00037694172,0.0021464543,0.0002543305,0.0005437696,0.0010860644,0.00051154115,0.3592296,0.021292837,0.5666759,0.046866473,0.00018434634],"about_ca_topic_score_codex":0.0058035883,"about_ca_topic_score_gemma":0.009225731,"teacher_disagreement_score":0.04665676,"about_ca_system_score_codex":0.006720175,"about_ca_system_score_gemma":0.0050997627,"threshold_uncertainty_score":0.15608239},"labels":[],"label_agreement":null},{"id":"W2402204697","doi":"","title":"Lower Bounds on Interactive Compressibility by Constant-Depth Circuits.","year":2012,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Upper and lower bounds; Mathematics; Connection (principal bundle); Constant (computer programming); Compressibility; Bounded function; Electronic circuit; Compression (physics); Discrete mathematics; Combinatorics; Omega; Probabilistic logic; Computer science; Mathematical analysis; Physics; Geometry; Quantum mechanics; Statistics","score_opus":0.03066489096434945,"score_gpt":0.283515508964421,"score_spread":0.2528506180000716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402204697","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.20440547,0.008010441,0.61478436,0.01741094,0.0003999476,0.0009127775,0.004138451,0.004164356,0.14577338],"genre_scores_gemma":[0.90863067,0.0031135543,0.06683995,0.002230948,0.00079086545,0.001074815,0.0020228727,0.0009738672,0.01432252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.989884,0.0016029031,0.00036446695,0.0017402925,0.0039432673,0.0024649536],"domain_scores_gemma":[0.92641306,0.0575347,0.0030310424,0.009652169,0.0017189621,0.0016501013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004987842,0.0023738567,0.0019501026,0.002191937,0.0025856637,0.0053015025,0.0057639894,0.0037045819,0.018860146],"category_scores_gemma":[0.044364307,0.0015379157,0.0035808366,0.0028704773,0.0066991975,0.02449514,0.0096639935,0.01201508,0.0020310334],"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.0019503274,0.0004839277,0.0055961944,0.0011234051,0.00031650794,0.0006254605,0.0012913469,0.08577202,0.020756945,0.8181678,0.01075777,0.053158265],"study_design_scores_gemma":[0.0002476295,0.00025250515,0.0023812244,0.00021358237,0.00038005976,0.000747365,0.0001894028,0.2105697,0.03491004,0.73692685,0.013057419,0.00012421541],"about_ca_topic_score_codex":0.0017064153,"about_ca_topic_score_gemma":0.0017377688,"teacher_disagreement_score":0.018860146,"about_ca_system_score_codex":0.00587451,"about_ca_system_score_gemma":0.0025377797,"threshold_uncertainty_score":0.063093424},"labels":[],"label_agreement":null},{"id":"W2402364738","doi":"","title":"On k-Guarding Polygons.","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Combinatorics; Vertex (graph theory); Mathematics; Time complexity; Binary logarithm; Approximation algorithm; Simple polygon; Log-log plot; Set (abstract data type); Discrete mathematics; Regular polygon; Graph; Computer science; Geometry","score_opus":0.012001003004177179,"score_gpt":0.21547174378093864,"score_spread":0.20347074077676147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402364738","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.2036874,0.0008638716,0.7634646,0.00047916197,0.0001295068,0.00026297785,0.0015003616,0.0022136888,0.027398432],"genre_scores_gemma":[0.48996347,0.0008616468,0.49706742,0.000116389885,0.00006063977,0.00014822575,0.0023190123,0.00024079568,0.0092224395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994018,0.00008816677,0.00004106099,0.00017552695,0.0001513899,0.00014192484],"domain_scores_gemma":[0.9985771,0.000575098,0.00025310187,0.0004232178,0.00006770177,0.00010378963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029616937,0.00094167254,0.0009056303,0.00050610764,0.0006294178,0.0012377924,0.0016780443,0.0006401562,0.0072593265],"category_scores_gemma":[0.0025809312,0.0005535212,0.00092052494,0.0015404313,0.0010962161,0.0031076933,0.0022684345,0.001097802,0.0020259877],"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.0011605008,0.00024142262,0.005424904,0.0010285719,0.000114642986,0.001008298,0.0005875117,0.57587224,0.021951085,0.10230397,0.010584458,0.2797224],"study_design_scores_gemma":[0.00014766412,0.00020278951,0.0015892627,0.00010073228,0.00005666045,0.00097193144,0.00042949256,0.73791426,0.017313339,0.21962638,0.02161314,0.000034338387],"about_ca_topic_score_codex":0.0027387985,"about_ca_topic_score_gemma":0.0035444514,"teacher_disagreement_score":0.0072593265,"about_ca_system_score_codex":0.00075083034,"about_ca_system_score_gemma":0.0006748825,"threshold_uncertainty_score":0.0242849},"labels":[],"label_agreement":null},{"id":"W2402863327","doi":"","title":"Non-commutative circuits and the sum-of-squares problem.","year":2010,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","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":"Commutative property; Mathematics; Upper and lower bounds; Combinatorics; Discrete mathematics; Mathematical proof; Polynomial; Integer (computer science); Mathematical analysis","score_opus":0.01641980183737616,"score_gpt":0.2615900276857136,"score_spread":0.24517022584833745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402863327","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.16375968,0.0040001185,0.7358416,0.01874638,0.0007935787,0.00033881745,0.0022661027,0.0018388089,0.07241501],"genre_scores_gemma":[0.77805156,0.002432132,0.17922534,0.003308141,0.0014813764,0.0006670804,0.0021818294,0.00090029585,0.031752173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947174,0.0011406709,0.00025515686,0.001406081,0.0017723978,0.00070821133],"domain_scores_gemma":[0.9428846,0.045671098,0.0020330956,0.0065148096,0.0019149348,0.000981362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046300567,0.0012253136,0.0014741844,0.0010377736,0.0022336086,0.004680456,0.004201408,0.0018881767,0.018098822],"category_scores_gemma":[0.025337229,0.00097188394,0.002968449,0.001671035,0.0051584463,0.024964018,0.005186339,0.008219856,0.0021496804],"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.00045722726,0.000099652505,0.0012395268,0.00054290326,0.00007910944,0.00014630798,0.0003685642,0.014360674,0.0054754154,0.9385723,0.0072775865,0.031380642],"study_design_scores_gemma":[0.00006232551,0.000071064496,0.0003346606,0.00004231969,0.000050415823,0.00017380767,0.00007780829,0.026731322,0.0070570703,0.95746744,0.007908245,0.000023517465],"about_ca_topic_score_codex":0.0011675206,"about_ca_topic_score_gemma":0.0015136653,"teacher_disagreement_score":0.018098822,"about_ca_system_score_codex":0.0039059864,"about_ca_system_score_gemma":0.0028835724,"threshold_uncertainty_score":0.060546637},"labels":[],"label_agreement":null},{"id":"W2403213103","doi":"","title":"A better approximation ratio for the Vertex Cover problem","year":2004,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"McMaster University","funders":"","keywords":"Vertex cover; Combinatorics; Cover (algebra); Mathematics; Relaxation (psychology); Vertex (graph theory); Approximation algorithm; Set cover problem; Set (abstract data type); Edge cover; Maximum cut; Discrete mathematics; Computer science; Graph","score_opus":0.02213714143351398,"score_gpt":0.24053654038311786,"score_spread":0.2183993989496039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403213103","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.07774302,0.0052665854,0.8591011,0.011686224,0.0015527917,0.00023087583,0.0011291662,0.0032219912,0.04006816],"genre_scores_gemma":[0.4604861,0.0027062134,0.50622004,0.004341585,0.002442151,0.00052932807,0.002971324,0.002280294,0.018022997],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99354243,0.0020060241,0.00018234955,0.0015029686,0.001732599,0.0010335043],"domain_scores_gemma":[0.9859562,0.008332673,0.00063200464,0.003633895,0.00083185796,0.00061332446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004521724,0.0033776686,0.0026132914,0.0020220322,0.0010221077,0.004721929,0.0039447662,0.0041897395,0.019538151],"category_scores_gemma":[0.02214795,0.00079274835,0.0025329778,0.003390584,0.0016929029,0.010693717,0.0034872517,0.008620999,0.0045068716],"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.003171788,0.0020019142,0.002627518,0.0011200724,0.00040521947,0.00045133688,0.00053352996,0.30236387,0.025127541,0.2653547,0.07377721,0.32306534],"study_design_scores_gemma":[0.00029940915,0.00034181602,0.00053166604,0.00008537971,0.000120724464,0.0006105879,0.00010934863,0.8178581,0.0052645565,0.1606978,0.014031019,0.00004958308],"about_ca_topic_score_codex":0.0022113863,"about_ca_topic_score_gemma":0.0023337486,"teacher_disagreement_score":0.019538151,"about_ca_system_score_codex":0.0031208226,"about_ca_system_score_gemma":0.0020275742,"threshold_uncertainty_score":0.06536168},"labels":[],"label_agreement":null},{"id":"W2404422255","doi":"10.1007/s10479-017-2448-9","title":"Computational study of valid inequalities for the maximum k-cut problem","year":2017,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"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; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Clique; Mathematics; Vertex (graph theory); Combinatorics; Focus (optics); Graph; Set (abstract data type); Inequality; Relaxation (psychology); Semidefinite programming; Mathematical optimization; Discrete mathematics; Computer science; Algorithm; Mathematical analysis","score_opus":0.5021551982509271,"score_gpt":0.5168750330118258,"score_spread":0.014719834760898665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404422255","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.39284706,0.0026630221,0.5286546,0.011009249,0.00048775025,0.0006779192,0.0034571616,0.0007145819,0.059488665],"genre_scores_gemma":[0.7790786,0.00083872414,0.2060967,0.00079078093,0.0004151249,0.00038832112,0.0033778055,0.0003471844,0.008666799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996192,0.0019710243,0.0001806561,0.00047446016,0.00073329813,0.00044854527],"domain_scores_gemma":[0.87830603,0.11298332,0.0026248416,0.0026217583,0.0022059549,0.0012579849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005528856,0.0016139607,0.0017204791,0.0023220652,0.0018776854,0.006325492,0.0048802067,0.0021612728,0.020684203],"category_scores_gemma":[0.056117173,0.0011880419,0.0026885595,0.0033331825,0.0035013948,0.009332165,0.0032058554,0.0061002616,0.00079999055],"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.0019925646,0.0013658932,0.007468879,0.0013958182,0.00032475885,0.00043279046,0.00077914994,0.4694827,0.0021830243,0.40737337,0.019706678,0.08749442],"study_design_scores_gemma":[0.00013870515,0.00009205268,0.000604393,0.00006483754,0.000070125825,0.00009956069,0.00019433584,0.73692113,0.00073323713,0.2598524,0.0012030497,0.000026209105],"about_ca_topic_score_codex":0.0048720553,"about_ca_topic_score_gemma":0.007911202,"teacher_disagreement_score":0.020684203,"about_ca_system_score_codex":0.0032621315,"about_ca_system_score_gemma":0.003930849,"threshold_uncertainty_score":0.06919557},"labels":[],"label_agreement":null},{"id":"W2405004071","doi":"","title":"Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates.","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Natural Sciences and Engineering Research Council of Canada; Sino-Danish Center; University of Toronto; National Natural Science Foundation of China; National Research Foundation; Danmarks Grundforskningsfond; National Science Foundation","keywords":"Upper and lower bounds; Bounded function; Combinatorics; Mathematics; Binary logarithm; Integer (computer science); Function (biology); Discrete mathematics; Log-log plot; Hash function; Computer science; Mathematical analysis","score_opus":0.0442883628984545,"score_gpt":0.2428233523704291,"score_spread":0.1985349894719746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405004071","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.19784786,0.0049372725,0.74610204,0.0042350814,0.00040368596,0.00041453802,0.0010846762,0.0044513666,0.040523488],"genre_scores_gemma":[0.7157683,0.0029794562,0.2598556,0.0016460461,0.00031966972,0.0009357317,0.0019146082,0.0010596325,0.0155210225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957632,0.0007707494,0.00021117748,0.00062292785,0.0015295941,0.0011023737],"domain_scores_gemma":[0.9787023,0.015567243,0.0012048689,0.0029369157,0.0009788248,0.00060984504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025927608,0.0028290825,0.0014695136,0.0015078139,0.0014537957,0.002607563,0.004580886,0.0021342237,0.008880667],"category_scores_gemma":[0.022065073,0.0011174035,0.0017221203,0.0020969464,0.0029343741,0.013938235,0.004006111,0.004605491,0.0019503023],"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.0027047491,0.0006182367,0.0049759718,0.0014825312,0.00035649902,0.00045412872,0.0006129425,0.4493749,0.05361068,0.31090024,0.015007405,0.1599017],"study_design_scores_gemma":[0.00017394102,0.00031706408,0.00083039695,0.00014961956,0.00016458624,0.00017678537,0.00007165576,0.732497,0.031495467,0.22640866,0.007665374,0.000049464477],"about_ca_topic_score_codex":0.003141544,"about_ca_topic_score_gemma":0.006304863,"teacher_disagreement_score":0.008880667,"about_ca_system_score_codex":0.0040928833,"about_ca_system_score_gemma":0.0027267223,"threshold_uncertainty_score":0.029708803},"labels":[],"label_agreement":null},{"id":"W2405783155","doi":"","title":"Constructive Proofs of Concentration Bounds.","year":2010,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"","keywords":"Mathematics; Mathematical proof; Discrete mathematics; Product (mathematics); Constructive; Constructive proof; Simple (philosophy); Chernoff bound; Random variable; Direct proof; Upper and lower bounds; Direct product; Combinatorics; Computer science; Algorithm","score_opus":0.006978116070101357,"score_gpt":0.22560664071011108,"score_spread":0.21862852464000973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405783155","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.0035801786,0.0024934013,0.93137014,0.004636512,0.00082927826,0.00022700868,0.0009926936,0.00081644725,0.0550543],"genre_scores_gemma":[0.35123384,0.007303107,0.57766116,0.011019426,0.0052548456,0.0035777858,0.0035346786,0.0022039816,0.03821118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9846245,0.0043678693,0.0006853334,0.0022272563,0.006887198,0.0012077999],"domain_scores_gemma":[0.9264155,0.05170663,0.0034025644,0.008086977,0.008595264,0.0017931347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010765646,0.0041109016,0.002538025,0.00653885,0.0033690503,0.007536188,0.005849819,0.0033729926,0.036766496],"category_scores_gemma":[0.074831456,0.0023034262,0.005039311,0.0054648984,0.0074452674,0.014082973,0.01284782,0.012791301,0.0070037153],"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.00002805422,0.00006627613,0.0001995389,0.00024450375,0.000054097432,0.0001109967,0.00012377996,0.0039920937,0.0006414125,0.9741339,0.008581076,0.01182423],"study_design_scores_gemma":[0.000029490307,0.000020501833,0.000114533184,0.00007206989,0.00003485388,0.0001678178,0.000030081734,0.013762615,0.0009680646,0.97363573,0.01113356,0.000030604155],"about_ca_topic_score_codex":0.0014574954,"about_ca_topic_score_gemma":0.0014340737,"teacher_disagreement_score":0.036766496,"about_ca_system_score_codex":0.0060199513,"about_ca_system_score_gemma":0.0030072606,"threshold_uncertainty_score":0.12299621},"labels":[],"label_agreement":null},{"id":"W2406451447","doi":"10.1007/978-3-319-26626-8_47","title":"Approximating the Restricted 1-Center in Graphs","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Brock University","funders":"","keywords":"Combinatorics; Saddle point; Center (category theory); Approximation algorithm; Separable space; Vertex (graph theory); Binary logarithm; Mathematics; Matrix (chemical analysis); Scaling; Distance matrix; Shortest path problem; Discrete mathematics; Graph; Geometry; Mathematical analysis","score_opus":0.03875089561815854,"score_gpt":0.26109662159600944,"score_spread":0.2223457259778509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406451447","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.2798967,0.0023052285,0.6600149,0.0023042108,0.00037245787,0.00018496421,0.0011924388,0.004243554,0.04948549],"genre_scores_gemma":[0.6962687,0.0014294918,0.27823493,0.0007213681,0.00035670117,0.000211409,0.0019477498,0.0018250492,0.019004542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849033,0.00047593613,0.00004533545,0.00040244602,0.00031256562,0.0002733538],"domain_scores_gemma":[0.9947572,0.002897348,0.00040422933,0.0011660045,0.00037063478,0.00040468798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012750869,0.0020570867,0.0021769602,0.0017239888,0.0014255736,0.003031551,0.004387176,0.002328253,0.01095238],"category_scores_gemma":[0.009498141,0.0010638366,0.0012002953,0.0025115006,0.0024948486,0.0062773637,0.0042647053,0.003640775,0.0030202745],"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.0013456867,0.00042250776,0.0026605192,0.0009829485,0.00011494237,0.00021002509,0.0007363471,0.26178208,0.009785781,0.5246081,0.040917177,0.15643394],"study_design_scores_gemma":[0.000093053255,0.00008406148,0.00038939292,0.000070525755,0.00004868605,0.00015423336,0.00015789768,0.3257788,0.0032346647,0.6639787,0.0059832353,0.000026653139],"about_ca_topic_score_codex":0.003343323,"about_ca_topic_score_gemma":0.005007734,"teacher_disagreement_score":0.01095238,"about_ca_system_score_codex":0.002720702,"about_ca_system_score_gemma":0.0011176788,"threshold_uncertainty_score":0.036639392},"labels":[],"label_agreement":null},{"id":"W2407048800","doi":"10.1007/s10107-017-1111-1","title":"The bilinear assignment problem: complexity and polynomially solvable special cases","year":2017,"lang":"en","type":"preprint","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Time complexity; Rank (graph theory); Function (biology); Diagonal; Value (mathematics); Generalization; Polynomial; Discrete mathematics; Mathematical analysis","score_opus":0.0806663039339923,"score_gpt":0.307690644329012,"score_spread":0.2270243403950197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407048800","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.38758975,0.003977837,0.4865496,0.021786176,0.0007299687,0.00029402802,0.0029833692,0.00056088495,0.09552835],"genre_scores_gemma":[0.915717,0.0021486536,0.0591791,0.0010645014,0.0018934119,0.0003642524,0.0018526678,0.00030431207,0.017476087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953447,0.0013609036,0.00023091042,0.0010912394,0.0010323295,0.00093990006],"domain_scores_gemma":[0.97779727,0.016797302,0.001665107,0.0018951991,0.000958706,0.0008863783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030728488,0.0014470132,0.002539945,0.0016824212,0.0025748168,0.00982689,0.0034347188,0.003900534,0.010795969],"category_scores_gemma":[0.02088372,0.0011965083,0.00226542,0.0034561583,0.004321328,0.01609693,0.0040898793,0.009394911,0.00120628],"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.00034519084,0.00041651627,0.0011277198,0.0004289186,0.00007934348,0.00029263407,0.00043727297,0.023607517,0.0008881494,0.94166946,0.014443895,0.016263388],"study_design_scores_gemma":[0.000045649038,0.000011751446,0.00014462476,0.000013867257,0.000017457667,0.00010959619,0.000094101946,0.039507806,0.00031250124,0.9584035,0.001324351,0.000014784809],"about_ca_topic_score_codex":0.0019496963,"about_ca_topic_score_gemma":0.001770475,"teacher_disagreement_score":0.010795969,"about_ca_system_score_codex":0.0029993453,"about_ca_system_score_gemma":0.0025293687,"threshold_uncertainty_score":0.036116183},"labels":[],"label_agreement":null},{"id":"W2407347952","doi":"","title":"Compression of Boolean Functions.","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Memorial University of Newfoundland; Simon Fraser University","funders":"","keywords":"Boolean function; Boolean circuit; Circuit complexity; Implicant; Circuit minimization for Boolean functions; Discrete mathematics; Binary decision diagram; Mathematics; Monotone polygon; Branching (polymer chemistry); Quadratic equation; Combinatorics; Function (biology); Electronic circuit; Algorithm; Boolean expression","score_opus":0.012123087489789132,"score_gpt":0.2079682523820154,"score_spread":0.19584516489222628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407347952","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.21484134,0.0047411458,0.721305,0.004550606,0.00047109235,0.0005090557,0.0013690201,0.004406037,0.047806744],"genre_scores_gemma":[0.81045413,0.0018296357,0.17071895,0.0010349343,0.00050808577,0.00045548208,0.0025283296,0.00054631924,0.011924064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763525,0.0004682361,0.00012544655,0.00063062395,0.0008717999,0.00026854148],"domain_scores_gemma":[0.991487,0.0052916957,0.00042693553,0.002177013,0.00042491674,0.00019242169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015514866,0.00102008,0.001098244,0.0012709396,0.0009329222,0.002290345,0.0016059949,0.0014012634,0.009215969],"category_scores_gemma":[0.012094652,0.00051830645,0.0011824161,0.0017702094,0.0022292084,0.006898165,0.0023248307,0.002643332,0.0014085459],"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.0013676431,0.00032715677,0.003882888,0.0009730577,0.00016073661,0.00056783186,0.0005814562,0.107170224,0.031452328,0.4887547,0.010747322,0.35401472],"study_design_scores_gemma":[0.00010868611,0.000427968,0.0014052805,0.00012722287,0.00008794621,0.0010288394,0.00018126768,0.36852142,0.043424454,0.56213915,0.022499686,0.000048097158],"about_ca_topic_score_codex":0.00081901107,"about_ca_topic_score_gemma":0.00071220024,"teacher_disagreement_score":0.009215969,"about_ca_system_score_codex":0.0022753184,"about_ca_system_score_gemma":0.0009229023,"threshold_uncertainty_score":0.030830503},"labels":[],"label_agreement":null},{"id":"W2407565584","doi":"","title":"Computationally Limited Randomness.","year":2011,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Randomness; Bounded function; Turing machine; Discrete mathematics; Logarithm; Randomized algorithm; Computer science; Mathematics; Connection (principal bundle); Algorithm; Statistics; Mathematical analysis","score_opus":0.06157817614534837,"score_gpt":0.22530044104363878,"score_spread":0.1637222648982904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407565584","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.16482913,0.0028896406,0.6692206,0.01206872,0.0007787686,0.00025409335,0.0014106075,0.0018117372,0.1467367],"genre_scores_gemma":[0.9448353,0.00049827487,0.03799218,0.0010679255,0.00032400517,0.00033878823,0.0005508198,0.000285603,0.014107065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925684,0.0028003827,0.000436836,0.0015961487,0.0017752028,0.0008230763],"domain_scores_gemma":[0.9646958,0.02404966,0.0017977045,0.0073562064,0.0013110259,0.0007896533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004074069,0.00071415975,0.0011994421,0.001000108,0.0015871238,0.003539339,0.0021003284,0.0021126943,0.011017629],"category_scores_gemma":[0.027011897,0.0005635241,0.0014286926,0.0010045173,0.007773644,0.009173874,0.0052993684,0.0049554757,0.0015707375],"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.000099553195,0.000027619022,0.0003087303,0.00010849106,0.000017853314,0.00007453197,0.00010469755,0.011806574,0.0007272331,0.9805925,0.0016926732,0.0044394224],"study_design_scores_gemma":[0.000026347172,0.000026065933,0.00017290015,0.000036350913,0.000016641756,0.000111401096,0.000024889656,0.032398123,0.0015378029,0.96060425,0.0050289594,0.000016234915],"about_ca_topic_score_codex":0.00060194207,"about_ca_topic_score_gemma":0.00063233904,"teacher_disagreement_score":0.011017629,"about_ca_system_score_codex":0.0027988516,"about_ca_system_score_gemma":0.0015722204,"threshold_uncertainty_score":0.036857605},"labels":[],"label_agreement":null},{"id":"W2408365485","doi":"","title":"Extremely uniform branching programs.","year":2014,"lang":"en","type":"article","venue":"NCMA","topic":"Complexity and Algorithms in Graphs","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 Montréal","funders":"","keywords":"Branching (polymer chemistry); Property (philosophy); Mathematics; Tree (set theory); Combinatorics; Computer science; Discrete mathematics; Materials science","score_opus":0.023012436946297888,"score_gpt":0.22771924331205864,"score_spread":0.20470680636576075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408365485","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.060457278,0.00022310905,0.9272222,0.0007155569,0.000037424197,0.00008677189,0.00024652033,0.0006270456,0.010384087],"genre_scores_gemma":[0.70312494,0.0002371777,0.29031307,0.000451715,0.000116302625,0.00026637682,0.00045796137,0.00017186512,0.004860613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757665,0.0006535179,0.00017059369,0.00063916075,0.0007006071,0.00025951304],"domain_scores_gemma":[0.9916197,0.0049068322,0.00085487345,0.0015007111,0.0007393669,0.0003784944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018473943,0.0003544663,0.00038732655,0.0008716891,0.0007676921,0.0015432106,0.0016102568,0.0007538799,0.0025289683],"category_scores_gemma":[0.009486219,0.0003494263,0.0007586509,0.001105859,0.0025297261,0.005895935,0.002264336,0.002447011,0.00022942969],"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.000053343192,0.00003603472,0.0014372531,0.00007556937,0.000014347173,0.00007635531,0.00026648535,0.0079736905,0.0028026425,0.961642,0.0010111547,0.024611136],"study_design_scores_gemma":[0.000021649459,0.00006435607,0.0009526512,0.00002840407,0.000030906223,0.00031772532,0.00013048926,0.076500334,0.005712896,0.9049829,0.01123187,0.000025821391],"about_ca_topic_score_codex":0.0011236378,"about_ca_topic_score_gemma":0.001207157,"teacher_disagreement_score":0.0025289683,"about_ca_system_score_codex":0.0013483603,"about_ca_system_score_gemma":0.00077155564,"threshold_uncertainty_score":0.009783089},"labels":[],"label_agreement":null},{"id":"W2415039998","doi":"10.4230/lipics.swat.2016.3","title":"A Logarithmic Integrality Gap Bound for Directed Steiner Tree in Quasi-bipartite Graphs","year":2016,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Natural Sciences and Engineering Research Council of Canada; Hausdorff Center for Mathematics; University of Waterloo","keywords":"Steiner tree problem; Bipartite graph; Combinatorics; Logarithm; Mathematics; Tree (set theory); Constant (computer programming); Discrete mathematics; Linear programming relaxation; Cover (algebra); Set (abstract data type); Upper and lower bounds; Computer science; Algorithm; Graph; Linear programming","score_opus":0.042358375616166954,"score_gpt":0.2944877939420583,"score_spread":0.25212941832589136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415039998","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.16309504,0.005455359,0.74852556,0.008495262,0.00049333705,0.00014114071,0.0011001,0.0010722858,0.07162186],"genre_scores_gemma":[0.8360568,0.0039556283,0.14592597,0.0013858507,0.0005738601,0.0002577054,0.0010075583,0.0008104889,0.01002609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978404,0.00057209085,0.00006639528,0.0004216475,0.0006110956,0.0004883993],"domain_scores_gemma":[0.98623323,0.010947455,0.0006195428,0.0010826791,0.000434929,0.0006821694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028822827,0.0015985903,0.0015460256,0.0014833827,0.0011818875,0.004669739,0.0027803301,0.0017215112,0.010305897],"category_scores_gemma":[0.017313864,0.00073041563,0.0013261064,0.0024607927,0.002717561,0.009932451,0.00391148,0.008753966,0.001448185],"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.0009687118,0.0005323128,0.0025077397,0.0009759679,0.00012318385,0.00035854717,0.00059394294,0.24675351,0.012762128,0.6366108,0.018469302,0.079343796],"study_design_scores_gemma":[0.000041767387,0.0000843302,0.0006602972,0.00009643025,0.00006005058,0.00027574782,0.00011195156,0.46224043,0.0030325379,0.5274619,0.005909371,0.000025223175],"about_ca_topic_score_codex":0.00088352687,"about_ca_topic_score_gemma":0.001017205,"teacher_disagreement_score":0.010305897,"about_ca_system_score_codex":0.003858348,"about_ca_system_score_gemma":0.001213856,"threshold_uncertainty_score":0.034476697},"labels":[],"label_agreement":null},{"id":"W2418872760","doi":"10.1016/j.tcs.2016.04.044","title":"Approximating the restricted 1-center in graphs","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","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":"Brock University","funders":"","keywords":"Mathematics; Combinatorics; Saddle point; Approximation algorithm; Center (category theory); Separable space; Binary logarithm; Vertex (graph theory); Discrete mathematics; Matrix (chemical analysis); Distance matrix; Graph; Mathematical analysis; Geometry","score_opus":0.01411976057326362,"score_gpt":0.24352743115335584,"score_spread":0.22940767058009223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2418872760","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.5172235,0.0015981324,0.4462451,0.003067892,0.00019171179,0.00015938075,0.0011861658,0.0029052421,0.027422884],"genre_scores_gemma":[0.8436321,0.00067698414,0.1449451,0.00058902474,0.00018795962,0.00013290026,0.0012549639,0.0008852978,0.0076956106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809104,0.0006060385,0.000061480096,0.00051992823,0.00032417808,0.00039729092],"domain_scores_gemma":[0.9903232,0.005803543,0.0008799648,0.001663444,0.00063362933,0.00069621165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015875235,0.0016883251,0.0022247126,0.002095137,0.0017644865,0.0037764178,0.004173864,0.002660084,0.008777607],"category_scores_gemma":[0.013544708,0.0009947508,0.0011421551,0.0025398799,0.0028682442,0.007931477,0.004141177,0.0033616386,0.001779266],"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.0022399249,0.0006475649,0.006227577,0.0009798787,0.00014335102,0.0002793561,0.0012314415,0.3115381,0.011370081,0.53129655,0.02857249,0.105473764],"study_design_scores_gemma":[0.00012598027,0.00009017427,0.000592956,0.000055563927,0.000057527446,0.00015208835,0.00024002997,0.3988565,0.003825093,0.5926297,0.0033468888,0.000027499394],"about_ca_topic_score_codex":0.0045433976,"about_ca_topic_score_gemma":0.0066738417,"teacher_disagreement_score":0.008777607,"about_ca_system_score_codex":0.0031950076,"about_ca_system_score_gemma":0.0015198193,"threshold_uncertainty_score":0.02936405},"labels":[],"label_agreement":null},{"id":"W2460637059","doi":"10.1109/focs.2016.67","title":"Extension Complexity of Independent Set Polytopes","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"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; Ministry of Education - Singapore; National Research Foundation Singapore; Simons Foundation; National Science Foundation","keywords":"Polytope; Extension (predicate logic); Monotone polygon; Combinatorics; Omega; Mathematics; Exponential function; Connection (principal bundle); Set (abstract data type); Graph; Discrete mathematics; Independent set; Computer science; Geometry; Physics; Mathematical analysis","score_opus":0.09488871318137443,"score_gpt":0.30173015554689386,"score_spread":0.20684144236551943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460637059","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.48699254,0.0007607287,0.4397161,0.0031477609,0.0001325698,0.00020851166,0.0019368489,0.00070281804,0.06640222],"genre_scores_gemma":[0.8484247,0.00092031085,0.128274,0.00058416754,0.00020857839,0.0003286284,0.0023028273,0.00035688234,0.018599944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914694,0.00018851804,0.000034630633,0.00024014112,0.00022967174,0.00016013334],"domain_scores_gemma":[0.99726945,0.0016744304,0.00017940628,0.00049750507,0.00014997578,0.00022917523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076901296,0.0007995867,0.0007394112,0.0005606552,0.0007860969,0.002331282,0.0019742458,0.0009532651,0.010441587],"category_scores_gemma":[0.0039294083,0.0006158122,0.0017650847,0.0012985966,0.0015843163,0.005831291,0.0025907317,0.00487458,0.00084651],"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.00022129272,0.00017364728,0.0012350464,0.00038166568,0.00006867677,0.00029178077,0.00052414765,0.10623687,0.007084629,0.8381642,0.009469963,0.036148075],"study_design_scores_gemma":[0.000040444756,0.000051443356,0.00063597533,0.000039760154,0.000035464363,0.00022999753,0.000087953966,0.12887612,0.0025909317,0.8596357,0.007750305,0.00002599986],"about_ca_topic_score_codex":0.00076919544,"about_ca_topic_score_gemma":0.001297161,"teacher_disagreement_score":0.010441587,"about_ca_system_score_codex":0.0016328248,"about_ca_system_score_gemma":0.0005712669,"threshold_uncertainty_score":0.034930646},"labels":[],"label_agreement":null},{"id":"W2465968014","doi":"10.4230/lipics.ccc.2016.10","title":"Learning Algorithms from Natural Proofs","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":37,"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; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; Simons Foundation; National Science Foundation","keywords":"Mathematical proof; Algorithm; Mathematics; Constant (computer programming); Class (philosophy); Natural number; Discrete mathematics; Prime (order theory); Upper and lower bounds; Combinatorics; Concept class; Computer science; Artificial intelligence","score_opus":0.01391521125942484,"score_gpt":0.24175137597842083,"score_spread":0.22783616471899598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465968014","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.014164859,0.0011330676,0.9664042,0.0028932984,0.00016360292,0.00017826378,0.00043103014,0.0017769618,0.01285466],"genre_scores_gemma":[0.28822044,0.001704806,0.6938996,0.001980314,0.00070760126,0.0006852563,0.0019126635,0.00060533086,0.0102840755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944898,0.001953111,0.00036997092,0.0014294351,0.0014208291,0.000336765],"domain_scores_gemma":[0.9681359,0.025251603,0.00093416264,0.0039775507,0.001301156,0.00039973724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036789405,0.0008903968,0.0008388662,0.0017786117,0.001209997,0.003990665,0.0030535476,0.0014478099,0.01064613],"category_scores_gemma":[0.036318477,0.0008693753,0.0016861325,0.0020505085,0.0036378424,0.01371781,0.005384964,0.0047436664,0.001701112],"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.00016757965,0.000104252016,0.0006463905,0.00047341615,0.000050468978,0.00005992665,0.0003312162,0.02471915,0.0014444327,0.84134597,0.00898734,0.12166995],"study_design_scores_gemma":[0.00005347209,0.000026935757,0.000099950856,0.00004153563,0.000013303618,0.00006206854,0.000026220985,0.080347225,0.001169597,0.90999454,0.008152144,0.000013092943],"about_ca_topic_score_codex":0.0012758189,"about_ca_topic_score_gemma":0.0016834458,"teacher_disagreement_score":0.01064613,"about_ca_system_score_codex":0.003040008,"about_ca_system_score_gemma":0.0021674526,"threshold_uncertainty_score":0.035614848},"labels":[],"label_agreement":null},{"id":"W2471885719","doi":"10.1007/s00454-016-9852-9","title":"Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs","year":2017,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"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":"European Research Council","keywords":"Combinatorics; Polytope; Spanning tree; Mathematics; Vertex (graph theory); Genus; Bounded function; Minimum spanning tree; Graph; Minimum degree spanning tree; Discrete mathematics","score_opus":0.04279141595860556,"score_gpt":0.31238818516437084,"score_spread":0.26959676920576525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2471885719","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.10480003,0.0014834292,0.8149096,0.0030842784,0.0004956381,0.00024572862,0.0013773739,0.00025054842,0.07335343],"genre_scores_gemma":[0.6093932,0.0021932044,0.3149992,0.0014781563,0.0010369928,0.00084603584,0.003090496,0.0010355355,0.06592717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914026,0.00028220672,0.00003766023,0.00018898805,0.00022431482,0.0001265561],"domain_scores_gemma":[0.9976574,0.0014179278,0.00016414895,0.0002857247,0.00021994903,0.0002548455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013622579,0.001423685,0.0016218749,0.0008896891,0.00080510875,0.00345895,0.0032248267,0.002082963,0.02085149],"category_scores_gemma":[0.0054002753,0.00070770405,0.0019171917,0.0012768771,0.0015453956,0.006394889,0.0023937603,0.005862559,0.00114072],"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.00009483408,0.00015248093,0.00026509663,0.0002768448,0.00004534871,0.00014008672,0.0002593348,0.17957748,0.0014005702,0.78931856,0.011029483,0.017439708],"study_design_scores_gemma":[0.0000356628,0.0000399845,0.00019770199,0.000051058352,0.000025168605,0.00007245728,0.00013658438,0.44058815,0.0003204954,0.5509958,0.007519739,0.000017119864],"about_ca_topic_score_codex":0.0019627607,"about_ca_topic_score_gemma":0.0035613598,"teacher_disagreement_score":0.02085149,"about_ca_system_score_codex":0.0022458686,"about_ca_system_score_gemma":0.0009946352,"threshold_uncertainty_score":0.0697552},"labels":[],"label_agreement":null},{"id":"W247221977","doi":"10.1145/780591.780595","title":"Derandomizing polynomial identity tests means proving circuit lower bounds","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":42,"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":"Mathematics; Nondeterministic algorithm; Polynomial; Discrete mathematics; Corollary; Arithmetic circuit complexity; Combinatorics; Identity (music); Arithmetic; Arbitrary-precision arithmetic","score_opus":0.026337742097286513,"score_gpt":0.2543340318390336,"score_spread":0.22799628974174707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W247221977","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.15962304,0.0005415046,0.8049604,0.0050806087,0.00019225871,0.00030487168,0.00080592814,0.0024253095,0.026065994],"genre_scores_gemma":[0.882804,0.000561793,0.107191086,0.0015705556,0.0002696268,0.00054707186,0.0011820055,0.0006775415,0.0051963576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98952454,0.0029639874,0.0005274235,0.0026684653,0.0021507668,0.002164903],"domain_scores_gemma":[0.90613186,0.0739935,0.0026966254,0.013647321,0.00249239,0.0010383681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006343948,0.0012218999,0.0018113565,0.0011078517,0.0016050319,0.004663106,0.0042526317,0.0023359659,0.0069514047],"category_scores_gemma":[0.04040701,0.00075007626,0.0026273872,0.0011998981,0.0063332682,0.01061384,0.006002745,0.00818367,0.001202953],"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.0009006013,0.00043081385,0.007948678,0.0006044968,0.00017907105,0.00041079562,0.0005722011,0.18065663,0.024017686,0.71523756,0.006677735,0.062363718],"study_design_scores_gemma":[0.00010797094,0.00018945604,0.0009560766,0.00006267046,0.00012636319,0.00030585536,0.00013192654,0.41919497,0.051123157,0.52118516,0.00655233,0.00006411004],"about_ca_topic_score_codex":0.0024011815,"about_ca_topic_score_gemma":0.0020126817,"teacher_disagreement_score":0.0069514047,"about_ca_system_score_codex":0.0052867974,"about_ca_system_score_gemma":0.0038524347,"threshold_uncertainty_score":0.03835857},"labels":[],"label_agreement":null},{"id":"W2475557115","doi":"10.82308/53758","title":"Circuits, communication and polynomials","year":2008,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Constant (computer programming); Boolean function; Electronic circuit; Boolean circuit; Mathematics; Computation; Function (biology); Computer science; Topology (electrical circuits); Discrete mathematics; Algorithm; Combinatorics","score_opus":0.034886597454835216,"score_gpt":0.23182597817601888,"score_spread":0.19693938072118367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2475557115","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.1478307,0.015449886,0.64272875,0.03375669,0.0008630226,0.00008201079,0.0008508622,0.00082309044,0.15761507],"genre_scores_gemma":[0.9285852,0.006542646,0.040486664,0.002307108,0.0011335158,0.00019590509,0.00037570627,0.00018634369,0.020186992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979328,0.00046907936,0.00006635313,0.0005256045,0.00056026824,0.0004458264],"domain_scores_gemma":[0.98586106,0.011219462,0.0007087234,0.0013787907,0.0005009189,0.00033112144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024059159,0.0007885604,0.00093313726,0.0013862288,0.00192433,0.0046376265,0.0014077111,0.001898939,0.013545687],"category_scores_gemma":[0.01056051,0.00048578123,0.0009153189,0.0019070448,0.005328593,0.013224926,0.0031300916,0.0061259014,0.0016434353],"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.000035857298,0.000012499579,0.00014393301,0.00004558689,0.000006960063,0.000019879213,0.0000612407,0.0032703644,0.0003269014,0.9899877,0.0011189345,0.0049701408],"study_design_scores_gemma":[0.000014058372,0.000028202425,0.0002388958,0.00003348693,0.00001440116,0.000053243384,0.00005263166,0.012760748,0.0007081861,0.97863585,0.0074484413,0.00001196764],"about_ca_topic_score_codex":0.0025116021,"about_ca_topic_score_gemma":0.002013977,"teacher_disagreement_score":0.013545687,"about_ca_system_score_codex":0.004364843,"about_ca_system_score_gemma":0.0016394875,"threshold_uncertainty_score":0.04531485},"labels":[],"label_agreement":null},{"id":"W2481918881","doi":"10.1137/1.9781611975031.138","title":"Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism","year":2018,"lang":"en","type":"preprint","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","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; Azrieli Foundation; University of Waterloo; Tel Aviv University; National Science Foundation","keywords":"Function (biology); Mathematics; Combinatorics; Submodular set function; Cardinality (data modeling); Time complexity; Oracle; Connection (principal bundle); Boolean function; Property testing; Isomorphism (crystallography); Discrete mathematics; Polynomial; Algorithm; Computer science","score_opus":0.07651544265797267,"score_gpt":0.24444203548777227,"score_spread":0.1679265928297996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481918881","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.12704282,0.00059284625,0.86308956,0.0017230144,0.00007608635,0.00017886271,0.00026653084,0.0016615364,0.0053688046],"genre_scores_gemma":[0.78367245,0.00031300617,0.21200912,0.0004999545,0.00013485357,0.0002192345,0.0005543431,0.00024813353,0.0023488433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957663,0.0015674238,0.0002320595,0.0009692642,0.00084064656,0.00062435603],"domain_scores_gemma":[0.98784655,0.008138995,0.0009197876,0.0023056592,0.00041010315,0.00037886118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030480088,0.0010483639,0.0019236414,0.00088178675,0.0008557416,0.0021725511,0.002561191,0.0016819255,0.0032220306],"category_scores_gemma":[0.016277933,0.0005325038,0.0017462888,0.001934866,0.002718449,0.006318519,0.0030444032,0.003651933,0.00040888536],"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.0011510586,0.0006307178,0.004399517,0.0005066727,0.00018981386,0.0004401323,0.00072441576,0.51682997,0.010780234,0.254593,0.0056644073,0.20409],"study_design_scores_gemma":[0.000058535417,0.00019638262,0.0005402138,0.00002186537,0.000028111213,0.00021251041,0.00013038784,0.75905514,0.0040220274,0.23423736,0.0014651695,0.000032263924],"about_ca_topic_score_codex":0.0017906663,"about_ca_topic_score_gemma":0.001477706,"teacher_disagreement_score":0.0032220306,"about_ca_system_score_codex":0.002088338,"about_ca_system_score_gemma":0.0014233922,"threshold_uncertainty_score":0.0161196},"labels":[],"label_agreement":null},{"id":"W2490234125","doi":"10.1017/cbo9781139034357.007","title":"Continuous rainbow network flow: rainbow network flow with unbounded delay","year":2011,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Complexity and Algorithms in Graphs","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; University of Regina","funders":"","keywords":"Rainbow; Computer science; Bounded function; Code (set theory); Flow (mathematics); Routing (electronic design automation); Topology (electrical circuits); Distributed computing; Algorithm; Mathematics; Computer network; Combinatorics; Physics; Programming language; Geometry","score_opus":0.021603645766595944,"score_gpt":0.17869508611007207,"score_spread":0.1570914403434761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490234125","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.013051456,0.0020118416,0.91704905,0.0010688326,0.000381868,0.00013677221,0.0003532598,0.00036667858,0.06558033],"genre_scores_gemma":[0.31502792,0.0060485746,0.5602544,0.0007939635,0.0006860338,0.00048195093,0.0007441523,0.00047791153,0.11548512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969923,0.00007386617,0.0000129327545,0.00007427468,0.00008999184,0.000049695747],"domain_scores_gemma":[0.9995933,0.00019514872,0.00003617615,0.00006881651,0.00007006231,0.0000364498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007796851,0.0005584874,0.000388028,0.00056543306,0.00076460413,0.0014134774,0.0009232237,0.0008542996,0.009943992],"category_scores_gemma":[0.001850811,0.0003276808,0.00052363216,0.0011715356,0.0011653362,0.0038357016,0.0011982557,0.0015563315,0.0010552618],"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.000053826094,0.000018523377,0.00008863478,0.000096740994,0.0000058824326,0.00005826819,0.000083398736,0.028309366,0.0012856394,0.91352135,0.008657653,0.047820784],"study_design_scores_gemma":[0.000016041839,0.000027255626,0.00014511215,0.00006315945,0.00001001015,0.00012797922,0.000051917345,0.14046593,0.0015225386,0.800414,0.057134785,0.00002122648],"about_ca_topic_score_codex":0.0017101226,"about_ca_topic_score_gemma":0.0014947498,"teacher_disagreement_score":0.009943992,"about_ca_system_score_codex":0.0017365045,"about_ca_system_score_gemma":0.0008856736,"threshold_uncertainty_score":0.03326595},"labels":[],"label_agreement":null},{"id":"W2503948570","doi":"","title":"Oblivious and non-oblivious local search for combinatorial optimization","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Submodular set function; Local search (optimization); Matroid; Greedy algorithm; Mathematical optimization; Mathematics; Approximation algorithm; Combinatorial optimization; Monotone polygon; Optimization problem; Function (biology); Maximization; Algorithm; Discrete mathematics","score_opus":0.016418888897952205,"score_gpt":0.2714500496178985,"score_spread":0.25503116071994625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503948570","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.009579137,0.0008009143,0.9834796,0.00038309515,0.000028758506,0.00008798089,0.00004311921,0.0005100071,0.005087325],"genre_scores_gemma":[0.39555314,0.0016478602,0.5937824,0.00041775632,0.000115764145,0.00084148813,0.00028224595,0.00039722497,0.006962128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979997,0.0010297174,0.00007004922,0.00031853915,0.00042277772,0.00015907339],"domain_scores_gemma":[0.9962369,0.002811733,0.00025479298,0.0004930838,0.00013074881,0.000072785995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001972286,0.0011806199,0.0012533952,0.0007462743,0.0006257712,0.001718833,0.0018519344,0.0012018392,0.0034543476],"category_scores_gemma":[0.0084669,0.00071501196,0.0012929677,0.0015783763,0.002008882,0.0032779004,0.002013931,0.0030814954,0.00088569307],"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.0001093807,0.00012661825,0.00033408054,0.00022652993,0.0000664151,0.00003782007,0.000104567174,0.805049,0.0014033575,0.13273564,0.0033448094,0.0564619],"study_design_scores_gemma":[0.000028079921,0.00004408989,0.000057916444,0.000013242631,0.000011611613,0.000015470012,0.000014430751,0.9329062,0.0006347507,0.06495283,0.0013140986,0.000007193929],"about_ca_topic_score_codex":0.0027172898,"about_ca_topic_score_gemma":0.0034411896,"teacher_disagreement_score":0.0034543476,"about_ca_system_score_codex":0.0026281967,"about_ca_system_score_gemma":0.0019636333,"threshold_uncertainty_score":0.019068956},"labels":[],"label_agreement":null},{"id":"W2505689930","doi":"10.1145/2930889.2930894","title":"Selecting Algorithms for Black Box Matrices","year":2016,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Computation; Black box; Algorithm; Matrix (chemical analysis); Computer science; Field (mathematics); Selection (genetic algorithm); Sparse matrix; Mathematics; Artificial intelligence","score_opus":0.03722886852904583,"score_gpt":0.281986505082967,"score_spread":0.2447576365539212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505689930","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.010660373,0.00015529939,0.9794556,0.00021349228,0.000115952156,0.00022235748,0.000106758,0.0035002748,0.005569994],"genre_scores_gemma":[0.1125329,0.00022309739,0.8780808,0.00027088114,0.0001287598,0.0005040537,0.0004961271,0.0020480289,0.005715303],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952376,0.0015429561,0.00033405307,0.00088949275,0.0014360156,0.00055982237],"domain_scores_gemma":[0.98415655,0.008107263,0.0010796145,0.0035311063,0.002603991,0.0005213978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051995474,0.0015394841,0.0014859255,0.0018354581,0.0016149806,0.003142972,0.0016222007,0.001644978,0.021920398],"category_scores_gemma":[0.024253495,0.00094263296,0.0010909707,0.0012687305,0.0013969636,0.0042729895,0.003077916,0.0026419407,0.008340005],"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.0015971842,0.0003986205,0.002372701,0.0007920167,0.00009884005,0.00051664835,0.00047339703,0.07393621,0.0637815,0.31395367,0.028122779,0.5139564],"study_design_scores_gemma":[0.00031289872,0.0002592483,0.00048726023,0.00021611528,0.000049185586,0.00029411804,0.00017426326,0.51137614,0.069214545,0.38298905,0.034543093,0.00008417226],"about_ca_topic_score_codex":0.000508854,"about_ca_topic_score_gemma":0.0008150222,"teacher_disagreement_score":0.021920398,"about_ca_system_score_codex":0.001060209,"about_ca_system_score_gemma":0.002425342,"threshold_uncertainty_score":0.07333106},"labels":[],"label_agreement":null},{"id":"W2507428467","doi":"10.1109/focs.2016.57","title":"Polynomial Representations of Threshold Functions and Algorithmic Applications","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"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; National Science Foundation","keywords":"Randomized algorithm; Combinatorics; Mathematics; Degree (music); Polynomial; Discrete mathematics; Binary logarithm; Time complexity; Randomness; Hamming distance; Satisfiability; Algorithm; Physics","score_opus":0.025742850740563785,"score_gpt":0.2793138466925053,"score_spread":0.25357099595194155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507428467","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.025810106,0.00078740966,0.95681745,0.0010826888,0.00012120129,0.000053338255,0.00013272202,0.00081217114,0.014382849],"genre_scores_gemma":[0.7024781,0.001927841,0.27835283,0.00057224755,0.00049799704,0.00028293452,0.00042974047,0.00030574578,0.015152589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981875,0.0004370814,0.00011071097,0.00040200984,0.00057409017,0.00028859059],"domain_scores_gemma":[0.9963097,0.002172381,0.0002871472,0.0006221192,0.0004347638,0.00017381465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015145484,0.00085242494,0.0006532746,0.0013524366,0.0008327104,0.002405131,0.0013346749,0.0010981393,0.005961456],"category_scores_gemma":[0.010058283,0.0004239553,0.0010601307,0.0018931708,0.0021605026,0.0048410594,0.0020802824,0.0034584075,0.0016306287],"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.00005857079,0.00003634451,0.00021891722,0.00010435509,0.000008697646,0.000031275875,0.0001684473,0.03457236,0.0018612427,0.92185587,0.0022295285,0.038854267],"study_design_scores_gemma":[0.000027921324,0.00007268118,0.0001434735,0.000039762126,0.0000124299095,0.00009665428,0.000059000802,0.21944353,0.0025158147,0.7673436,0.01021875,0.000026278354],"about_ca_topic_score_codex":0.0015442477,"about_ca_topic_score_gemma":0.00094664,"teacher_disagreement_score":0.005961456,"about_ca_system_score_codex":0.002767159,"about_ca_system_score_gemma":0.0011190226,"threshold_uncertainty_score":0.020077229},"labels":[],"label_agreement":null},{"id":"W2507811569","doi":"10.1016/j.disopt.2018.08.003","title":"Additive stabilizers for unstable graphs","year":2018,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","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":"Combinatorics; Mathematics; Independent set; Vertex (graph theory); Matching (statistics); Approximation algorithm; Chordal graph; Vertex cover; Maximal independent set; Edge cover; Discrete mathematics; Graph; 1-planar graph","score_opus":0.023612876139482653,"score_gpt":0.27394445528749767,"score_spread":0.250331579148015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507811569","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.3835131,0.0009862586,0.56834,0.0029749232,0.00026669342,0.00008283891,0.00052795425,0.0005173207,0.0427909],"genre_scores_gemma":[0.9520741,0.0005168863,0.023454081,0.00031728018,0.00037240592,0.00014160246,0.0004148417,0.00018147695,0.022527413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999243,0.00024716218,0.000028691897,0.00017511335,0.00020401803,0.00010199826],"domain_scores_gemma":[0.99674326,0.0018952986,0.00039067483,0.00027858806,0.00029149567,0.0004007464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084389985,0.0010721596,0.00088734017,0.0016330548,0.0011748184,0.0034932154,0.0010876568,0.0011318398,0.008028037],"category_scores_gemma":[0.006095933,0.00035860017,0.0006784348,0.0009877039,0.0019473425,0.0032172105,0.002051217,0.0025911678,0.0007254588],"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.00005366087,0.000029258583,0.0003975956,0.00004708423,0.000017204466,0.000045249384,0.00012534404,0.01900255,0.0010330834,0.970446,0.0023267744,0.0064761853],"study_design_scores_gemma":[0.000012288153,0.000013012959,0.00015328078,0.000007616032,0.00000894105,0.000015292359,0.000042405634,0.07410585,0.00047785908,0.9242567,0.000898535,0.000008214289],"about_ca_topic_score_codex":0.0012410169,"about_ca_topic_score_gemma":0.0017260144,"teacher_disagreement_score":0.008028037,"about_ca_system_score_codex":0.0014708457,"about_ca_system_score_gemma":0.00072813744,"threshold_uncertainty_score":0.026856422},"labels":[],"label_agreement":null},{"id":"W2509691293","doi":"10.1016/j.disopt.2017.10.001","title":"Elementary polytopes with high lift-and-project ranks for strong positive semidefinite operators","year":2017,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Hypercube; Polytope; Mathematics; Semidefinite programming; Combinatorics; Vertex (graph theory); Lift (data mining); Operator (biology); Regular polygon; Polyhedron; Discrete mathematics; Computer science; Mathematical optimization","score_opus":0.02309696272240792,"score_gpt":0.2800881309899574,"score_spread":0.2569911682675495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509691293","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.2614407,0.00048127872,0.674408,0.0015303324,0.0002963622,0.00015057901,0.0008707372,0.00065650104,0.06016554],"genre_scores_gemma":[0.8811969,0.0005608783,0.0818416,0.0005547098,0.00044008397,0.000316522,0.0011645532,0.0006407014,0.033284068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865484,0.0003289194,0.000056704117,0.0002837516,0.00042430215,0.0002515099],"domain_scores_gemma":[0.9955219,0.0024208233,0.00042415137,0.00048050476,0.00038017673,0.00077255303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012753772,0.0014138597,0.0014557469,0.001527968,0.0013760836,0.004610181,0.0016006503,0.0016070267,0.02017899],"category_scores_gemma":[0.0066912407,0.00096401194,0.0014742104,0.0010646761,0.0031111594,0.0059670336,0.0031746423,0.0054139565,0.0020362786],"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.00006427096,0.00007378961,0.00025378988,0.00008160915,0.000013858022,0.00008025079,0.0000968363,0.009082842,0.0011177122,0.98059213,0.0032516364,0.005291264],"study_design_scores_gemma":[0.000017394956,0.000023545115,0.0001522335,0.0000129767095,0.000006367572,0.000049629994,0.000041942894,0.03856443,0.0005153141,0.9595261,0.0010765682,0.000013514325],"about_ca_topic_score_codex":0.00041204641,"about_ca_topic_score_gemma":0.000873895,"teacher_disagreement_score":0.02017899,"about_ca_system_score_codex":0.00095777196,"about_ca_system_score_gemma":0.0008369819,"threshold_uncertainty_score":0.06750548},"labels":[],"label_agreement":null},{"id":"W2537901922","doi":"","title":"Better balance by being biased: A 0.8776-approximation for max bisection","year":2013,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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; University of Toronto","funders":"","keywords":"Bisection; Bisection method; Approximation algorithm; Conjecture; Mathematics; Combinatorics; Constraint (computer-aided design); Discrete mathematics; Algorithm; Geometry","score_opus":0.013430548456824001,"score_gpt":0.22544494687534308,"score_spread":0.21201439841851907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2537901922","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.17202698,0.0033886782,0.73701257,0.0077029397,0.00068939186,0.0007627176,0.00364801,0.02096027,0.053808462],"genre_scores_gemma":[0.4040774,0.00081917125,0.55940336,0.0031319796,0.00028522068,0.0006749423,0.005641387,0.004064503,0.021902045],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956247,0.0010787065,0.00022262693,0.0011488418,0.0010455645,0.0008796194],"domain_scores_gemma":[0.99263906,0.003087517,0.00047168895,0.0027805376,0.0005722351,0.00044893238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028075075,0.003652247,0.0026713782,0.0019465226,0.0020860943,0.0043470375,0.004789602,0.003973723,0.029460758],"category_scores_gemma":[0.015732946,0.0016103075,0.0029669378,0.004057449,0.0017744792,0.011559457,0.0052001984,0.00571978,0.012891369],"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.005986388,0.0018501993,0.009975279,0.0012643938,0.0004232229,0.0005808091,0.0012836548,0.18527022,0.027395803,0.11499612,0.10975821,0.5412157],"study_design_scores_gemma":[0.00059525546,0.00032468513,0.0014394025,0.00018244285,0.00020059949,0.0005387461,0.00037923822,0.6431609,0.015034496,0.31312656,0.024916489,0.00010125598],"about_ca_topic_score_codex":0.005120658,"about_ca_topic_score_gemma":0.007567426,"teacher_disagreement_score":0.029460758,"about_ca_system_score_codex":0.00405177,"about_ca_system_score_gemma":0.0035147036,"threshold_uncertainty_score":0.09855604},"labels":[],"label_agreement":null},{"id":"W2549040639","doi":"10.7939/r3bk17130","title":"Approximation Algorithms for Clustering Problems","year":2012,"lang":"en","type":"article","venue":"University of Alberta Library","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"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":"Alberta Innovates; University of Alberta","keywords":"Approximation algorithm; Polynomial-time approximation scheme; Facility location problem; Cluster analysis; Combinatorics; Set (abstract data type); Euclidean geometry; Singleton; Time complexity; Mathematics; Euclidean distance; Constant (computer programming); Metric (unit); Cluster (spacecraft); Integer (computer science); Polynomial; Point (geometry); Mathematical optimization; Computer science; Statistics","score_opus":0.025323564580437344,"score_gpt":0.20376394250500218,"score_spread":0.17844037792456485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549040639","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.0073160944,0.0033209128,0.9703049,0.0020002348,0.00035739134,0.00030526562,0.0007285601,0.0014585578,0.014208042],"genre_scores_gemma":[0.13718115,0.005056421,0.8401342,0.0010440861,0.00068640336,0.00097460917,0.0038259267,0.0007869094,0.010310353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99552804,0.0015178127,0.00035359227,0.0010237197,0.00095658895,0.0006204131],"domain_scores_gemma":[0.9915632,0.0057774596,0.00048226787,0.001131123,0.0007961019,0.00024976485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041425987,0.003607125,0.0034340774,0.0026890005,0.0025144396,0.004991116,0.005505628,0.004113647,0.010752516],"category_scores_gemma":[0.019782504,0.0015708378,0.0031607088,0.0064156647,0.0018097508,0.007121648,0.0036682733,0.0063006976,0.0037695048],"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.00030274256,0.00029819921,0.0010124869,0.000982276,0.00025497915,0.000103327344,0.00041339808,0.5917655,0.00074668985,0.20572746,0.034828853,0.16356406],"study_design_scores_gemma":[0.00008947248,0.000050590388,0.00015963722,0.00009934216,0.000042477564,0.00011877223,0.00013130785,0.76298,0.00038406803,0.2245127,0.0114077795,0.000023917706],"about_ca_topic_score_codex":0.005466422,"about_ca_topic_score_gemma":0.006149065,"teacher_disagreement_score":0.010752516,"about_ca_system_score_codex":0.005926326,"about_ca_system_score_gemma":0.0028828583,"threshold_uncertainty_score":0.04299873},"labels":[],"label_agreement":null},{"id":"W2555363315","doi":"10.4153/cmb-2018-005-9","title":"Connectivity in Hypergraphs","year":2018,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Hypergraph; Vertex (graph theory); Bounded function; Vertex connectivity; Vertex cover; Polynomial","score_opus":0.014844905029684627,"score_gpt":0.2255064902211542,"score_spread":0.21066158519146957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555363315","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.31071478,0.004687165,0.60248023,0.0064209015,0.00026529815,0.00025517002,0.0016529072,0.0006006801,0.07292284],"genre_scores_gemma":[0.8573526,0.002433232,0.12818258,0.0007190864,0.0004068447,0.00028221987,0.001309347,0.00015599267,0.009158019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981768,0.00052156765,0.00011448889,0.000582434,0.00042513487,0.00017953322],"domain_scores_gemma":[0.99134153,0.0056085787,0.0009821826,0.00071712816,0.0007984776,0.0005520754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009384204,0.0005378669,0.000521689,0.0022164392,0.0012940876,0.0031115662,0.0011686427,0.0012155257,0.008263126],"category_scores_gemma":[0.0068971333,0.00050831126,0.0006629081,0.0029555976,0.0029532982,0.00735733,0.0025321047,0.0024916525,0.00055879354],"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.00013828698,0.000047103476,0.0032150866,0.00043445083,0.00005738649,0.000511173,0.0005941054,0.029656867,0.00568487,0.9251043,0.004053667,0.03050275],"study_design_scores_gemma":[0.000022782093,0.00004403172,0.0016278741,0.00009467469,0.000037041424,0.00063379353,0.00033331924,0.053935178,0.0023236836,0.92510766,0.015817635,0.00002239969],"about_ca_topic_score_codex":0.0019477681,"about_ca_topic_score_gemma":0.0018667547,"teacher_disagreement_score":0.008263126,"about_ca_system_score_codex":0.001442908,"about_ca_system_score_gemma":0.0006011976,"threshold_uncertainty_score":0.027642965},"labels":[],"label_agreement":null},{"id":"W2556555060","doi":"10.4086/toc.2018.v014a006","title":"","year":2018,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","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":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Communication complexity; Mathematics; Combinatorics; Omega; Order (exchange); Function (biology); Discrete mathematics; Upper and lower bounds; Physics","score_opus":0.025175251675771865,"score_gpt":0.26485716712213536,"score_spread":0.2396819154463635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556555060","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.051937,0.0011190813,0.79446733,0.011091365,0.0015179672,0.00021876986,0.0008383755,0.00031873214,0.13849138],"genre_scores_gemma":[0.88038236,0.0017089023,0.07534329,0.0017945012,0.0008482632,0.00025583018,0.0003411084,0.00013138965,0.03919436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969657,0.00094126514,0.0001091108,0.0006967598,0.00065304857,0.00063404714],"domain_scores_gemma":[0.99399346,0.0022123493,0.00055385294,0.0022843536,0.00059599284,0.00036002076],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018713234,0.000982641,0.0011609044,0.00069441134,0.0024198995,0.004694895,0.0037117184,0.004124366,0.014299567],"category_scores_gemma":[0.011622494,0.00035920544,0.0011928736,0.0011837825,0.0028903752,0.008333949,0.0033918316,0.0041927802,0.003793632],"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.000045457098,0.000041010786,0.00018644822,0.000058334565,0.000017595425,0.00014186342,0.000053048876,0.01090088,0.00042771362,0.9812229,0.0034047517,0.0034998537],"study_design_scores_gemma":[0.000026413965,0.000031326526,0.00009440532,0.0000207744,0.00002128862,0.00017253959,0.00006879736,0.070148855,0.0006779742,0.92065716,0.008055325,0.000025117399],"about_ca_topic_score_codex":0.0016267046,"about_ca_topic_score_gemma":0.0012380559,"teacher_disagreement_score":0.9857004,"about_ca_system_score_codex":0.001234127,"about_ca_system_score_gemma":0.0015017563,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2557625822","doi":"","title":"Generalizing contexts amenable to greedy and greedy-like algorithms","year":2013,"lang":"en","type":"dissertation","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Greedy algorithm; Generality; Greedy randomized adaptive search procedure; Computer science; Simple (philosophy); Set (abstract data type); Theoretical computer science; Algorithm; Approximation algorithm; Mathematical optimization; Mathematics","score_opus":0.01941707849487074,"score_gpt":0.26319220359512885,"score_spread":0.24377512510025812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557625822","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.16900171,0.006119958,0.70449066,0.0065074987,0.00025747032,0.00021891543,0.000623384,0.00095792743,0.11182249],"genre_scores_gemma":[0.87310994,0.0038192377,0.111967675,0.0012504872,0.000654084,0.00027239873,0.00064870925,0.00031068054,0.007966816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957235,0.0014635172,0.00023150221,0.0011812272,0.0008772825,0.00052294164],"domain_scores_gemma":[0.989551,0.0068853353,0.00062585925,0.0017264682,0.0006201236,0.0005911696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024091469,0.0010806719,0.0011466991,0.0021494625,0.0022071092,0.0052407477,0.0016453891,0.002034206,0.0058043944],"category_scores_gemma":[0.016208498,0.00078010274,0.0018969409,0.0023313486,0.0050925026,0.009963617,0.005980588,0.0041854247,0.00090517045],"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.000036683505,0.000022267011,0.0004856295,0.00007535621,0.000013505059,0.000096341435,0.00030976144,0.00672094,0.00039153927,0.9865567,0.0011176601,0.0041736597],"study_design_scores_gemma":[0.000013818462,0.000011947734,0.00017842413,0.000022448881,0.000011179056,0.00010315973,0.0001099279,0.01754746,0.0001880574,0.9771926,0.004612315,0.000008557745],"about_ca_topic_score_codex":0.0015849422,"about_ca_topic_score_gemma":0.001473684,"teacher_disagreement_score":0.0058043944,"about_ca_system_score_codex":0.0023997414,"about_ca_system_score_gemma":0.001092817,"threshold_uncertainty_score":0.019417644},"labels":[],"label_agreement":null},{"id":"W256395497","doi":"10.1007/s00037-007-0231-z","title":"New Results on the Complexity of the Middle Bit of Multiplication","year":2005,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","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":"Combinatorics; Omega; Integer (computer science); Mathematics; Binary logarithm; Multiplication (music); Upper and lower bounds; Space (punctuation); Discrete mathematics; Arithmetic; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.16132877308405602,"score_gpt":0.2907668538330652,"score_spread":0.1294380807490092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W256395497","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.25693008,0.006689666,0.5735205,0.013751395,0.0010987831,0.00035413043,0.0021117306,0.0036918556,0.14185193],"genre_scores_gemma":[0.8110024,0.0027061987,0.15828137,0.0023928697,0.0016633015,0.00059296546,0.0014849897,0.0010217032,0.020854283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99463826,0.00084352394,0.00025834696,0.0014267745,0.0019465795,0.00088648],"domain_scores_gemma":[0.98107773,0.013315851,0.0012996529,0.0028202888,0.00081519707,0.0006713091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019043384,0.0013925484,0.0015781253,0.0019272995,0.0017611395,0.0048259255,0.002585391,0.0016621486,0.01360808],"category_scores_gemma":[0.016911749,0.001011207,0.0022455426,0.0021291887,0.0040719085,0.010901027,0.0041403193,0.007212126,0.0017232824],"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.0016755837,0.00066369976,0.003904675,0.0007903446,0.00013941209,0.00047420655,0.0006324506,0.08156208,0.021562219,0.7732667,0.022396656,0.092932],"study_design_scores_gemma":[0.00012621735,0.00017695983,0.0012088616,0.00009369038,0.00006504056,0.00025560515,0.00009236179,0.3337108,0.008110714,0.64717346,0.008908884,0.00007742718],"about_ca_topic_score_codex":0.002446513,"about_ca_topic_score_gemma":0.0023625866,"teacher_disagreement_score":0.01360808,"about_ca_system_score_codex":0.0037627371,"about_ca_system_score_gemma":0.0032286518,"threshold_uncertainty_score":0.045523524},"labels":[],"label_agreement":null},{"id":"W2563982062","doi":"10.1017/s0963548320000048","title":"Estimating parameters associated with monotone properties","year":2020,"lang":"en","type":"article","venue":"Combinatorics Probability Computing","topic":"Complexity and Algorithms in Graphs","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":"Mathematics; Combinatorics; Monotone polygon; Bounded function; Discrete mathematics; Vertex (graph theory); Graph; Graph property; Substructure; Property testing; Line graph; Voltage graph","score_opus":0.06467749679422376,"score_gpt":0.22994760726316446,"score_spread":0.1652701104689407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563982062","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.49679637,0.0002517666,0.49853623,0.001247457,0.00001898243,0.00014453368,0.0008386444,0.00085591903,0.0013100813],"genre_scores_gemma":[0.912811,0.00013326385,0.08468222,0.00015491419,0.000063660926,0.00013245648,0.0013660821,0.00016281646,0.0004935966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939355,0.002302283,0.00034946573,0.0017576457,0.0011858803,0.00046921553],"domain_scores_gemma":[0.83310986,0.1395181,0.0085051255,0.014490004,0.0030640534,0.0013129519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006656358,0.00083644217,0.0018630887,0.0018728516,0.00076860085,0.0024738547,0.0033279401,0.0024721422,0.001888316],"category_scores_gemma":[0.08317092,0.00093763793,0.0013270614,0.0015556078,0.003554339,0.007086302,0.0027186999,0.0036787973,0.00025273144],"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.0008631065,0.0002747366,0.038574357,0.00035456952,0.00034438004,0.00038148017,0.0004205677,0.83005106,0.016357014,0.07386604,0.0017025165,0.036810234],"study_design_scores_gemma":[0.000021615588,0.000055992135,0.0022426103,0.000014201721,0.000020391235,0.00008569235,0.00004824297,0.9132847,0.00399694,0.079968214,0.00024207075,0.000019324565],"about_ca_topic_score_codex":0.0032558832,"about_ca_topic_score_gemma":0.0022600591,"teacher_disagreement_score":0.006656358,"about_ca_system_score_codex":0.0029033083,"about_ca_system_score_gemma":0.0011270778,"threshold_uncertainty_score":0.035202622},"labels":[],"label_agreement":null},{"id":"W2564145587","doi":"10.1287/opre.2016.1549","title":"0/1 Polytopes with Quadratic Chvátal Rank","year":2016,"lang":"en","type":"article","venue":"Operations Research","topic":"Complexity and Algorithms in Graphs","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":"National Science Foundation","keywords":"Polytope; Rank (graph theory); Combinatorics; Closure (psychology); Mathematics; Quadratic equation; Mathematical optimization; Geometry; Economics","score_opus":0.08095007451776011,"score_gpt":0.3601140009281967,"score_spread":0.2791639264104366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564145587","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.4729641,0.0009985423,0.4778255,0.0012167436,0.00011248528,0.0002642473,0.0019288263,0.00070089014,0.043988746],"genre_scores_gemma":[0.7427567,0.0007225521,0.23389669,0.00030610073,0.00013289685,0.00030467976,0.002004391,0.0002802471,0.019595707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987575,0.0002056102,0.000084667445,0.00027905096,0.00037510466,0.00029806298],"domain_scores_gemma":[0.9959694,0.002541712,0.0005270124,0.00051796215,0.00022201333,0.00022184952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009180785,0.00080977246,0.00079571776,0.00057049457,0.0008090112,0.0029436762,0.00090845337,0.00079590175,0.0069499407],"category_scores_gemma":[0.005594359,0.00064588187,0.0013390031,0.00084371376,0.0018090379,0.0024141439,0.001925903,0.002959896,0.0008195271],"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.00067459623,0.000265183,0.0033322342,0.0005782986,0.000108729015,0.00041885398,0.00040033704,0.57733107,0.013666727,0.33826628,0.00799856,0.056959074],"study_design_scores_gemma":[0.00009398104,0.00034515583,0.0025468026,0.000089375775,0.000039346553,0.00046075956,0.00026952123,0.6067069,0.010458294,0.36838776,0.0105297,0.00007237685],"about_ca_topic_score_codex":0.0024435518,"about_ca_topic_score_gemma":0.0028838261,"teacher_disagreement_score":0.0069499407,"about_ca_system_score_codex":0.0012261717,"about_ca_system_score_gemma":0.0009280041,"threshold_uncertainty_score":0.023249865},"labels":[],"label_agreement":null},{"id":"W2565232885","doi":"10.1007/s00037-007-0229-6","title":"The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers","year":2007,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","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":"Concatenation (mathematics); Natural number; Intersection (aeronautics); Computer science; Discrete mathematics; Set (abstract data type); Integer (computer science); Prime (order theory); Electronic circuit; Range (aeronautics); Mathematics; Time complexity; Computational complexity theory; Circuit complexity; Combinatorics; Algorithm","score_opus":0.09899804868414189,"score_gpt":0.3208446374831788,"score_spread":0.22184658879903693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565232885","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.6058076,0.0052329735,0.30895305,0.03212962,0.00035480747,0.0003761435,0.0034793227,0.0007926665,0.042873822],"genre_scores_gemma":[0.9340373,0.0020343564,0.049957007,0.00085016224,0.00085319544,0.00033613044,0.002498563,0.00024871694,0.0091845635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936686,0.0021856066,0.00034001758,0.0013032447,0.0017322127,0.0007704713],"domain_scores_gemma":[0.91018313,0.081805825,0.0025014796,0.0026866703,0.0014292208,0.0013936388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004264606,0.0010365882,0.0019319269,0.0019943926,0.0029185724,0.012402442,0.005050345,0.0041836165,0.009724434],"category_scores_gemma":[0.04958374,0.0012614771,0.0024115718,0.0039480105,0.0065318686,0.029855836,0.0039013007,0.00810006,0.0006441029],"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.000774178,0.0004750592,0.0062436396,0.0008064404,0.00020757286,0.00021112294,0.0020451236,0.085165516,0.0014122891,0.8407636,0.012683757,0.049211722],"study_design_scores_gemma":[0.00006532836,0.000022597727,0.00076038245,0.000032488417,0.00004458692,0.00011685166,0.0002898247,0.077626325,0.0004985583,0.91883755,0.0016788163,0.000026709311],"about_ca_topic_score_codex":0.004259365,"about_ca_topic_score_gemma":0.0039971084,"teacher_disagreement_score":0.012402442,"about_ca_system_score_codex":0.0058234395,"about_ca_system_score_gemma":0.0029759025,"threshold_uncertainty_score":0.042252183},"labels":[],"label_agreement":null},{"id":"W2567006712","doi":"","title":"Improved Compact Linearizations for the Unconstrained Quadratic 0-1 Minimization Problem","year":2006,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Complexity and Algorithms in Graphs","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","funders":"","keywords":"Linearization; Mathematics; Quadratic equation; Minification; Upper and lower bounds; Mathematical optimization; Applied mathematics; Nonlinear system; Mathematical analysis","score_opus":0.011528368713001955,"score_gpt":0.2189448606967072,"score_spread":0.20741649198370526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567006712","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.02934951,0.00068831124,0.95200765,0.00037630764,0.00013342008,0.00025574217,0.0003034532,0.0020429108,0.014842668],"genre_scores_gemma":[0.41912806,0.0009926016,0.557747,0.0005648564,0.00016018235,0.0008413454,0.0016761018,0.0007972166,0.018092576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992648,0.00022607816,0.000040024577,0.000095218085,0.00027754623,0.00009637239],"domain_scores_gemma":[0.99872476,0.000607552,0.00018557903,0.00017978979,0.00023805039,0.00006429202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012999771,0.001586777,0.0010420568,0.0009047363,0.00046559703,0.0009317394,0.0016041625,0.0010092157,0.011160805],"category_scores_gemma":[0.003995074,0.00046885828,0.0008836784,0.0009462729,0.00072372105,0.002190484,0.0016613274,0.0018317228,0.0027354704],"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.00042068644,0.00044519533,0.0005359812,0.0005251234,0.00006922542,0.00033389142,0.00044909245,0.6428823,0.010584037,0.059152946,0.016744211,0.26785737],"study_design_scores_gemma":[0.00016074513,0.0005122886,0.00036887117,0.00006805864,0.000031030817,0.0001556464,0.0001871942,0.9549419,0.0061200755,0.023537565,0.013869729,0.000046969486],"about_ca_topic_score_codex":0.0024225507,"about_ca_topic_score_gemma":0.0031798978,"teacher_disagreement_score":0.011160805,"about_ca_system_score_codex":0.00069968385,"about_ca_system_score_gemma":0.0009926746,"threshold_uncertainty_score":0.037336588},"labels":[],"label_agreement":null},{"id":"W2568886140","doi":"","title":"Completeness for First-order Properties on Sparse Structures with Algorithmic Applications","year":2019,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":26,"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":"","keywords":"Tuple; Completeness (order theory); Property (philosophy); Time complexity; Exponential time hypothesis; Data structure; Mathematics; PSPACE; Set (abstract data type); Exponential function; Combinatorics; Class (philosophy); Order (exchange); Discrete mathematics; Computer science; Algorithm; Computational complexity theory","score_opus":0.021214219592210596,"score_gpt":0.23162304265959494,"score_spread":0.21040882306738434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568886140","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.19609289,0.0009525346,0.7696678,0.0056907716,0.00009936123,0.0003103237,0.0030520258,0.0041422076,0.019992026],"genre_scores_gemma":[0.6748945,0.00084749877,0.30574465,0.0010588412,0.0003964623,0.00041265914,0.0069142347,0.0010608354,0.0086703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933355,0.0013962717,0.0005254713,0.0015609588,0.0022733475,0.00090846396],"domain_scores_gemma":[0.96331006,0.025509022,0.0018001846,0.006892142,0.0019448014,0.0005438078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003908904,0.001111972,0.0015273795,0.0020000774,0.002241202,0.006112721,0.0027871921,0.0019668122,0.009627676],"category_scores_gemma":[0.02263419,0.0013504653,0.0039776503,0.003819547,0.004041844,0.015341495,0.0045055044,0.006604528,0.0016929173],"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.0005911087,0.00048471417,0.0054042945,0.0010847369,0.00017731856,0.0002660443,0.0018728726,0.06958362,0.008186041,0.78993523,0.012848499,0.10956562],"study_design_scores_gemma":[0.000059768965,0.000044487955,0.0006569998,0.000039828763,0.000038375234,0.00015837736,0.00016005946,0.08685339,0.0044300677,0.90380585,0.0037293704,0.000023383931],"about_ca_topic_score_codex":0.0031355482,"about_ca_topic_score_gemma":0.0046031377,"teacher_disagreement_score":0.009627676,"about_ca_system_score_codex":0.0030623188,"about_ca_system_score_gemma":0.0039874217,"threshold_uncertainty_score":0.032207787},"labels":[],"label_agreement":null},{"id":"W2570310514","doi":"10.1007/s00446-014-0211-x","title":"Randomized distributed decision","year":2014,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":26,"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 Research Chairs; University of Toronto","funders":"","keywords":"Computer science; Boosting (machine learning); Randomized algorithm; Context (archaeology); Monte Carlo method; Randomization; Distributed algorithm; Theoretical computer science; Artificial intelligence; Distributed computing; Algorithm; Randomized controlled trial; Mathematics; Statistics","score_opus":0.014558018621588415,"score_gpt":0.2548765614012152,"score_spread":0.24031854277962675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570310514","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.04335401,0.0015119744,0.9032078,0.008407327,0.0012070058,0.00077678135,0.0016654765,0.002039048,0.03783075],"genre_scores_gemma":[0.73156315,0.0008711798,0.2175908,0.0024969766,0.0017784748,0.0012467476,0.0024513877,0.0005984562,0.041402806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9876695,0.0054455665,0.00041420475,0.003123315,0.0018225983,0.0015248099],"domain_scores_gemma":[0.9682064,0.021039262,0.001063762,0.0064442186,0.0018526058,0.0013936885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069299205,0.0015878214,0.0036495102,0.0013573453,0.0025299005,0.0045965575,0.004717937,0.0031240894,0.027447924],"category_scores_gemma":[0.031000044,0.0010335146,0.001633107,0.003039888,0.0032903966,0.007898296,0.0050186208,0.0050140982,0.0035770938],"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.0030396981,0.0012772533,0.0015984649,0.0005762052,0.00022237602,0.00016381053,0.0001974523,0.17914388,0.0018350353,0.5845543,0.083568364,0.14382315],"study_design_scores_gemma":[0.0004885283,0.00013751478,0.0002391638,0.000036165784,0.000056267207,0.00007371391,0.0000473354,0.59041876,0.0009524744,0.40185127,0.005668465,0.000030247109],"about_ca_topic_score_codex":0.0021748357,"about_ca_topic_score_gemma":0.0036470732,"teacher_disagreement_score":0.027447924,"about_ca_system_score_codex":0.004760454,"about_ca_system_score_gemma":0.007504612,"threshold_uncertainty_score":0.091822386},"labels":[],"label_agreement":null},{"id":"W2571163292","doi":"10.1007/978-3-642-13731-0_19","title":"A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"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","keywords":"Combinatorics; Vertex (graph theory); Partition (number theory); Polynomial-time approximation scheme; Approximation algorithm; Clique graph; Adjacency matrix; Graph; Mathematics; Unit disk graph; Graph partition; Discrete mathematics; Clique; Computer science; Line graph; Graph power","score_opus":0.03375501707243674,"score_gpt":0.26118555109189284,"score_spread":0.2274305340194561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571163292","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.03813272,0.00040055462,0.9478562,0.00082379085,0.00018709453,0.00035464438,0.0007126668,0.0013405868,0.010191652],"genre_scores_gemma":[0.5295502,0.00063964294,0.45150822,0.000564872,0.0003831606,0.0010212408,0.0016945321,0.0008397122,0.013798406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746096,0.0006578484,0.00013140617,0.00080944947,0.00064937805,0.00029094264],"domain_scores_gemma":[0.99553114,0.0020138605,0.00039578287,0.0010623909,0.00055954495,0.00043725624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020862413,0.0021575657,0.0039637513,0.0011946555,0.001702208,0.003995463,0.0054814527,0.0031212128,0.008127584],"category_scores_gemma":[0.0103517985,0.0010731483,0.002647325,0.0023844775,0.0020712672,0.0053942217,0.0063641737,0.0047674514,0.0017524901],"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.0017168248,0.00043205533,0.0009648501,0.0010244015,0.00027491566,0.0002751032,0.00056692056,0.45451835,0.022802195,0.32703307,0.02627649,0.16411483],"study_design_scores_gemma":[0.00007549589,0.00019816014,0.00019673302,0.000039279643,0.000056314606,0.000101611164,0.00008568178,0.8187019,0.002185414,0.17587386,0.0024525945,0.00003296589],"about_ca_topic_score_codex":0.0022649416,"about_ca_topic_score_gemma":0.0018955113,"teacher_disagreement_score":0.008127584,"about_ca_system_score_codex":0.0026527694,"about_ca_system_score_gemma":0.002868447,"threshold_uncertainty_score":0.027189434},"labels":[],"label_agreement":null},{"id":"W2574553255","doi":"","title":"Structure in Stable Matching Problems","year":2016,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Complexity and Algorithms in Graphs","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":"Matching (statistics); Computer science; Mathematics; Statistics","score_opus":0.009597189048235795,"score_gpt":0.1948047144092679,"score_spread":0.1852075253610321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2574553255","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.101652406,0.0010105195,0.8564571,0.0030780477,0.00011866235,0.0003794987,0.000577697,0.0003108155,0.03641522],"genre_scores_gemma":[0.627436,0.0015084181,0.34728816,0.0007232515,0.0006127923,0.000556225,0.0021218464,0.00030809196,0.01944527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700564,0.0010041061,0.00016417599,0.000659461,0.000825489,0.0003411043],"domain_scores_gemma":[0.99302846,0.0054108775,0.00047619874,0.00045036428,0.00039114337,0.00024295239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023254645,0.0008078596,0.0010897388,0.0014530503,0.0016355693,0.0034608636,0.002048786,0.0015525727,0.012322408],"category_scores_gemma":[0.013945608,0.00064577756,0.0014827289,0.0027581272,0.0025569885,0.0077988603,0.003189777,0.003396969,0.0011115199],"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.00008599889,0.00013661385,0.0008463542,0.0002922812,0.000039411218,0.000096424475,0.0003112199,0.037170608,0.0009020763,0.91487414,0.0044011846,0.04084371],"study_design_scores_gemma":[0.000027223801,0.00004274071,0.00015698565,0.000024975961,0.000012161892,0.00008653777,0.000111094974,0.07173916,0.00070022506,0.9228123,0.0042770784,0.0000095047],"about_ca_topic_score_codex":0.0008497726,"about_ca_topic_score_gemma":0.0010144337,"teacher_disagreement_score":0.012322408,"about_ca_system_score_codex":0.0017338697,"about_ca_system_score_gemma":0.001381091,"threshold_uncertainty_score":0.041222513},"labels":[],"label_agreement":null},{"id":"W2575287504","doi":"","title":"Full Cycle Extendability of Nearly Claw-Free Graphs.","year":2016,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Complexity and Algorithms in Graphs","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":"Claw; Mathematics; Combinatorics; Biology","score_opus":0.012734423601708593,"score_gpt":0.23253393877361603,"score_spread":0.21979951517190743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575287504","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.78111756,0.00095325575,0.12987298,0.0013515606,0.000086148226,0.00008892746,0.0019147072,0.00080003426,0.08381485],"genre_scores_gemma":[0.97951025,0.00035831414,0.010261738,0.00021651405,0.000053032643,0.000041063508,0.0010418918,0.000105317646,0.008412041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950933,0.00007187183,0.000024929268,0.00013697834,0.00014498693,0.00011196117],"domain_scores_gemma":[0.9969427,0.0014722325,0.00030867217,0.00060649746,0.00026967784,0.00040021617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040611794,0.00036574618,0.0004234421,0.0010014514,0.0007935578,0.0016477737,0.0010393996,0.0006658565,0.008853725],"category_scores_gemma":[0.0039051792,0.00035605044,0.0005380202,0.0012430903,0.0010633554,0.0040545133,0.0020495339,0.0014026666,0.0006924813],"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.00021159422,0.000093610404,0.0029968687,0.00023613551,0.000045049677,0.0004964038,0.0007106707,0.013758055,0.00927703,0.92029846,0.0055677653,0.046308286],"study_design_scores_gemma":[0.000016811633,0.000022340551,0.0011908775,0.000025391904,0.000021914297,0.00037407424,0.00013927218,0.015219578,0.0027504256,0.97463655,0.005587168,0.00001554745],"about_ca_topic_score_codex":0.0014586506,"about_ca_topic_score_gemma":0.0015773162,"teacher_disagreement_score":0.008853725,"about_ca_system_score_codex":0.0005324894,"about_ca_system_score_gemma":0.00042091374,"threshold_uncertainty_score":0.02961868},"labels":[],"label_agreement":null},{"id":"W2577805882","doi":"10.1002/rsa.20807","title":"A characterization of constant‐sample testable properties","year":2018,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constant (computer programming); Mathematics; Characterization (materials science); Monotonic function; Affine transformation; Property testing; Property (philosophy); Constant function; Partition (number theory); Combinatorics; Invariant (physics); Discrete mathematics; Pure mathematics; Mathematical analysis; Physics; Piecewise; Computer science","score_opus":0.019380667144622523,"score_gpt":0.22796953370269527,"score_spread":0.20858886655807274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2577805882","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.76589775,0.0002592518,0.2261864,0.0007813117,0.000030485353,0.00019991078,0.0010596804,0.00062521145,0.004959993],"genre_scores_gemma":[0.98766786,0.00004393051,0.010990031,0.000090699796,0.0000336623,0.00013473154,0.0005734,0.000056434583,0.00040927125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98973036,0.0030875287,0.00079919177,0.002519095,0.0029094159,0.00095436693],"domain_scores_gemma":[0.84834,0.10396378,0.013875286,0.022282684,0.0069932966,0.004544952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067684655,0.0009514268,0.0019139496,0.0020951799,0.0010070379,0.0036776685,0.0037554458,0.0021249885,0.003968022],"category_scores_gemma":[0.078422576,0.0009363582,0.0016981281,0.0015954138,0.006442502,0.007635949,0.0033603196,0.0029213394,0.0003408184],"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.004568112,0.0012719531,0.09528376,0.0008274298,0.0010128398,0.0028838622,0.0014163016,0.27871668,0.07487485,0.4688316,0.0034294904,0.06688306],"study_design_scores_gemma":[0.00028567194,0.0005967435,0.010198373,0.00005320883,0.00014017442,0.0012385537,0.0003015282,0.70375466,0.025847578,0.25606802,0.0014174489,0.00009801293],"about_ca_topic_score_codex":0.00093402195,"about_ca_topic_score_gemma":0.0005377019,"teacher_disagreement_score":0.0067684655,"about_ca_system_score_codex":0.002198693,"about_ca_system_score_gemma":0.0013631703,"threshold_uncertainty_score":0.03579551},"labels":[],"label_agreement":null},{"id":"W2578790121","doi":"10.1145/3055399.3055478","title":"Strongly exponential lower bounds for monotone computation","year":2017,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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","keywords":"Monotone polygon; Constant (computer programming); Computation; Mathematics; Function (biology); Exponential function; Strongly monotone; Exponent; Discrete mathematics; Upper and lower bounds; Monotonic function; Combinatorics; Applied mathematics; Computer science; Algorithm; Mathematical analysis","score_opus":0.042228431976782034,"score_gpt":0.31235092128707853,"score_spread":0.2701224893102965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578790121","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.14504288,0.0065232567,0.6459378,0.022051916,0.0010453733,0.00038309157,0.0028679841,0.0041306554,0.1720171],"genre_scores_gemma":[0.84670687,0.004337111,0.10504719,0.0051083965,0.0021087346,0.0013941546,0.0023972185,0.002489134,0.030411096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920844,0.0015546493,0.00027574113,0.0015563241,0.002490799,0.002038118],"domain_scores_gemma":[0.925967,0.058085136,0.001991843,0.008295526,0.003774606,0.0018859364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00505325,0.0032557887,0.0021210103,0.0028513859,0.0023019984,0.006068971,0.0054337345,0.0029568668,0.022120116],"category_scores_gemma":[0.05195772,0.0013032752,0.0041417317,0.0031356227,0.0057725483,0.026143122,0.008503367,0.011787182,0.0038506035],"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.0009435188,0.00029761824,0.003187646,0.0007245699,0.00014600961,0.00027550975,0.00052655657,0.034265194,0.008772035,0.8923263,0.018726202,0.039808806],"study_design_scores_gemma":[0.00005934864,0.00006980492,0.0005708856,0.00011686489,0.00009428946,0.00017164812,0.000081706945,0.11933511,0.005338556,0.86488754,0.009222509,0.000051737265],"about_ca_topic_score_codex":0.0021125446,"about_ca_topic_score_gemma":0.002356338,"teacher_disagreement_score":0.022120116,"about_ca_system_score_codex":0.008164674,"about_ca_system_score_gemma":0.003253357,"threshold_uncertainty_score":0.07399917},"labels":[],"label_agreement":null},{"id":"W2588377248","doi":"10.1016/j.dam.2017.01.012","title":"Deterministic distributed construction of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml3\" display=\"inline\" overflow=\"scroll\" altimg=\"si3.gif\"><mml:mi>T</mml:mi></mml:math>-dominating sets in time <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml4\" display=\"inline\" overflow=\"scroll\" altimg=\"si3.gif\"><mml:mi>T</mml:mi></mml:math>","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","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":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Mathematics; Dominating set; Combinatorics; Upper and lower bounds; Hypergraph; Disjoint sets; Graph; Discrete mathematics; Binary logarithm; Vertex (graph theory)","score_opus":0.018549315522038323,"score_gpt":0.25460526733583627,"score_spread":0.23605595181379796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588377248","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.05087213,0.000243091,0.9178138,0.0019388346,0.0002574401,0.0007491566,0.0030326133,0.0042892997,0.020803582],"genre_scores_gemma":[0.353509,0.00028203463,0.61168367,0.00051187904,0.00009963567,0.0009045707,0.0077317003,0.0015001529,0.02377736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709344,0.0006784554,0.00017856288,0.0008905635,0.000695444,0.00046358773],"domain_scores_gemma":[0.9910581,0.0041154614,0.00030565303,0.0025143374,0.001183958,0.0008225928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021957136,0.0008722583,0.00113367,0.0011742561,0.0020917372,0.0028937098,0.0030595455,0.0012373585,0.017067414],"category_scores_gemma":[0.010269286,0.0008044005,0.0020734111,0.001909576,0.0013330404,0.0035033089,0.0048710243,0.0019837588,0.003945349],"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.0016186985,0.00087332056,0.004403489,0.0017180566,0.0002549986,0.00047752724,0.0012259277,0.19426179,0.032375854,0.4107764,0.09986723,0.2521467],"study_design_scores_gemma":[0.0003805345,0.00029860137,0.0016163511,0.00011619241,0.00017584983,0.00034944245,0.0005324409,0.50730807,0.025277536,0.42231634,0.041534528,0.0000940997],"about_ca_topic_score_codex":0.0033671614,"about_ca_topic_score_gemma":0.0070619495,"teacher_disagreement_score":0.017067414,"about_ca_system_score_codex":0.0028074353,"about_ca_system_score_gemma":0.003907892,"threshold_uncertainty_score":0.057096124},"labels":[],"label_agreement":null},{"id":"W2593693579","doi":"10.48550/arxiv.1702.06969","title":"Approximating Unique Games Using Low Diameter Graph Decomposition","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Combinatorics; Mathematics; Minor (academic); Graph; Alphabet; Approximation algorithm; Discrete mathematics","score_opus":0.10419736094822678,"score_gpt":0.23027748977501292,"score_spread":0.12608012882678615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593693579","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.039672267,0.0003498727,0.95193887,0.00047475804,0.00007696399,0.00014782295,0.00022675404,0.0011577219,0.005955041],"genre_scores_gemma":[0.37327537,0.0003869542,0.6193695,0.00041309273,0.00007952845,0.00042229108,0.0009519013,0.00048147878,0.004619982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816114,0.0005034608,0.000076459066,0.00057081203,0.00033766075,0.00035039496],"domain_scores_gemma":[0.9965838,0.0018241486,0.0004579648,0.00059099175,0.00027991144,0.00026310523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012472935,0.0023130774,0.0015509968,0.0016896512,0.00090815604,0.001661431,0.0028545898,0.0016213073,0.0049035647],"category_scores_gemma":[0.008618669,0.0010328807,0.0018560331,0.0018874122,0.0011433363,0.00374274,0.0026581225,0.0028436086,0.0012056769],"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.0004179102,0.00030889545,0.0023375342,0.00039101875,0.00013373989,0.00021556637,0.00027706075,0.7636843,0.007456296,0.1015527,0.010231476,0.1129935],"study_design_scores_gemma":[0.00003765261,0.00006149789,0.00014601297,0.000021565382,0.000016827073,0.00006128226,0.00004408434,0.93601465,0.0015172027,0.06053887,0.0015290285,0.000011399706],"about_ca_topic_score_codex":0.0050123148,"about_ca_topic_score_gemma":0.00854349,"teacher_disagreement_score":0.0050123148,"about_ca_system_score_codex":0.0026872912,"about_ca_system_score_gemma":0.0014825996,"threshold_uncertainty_score":0.019497752},"labels":[],"label_agreement":null},{"id":"W2594003820","doi":"10.4086/toc.2019.v015a017","title":"","year":2019,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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; Science and Engineering Research Board; Alfred P. Sloan Foundation","keywords":"Combinatorics; Upper and lower bounds; Boolean function; Degree (music); Mathematics; Omega; Polynomial; Monotone polygon; Function (biology); Binary logarithm; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics; Geometry","score_opus":0.014177357646648656,"score_gpt":0.2334054208585872,"score_spread":0.21922806321193855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594003820","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.018929295,0.0015052086,0.82630825,0.0058126287,0.0024697545,0.00029344152,0.0014117792,0.0049611377,0.13830855],"genre_scores_gemma":[0.35581934,0.002248975,0.54819953,0.008008023,0.0014715221,0.00056373706,0.0037898247,0.0015120596,0.07838699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987231,0.0001885729,0.00008542578,0.00032005858,0.00043140116,0.00025142994],"domain_scores_gemma":[0.9980732,0.00043628932,0.00010486743,0.00082351477,0.00042598683,0.00013614033],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000717752,0.00084184017,0.00065431267,0.00071937253,0.000931588,0.001797799,0.001798905,0.0011203677,0.035725255],"category_scores_gemma":[0.004213087,0.00049149484,0.001416566,0.0006957518,0.0009919986,0.0041124146,0.0039695334,0.0023879362,0.009774507],"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.00024186082,0.00023318629,0.0010634036,0.00045314195,0.00007242979,0.00016117322,0.00013411825,0.0071704546,0.021319611,0.6538161,0.06907737,0.24625726],"study_design_scores_gemma":[0.00008016347,0.00027022735,0.0011623725,0.00012520766,0.00014571263,0.0009892847,0.000068029374,0.053932365,0.03428317,0.49326524,0.41560027,0.0000779739],"about_ca_topic_score_codex":0.001153847,"about_ca_topic_score_gemma":0.0018714801,"teacher_disagreement_score":0.96427476,"about_ca_system_score_codex":0.0013529146,"about_ca_system_score_gemma":0.0012582977,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2594925297","doi":"10.1016/j.cor.2017.02.019","title":"A strongly polynomial Contraction-Expansion algorithm for network flow problems","year":2017,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Complexity and Algorithms in Graphs","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":"HEC Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Contraction (grammar); Algorithm; Flow network; Computer science; Maximum flow problem; Flow (mathematics); Polynomial; Mathematics; Mathematical optimization; Geometry; Mathematical analysis","score_opus":0.09211569102058015,"score_gpt":0.3732049175096355,"score_spread":0.2810892264890554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594925297","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.028095309,0.0003200529,0.9503937,0.0013250208,0.00020920514,0.0003075838,0.00029453656,0.0016034145,0.017451163],"genre_scores_gemma":[0.17540345,0.00030626712,0.80751044,0.0005840376,0.00020158928,0.000585661,0.0010495012,0.0006940164,0.013665154],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987697,0.00037665965,0.00005277148,0.0003166174,0.00028924123,0.00019500838],"domain_scores_gemma":[0.99643636,0.0022104194,0.000112271904,0.00054972176,0.0004584603,0.0002327533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019494384,0.0014072272,0.0013885993,0.0010475577,0.0011543559,0.0016901604,0.0034167496,0.0018780142,0.011788715],"category_scores_gemma":[0.0081395935,0.0007066999,0.0012178933,0.0018580722,0.0014083901,0.0038541697,0.0036502888,0.004946331,0.002349585],"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.0012864925,0.0010008437,0.0010872072,0.0004959412,0.000073465126,0.00016427334,0.0005067533,0.1747478,0.01157521,0.18372035,0.040840693,0.58450097],"study_design_scores_gemma":[0.00034978922,0.00016386976,0.0003404513,0.000049833576,0.000046384175,0.00011635918,0.00010281165,0.804039,0.00359392,0.1825275,0.0086408,0.000029258817],"about_ca_topic_score_codex":0.0039536646,"about_ca_topic_score_gemma":0.0047493023,"teacher_disagreement_score":0.011788715,"about_ca_system_score_codex":0.0017337269,"about_ca_system_score_gemma":0.0036913322,"threshold_uncertainty_score":0.039437234},"labels":[],"label_agreement":null},{"id":"W2599445248","doi":"10.1007/s11590-017-1135-8","title":"A 5-approximation algorithm for the k-prize-collecting Steiner tree problem","year":2017,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Vertex (graph theory); Mathematics; Spanning tree; Gomory–Hu tree; Tree (set theory); Minimum spanning tree; Graph; Minimum degree spanning tree; Integer (computer science); Discrete mathematics; K-ary tree; Computer science; Tree structure; Binary tree","score_opus":0.02933868493811216,"score_gpt":0.26105253950293705,"score_spread":0.2317138545648249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599445248","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.14965624,0.0019206662,0.7920925,0.005147332,0.0007411355,0.0008541351,0.0028746582,0.0046284585,0.042084925],"genre_scores_gemma":[0.27962592,0.00053544017,0.704816,0.00059831917,0.00019823758,0.00054526574,0.0031459376,0.00046521352,0.010069746],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792886,0.0005233692,0.00014888235,0.0003729787,0.00046902202,0.00055677246],"domain_scores_gemma":[0.99720424,0.0012212944,0.00023156474,0.00061302027,0.00033899117,0.00039076162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001994019,0.0015352241,0.0022439214,0.0014548635,0.0016495389,0.0030353174,0.005070372,0.0027604392,0.017451353],"category_scores_gemma":[0.0063162316,0.00076502725,0.0020419066,0.0033626405,0.00089034846,0.004544004,0.003120228,0.003086336,0.003196048],"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.0029846611,0.0016123935,0.0029104797,0.001045969,0.00028037577,0.00030713363,0.000520489,0.33392864,0.0067754174,0.08716663,0.06531628,0.4971515],"study_design_scores_gemma":[0.0004842681,0.0003134187,0.0011037253,0.000080448226,0.00012709635,0.00037625313,0.00026810323,0.8841546,0.0025696033,0.09960035,0.010870486,0.000051641073],"about_ca_topic_score_codex":0.0044736946,"about_ca_topic_score_gemma":0.008048987,"teacher_disagreement_score":0.017451353,"about_ca_system_score_codex":0.0034793182,"about_ca_system_score_gemma":0.0054968363,"threshold_uncertainty_score":0.058380544},"labels":[],"label_agreement":null},{"id":"W2600683609","doi":"10.1137/16m1057486","title":"Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"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":"Combinatorics; Mathematics; Minimum degree spanning tree; Vertex connectivity; Enhanced Data Rates for GSM Evolution; Induced subgraph isomorphism problem; Upper and lower bounds; Spanning tree; Subgraph isomorphism problem; Connected dominating set; Discrete mathematics; Graph; Computer science; Line graph; Vertex (graph theory); Voltage graph; Artificial intelligence","score_opus":0.08980382657351924,"score_gpt":0.325023209135156,"score_spread":0.23521938256163674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600683609","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.23518977,0.0124926735,0.5110703,0.025079226,0.001222789,0.0004163855,0.0052335807,0.002490874,0.20680445],"genre_scores_gemma":[0.6235845,0.0062284265,0.33068997,0.008367185,0.0015691306,0.00097393396,0.005494136,0.0018622057,0.021230513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99656516,0.0008368953,0.000106497966,0.0007573868,0.0010375322,0.00069660513],"domain_scores_gemma":[0.9876467,0.008928653,0.0007465581,0.001137957,0.00061492086,0.00092511636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053741634,0.0031459762,0.0024822294,0.0027508617,0.0021766184,0.005745469,0.0051395283,0.004099493,0.017837316],"category_scores_gemma":[0.022791483,0.0016147001,0.0022918405,0.0034009863,0.003828095,0.01108035,0.00591897,0.011512951,0.0049104593],"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.0023846251,0.0007408661,0.0026905064,0.0014918043,0.00022369435,0.00038917674,0.0008159676,0.17837992,0.014632711,0.63784766,0.06700499,0.09339814],"study_design_scores_gemma":[0.00015065554,0.00021050948,0.0011087925,0.00035564174,0.00011798077,0.00030619136,0.00021597253,0.32720944,0.0056121303,0.64424115,0.02040585,0.00006569375],"about_ca_topic_score_codex":0.0024467178,"about_ca_topic_score_gemma":0.0031760673,"teacher_disagreement_score":0.017837316,"about_ca_system_score_codex":0.0046551055,"about_ca_system_score_gemma":0.0025518383,"threshold_uncertainty_score":0.05967176},"labels":[],"label_agreement":null},{"id":"W26022181","doi":"","title":"Some Results in Computational Complexity","year":2005,"lang":"en","type":"article","venue":"TSpace","topic":"Complexity and Algorithms in Graphs","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":"Computer science","score_opus":0.059713676658355155,"score_gpt":0.33181295615322853,"score_spread":0.2720992794948734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W26022181","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.018576143,0.037768256,0.49765316,0.09041407,0.002145521,0.00015341092,0.0010686491,0.0005841173,0.35163662],"genre_scores_gemma":[0.6048217,0.059040274,0.21519834,0.029601736,0.017134225,0.0012589261,0.0025271247,0.0016288832,0.06878888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927349,0.0018262451,0.000414931,0.0012711113,0.0029110597,0.00084185513],"domain_scores_gemma":[0.9633468,0.031169543,0.00066760863,0.0025381455,0.0017278402,0.0005500383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063541164,0.0014980586,0.0012246334,0.0032826383,0.003670088,0.0057120323,0.0029545943,0.002247937,0.01800463],"category_scores_gemma":[0.022490626,0.0007336427,0.003333425,0.004926069,0.010434805,0.019209582,0.004231521,0.0130525045,0.002534782],"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.000015752154,0.000026478545,0.00022077757,0.00022018084,0.0000172572,0.000048792754,0.00019199187,0.0015774539,0.00018322455,0.97895324,0.0074055544,0.011139308],"study_design_scores_gemma":[0.000010251847,0.00001797823,0.00029706617,0.000099498066,0.000018807112,0.000081331804,0.000078640485,0.0042586527,0.00038318074,0.9575922,0.037151262,0.000011349729],"about_ca_topic_score_codex":0.0026354138,"about_ca_topic_score_gemma":0.0015092094,"teacher_disagreement_score":0.01800463,"about_ca_system_score_codex":0.0056911367,"about_ca_system_score_gemma":0.0016792262,"threshold_uncertainty_score":0.060231447},"labels":[],"label_agreement":null},{"id":"W260268286","doi":"10.1007/978-3-540-45077-1_29","title":"Non-uniform Depth of Polynomial Time and Space Simulations","year":2003,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"DTIME; Connection (principal bundle); Computation; Time complexity; Polynomial; Mathematics; PSPACE; Electronic circuit; Space (punctuation); Constant (computer programming); Spacetime; Linear space; Space time; Discrete mathematics; Turing machine; Computer science; Algorithm; Mathematical analysis; Computational complexity theory; Geometry; Physics; Quantum mechanics","score_opus":0.012779228881794445,"score_gpt":0.24684313871894586,"score_spread":0.23406390983715142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W260268286","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.4350378,0.0020495204,0.48508433,0.0076084435,0.00023629025,0.00024897506,0.0015510834,0.0026143063,0.06556921],"genre_scores_gemma":[0.9490064,0.0005098142,0.037047118,0.0007366397,0.00022538604,0.00018947326,0.00048689658,0.000769776,0.011028557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99363166,0.0017967444,0.00029681504,0.0013549812,0.001195705,0.0017240251],"domain_scores_gemma":[0.95123464,0.034542527,0.0029144287,0.006752877,0.0014968481,0.003058711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004408979,0.0015643314,0.003508763,0.0019158672,0.0025911,0.0057017403,0.005289479,0.0034611728,0.0164562],"category_scores_gemma":[0.043744966,0.0023993351,0.002820229,0.0024355564,0.006333127,0.023083005,0.0081982985,0.007697595,0.0011842573],"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.0008903808,0.00010842217,0.00139022,0.00021974125,0.00008271404,0.000093147995,0.00044573186,0.061995916,0.0018738185,0.91764605,0.0037162513,0.011537597],"study_design_scores_gemma":[0.00007042151,0.00003754754,0.0002463291,0.000024023435,0.00004771006,0.000081626604,0.00007266913,0.08911298,0.0012357392,0.9075677,0.0014811254,0.000022271759],"about_ca_topic_score_codex":0.0025065015,"about_ca_topic_score_gemma":0.0032863254,"teacher_disagreement_score":0.0164562,"about_ca_system_score_codex":0.005782568,"about_ca_system_score_gemma":0.003194687,"threshold_uncertainty_score":0.055051446},"labels":[],"label_agreement":null},{"id":"W2605137997","doi":"10.1007/s10107-017-1140-9","title":"Matroid optimisation problems with nested non-linear monomials in the objective function","year":2017,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","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 British Columbia","funders":"","keywords":"Matroid; Mathematics; Monomial; Polytope; Submodular set function; Combinatorics; Rank (graph theory); Linear inequality; Monomial basis; Quadratic equation; Discrete mathematics; Quadratic function; Time complexity; Inequality; Mathematical analysis; Geometry","score_opus":0.03847006613994907,"score_gpt":0.27778044538007934,"score_spread":0.23931037924013027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605137997","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.040289972,0.00062142214,0.9483612,0.00077884976,0.00008990204,0.00006541098,0.00023724847,0.00009191708,0.009463897],"genre_scores_gemma":[0.5030691,0.0010363902,0.47377557,0.00037825722,0.00036825694,0.00024920815,0.0006023024,0.00027743983,0.020243533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985297,0.00071529194,0.00005248214,0.00027213243,0.0002770444,0.00015336306],"domain_scores_gemma":[0.99639255,0.0026187866,0.00031353967,0.00029500402,0.000193227,0.0001868806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002415467,0.0010276169,0.0018635057,0.00096798525,0.00062399847,0.0023885418,0.00177333,0.0019151998,0.0034790637],"category_scores_gemma":[0.007521423,0.00085945154,0.0014400828,0.0018639722,0.0016684828,0.004329454,0.0022710855,0.0034572068,0.0005069156],"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.00011327222,0.00018327565,0.0006483916,0.00029977877,0.00008731339,0.00019491829,0.00010195029,0.5633056,0.002382854,0.3992827,0.0038833236,0.029516675],"study_design_scores_gemma":[0.000018799881,0.000035245575,0.00014846119,0.00002313016,0.00001943856,0.000070326205,0.000027631424,0.80375904,0.00067624054,0.19361006,0.0015966371,0.000014961167],"about_ca_topic_score_codex":0.001761894,"about_ca_topic_score_gemma":0.0030292128,"teacher_disagreement_score":0.0034790637,"about_ca_system_score_codex":0.0018041896,"about_ca_system_score_gemma":0.0011207771,"threshold_uncertainty_score":0.013090372},"labels":[],"label_agreement":null},{"id":"W2605296320","doi":"10.1145/3055399.3055470","title":"A polynomial restriction lemma with applications","year":2017,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Constant (computer programming); Degree (music); Lemma (botany); Discrete mathematics; Polynomial; Upper and lower bounds; Block (permutation group theory); Random variable; Function (biology); Boolean function; Statistics; Physics; Mathematical analysis; Computer science","score_opus":0.02368693301885313,"score_gpt":0.26024729835374266,"score_spread":0.23656036533488953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605296320","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.037511244,0.0042195036,0.86140954,0.0099847885,0.00069142657,0.00021413453,0.00088293996,0.001220327,0.08386611],"genre_scores_gemma":[0.82270515,0.006172851,0.11865853,0.005649324,0.0032904353,0.0011518358,0.0011788409,0.0008877608,0.04030508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945832,0.0014895884,0.0002728274,0.0016897015,0.0012945959,0.0006700678],"domain_scores_gemma":[0.9571964,0.031917643,0.0016744175,0.0051803286,0.0027951945,0.0012360718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040482637,0.001828238,0.0024283044,0.0028526876,0.0024270364,0.0037328727,0.0033038023,0.0021292707,0.014349509],"category_scores_gemma":[0.031913444,0.0009610119,0.0032224548,0.004672575,0.0062372233,0.010751602,0.008284242,0.01016937,0.003323358],"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.00019890197,0.00008660385,0.0012566616,0.00033476207,0.000085525535,0.00027386242,0.00034810443,0.012161121,0.0027006434,0.9430754,0.010803856,0.028674569],"study_design_scores_gemma":[0.000080762635,0.000119355114,0.00070245896,0.00008970301,0.00009736455,0.0005917272,0.0000784655,0.07015424,0.0023567663,0.90619624,0.01947126,0.00006156907],"about_ca_topic_score_codex":0.0022971162,"about_ca_topic_score_gemma":0.0010569008,"teacher_disagreement_score":0.014349509,"about_ca_system_score_codex":0.0032651578,"about_ca_system_score_gemma":0.0015520074,"threshold_uncertainty_score":0.048003912},"labels":[],"label_agreement":null},{"id":"W2607867111","doi":"10.1007/s10107-017-1150-7","title":"Approximating min-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems","year":2017,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"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; Ontario Ministry of Research, Innovation and Science","keywords":"Matroid; Mathematics; Spanning tree; Combinatorics; Degree (music); Approximation algorithm; Mathematical optimization; Minimum spanning tree; Linear programming relaxation; Reduction (mathematics); Constant (computer programming); Submodular set function; Lagrangian relaxation; Discrete mathematics; Linear programming; Computer science","score_opus":0.04325035615917717,"score_gpt":0.28487047776355545,"score_spread":0.2416201216043783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607867111","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.029826157,0.00086833443,0.96197903,0.00083221257,0.00012386049,0.00019107529,0.0004971563,0.00037063652,0.0053115664],"genre_scores_gemma":[0.27310705,0.0014474326,0.7116827,0.00051090686,0.00040844703,0.000558512,0.001740954,0.0008587392,0.009685235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978249,0.0007184389,0.00010730158,0.0005763635,0.00053457636,0.00023847343],"domain_scores_gemma":[0.99079317,0.0068639293,0.0005166964,0.0008838985,0.000572014,0.0003701991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023126912,0.002160592,0.003034191,0.001559348,0.00092560495,0.0030663393,0.0053331894,0.0030574882,0.008713106],"category_scores_gemma":[0.016860968,0.0015535532,0.0019853096,0.004517989,0.0014122684,0.007029104,0.0035606287,0.0046568424,0.0011783391],"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.00026654598,0.00041641697,0.0008669155,0.0007869119,0.00012954375,0.0001565957,0.00024620787,0.75868815,0.0017557852,0.09075318,0.012650198,0.1332835],"study_design_scores_gemma":[0.00002662738,0.000035190402,0.00011031355,0.000031961175,0.00003018921,0.000052143525,0.000049338938,0.8884052,0.00038962442,0.1094233,0.0014368108,0.000009252308],"about_ca_topic_score_codex":0.0043529295,"about_ca_topic_score_gemma":0.005209546,"teacher_disagreement_score":0.008713106,"about_ca_system_score_codex":0.002225262,"about_ca_system_score_gemma":0.0019650785,"threshold_uncertainty_score":0.029148221},"labels":[],"label_agreement":null},{"id":"W2610939548","doi":"","title":"Communication Complexity of Set-Disjointness for All Probabilities.","year":2014,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","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":"Communication complexity; Characterization (materials science); Mathematics; Class (philosophy); Bounded function; Complexity class; Set (abstract data type); Upper and lower bounds; Discrete mathematics; Simple (philosophy); Combinatorics; Structural complexity theory; Computational complexity theory; Time complexity; Computer science; Algorithm","score_opus":0.058259513247356814,"score_gpt":0.3010568026989903,"score_spread":0.2427972894516335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2610939548","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.34937003,0.0010909578,0.617035,0.008117673,0.00015440583,0.00032556546,0.0012273117,0.0005113894,0.022167679],"genre_scores_gemma":[0.95745194,0.00047944547,0.035688538,0.00062672194,0.00027905332,0.00042173744,0.0004859557,0.00016001106,0.004406597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9903583,0.0036662184,0.00036110246,0.0019782102,0.002190852,0.0014453165],"domain_scores_gemma":[0.9045138,0.08013954,0.0052533904,0.0067321607,0.0015587265,0.0018024332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005460844,0.0012453384,0.0015857213,0.0012816467,0.0017755192,0.004641608,0.0040636,0.0028851975,0.006622441],"category_scores_gemma":[0.044251733,0.00073421485,0.0024296886,0.0015988202,0.005092558,0.014097533,0.005474818,0.008940887,0.0006198206],"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.0003690036,0.00016347246,0.0019156886,0.00024387777,0.00012947829,0.00017685688,0.0005356801,0.108650245,0.002478076,0.8696096,0.0031802545,0.0125477845],"study_design_scores_gemma":[0.00005709489,0.00005493161,0.00044438688,0.00002097093,0.00003856144,0.00010523122,0.000066672816,0.28900295,0.001561414,0.7073177,0.0013044297,0.000025653966],"about_ca_topic_score_codex":0.0014334666,"about_ca_topic_score_gemma":0.0008622524,"teacher_disagreement_score":0.006622441,"about_ca_system_score_codex":0.0051070964,"about_ca_system_score_gemma":0.0021693625,"threshold_uncertainty_score":0.037054718},"labels":[],"label_agreement":null},{"id":"W2611727281","doi":"10.1007/s40305-017-0164-4","title":"A Primal-Dual Algorithm for the Generalized Prize-Collecting Steiner Forest Problem","year":2017,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Complexity and Algorithms in Graphs","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":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Steiner tree problem; Mathematics; Vertex (graph theory); Graph; Vertex connectivity; Enhanced Data Rates for GSM Evolution; Approximation algorithm; Discrete mathematics; Computer science","score_opus":0.09638973414503361,"score_gpt":0.38406296238854476,"score_spread":0.28767322824351116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611727281","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.057272688,0.00078229076,0.9252349,0.0013463915,0.00031053298,0.00041396442,0.0005439483,0.0006501225,0.013445183],"genre_scores_gemma":[0.3104786,0.00045210062,0.6801086,0.00034968223,0.00021811137,0.00045683017,0.0007538233,0.00024817692,0.00693407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989906,0.00039844465,0.000042449275,0.00018852577,0.00018239568,0.00019763474],"domain_scores_gemma":[0.9984977,0.00076012634,0.000113186245,0.00016305006,0.00022994139,0.00023594516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00210999,0.0013933271,0.0024108377,0.0011635133,0.0012970701,0.0022488825,0.002945926,0.002043842,0.0068926862],"category_scores_gemma":[0.0037014296,0.0008790855,0.0011090883,0.0022980375,0.0009084659,0.0024543854,0.0027172044,0.0025375746,0.00090258685],"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.0008892847,0.001034796,0.0015317284,0.0006870078,0.00015315895,0.00025033255,0.0002159352,0.6451356,0.0029217147,0.087671235,0.026336772,0.2331724],"study_design_scores_gemma":[0.00015386082,0.000083362946,0.00020716147,0.000027503793,0.000031586438,0.00012016784,0.00006059638,0.952887,0.00045440526,0.043846548,0.0021119306,0.0000158569],"about_ca_topic_score_codex":0.0027858643,"about_ca_topic_score_gemma":0.004201697,"teacher_disagreement_score":0.0068926862,"about_ca_system_score_codex":0.0017275079,"about_ca_system_score_gemma":0.003626312,"threshold_uncertainty_score":0.023058295},"labels":[],"label_agreement":null},{"id":"W2619218210","doi":"10.1145/3039870","title":"Time vs. Information Tradeoffs for Leader Election in Anonymous Trees","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"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 en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Leader election; Node (physics); Logarithm; Upper and lower bounds; Computer science; String (physics); Tree (set theory); Binary logarithm; Computer network; Advice (programming); Time complexity; Simple (philosophy); Multiplicative function; Mathematics; Combinatorics; Discrete mathematics; Theoretical computer science; Algorithm","score_opus":0.028810953609554928,"score_gpt":0.2745985513117078,"score_spread":0.24578759770215286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2619218210","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.3163125,0.004623321,0.64509475,0.0051379,0.00034607112,0.0002885866,0.0006485864,0.0014979194,0.026050402],"genre_scores_gemma":[0.9115172,0.0015404605,0.08245182,0.00040706628,0.00026596634,0.00026351406,0.00027978045,0.00040514802,0.0028689462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928584,0.0024612024,0.000321187,0.0010443658,0.0016786839,0.0016360951],"domain_scores_gemma":[0.87009126,0.110900074,0.006283675,0.0077402196,0.0023921712,0.0025926786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008596812,0.0011354369,0.001338033,0.0012530407,0.0019165138,0.0035045578,0.0021686917,0.001819588,0.0039324793],"category_scores_gemma":[0.07282222,0.00071129337,0.0008842596,0.0014670353,0.0027750677,0.008129937,0.0029631655,0.0028029587,0.0006548286],"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.0044744257,0.0004941949,0.0034404409,0.00083239144,0.00015470687,0.0003420894,0.001250055,0.59188676,0.033780664,0.27846473,0.005832421,0.0790471],"study_design_scores_gemma":[0.00014394773,0.00050922134,0.0008608231,0.000080665,0.00010277733,0.0002427042,0.0002493782,0.85953003,0.010169306,0.12554349,0.002507373,0.000060316102],"about_ca_topic_score_codex":0.0007793252,"about_ca_topic_score_gemma":0.0010969416,"teacher_disagreement_score":0.008596812,"about_ca_system_score_codex":0.0029589746,"about_ca_system_score_gemma":0.0024412863,"threshold_uncertainty_score":0.045464814},"labels":[],"label_agreement":null},{"id":"W2623150993","doi":"10.1145/2344422.2344424","title":"All-pairs shortest paths for unweighted undirected graphs in <i>o</i> ( <i>mn</i> ) time","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","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":"Log-log plot; Combinatorics; Binary logarithm; Mathematics; Undirected graph; Running time; Graph; Time complexity; Discrete mathematics; Algorithm","score_opus":0.030576764379670184,"score_gpt":0.2668495776188133,"score_spread":0.2362728132391431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623150993","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.13058424,0.0017613088,0.83423513,0.0026785247,0.00031109276,0.0009333415,0.0024674195,0.0056121666,0.02141673],"genre_scores_gemma":[0.2175597,0.0010703483,0.7657136,0.00029102727,0.0001603732,0.0005340654,0.004014109,0.0010988902,0.009557887],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978492,0.0005181818,0.00019046308,0.0007275499,0.00040053253,0.0003140918],"domain_scores_gemma":[0.99597603,0.002183121,0.000449729,0.0007837723,0.00029938133,0.00030791416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013268718,0.0020299745,0.0016884675,0.0013674606,0.0016303455,0.0028741593,0.0029722052,0.0016118154,0.011196261],"category_scores_gemma":[0.006542698,0.0009886614,0.0017261115,0.0025793496,0.0010825518,0.010852369,0.0038005258,0.0015993036,0.0025957539],"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.001484971,0.00068892556,0.0028232052,0.0031605824,0.00034604967,0.00054726365,0.0014828228,0.25516123,0.027297733,0.1033095,0.04187528,0.5618225],"study_design_scores_gemma":[0.0006170223,0.0004997706,0.0012634741,0.00017566702,0.00020044106,0.0009190458,0.0011757858,0.5218437,0.020817408,0.41625053,0.03611876,0.00011848848],"about_ca_topic_score_codex":0.0028338134,"about_ca_topic_score_gemma":0.0051556425,"teacher_disagreement_score":0.011196261,"about_ca_system_score_codex":0.0020437858,"about_ca_system_score_gemma":0.0025233282,"threshold_uncertainty_score":0.0374552},"labels":[],"label_agreement":null},{"id":"W2735816714","doi":"10.1145/3086464","title":"Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":44,"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":"Submodular set function; Mathematics; Matroid; Combinatorics; Discrete mathematics; Monotone polygon; Automatic summarization; Cardinality (data modeling); Mathematical optimization; Computer science; Data mining","score_opus":0.02398333559549957,"score_gpt":0.26348549531059334,"score_spread":0.23950215971509378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735816714","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.053757984,0.0030003863,0.9289062,0.0018326734,0.00009640505,0.00024249914,0.0006130461,0.00077156443,0.010779322],"genre_scores_gemma":[0.5844526,0.0018685126,0.4039394,0.000809184,0.0003332148,0.00051479595,0.0011838301,0.0003073802,0.006591066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977794,0.00092811295,0.00008453269,0.00046572636,0.0004937305,0.0002484421],"domain_scores_gemma":[0.9947731,0.0035596509,0.000516446,0.0006417144,0.0002524912,0.0002565965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037335095,0.0019975682,0.0028599738,0.0013758844,0.0011293559,0.0025991574,0.0031079832,0.001829528,0.004603413],"category_scores_gemma":[0.011802666,0.00077698834,0.0012897102,0.003946644,0.0016692191,0.007662277,0.002973244,0.002838991,0.0009986669],"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.0006828344,0.0005819286,0.0020805472,0.00051482324,0.00023195277,0.00025095278,0.0003209043,0.57802135,0.0029412026,0.171244,0.016025053,0.22710432],"study_design_scores_gemma":[0.00007080103,0.00013856418,0.00034174562,0.000033073073,0.000034585297,0.00017749761,0.00006739479,0.7910768,0.0011108295,0.2036454,0.0032822096,0.000021156977],"about_ca_topic_score_codex":0.0014046966,"about_ca_topic_score_gemma":0.0015030196,"teacher_disagreement_score":0.004603413,"about_ca_system_score_codex":0.0021860383,"about_ca_system_score_gemma":0.0012434231,"threshold_uncertainty_score":0.019744933},"labels":[],"label_agreement":null},{"id":"W2738777098","doi":"10.1137/1.9781611975031.136","title":"Testing Bounded Arboricity","year":2018,"lang":"en","type":"preprint","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","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":"H2020 European Research Council; Azrieli Foundation; United States-Israel Binational Science Foundation; National Science Foundation","keywords":"Arboricity; Combinatorics; Bounded function; Treewidth; Mathematics; Omega; Dense graph; Degree (music); Upper and lower bounds; Planar graph; Graph; Discrete mathematics; Binary logarithm; 1-planar graph; Pathwidth; Chordal graph; Physics; Line graph","score_opus":0.13631702241766247,"score_gpt":0.2810234004014134,"score_spread":0.1447063779837509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738777098","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.6126839,0.00039251026,0.3737195,0.00168059,0.00010004998,0.00019914741,0.0017909369,0.0022818663,0.007151491],"genre_scores_gemma":[0.95485723,0.0001484435,0.041640162,0.0003160899,0.000077236764,0.00010211143,0.0017816781,0.00020673849,0.00087030686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9911032,0.0026708774,0.0005698021,0.00232896,0.0024797835,0.00084735866],"domain_scores_gemma":[0.87811613,0.09281348,0.008514012,0.012614542,0.0051371115,0.002804765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033402818,0.0008525776,0.0011519388,0.0013782969,0.0010199798,0.0017181851,0.002504535,0.0015799521,0.0043860623],"category_scores_gemma":[0.06436271,0.00052058074,0.0011541162,0.0014379724,0.002135904,0.0072539058,0.0027205183,0.0018632528,0.00081716664],"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.0042935275,0.0010641683,0.17732373,0.0012063029,0.0007455854,0.003345332,0.0015740608,0.31963667,0.080351084,0.14100294,0.009481875,0.2599748],"study_design_scores_gemma":[0.00016757289,0.0012565827,0.011855823,0.00012772366,0.00013157814,0.0022760122,0.00079745275,0.623799,0.043712746,0.31033984,0.0054565845,0.00007910239],"about_ca_topic_score_codex":0.0011115496,"about_ca_topic_score_gemma":0.0012589553,"teacher_disagreement_score":0.0043860623,"about_ca_system_score_codex":0.0009559906,"about_ca_system_score_gemma":0.0010132259,"threshold_uncertainty_score":0.017665327},"labels":[],"label_agreement":null},{"id":"W2739627855","doi":"10.24963/ijcai.2017/363","title":"Optimizing Ratio of Monotone Set Functions","year":2017,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Novelis (Canada)","funders":"National Natural Science Foundation of China","keywords":"Submodular set function; Monotone polygon; Set function; Set (abstract data type); Mathematics; Greedy algorithm; Approximation algorithm; Combinatorics; Discrete mathematics; Mathematical optimization; Upper and lower bounds; Applied mathematics; Computer science; Mathematical analysis","score_opus":0.05506663702558866,"score_gpt":0.2910248506300271,"score_spread":0.23595821360443842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739627855","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.13401341,0.0020343878,0.8421623,0.0010614515,0.00010759714,0.0002882439,0.00038010246,0.0016248613,0.018327633],"genre_scores_gemma":[0.6374649,0.0007106867,0.35217518,0.0005064884,0.00014250203,0.0003920681,0.0005294103,0.0007610563,0.0073176925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966306,0.0014980048,0.000100702906,0.0006803456,0.0006704688,0.0004199037],"domain_scores_gemma":[0.99475324,0.0038692248,0.0003893598,0.0004883191,0.00028248242,0.00021743074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037533715,0.0024284155,0.002702024,0.0015745896,0.0006070611,0.0020750407,0.0031461765,0.0021359366,0.0055317823],"category_scores_gemma":[0.014183655,0.0010374567,0.0015457195,0.0014500093,0.0014585722,0.0047092685,0.0021654489,0.0022349854,0.0012221257],"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.0011828613,0.0005497593,0.0023699612,0.0007998975,0.0002786959,0.0002877543,0.00023638476,0.6260307,0.015009581,0.09864027,0.008282093,0.24633214],"study_design_scores_gemma":[0.000086657674,0.00048766125,0.0006193562,0.000049935697,0.00007059316,0.0003474018,0.00008194629,0.9392091,0.006498359,0.04966068,0.0028552902,0.000033008535],"about_ca_topic_score_codex":0.0012526159,"about_ca_topic_score_gemma":0.0011351948,"teacher_disagreement_score":0.0055317823,"about_ca_system_score_codex":0.0023889407,"about_ca_system_score_gemma":0.0012505155,"threshold_uncertainty_score":0.019850016},"labels":[],"label_agreement":null},{"id":"W2741405093","doi":"10.23638/lmcs-15(3:3)2019","title":"Subspace-Invariant AC$^0$ Formulas","year":2019,"lang":"en","type":"preprint","venue":"Logical Methods in Computer Science","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Combinatorics; Mathematics; Invariant (physics); Parity function; Omega; Subspace topology; Hamming weight; Upper and lower bounds; Discrete mathematics; Boolean function; Hamming code; Mathematical analysis; Physics; Pure mathematics; Algorithm; Mathematical physics; Quantum mechanics","score_opus":0.11226766053009571,"score_gpt":0.402389845439322,"score_spread":0.29012218490922626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741405093","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.4481385,0.00040859007,0.45834765,0.0007995001,0.00019627507,0.00014570174,0.0010508428,0.0037142406,0.087198764],"genre_scores_gemma":[0.8910825,0.00020743888,0.09305614,0.0004497554,0.00010534721,0.00012861185,0.00097571994,0.00048816737,0.013506355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993024,0.00009783211,0.00003176983,0.00015682506,0.00020336888,0.00020782782],"domain_scores_gemma":[0.99940157,0.00017768575,0.00006187153,0.00020869875,0.00009602894,0.000054178898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038156664,0.0004695551,0.00035098608,0.00041358388,0.00058460754,0.0010176823,0.0010692659,0.0003526359,0.010773372],"category_scores_gemma":[0.0013527914,0.00023010137,0.0007490663,0.00039713265,0.0012058774,0.0021558765,0.0018431409,0.0013809142,0.0014830375],"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.00039154128,0.0001549822,0.0019541325,0.000200069,0.00003899644,0.00029060218,0.00029413035,0.015570436,0.03080643,0.84565234,0.005440024,0.0992064],"study_design_scores_gemma":[0.0000794563,0.00024319146,0.0010155423,0.000028316159,0.00007305735,0.00023572566,0.00013018404,0.15065923,0.06935303,0.758966,0.019162342,0.000053869986],"about_ca_topic_score_codex":0.0015885244,"about_ca_topic_score_gemma":0.002120764,"teacher_disagreement_score":0.010773372,"about_ca_system_score_codex":0.00083182694,"about_ca_system_score_gemma":0.00078475603,"threshold_uncertainty_score":0.036040485},"labels":[],"label_agreement":null},{"id":"W2745314127","doi":"10.1016/j.disopt.2018.06.004","title":"The generalized vertex cover problem and some variations","year":2018,"lang":"en","type":"preprint","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Bipartite graph; Vertex cover; Mathematics; Vertex (graph theory); Generalization; Combinatorics; Cover (algebra); Edge cover; Mathematical optimization; Quadratic equation; Linear programming; Integer programming; Discrete mathematics; Approximation algorithm; Graph","score_opus":0.015549613876668566,"score_gpt":0.24941590798724567,"score_spread":0.2338662941105771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745314127","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.13227151,0.027146157,0.7225216,0.013507492,0.001501995,0.00016371148,0.0012073313,0.0003983685,0.101281874],"genre_scores_gemma":[0.76716113,0.013058389,0.16917019,0.0022112236,0.0044510486,0.0003723648,0.0013556392,0.0005560673,0.041664004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771774,0.0007848532,0.00006343524,0.0005787895,0.0005861183,0.00026917033],"domain_scores_gemma":[0.9957918,0.002583971,0.00033649275,0.0006816933,0.00027891065,0.00032698456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002178104,0.0015698194,0.0025340612,0.0018561534,0.0014577286,0.004683056,0.0040378436,0.0032500064,0.0068157353],"category_scores_gemma":[0.009072319,0.0007079205,0.002066402,0.0058393157,0.0034825571,0.007885827,0.0035827274,0.0065924195,0.00068862183],"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.00012953798,0.00012140266,0.00040739813,0.00027014155,0.00007265605,0.00010360617,0.00013519842,0.07359941,0.00067055953,0.87964493,0.011320108,0.033525027],"study_design_scores_gemma":[0.000032168016,0.0000228078,0.00033800534,0.000031766005,0.00002712681,0.00009440876,0.000047112477,0.15809114,0.00020891416,0.8329742,0.008108732,0.000023586237],"about_ca_topic_score_codex":0.004335263,"about_ca_topic_score_gemma":0.004276356,"teacher_disagreement_score":0.0068157353,"about_ca_system_score_codex":0.0035279884,"about_ca_system_score_gemma":0.0013950785,"threshold_uncertainty_score":0.025597453},"labels":[],"label_agreement":null},{"id":"W2751154306","doi":"10.5555/3135595.3135623","title":"Distribution testing lower bounds via reductions from communication complexity","year":2017,"lang":"en","type":"article","venue":"Apollo (University of Cambridge)","topic":"Complexity and Algorithms in Graphs","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":"","keywords":"Mathematical proof; Simple (philosophy); Mathematics; Measure (data warehouse); Reduction (mathematics); Upper and lower bounds; Distribution (mathematics); Connection (principal bundle); Discrete mathematics; Property testing; Sample (material); Computer science; Mathematical analysis; Data mining","score_opus":0.0477911743995175,"score_gpt":0.23929163829766156,"score_spread":0.19150046389814407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751154306","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.018815137,0.00066719047,0.9561764,0.003731466,0.00014023804,0.00017392376,0.00040883274,0.00046260707,0.019424176],"genre_scores_gemma":[0.68310344,0.0016706436,0.29376456,0.0027676781,0.0015562862,0.0019841464,0.0012109156,0.0012676165,0.012674739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9868249,0.004008041,0.00051860337,0.0020854762,0.0052160677,0.00134692],"domain_scores_gemma":[0.9055886,0.08003712,0.0023667626,0.0071540377,0.0034495406,0.0014037745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010101042,0.0025766299,0.0025987334,0.0033999083,0.001962753,0.0058249724,0.0054406943,0.0028016036,0.010406389],"category_scores_gemma":[0.057319656,0.0010857654,0.004896311,0.0030160889,0.0069639413,0.018925564,0.009588848,0.015179685,0.0013904441],"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.00010811332,0.00011859135,0.0009120823,0.00025782955,0.000054798573,0.00012864415,0.00033208184,0.041914493,0.0023064308,0.9305175,0.0034379566,0.019911425],"study_design_scores_gemma":[0.000022992943,0.000051713054,0.00027898367,0.00004380839,0.000025955711,0.00007911792,0.000045484583,0.16999081,0.0018976035,0.8248175,0.0027182787,0.00002784912],"about_ca_topic_score_codex":0.0017191825,"about_ca_topic_score_gemma":0.0010982973,"teacher_disagreement_score":0.010406389,"about_ca_system_score_codex":0.0061625373,"about_ca_system_score_gemma":0.0029995493,"threshold_uncertainty_score":0.053420007},"labels":[],"label_agreement":null},{"id":"W2752885799","doi":"10.1287/moor.2019.1034","title":"Stabilizing Weighted Graphs","year":2020,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Matching (statistics); Cardinality (data modeling); Time complexity; Bipartite graph; Graph; Factor-critical graph; Discrete mathematics; Line graph; Computer science; Graph power","score_opus":0.22893134895133008,"score_gpt":0.4098623481194887,"score_spread":0.1809309991681586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752885799","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.1771098,0.00023229398,0.7958143,0.00050045113,0.000092915594,0.0002477995,0.000656681,0.0008720605,0.024473794],"genre_scores_gemma":[0.75679153,0.00037485547,0.22500624,0.00020481323,0.000082582366,0.00023106721,0.0014540778,0.00025528754,0.015599661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993325,0.000118200274,0.000030994557,0.00020621295,0.00019234107,0.00011972539],"domain_scores_gemma":[0.99833894,0.0006762456,0.00025872077,0.0003596013,0.00023942279,0.00012699918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005214578,0.0006710255,0.0005922305,0.0007069137,0.00089336815,0.0013839463,0.0014362527,0.00081251253,0.0061720596],"category_scores_gemma":[0.0041137957,0.00028067167,0.00046681004,0.0013701036,0.00076015975,0.002431468,0.0013526073,0.00097513583,0.0009159449],"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.0004316216,0.0001736734,0.0014959717,0.00034962367,0.00008247446,0.00040876138,0.00029013472,0.19919458,0.035541337,0.5949779,0.010393563,0.15666033],"study_design_scores_gemma":[0.000044947144,0.000098213284,0.0004505308,0.000028408322,0.000045037938,0.00024282142,0.00013161906,0.35948408,0.011340989,0.61479783,0.0133171845,0.000018362829],"about_ca_topic_score_codex":0.0009437712,"about_ca_topic_score_gemma":0.001399671,"teacher_disagreement_score":0.0061720596,"about_ca_system_score_codex":0.0009794025,"about_ca_system_score_gemma":0.00067658565,"threshold_uncertainty_score":0.020647585},"labels":[],"label_agreement":null},{"id":"W2760351616","doi":"10.1016/j.jcss.2023.03.001","title":"The 2CNF Boolean formula satisfiability problem and the linear space hypothesis","year":2023,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Mathematics; Nondeterministic algorithm; Discrete mathematics; Maximum satisfiability problem; True quantified Boolean formula; Linear space; Boolean satisfiability problem; Time complexity; Satisfiability; Space (punctuation); Polynomial; Boolean domain; Combinatorics; NP; Boolean function; Algebra over a field; Algorithm; Computer science; Pure mathematics; Two-element Boolean algebra; Turing machine; Computation","score_opus":0.024400049774708648,"score_gpt":0.2432979119986418,"score_spread":0.21889786222393318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760351616","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.36463016,0.0042693997,0.49896312,0.053068765,0.00071711605,0.00025847313,0.0039997445,0.0009480025,0.073145136],"genre_scores_gemma":[0.91474223,0.0015540045,0.06590623,0.002163566,0.0014321641,0.00021993593,0.0022353283,0.00018192026,0.011564576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964784,0.0012595397,0.00014947844,0.0007607487,0.000749139,0.0006027699],"domain_scores_gemma":[0.9569326,0.03815278,0.0016053143,0.0014555057,0.001144757,0.0007090889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028571414,0.00062097545,0.0014803791,0.0019176598,0.0017322592,0.0042535206,0.0028716554,0.0034051326,0.01569578],"category_scores_gemma":[0.02898236,0.00077382656,0.0018601703,0.0028484236,0.004249814,0.014213677,0.0024186682,0.0049001947,0.0008140416],"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.00042640092,0.0002860128,0.0026557797,0.00049852626,0.00010131126,0.00036620095,0.00044229635,0.047507443,0.00083708396,0.8804126,0.02051162,0.045954764],"study_design_scores_gemma":[0.00006737347,0.000022038963,0.00045226773,0.00003455477,0.000017771556,0.0001432496,0.0001476244,0.078356676,0.00042540915,0.91822207,0.0020873018,0.000023626506],"about_ca_topic_score_codex":0.007519707,"about_ca_topic_score_gemma":0.005073801,"teacher_disagreement_score":0.01569578,"about_ca_system_score_codex":0.0027586152,"about_ca_system_score_gemma":0.0025311066,"threshold_uncertainty_score":0.05250764},"labels":[],"label_agreement":null},{"id":"W2766828223","doi":"10.1007/s00493-019-3897-3","title":"The Satisfiability Threshold For Random Linear Equations","year":2020,"lang":"en","type":"preprint","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo","funders":"","keywords":"Finite field; Mathematics; Satisfiability; Random matrix; Combinatorics; Discrete mathematics; Matrix (chemical analysis); Field (mathematics); Zero (linguistics); Multivariate random variable; Combinatorial proof; Random variable; Pure mathematics; Physics; Quantum mechanics; Statistics","score_opus":0.06303154819406136,"score_gpt":0.3012957554934848,"score_spread":0.23826420729942344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766828223","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.5232738,0.0033888223,0.38791224,0.021122009,0.0003944329,0.00016796737,0.0019284297,0.0017026034,0.06010976],"genre_scores_gemma":[0.97508574,0.0006486467,0.016717343,0.0008135184,0.00041792038,0.00014249419,0.00055265805,0.00025414623,0.00536754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99454224,0.0016991065,0.00032111007,0.0013477852,0.0012880443,0.0008017534],"domain_scores_gemma":[0.8698949,0.112740226,0.004419772,0.0073322933,0.0027730763,0.0028397534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051215566,0.00058525876,0.0025102657,0.0029070433,0.0018708861,0.0074770553,0.0021945825,0.0030200707,0.008819926],"category_scores_gemma":[0.071084976,0.0013945006,0.0011668642,0.0017976938,0.005360379,0.015469326,0.003140557,0.006474403,0.00070435996],"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.00024108491,0.000091932896,0.0027895377,0.00023331033,0.000048915048,0.00011153858,0.0003688671,0.016603818,0.0022368259,0.95781446,0.0061355648,0.013324212],"study_design_scores_gemma":[0.00002741653,0.000014701318,0.0006099832,0.000033947526,0.000018032333,0.000083709885,0.000064512,0.084451504,0.0010777549,0.91278446,0.00081338664,0.000020670073],"about_ca_topic_score_codex":0.0015369386,"about_ca_topic_score_gemma":0.0011531014,"teacher_disagreement_score":0.008819926,"about_ca_system_score_codex":0.0037202202,"about_ca_system_score_gemma":0.0020297735,"threshold_uncertainty_score":0.02950561},"labels":[],"label_agreement":null},{"id":"W2768340386","doi":"10.4230/lipics.itcs.2018.41","title":"Graph Clustering using Effective Resistance","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Connection (principal bundle); Conductance; Mathematics; Graph; Inverse; Degree (music); Discrete mathematics; Physics; Geometry","score_opus":0.10107644088329495,"score_gpt":0.21607731011774256,"score_spread":0.1150008692344476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768340386","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.009136955,0.00027114924,0.98241985,0.00034267682,0.000050937422,0.00013810396,0.00028438156,0.002948434,0.004407592],"genre_scores_gemma":[0.20458525,0.00057128683,0.7788757,0.00034561192,0.00016192126,0.00054521015,0.002039333,0.00116516,0.011710536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982578,0.000469216,0.000079569065,0.00055229117,0.0004739483,0.0001671008],"domain_scores_gemma":[0.9972983,0.0008123878,0.00033644628,0.0010031795,0.00041211647,0.00013761938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010663114,0.0017614547,0.0015756486,0.0040819803,0.0012550617,0.0023129035,0.0036865724,0.0017086627,0.0067409473],"category_scores_gemma":[0.00556729,0.0008690357,0.0017024964,0.0028747444,0.0013504145,0.0037518705,0.002701942,0.0015389228,0.005265963],"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.0003336422,0.00017908373,0.0012208897,0.0005973595,0.0002464442,0.00016472992,0.0004195268,0.435136,0.024583599,0.18220165,0.021974199,0.33294287],"study_design_scores_gemma":[0.000039575938,0.00007254783,0.0002940295,0.000033832148,0.000034375877,0.00011245959,0.000052635256,0.8797331,0.006927605,0.10438964,0.008272082,0.000038068847],"about_ca_topic_score_codex":0.0031807262,"about_ca_topic_score_gemma":0.0033449363,"teacher_disagreement_score":0.0067409473,"about_ca_system_score_codex":0.0024559107,"about_ca_system_score_gemma":0.0013777936,"threshold_uncertainty_score":0.022550762},"labels":[],"label_agreement":null},{"id":"W2777560552","doi":"10.1137/1.9781611975031.53","title":"Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts","year":2018,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Bounded function; Mathematics; Approximation algorithm; Tree (set theory); Bundle; Combinatorics; Set (abstract data type); Discrete mathematics; Mathematical optimization; Computer science","score_opus":0.06393553489565193,"score_gpt":0.24732857111222792,"score_spread":0.183393036216576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2777560552","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.054246634,0.00084892067,0.9344873,0.00073184294,0.00010368698,0.0001166012,0.0004760285,0.0010867666,0.007902351],"genre_scores_gemma":[0.47672102,0.0007463315,0.5128839,0.0005681393,0.00018257262,0.00050123845,0.002063863,0.0005255016,0.0058074193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987293,0.0003615821,0.000046186025,0.00025568096,0.00035384932,0.00025342355],"domain_scores_gemma":[0.9969021,0.0021076836,0.00024247494,0.00033705658,0.00024864372,0.00016212981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016615797,0.0020065992,0.0018948473,0.0011399937,0.000655384,0.0016207696,0.0023464842,0.0023883486,0.005019911],"category_scores_gemma":[0.008002722,0.0009535949,0.0014542304,0.0018636227,0.0012440829,0.0037936915,0.002423218,0.004364833,0.0009800685],"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.0003901816,0.00021584051,0.0011645505,0.00024274083,0.00007150594,0.00016602308,0.000157174,0.8318142,0.0031767695,0.067565836,0.011048401,0.08398668],"study_design_scores_gemma":[0.000023841812,0.000050917322,0.00012878097,0.000019933692,0.000008920597,0.000033971242,0.000026578167,0.95946825,0.0005320036,0.03850088,0.0012004279,0.0000055319665],"about_ca_topic_score_codex":0.0042365515,"about_ca_topic_score_gemma":0.0050560962,"teacher_disagreement_score":0.005019911,"about_ca_system_score_codex":0.0017142019,"about_ca_system_score_gemma":0.0012604226,"threshold_uncertainty_score":0.016793251},"labels":[],"label_agreement":null},{"id":"W2784736141","doi":"10.1145/3170711","title":"Randomized Communication versus Partition Number","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","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":"University of Toronto","funders":"National Science Foundation","keywords":"Mathematics; Communication complexity; Partition (number theory); Combinatorics; Randomized algorithm; Upper and lower bounds; Discrete mathematics; Clique; Set (abstract data type); Computer science","score_opus":0.040741930199470346,"score_gpt":0.3162857808016349,"score_spread":0.2755438506021645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784736141","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.12614776,0.0017720335,0.8078901,0.010080478,0.0006541166,0.00049577456,0.001368722,0.003055538,0.048535477],"genre_scores_gemma":[0.8725484,0.0006218442,0.114218235,0.0016739112,0.0006004362,0.00076557434,0.0009817096,0.00082329754,0.007766528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9874548,0.0045357007,0.00035589933,0.0026186036,0.0029751442,0.0020599486],"domain_scores_gemma":[0.92603976,0.052436158,0.0034424695,0.0142667135,0.0019393027,0.0018755863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004864907,0.0016517752,0.0020566531,0.0012757715,0.0023160416,0.0047006225,0.0046721357,0.002759707,0.017259398],"category_scores_gemma":[0.048697356,0.001027893,0.0013600043,0.0021976463,0.0042186775,0.012731677,0.0050006066,0.006190276,0.002200488],"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.0019044584,0.00059337425,0.0021358985,0.00051570206,0.00012218261,0.00013470948,0.0002885551,0.35316384,0.012966852,0.5387885,0.016551742,0.07283417],"study_design_scores_gemma":[0.00016081885,0.00019393646,0.0004962034,0.000053648753,0.000053862066,0.00012033247,0.000052447627,0.6783204,0.0067348075,0.3104733,0.0032924798,0.000047738446],"about_ca_topic_score_codex":0.0015625636,"about_ca_topic_score_gemma":0.002813632,"teacher_disagreement_score":0.017259398,"about_ca_system_score_codex":0.00548745,"about_ca_system_score_gemma":0.0050183274,"threshold_uncertainty_score":0.057738423},"labels":[],"label_agreement":null},{"id":"W2787163834","doi":"10.1137/17m1136869","title":"Structure of Protocols for XOR Functions","year":2018,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation; National Science Foundation","keywords":"Boolean function; Combinatorics; Mathematics; Parity (physics); Function (biology); Discrete mathematics; Communication complexity; Binary entropy function; Reduction (mathematics); Entropy (arrow of time); Time complexity; Parity function; Computational complexity theory; Algorithm; Boolean expression; Physics; Principle of maximum entropy; Biology; Genetics; Statistics","score_opus":0.039394675873595596,"score_gpt":0.3277555133152117,"score_spread":0.2883608374416161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787163834","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.15740937,0.0005844047,0.77713996,0.003975159,0.00022175146,0.00051574665,0.0012932693,0.0012468863,0.057613403],"genre_scores_gemma":[0.86059964,0.000683459,0.10414665,0.00083374896,0.00030303834,0.0011205098,0.0013342637,0.00040604957,0.030572556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99614644,0.0010350723,0.00027040773,0.0008053989,0.0011388978,0.0006037831],"domain_scores_gemma":[0.98926735,0.005868522,0.0011188963,0.002201718,0.0009947405,0.0005487779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023169972,0.0007434198,0.0010765797,0.0014964816,0.0022520486,0.004731822,0.002190665,0.0025523251,0.010964385],"category_scores_gemma":[0.01114474,0.0010448949,0.0013869064,0.0014953158,0.0031196747,0.01004496,0.005525108,0.004575523,0.0021751835],"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.000065623,0.000032079693,0.00014498051,0.00004119079,0.000009520862,0.000064847525,0.0001865308,0.0040549845,0.0009863239,0.98850983,0.0009802985,0.004923836],"study_design_scores_gemma":[0.000030225418,0.000027789143,0.00008041208,0.000016495278,0.0000126240875,0.000052225183,0.000034691337,0.028722657,0.0012181122,0.9672624,0.002527675,0.000014726773],"about_ca_topic_score_codex":0.00056484377,"about_ca_topic_score_gemma":0.0005726489,"teacher_disagreement_score":0.010964385,"about_ca_system_score_codex":0.0026920994,"about_ca_system_score_gemma":0.0021374912,"threshold_uncertainty_score":0.036679566},"labels":[],"label_agreement":null},{"id":"W2795727769","doi":"10.1007/s11590-018-1254-x","title":"Experiments on virtual private network design with concave capacity costs","year":2018,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Complexity and Algorithms in Graphs","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":"Polytechnique Montréal","funders":"","keywords":"Computational intelligence; Upper and lower bounds; Mathematical optimization; Regular polygon; Computer science; Network planning and design; Mathematics; Artificial intelligence; Computer network; Geometry","score_opus":0.03205164889556149,"score_gpt":0.2358185531798449,"score_spread":0.2037669042842834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795727769","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.85900104,0.0006656028,0.11630578,0.0018328025,0.00027013107,0.0005254549,0.0008214627,0.000711328,0.01986634],"genre_scores_gemma":[0.9752501,0.00009667334,0.022084014,0.00011709753,0.00003474947,0.0001230737,0.00019626105,0.00007400937,0.0020239218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99351305,0.0043033985,0.00017482734,0.0004694551,0.00066534715,0.0008738916],"domain_scores_gemma":[0.90861195,0.07976057,0.0024480904,0.004810732,0.0028309382,0.0015376924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008422566,0.0014234498,0.0014788643,0.0009658654,0.0009357071,0.001701878,0.002311479,0.0023997037,0.0076488047],"category_scores_gemma":[0.041560218,0.00070913264,0.00068789505,0.0010421193,0.002031598,0.004080856,0.001612715,0.0021715807,0.00042639705],"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.0026134134,0.0010175884,0.0009560393,0.0003039491,0.00007964643,0.000086461325,0.00007587171,0.95889074,0.0022859448,0.016360374,0.0031822152,0.014147724],"study_design_scores_gemma":[0.0006664053,0.00069535227,0.00033904958,0.00002128553,0.000045478908,0.000050473816,0.00007474302,0.9808421,0.0031839055,0.013484971,0.000575334,0.000020900065],"about_ca_topic_score_codex":0.0034602932,"about_ca_topic_score_gemma":0.002158618,"teacher_disagreement_score":0.008422566,"about_ca_system_score_codex":0.0031238876,"about_ca_system_score_gemma":0.0021716014,"threshold_uncertainty_score":0.044543326},"labels":[],"label_agreement":null},{"id":"W2798438706","doi":"10.4230/lipics.itcs.2019.52","title":"Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs","year":2018,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Property testing; Omega; Combinatorics; Discrete mathematics; Computer science; Computerized adaptive testing; Graph; Sampling (signal processing); Mathematics; Theoretical computer science; Statistics; Physics","score_opus":0.053714843414863066,"score_gpt":0.29322430157427337,"score_spread":0.2395094581594103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798438706","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.11904708,0.0014710766,0.8340054,0.006877303,0.00025928285,0.00058412354,0.0019856005,0.0059048985,0.02986517],"genre_scores_gemma":[0.79356444,0.00080304296,0.18213692,0.0033659742,0.00085316284,0.0013043691,0.0050019985,0.0022580805,0.010711929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9755004,0.0070840875,0.001358102,0.0039575584,0.008044144,0.0040556686],"domain_scores_gemma":[0.87871784,0.087801404,0.004509959,0.021046039,0.0047722645,0.0031524966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008073893,0.003541519,0.0027995806,0.0026209522,0.0021425905,0.008084303,0.008187771,0.0033402913,0.014194502],"category_scores_gemma":[0.058986668,0.0016290862,0.0055818018,0.0026671155,0.0050675706,0.020924376,0.007840766,0.010252428,0.0032053737],"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.004498348,0.0020825227,0.018991455,0.0015662438,0.0006523716,0.0009831176,0.0015756794,0.27389425,0.046659112,0.43254995,0.031087225,0.18545978],"study_design_scores_gemma":[0.00022028525,0.00035054213,0.0014364047,0.00008133666,0.00026806397,0.0004469815,0.00026501107,0.6590087,0.011199876,0.32265675,0.00397448,0.00009160393],"about_ca_topic_score_codex":0.0038532035,"about_ca_topic_score_gemma":0.0045887446,"teacher_disagreement_score":0.014194502,"about_ca_system_score_codex":0.00491083,"about_ca_system_score_gemma":0.00419466,"threshold_uncertainty_score":0.047485292},"labels":[],"label_agreement":null},{"id":"W2798465526","doi":"10.1098/rspa.2018.0283","title":"The idemetric property: when most distances are (almost) the same","year":2019,"lang":"en","type":"article","venue":"Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences","topic":"Complexity and Algorithms in Graphs","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":"Chinese Academy of Sciences; National Natural Science Foundation of China; Royal Society","keywords":"Property (philosophy); Mathematical proof; Modulo; Range (aeronautics); Routing (electronic design automation); Graph; Contrast (vision); Network topology","score_opus":0.011395338912771712,"score_gpt":0.2034069168962521,"score_spread":0.19201157798348037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798465526","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.101006925,0.0003865277,0.8682054,0.0020614958,0.00018310099,0.000109838955,0.00069858157,0.00040876458,0.026939258],"genre_scores_gemma":[0.85017276,0.00067299616,0.13729733,0.0012280712,0.00047319164,0.0004773634,0.00096897443,0.00035760202,0.00835172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942163,0.0015357789,0.00039279656,0.0018127688,0.0014319164,0.0006103162],"domain_scores_gemma":[0.9759311,0.013635662,0.0033838036,0.004659502,0.0015590454,0.000830869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037125826,0.0008718382,0.0013763017,0.001818433,0.0014683574,0.0031001847,0.0026053342,0.0026422672,0.007984568],"category_scores_gemma":[0.032251872,0.00083019095,0.0011627217,0.002219072,0.0054552555,0.015384073,0.004294404,0.003589879,0.001815833],"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.00032862052,0.00014485307,0.003409938,0.00026702535,0.00007521653,0.00080791436,0.0006149331,0.033118553,0.010772807,0.90752447,0.005452239,0.03748342],"study_design_scores_gemma":[0.00005062234,0.00017343089,0.0008895574,0.000045550307,0.000025194908,0.0015079014,0.0002778971,0.10037492,0.0043028994,0.88256556,0.009739884,0.000046699395],"about_ca_topic_score_codex":0.00055864366,"about_ca_topic_score_gemma":0.00045004737,"teacher_disagreement_score":0.007984568,"about_ca_system_score_codex":0.0009936573,"about_ca_system_score_gemma":0.00087956677,"threshold_uncertainty_score":0.026711047},"labels":[],"label_agreement":null},{"id":"W2802356468","doi":"10.1007/s00453-018-0444-3","title":"Impact of Knowledge on Election Time in Anonymous Networks","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","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":"Université du Québec en Outaouais","funders":"European Regional Development Fund; Natural Sciences and Engineering Research Council of Canada; Conseil Régional de Picardie; Université du Québec en Outaouais","keywords":"Leader election; Node (physics); Task (project management); Computer science; Computer network; Time complexity; Simple (philosophy); Port (circuit theory); A priori and a posteriori; Algorithm; Engineering","score_opus":0.011490235596683492,"score_gpt":0.28018300704392,"score_spread":0.2686927714472365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802356468","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.87298846,0.0019907244,0.07837225,0.012546569,0.00035344766,0.00007726934,0.0010030456,0.0006142163,0.032054037],"genre_scores_gemma":[0.99472517,0.00030657955,0.0024628956,0.00013088089,0.000101994694,0.000015783475,0.0001249503,0.000090484406,0.0020412165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943482,0.0021882355,0.00018605162,0.00089488,0.0009064186,0.0014761733],"domain_scores_gemma":[0.71307683,0.26119512,0.0077073937,0.0085994685,0.004145065,0.0052761617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075491555,0.0005763312,0.0017948236,0.0021772645,0.002478091,0.0052911504,0.0025734846,0.0030035388,0.011784805],"category_scores_gemma":[0.1186962,0.0006382959,0.0008126066,0.0021140974,0.0031288571,0.013066597,0.0024877058,0.0033191359,0.0007673315],"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.005365419,0.0012537483,0.022437552,0.0006541124,0.00033793756,0.00055619306,0.0012437982,0.56807655,0.0050925617,0.30065614,0.012337829,0.08198814],"study_design_scores_gemma":[0.00020700735,0.00034011147,0.0037171016,0.000051537885,0.00021857684,0.00030595134,0.00061195437,0.6887633,0.0034127515,0.30077535,0.0015293162,0.00006700085],"about_ca_topic_score_codex":0.0026439808,"about_ca_topic_score_gemma":0.0036505088,"teacher_disagreement_score":0.011784805,"about_ca_system_score_codex":0.0030367062,"about_ca_system_score_gemma":0.003405259,"threshold_uncertainty_score":0.039924204},"labels":[],"label_agreement":null},{"id":"W2806170931","doi":"10.1109/focs.2018.00090","title":"The Diameter of the Fractional Matching Polytope and Its Hardness Implications","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Combinatorics; Polytope; Mathematics; Birkhoff polytope; Matching (statistics); Path (computing); Graph; Shortest path problem; Uniform k 21 polytope; Discrete mathematics; Geometry; Computer science; Regular polygon","score_opus":0.03782070556246582,"score_gpt":0.2833110165183674,"score_spread":0.24549031095590157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806170931","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.5135076,0.0073458767,0.37263507,0.0137984855,0.00045124604,0.00016809604,0.0043937983,0.0008232925,0.0868765],"genre_scores_gemma":[0.92559844,0.0039208955,0.056390695,0.0008879292,0.0010130311,0.0003138697,0.0015631572,0.00030008837,0.010011866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980878,0.00028007332,0.00008558821,0.0008019726,0.00036871972,0.0003758777],"domain_scores_gemma":[0.98822623,0.008853714,0.00078638154,0.00083827233,0.00040557372,0.00088985654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012871572,0.000897551,0.0020229416,0.0014193848,0.0019471183,0.005054396,0.0025645213,0.002122837,0.007666898],"category_scores_gemma":[0.009651206,0.0009666898,0.0016836174,0.0018506161,0.0038193858,0.009176262,0.0034561255,0.0035267214,0.0009041301],"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.0007532857,0.0002538481,0.0058310833,0.0008176199,0.00012915472,0.00046319622,0.0009022676,0.12542343,0.008582876,0.8023379,0.01686225,0.03764301],"study_design_scores_gemma":[0.00008212234,0.00012714675,0.0031793616,0.00010574031,0.000053553274,0.0007764483,0.00037667164,0.16116509,0.0033684322,0.81630975,0.014388632,0.00006699416],"about_ca_topic_score_codex":0.001553946,"about_ca_topic_score_gemma":0.0007459348,"teacher_disagreement_score":0.007666898,"about_ca_system_score_codex":0.002261862,"about_ca_system_score_gemma":0.00082876714,"threshold_uncertainty_score":0.025648296},"labels":[],"label_agreement":null},{"id":"W2810907219","doi":"","title":"The Distributed Minimum Spanning Tree Problem","year":2018,"lang":"en","type":"article","venue":"Research Padua  Archive (University of Padua)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"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; European Commission; National Science Foundation","keywords":"Distributed minimum spanning tree; Minimum spanning tree; Spanning tree; Computer science; Distributed algorithm; Message passing; Node (physics); Graph; Kruskal's algorithm; Prim's algorithm; Distributed computing; Theoretical computer science; Algorithm; Combinatorics; Mathematics","score_opus":0.058349961650733986,"score_gpt":0.2970416321890664,"score_spread":0.2386916705383324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810907219","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.021282196,0.0056786467,0.93066466,0.004426364,0.00075567875,0.0003072404,0.0008714103,0.00048203586,0.03553175],"genre_scores_gemma":[0.5369363,0.013732706,0.4176806,0.001371913,0.001811561,0.0008864353,0.003648571,0.00035171397,0.023580203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799037,0.00065837684,0.00012008636,0.0005188936,0.00052981457,0.00018258947],"domain_scores_gemma":[0.99826413,0.0009430831,0.00016255862,0.0002999684,0.000197839,0.00013245195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013804408,0.0007194871,0.0012939402,0.00069414405,0.0011541261,0.0021163165,0.0019078953,0.0018453854,0.0052656904],"category_scores_gemma":[0.0054943403,0.00037381894,0.0006267184,0.002042131,0.0010135513,0.004802655,0.002406668,0.0015883929,0.0014423796],"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.00027474042,0.00019975824,0.0009261474,0.0009791488,0.00015728657,0.0003002017,0.00027878606,0.16671684,0.0033244533,0.5824752,0.046285804,0.19808166],"study_design_scores_gemma":[0.000114509465,0.00012404472,0.00039799043,0.0001043475,0.00006398637,0.00074157916,0.0002324333,0.24180989,0.0016424787,0.6692759,0.08546407,0.000028744427],"about_ca_topic_score_codex":0.0006121595,"about_ca_topic_score_gemma":0.00069054804,"teacher_disagreement_score":0.0052656904,"about_ca_system_score_codex":0.0010592474,"about_ca_system_score_gemma":0.0013196183,"threshold_uncertainty_score":0.017615438},"labels":[],"label_agreement":null},{"id":"W2886010892","doi":"10.1137/20m1356968","title":"When Do Gomory--Hu Subtrees Exist?","year":2022,"lang":"en","type":"preprint","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","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":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Computer science; Mathematics","score_opus":0.04253123021233643,"score_gpt":0.29356755749711866,"score_spread":0.2510363272847822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886010892","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.776328,0.0020515004,0.14314297,0.0051364233,0.00029234003,0.00022511228,0.0024174287,0.0010212762,0.06938487],"genre_scores_gemma":[0.9488608,0.0004090949,0.04036804,0.00077430275,0.000084179104,0.00008510294,0.0017955188,0.00027073402,0.007352267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993636,0.00006777306,0.000027796506,0.00019515002,0.00008216142,0.00026357934],"domain_scores_gemma":[0.99791056,0.00078577147,0.00033741683,0.00035938976,0.00021313292,0.0003936516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060931104,0.0003525077,0.0008957044,0.0005963169,0.001594032,0.00197986,0.00090405595,0.001568734,0.010782294],"category_scores_gemma":[0.006962602,0.00049528026,0.0005838906,0.00088922516,0.0012522867,0.005595781,0.0015128339,0.0013488701,0.0017930126],"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.00065639697,0.0001759734,0.017048962,0.000343703,0.00006612162,0.0018727904,0.002023977,0.0068934457,0.009596687,0.81543493,0.020290717,0.1255963],"study_design_scores_gemma":[0.00010894964,0.0001758069,0.0090661375,0.00021514238,0.00009211258,0.0028048088,0.0041637807,0.029341362,0.007795706,0.86899376,0.07717389,0.000068540314],"about_ca_topic_score_codex":0.0011357653,"about_ca_topic_score_gemma":0.0024088249,"teacher_disagreement_score":0.010782294,"about_ca_system_score_codex":0.0008619419,"about_ca_system_score_gemma":0.0005386457,"threshold_uncertainty_score":0.036070406},"labels":[],"label_agreement":null},{"id":"W2888136048","doi":"10.1145/3233547.3233717","title":"Choosing Non-redundant Representative Subsets Of Protein Sequence Data Sets Using Submodular Optimization","year":2018,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Submodular set function; Computer science; Optimization problem; Disjoint sets; Selection (genetic algorithm); Data mining; Sequence (biology); Redundancy (engineering); Preprocessor; Set (abstract data type); Mathematics; Algorithm; Mathematical optimization; Artificial intelligence; Biology; Combinatorics","score_opus":0.16087800647083061,"score_gpt":0.368667685748764,"score_spread":0.2077896792779334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888136048","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.020406978,0.0004392368,0.9770422,0.00037114086,0.000025739699,0.00018167963,0.00023056213,0.0004599303,0.0008424986],"genre_scores_gemma":[0.2710332,0.00050336233,0.72251576,0.0007604003,0.000106403546,0.0011101714,0.0018232968,0.0002914063,0.0018560976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769163,0.0012370646,0.000102511185,0.00043141577,0.00038413092,0.00015317708],"domain_scores_gemma":[0.9954828,0.0033478143,0.0003413766,0.00024829354,0.00040168635,0.00017803641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005285216,0.0020964553,0.003197242,0.0015881155,0.0006582211,0.0016644947,0.002106021,0.0014479617,0.0018427058],"category_scores_gemma":[0.0072220783,0.0009245225,0.0017982338,0.0019654292,0.0012863176,0.0017401966,0.0019113092,0.0020899205,0.0005361215],"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.00017942197,0.0001857213,0.0011481785,0.00024841644,0.00016459034,0.00011318733,0.00009254588,0.91361,0.003409973,0.0076452256,0.002915256,0.07028747],"study_design_scores_gemma":[0.000021205085,0.00006911745,0.0001096487,0.000011541007,0.000013558887,0.00002247991,0.000022039729,0.991104,0.0006440689,0.007487461,0.00048673956,0.000008188327],"about_ca_topic_score_codex":0.0020916078,"about_ca_topic_score_gemma":0.0024989746,"teacher_disagreement_score":0.005285216,"about_ca_system_score_codex":0.0013344943,"about_ca_system_score_gemma":0.0026227415,"threshold_uncertainty_score":0.02795124},"labels":[],"label_agreement":null},{"id":"W2889518945","doi":"10.1016/j.tcs.2018.08.024","title":"Constant query time (1 + ϵ)-approximate distance oracle for planar graphs","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Oracle; Combinatorics; Mathematics; Binary logarithm; Time complexity; Graph; Constant (computer programming); Discrete mathematics; Computer science","score_opus":0.013018652046001375,"score_gpt":0.2536365564653466,"score_spread":0.24061790441934522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889518945","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.3313466,0.006178779,0.5703755,0.021660544,0.0008535778,0.00073535374,0.012092525,0.014708141,0.042049024],"genre_scores_gemma":[0.81153756,0.0015448191,0.16110232,0.0016511228,0.00071046053,0.00039477783,0.0069107763,0.0010626453,0.015085499],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99049497,0.0015158054,0.0006432681,0.0024392232,0.0030416423,0.0018651144],"domain_scores_gemma":[0.97036463,0.017044783,0.0017210573,0.007772183,0.0017104201,0.0013870465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036632018,0.0020830906,0.0046790545,0.0017550138,0.001902581,0.00668294,0.008853763,0.004426484,0.020740319],"category_scores_gemma":[0.027302133,0.001197408,0.0019042578,0.0058520213,0.002724134,0.02001591,0.0058450154,0.0064164945,0.0048967195],"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.012210315,0.0024094896,0.0109779285,0.0037031714,0.0006593425,0.00058611634,0.0012134777,0.28303328,0.038034726,0.15925325,0.085656464,0.4022624],"study_design_scores_gemma":[0.001356014,0.0006042723,0.0034404828,0.00013174883,0.000584368,0.0012743354,0.00075943506,0.64995766,0.019046972,0.3080487,0.014632228,0.00016382012],"about_ca_topic_score_codex":0.0056664865,"about_ca_topic_score_gemma":0.009139726,"teacher_disagreement_score":0.020740319,"about_ca_system_score_codex":0.0064939493,"about_ca_system_score_gemma":0.00647329,"threshold_uncertainty_score":0.06938332},"labels":[],"label_agreement":null},{"id":"W2897123632","doi":"10.5555/3310435.3310596","title":"Short cycles via low-diameter decompositions","year":2019,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","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; University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Graph; Running time; Undirected graph; Time complexity; Disjoint sets; Discrete mathematics; Algorithm","score_opus":0.010860816644116018,"score_gpt":0.2537178479733224,"score_spread":0.2428570313292064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897123632","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.036947966,0.00039325503,0.95377713,0.00032764566,0.000064504144,0.00016923546,0.0004431405,0.0018717685,0.0060054427],"genre_scores_gemma":[0.30299315,0.0006058382,0.6826014,0.0003095976,0.00010836353,0.00044963733,0.0020622655,0.000999502,0.009870203],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869955,0.00026375407,0.000088980974,0.0003305603,0.00043255603,0.00018459931],"domain_scores_gemma":[0.9961462,0.0013308721,0.0003443467,0.0014068832,0.0004674476,0.00030431847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008336866,0.0012579719,0.0009892079,0.0017376115,0.00080649194,0.0016483772,0.0016443728,0.00084894185,0.007611313],"category_scores_gemma":[0.006526329,0.00088254834,0.0010773912,0.0016365096,0.000980905,0.0041509517,0.003387822,0.0019712707,0.002637351],"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.0008710199,0.00026295424,0.0021443055,0.0005494635,0.00012365919,0.0003220981,0.00086970173,0.19137628,0.040056158,0.25855583,0.020437526,0.48443103],"study_design_scores_gemma":[0.000107138185,0.00017378738,0.00042254446,0.00010215001,0.000049013604,0.00031899285,0.00017813986,0.5795663,0.018218817,0.3803138,0.020498823,0.00005050353],"about_ca_topic_score_codex":0.0012025698,"about_ca_topic_score_gemma":0.0017711275,"teacher_disagreement_score":0.007611313,"about_ca_system_score_codex":0.00091971626,"about_ca_system_score_gemma":0.000692063,"threshold_uncertainty_score":0.02546233},"labels":[],"label_agreement":null},{"id":"W2897485334","doi":"10.1016/j.tcs.2018.10.015","title":"On extensions of the deterministic online model for bipartite matching and max-sat","year":2018,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Mathematics; Deterministic algorithm; Submodular set function; Monotone polygon; Binary logarithm; Matching (statistics); Combinatorics; Approximation algorithm; Simple (philosophy); Online algorithm; Discrete mathematics; Greedy algorithm; Algorithm; Graph","score_opus":0.02794348708303992,"score_gpt":0.290670138379534,"score_spread":0.2627266512964941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897485334","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.07048134,0.0022842302,0.85387135,0.0067553534,0.0006258209,0.0003631956,0.0015683221,0.0009879998,0.06306238],"genre_scores_gemma":[0.7081681,0.0031401005,0.23660381,0.0036239217,0.0021019154,0.000933998,0.0031975983,0.0012154209,0.041015256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99138004,0.0045070522,0.00035218784,0.0014890274,0.0010605875,0.0012111712],"domain_scores_gemma":[0.961237,0.026544923,0.0019371916,0.0070468825,0.0014681936,0.0017656606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008635842,0.0024535027,0.0037115118,0.0022293017,0.0028398037,0.005904211,0.00849321,0.004413276,0.019680198],"category_scores_gemma":[0.03315513,0.0019893649,0.005040175,0.004495654,0.004379003,0.023500971,0.010137716,0.010746005,0.0019925865],"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.0004940207,0.00039354115,0.00077082636,0.00022188993,0.00008185294,0.00012916423,0.00024606034,0.09698513,0.00047001563,0.8763553,0.008294996,0.015557242],"study_design_scores_gemma":[0.000052850726,0.00003558864,0.00012328575,0.00003131248,0.000030293459,0.000052336763,0.00004792639,0.23418161,0.00013432652,0.7630229,0.002265926,0.000021708081],"about_ca_topic_score_codex":0.0063263555,"about_ca_topic_score_gemma":0.010656547,"teacher_disagreement_score":0.019680198,"about_ca_system_score_codex":0.005985463,"about_ca_system_score_gemma":0.0051681357,"threshold_uncertainty_score":0.06583685},"labels":[],"label_agreement":null},{"id":"W2899019281","doi":"10.4230/lipics.itcs.2020.22","title":"Distribution-Free Testing of Linear Functions on ℝⁿ","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Function (biology); Business; Biology; Evolutionary biology","score_opus":0.12103650175288105,"score_gpt":0.20058192696216043,"score_spread":0.07954542520927937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899019281","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.73613733,0.0007875018,0.2484057,0.003426694,0.00010460913,0.00018757823,0.001957369,0.0028756664,0.0061175553],"genre_scores_gemma":[0.9636643,0.00015600605,0.032067463,0.00042686897,0.000118587996,0.00014104918,0.0011961942,0.00018003375,0.0020495418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992851,0.001448812,0.0004452085,0.0021644626,0.0019185679,0.001171898],"domain_scores_gemma":[0.94628793,0.04294845,0.0029646012,0.004527747,0.0020908383,0.0011804026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032709015,0.0012416502,0.0017893269,0.0009071584,0.0010186082,0.0024972467,0.0032796504,0.0014830508,0.0031314252],"category_scores_gemma":[0.030979859,0.0006130256,0.0020684188,0.0017002505,0.0029898966,0.00847643,0.0030046771,0.0034354778,0.0007319225],"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.0073880623,0.0011888382,0.06325454,0.0015545468,0.00065122027,0.0019046686,0.0015177351,0.3840883,0.05167075,0.20541318,0.01302993,0.2683382],"study_design_scores_gemma":[0.00023405137,0.0010735665,0.0045352704,0.00007234038,0.00015933435,0.00094316044,0.00034226885,0.72342604,0.027468394,0.23888278,0.0027584475,0.000104439525],"about_ca_topic_score_codex":0.0027020152,"about_ca_topic_score_gemma":0.0024064174,"teacher_disagreement_score":0.0032796504,"about_ca_system_score_codex":0.002816806,"about_ca_system_score_gemma":0.002126873,"threshold_uncertainty_score":0.020437479},"labels":[],"label_agreement":null},{"id":"W2900444034","doi":"10.1145/3431922","title":"Uniform, Integral, and Feasible Proofs for the Determinant Identities","year":2021,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"National Natural Science Foundation of China","keywords":"Mathematical proof; Mathematics; Axiom; Bounded function; Discrete mathematics; Polynomial; Class (philosophy); Proof complexity; Algebra over a field; Pure mathematics; Computer science","score_opus":0.03872084732340131,"score_gpt":0.27971918533816037,"score_spread":0.24099833801475906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900444034","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.033660892,0.0006239942,0.92359316,0.0029307962,0.00028901518,0.0001981676,0.0007188163,0.0009005016,0.037084594],"genre_scores_gemma":[0.61529577,0.0010067908,0.37130967,0.0015257141,0.0006265012,0.0004292675,0.000984091,0.00034180062,0.008480475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954331,0.0011982864,0.0003021326,0.0006509436,0.0017606154,0.00065495324],"domain_scores_gemma":[0.9805001,0.012664621,0.00094222155,0.0033746515,0.0019907153,0.00052769476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043368544,0.000791455,0.0005808876,0.0014015656,0.0019377179,0.0040570037,0.0030399011,0.0011269898,0.009787545],"category_scores_gemma":[0.023081703,0.00086525065,0.001502051,0.001434314,0.0038669307,0.010700404,0.006201048,0.005976485,0.001360803],"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.00006322955,0.0000598711,0.00026903884,0.00014113191,0.000015343301,0.00009311336,0.00026672453,0.001419135,0.0019169684,0.97714967,0.0027701575,0.015835637],"study_design_scores_gemma":[0.000041252704,0.000042311247,0.0002654707,0.000060663,0.000039315546,0.00022615519,0.0000988602,0.013410195,0.0075144744,0.9680858,0.010190678,0.000024697143],"about_ca_topic_score_codex":0.0007153616,"about_ca_topic_score_gemma":0.00092136645,"teacher_disagreement_score":0.009787545,"about_ca_system_score_codex":0.0025969332,"about_ca_system_score_gemma":0.0022499273,"threshold_uncertainty_score":0.03274256},"labels":[],"label_agreement":null},{"id":"W2903710486","doi":"10.1145/3459096","title":"Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"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":"Simons Institute for the Theory of Computing, University of California Berkeley; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; National Science Foundation","keywords":"Rounding; Hyperplane; Semidefinite programming; Mathematics; Approximation algorithm; Constraint satisfaction problem; Mathematical optimization; Brownian motion; Constraint (computer-aided design); Computer science; Combinatorics","score_opus":0.03982695069133185,"score_gpt":0.27301035340206586,"score_spread":0.233183402710734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903710486","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.005044668,0.0012549486,0.9872104,0.0006341564,0.00015981881,0.000053781394,0.0000444145,0.00025523096,0.005342598],"genre_scores_gemma":[0.2724125,0.005107436,0.7133961,0.0009418232,0.0006210188,0.0003791734,0.00022840471,0.00037214166,0.006541419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966434,0.0012205574,0.00018267446,0.0004750472,0.0012491167,0.00022908971],"domain_scores_gemma":[0.99538594,0.003235612,0.00037188377,0.00051095366,0.0002925473,0.00020315166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002700624,0.0015649467,0.0016849467,0.0013426917,0.0011809535,0.0024000427,0.0018040661,0.0016175552,0.0050845747],"category_scores_gemma":[0.009701415,0.0007561341,0.0021157567,0.0033035951,0.0024966425,0.002401867,0.0031439804,0.0069149956,0.001009839],"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.0000748609,0.00010088538,0.00029538345,0.00034617315,0.000047846643,0.00012531917,0.00021634273,0.29239124,0.0034892582,0.6126296,0.0046322243,0.0856509],"study_design_scores_gemma":[0.000028188539,0.00006035462,0.00010966532,0.000052316827,0.00001132939,0.00009723159,0.000034611214,0.73419267,0.0012736447,0.25832677,0.0057880683,0.000025108207],"about_ca_topic_score_codex":0.0017390174,"about_ca_topic_score_gemma":0.0014408763,"teacher_disagreement_score":0.0050845747,"about_ca_system_score_codex":0.0015988218,"about_ca_system_score_gemma":0.0015650466,"threshold_uncertainty_score":0.017009616},"labels":[],"label_agreement":null},{"id":"W2903949188","doi":"10.1007/s00453-018-0484-8","title":"Information Complexity of the AND Function in the Two-Party and Multi-party Settings","year":2018,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","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":"Israel Science Foundation","keywords":"Theory of computation; Generalization; Function (biology); Computational complexity theory; Characterization (materials science); Protocol (science); Information theory; Average-case complexity; Descriptive complexity theory","score_opus":0.027498376083014142,"score_gpt":0.2541167767715941,"score_spread":0.22661840068857997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903949188","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.3230057,0.0033645614,0.59695613,0.024712365,0.00030957165,0.00040930152,0.0035224506,0.00049306586,0.04722676],"genre_scores_gemma":[0.94467443,0.0020392502,0.037879832,0.0007787772,0.00072074897,0.00045566834,0.0010970768,0.00020425952,0.012149887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909793,0.003948297,0.00035704434,0.0012910366,0.0017719145,0.0016525212],"domain_scores_gemma":[0.90630436,0.08009946,0.0037622037,0.005390136,0.0024005945,0.0020432442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00871299,0.0014886836,0.003920562,0.002373849,0.002566846,0.008913839,0.005175587,0.0050195465,0.010613805],"category_scores_gemma":[0.04933189,0.001148657,0.002388685,0.003322502,0.0054945746,0.022150885,0.0049709803,0.0067931833,0.00084444805],"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.00049147423,0.0001698415,0.001380165,0.00027644925,0.00009475803,0.00017637678,0.00036504003,0.078942485,0.0005631245,0.89895487,0.006924426,0.0116610415],"study_design_scores_gemma":[0.00006142312,0.000030396965,0.00045258814,0.000036443605,0.000043226453,0.000111024085,0.00008025491,0.18325321,0.00031164824,0.8146654,0.0009158732,0.000038569724],"about_ca_topic_score_codex":0.0025655192,"about_ca_topic_score_gemma":0.0018552137,"teacher_disagreement_score":0.010613805,"about_ca_system_score_codex":0.0072094677,"about_ca_system_score_gemma":0.0051887454,"threshold_uncertainty_score":0.05230856},"labels":[],"label_agreement":null},{"id":"W2905953446","doi":"10.1007/978-3-030-18126-0_2","title":"A Local Search 4/3-approximation Algorithm for the Minimum 3-path Partition Problem","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"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":"Disjoint sets; Partition (number theory); Approximation algorithm; Vertex cover; Partition problem; Combinatorics; Vertex (graph theory); Cover (algebra); Graph partition; Path (computing); Mathematics; Set cover problem; Computer science; Graph; Algorithm; Discrete mathematics; Set (abstract data type)","score_opus":0.026756811572567152,"score_gpt":0.25850266820173423,"score_spread":0.23174585662916708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905953446","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.060599517,0.0011407218,0.91113096,0.0010047326,0.0002623052,0.00043778718,0.00084705785,0.0048545906,0.01972228],"genre_scores_gemma":[0.12290929,0.00030984613,0.8634433,0.00031967575,0.00009540178,0.0005821539,0.0018760428,0.00054940005,0.009914957],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992964,0.00014443335,0.00003509044,0.00016466231,0.0002162776,0.00014299304],"domain_scores_gemma":[0.9990501,0.00047239123,0.000069697584,0.0002045845,0.00010792049,0.000095313815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008391897,0.0013862158,0.0020750496,0.001381845,0.0010345909,0.0015197146,0.0035090048,0.0022121978,0.017314782],"category_scores_gemma":[0.002996512,0.00078936445,0.0013374526,0.0026749594,0.0007186853,0.002710126,0.0026240316,0.0027690306,0.0039055545],"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.0015357438,0.00085836236,0.0009348196,0.00057666947,0.000117778916,0.00020295194,0.0003789765,0.25750136,0.01240265,0.041286554,0.044970125,0.639234],"study_design_scores_gemma":[0.00037463423,0.00024719458,0.0003876303,0.000051614024,0.000055204087,0.0001600793,0.000112784845,0.9593514,0.002885957,0.029906683,0.0064406754,0.00002616023],"about_ca_topic_score_codex":0.0049055708,"about_ca_topic_score_gemma":0.0072296793,"teacher_disagreement_score":0.017314782,"about_ca_system_score_codex":0.002009333,"about_ca_system_score_gemma":0.0022420571,"threshold_uncertainty_score":0.057923734},"labels":[],"label_agreement":null},{"id":"W2908273849","doi":"10.1007/s10878-018-00372-z","title":"An improved approximation algorithm for the minimum 3-path partition problem","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":24,"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":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Approximation algorithm; Disjoint sets; Partition (number theory); Partition problem; Vertex cover; Theory of computation; Vertex (graph theory); Set cover problem; Discrete mathematics; Graph; Algorithm; Set (abstract data type); Computer science","score_opus":0.013819542233862584,"score_gpt":0.25850726343418323,"score_spread":0.24468772120032065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908273849","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.06413227,0.0011403451,0.91223747,0.0012701865,0.0003893454,0.00051406585,0.0010687326,0.0036063963,0.015641153],"genre_scores_gemma":[0.17577207,0.0004183947,0.8145596,0.00037880367,0.00017169263,0.0004991542,0.0023406146,0.0004185284,0.0054412726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986351,0.0002642126,0.00006988783,0.00031703003,0.00042028102,0.00029346754],"domain_scores_gemma":[0.99787176,0.0010667345,0.00013789434,0.00047644894,0.0002746227,0.0001725169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010951562,0.0019043211,0.002415342,0.0019513987,0.0012926382,0.0025630093,0.004551685,0.0025145642,0.013609539],"category_scores_gemma":[0.0054475563,0.0009171753,0.001657647,0.00350954,0.0007966308,0.0042015873,0.0029436368,0.0032448033,0.0026090764],"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.0016258325,0.0010223035,0.0019106468,0.0006051971,0.00019529919,0.00024083606,0.00035189476,0.3959942,0.008471934,0.039355025,0.035209432,0.51501745],"study_design_scores_gemma":[0.00027197614,0.00013547785,0.00041106076,0.000030765998,0.000057394096,0.00015106543,0.00008032042,0.9662437,0.0013335056,0.027144836,0.0041172756,0.000022644788],"about_ca_topic_score_codex":0.0074129365,"about_ca_topic_score_gemma":0.010913326,"teacher_disagreement_score":0.013609539,"about_ca_system_score_codex":0.0025836194,"about_ca_system_score_gemma":0.003854671,"threshold_uncertainty_score":0.045528412},"labels":[],"label_agreement":null},{"id":"W2912359042","doi":"10.1145/1806689.1806768","title":"QIP = PSPACE","year":2010,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":57,"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; Perimeter Institute","funders":"Centre for Quantum Technologies; National Research Foundation Singapore; National Science Foundation","keywords":"PSPACE; Mathematics; Multiplicative function; Class (philosophy); Mathematical proof; Computational complexity theory; Discrete mathematics; Computer science; Combinatorics; Algorithm","score_opus":0.00786021869120312,"score_gpt":0.2268176467357108,"score_spread":0.21895742804450768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912359042","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.05206738,0.00056604226,0.79964006,0.008121349,0.00033852572,0.00042020666,0.002943566,0.0027473432,0.13315554],"genre_scores_gemma":[0.74813986,0.0009298907,0.2058467,0.00501411,0.00073943456,0.0009797201,0.0059225354,0.0012996233,0.031128114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99491125,0.000632019,0.00027478184,0.0016010078,0.0017848765,0.0007961251],"domain_scores_gemma":[0.98592526,0.008457709,0.0008949148,0.002253019,0.0017225144,0.0007465551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023871604,0.00080357614,0.0010538242,0.0008962226,0.0021198571,0.004215986,0.0017194542,0.0010711199,0.01614482],"category_scores_gemma":[0.011137389,0.0006709928,0.0018821992,0.0010769941,0.0030621325,0.0079228,0.0057920087,0.007656826,0.0025003345],"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.00016475971,0.00013357034,0.0008753348,0.0005181815,0.00006689376,0.000116988784,0.000328027,0.009292481,0.0028124596,0.9422457,0.01337337,0.03007216],"study_design_scores_gemma":[0.000043666598,0.000044624005,0.0003308194,0.000027381137,0.000029855208,0.00017096294,0.00006930417,0.030462151,0.0045135384,0.9489777,0.015313063,0.000016985792],"about_ca_topic_score_codex":0.0018427364,"about_ca_topic_score_gemma":0.0014362151,"teacher_disagreement_score":0.01614482,"about_ca_system_score_codex":0.0017287025,"about_ca_system_score_gemma":0.0026308293,"threshold_uncertainty_score":0.054009795},"labels":[],"label_agreement":null},{"id":"W2912789966","doi":"10.48550/arxiv.1902.02459","title":"On Mean Estimation for General Norms with Statistical Queries","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Normed vector space; Distribution (mathematics); Combinatorics; Oracle; Norm (philosophy); Mathematics; Space (punctuation); Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.061229172841652656,"score_gpt":0.20077742118817232,"score_spread":0.13954824834651966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912789966","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.07411227,0.0018756703,0.9130733,0.005970025,0.00010346493,0.00012789405,0.00071285147,0.0008272937,0.0031972432],"genre_scores_gemma":[0.6853535,0.002125341,0.2998661,0.0018214588,0.0012089451,0.0006127748,0.0025089765,0.00079350284,0.0057094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9854652,0.0071153753,0.00061156566,0.0029845024,0.0027751,0.0010482315],"domain_scores_gemma":[0.80653036,0.17066099,0.006999749,0.009986968,0.003644894,0.0021770147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01368104,0.0020785993,0.003999106,0.002335098,0.0019543087,0.00555112,0.006328886,0.0047449297,0.0042729303],"category_scores_gemma":[0.10555739,0.0012627611,0.0021669269,0.0040443325,0.0061478475,0.020236136,0.0068300497,0.007381444,0.0010270454],"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.0014651662,0.0004323395,0.0069581787,0.000674085,0.0002940434,0.00043004923,0.0012758541,0.38950822,0.0041612987,0.5206709,0.009685748,0.06444421],"study_design_scores_gemma":[0.000045067925,0.00006825124,0.0004914183,0.000024331528,0.000023271374,0.00012671996,0.00010552686,0.6467071,0.000890228,0.35067222,0.00081445166,0.00003142194],"about_ca_topic_score_codex":0.0042461674,"about_ca_topic_score_gemma":0.0023087163,"teacher_disagreement_score":0.01368104,"about_ca_system_score_codex":0.0054742903,"about_ca_system_score_gemma":0.0029460492,"threshold_uncertainty_score":0.072353125},"labels":[],"label_agreement":null},{"id":"W2914551285","doi":"10.1007/978-3-642-33090-2_64","title":"Succinct Posets","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Partially ordered set; Reachability; Transitive closure; Combinatorics; Transitive reduction; Mathematics; Oracle; Data structure; Transitive relation; Discrete mathematics; Directed graph; Graph; Computer science; Line graph; Voltage graph","score_opus":0.02168753748394431,"score_gpt":0.24535246687479478,"score_spread":0.22366492939085048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914551285","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.02708019,0.0038868827,0.37830395,0.003932983,0.0012501706,0.00032169305,0.0068088546,0.0023017467,0.5761136],"genre_scores_gemma":[0.40552655,0.0072531444,0.16512714,0.001851974,0.0011332557,0.00076172844,0.022077087,0.0021940887,0.39407492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893683,0.00019711569,0.000074349795,0.00021065866,0.00047587385,0.00010518744],"domain_scores_gemma":[0.9990275,0.00040812566,0.00005666158,0.00027072415,0.00016179003,0.00007507915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006299432,0.001446498,0.0008809067,0.0015458371,0.0011414444,0.0037038273,0.0012940002,0.0009989953,0.056904215],"category_scores_gemma":[0.002565219,0.0009777071,0.00086819316,0.002381963,0.0016448465,0.008637801,0.0034147028,0.0042922413,0.012815119],"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.00007627143,0.000059583166,0.000104285995,0.00028688458,0.000013449555,0.000078488236,0.00031719348,0.0046534487,0.0017072924,0.8822905,0.028519372,0.08189326],"study_design_scores_gemma":[0.000016771668,0.000024696947,0.00009337923,0.00010399439,0.000012480319,0.00014164778,0.000078278776,0.0031210845,0.0015800002,0.89494425,0.09986707,0.000016376918],"about_ca_topic_score_codex":0.00057203084,"about_ca_topic_score_gemma":0.0011885444,"teacher_disagreement_score":0.056904215,"about_ca_system_score_codex":0.0010899963,"about_ca_system_score_gemma":0.00071997335,"threshold_uncertainty_score":0.19036353},"labels":[],"label_agreement":null},{"id":"W2914834722","doi":"10.1145/3305270","title":"Distribution Testing Lower Bounds via Reductions from Communication Complexity","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"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":"Mathematical proof; Mathematics; Simple (philosophy); Measure (data warehouse); Connection (principal bundle); Distribution (mathematics); Upper and lower bounds; Property testing; Reduction (mathematics); Communication complexity; Identity (music); Discrete mathematics; Interpolation (computer graphics); Operator (biology); Sample (material); Combinatorics; Computer science; Mathematical analysis","score_opus":0.039012390185488285,"score_gpt":0.2696844975486102,"score_spread":0.23067210736312188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914834722","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.019560428,0.0006200604,0.957035,0.0034191266,0.00013278701,0.00017925486,0.00037181063,0.00047071473,0.018210815],"genre_scores_gemma":[0.69009256,0.0014925789,0.28793645,0.0025226735,0.0014692852,0.002010894,0.0011379985,0.0012067291,0.012130839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98579955,0.004267417,0.0005708757,0.0022077763,0.0056424476,0.0015118761],"domain_scores_gemma":[0.89832985,0.08687904,0.0025022104,0.0072630206,0.0035910904,0.0014347105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010289287,0.0026191142,0.0026478702,0.0032355464,0.0019840468,0.005789091,0.0055557042,0.0028065704,0.01044376],"category_scores_gemma":[0.059963267,0.0011246894,0.0049177036,0.0029657797,0.006844166,0.01903731,0.009789989,0.015203298,0.001405636],"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.0001324703,0.00014038595,0.0010350842,0.00028189644,0.00005970916,0.00015444781,0.0003811319,0.05114324,0.0028541626,0.91732836,0.003494941,0.022994278],"study_design_scores_gemma":[0.000025290201,0.000060146107,0.0002843032,0.00004429798,0.000027435635,0.00008515345,0.000049796345,0.1972938,0.0021681983,0.7974148,0.002516735,0.00002997174],"about_ca_topic_score_codex":0.0016722517,"about_ca_topic_score_gemma":0.001073047,"teacher_disagreement_score":0.01044376,"about_ca_system_score_codex":0.0058111018,"about_ca_system_score_gemma":0.0030020946,"threshold_uncertainty_score":0.054415584},"labels":[],"label_agreement":null},{"id":"W2915860730","doi":"10.1007/s00453-020-00785-5","title":"Travelling on Graphs with Small Highway Dimension","year":2021,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","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":"Deutsche Forschungsgemeinschaft","keywords":"Dimension (graph theory); Steiner tree problem; Theory of computation; Combinatorics; Mathematics; Graph; Polynomial; Approximation algorithm; Scheme (mathematics); Time complexity; Tree (set theory); Polynomial-time approximation scheme; Shortest path problem; Metric dimension; Discrete mathematics; Pathwidth; Line graph; Algorithm","score_opus":0.025253173343176734,"score_gpt":0.21924888036828835,"score_spread":0.19399570702511162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915860730","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.84394556,0.0011417868,0.109916046,0.0036600942,0.00016786612,0.00014890605,0.0020616148,0.00055705896,0.038400933],"genre_scores_gemma":[0.94348985,0.0012111476,0.036442835,0.0004074175,0.00018091028,0.00020133826,0.0016267044,0.00023230317,0.016207542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993426,0.00021518668,0.000030317618,0.00014867398,0.00009853195,0.00016471924],"domain_scores_gemma":[0.99016285,0.0068067163,0.0009201748,0.0008246065,0.00045652915,0.00082910206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006153745,0.0006205051,0.0013649955,0.0021760408,0.0018869665,0.0032399844,0.0019565085,0.0021095513,0.011470062],"category_scores_gemma":[0.009282851,0.0008034376,0.0009242134,0.0023740896,0.0018467797,0.006353933,0.0024353757,0.00193628,0.001064164],"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.00054053246,0.00016770468,0.004138659,0.0005305826,0.00013728,0.00034725433,0.00055659836,0.13521867,0.0043008826,0.8151775,0.018536884,0.020347495],"study_design_scores_gemma":[0.00010896615,0.000041047988,0.001501776,0.00004542264,0.00006306141,0.00020395842,0.00038924755,0.25587094,0.0012008596,0.73541725,0.005124801,0.000032705535],"about_ca_topic_score_codex":0.0039943685,"about_ca_topic_score_gemma":0.0046475288,"teacher_disagreement_score":0.011470062,"about_ca_system_score_codex":0.0019000535,"about_ca_system_score_gemma":0.00092379213,"threshold_uncertainty_score":0.038371146},"labels":[],"label_agreement":null},{"id":"W2916420924","doi":"10.4230/lipics.icalp.2019.78","title":"Towards Optimal Depth Reductions for Syntactically Multilinear Circuits","year":2019,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Department of Science and Technology, Ministry of Science and Technology, India; Tata Institute of Fundamental Research","keywords":"Exponent; Multilinear map; Combinatorics; Upper and lower bounds; Omega; Mathematics; Degree (music); Polynomial; Discrete mathematics; Mathematical analysis; Physics; Pure mathematics; Quantum mechanics","score_opus":0.043345682677481366,"score_gpt":0.3074808794513182,"score_spread":0.26413519677383684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916420924","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.20105426,0.0013678718,0.74852157,0.0031452666,0.0001997571,0.00030864307,0.0009857904,0.0062363762,0.038180362],"genre_scores_gemma":[0.71289235,0.0007296508,0.27145496,0.001465113,0.00023682916,0.00050092814,0.0012308061,0.001390099,0.010099167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956909,0.00085480924,0.00019965014,0.0008176659,0.0015033988,0.0009335731],"domain_scores_gemma":[0.99193454,0.0051495936,0.00044070103,0.0017372594,0.0005067163,0.00023123244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018721535,0.0014395323,0.0014264196,0.0010698808,0.0012647869,0.0026681025,0.0028512026,0.0014735521,0.009573776],"category_scores_gemma":[0.0117301745,0.000926421,0.0025271813,0.0014382785,0.002470506,0.0072576744,0.006614929,0.005431284,0.002130127],"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.0015049527,0.0004417619,0.0021266155,0.0014590954,0.00016365788,0.00040373817,0.0010855647,0.0961401,0.05785173,0.62394804,0.018001905,0.19687286],"study_design_scores_gemma":[0.00026795693,0.00020058063,0.000611294,0.00011678774,0.00018217463,0.00021751426,0.00017537968,0.27821976,0.027803177,0.6785534,0.013580083,0.00007189322],"about_ca_topic_score_codex":0.0017814466,"about_ca_topic_score_gemma":0.0038356725,"teacher_disagreement_score":0.009573776,"about_ca_system_score_codex":0.0037338396,"about_ca_system_score_gemma":0.0026582894,"threshold_uncertainty_score":0.032027483},"labels":[],"label_agreement":null},{"id":"W2919078879","doi":"10.1145/3404860","title":"Circuit Lower Bounds for MCSP from Local Pseudorandom Generators","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Pseudorandom number generator; Upper and lower bounds; Boolean function; Mathematics; Combinatorics; Discrete mathematics; Truth table; Boolean circuit; Binary logarithm; Function (biology); Parity function; Algorithm; Boolean expression","score_opus":0.04122917108285918,"score_gpt":0.2584555555495299,"score_spread":0.21722638446667075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919078879","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.10480941,0.006869063,0.7765556,0.011544372,0.00067758246,0.0006569628,0.0043926546,0.0061751977,0.08831916],"genre_scores_gemma":[0.6886507,0.00429642,0.25942478,0.006221229,0.0019971274,0.002298899,0.007987565,0.0028530043,0.026270317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99254465,0.0012246981,0.0003870577,0.0017061401,0.0028750056,0.0012625781],"domain_scores_gemma":[0.9634252,0.02795037,0.0012659437,0.0045712763,0.0018666376,0.00092052214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029494225,0.0025533657,0.002229184,0.0022327069,0.0017457844,0.0054519395,0.0051704827,0.002682007,0.026038138],"category_scores_gemma":[0.029801814,0.0012333167,0.0037821252,0.003043318,0.003170414,0.01573203,0.007122686,0.010850061,0.004064511],"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.001525461,0.0006350498,0.004588429,0.0018397922,0.00027468667,0.0005392862,0.00065628404,0.19468409,0.02529432,0.5828365,0.0438448,0.14328128],"study_design_scores_gemma":[0.0002197925,0.00023907083,0.00093628676,0.00020301582,0.00022651529,0.00033726677,0.000111900205,0.34537238,0.009841553,0.62923175,0.013202821,0.00007774777],"about_ca_topic_score_codex":0.0022853732,"about_ca_topic_score_gemma":0.004160211,"teacher_disagreement_score":0.026038138,"about_ca_system_score_codex":0.0051268847,"about_ca_system_score_gemma":0.0033813159,"threshold_uncertainty_score":0.08710623},"labels":[],"label_agreement":null},{"id":"W2940838630","doi":"10.1016/j.cie.2019.04.040","title":"An extension of adaptive multi-start tabu search for the maximum quasi-clique problem","year":2019,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Complexity and Algorithms in Graphs","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":"National Research Council Canada","funders":"","keywords":"Clique problem; Tabu search; Clique; Extension (predicate logic); Clique percolation method; Mathematics; Cardinality (data modeling); Benchmark (surveying); Heuristic; Algorithm; Mathematical optimization; Graph; Computer science; Combinatorics; Complex network; Pathwidth; Line graph; Data mining","score_opus":0.07725742536160617,"score_gpt":0.2692865235304725,"score_spread":0.19202909816886632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940838630","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.03292263,0.00060425105,0.9499504,0.00038611356,0.00030083788,0.00027950745,0.0003024232,0.0011168331,0.014136957],"genre_scores_gemma":[0.30734113,0.00045738215,0.68337876,0.00033176257,0.0002472482,0.00033248647,0.0005641246,0.00042569856,0.006921407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911815,0.00036587467,0.00002658308,0.00016326719,0.00021785333,0.00010830274],"domain_scores_gemma":[0.99851364,0.0007973342,0.00007307385,0.00027233938,0.00025488136,0.000088770335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012095799,0.0005729992,0.0011418349,0.001161166,0.0007562501,0.0008616881,0.002788429,0.0011839928,0.00811758],"category_scores_gemma":[0.004230623,0.00041628254,0.0012331229,0.0018561153,0.0006845865,0.0015347222,0.0014466537,0.0015115193,0.0010764411],"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.0004978431,0.0005106737,0.001182671,0.00043889077,0.00013274048,0.00013972084,0.0001603159,0.6090277,0.0056489105,0.070761785,0.013767631,0.29773107],"study_design_scores_gemma":[0.00004318964,0.00007080125,0.00022999496,0.000017875396,0.000016630775,0.00003506598,0.000009355392,0.9806973,0.00048294713,0.015896244,0.0024912157,0.0000093887475],"about_ca_topic_score_codex":0.0043879473,"about_ca_topic_score_gemma":0.0054404647,"teacher_disagreement_score":0.00811758,"about_ca_system_score_codex":0.00071235094,"about_ca_system_score_gemma":0.0018165038,"threshold_uncertainty_score":0.027156055},"labels":[],"label_agreement":null},{"id":"W2942961654","doi":"10.4230/lipics.icalp.2019.35","title":"Query-To-Communication Lifting for BPP Using Inner Product","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Simons Institute for the Theory of Computing, University of California Berkeley; Israel Science Foundation","keywords":"Gadget; Mathematical proof; Computer science; Mathematics; Search engine indexing; Entropy (arrow of time); Product (mathematics); Theoretical computer science; Discrete mathematics; Combinatorics; Information retrieval","score_opus":0.02559971745356479,"score_gpt":0.2813312082238702,"score_spread":0.25573149077030544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942961654","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.017811866,0.00028827766,0.96769744,0.0015385016,0.00027633118,0.00030265254,0.00033365548,0.0012098904,0.010541512],"genre_scores_gemma":[0.543629,0.0010855747,0.4322964,0.0024492561,0.0012357134,0.0014782066,0.0009967685,0.0016043533,0.015224779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9878578,0.0022961851,0.0009331256,0.0024201083,0.004504409,0.001988306],"domain_scores_gemma":[0.9677614,0.017328752,0.0015183487,0.009875142,0.002372963,0.0011434709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075573204,0.0018865858,0.0030466528,0.0016610285,0.002857902,0.0063722446,0.0037368345,0.0026926424,0.013171133],"category_scores_gemma":[0.031027082,0.0015478639,0.005096957,0.0024675287,0.0056248214,0.01685411,0.015385548,0.012041213,0.0037431724],"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.00030820226,0.0002042522,0.0004913911,0.00034807896,0.00006722527,0.00026853412,0.00069309806,0.017856894,0.008276937,0.9311845,0.005530871,0.034769993],"study_design_scores_gemma":[0.000072559895,0.00014655727,0.00021632612,0.000065137676,0.00008072701,0.00024459814,0.0000878717,0.115422964,0.005809336,0.87181073,0.0059668957,0.00007636355],"about_ca_topic_score_codex":0.0013272656,"about_ca_topic_score_gemma":0.00079365494,"teacher_disagreement_score":0.013171133,"about_ca_system_score_codex":0.0031164126,"about_ca_system_score_gemma":0.004308831,"threshold_uncertainty_score":0.04406184},"labels":[],"label_agreement":null},{"id":"W2945389025","doi":"","title":"Stronger Linear Programming Relaxations of Max-Cut","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Combinatorics; Random graph; Linear programming; Maximum cut; Discrete mathematics; Inequality; Mathematical optimization; Graph; Mathematical analysis","score_opus":0.04279685047705614,"score_gpt":0.2500863312182562,"score_spread":0.20728948074120004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945389025","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.062536694,0.0040532793,0.85714287,0.007247103,0.000681143,0.00032838152,0.0014665424,0.00053616345,0.06600771],"genre_scores_gemma":[0.6409577,0.00370383,0.32705885,0.00452986,0.002441143,0.00084358855,0.0024258804,0.0006881972,0.017350877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933442,0.0027180118,0.00025337594,0.0012015686,0.0014208228,0.0010618798],"domain_scores_gemma":[0.9678972,0.024621895,0.0030062818,0.0019725314,0.0013430513,0.001159057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008916355,0.0022965544,0.001995549,0.0014450048,0.001526787,0.0042558033,0.00361,0.0021849514,0.014446712],"category_scores_gemma":[0.035816997,0.0015007171,0.0027670944,0.002583709,0.0027006932,0.010719223,0.004135702,0.011284291,0.0015067474],"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.00077337166,0.0004773692,0.0011822316,0.0009084198,0.00020181974,0.00029156113,0.00046614287,0.22558692,0.0030827017,0.7101344,0.017442876,0.039452244],"study_design_scores_gemma":[0.00014287968,0.00020844497,0.00058160524,0.00015313731,0.000060709674,0.0002476025,0.00020233393,0.44015142,0.0014042549,0.54465085,0.012139457,0.000057320343],"about_ca_topic_score_codex":0.0020618888,"about_ca_topic_score_gemma":0.0024635354,"teacher_disagreement_score":0.014446712,"about_ca_system_score_codex":0.003041167,"about_ca_system_score_gemma":0.0016646881,"threshold_uncertainty_score":0.048329055},"labels":[],"label_agreement":null},{"id":"W2946229976","doi":"10.1016/j.cca.2019.03.1564","title":"Improved sample quality and decreased turnaround time by implementing BD Barricor™ plasma tubes on Beckman-Coulter AU5800 and DXI","year":2019,"lang":"en","type":"article","venue":"Clinica Chimica Acta","topic":"Complexity and Algorithms in Graphs","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":"Centre Hospitalier de l’Université de Montréal","funders":"","keywords":"Vertex cover; Combinatorics; Minimum weight; Vertex (graph theory); Mathematics; Approximation algorithm; Graph; Submodular set function; Weight function; Vertex connectivity; Discrete mathematics; Statistics","score_opus":0.030005969423616975,"score_gpt":0.3113355950685631,"score_spread":0.2813296256449461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946229976","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.06936583,0.004877177,0.874758,0.0029588402,0.0025694876,0.0019377787,0.0031465618,0.026963886,0.013422551],"genre_scores_gemma":[0.059987076,0.0020703878,0.9134746,0.0016762596,0.00041363278,0.002105163,0.0034824298,0.0028407804,0.01394964],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9944193,0.0016028385,0.0005802766,0.001371548,0.0015681422,0.00045797272],"domain_scores_gemma":[0.9945201,0.0020173562,0.00034940627,0.000665607,0.0022136567,0.00023392147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045336196,0.0023686793,0.0015786887,0.0032910223,0.0011969295,0.002925491,0.0024442773,0.0020222208,0.032622896],"category_scores_gemma":[0.011182491,0.00192343,0.0009747382,0.0021784357,0.001019161,0.0013316015,0.0015866637,0.0031041484,0.011479473],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019750777,0.00062175223,0.0087478785,0.001275656,0.000282694,0.00038887074,0.0006316072,0.001413609,0.8005717,0.009307145,0.029290596,0.1454934],"study_design_scores_gemma":[0.00035039292,0.0010772244,0.012605517,0.00028117673,0.00069336133,0.0018120767,0.00018490542,0.022370337,0.85924757,0.0046644043,0.09645531,0.00025772743],"about_ca_topic_score_codex":0.0028023738,"about_ca_topic_score_gemma":0.0058922865,"teacher_disagreement_score":0.032622896,"about_ca_system_score_codex":0.00081104395,"about_ca_system_score_gemma":0.0025038277,"threshold_uncertainty_score":0.109134495},"labels":[],"label_agreement":null},{"id":"W2947949186","doi":"10.48550/arxiv.1905.11635","title":"Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Mathematical proof; Soundness; Operator (biology); Upper and lower bounds; Completeness (order theory); Gas meter prover; Mathematics; Discrete mathematics; Value (mathematics); Complexity class; Class (philosophy); Combinatorics; Gap theorem; Time complexity; Computer science","score_opus":0.07326202935955649,"score_gpt":0.22702933477742474,"score_spread":0.15376730541786826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947949186","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.13751902,0.0009453511,0.8374633,0.0032869268,0.00014499655,0.0002646138,0.00043821844,0.0016697652,0.018267862],"genre_scores_gemma":[0.83311796,0.0006099602,0.15766376,0.0007945861,0.00028787594,0.00052841543,0.0006826899,0.00061987055,0.00569488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9905323,0.0024229744,0.00042672458,0.0022187277,0.0028542168,0.0015449665],"domain_scores_gemma":[0.93841225,0.048893884,0.0022136273,0.007523979,0.0017918433,0.001164288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065096086,0.0019481713,0.002706736,0.0015171928,0.0016037395,0.005942689,0.0051121814,0.0022890356,0.008624101],"category_scores_gemma":[0.04504062,0.00088649604,0.0034429498,0.0014767409,0.005550912,0.014771376,0.006723432,0.009088167,0.0014828779],"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.0008765469,0.0003323136,0.003488346,0.0006819293,0.00023115374,0.00030936778,0.00096167397,0.31574064,0.007957016,0.6254234,0.004158887,0.03983873],"study_design_scores_gemma":[0.00005093057,0.00006746206,0.00028842673,0.000044065215,0.000042443557,0.000057254587,0.0000568558,0.58599216,0.0027998367,0.40969634,0.000872865,0.000031438187],"about_ca_topic_score_codex":0.002973121,"about_ca_topic_score_gemma":0.0031769006,"teacher_disagreement_score":0.008624101,"about_ca_system_score_codex":0.006328634,"about_ca_system_score_gemma":0.0047150296,"threshold_uncertainty_score":0.04591763},"labels":[],"label_agreement":null},{"id":"W2949074211","doi":"10.48550/arxiv.1705.02385","title":"The Salesman's Improved Tours for Fundamental Classes","year":2017,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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","funders":"","keywords":"Travelling salesman problem; Metric (unit); Conjecture; Combinatorics; Linear programming relaxation; Class (philosophy); Upper and lower bounds; Mathematics; Integer (computer science); Relaxation (psychology); Discrete mathematics; Integer programming; Computer science; Mathematical optimization; Artificial intelligence","score_opus":0.12536529880018904,"score_gpt":0.22334406803306686,"score_spread":0.09797876923287782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949074211","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.30881742,0.0034499462,0.4240764,0.007309585,0.0008442235,0.000362616,0.0020800452,0.0013802161,0.2516795],"genre_scores_gemma":[0.74845624,0.0021334842,0.19497663,0.0013339637,0.00077000144,0.0003235781,0.0028712836,0.000745936,0.04838883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992712,0.0001323448,0.000021489577,0.00017170157,0.00021930931,0.00018401453],"domain_scores_gemma":[0.99805117,0.00091183186,0.00019308037,0.00034122454,0.00018404558,0.0003186577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000874259,0.0009416959,0.0008650932,0.0013750179,0.0013119209,0.0025449197,0.0020940646,0.0012403004,0.0136391185],"category_scores_gemma":[0.0078090946,0.0005502913,0.0013563359,0.0011136698,0.0018103506,0.0045748935,0.0030108786,0.006567307,0.0014962694],"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.00014055529,0.000092922644,0.00061186636,0.00016757817,0.000028795508,0.0000703854,0.00027058995,0.051121965,0.0019927141,0.88087475,0.019088114,0.045539804],"study_design_scores_gemma":[0.00003340094,0.0000738096,0.00073003815,0.00006145992,0.000016353611,0.00008553821,0.000107312284,0.2602628,0.0007101262,0.7190563,0.018836591,0.000026250396],"about_ca_topic_score_codex":0.0057875486,"about_ca_topic_score_gemma":0.006628633,"teacher_disagreement_score":0.0136391185,"about_ca_system_score_codex":0.0033620081,"about_ca_system_score_gemma":0.0015705953,"threshold_uncertainty_score":0.045627415},"labels":[],"label_agreement":null},{"id":"W2949074990","doi":"10.48550/arxiv.1012.2291","title":"Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"McGill University; Université de Montréal","funders":"","keywords":"Mathematics; Upper and lower bounds; Min entropy; Entropy (arrow of time); Discrete mathematics; Bitwise operation; Binary logarithm; Quantum; Decoding methods; Combinatorics; Entropy rate; Statistical physics; Joint quantum entropy; Principle of maximum entropy; Statistics; Quantum mechanics; Mathematical analysis; Physics; Computer science","score_opus":0.1536613408288277,"score_gpt":0.2483281426718979,"score_spread":0.09466680184307019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949074990","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.067588024,0.0029217468,0.89626104,0.0038568398,0.000233273,0.000117075186,0.0004959306,0.00051372574,0.028012315],"genre_scores_gemma":[0.82178026,0.0024056588,0.16240425,0.0013478247,0.00083636073,0.00060457666,0.00065379613,0.00057503395,0.009392303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993901,0.0020353585,0.00026495455,0.0009198521,0.0020212457,0.0008576422],"domain_scores_gemma":[0.9491303,0.03867423,0.001849336,0.0060700634,0.0029352503,0.0013408656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059454525,0.0016314674,0.001706472,0.002776953,0.0016312731,0.0038937812,0.0035173148,0.002130701,0.005232566],"category_scores_gemma":[0.042362865,0.0009196833,0.0015280996,0.0026216416,0.005786152,0.012485425,0.005567007,0.006954947,0.0009288723],"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.00026349563,0.00009771353,0.0009890962,0.00021979884,0.000055261873,0.00009376366,0.00024099741,0.064504206,0.0043598353,0.90781426,0.0023018417,0.019059686],"study_design_scores_gemma":[0.00002584893,0.000056317713,0.0004503102,0.00005637102,0.000026972977,0.00009182912,0.000036687692,0.32355094,0.005219253,0.66832924,0.002107223,0.000048906866],"about_ca_topic_score_codex":0.00087850646,"about_ca_topic_score_gemma":0.0010405267,"teacher_disagreement_score":0.0059454525,"about_ca_system_score_codex":0.0041879513,"about_ca_system_score_gemma":0.0017302354,"threshold_uncertainty_score":0.03144294},"labels":[],"label_agreement":null},{"id":"W2949563967","doi":"10.1007/978-3-030-17953-3_21","title":"An Efficient Characterization of Submodular Spanning Tree Games","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Submodular set function; Shapley value; Characterization (materials science); Game tree; Computer science; Convexity; Mathematical economics; Spanning tree; Tree (set theory); Cooperative game theory; Time complexity; Core (optical fiber); Mathematics; Game theory; Regular polygon; Combinatorics; Sequential game; Economics","score_opus":0.016765882172677958,"score_gpt":0.257172427004477,"score_spread":0.24040654483179905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949563967","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.22680686,0.00079125696,0.7037059,0.003451796,0.00021908447,0.0008671341,0.003317335,0.0012754775,0.059565093],"genre_scores_gemma":[0.8230034,0.0009964795,0.15092082,0.0010125493,0.00052035425,0.0009197539,0.0040890975,0.0006241956,0.017913342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965037,0.0009929546,0.0001901803,0.0007589604,0.0008872367,0.00066688017],"domain_scores_gemma":[0.9891879,0.0071754926,0.00081391446,0.0010954756,0.0008024522,0.00092476344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023321041,0.0019771107,0.002478795,0.0021503658,0.0014323893,0.0058868174,0.004617372,0.002276619,0.012448569],"category_scores_gemma":[0.016225256,0.0011364915,0.0020852508,0.0035244967,0.0018189291,0.010216034,0.004027561,0.005462934,0.0015548],"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.00043685807,0.0005150476,0.0020688486,0.0003982447,0.00011119294,0.00022514093,0.0005456993,0.052921128,0.0072233495,0.8674479,0.01596055,0.05214612],"study_design_scores_gemma":[0.000053923155,0.00009198208,0.0004756327,0.000037023787,0.00003919104,0.00015478127,0.00011414956,0.25740638,0.0011020242,0.737249,0.0032487917,0.000027039148],"about_ca_topic_score_codex":0.0017246668,"about_ca_topic_score_gemma":0.002229726,"teacher_disagreement_score":0.012448569,"about_ca_system_score_codex":0.0030366366,"about_ca_system_score_gemma":0.0027975328,"threshold_uncertainty_score":0.041644633},"labels":[],"label_agreement":null},{"id":"W2949571619","doi":"10.48550/arxiv.1209.3759","title":"The Maximum Traveling Salesman Problem with Submodular Rewards","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Submodular set function; Oracle; Travelling salesman problem; Combinatorics; Graph; Mathematics; Set (abstract data type); Function (biology); Computer science; Path (computing); Discrete mathematics; Mathematical optimization","score_opus":0.06363039629362593,"score_gpt":0.17586027185452957,"score_spread":0.11222987556090364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949571619","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.14732006,0.001442508,0.8306248,0.0028986798,0.00017338074,0.00022649737,0.0010714883,0.0010050602,0.015237556],"genre_scores_gemma":[0.6267762,0.0010098574,0.36049452,0.00043270897,0.00017627826,0.00031833,0.0010820228,0.0003287514,0.009381329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922895,0.00031387465,0.000025139623,0.00020541281,0.000105006984,0.00012156166],"domain_scores_gemma":[0.998055,0.0014002344,0.00020807437,0.00012848526,0.0000798542,0.0001284479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010419755,0.0011302625,0.0014716422,0.00061014784,0.000715645,0.001618042,0.0015609331,0.0014968943,0.0051247454],"category_scores_gemma":[0.0052955113,0.0005335827,0.00097111525,0.0014927393,0.00084312825,0.0035001591,0.001161806,0.0016852876,0.0007068501],"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.00037702871,0.0001597986,0.0009496506,0.00047815367,0.00012132989,0.00024215267,0.00017182631,0.8190449,0.0019387425,0.11181395,0.009560931,0.055141613],"study_design_scores_gemma":[0.000047495523,0.0000822041,0.0002654755,0.000021284382,0.000020894433,0.000108209315,0.00006826127,0.8826164,0.00071031996,0.11325897,0.0027840296,0.000016350474],"about_ca_topic_score_codex":0.0022580363,"about_ca_topic_score_gemma":0.0023109722,"teacher_disagreement_score":0.0051247454,"about_ca_system_score_codex":0.0015370366,"about_ca_system_score_gemma":0.0012874422,"threshold_uncertainty_score":0.017143965},"labels":[],"label_agreement":null},{"id":"W2949581528","doi":"10.1007/s00446-015-0245-8","title":"Linear-in- $$\\varDelta $$ Δ lower bounds in the LOCAL model","year":2015,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"Helsingin Yliopisto","keywords":"Logarithm; Graph; Upper and lower bounds; Matching (statistics); Degree (music); Theory of computation; Strength of a graph; Range (aeronautics); Graph bandwidth","score_opus":0.0492260071130564,"score_gpt":0.2853473280723429,"score_spread":0.2361213209592865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949581528","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.060283635,0.007999639,0.7549086,0.03340473,0.0015361245,0.00025069,0.0037790395,0.003818648,0.13401884],"genre_scores_gemma":[0.75790703,0.0050783744,0.15205005,0.008220504,0.0024699748,0.0010502294,0.0036521622,0.0055840337,0.06398772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925591,0.0018909242,0.00022108163,0.0015797123,0.0017190645,0.0020301917],"domain_scores_gemma":[0.9473547,0.037753694,0.0015687614,0.008429783,0.002558161,0.002334942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057884813,0.0033644952,0.0032864064,0.0027848391,0.00337049,0.006995354,0.01008425,0.0035233665,0.03860527],"category_scores_gemma":[0.036054764,0.001287915,0.002723888,0.0042222366,0.0044593597,0.022590049,0.009875914,0.014111934,0.008146487],"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.0014021687,0.0009651104,0.0030723868,0.0011440516,0.00021359372,0.00031506535,0.00062918966,0.17643137,0.004143095,0.63639313,0.09560758,0.079683125],"study_design_scores_gemma":[0.00007860803,0.00006423998,0.00041861436,0.00009882295,0.0000962988,0.00011595321,0.00013924726,0.23612241,0.0015408865,0.7554516,0.005835036,0.000038240192],"about_ca_topic_score_codex":0.004488717,"about_ca_topic_score_gemma":0.01008237,"teacher_disagreement_score":0.03860527,"about_ca_system_score_codex":0.007900179,"about_ca_system_score_gemma":0.0058047636,"threshold_uncertainty_score":0.12914753},"labels":[],"label_agreement":null},{"id":"W2949842650","doi":"","title":"Multivariate Submodular Optimization.","year":2019,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Complexity and Algorithms in Graphs","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":"Submodular set function; Matroid; Monotone polygon; Combinatorics; Mathematics; Disjoint sets; Discrete mathematics; Approximation algorithm; Greedy algorithm; Maximization; Mathematical optimization","score_opus":0.029781064638663552,"score_gpt":0.28081359571158415,"score_spread":0.2510325310729206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949842650","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.0056824675,0.0036505936,0.96521795,0.0018381081,0.0002420945,0.00012762751,0.0008402124,0.0005271139,0.02187382],"genre_scores_gemma":[0.38900042,0.008529601,0.5625518,0.0025481617,0.0010359854,0.0008114039,0.0024473597,0.00078288664,0.032292347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884534,0.00051456044,0.000039930128,0.00023625816,0.00024806935,0.00011596081],"domain_scores_gemma":[0.99849904,0.0009506246,0.00016431452,0.00018952371,0.00010216727,0.00009448909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002175526,0.0019789708,0.0015533882,0.0007705024,0.00050265575,0.0016757374,0.0013720543,0.0014567288,0.012020923],"category_scores_gemma":[0.004752299,0.0005996787,0.0011124918,0.0021258034,0.0013568857,0.0027594077,0.002108946,0.0034813276,0.0022294298],"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.00014472925,0.00019943628,0.0007359574,0.0007247458,0.00018076292,0.000119173266,0.00010877311,0.33626872,0.0017503083,0.43725657,0.054874297,0.16763662],"study_design_scores_gemma":[0.00003881431,0.00007997981,0.00028266478,0.000060545593,0.000027931103,0.000109379405,0.000043254593,0.6212183,0.0006370581,0.35618103,0.02130219,0.000018842404],"about_ca_topic_score_codex":0.0017512044,"about_ca_topic_score_gemma":0.0032441267,"teacher_disagreement_score":0.012020923,"about_ca_system_score_codex":0.0016283923,"about_ca_system_score_gemma":0.001587132,"threshold_uncertainty_score":0.040213943},"labels":[],"label_agreement":null},{"id":"W2949889202","doi":"10.1007/s10107-019-01394-z","title":"The matching augmentation problem: a $$\\frac{7}{4}$$-approximation algorithm","year":2019,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Approximation algorithm; Matching (statistics); Zero (linguistics); Cover (algebra); Approx; Reduction (mathematics)","score_opus":0.014087274261470255,"score_gpt":0.25610141803367553,"score_spread":0.2420141437722053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949889202","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.03522851,0.0010255983,0.9129176,0.004349742,0.00062675955,0.00048041783,0.0010178597,0.0032543626,0.041099176],"genre_scores_gemma":[0.17410478,0.0007170699,0.79870224,0.0010599126,0.0005317954,0.00080511306,0.0018094076,0.00080010673,0.021469563],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785185,0.000639916,0.000084663465,0.0005630756,0.00048973976,0.00037078786],"domain_scores_gemma":[0.9966864,0.001720317,0.00020599083,0.0008557912,0.00025181353,0.0002797113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023588382,0.0021852166,0.0025644994,0.0014843069,0.001569463,0.0042425278,0.0064730477,0.004182566,0.021286026],"category_scores_gemma":[0.010083369,0.001264605,0.0027454318,0.003543714,0.0016395226,0.008453498,0.005208518,0.0059808576,0.0046455706],"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.0014628938,0.0014048521,0.001631614,0.00057521206,0.00014489742,0.00020658184,0.00030185253,0.16967313,0.0042483895,0.30921897,0.068228744,0.44290292],"study_design_scores_gemma":[0.00021656934,0.00010878269,0.0003217646,0.000088342844,0.0000802075,0.0001951197,0.00009072705,0.7134029,0.0018137412,0.27137396,0.012278672,0.000029208384],"about_ca_topic_score_codex":0.0033733884,"about_ca_topic_score_gemma":0.0039247675,"teacher_disagreement_score":0.021286026,"about_ca_system_score_codex":0.002845521,"about_ca_system_score_gemma":0.004365382,"threshold_uncertainty_score":0.071208894},"labels":[],"label_agreement":null},{"id":"W2949995719","doi":"10.48550/arxiv.1408.0828","title":"Pre-Reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Combinatorics; Discrete mathematics; Mathematics; Disjoint sets; Deterministic finite automaton; Graph; Algorithm; Finite-state machine","score_opus":0.06393270973561822,"score_gpt":0.1876688978864426,"score_spread":0.12373618815082436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949995719","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.2943638,0.0014824184,0.6807216,0.0071337773,0.0001574041,0.00023416073,0.0028943408,0.0023078253,0.01070479],"genre_scores_gemma":[0.8427605,0.000765602,0.1449363,0.0010872146,0.00024217312,0.0003482195,0.0033118683,0.00063240883,0.0059156707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956915,0.0012352164,0.00028137965,0.0014957185,0.0007698601,0.0005263438],"domain_scores_gemma":[0.96983844,0.023751775,0.0009845442,0.003865908,0.00077614887,0.00078314805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037792318,0.0015663265,0.002306346,0.0008370577,0.0011270306,0.0028676754,0.0038344718,0.0033198376,0.006494592],"category_scores_gemma":[0.029379975,0.001261813,0.0034077081,0.0013768047,0.0031199965,0.010092145,0.0032937652,0.007759817,0.0006896053],"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.0012070951,0.00083839084,0.009187288,0.00090340455,0.00028321272,0.00033316683,0.00095171476,0.6649309,0.0038954716,0.19403273,0.015953504,0.10748319],"study_design_scores_gemma":[0.00008712222,0.00014321432,0.0008090626,0.000036803427,0.000054311284,0.00014065314,0.00016519308,0.6544087,0.0022905443,0.33974826,0.0020913214,0.000024826752],"about_ca_topic_score_codex":0.0048435107,"about_ca_topic_score_gemma":0.005578502,"teacher_disagreement_score":0.006494592,"about_ca_system_score_codex":0.0032458093,"about_ca_system_score_gemma":0.0026005732,"threshold_uncertainty_score":0.023550153},"labels":[],"label_agreement":null},{"id":"W2950188498","doi":"10.48550/arxiv.math/0112257","title":"The computational complexity of the local postage stamp problem","year":2001,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Complexity and Algorithms in Graphs","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":"Integer (computer science); Combinatorics; Mathematics; Postage Stamps; Time complexity; Discrete mathematics; Turing; Computational complexity theory; Set (abstract data type); Computer science; Algorithm","score_opus":0.07116568959009759,"score_gpt":0.2758229870363237,"score_spread":0.2046572974462261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950188498","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.66448265,0.0020010113,0.24649882,0.01926696,0.00032024225,0.00031224173,0.005330964,0.0019178387,0.059869174],"genre_scores_gemma":[0.9281897,0.0009026956,0.051808164,0.0006945976,0.00038942372,0.0003064856,0.0034428409,0.00034731854,0.013918768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805486,0.0005515554,0.00010138201,0.00055939547,0.0002846628,0.00044815528],"domain_scores_gemma":[0.99071854,0.007258454,0.00057892763,0.0008186685,0.00030760776,0.0003177927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001131675,0.0007688679,0.0013154686,0.0005709392,0.001489538,0.005218445,0.0021280919,0.0019910936,0.009429932],"category_scores_gemma":[0.009461997,0.00058530364,0.0015554271,0.0014167704,0.002186033,0.008744057,0.0021510413,0.0034286592,0.0012879004],"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.0020591686,0.0005099921,0.0058258646,0.0012487648,0.00026287694,0.00059026695,0.0010392182,0.38275447,0.007998891,0.42621034,0.05263289,0.118867256],"study_design_scores_gemma":[0.0001496154,0.00006331799,0.0011895681,0.00003944009,0.00008032168,0.00019936672,0.00030406652,0.35019615,0.0032466424,0.6386953,0.0057932385,0.000042917927],"about_ca_topic_score_codex":0.0040412354,"about_ca_topic_score_gemma":0.0030170656,"teacher_disagreement_score":0.009429932,"about_ca_system_score_codex":0.0025045339,"about_ca_system_score_gemma":0.002245519,"threshold_uncertainty_score":0.031546235},"labels":[],"label_agreement":null},{"id":"W2950333589","doi":"10.48550/arxiv.1303.4897","title":"Maximum Edge-Disjoint Paths in $k$-sums of Graphs","year":2013,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Disjoint sets; Enhanced Data Rates for GSM Evolution; Combinatorics; Mathematics; Computer science; Telecommunications","score_opus":0.01771570312206111,"score_gpt":0.22504832219765056,"score_spread":0.20733261907558945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950333589","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.5547176,0.0008414162,0.42736623,0.00088868546,0.00006448793,0.000070614224,0.000306638,0.00072573463,0.015018617],"genre_scores_gemma":[0.8725162,0.00042160283,0.12069728,0.00013196238,0.000056048724,0.00007594951,0.00032748823,0.00019271042,0.0055807275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992536,0.00018158066,0.00004662381,0.00023070062,0.00015456855,0.00013295942],"domain_scores_gemma":[0.9976261,0.0014915833,0.00031066992,0.00021351074,0.00014619189,0.00021198925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082545803,0.00083162414,0.00094793376,0.00086289964,0.0009755373,0.0015725617,0.0013244995,0.00065451785,0.0026304228],"category_scores_gemma":[0.0064664944,0.00045702045,0.0009823157,0.0013507104,0.0013526897,0.0038691338,0.001707956,0.001434937,0.0003498426],"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.0008917754,0.0002110017,0.004945709,0.0006158555,0.00015570002,0.00058344007,0.0014113463,0.5302866,0.014670907,0.3446523,0.004016843,0.09755842],"study_design_scores_gemma":[0.000025290792,0.00011756069,0.0011235053,0.000048518854,0.000053213495,0.00048416498,0.00030846728,0.56918406,0.0054092817,0.4175746,0.0056420406,0.00002932927],"about_ca_topic_score_codex":0.0013330329,"about_ca_topic_score_gemma":0.0012766364,"teacher_disagreement_score":0.0026304228,"about_ca_system_score_codex":0.0012223823,"about_ca_system_score_gemma":0.0003913601,"threshold_uncertainty_score":0.008869052},"labels":[],"label_agreement":null},{"id":"W2950392347","doi":"","title":"A Second Look at Counting Triangles in Graph Streams","year":2014,"lang":"en","type":"preprint","venue":"Warwick Research Archive Portal (University of Warwick)","topic":"Complexity and Algorithms in Graphs","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":"Combinatorics; Streaming algorithm; Mathematics; Space (punctuation); Graph; Constant (computer programming); Discrete mathematics; Upper and lower bounds; Computer science; Mathematical analysis","score_opus":0.04329996312900055,"score_gpt":0.27491724017738917,"score_spread":0.2316172770483886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950392347","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.048515186,0.0025662212,0.91345173,0.010143855,0.001113956,0.00021251797,0.0007220899,0.00281066,0.0204638],"genre_scores_gemma":[0.32681862,0.0026378275,0.63457596,0.0043937177,0.0030818966,0.0003281324,0.0019443508,0.0021960367,0.024023497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99422944,0.0013219891,0.00029859337,0.0016180413,0.0018873392,0.0006446394],"domain_scores_gemma":[0.9725112,0.015982935,0.00096040714,0.006680819,0.002788521,0.0010761477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033185412,0.0014695667,0.0021583121,0.0024156142,0.0017285963,0.0043397504,0.0046794056,0.0029422713,0.021865748],"category_scores_gemma":[0.023867294,0.00090295286,0.0023284236,0.0037285148,0.0038299067,0.031000745,0.0045921784,0.00916349,0.0032825323],"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.0029467233,0.0008088796,0.006370151,0.0012019821,0.0003098726,0.0006897138,0.0014903704,0.06731615,0.036374096,0.53046644,0.04929976,0.3027259],"study_design_scores_gemma":[0.00024011107,0.00073219964,0.0015952125,0.00020081784,0.00018717193,0.0010811007,0.00056556566,0.35699832,0.031710576,0.55041057,0.05612458,0.0001537551],"about_ca_topic_score_codex":0.003477983,"about_ca_topic_score_gemma":0.0024182114,"teacher_disagreement_score":0.021865748,"about_ca_system_score_codex":0.002357965,"about_ca_system_score_gemma":0.0012674979,"threshold_uncertainty_score":0.07314825},"labels":[],"label_agreement":null},{"id":"W2950427777","doi":"10.4230/lipics.approx-random.2017.37","title":"Sample-Based High-Dimensional Convexity Testing","year":2017,"lang":"en","type":"preprint","venue":"Dagstuhl Research Online Publication Server","topic":"Complexity and Algorithms in Graphs","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":"National Science Foundation","keywords":"Combinatorics; Monotonic function; Constant (computer programming); Characterization (materials science); Mathematics; Constant function; Partition (number theory); Property testing; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.3264675902913521,"score_gpt":0.4352698718725549,"score_spread":0.10880228158120281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950427777","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.09224707,0.00037671666,0.89788884,0.0014383231,0.000089054614,0.00021681783,0.0006561152,0.002332042,0.0047550634],"genre_scores_gemma":[0.7525291,0.0001744344,0.24146198,0.00044536294,0.00015669233,0.00032290994,0.0020821353,0.00035901935,0.0024683466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902159,0.003831798,0.00062176434,0.0019473861,0.0026013344,0.0007818641],"domain_scores_gemma":[0.91912514,0.05475325,0.004106475,0.015664684,0.004592613,0.0017577418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006832929,0.0017636879,0.002517416,0.0015125514,0.001429109,0.0037349907,0.005049545,0.0026369873,0.005000272],"category_scores_gemma":[0.054972183,0.0008613442,0.0021114121,0.0018448761,0.004106242,0.007186215,0.005944785,0.0043182806,0.0017650528],"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.0029153223,0.0007833216,0.03488061,0.000617904,0.00045226765,0.0011650312,0.00059646205,0.4599245,0.015936008,0.17451382,0.016598629,0.29161608],"study_design_scores_gemma":[0.000055209628,0.00014877302,0.0015726119,0.00001999135,0.000024208066,0.00033765982,0.00008803731,0.90387774,0.0058648516,0.08712952,0.0008506767,0.00003077084],"about_ca_topic_score_codex":0.0014982976,"about_ca_topic_score_gemma":0.0015264694,"teacher_disagreement_score":0.006832929,"about_ca_system_score_codex":0.0020304276,"about_ca_system_score_gemma":0.0020967207,"threshold_uncertainty_score":0.03613639},"labels":[],"label_agreement":null},{"id":"W2950544775","doi":"10.1137/1.9781611973105.112","title":"Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":29,"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":"Subadditivity; Partially ordered set; Combinatorics; Bipartite graph; Mathematics; Graph; Discrete mathematics; Matching (statistics); Line graph; Clique-width; Voltage graph","score_opus":0.03013979455064652,"score_gpt":0.26043619659048856,"score_spread":0.23029640203984203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950544775","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.5897388,0.0038822142,0.34783992,0.010174802,0.00036461922,0.00021308433,0.003562243,0.0012521326,0.042972192],"genre_scores_gemma":[0.92742765,0.0015294603,0.05941097,0.0008994295,0.00055760687,0.00018928343,0.0020734358,0.0003897413,0.0075223683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958501,0.0010121107,0.0002312942,0.0012693865,0.0010656074,0.00057153404],"domain_scores_gemma":[0.98501784,0.009824096,0.0012434695,0.0025604945,0.00052251964,0.00083154754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032322465,0.0015712386,0.0027246976,0.0016238806,0.0014122946,0.0048574014,0.0035338756,0.002331393,0.011259208],"category_scores_gemma":[0.017172009,0.00092106627,0.0028910858,0.0040772315,0.0030166483,0.013716643,0.003088896,0.0060872077,0.00092911714],"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.0013399343,0.00094761467,0.008217518,0.0011888153,0.00029975717,0.0005018717,0.0013426084,0.18989398,0.0063544502,0.67753243,0.021183835,0.09119718],"study_design_scores_gemma":[0.000110765475,0.00021323805,0.0021012612,0.00007332415,0.000108585795,0.00055314443,0.0002316773,0.25885385,0.0034354345,0.7281297,0.0061321435,0.000056847675],"about_ca_topic_score_codex":0.0022464476,"about_ca_topic_score_gemma":0.001794762,"teacher_disagreement_score":0.011259208,"about_ca_system_score_codex":0.0035463772,"about_ca_system_score_gemma":0.0016048966,"threshold_uncertainty_score":0.037665784},"labels":[],"label_agreement":null},{"id":"W2950683345","doi":"10.1007/978-3-642-32512-0_10","title":"Approximating Minimum-Cost Connected T-Joins","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Approximation algorithm; Combinatorics; Rounding; Steiner tree problem; Degree (music); Undirected graph; Mathematics; Discrete mathematics; Graph; Connected dominating set; Computer science; Physics","score_opus":0.031683213939091584,"score_gpt":0.252427819317922,"score_spread":0.22074460537883045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950683345","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.2757477,0.0018105044,0.67843926,0.0019391633,0.00036000065,0.0003517743,0.0020181155,0.002717334,0.036616135],"genre_scores_gemma":[0.508815,0.0010346182,0.47118765,0.00031956407,0.0003057598,0.00033967185,0.003368791,0.00086907495,0.013759808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877316,0.0002378223,0.00006409195,0.00026150275,0.0004744592,0.00018902692],"domain_scores_gemma":[0.99363285,0.0041337134,0.00036053735,0.0008666317,0.0004797913,0.00052641274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001185861,0.0014123631,0.0020013857,0.0015311736,0.00093008386,0.0028036172,0.0033510318,0.0020496137,0.01589256],"category_scores_gemma":[0.011513255,0.00078029756,0.0011313569,0.0037016158,0.0009981594,0.0043710354,0.0031161222,0.002721705,0.0025418617],"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.0020897412,0.0006489905,0.002683613,0.0011499217,0.0001393613,0.00038775138,0.00052736345,0.44939628,0.013944717,0.1869928,0.033816412,0.3082231],"study_design_scores_gemma":[0.00019546834,0.00021943903,0.00039656306,0.0000724707,0.00006784737,0.00031738722,0.00023480285,0.7834817,0.004175718,0.20539816,0.0054218555,0.00001859353],"about_ca_topic_score_codex":0.0010096831,"about_ca_topic_score_gemma":0.0022042505,"teacher_disagreement_score":0.01589256,"about_ca_system_score_codex":0.0015295037,"about_ca_system_score_gemma":0.00109357,"threshold_uncertainty_score":0.053165913},"labels":[],"label_agreement":null},{"id":"W2950757391","doi":"10.48550/arxiv.1903.11980","title":"Probabilistic Analysis of Facility Location on Random Shortest Path Metrics","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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; RWTH Aachen University; Fédération Wallonie-Bruxelles; Deutsche Forschungsgemeinschaft; Freistaat Sachsen; National Foundation for Science and Technology Development","keywords":"Facility location problem; Shortest path problem; Heuristic; Mathematical optimization; Probabilistic logic; Metric (unit); Mathematics; Computer science; Path (computing); Euclidean geometry; Probabilistic analysis of algorithms; Metric space; Euclidean distance; Greedy algorithm; Upper and lower bounds; Combinatorics; Discrete mathematics; Statistics; Artificial intelligence; Engineering","score_opus":0.08636848891975024,"score_gpt":0.2005369723349278,"score_spread":0.11416848341517755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950757391","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.04279244,0.002486142,0.94186884,0.002010509,0.00007493657,0.00014676836,0.0005772377,0.0005559837,0.0094871195],"genre_scores_gemma":[0.80006987,0.0046187085,0.1827713,0.00081547356,0.0005162698,0.0009206547,0.0015697002,0.00089332915,0.007824651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9904259,0.0044989455,0.00031866558,0.001464481,0.0023554834,0.0009365249],"domain_scores_gemma":[0.94891965,0.038803734,0.005175823,0.003269211,0.002650499,0.0011811189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074939043,0.0022388797,0.002945398,0.004254405,0.0013898211,0.0033959718,0.0043825763,0.0023127405,0.0051634945],"category_scores_gemma":[0.0507594,0.001999905,0.0030126655,0.0047355443,0.004069471,0.010690535,0.004321716,0.0042252187,0.0009849078],"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.00013812947,0.000050306575,0.0016302029,0.0003206639,0.000144977,0.00012983663,0.00015397483,0.60362726,0.0014479269,0.37603936,0.0039758985,0.01234146],"study_design_scores_gemma":[0.000015648888,0.000037873,0.00059541326,0.000041028892,0.000031052303,0.00008167129,0.000027137641,0.82991236,0.0003765418,0.16726066,0.0015921189,0.00002842135],"about_ca_topic_score_codex":0.0037279408,"about_ca_topic_score_gemma":0.0022911471,"teacher_disagreement_score":0.0074939043,"about_ca_system_score_codex":0.0065307394,"about_ca_system_score_gemma":0.0019357724,"threshold_uncertainty_score":0.047384083},"labels":[],"label_agreement":null},{"id":"W2950837701","doi":"10.1109/lics.2004.1319620","title":"The strength of replacement in weak arithmetic","year":2004,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Combinatorics; Sigma; Mathematics; Discrete mathematics; Bounded function; Physics; Quantum mechanics; Mathematical analysis","score_opus":0.014709696871692804,"score_gpt":0.24429171867311833,"score_spread":0.22958202180142553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950837701","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.48186952,0.0037729489,0.35885257,0.006287424,0.00055155135,0.000121686404,0.00046154123,0.0014701431,0.14661267],"genre_scores_gemma":[0.9623786,0.00042773862,0.02809883,0.00064808415,0.00017987312,0.00006026053,0.00017264773,0.00009765702,0.007936262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918309,0.0024680146,0.0007677182,0.0016336757,0.0023691151,0.00093065045],"domain_scores_gemma":[0.9873695,0.0059233285,0.0009719322,0.0026957481,0.0021009098,0.00093871134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061006923,0.00063672714,0.0010597283,0.0016622498,0.0024864103,0.0051619075,0.0018716573,0.0015686196,0.0037699242],"category_scores_gemma":[0.012668891,0.0011474951,0.001667056,0.0012473126,0.01216511,0.010128427,0.007938182,0.00389666,0.00079277216],"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.00010036655,0.000009881621,0.0011011726,0.000108048225,0.000026177711,0.00008109929,0.0005455818,0.00091046316,0.0020324013,0.9872887,0.00048511353,0.007311069],"study_design_scores_gemma":[0.000047041252,0.00015678623,0.001088542,0.000057268553,0.000081350016,0.00027843777,0.00041297113,0.0070457924,0.004656925,0.96885765,0.01727471,0.00004254998],"about_ca_topic_score_codex":0.0022152364,"about_ca_topic_score_gemma":0.0016819887,"teacher_disagreement_score":0.0061006923,"about_ca_system_score_codex":0.0028082433,"about_ca_system_score_gemma":0.0015437338,"threshold_uncertainty_score":0.032263994},"labels":[],"label_agreement":null},{"id":"W2951424111","doi":"10.2168/lmcs-2(1:3)2006","title":"Theories for TC0 and Other Small Complexity Classes","year":2006,"lang":"en","type":"article","venue":"Logical Methods in Computer Science","topic":"Complexity and Algorithms in Graphs","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":"University of Toronto","funders":"","keywords":"Mathematics; Complexity class; Natural number; Mathematical proof; Discrete mathematics; Bounded function; Polynomial; Isomorphism (crystallography); Boolean function; Function (biology); Class (philosophy); Binary number; Multiplication (music); Algebraic number; Time complexity; Combinatorics; Computer science; Arithmetic","score_opus":0.13670777818402702,"score_gpt":0.3898902504278553,"score_spread":0.2531824722438283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951424111","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.081541434,0.00089791947,0.81581926,0.0039527486,0.00029026892,0.00024250656,0.0005863801,0.0007278993,0.095941626],"genre_scores_gemma":[0.7462301,0.00067341176,0.23176593,0.0013895213,0.0006228837,0.00073108054,0.0015264545,0.00028836247,0.016772259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980994,0.00027968342,0.00014885001,0.00038867063,0.000845022,0.00023839803],"domain_scores_gemma":[0.9937973,0.0035672174,0.00039587918,0.0009766142,0.00087682507,0.0003862148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017970513,0.00053493166,0.0005369541,0.0026317602,0.0021351683,0.0038590995,0.0018964073,0.0014232654,0.006404683],"category_scores_gemma":[0.006189701,0.00036933864,0.0023831099,0.0016073097,0.0056066136,0.010471186,0.0033514365,0.005244816,0.00048697364],"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.000002747901,0.000006509292,0.0000761397,0.000017658604,0.0000024716971,0.000014216108,0.0000627039,0.00038426789,0.0001546057,0.99728286,0.00037455442,0.0016211928],"study_design_scores_gemma":[0.000008638599,0.000010352271,0.00014997556,0.000016032902,0.000008571259,0.00006033323,0.00007022653,0.0076411674,0.000749841,0.9840471,0.0072283708,0.000009447547],"about_ca_topic_score_codex":0.0026666096,"about_ca_topic_score_gemma":0.0022435116,"teacher_disagreement_score":0.006404683,"about_ca_system_score_codex":0.004135319,"about_ca_system_score_gemma":0.0019716441,"threshold_uncertainty_score":0.030004025},"labels":[],"label_agreement":null},{"id":"W2951607788","doi":"10.1007/s40305-019-00255-y","title":"A Note on Submodularity Preserved Involving the Rank Functions","year":2019,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Matroid; Intersection (aeronautics); Rank (graph theory); Computer science; Function (biology); Combinatorics; Mathematical optimization; Mathematics; Mathematical economics","score_opus":0.05601398994931464,"score_gpt":0.33576066152842743,"score_spread":0.2797466715791128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951607788","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.12770045,0.0069331755,0.58246636,0.016042106,0.00396238,0.00021012557,0.0013660683,0.0008648618,0.2604544],"genre_scores_gemma":[0.8048483,0.007310744,0.12809479,0.004194219,0.0046568555,0.00021345429,0.001044968,0.00084639824,0.048790284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99763095,0.0007007468,0.00010768706,0.00067135046,0.0005480066,0.00034124355],"domain_scores_gemma":[0.9915378,0.0046206396,0.00038127913,0.0022884822,0.0007579091,0.00041381438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003002925,0.001127964,0.0014525349,0.0016292295,0.0022757722,0.0030485652,0.0021546562,0.0017182792,0.009409539],"category_scores_gemma":[0.016703192,0.00046296444,0.0019409114,0.0024693874,0.004913004,0.013641942,0.0047789174,0.00797721,0.0013570738],"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.00009348599,0.00004913397,0.00038197142,0.00014917266,0.000024051562,0.00015537589,0.00025348665,0.002468501,0.0018056857,0.956714,0.009693409,0.028211743],"study_design_scores_gemma":[0.000011941491,0.00005552941,0.00031135735,0.000032086446,0.00003396653,0.00023178001,0.00007516397,0.008692471,0.0013164063,0.977776,0.011434667,0.000028652265],"about_ca_topic_score_codex":0.0017201442,"about_ca_topic_score_gemma":0.0012733041,"teacher_disagreement_score":0.009409539,"about_ca_system_score_codex":0.0013588837,"about_ca_system_score_gemma":0.0013917914,"threshold_uncertainty_score":0.031478047},"labels":[],"label_agreement":null},{"id":"W2951668131","doi":"10.48550/arxiv.1106.3595","title":"Information Equals Amortized Communication","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":22,"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; National Science Foundation","keywords":"Communication complexity; Computer science; Theoretical computer science; Generalization; Function (biology); Discrete mathematics; Pointer (user interface); Mathematics","score_opus":0.11629711189004634,"score_gpt":0.19422643861284197,"score_spread":0.07792932672279564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951668131","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.15911171,0.00016581001,0.82222164,0.0018730172,0.00008528463,0.00031923855,0.00034871188,0.0011550499,0.014719481],"genre_scores_gemma":[0.83267707,0.00016636275,0.1591972,0.00041197878,0.00009420342,0.0006352079,0.00047842567,0.00030395985,0.0060356264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934769,0.0019303935,0.00041984752,0.0014944462,0.001782283,0.0008961642],"domain_scores_gemma":[0.97349244,0.01521485,0.0013667038,0.007997739,0.0010701345,0.0008580964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031437622,0.0011631802,0.0011638082,0.00092629436,0.0015465284,0.0032279445,0.0034529623,0.0021914449,0.007912803],"category_scores_gemma":[0.019167067,0.0006700826,0.0020269395,0.0010831031,0.0045002317,0.010049977,0.0060167136,0.004340094,0.0011844159],"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.00069873425,0.00023448253,0.0015609205,0.00023817373,0.00011781664,0.00023886454,0.0003880102,0.2516996,0.012166912,0.70584744,0.0018372565,0.024971774],"study_design_scores_gemma":[0.00007371496,0.00011866392,0.00015424928,0.000021622325,0.000049057897,0.00011419724,0.000035983612,0.56835383,0.012423391,0.4164511,0.0021728845,0.000031279003],"about_ca_topic_score_codex":0.0010339544,"about_ca_topic_score_gemma":0.0008523697,"teacher_disagreement_score":0.007912803,"about_ca_system_score_codex":0.002717414,"about_ca_system_score_gemma":0.0024250469,"threshold_uncertainty_score":0.026471019},"labels":[],"label_agreement":null},{"id":"W2951684049","doi":"10.1002/rsa.20598","title":"Improved bounds for the randomized decision tree Complexity of recursive majority","year":2015,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"Agence Nationale de la Recherche","keywords":"Decision tree; Computer science; Tree (set theory); Recursive partitioning; Theoretical computer science; Mathematics; Machine learning; Combinatorics","score_opus":0.041386304586397284,"score_gpt":0.2870490232514411,"score_spread":0.24566271866504383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951684049","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.11421289,0.0015240131,0.855591,0.0037396217,0.00035698403,0.0002737765,0.0005142429,0.0016651573,0.022122316],"genre_scores_gemma":[0.7804252,0.0005411851,0.2090883,0.0010758204,0.00042993765,0.0004880397,0.00062018924,0.0005211626,0.0068101636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98786527,0.0035062244,0.0005306982,0.0017921675,0.0045634164,0.0017421497],"domain_scores_gemma":[0.95843613,0.030934136,0.0014453434,0.005457627,0.0029042393,0.00082247704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006818144,0.0012576472,0.0018824438,0.0015708235,0.0014021811,0.0040262546,0.0040823235,0.0022538356,0.009384719],"category_scores_gemma":[0.03384617,0.0005932011,0.0020377988,0.0014615677,0.0035249088,0.008015186,0.0049835346,0.006049405,0.0014304072],"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.0013230097,0.00057038915,0.0029630975,0.0004560229,0.00018334229,0.00025691953,0.00040603383,0.21905951,0.016990298,0.6563666,0.010419784,0.091004945],"study_design_scores_gemma":[0.00012964717,0.000121048724,0.00056730234,0.00005408752,0.000074082236,0.00010018204,0.000040914438,0.69300175,0.008147062,0.2954097,0.0023063843,0.000047868143],"about_ca_topic_score_codex":0.0020496908,"about_ca_topic_score_gemma":0.002390715,"teacher_disagreement_score":0.009384719,"about_ca_system_score_codex":0.0045478037,"about_ca_system_score_gemma":0.0038370958,"threshold_uncertainty_score":0.036058247},"labels":[],"label_agreement":null},{"id":"W2951762341","doi":"10.48550/arxiv.1301.2731","title":"A Characterization of Approximation Resistance for Even $k$-Partite CSPs","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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; University of Toronto; National Science Foundation","keywords":"Constraint satisfaction problem; Conjecture; Characterization (materials science); Predicate (mathematical logic); Mathematics; Combinatorics; Constraint (computer-aided design); Discrete mathematics; Computer science; Physics","score_opus":0.07332870082273674,"score_gpt":0.18630274616892767,"score_spread":0.11297404534619093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951762341","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.62792265,0.0007494854,0.3432643,0.006035863,0.000104765444,0.00021553766,0.0017761268,0.0013363966,0.018594887],"genre_scores_gemma":[0.9563742,0.0003570253,0.039257124,0.00054726255,0.00010831393,0.00017582979,0.0009962948,0.00030099627,0.0018829446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99159956,0.0024164547,0.00065069884,0.0019747664,0.0019175737,0.0014409735],"domain_scores_gemma":[0.9284097,0.055269074,0.004369803,0.008008139,0.0018841424,0.0020591372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059324917,0.0011677926,0.0020230561,0.0021776697,0.002082846,0.00660613,0.0031272378,0.0026389519,0.004904149],"category_scores_gemma":[0.049060334,0.0010455915,0.0021570718,0.0033194055,0.0043196133,0.008760646,0.0046433094,0.0057333717,0.00078103185],"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.003529387,0.0006300666,0.016682329,0.0007672317,0.00046681703,0.0007366029,0.0026498174,0.3625856,0.028247822,0.5147018,0.012224492,0.05677805],"study_design_scores_gemma":[0.00011921855,0.00022609427,0.002346004,0.000063068386,0.000121480116,0.0007043047,0.00043937765,0.5272588,0.0075629177,0.45806962,0.003002577,0.000086505686],"about_ca_topic_score_codex":0.0015170815,"about_ca_topic_score_gemma":0.00096847076,"teacher_disagreement_score":0.00660613,"about_ca_system_score_codex":0.0025457663,"about_ca_system_score_gemma":0.0018589699,"threshold_uncertainty_score":0.031374395},"labels":[],"label_agreement":null},{"id":"W2952164293","doi":"10.48550/arxiv.1204.4526","title":"A Tight Combinatorial Algorithm for Submodular Maximization Subject to a Matroid Constraint","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"Engineering and Physical Sciences Research Council","keywords":"Submodular set function; Matroid; Mathematics; Greedy algorithm; Combinatorics; Monotone polygon; Approximation algorithm; Randomized rounding; Rounding; Matroid partitioning; Weighted matroid; Maximization; Discrete mathematics; Constraint (computer-aided design); Function (biology); Algorithm; Mathematical optimization; Computer science; Graphic matroid","score_opus":0.06039290440074062,"score_gpt":0.19785044080560052,"score_spread":0.13745753640485991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952164293","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.0052515967,0.00025518614,0.9847239,0.0004353874,0.00007854587,0.00020011724,0.0001768813,0.0019754914,0.006902847],"genre_scores_gemma":[0.073385775,0.00020128148,0.92169833,0.00036983253,0.0001085359,0.00040307755,0.0005507749,0.00039220785,0.002890174],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980556,0.00039942458,0.00010212774,0.00050381455,0.000625681,0.000313426],"domain_scores_gemma":[0.998279,0.0007809994,0.0001594743,0.00049006805,0.00017537056,0.00011510935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015188949,0.0022288149,0.0017924178,0.0013342751,0.00080872804,0.0023558303,0.0031620883,0.0023986902,0.01381805],"category_scores_gemma":[0.006601613,0.0010491261,0.0017759823,0.0024014725,0.0011902591,0.0036097702,0.0033496975,0.0037253543,0.004905068],"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.0003812584,0.000575213,0.0009513347,0.0005680763,0.00013588347,0.00021616697,0.00024255402,0.26081613,0.009924463,0.13905567,0.037410658,0.5497226],"study_design_scores_gemma":[0.0001895623,0.00013766969,0.00023246797,0.000041117924,0.000031821044,0.0002358007,0.000069738795,0.90653723,0.0023894892,0.082543604,0.0075590382,0.000032483647],"about_ca_topic_score_codex":0.0028311845,"about_ca_topic_score_gemma":0.0044933707,"teacher_disagreement_score":0.01381805,"about_ca_system_score_codex":0.0021246893,"about_ca_system_score_gemma":0.0032028942,"threshold_uncertainty_score":0.046226025},"labels":[],"label_agreement":null},{"id":"W2952270608","doi":"","title":"Separating OR, SUM, and XOR Circuits","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Mathematics; Monotone polygon; Electronic circuit; Boolean circuit; Corollary; Discrete mathematics; Modulo; Rewriting; Combinatorics; Circuit complexity; Boolean function; Arithmetic; Computer science","score_opus":0.11889906994911413,"score_gpt":0.20505596337945128,"score_spread":0.08615689343033715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952270608","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.37075472,0.0004662325,0.5951567,0.0012652645,0.00005997467,0.00018057061,0.00056569674,0.0010310255,0.030519867],"genre_scores_gemma":[0.8356768,0.00039754304,0.15357736,0.0002536634,0.00007203887,0.00014299992,0.00052895676,0.0001474554,0.0092032375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990357,0.00021668956,0.00006938924,0.00026494826,0.00024409573,0.00016911358],"domain_scores_gemma":[0.9978168,0.0011361177,0.00023587987,0.00055071333,0.00016198648,0.000098514734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058622763,0.00065012125,0.00047178808,0.0004793765,0.00063911313,0.0018380223,0.0011304622,0.00067621045,0.0065309494],"category_scores_gemma":[0.0035205316,0.00038091387,0.0008214904,0.000732256,0.0011020902,0.006356296,0.0014868001,0.0012316644,0.0006424791],"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.00050857395,0.00012135344,0.0015010933,0.00031593407,0.00004014855,0.00016374835,0.00026358865,0.0483112,0.024123358,0.8292273,0.0026883094,0.09273527],"study_design_scores_gemma":[0.000051276602,0.0001118319,0.00051943935,0.000024479488,0.000047024758,0.00030422755,0.00012940846,0.30202997,0.025267256,0.6649852,0.0064989207,0.000030904568],"about_ca_topic_score_codex":0.0011553933,"about_ca_topic_score_gemma":0.0021000947,"teacher_disagreement_score":0.0065309494,"about_ca_system_score_codex":0.001366781,"about_ca_system_score_gemma":0.000993636,"threshold_uncertainty_score":0.021848202},"labels":[],"label_agreement":null},{"id":"W2952406394","doi":"10.48550/arxiv.1204.5508","title":"Relativizing Small Complexity Classes and their Theories","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Oracle; Bounded function; Stack (abstract data type); Hierarchy; Class (philosophy); P; Function (biology); Mathematics; Limit (mathematics); Combinatorics; Constant (computer programming); Discrete mathematics; Zero (linguistics); Complexity class; Pure mathematics; Computer science; Time complexity; Mathematical analysis","score_opus":0.1537423186904452,"score_gpt":0.19774910077712748,"score_spread":0.044006782086682295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952406394","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.18460244,0.0026135764,0.7132727,0.0045980588,0.00042678483,0.00025055883,0.0007607768,0.0011303825,0.09234479],"genre_scores_gemma":[0.8536408,0.001161798,0.13051318,0.001156258,0.00060023216,0.00038571935,0.00092528074,0.0003644151,0.011252308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929255,0.0016205993,0.00058868865,0.0018880464,0.0020513032,0.0009258794],"domain_scores_gemma":[0.99327916,0.0027621686,0.00056841853,0.0020760242,0.0008012111,0.0005129145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037303965,0.00080651575,0.00088556774,0.0042054635,0.002832621,0.0053659678,0.002140243,0.0015450704,0.0043373383],"category_scores_gemma":[0.009314953,0.0010796064,0.0023040234,0.0022742308,0.009915973,0.013909573,0.0075074537,0.0086893495,0.0005026502],"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.0000067454953,0.00000596223,0.00012713888,0.000017286606,0.000007919112,0.000010751806,0.00021251041,0.0006009666,0.00016277477,0.9968784,0.00025349605,0.0017162211],"study_design_scores_gemma":[0.000014952565,0.00002095375,0.00040881723,0.000026137117,0.00003388955,0.0000492769,0.00022917887,0.0048261764,0.0009602332,0.981806,0.011599676,0.000024798714],"about_ca_topic_score_codex":0.0037342634,"about_ca_topic_score_gemma":0.0030307008,"teacher_disagreement_score":0.005875863,"about_ca_system_score_codex":0.005875863,"about_ca_system_score_gemma":0.001781985,"threshold_uncertainty_score":0.04263264},"labels":[],"label_agreement":null},{"id":"W2952497380","doi":"10.4230/lipics.itcs.2020.6","title":"Local max-cut in smoothed polynomial time","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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; Blavatnik Family Foundation; Israel Science Foundation; Microsoft Research","keywords":"Mathematical proof; Mathematics; Bounded function; Polynomial; Time complexity; Combinatorics; Applied mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.04791971121089802,"score_gpt":0.17871762462540225,"score_spread":0.13079791341450422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952497380","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.078021005,0.0023982592,0.88126045,0.0053657577,0.00024947914,0.00027386704,0.0015147226,0.0047161896,0.026200393],"genre_scores_gemma":[0.6800284,0.001143438,0.2997191,0.001408246,0.00040191424,0.0005140297,0.0022988052,0.0014758952,0.013010137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99593496,0.00087622536,0.00017949099,0.0012978702,0.0010314542,0.00067986996],"domain_scores_gemma":[0.98761076,0.007843165,0.00079426204,0.0026488714,0.0006697718,0.00043317085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002520363,0.0012412659,0.0017083153,0.0010805782,0.0014941301,0.0037743698,0.0029095695,0.0017643035,0.009363186],"category_scores_gemma":[0.017186064,0.0009321656,0.002385122,0.0023627058,0.0027123438,0.008464816,0.003413293,0.0064013004,0.0020374903],"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.0010628873,0.00032583944,0.0027659212,0.0014125219,0.00037682464,0.00027639657,0.0011129889,0.28259602,0.010614343,0.5794213,0.02913312,0.09090187],"study_design_scores_gemma":[0.00011985054,0.00005359266,0.0005396614,0.00003817055,0.00008429202,0.0001154978,0.000076944874,0.31205562,0.0023652427,0.6757133,0.008810288,0.000027523385],"about_ca_topic_score_codex":0.0049092104,"about_ca_topic_score_gemma":0.009256685,"teacher_disagreement_score":0.009363186,"about_ca_system_score_codex":0.0050295806,"about_ca_system_score_gemma":0.0033420222,"threshold_uncertainty_score":0.036492288},"labels":[],"label_agreement":null},{"id":"W2952920300","doi":"10.1145/3013516","title":"Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","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":"Université de Montréal","funders":"National Science Foundation","keywords":"Nondeterministic algorithm; Upper and lower bounds; Sublinear function; Branching (polymer chemistry); Computation; Boolean function","score_opus":0.03216755379160711,"score_gpt":0.3231520444204931,"score_spread":0.290984490628886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952920300","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.0030612242,0.0005780085,0.97106713,0.0016045566,0.00021182418,0.000083727486,0.00016722683,0.0002472683,0.022978975],"genre_scores_gemma":[0.21695761,0.0015871928,0.74736613,0.0020852184,0.0009218292,0.0012905798,0.0006818808,0.0006928481,0.028416684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925127,0.0021827219,0.00049482577,0.0014549162,0.002629677,0.00072518573],"domain_scores_gemma":[0.9891762,0.0059981886,0.0003656883,0.0026524616,0.0014661484,0.00034123773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060831504,0.0018787392,0.0015101194,0.0028650844,0.0018159256,0.004122657,0.0060297,0.0023553115,0.011114364],"category_scores_gemma":[0.016964989,0.0012275431,0.0026479822,0.0028881254,0.0038540582,0.0086759245,0.0049286596,0.010376135,0.002598213],"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.000042327123,0.00003357874,0.00007985068,0.000092427304,0.000020183099,0.000041908508,0.0000741723,0.009995705,0.0009890654,0.96945256,0.0037524546,0.015425678],"study_design_scores_gemma":[0.000034667828,0.000045163826,0.00013878204,0.00006437269,0.000039573177,0.00010770706,0.000027166336,0.16584505,0.0033584794,0.81088245,0.019411545,0.000045109675],"about_ca_topic_score_codex":0.0017056357,"about_ca_topic_score_gemma":0.0017543405,"teacher_disagreement_score":0.011114364,"about_ca_system_score_codex":0.004509557,"about_ca_system_score_gemma":0.0023525232,"threshold_uncertainty_score":0.03718126},"labels":[],"label_agreement":null},{"id":"W2953059252","doi":"10.48550/arxiv.1308.2617","title":"Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Nanyang Technological University; McGill University; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India; National Science Foundation","keywords":"Exponential time hypothesis; Combinatorics; Parameterized complexity; Hypergraph; Mathematics; Bipartite graph; Bounded function; Hardness of approximation; Upper and lower bounds; Approximation algorithm; Matching (statistics); Time complexity; Constant (computer programming); Discrete mathematics; Independent set; Vertex cover; Graph","score_opus":0.06756875288534187,"score_gpt":0.1935105022347591,"score_spread":0.12594174934941724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953059252","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.112615064,0.011896445,0.78156877,0.032089658,0.0010092537,0.00032678852,0.0019507305,0.0018433835,0.056699935],"genre_scores_gemma":[0.74675494,0.0132636195,0.20047326,0.0052623358,0.0041802507,0.00087373785,0.0034508787,0.0015007018,0.024240362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.990862,0.002251351,0.00042640322,0.0025526236,0.002578382,0.0013291835],"domain_scores_gemma":[0.9561601,0.031514682,0.0024918327,0.007031551,0.0013410808,0.001460722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054826927,0.0028524392,0.0032749635,0.0029684883,0.002655815,0.009757026,0.0074854367,0.005137095,0.013484181],"category_scores_gemma":[0.04230866,0.002195721,0.0046419757,0.0083238045,0.0073710815,0.03625742,0.007352286,0.023400104,0.0023406623],"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.0008978088,0.000851791,0.0032302614,0.0013023822,0.000262422,0.0002538143,0.00090997823,0.092939906,0.003759579,0.7820221,0.023818582,0.08975132],"study_design_scores_gemma":[0.00007393375,0.00006099851,0.0005760342,0.00005972265,0.00006375956,0.00015263166,0.000097625125,0.121094905,0.0011396528,0.8720836,0.004556414,0.000040710453],"about_ca_topic_score_codex":0.0045333332,"about_ca_topic_score_gemma":0.0028530606,"teacher_disagreement_score":0.013484181,"about_ca_system_score_codex":0.007453881,"about_ca_system_score_gemma":0.0031149285,"threshold_uncertainty_score":0.054081917},"labels":[],"label_agreement":null},{"id":"W2953316317","doi":"10.48550/arxiv.1302.2127","title":"An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Steiner tree problem; Combinatorics; Mathematics; Undirected graph; Graph; Approximation algorithm; Node (physics); Tree (set theory); Dual (grammatical number); Discrete mathematics; Computer science","score_opus":0.07647743396466734,"score_gpt":0.21161926812160353,"score_spread":0.1351418341569362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953316317","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.0797964,0.0012098453,0.8869016,0.003166938,0.00027125678,0.00040985236,0.0013653358,0.0037494781,0.023129286],"genre_scores_gemma":[0.3335056,0.0004756023,0.65125537,0.00063928746,0.0001488187,0.0005408395,0.0021007715,0.0005300104,0.010803702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887365,0.0003407253,0.00004952031,0.00024795884,0.00023702561,0.00025106646],"domain_scores_gemma":[0.99835014,0.000877203,0.00013673885,0.00034662732,0.00014939375,0.00013996164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015092597,0.0014004736,0.0017162552,0.000784595,0.0008766634,0.0016501421,0.0030350636,0.0015648319,0.008722509],"category_scores_gemma":[0.004772073,0.0005839151,0.0009949139,0.0022985996,0.0007150086,0.0031510901,0.001980103,0.0023151007,0.0020235472],"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.0013172579,0.0006798799,0.0018607032,0.0006815997,0.00014780118,0.00024379873,0.0004159431,0.51410615,0.005550834,0.08495274,0.060278393,0.32976487],"study_design_scores_gemma":[0.0001432326,0.000085793756,0.00024388096,0.000028816126,0.000025545114,0.00013119179,0.0000834243,0.9391544,0.0010437346,0.05517174,0.0038743368,0.000013805508],"about_ca_topic_score_codex":0.0035579873,"about_ca_topic_score_gemma":0.006086821,"teacher_disagreement_score":0.008722509,"about_ca_system_score_codex":0.0023587898,"about_ca_system_score_gemma":0.0031738742,"threshold_uncertainty_score":0.029179692},"labels":[],"label_agreement":null},{"id":"W2957416585","doi":"10.1109/focs.2019.00021","title":"Approximating Constraint Satisfaction Problems on High-Dimensional Expanders","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; University of Chicago; National Science Foundation","keywords":"Combinatorics; Arity; Constraint satisfaction problem; Mathematics; Hypergraph; Rank (graph theory); Expander graph; Constraint (computer-aided design); Degree (music); Measure (data warehouse); Discrete mathematics; Parameterized complexity; Computer science; Physics; Graph","score_opus":0.03487265559203002,"score_gpt":0.2509935924655586,"score_spread":0.21612093687352857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957416585","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.32103997,0.0009941191,0.6692778,0.0013782983,0.000056974302,0.00013747689,0.00082682405,0.0012118105,0.005076759],"genre_scores_gemma":[0.80616546,0.0005949136,0.18683496,0.00049881364,0.00013817883,0.00026650293,0.0016465827,0.0002653584,0.0035892632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997413,0.00095243845,0.00012658817,0.0006109282,0.00061537756,0.0002816423],"domain_scores_gemma":[0.98636496,0.010840208,0.000970141,0.0009253954,0.00056914473,0.00033010848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023910052,0.0012017499,0.0014929887,0.0010164358,0.00049088104,0.0016523738,0.0015699884,0.001458057,0.003130495],"category_scores_gemma":[0.019199697,0.00069529546,0.0013609618,0.002013697,0.001756452,0.0041287886,0.0023840815,0.0032643152,0.00045255068],"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.00032424202,0.000102991486,0.0020041051,0.0001920259,0.000097858974,0.00020546904,0.00026194018,0.9105765,0.003161523,0.059221733,0.001706132,0.022145463],"study_design_scores_gemma":[0.000018072129,0.00003291153,0.00019319692,0.000010832586,0.000008390267,0.000042965192,0.000036249945,0.95480585,0.000623479,0.043835573,0.00038586374,0.000006729589],"about_ca_topic_score_codex":0.0026850253,"about_ca_topic_score_gemma":0.0028270197,"teacher_disagreement_score":0.003130495,"about_ca_system_score_codex":0.0017993726,"about_ca_system_score_gemma":0.00086702994,"threshold_uncertainty_score":0.013055444},"labels":[],"label_agreement":null},{"id":"W2960183494","doi":"10.1007/978-3-030-25005-8_31","title":"Maximum Clique Exhaustive Search in Circulant k-Hypergraphs","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Ottawa","funders":"","keywords":"Clique; Circulant matrix; Computer science; Enhanced Data Rates for GSM Evolution; Pruning; Clique problem; Necklace; Combinatorics; Hypergraph; Algorithm; Binary number; Discrete mathematics; Mathematics; Theoretical computer science; Artificial intelligence; Arithmetic","score_opus":0.02460252876132622,"score_gpt":0.25770618981072924,"score_spread":0.23310366104940303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960183494","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.23078707,0.004626067,0.6379402,0.0037385777,0.00034166375,0.0007287892,0.0034713806,0.0030348152,0.11533135],"genre_scores_gemma":[0.58742535,0.0018822443,0.36507326,0.0007484488,0.00029414234,0.00043346977,0.0029577627,0.0007691899,0.04041615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988368,0.0004379664,0.000044652337,0.00025732798,0.00022240612,0.00020088062],"domain_scores_gemma":[0.9940818,0.004628434,0.00024454255,0.0005160654,0.00029056487,0.00023852874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087001175,0.00090651255,0.0018637291,0.0017215795,0.001547441,0.0031459087,0.002783976,0.0027550678,0.01179968],"category_scores_gemma":[0.008592079,0.0011165305,0.0008605853,0.004926415,0.0010146406,0.003922231,0.0020811518,0.0017673182,0.0018779506],"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.0012321618,0.00065850205,0.0015051743,0.0019773212,0.00026982377,0.00056199,0.0005240332,0.3867048,0.009139303,0.2734467,0.060268395,0.26371175],"study_design_scores_gemma":[0.00016453218,0.000061109116,0.00041348953,0.00009585497,0.000055508306,0.00019876998,0.00010096774,0.7636187,0.0020498324,0.22777176,0.0054403045,0.000029222214],"about_ca_topic_score_codex":0.0050804415,"about_ca_topic_score_gemma":0.012354455,"teacher_disagreement_score":0.01179968,"about_ca_system_score_codex":0.0021441774,"about_ca_system_score_gemma":0.002603606,"threshold_uncertainty_score":0.03947389},"labels":[],"label_agreement":null},{"id":"W2962731772","doi":"10.1145/2984450.2984455","title":"Algebraic proof complexity","year":2016,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Complexity and Algorithms in Graphs","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":"","keywords":"Mathematical proof; Proof complexity; Algebraic number; Mathematics; Circuit complexity; Upper and lower bounds; Connection (principal bundle); Discrete mathematics; Algebraic number theory; Polynomial; Computer science; Algebra over a field; Pure mathematics; Electronic circuit","score_opus":0.057058056298150514,"score_gpt":0.2720437758751473,"score_spread":0.21498571957699675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962731772","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.030374568,0.026202464,0.7929596,0.016607279,0.0008935712,0.00019789352,0.0016306781,0.0010423101,0.1300917],"genre_scores_gemma":[0.7160318,0.040355306,0.2115302,0.004214949,0.0050963107,0.00049004686,0.0028767122,0.00066211395,0.018742668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99119776,0.0018680155,0.000646101,0.001603509,0.003994427,0.0006901804],"domain_scores_gemma":[0.95796156,0.031856462,0.0017989883,0.0038148046,0.0037854428,0.00078273896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004350843,0.00093713735,0.0011474245,0.0030965232,0.0021236087,0.008658848,0.0032676142,0.001461183,0.014428216],"category_scores_gemma":[0.028488643,0.0007572341,0.001859478,0.0040112897,0.005459021,0.018772673,0.0050203544,0.007196809,0.0020552168],"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.00001657275,0.000016807588,0.00025339847,0.0002851561,0.000021219039,0.0000271002,0.00009812988,0.0030754537,0.0002590141,0.9769812,0.0027316685,0.016234184],"study_design_scores_gemma":[0.0000074330437,0.0000094726165,0.0001736885,0.000047292226,0.000016166152,0.00008471435,0.000027390432,0.007089675,0.00035135134,0.9774343,0.014747236,0.000011425471],"about_ca_topic_score_codex":0.0016210914,"about_ca_topic_score_gemma":0.0012021959,"teacher_disagreement_score":0.014428216,"about_ca_system_score_codex":0.004587246,"about_ca_system_score_gemma":0.0023395515,"threshold_uncertainty_score":0.048267245},"labels":[],"label_agreement":null},{"id":"W2962832012","doi":"10.4230/lipics.fsttcs.2014.199","title":"Lift &amp; Project Systems Performing on the Partial Vertex Cover Polytope","year":2014,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Combinatorics; Vertex cover; Vertex (graph theory); Approximation algorithm; Mathematics; Polytope; Lift (data mining); Cover (algebra); Relaxation (psychology); Theory of computation; Linear programming relaxation; Discrete mathematics; Graph; Linear programming; Computer science; Mathematical optimization; Algorithm","score_opus":0.036818026451760515,"score_gpt":0.2644570532543573,"score_spread":0.2276390268025968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962832012","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.22050795,0.00052175013,0.7296147,0.0013753785,0.0001422815,0.00032430945,0.0005176397,0.000799122,0.046196975],"genre_scores_gemma":[0.801254,0.00049446576,0.18552586,0.00040206415,0.00013390814,0.00046122275,0.0010732734,0.00028569516,0.010369618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984658,0.0003457758,0.000053264903,0.00030113605,0.00039899145,0.0004349816],"domain_scores_gemma":[0.99560416,0.002656385,0.00039368565,0.0005686606,0.0003082824,0.00046886798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022602116,0.0014411055,0.0013243934,0.00090932974,0.0011490291,0.0024363108,0.0021954463,0.0012617655,0.010912261],"category_scores_gemma":[0.012249834,0.0006004797,0.001545846,0.0010675254,0.001906025,0.0032630914,0.0056234244,0.004732448,0.0010997998],"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.00039935968,0.0001719206,0.0018385742,0.0003189316,0.000054423377,0.0001550879,0.00040804205,0.5638881,0.0027852163,0.3696744,0.0060488824,0.05425708],"study_design_scores_gemma":[0.000025048943,0.00011296308,0.00018632086,0.00002845057,0.000011985912,0.000050280272,0.00008041832,0.8979412,0.001308041,0.098455735,0.0017880849,0.000011482316],"about_ca_topic_score_codex":0.0031926865,"about_ca_topic_score_gemma":0.0027877633,"teacher_disagreement_score":0.010912261,"about_ca_system_score_codex":0.0023302278,"about_ca_system_score_gemma":0.0016771076,"threshold_uncertainty_score":0.036505163},"labels":[],"label_agreement":null},{"id":"W2962852933","doi":"10.5539/cis.v12n3p81","title":"Modeling the Parallelization of the Edmonds-Karp Algorithm and Application","year":2019,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Complexity and Algorithms in Graphs","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":"Computer science; Maximum flow problem; Algorithm; Computation; Minimum cut; Maximum cut; Graph; Theoretical computer science; Combinatorics; Mathematics","score_opus":0.008319934742299261,"score_gpt":0.21917534822446408,"score_spread":0.21085541348216483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962852933","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.022268746,0.00063590624,0.94952434,0.0005638192,0.00013998798,0.0000981588,0.00012195016,0.0005244018,0.026122745],"genre_scores_gemma":[0.4014771,0.0017517228,0.5767583,0.00022850758,0.00013713515,0.0003835889,0.00030769725,0.00043956758,0.018516418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942374,0.00013444212,0.000024796256,0.00014396779,0.00019125636,0.00008183745],"domain_scores_gemma":[0.9993414,0.0002718445,0.0000568446,0.00012134993,0.0001810899,0.00002742159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005541991,0.0006463779,0.0004976302,0.0005440214,0.00052068825,0.0012617824,0.0015774792,0.0009674388,0.0044066077],"category_scores_gemma":[0.0035252622,0.00039460065,0.00060473965,0.0012279202,0.0008679003,0.0018567673,0.0007108153,0.0011922915,0.0010123961],"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.000045364406,0.00004998968,0.0007151093,0.00013123697,0.000020680753,0.00010240151,0.00010206436,0.7421031,0.0022626095,0.21698797,0.003342318,0.034137152],"study_design_scores_gemma":[0.000009174921,0.000008379497,0.00008742243,0.000008997795,0.0000044094645,0.000030212812,0.000011170696,0.95105,0.0010242251,0.03988867,0.007871475,0.000005835489],"about_ca_topic_score_codex":0.008224375,"about_ca_topic_score_gemma":0.004950374,"teacher_disagreement_score":0.008224375,"about_ca_system_score_codex":0.0013672567,"about_ca_system_score_gemma":0.0015297404,"threshold_uncertainty_score":0.016353011},"labels":[],"label_agreement":null},{"id":"W2962981543","doi":"10.4230/lipics.approx-random.2017.18","title":"Approximating Unique Games Using Low Diameter Graph Decomposition","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Minor (academic); Graph; Approximation algorithm; Discrete mathematics","score_opus":0.031841944923086854,"score_gpt":0.3105793707548013,"score_spread":0.27873742583171446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962981543","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.033463243,0.0002777896,0.9597023,0.0003809363,0.000059353886,0.00011326564,0.00017434466,0.00093953684,0.0048892396],"genre_scores_gemma":[0.360293,0.0003460898,0.63302344,0.0003198757,0.000073673706,0.00036066535,0.0007215722,0.00043690353,0.004424718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983693,0.0005024021,0.000068701695,0.0004722296,0.00027168082,0.00031572263],"domain_scores_gemma":[0.99682176,0.0017848896,0.00042491383,0.00052062125,0.00022338892,0.0002243666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013893745,0.00197101,0.0014009344,0.0015972734,0.0008317207,0.0016246978,0.0026242277,0.001458125,0.004723556],"category_scores_gemma":[0.008124851,0.0008831548,0.0017883017,0.0017272268,0.0011036547,0.0033474092,0.0027653556,0.00251988,0.0010544177],"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.00030001384,0.00022903347,0.0017997724,0.00033324427,0.0001123525,0.00017521963,0.00022446952,0.77033776,0.0054292963,0.09993265,0.007672857,0.11345324],"study_design_scores_gemma":[0.00003438994,0.0000613508,0.00013883514,0.000023230596,0.000015939424,0.00006361151,0.00004205282,0.9164533,0.0015623812,0.08017352,0.0014202644,0.000011098685],"about_ca_topic_score_codex":0.0035905577,"about_ca_topic_score_gemma":0.006162835,"teacher_disagreement_score":0.004723556,"about_ca_system_score_codex":0.0024300735,"about_ca_system_score_gemma":0.0013488805,"threshold_uncertainty_score":0.017631471},"labels":[],"label_agreement":null},{"id":"W2963142939","doi":"","title":"Tight Approximation Results for General Covering Integer Programs","year":2002,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Rounding; Combinatorics; Linear programming relaxation; Multiplicative function; Mathematics; Approximation algorithm; Integer (computer science); Upper and lower bounds; Discrete mathematics; Multiplicity (mathematics); Binary logarithm; Cover (algebra); Linear programming; Algorithm; Computer science","score_opus":0.11593665052495218,"score_gpt":0.18446464519539707,"score_spread":0.06852799467044489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963142939","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.03566747,0.0052509764,0.9256208,0.0025676484,0.0002543655,0.00017901388,0.00031343783,0.0011210649,0.02902513],"genre_scores_gemma":[0.52089393,0.0062707816,0.45596197,0.0019114119,0.00095633004,0.00059546094,0.0015864064,0.000994906,0.010828768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99270624,0.002145688,0.0002889431,0.0011080019,0.0022931234,0.0014580407],"domain_scores_gemma":[0.9870051,0.009615066,0.0008040867,0.0015295446,0.0006211261,0.0004249993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076136333,0.002795404,0.003024579,0.002225802,0.0017102275,0.0055490537,0.0040085413,0.0026752455,0.010402147],"category_scores_gemma":[0.03154173,0.001382174,0.0028228343,0.0042958762,0.0028631983,0.009182434,0.004446794,0.007573255,0.0016562303],"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.0006523551,0.0005085964,0.0019636133,0.000776469,0.00023062095,0.00020563188,0.0005099682,0.52498484,0.0031546177,0.3714977,0.011729099,0.08378651],"study_design_scores_gemma":[0.00006520156,0.000102090635,0.00034136925,0.000098564524,0.000074761156,0.00016256914,0.0001059083,0.77850384,0.0011080095,0.21317448,0.006244328,0.000018931427],"about_ca_topic_score_codex":0.0027407946,"about_ca_topic_score_gemma":0.0026870014,"teacher_disagreement_score":0.010402147,"about_ca_system_score_codex":0.005175199,"about_ca_system_score_gemma":0.0022331593,"threshold_uncertainty_score":0.040265203},"labels":[],"label_agreement":null},{"id":"W2963282726","doi":"10.4230/lipics.icalp.2016.74","title":"Approximating Directed Steiner Problems via Tree Embedding","year":2016,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Approximation algorithm; Directed acyclic graph; Feedback arc set; Directed graph; Discrete mathematics; Vertex (graph theory); Disjoint sets; Embedding; Covering problems; Graph; Computer science; Set (abstract data type); Line graph","score_opus":0.01862077904121224,"score_gpt":0.24849855334000945,"score_spread":0.22987777429879722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963282726","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.07121268,0.0029391232,0.90876305,0.0010232342,0.000199218,0.00013462908,0.0009397403,0.001433485,0.013354797],"genre_scores_gemma":[0.4688536,0.0026077598,0.5168105,0.00034074794,0.00016269583,0.00026535706,0.003788364,0.00040981066,0.0067611285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989691,0.00033999438,0.000060364317,0.00023428701,0.00025920154,0.00013702601],"domain_scores_gemma":[0.99749446,0.0016538665,0.00020799004,0.00033476812,0.00019966035,0.00010932474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009060558,0.0012911992,0.0012386327,0.0012167924,0.0004479134,0.0016870253,0.001668119,0.0014705062,0.0043762783],"category_scores_gemma":[0.007670878,0.0007168275,0.0009761908,0.0023165417,0.0005737139,0.0040818662,0.0018035871,0.00199836,0.0011711495],"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.00023624075,0.0001448374,0.0016675415,0.00040969302,0.000102386286,0.00013477149,0.00014896064,0.792086,0.0016388088,0.0583241,0.012762781,0.132344],"study_design_scores_gemma":[0.000021704158,0.000038330305,0.00014445372,0.000027431654,0.000012566315,0.000049382867,0.000041442017,0.9423939,0.00036636947,0.05430799,0.0025906316,0.000005868218],"about_ca_topic_score_codex":0.0021169279,"about_ca_topic_score_gemma":0.003295666,"teacher_disagreement_score":0.0043762783,"about_ca_system_score_codex":0.0013021468,"about_ca_system_score_gemma":0.00097336713,"threshold_uncertainty_score":0.014640152},"labels":[],"label_agreement":null},{"id":"W2963428578","doi":"10.1007/s00453-016-0270-4","title":"Approximating (Unweighted) Tree Augmentation via Lift-and-Project, Part I: Stemless TAP","year":2017,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":24,"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":"Theory of computation; Linear programming relaxation; Mathematics; Relaxation (psychology); Combinatorics; Approximation algorithm; Tree (set theory); Type (biology); Integer programming; Discrete mathematics; Algorithm","score_opus":0.03793119707476595,"score_gpt":0.2855363821876297,"score_spread":0.24760518511286378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963428578","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.11538774,0.00059573987,0.86178225,0.00076551293,0.0002128824,0.00018897011,0.00096750795,0.0055681234,0.014531339],"genre_scores_gemma":[0.42877832,0.00041604167,0.5589036,0.00033600538,0.00015675118,0.00030604756,0.0022336605,0.00085051486,0.008019085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989814,0.00021187332,0.00004830573,0.00020986896,0.000332762,0.00021569786],"domain_scores_gemma":[0.9961434,0.001688706,0.0001717967,0.0014211871,0.00033556492,0.00023933318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00120736,0.001279837,0.0015575064,0.0010102128,0.0006756277,0.0019211575,0.0025694317,0.0016060981,0.011115444],"category_scores_gemma":[0.008196891,0.00057095557,0.0012711363,0.0019086973,0.0014134437,0.0046838718,0.0039770138,0.002931156,0.0032855729],"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.0014545687,0.0007534849,0.0038907146,0.00086735166,0.00010628702,0.00042433414,0.00053607003,0.20864277,0.02230925,0.14522177,0.039242484,0.57655096],"study_design_scores_gemma":[0.00009313792,0.00020775016,0.00044732218,0.00006032552,0.00005579689,0.00026668576,0.00015565153,0.7968714,0.0073465677,0.18974005,0.0047353413,0.000019952067],"about_ca_topic_score_codex":0.0013724262,"about_ca_topic_score_gemma":0.002867449,"teacher_disagreement_score":0.011115444,"about_ca_system_score_codex":0.00088213844,"about_ca_system_score_gemma":0.0017519146,"threshold_uncertainty_score":0.037184834},"labels":[],"label_agreement":null},{"id":"W2963453098","doi":"10.26421/qic16.9-10-7","title":"Optimal bounds on functions of quantum states under quantum channels","year":2016,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo; National Natural Science Foundation of China; National Science Foundation","keywords":"Mathematics; Unitary state; Quantum channel; Quantum capacity; Quantum; Quantum relative entropy; Quantum operation; Amplitude damping channel; Quantum state; Quantum discord; Quantum information; Quantum mechanics; Physics; Quantum network; Quantum entanglement; Quantum dynamics","score_opus":0.02441186057763021,"score_gpt":0.2592676610873413,"score_spread":0.23485580050971108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963453098","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.24539144,0.0038934662,0.6964968,0.00514769,0.00023252939,0.00018837505,0.0007779677,0.00097575417,0.046896014],"genre_scores_gemma":[0.9113518,0.0014585763,0.08028357,0.0005540151,0.00027023218,0.0003586717,0.0004828235,0.0005345349,0.004705671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934123,0.00274508,0.00019400306,0.0009274268,0.0012091531,0.0015121248],"domain_scores_gemma":[0.9444432,0.04516651,0.0017566229,0.0044936705,0.0019158635,0.0022241652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009443678,0.0026662508,0.0024874548,0.0031973107,0.001847629,0.0056097195,0.0033697449,0.003453548,0.0058758073],"category_scores_gemma":[0.0554755,0.0011554115,0.0010585836,0.0022649772,0.006170676,0.012775908,0.0066130213,0.004452022,0.0007196125],"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.0006248229,0.00015079227,0.00073898927,0.00022791525,0.0000658426,0.000058433423,0.00029317345,0.23637344,0.002185383,0.7383523,0.0032608134,0.0176681],"study_design_scores_gemma":[0.00004369526,0.00007476977,0.00030783194,0.00008122331,0.000028014772,0.0000381459,0.00009502743,0.42064872,0.0020297745,0.5754633,0.0011501189,0.00003935329],"about_ca_topic_score_codex":0.001964914,"about_ca_topic_score_gemma":0.0019144535,"teacher_disagreement_score":0.009443678,"about_ca_system_score_codex":0.007695694,"about_ca_system_score_gemma":0.003566233,"threshold_uncertainty_score":0.05583638},"labels":[],"label_agreement":null},{"id":"W2963480423","doi":"10.1007/s40305-019-00260-1","title":"Approximation Algorithms for Vertex Happiness","year":2019,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Complexity and Algorithms in Graphs","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 Alberta","funders":"Natural Science Foundation of Shandong Province; China Scholarship Council; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Hypergraph; Vertex (graph theory); Approximation algorithm; Inverse; Upper and lower bounds; Mathematics; Linear programming relaxation; Physics; Discrete mathematics; Graph; Algorithm; Linear programming; Mathematical analysis","score_opus":0.06820800589132216,"score_gpt":0.3611336697797232,"score_spread":0.2929256638884011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963480423","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.11061266,0.00300733,0.83478504,0.0067314273,0.00058070803,0.0005314012,0.0026268424,0.002648627,0.03847593],"genre_scores_gemma":[0.57157385,0.002218866,0.3867393,0.0011112433,0.00067230983,0.0007553006,0.005069796,0.0011165345,0.030742785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720675,0.0007594755,0.00012852269,0.0007217766,0.0005619768,0.0006215767],"domain_scores_gemma":[0.99179244,0.0044180094,0.0004839331,0.0019395205,0.0006630238,0.00070313684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029451626,0.0022600847,0.0030669358,0.0033650962,0.0027541416,0.0060742423,0.006092588,0.0028799265,0.018202014],"category_scores_gemma":[0.017139262,0.0012395527,0.0036016228,0.006396853,0.0023258,0.010810542,0.0056543,0.006616477,0.0028113893],"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.0013304756,0.00072605273,0.0038109785,0.00053278764,0.00030142866,0.00014304205,0.0008155916,0.19011943,0.001968338,0.47042283,0.04982009,0.28000897],"study_design_scores_gemma":[0.00012385541,0.000084489766,0.00045961377,0.00006747208,0.00013027035,0.00011268069,0.00026540048,0.54293483,0.001290093,0.44769704,0.006807658,0.00002666297],"about_ca_topic_score_codex":0.0049911826,"about_ca_topic_score_gemma":0.006221277,"teacher_disagreement_score":0.018202014,"about_ca_system_score_codex":0.0051430454,"about_ca_system_score_gemma":0.0043269764,"threshold_uncertainty_score":0.060891807},"labels":[],"label_agreement":null},{"id":"W2963521484","doi":"","title":"On the Reducibility of Submodular Functions","year":2016,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Complexity and Algorithms in Graphs","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":"Submodular set function; Scalability; Mathematical optimization; Usability; Computer science; Perturbation (astronomy); Optimization problem; Mathematics","score_opus":0.1532288713078988,"score_gpt":0.3317812565828719,"score_spread":0.17855238527497308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963521484","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.039758906,0.0010910962,0.95132965,0.0008245729,0.000059329996,0.0001227974,0.00014122252,0.00045212373,0.006220358],"genre_scores_gemma":[0.67155784,0.0021643373,0.32106805,0.0004841597,0.00028219598,0.00039565683,0.0005086724,0.00033224357,0.003206907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683374,0.0016050731,0.00010672476,0.0004611336,0.00076836476,0.00022502028],"domain_scores_gemma":[0.98830765,0.008849032,0.0005313492,0.0016188916,0.00045472028,0.000238354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056293095,0.0018366947,0.0017305689,0.0012341611,0.0006779995,0.002104349,0.0010893969,0.0008908377,0.0027309798],"category_scores_gemma":[0.02304803,0.0005370841,0.0013962334,0.0011281698,0.0030179806,0.004285924,0.0028172426,0.0044266717,0.0005006247],"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.00026305593,0.00017092313,0.0013619749,0.00028024506,0.0000972721,0.00015537502,0.00021868969,0.61894584,0.004880059,0.28025952,0.003080126,0.09028691],"study_design_scores_gemma":[0.000022932905,0.00011800835,0.00024386111,0.000042941414,0.000021716767,0.00007956476,0.000032404638,0.77577853,0.0017803815,0.22007385,0.0017927067,0.00001320728],"about_ca_topic_score_codex":0.0009671011,"about_ca_topic_score_gemma":0.0006462276,"teacher_disagreement_score":0.0056293095,"about_ca_system_score_codex":0.0013188124,"about_ca_system_score_gemma":0.0011260456,"threshold_uncertainty_score":0.02977103},"labels":[],"label_agreement":null},{"id":"W2963693432","doi":"10.5555/2634074.2634192","title":"Parameters of two-prover-one-round game and the hardness of connectivity problems","year":2014,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":27,"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":"Soundness; Connection (principal bundle); Hardness of approximation; Gas meter prover; Constant (computer programming); Class (philosophy); Task (project management); Mathematics; Computer science; Discrete mathematics; Approximation algorithm; Combinatorics; Artificial intelligence; Mathematical proof","score_opus":0.019540559395912687,"score_gpt":0.24631809929912094,"score_spread":0.22677753990320826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963693432","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.10845279,0.0011107756,0.846444,0.007620542,0.00025082385,0.00051588373,0.0015173225,0.0010878431,0.032999936],"genre_scores_gemma":[0.7922494,0.0013974672,0.19230983,0.0014208107,0.00040148414,0.0011223728,0.001406295,0.0007168493,0.008975576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98809075,0.0049828067,0.00066453323,0.0028792946,0.0019391823,0.0014433818],"domain_scores_gemma":[0.931049,0.05362459,0.0033817773,0.008072866,0.0015093948,0.002362494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063625486,0.0019650664,0.002657784,0.0009564748,0.0018046062,0.005543052,0.005467542,0.0035738493,0.01047215],"category_scores_gemma":[0.055978414,0.0014816208,0.0030101058,0.0014265887,0.0047806613,0.017993404,0.0052877935,0.010622882,0.0012940809],"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.0011738571,0.00033464705,0.0035407566,0.00082312216,0.0002244564,0.00027519505,0.0010138962,0.23486856,0.005276635,0.70581955,0.010511239,0.036138125],"study_design_scores_gemma":[0.00014065632,0.00013535922,0.00053496927,0.00008933713,0.00008210696,0.0002469514,0.00020755983,0.25397438,0.0020771546,0.7374439,0.005004606,0.00006302322],"about_ca_topic_score_codex":0.0017339101,"about_ca_topic_score_gemma":0.0015358501,"teacher_disagreement_score":0.01047215,"about_ca_system_score_codex":0.0040807496,"about_ca_system_score_gemma":0.0032027392,"threshold_uncertainty_score":0.03503281},"labels":[],"label_agreement":null},{"id":"W2963978854","doi":"10.1016/j.dam.2019.03.016","title":"Polynomial size linear programs for problems in P","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Polytope; Combinatorics; Birkhoff polytope; Disjoint sets; Matching (statistics); Vertex (graph theory); Time complexity; Discrete mathematics; Logarithm; Graph","score_opus":0.021778639285503373,"score_gpt":0.25186257221554487,"score_spread":0.23008393293004148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963978854","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.15235017,0.0022431633,0.6915571,0.025451116,0.00055405207,0.00090460974,0.0039822194,0.0025876344,0.12036999],"genre_scores_gemma":[0.6714418,0.002259411,0.24410228,0.0021854357,0.0013477864,0.0012140186,0.0042651356,0.0012595374,0.071924575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749136,0.00057275227,0.00010972383,0.00076829037,0.00058839656,0.00046946245],"domain_scores_gemma":[0.98551697,0.012111098,0.0006576691,0.00077117217,0.0005154673,0.00042763297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016957775,0.0016081011,0.0014319031,0.0011796987,0.0017611679,0.0056230295,0.0027432302,0.0023163059,0.01975081],"category_scores_gemma":[0.015892664,0.0011078491,0.0019457485,0.0026838048,0.0023266189,0.010816979,0.0031704651,0.008074791,0.0023885735],"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.0007990942,0.0007015872,0.0015527459,0.0014045165,0.00012316556,0.0001846992,0.0007541284,0.06346587,0.0040893825,0.80151874,0.03663112,0.08877495],"study_design_scores_gemma":[0.00017469765,0.000068754,0.00043011433,0.000058943733,0.00005687115,0.00012512626,0.00015630851,0.11898835,0.0022675162,0.86783683,0.009813585,0.00002287386],"about_ca_topic_score_codex":0.0038313894,"about_ca_topic_score_gemma":0.006284131,"teacher_disagreement_score":0.01975081,"about_ca_system_score_codex":0.0041140164,"about_ca_system_score_gemma":0.0027137063,"threshold_uncertainty_score":0.066073},"labels":[],"label_agreement":null},{"id":"W2964263868","doi":"10.4086/toc.2017.v013a020","title":"","year":2017,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Approximation algorithm; Bottleneck; Omega; Cardinality (data modeling); Upper and lower bounds; Hardness of approximation; Discrete mathematics; Mathematical analysis; Physics; Computer science","score_opus":0.039146009935173795,"score_gpt":0.2882293159106371,"score_spread":0.2490833059754633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964263868","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.056790005,0.0004619364,0.9141019,0.0019660844,0.0001192955,0.00026797212,0.0007088224,0.00057713944,0.025006805],"genre_scores_gemma":[0.6439959,0.0011515142,0.33192608,0.00054207,0.0003031511,0.00037320875,0.0016555235,0.00031017812,0.01974239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890006,0.00030410895,0.000049617774,0.00038304142,0.00016785077,0.00019525064],"domain_scores_gemma":[0.9955778,0.002786733,0.00040355016,0.00053403823,0.00040568673,0.00029228517],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001883392,0.00090410426,0.00084254914,0.0006009457,0.0012541536,0.0020958548,0.001912328,0.0014095568,0.0092417365],"category_scores_gemma":[0.0080185225,0.00040717117,0.0011381919,0.0012355937,0.0011734718,0.004148416,0.0017696215,0.0020237889,0.0014387688],"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.00029816167,0.00028377134,0.0016608798,0.00061995693,0.00011348407,0.00030537622,0.00041075778,0.49208233,0.006071967,0.34421313,0.016889708,0.13705046],"study_design_scores_gemma":[0.00002261086,0.00009809804,0.00046269238,0.000038890154,0.000034203105,0.00024823725,0.00025934944,0.69106096,0.0058375415,0.29095167,0.0109681245,0.000017652637],"about_ca_topic_score_codex":0.0019416091,"about_ca_topic_score_gemma":0.0023489168,"teacher_disagreement_score":0.99075824,"about_ca_system_score_codex":0.0015470012,"about_ca_system_score_gemma":0.0017221966,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2964762712","doi":"","title":"On Mean Estimation for General Norms with Statistical Queries.","year":2019,"lang":"en","type":"article","venue":"Conference on Learning Theory","topic":"Complexity and Algorithms in Graphs","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":"Normed vector space; Combinatorics; Distribution (mathematics); Mathematics; Oracle; Norm (philosophy); Space (punctuation); Upper and lower bounds; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.018141449130913694,"score_gpt":0.26121175711567746,"score_spread":0.24307030798476376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964762712","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.034537174,0.0023249353,0.9541986,0.0042868634,0.00012287979,0.00014664393,0.0005859716,0.0007038707,0.0030931232],"genre_scores_gemma":[0.6055234,0.003230072,0.3758132,0.002399247,0.0018326988,0.0008405748,0.0029172048,0.0008373401,0.006606228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98118776,0.009600726,0.0008153176,0.0033445621,0.003750969,0.0013005369],"domain_scores_gemma":[0.7761577,0.19825785,0.007528964,0.011513142,0.0041393354,0.002403044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018479917,0.002515575,0.0045671263,0.0023478991,0.0020950243,0.0058996733,0.006954592,0.0051452783,0.0053567705],"category_scores_gemma":[0.12691386,0.0013612069,0.0025746087,0.004535113,0.0065711904,0.022821717,0.008077897,0.008667697,0.0013712471],"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.0014755065,0.0005200987,0.0063327285,0.0008513729,0.00039126142,0.000493318,0.0012452436,0.2814725,0.0037278056,0.6086988,0.012699053,0.082092226],"study_design_scores_gemma":[0.00005183742,0.00010626979,0.000504309,0.000034332832,0.00003499627,0.00020425118,0.00012610249,0.5628596,0.0010016062,0.43387285,0.0011656837,0.000038111502],"about_ca_topic_score_codex":0.004045252,"about_ca_topic_score_gemma":0.002233102,"teacher_disagreement_score":0.018479917,"about_ca_system_score_codex":0.0051478636,"about_ca_system_score_gemma":0.0034011318,"threshold_uncertainty_score":0.097732306},"labels":[],"label_agreement":null},{"id":"W2965474919","doi":"10.4230/lipics.ccc.2019.1","title":"Criticality of Regular Formulas","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Mathematics; Combinatorics; Boolean function; Upper and lower bounds; Satisfiability; Discrete mathematics; Bounded function; Criticality; Function (biology); Pigeonhole principle; Lemma (botany); Tree (set theory); Class (philosophy); Computer science","score_opus":0.01088334422631499,"score_gpt":0.24616431488463897,"score_spread":0.23528097065832398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965474919","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.73683673,0.0018925839,0.21687134,0.0017751192,0.00013870183,0.00024145983,0.0015182531,0.0012172997,0.0395085],"genre_scores_gemma":[0.98320454,0.00028366948,0.012242597,0.00035532078,0.00015040107,0.0001195521,0.000533408,0.000119900345,0.0029905064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998162,0.00021427344,0.00010648343,0.0006069208,0.00050503423,0.00040531287],"domain_scores_gemma":[0.9833745,0.0115975775,0.0015317522,0.0011028583,0.00139614,0.0009970771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012186372,0.0006312627,0.00081013987,0.002486006,0.0010902035,0.0025724398,0.0012112049,0.00063467113,0.0057449522],"category_scores_gemma":[0.015690528,0.0005195135,0.00075549056,0.0009457064,0.0024357708,0.0033924652,0.0017370773,0.0021212294,0.000528033],"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.0013082299,0.000231748,0.019064654,0.000738708,0.0001694976,0.001238476,0.0014165789,0.041132063,0.047257353,0.78736115,0.009388436,0.09069314],"study_design_scores_gemma":[0.00013723077,0.00027412738,0.003951905,0.00011813391,0.00012217995,0.0011959292,0.00025165803,0.1611007,0.028365895,0.7938765,0.010532892,0.00007286498],"about_ca_topic_score_codex":0.0016535368,"about_ca_topic_score_gemma":0.0011603058,"teacher_disagreement_score":0.0057449522,"about_ca_system_score_codex":0.0024059173,"about_ca_system_score_gemma":0.0011395643,"threshold_uncertainty_score":0.019218802},"labels":[],"label_agreement":null},{"id":"W2965722881","doi":"10.4230/lipics.ccc.2019.29","title":"Optimal Separation and Strong Direct Sum for Randomized Query Complexity","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Mathematics; Bounded function; Function (biology); Randomized algorithm; Communication complexity; Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.022314205953207728,"score_gpt":0.28291295491487933,"score_spread":0.2605987489616716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965722881","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.082975134,0.0023344602,0.8636179,0.010188518,0.0003285934,0.00027174043,0.0012215935,0.002172075,0.036890067],"genre_scores_gemma":[0.79172033,0.0014998963,0.18426123,0.0034401861,0.0011410282,0.0010973403,0.0014253185,0.0013809162,0.014033684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9816651,0.0054848013,0.00083095755,0.0040234327,0.0053765825,0.0026191652],"domain_scores_gemma":[0.9117302,0.06800141,0.0026237322,0.012036547,0.003308086,0.002300033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009937334,0.0026262314,0.003394947,0.0019246761,0.0019704003,0.006321714,0.0056692227,0.0029544807,0.016345555],"category_scores_gemma":[0.06809301,0.0013813659,0.0036052677,0.003152049,0.0065872124,0.022071421,0.010314232,0.009990661,0.0031574697],"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.0015198449,0.0005330705,0.003000285,0.00068219966,0.00017575949,0.000216651,0.0005541359,0.093790375,0.0058065993,0.81010336,0.014693667,0.068924084],"study_design_scores_gemma":[0.00019051103,0.00010932671,0.00065195013,0.000054882563,0.00008297791,0.0001519879,0.000087457855,0.3238995,0.0036800618,0.66824675,0.0027929111,0.000051773357],"about_ca_topic_score_codex":0.0021109811,"about_ca_topic_score_gemma":0.0018860552,"teacher_disagreement_score":0.016345555,"about_ca_system_score_codex":0.0072544278,"about_ca_system_score_gemma":0.0060592904,"threshold_uncertainty_score":0.05468136},"labels":[],"label_agreement":null},{"id":"W2965739697","doi":"10.1137/1.9781611975994.125","title":"Testing convexity of functions over finite domains","year":2019,"lang":"en","type":"preprint","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","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":"Agence Nationale de la Recherche","keywords":"Convexity; Upper and lower bounds; Omega; Dimension (graph theory); Combinatorics; Mathematics; Exponential function; Discrete mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.11022867870056438,"score_gpt":0.2708677481782521,"score_spread":0.16063906947768772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965739697","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.32758948,0.00068459276,0.65296996,0.0032518525,0.000091036905,0.00053671387,0.0014458034,0.0029745365,0.0104560545],"genre_scores_gemma":[0.89903647,0.00024594826,0.096314095,0.0004873135,0.0001453226,0.00036884838,0.0015045698,0.00047781144,0.0014196225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97417295,0.0078265555,0.0020572157,0.0047672666,0.0073587876,0.003817128],"domain_scores_gemma":[0.7232475,0.22256137,0.008617911,0.03420004,0.0068682097,0.0045049735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01040716,0.00202355,0.002661315,0.0024652716,0.0016616866,0.006442982,0.0059792018,0.0026939565,0.0048345877],"category_scores_gemma":[0.100893766,0.0012272146,0.003792771,0.0031068928,0.0064101955,0.01832185,0.0071666385,0.0077152695,0.0008042472],"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.003956628,0.0017441434,0.060715448,0.0010360056,0.00057324936,0.0013688223,0.0011361134,0.4759814,0.048275076,0.21916106,0.009785284,0.1762668],"study_design_scores_gemma":[0.00013599108,0.00037668098,0.004588579,0.00005374626,0.00008967579,0.00046819108,0.0002886892,0.8501694,0.022089036,0.12000916,0.001653616,0.0000772386],"about_ca_topic_score_codex":0.004174609,"about_ca_topic_score_gemma":0.003281052,"teacher_disagreement_score":0.01040716,"about_ca_system_score_codex":0.0044439114,"about_ca_system_score_gemma":0.004228703,"threshold_uncertainty_score":0.05503899},"labels":[],"label_agreement":null},{"id":"W2966301123","doi":"10.48550/arxiv.1904.13056","title":"Query-to-Communication Lifting Using Low-Discrepancy Gadgets","year":2019,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"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; Simons Institute for the Theory of Computing, University of California Berkeley; Israel Science Foundation; University of Haifa; National Science Foundation","keywords":"Gadget; Mathematical proof; Computer science; Entropy (arrow of time); Mathematics; Theoretical computer science; Discrete mathematics; Algorithm; Physics; Geometry","score_opus":0.061439192178204836,"score_gpt":0.19053401698626188,"score_spread":0.12909482480805703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966301123","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.15752436,0.0005757081,0.8201104,0.0018096925,0.00026553433,0.0003311896,0.0005528751,0.0033396562,0.015490667],"genre_scores_gemma":[0.72563905,0.0005066056,0.26058558,0.0012671822,0.00035950192,0.00066055526,0.0010122136,0.0009618092,0.009007426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99327457,0.0012533572,0.0004966334,0.001644275,0.001955354,0.0013758086],"domain_scores_gemma":[0.9743706,0.015335397,0.00089775363,0.0074194972,0.0010005394,0.0009761292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004641586,0.0016340774,0.002287133,0.0011548597,0.0015827866,0.0047400948,0.0034637626,0.0019513385,0.008141418],"category_scores_gemma":[0.027829895,0.0011516184,0.0033910754,0.0018316262,0.0032084498,0.010597924,0.010075052,0.0064597153,0.0022067116],"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.0019360194,0.0005621986,0.003032425,0.00064939563,0.00011299881,0.0004786047,0.0008282531,0.09733548,0.026592098,0.7387507,0.011264343,0.11845745],"study_design_scores_gemma":[0.00022472767,0.00039398565,0.000525935,0.00008221313,0.000102558944,0.00038000397,0.00011747894,0.37252492,0.01694245,0.60234874,0.0062714946,0.00008547215],"about_ca_topic_score_codex":0.0010373485,"about_ca_topic_score_gemma":0.0010204643,"teacher_disagreement_score":0.008141418,"about_ca_system_score_codex":0.002848792,"about_ca_system_score_gemma":0.0026583627,"threshold_uncertainty_score":0.027235806},"labels":[],"label_agreement":null},{"id":"W2966778654","doi":"10.48550/arxiv.1907.12152","title":"Faster asynchronous MST and low diameter tree construction with sublinear communication","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Sublinear function; Asynchronous communication; Spanning tree; Combinatorics; Time complexity; Tree (set theory); Binary logarithm; Minimum spanning tree; Node (physics); Discrete mathematics; Distributed algorithm; Communication complexity; Computer science; Algorithm; Mathematics; Distributed computing; Computer network; Physics","score_opus":0.04062886627540778,"score_gpt":0.1706604096371833,"score_spread":0.13003154336177553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966778654","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.025418192,0.0002588569,0.96320075,0.0006898592,0.0001327775,0.000080448335,0.00024912192,0.0024223498,0.007547548],"genre_scores_gemma":[0.27383012,0.00031076258,0.7134921,0.0003420355,0.00023615206,0.00037663465,0.0010597166,0.00075048005,0.009602009],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988695,0.00026074797,0.00007475501,0.0002836762,0.00037201546,0.00013932431],"domain_scores_gemma":[0.9968424,0.0013553441,0.00026599804,0.0009747153,0.00039809625,0.00016355314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010488573,0.00079738314,0.00066696445,0.0009910035,0.0009987083,0.0011481451,0.0016725225,0.0009620938,0.0068197716],"category_scores_gemma":[0.005690961,0.00043656534,0.00093873515,0.001294384,0.00066203333,0.0040324777,0.0019210039,0.0016949662,0.002284999],"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.0014069919,0.00033790045,0.0022668275,0.0006511786,0.00009202136,0.0003901272,0.000623377,0.25205547,0.072818965,0.28365377,0.03421589,0.35148746],"study_design_scores_gemma":[0.00016270735,0.00016256621,0.0005159227,0.000030598436,0.00004103526,0.00023970754,0.000066148306,0.8436939,0.0127622215,0.12980488,0.012494161,0.000026157308],"about_ca_topic_score_codex":0.0019732942,"about_ca_topic_score_gemma":0.0029908987,"teacher_disagreement_score":0.0068197716,"about_ca_system_score_codex":0.0013151234,"about_ca_system_score_gemma":0.0010751863,"threshold_uncertainty_score":0.022814453},"labels":[],"label_agreement":null},{"id":"W2971016812","doi":"10.5802/ojmo.2","title":"Revisiting a Cutting-Plane Method for Perfect Matchings","year":2020,"lang":"en","type":"preprint","venue":"Open Journal of Mathematical Optimization","topic":"Complexity and Algorithms in Graphs","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":"Carleton University; University of Toronto","funders":"","keywords":"Counterexample; Linear programming; Uniqueness; Mathematics; Cutting-plane method; Matching (statistics); Algorithm; Mathematical optimization; Point (geometry); Polynomial; Sequence (biology); Time complexity; Applied mathematics; Discrete mathematics; Integer programming; Mathematical analysis; Geometry","score_opus":0.06268050422370516,"score_gpt":0.3521685173705242,"score_spread":0.28948801314681905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971016812","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.0017575801,0.00034758012,0.9936132,0.00022615961,0.00013610993,0.000069173984,0.00006772551,0.00038658816,0.0033958966],"genre_scores_gemma":[0.027363798,0.0005664735,0.96575457,0.00023127883,0.00015097224,0.000163355,0.00024988514,0.0005491649,0.004970453],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754274,0.00055822235,0.00015518436,0.0005407238,0.0010172363,0.0001859254],"domain_scores_gemma":[0.997494,0.0014109152,0.000121371195,0.00041316156,0.00046773782,0.00009273825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025176315,0.0020873107,0.0020507777,0.0022307,0.001002874,0.0023103587,0.0034925863,0.0028944171,0.016092021],"category_scores_gemma":[0.009480339,0.0015649193,0.0037282314,0.0029967786,0.0016019805,0.004439637,0.0036419753,0.005876025,0.0048141414],"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.00021330564,0.00023033547,0.00061125506,0.00063588907,0.00018072697,0.00020613654,0.00028063095,0.2646155,0.007697653,0.25194424,0.01364791,0.45973647],"study_design_scores_gemma":[0.00008357268,0.00010845288,0.0001213339,0.0001018196,0.00004195483,0.00013393714,0.00005514527,0.8078227,0.0019173693,0.16270307,0.02687632,0.000034229965],"about_ca_topic_score_codex":0.0050433916,"about_ca_topic_score_gemma":0.0048911674,"teacher_disagreement_score":0.016092021,"about_ca_system_score_codex":0.0015261271,"about_ca_system_score_gemma":0.002018254,"threshold_uncertainty_score":0.053833187},"labels":[],"label_agreement":null},{"id":"W2971886964","doi":"10.1145/3444942","title":"Parameterized Intractability of Even Set and Shortest Vector Problem","year":2021,"lang":"en","type":"preprint","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, India; Exploratory Research for Advanced Technology; National University of Singapore; Japan Society for the Promotion of Science; Indian Institute of Science","keywords":"Parameterized complexity; Combinatorics; Mathematics; Norm (philosophy); Integer (computer science); Discrete mathematics; Lattice problem; Algorithm; Computer science","score_opus":0.041255141436941915,"score_gpt":0.28014397014508674,"score_spread":0.23888882870814482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971886964","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.32712913,0.0014612803,0.6143458,0.015135418,0.00032555062,0.0005161721,0.008263252,0.0033539368,0.029469462],"genre_scores_gemma":[0.8024409,0.001039634,0.17200717,0.0015949698,0.00057596934,0.0009142717,0.00800557,0.0012949737,0.012126517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9917115,0.00243865,0.00045162294,0.002625091,0.0015300129,0.0012431506],"domain_scores_gemma":[0.96804774,0.022606317,0.0022587308,0.005132248,0.0010028622,0.000952134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031662574,0.0017385938,0.003089611,0.00091270206,0.0023144237,0.0070557,0.005142987,0.0027115417,0.012894889],"category_scores_gemma":[0.026800942,0.0010000265,0.0030737782,0.003184018,0.0036505784,0.01715843,0.0043887636,0.0081987595,0.0016045346],"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.001821713,0.00072732894,0.004288649,0.0009860252,0.0003719271,0.0004150856,0.0009886128,0.24480341,0.007322604,0.6250395,0.038025413,0.07520969],"study_design_scores_gemma":[0.00022535419,0.00008592414,0.0006696008,0.00006122022,0.000091420945,0.00025652748,0.00022548299,0.2643459,0.0045054965,0.7239191,0.005541414,0.00007247901],"about_ca_topic_score_codex":0.0035675126,"about_ca_topic_score_gemma":0.0036980305,"teacher_disagreement_score":0.012894889,"about_ca_system_score_codex":0.0051882705,"about_ca_system_score_gemma":0.004512896,"threshold_uncertainty_score":0.04313773},"labels":[],"label_agreement":null},{"id":"W2975606440","doi":"10.48550/arxiv.1909.11147","title":"Random $k$-out subgraph leaves only $O(n/k)$ inter-component edges","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Combinatorics; Vertex connectivity; Mathematics; Randomness; Graph; Conjecture; Binary logarithm; Vertex (graph theory); Simple graph; Connected component; Discrete mathematics; Statistics","score_opus":0.0752443634174639,"score_gpt":0.19537591121422587,"score_spread":0.12013154779676197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975606440","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.47839886,0.00041546463,0.48173723,0.0074871406,0.00019950129,0.00090522895,0.0028447495,0.003481226,0.024530673],"genre_scores_gemma":[0.90941197,0.00019308917,0.07681711,0.00069030345,0.00007925551,0.00063703296,0.0016206306,0.00043091888,0.010119721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966853,0.0013558608,0.00017969357,0.0008129278,0.0005637619,0.0004024156],"domain_scores_gemma":[0.9882118,0.0046614488,0.0008085121,0.0053654327,0.00047318832,0.00047957516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019829453,0.0008365569,0.0015142572,0.0005986654,0.00215993,0.0018314369,0.0030454842,0.00173783,0.008151525],"category_scores_gemma":[0.009657968,0.0007991266,0.0015624899,0.00096743426,0.0018553019,0.0052874745,0.0036014463,0.0017882516,0.0031814764],"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.010003214,0.0015361477,0.028236868,0.0017364569,0.0013617056,0.0017383674,0.002258179,0.24160273,0.18190275,0.28372756,0.051342975,0.19455317],"study_design_scores_gemma":[0.0009381554,0.0005954286,0.006637657,0.00010505985,0.00042843082,0.0018038859,0.0006522254,0.6057988,0.08908811,0.27499637,0.018765489,0.00019046737],"about_ca_topic_score_codex":0.0011822782,"about_ca_topic_score_gemma":0.0033752553,"teacher_disagreement_score":0.008151525,"about_ca_system_score_codex":0.0015785679,"about_ca_system_score_gemma":0.0019825243,"threshold_uncertainty_score":0.027269602},"labels":[],"label_agreement":null},{"id":"W2979731478","doi":"10.1145/3341599","title":"A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Combinatorics; Multigraph; Mathematics; Approximation algorithm; Enhanced Data Rates for GSM Evolution; Vertex connectivity; Induced subgraph isomorphism problem; Subgraph isomorphism problem; Reduction (mathematics); Vertex cover; Discrete mathematics; Algorithm; Computer science; Graph; Line graph; Vertex (graph theory); Artificial intelligence","score_opus":0.024085918305266994,"score_gpt":0.25529014395202443,"score_spread":0.23120422564675744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979731478","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.033638746,0.0008139488,0.9476537,0.0013114542,0.00026420638,0.0003783236,0.0007356115,0.0044004847,0.010803435],"genre_scores_gemma":[0.12658885,0.00037023102,0.86509794,0.00045483332,0.000109752495,0.00045511557,0.0020800836,0.0005007941,0.004342412],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858886,0.00022904336,0.00008878329,0.0003562016,0.0004232771,0.00031372235],"domain_scores_gemma":[0.99857366,0.00059160724,0.00012433932,0.00042598098,0.0001722094,0.00011207985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009181083,0.0019285209,0.0015200308,0.0013894651,0.0009309235,0.0016583367,0.002718502,0.002199435,0.009850191],"category_scores_gemma":[0.004515752,0.000739165,0.0017178949,0.002482859,0.0007926958,0.0037751014,0.0022588961,0.0031325703,0.0035834883],"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.0016021654,0.0009180702,0.0016649116,0.0006625517,0.0002209219,0.0004265341,0.00045202684,0.28577194,0.020035058,0.06566691,0.06088966,0.5616892],"study_design_scores_gemma":[0.00039167277,0.00027208746,0.0006653413,0.000062806364,0.00008376214,0.00060527114,0.00016577677,0.8789139,0.007832309,0.09474818,0.01620807,0.000050880673],"about_ca_topic_score_codex":0.004735387,"about_ca_topic_score_gemma":0.0064320564,"teacher_disagreement_score":0.009850191,"about_ca_system_score_codex":0.0023471352,"about_ca_system_score_gemma":0.0027385966,"threshold_uncertainty_score":0.03295219},"labels":[],"label_agreement":null},{"id":"W2981503891","doi":"10.48550/arxiv.1910.10571","title":"Faster p-norm minimizing flows, via smoothed q-norm problems","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Norm (philosophy); Combinatorics; Omega; Mathematics; Running time; Upper and lower bounds; Binary logarithm; Solver; Discrete mathematics; Algorithm; Physics; Mathematical optimization; Mathematical analysis","score_opus":0.07377797125953126,"score_gpt":0.18078153014842865,"score_spread":0.1070035588888974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981503891","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.0070206025,0.0001339349,0.98848164,0.00030956886,0.00007396524,0.00005862812,0.00012688298,0.0016381753,0.002156583],"genre_scores_gemma":[0.0922518,0.00015872663,0.9001534,0.00028458374,0.0001076147,0.00025030333,0.0008124536,0.00091111666,0.005070025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882525,0.0002918011,0.000057175508,0.00036234868,0.0003160892,0.00014726244],"domain_scores_gemma":[0.9968258,0.0016269084,0.00023580251,0.00059680536,0.00055634213,0.00015842872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021074063,0.002165557,0.0014195296,0.001624564,0.0010250214,0.0019210714,0.002566183,0.0020615268,0.008981706],"category_scores_gemma":[0.011670856,0.0008790721,0.0014157136,0.0017028099,0.0013731642,0.0043504853,0.0024426093,0.0036322055,0.0032391194],"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.00032151828,0.00023290118,0.0013293889,0.00026191902,0.00007951929,0.0001067506,0.0002666623,0.6202285,0.0063710217,0.10801545,0.015657121,0.24712929],"study_design_scores_gemma":[0.000024141304,0.000018292614,0.0000837138,0.000009922056,0.0000051220704,0.000013936754,0.000016768885,0.9648413,0.0010381412,0.032136966,0.0018037729,0.0000079828815],"about_ca_topic_score_codex":0.009648795,"about_ca_topic_score_gemma":0.010527794,"teacher_disagreement_score":0.009648795,"about_ca_system_score_codex":0.0019559453,"about_ca_system_score_gemma":0.00293963,"threshold_uncertainty_score":0.03004682},"labels":[],"label_agreement":null},{"id":"W2982393288","doi":"10.4230/lipics.ccc.2020.12","title":"Search Problems in Algebraic Complexity, GCT, and Hardness of Generators for Invariant Rings","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Invariant (physics); Invariant theory; Conjecture; Mathematics; Computational complexity theory; Algebraic number; Proof complexity; Polynomial ring; Algebra over a field; Discrete mathematics; Theoretical computer science; Polynomial; Pure mathematics; Computer science; Algorithm; Mathematical proof","score_opus":0.06788203052079886,"score_gpt":0.2681875824002677,"score_spread":0.20030555187946883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982393288","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.39629924,0.002499722,0.53763986,0.025987294,0.0002414603,0.00042594798,0.0030706287,0.0015359484,0.032299813],"genre_scores_gemma":[0.8553589,0.0013496627,0.13098073,0.0011631154,0.00042488365,0.00028462187,0.0024500361,0.000329681,0.00765835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971831,0.00095766725,0.00017900743,0.0006943838,0.00059536926,0.00039059273],"domain_scores_gemma":[0.97322494,0.02299411,0.001081828,0.0017164027,0.00055911456,0.00042357648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00289355,0.0006654076,0.001114701,0.0015891016,0.002066539,0.005819764,0.0024791416,0.0020863386,0.010201878],"category_scores_gemma":[0.021325495,0.0005437497,0.0018283825,0.0030319283,0.005018842,0.016377296,0.0033063786,0.0051134718,0.00082255446],"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.00027410526,0.00019104576,0.0023792111,0.00055543485,0.00006248585,0.00027912334,0.0007806577,0.044498183,0.0018612731,0.8785471,0.009143741,0.061427772],"study_design_scores_gemma":[0.00004747054,0.000038109218,0.0003232701,0.000032374563,0.00003268638,0.00015106045,0.00027623028,0.053696223,0.002235891,0.9401904,0.0029525927,0.00002367955],"about_ca_topic_score_codex":0.0022647327,"about_ca_topic_score_gemma":0.0024559048,"teacher_disagreement_score":0.010201878,"about_ca_system_score_codex":0.0038576752,"about_ca_system_score_gemma":0.0024637147,"threshold_uncertainty_score":0.034128666},"labels":[],"label_agreement":null},{"id":"W2984743818","doi":"10.1007/978-3-030-45771-6_26","title":"The Integrality Number of an Integer Program","year":2020,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Einstein Stiftung Berlin","keywords":"Unimodular matrix; Integer (computer science); Combinatorics; Mathematics; Constraint (computer-aided design); Relaxation (psychology); Matrix (chemical analysis); Integer matrix; Discrete mathematics; Computer science; Symmetric matrix; Physics; Nonnegative matrix; Geometry","score_opus":0.033214859811090756,"score_gpt":0.32660962435792634,"score_spread":0.2933947645468356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984743818","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.69504017,0.0010730157,0.14473157,0.006820256,0.0003381187,0.00009053185,0.001142369,0.0007568084,0.1500071],"genre_scores_gemma":[0.9589421,0.0006163925,0.026603214,0.00042632,0.00036380393,0.0001551781,0.0008243184,0.000312591,0.0117561845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809057,0.0004165553,0.00009077634,0.0005205616,0.00046663903,0.00041492458],"domain_scores_gemma":[0.9833325,0.012838178,0.0011907755,0.0009005842,0.00065806165,0.0010798572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002351919,0.0010358914,0.0013353544,0.0033687074,0.0022827901,0.00580155,0.0020292818,0.0018391773,0.011063908],"category_scores_gemma":[0.014631775,0.0009102377,0.0009809256,0.0028572418,0.004791862,0.008937393,0.0026473978,0.005266645,0.0010618161],"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.00059871393,0.00011406927,0.002123741,0.00021969421,0.000046106437,0.00014122772,0.00038028782,0.014039688,0.005696421,0.95598304,0.0038627372,0.016794262],"study_design_scores_gemma":[0.00006371707,0.0000687524,0.001004652,0.000048514543,0.000059907008,0.00025021055,0.000098198354,0.040296838,0.0044111535,0.94979095,0.0038783366,0.00002874715],"about_ca_topic_score_codex":0.00052928674,"about_ca_topic_score_gemma":0.0004115863,"teacher_disagreement_score":0.011063908,"about_ca_system_score_codex":0.0031182454,"about_ca_system_score_gemma":0.0012319384,"threshold_uncertainty_score":0.037012458},"labels":[],"label_agreement":null},{"id":"W2991205088","doi":"10.4230/lipics.approx/random.2020.63","title":"A Logarithmic Integrality Gap for Generalizations of Quasi-Bipartite Instances of Directed Steiner Tree","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner tree problem; Bipartite graph; Combinatorics; Mathematics; Approximation algorithm; Discrete mathematics; Tree (set theory); Algorithm; Graph","score_opus":0.13189287200090385,"score_gpt":0.22326503097789277,"score_spread":0.09137215897698892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991205088","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.43960923,0.009642319,0.44845077,0.015754018,0.0010007891,0.00044660497,0.0031565058,0.0023602748,0.07957946],"genre_scores_gemma":[0.8926482,0.004608106,0.08737455,0.0027702043,0.0010551967,0.0003805576,0.0023694949,0.0011000012,0.0076936805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951798,0.0010148732,0.00020108702,0.0012599808,0.0010903097,0.0012540426],"domain_scores_gemma":[0.9824102,0.012229673,0.001397703,0.0019644266,0.0006575545,0.0013403955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00429504,0.0022125777,0.0029281962,0.0016159327,0.0019730004,0.005528821,0.0047579897,0.002751907,0.010559293],"category_scores_gemma":[0.025221515,0.0011478727,0.0025912246,0.003426781,0.002895751,0.016392896,0.004843844,0.010162652,0.0012303389],"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.0027731739,0.0012569431,0.006886104,0.0020802098,0.0003741131,0.00089713745,0.0009960573,0.4038961,0.012485497,0.4527005,0.02976826,0.08588592],"study_design_scores_gemma":[0.00013867808,0.0001929354,0.0011300918,0.00013820437,0.000115577524,0.00071605487,0.00025594488,0.5745228,0.0023172197,0.41296226,0.007468611,0.000041669537],"about_ca_topic_score_codex":0.0019147998,"about_ca_topic_score_gemma":0.0016996145,"teacher_disagreement_score":0.010559293,"about_ca_system_score_codex":0.0052718283,"about_ca_system_score_gemma":0.0020586937,"threshold_uncertainty_score":0.03824991},"labels":[],"label_agreement":null},{"id":"W2993653833","doi":"10.1145/3374857.3374866","title":"PODC 2019 Review","year":2019,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Complexity and Algorithms in Graphs","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; Banquet; Operations research; Library science; Art history; Mathematics; History","score_opus":0.01974455852597813,"score_gpt":0.26767471253115865,"score_spread":0.24793015400518054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2993653833","genre_codex":"other","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.00089664786,0.14026202,0.0049821828,0.05660413,0.212381,0.0006154829,0.008551351,0.0033924184,0.57231486],"genre_scores_gemma":[0.0049162726,0.15206562,0.0028521218,0.031223947,0.033127483,0.00045906272,0.014460688,0.0017057942,0.759189],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99807453,0.00019730348,0.0001728265,0.00025481178,0.0010264119,0.0002739852],"domain_scores_gemma":[0.9909746,0.0006582846,0.00034148048,0.0004967344,0.0057157013,0.0018131551],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023640818,0.0011291675,0.0010560845,0.0039490815,0.0019552798,0.007654525,0.0027174228,0.0031477218,0.33648595],"category_scores_gemma":[0.010730515,0.00053291995,0.0009262684,0.0044032517,0.00069675804,0.005362861,0.0032922346,0.0036335278,0.33982122],"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.000025656087,0.000017349234,0.000046428166,0.0004532656,0.0000046724676,0.00003317413,0.000010760289,0.00004899556,0.00011645076,0.0018685977,0.919633,0.07774157],"study_design_scores_gemma":[0.0000024159676,0.0000059526483,0.0000801265,0.00019760139,0.0000022750353,0.00003251082,0.000009661502,0.000010464474,0.000027192678,0.00022372195,0.99940515,0.0000029034745],"about_ca_topic_score_codex":0.0060136286,"about_ca_topic_score_gemma":0.00931791,"teacher_disagreement_score":0.33648595,"about_ca_system_score_codex":0.0039970134,"about_ca_system_score_gemma":0.0070887855,"threshold_uncertainty_score":0.9464223},"labels":[],"label_agreement":null},{"id":"W2997607600","doi":"10.4230/lipics.ipec.2019.9","title":"C-Planarity Testing of Embedded Clustered Graphs with Bounded Dual Carving-Width","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Planarity testing; Combinatorics; Book embedding; Parameterized complexity; Planar graph; Mathematics; Embedding; Discrete mathematics; Vertex (graph theory); Graph drawing; Graph; 1-planar graph; Computer science; Line graph","score_opus":0.019458393798127485,"score_gpt":0.2348391680125248,"score_spread":0.21538077421439733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997607600","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.5763872,0.00094132154,0.39206395,0.0060318448,0.00012342217,0.00037817264,0.003508406,0.0073307958,0.013234967],"genre_scores_gemma":[0.80511844,0.00032407657,0.1841242,0.00096895854,0.00015302506,0.00024944555,0.0047473675,0.0010945583,0.0032199002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953258,0.0007476641,0.00020544573,0.0018081389,0.001079216,0.00083372963],"domain_scores_gemma":[0.9572473,0.030520227,0.002440958,0.0062257936,0.0020368958,0.0015287745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026347798,0.0019918687,0.0019430816,0.0013310151,0.0015538639,0.0041472893,0.005971147,0.0033822125,0.004840926],"category_scores_gemma":[0.030030116,0.0011638546,0.0023689317,0.0021772874,0.0036135882,0.009539356,0.005095859,0.0048600943,0.0012343533],"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.0049781413,0.001266917,0.021888789,0.0018594125,0.0005322885,0.0012532448,0.0018842099,0.47129452,0.057206523,0.17181468,0.026256677,0.23976456],"study_design_scores_gemma":[0.00025311354,0.00021734973,0.0013409603,0.000066674416,0.00015469363,0.00042159142,0.00038982285,0.699022,0.01857545,0.27721548,0.0022764758,0.0000664274],"about_ca_topic_score_codex":0.005095202,"about_ca_topic_score_gemma":0.0049261954,"teacher_disagreement_score":0.005971147,"about_ca_system_score_codex":0.0031816154,"about_ca_system_score_gemma":0.002854872,"threshold_uncertainty_score":0.023084402},"labels":[],"label_agreement":null},{"id":"W2998979141","doi":"10.5539/cis.v13n1p51","title":"Sort Integers into a Linked List","year":2020,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Complexity and Algorithms in Graphs","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":false,"ca_institutions":"","funders":"","keywords":"Computer science; sort; Constant (computer programming); Parallel computing; Arithmetic; Algorithm; Mathematics; Information retrieval; Programming language","score_opus":0.019639163476565337,"score_gpt":0.2427598706734659,"score_spread":0.22312070719690058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998979141","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.08883789,0.0009331582,0.861581,0.0011588172,0.00033604557,0.0004027631,0.0016751497,0.010459626,0.034615472],"genre_scores_gemma":[0.34777987,0.0009313941,0.611123,0.000714911,0.00019768476,0.00033285437,0.0031835255,0.00078087556,0.034955855],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99901056,0.00013675117,0.000081160506,0.00021458059,0.00034046438,0.00021652546],"domain_scores_gemma":[0.9980597,0.0005705999,0.00023110346,0.0005557409,0.0004625648,0.00012026204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063071755,0.00069726416,0.00049470155,0.0023919095,0.0014394507,0.002502199,0.0013612418,0.00062533055,0.015791845],"category_scores_gemma":[0.0035380898,0.0004336954,0.00064039236,0.003307749,0.00077068125,0.006323844,0.0026744874,0.00087540224,0.00547073],"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.0014252749,0.0004907304,0.0037632405,0.0008110685,0.00012234552,0.0005195345,0.00083643163,0.039971586,0.044108007,0.36662713,0.041234873,0.5000899],"study_design_scores_gemma":[0.00035858242,0.000756947,0.00087319576,0.000278423,0.00023029065,0.0006189751,0.0004341718,0.22068754,0.08793266,0.5284249,0.15923347,0.00017087458],"about_ca_topic_score_codex":0.0029998217,"about_ca_topic_score_gemma":0.003982951,"teacher_disagreement_score":0.015791845,"about_ca_system_score_codex":0.0010715389,"about_ca_system_score_gemma":0.0020718784,"threshold_uncertainty_score":0.052828968},"labels":[],"label_agreement":null},{"id":"W3000089047","doi":"","title":"Improving the linear relaxation of maximum \\(k\\)-cut with semidefinite-based constraints","year":2018,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Complexity and Algorithms in Graphs","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Semidefinite programming; Cutting-plane method; Mathematics; Maximum cut; Linear programming; Combinatorics; Relaxation (psychology); Semidefinite embedding; Vertex (graph theory); Linear programming relaxation; Graph; Interior point method; Feasible region; Set (abstract data type); Facet (psychology); Mathematical optimization; Integer programming; Computer science; Quadratically constrained quadratic program","score_opus":0.012720356515452589,"score_gpt":0.20983289194795843,"score_spread":0.19711253543250584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000089047","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.06906226,0.00070403365,0.91677326,0.00065284333,0.00009255967,0.000106331114,0.0002482874,0.0005584363,0.011802017],"genre_scores_gemma":[0.48220184,0.0006003758,0.5106891,0.00051201327,0.000116875686,0.0002263415,0.00082883873,0.00043553527,0.0043891044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834406,0.00081516535,0.00006274219,0.00024332757,0.000312504,0.00022216288],"domain_scores_gemma":[0.99151623,0.0066201407,0.0005932451,0.00048676212,0.00056839123,0.00021519749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031748083,0.001630798,0.0014085136,0.0008473384,0.0004488024,0.001794329,0.0017109369,0.0014476625,0.0046481537],"category_scores_gemma":[0.0120971305,0.00092118216,0.0011141202,0.00124547,0.0011859129,0.002886873,0.0018247718,0.0029083428,0.0007762142],"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.00019568288,0.00022573043,0.00045333526,0.00026186113,0.000054208846,0.000112936876,0.00008644731,0.9335016,0.002720571,0.02593203,0.0036244486,0.03283111],"study_design_scores_gemma":[0.000024071302,0.00005676002,0.000076864584,0.000019022635,0.0000068949844,0.00003563983,0.00002011359,0.9858708,0.0008294266,0.012448094,0.00060539285,0.0000069305906],"about_ca_topic_score_codex":0.0029502276,"about_ca_topic_score_gemma":0.0029304689,"teacher_disagreement_score":0.0046481537,"about_ca_system_score_codex":0.00097398815,"about_ca_system_score_gemma":0.0013978813,"threshold_uncertainty_score":0.016790211},"labels":[],"label_agreement":null},{"id":"W3006858192","doi":"10.1137/18m1169710","title":"A notion of total dual integrality for convex, semidefinite, and extended formulations","year":2020,"lang":"pt","type":"article","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"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":"Office of Naval Research; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo; National Science Foundation","keywords":"Polytope; Mathematics; Semidefinite programming; Combinatorics; Polyhedral combinatorics; Generalization; Linear programming; Rank (graph theory); Duality (order theory); Maximum cut; Linear programming relaxation; Integer programming; Convex analysis; Regular polygon; Dual (grammatical number); Discrete mathematics; Cutting-plane method; Convex optimization; Mathematical optimization; Convex set; Graph","score_opus":0.04571706200810552,"score_gpt":0.2681223265057611,"score_spread":0.2224052644976556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006858192","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.020666154,0.0006638899,0.93470716,0.0008934969,0.0001374423,0.00006785632,0.00017002267,0.00010062026,0.042593338],"genre_scores_gemma":[0.6725442,0.001658901,0.3096543,0.0008394996,0.0007486729,0.00036240483,0.0003945733,0.0002466924,0.013550769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980981,0.0005300264,0.00012751168,0.0003849245,0.0006397428,0.00021963652],"domain_scores_gemma":[0.9975188,0.0010304821,0.0003357609,0.000456566,0.00043789097,0.00022055488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00276181,0.0009860331,0.00080648006,0.0014147203,0.00089665817,0.0038788219,0.0013545449,0.0007929942,0.004831987],"category_scores_gemma":[0.005218378,0.0004540092,0.001460397,0.001405903,0.00432674,0.0058125067,0.0029717574,0.0053808256,0.0005718106],"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.000009235968,0.000015149594,0.000090745634,0.000036205132,0.000011207231,0.000034547116,0.00014014993,0.006201375,0.0005973956,0.9854821,0.00048425543,0.00689753],"study_design_scores_gemma":[0.000013275009,0.000059423066,0.00017618871,0.00007579025,0.000025085314,0.00015468938,0.00013452547,0.071510784,0.0015092269,0.90939474,0.016924141,0.00002214299],"about_ca_topic_score_codex":0.0005221912,"about_ca_topic_score_gemma":0.0004250734,"teacher_disagreement_score":0.004831987,"about_ca_system_score_codex":0.00211225,"about_ca_system_score_gemma":0.0010094662,"threshold_uncertainty_score":0.01616466},"labels":[],"label_agreement":null},{"id":"W3007478560","doi":"10.48550/arxiv.2003.00336","title":"Three-dimensional matching is NP-Hard","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Reduction (mathematics); Matching (statistics); Exponential function; Mathematics; Combinatorics; Algorithm; Discrete mathematics; Computer science; Statistics; Geometry; Mathematical analysis","score_opus":0.11420512199009139,"score_gpt":0.19829965095764798,"score_spread":0.08409452896755659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007478560","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.266506,0.0028055503,0.4913976,0.024603875,0.0011305064,0.0004413811,0.013767659,0.007215014,0.19213244],"genre_scores_gemma":[0.80559677,0.0015694514,0.14447193,0.003371264,0.00051771355,0.00035690138,0.010357011,0.0010942678,0.032664727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983047,0.0002779571,0.00011510507,0.000624466,0.0003594417,0.00031839655],"domain_scores_gemma":[0.9958085,0.0026163983,0.00031509035,0.00080523547,0.00021350091,0.00024131415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007411417,0.00096057483,0.0015425509,0.0006196485,0.0017528196,0.0050102486,0.0023733207,0.0023506584,0.018856917],"category_scores_gemma":[0.004821956,0.0009980809,0.0025274267,0.002354804,0.0016627731,0.0065874066,0.0038867448,0.0043085204,0.0036304458],"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.0012133986,0.0007680051,0.0037262985,0.0023498926,0.00037907227,0.0007833453,0.0005436797,0.10842013,0.014418902,0.5909746,0.10129681,0.17512582],"study_design_scores_gemma":[0.00014401977,0.00005138533,0.0010215623,0.000063434025,0.00006833547,0.00036143913,0.00020930266,0.11310371,0.0058123134,0.8604326,0.018692203,0.00003968699],"about_ca_topic_score_codex":0.0030013707,"about_ca_topic_score_gemma":0.004062701,"teacher_disagreement_score":0.018856917,"about_ca_system_score_codex":0.0023766353,"about_ca_system_score_gemma":0.0016370206,"threshold_uncertainty_score":0.063082635},"labels":[],"label_agreement":null},{"id":"W3008284578","doi":"10.4230/lipics.approx/random.2020.28","title":"A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Mathematics; Combinatorics; Composition (language); Measure (data warehouse); Conjecture; Type (biology); Function (biology); Connection (principal bundle); Characterization (materials science); Discrete mathematics; Physics; Geometry","score_opus":0.13096740427841497,"score_gpt":0.21243351031132288,"score_spread":0.08146610603290791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008284578","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.040210053,0.001138196,0.92172045,0.006631942,0.0002801356,0.0003481835,0.0009187843,0.0015677301,0.027184526],"genre_scores_gemma":[0.671491,0.002464298,0.285125,0.0046912595,0.002631096,0.0026997044,0.0024124894,0.00233703,0.026148157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97918737,0.005093559,0.0009862446,0.0046081245,0.0071930266,0.002931665],"domain_scores_gemma":[0.9076954,0.07415782,0.0028561533,0.009778831,0.0034432418,0.0020684616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0148362545,0.0029757696,0.005239542,0.0027898161,0.0036086417,0.00944955,0.0072044344,0.0040293764,0.022987038],"category_scores_gemma":[0.0853476,0.0027503856,0.005505657,0.0037405095,0.008267464,0.035072617,0.012057664,0.016472848,0.0039869784],"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.00074257073,0.00031972263,0.0015341616,0.0004808858,0.00013111602,0.00020757176,0.00059438247,0.046984054,0.004504248,0.9032408,0.0073089926,0.03395145],"study_design_scores_gemma":[0.00010768765,0.00007499185,0.0004106848,0.00006099393,0.00006699723,0.00014315537,0.00006115108,0.17266205,0.0023400493,0.82136464,0.0026669644,0.000040532803],"about_ca_topic_score_codex":0.0024349424,"about_ca_topic_score_gemma":0.0016767053,"teacher_disagreement_score":0.022987038,"about_ca_system_score_codex":0.007381769,"about_ca_system_score_gemma":0.0053237523,"threshold_uncertainty_score":0.07846254},"labels":[],"label_agreement":null},{"id":"W3008826217","doi":"10.1145/3470861","title":"Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates","year":2021,"lang":"en","type":"preprint","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Product (mathematics); Mathematics; Upper and lower bounds; Boolean function; Physics; Mathematical analysis; Geometry","score_opus":0.02419060904223568,"score_gpt":0.28754416750045253,"score_spread":0.26335355845821684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008826217","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.16394636,0.0027104823,0.78338546,0.0057834866,0.00022928428,0.00053549174,0.0014277368,0.005193615,0.036788177],"genre_scores_gemma":[0.66508645,0.0011587548,0.31078818,0.0021488187,0.0004457692,0.0009502803,0.0027056076,0.0010417034,0.015674543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915417,0.0014166962,0.000481042,0.00210187,0.002324299,0.0021343902],"domain_scores_gemma":[0.96673,0.023171952,0.0018121699,0.0056545697,0.0016042676,0.001026978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004058659,0.0018894029,0.0017428617,0.0018741693,0.0018963622,0.006601798,0.005464025,0.0025686692,0.0117146745],"category_scores_gemma":[0.023757827,0.0010979233,0.0036497875,0.002300061,0.0033549932,0.014754307,0.00492376,0.008027015,0.0020303966],"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.0028718659,0.0008967967,0.006932744,0.0013913908,0.0003250387,0.00035980906,0.0008364575,0.15176581,0.029643657,0.61824894,0.017945385,0.16878206],"study_design_scores_gemma":[0.00024686207,0.00023539843,0.00096095644,0.00013370965,0.00019820644,0.00021930208,0.0001091783,0.5208246,0.017959828,0.45329517,0.0057363305,0.00008050188],"about_ca_topic_score_codex":0.0028376372,"about_ca_topic_score_gemma":0.005862764,"teacher_disagreement_score":0.0117146745,"about_ca_system_score_codex":0.007282952,"about_ca_system_score_gemma":0.0052844635,"threshold_uncertainty_score":0.052841783},"labels":[],"label_agreement":null},{"id":"W3008901784","doi":"10.1145/3626514","title":"A New Minimax Theorem for Randomized Algorithms","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Minimax; Mathematics; Randomized algorithm; Discrete mathematics; Algorithm; Bounded function; Computer science; Mathematical optimization","score_opus":0.034693137456230955,"score_gpt":0.2916385897286021,"score_spread":0.2569454522723712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008901784","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.0098385615,0.0008638729,0.97166675,0.0032704365,0.00021310503,0.00010270295,0.00023099947,0.00041070406,0.013402856],"genre_scores_gemma":[0.56576484,0.0023378942,0.39693084,0.0044216076,0.0020491532,0.0017315546,0.00060852885,0.001033998,0.02512161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9902395,0.0033208681,0.00046275678,0.0023207087,0.0029579683,0.00069816236],"domain_scores_gemma":[0.9752993,0.019370621,0.0008948111,0.0025592078,0.0014422904,0.00043377292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010316803,0.0015676841,0.0023657582,0.001789511,0.0015577874,0.005157389,0.0034184682,0.0031218154,0.0062847957],"category_scores_gemma":[0.037633322,0.0010507156,0.002398315,0.0018507509,0.0069028214,0.012477725,0.0044886507,0.010922869,0.0013631625],"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.00005372411,0.00002958423,0.00026831668,0.0000833103,0.00004209244,0.00003262039,0.00008129881,0.022117773,0.000865053,0.96254694,0.0022006663,0.011678571],"study_design_scores_gemma":[0.00004874235,0.000060358165,0.000126432,0.000042086387,0.000016922724,0.000048111073,0.000014198813,0.14774354,0.0010006973,0.8468161,0.004062254,0.000020495918],"about_ca_topic_score_codex":0.0006913758,"about_ca_topic_score_gemma":0.0005233425,"teacher_disagreement_score":0.010316803,"about_ca_system_score_codex":0.0039299997,"about_ca_system_score_gemma":0.0025493684,"threshold_uncertainty_score":0.05456114},"labels":[],"label_agreement":null},{"id":"W3013656193","doi":"10.1007/s00453-022-00972-6","title":"Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Linear programming relaxation; Theory of computation; Combinatorics; Randomized rounding; Approximation algorithm; Vertex (graph theory); Binary logarithm; Time complexity; Mathematics; Minification; Linear programming; Steiner tree problem; Polynomial-time approximation scheme; Tree (set theory); Discrete mathematics; Running time; Graph; Computer science; Mathematical optimization; Algorithm","score_opus":0.014571129644288744,"score_gpt":0.23388604405281202,"score_spread":0.21931491440852327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013656193","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.036271136,0.00049293885,0.9456272,0.0014584676,0.00023461836,0.0002918489,0.0009647083,0.0032312544,0.011427754],"genre_scores_gemma":[0.40166286,0.00043555192,0.5826999,0.0007237856,0.00029657353,0.00054823246,0.0020062244,0.0009305466,0.010696246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957455,0.0008276187,0.00019691835,0.0010422705,0.0011658191,0.0010219162],"domain_scores_gemma":[0.9907883,0.0046000276,0.00044047312,0.0027739163,0.00074708945,0.0006502784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031663117,0.0018463412,0.002727962,0.0014039918,0.0021004435,0.0045670457,0.0071985577,0.0028282136,0.01636009],"category_scores_gemma":[0.012534871,0.0007964164,0.0022345677,0.0029544272,0.0020892196,0.00789817,0.004802354,0.0055465284,0.002859952],"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.002919156,0.0013101753,0.0021779663,0.0010376618,0.00023864105,0.00015653163,0.0006069049,0.45716384,0.01869208,0.20068994,0.042257175,0.27274993],"study_design_scores_gemma":[0.00015669203,0.00009809315,0.00025517275,0.00002912243,0.000074946634,0.00008283203,0.00009766275,0.8914313,0.0025216588,0.10265825,0.0025709686,0.000023386832],"about_ca_topic_score_codex":0.0065607396,"about_ca_topic_score_gemma":0.01158144,"teacher_disagreement_score":0.01636009,"about_ca_system_score_codex":0.006005759,"about_ca_system_score_gemma":0.008106702,"threshold_uncertainty_score":0.05472988},"labels":[],"label_agreement":null},{"id":"W3014010934","doi":"10.1137/18m1224672","title":"Multitasking Capacity: Hardness Results and Improved Constructions","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"United States - Israel Binational Science Foundation; Simons Foundation; National Science Foundation","keywords":"Combinatorics; Bipartite graph; Mathematics; Matching (statistics); Cardinality (data modeling); Upper and lower bounds; Discrete mathematics; Hardness of approximation; Complete bipartite graph; Approximation algorithm; Graph; Computer science","score_opus":0.04865152016433313,"score_gpt":0.2558573971456671,"score_spread":0.20720587698133394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014010934","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.17731611,0.002256964,0.748521,0.009263922,0.0003642682,0.00044045653,0.0031412828,0.0019009177,0.05679506],"genre_scores_gemma":[0.8714195,0.0014150246,0.11149334,0.0012217618,0.00072222156,0.000807667,0.0017038903,0.0007522732,0.01046435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994055,0.0015990533,0.00025468826,0.0014236177,0.001550793,0.0011168664],"domain_scores_gemma":[0.9691738,0.022272794,0.0015276736,0.004344974,0.0009342874,0.001746471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036574355,0.0020429583,0.0025036645,0.0020563623,0.0020018655,0.0053765294,0.0059338165,0.0031404556,0.011073173],"category_scores_gemma":[0.028038355,0.0013248597,0.0032280628,0.003687774,0.0036283627,0.012379411,0.007072865,0.0065639256,0.0017920989],"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.0010951672,0.0005563253,0.0028026106,0.0010664617,0.00023843044,0.00053403876,0.00095464947,0.3207535,0.006771373,0.5893121,0.020597948,0.055317413],"study_design_scores_gemma":[0.00010380222,0.00008800107,0.00051091705,0.000071915405,0.00007322821,0.0002603959,0.00015149641,0.46792573,0.0025132021,0.52275044,0.005495703,0.00005516344],"about_ca_topic_score_codex":0.002568723,"about_ca_topic_score_gemma":0.0015859832,"teacher_disagreement_score":0.011073173,"about_ca_system_score_codex":0.0035948902,"about_ca_system_score_gemma":0.0022260319,"threshold_uncertainty_score":0.037043452},"labels":[],"label_agreement":null},{"id":"W3016445400","doi":"10.1109/focs46700.2020.00134","title":"Resolving the Optimal Metric Distortion Conjecture","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Distortion (music); Metric (unit); Conjecture; Matching (statistics); Lemma (botany); Ranking (information retrieval); Combinatorics; Discrete mathematics; Set (abstract data type); Metric space; Parameterized complexity; Point (geometry); Algorithm; Computer science; Artificial intelligence; Statistics","score_opus":0.03973471895494322,"score_gpt":0.26466869704226104,"score_spread":0.22493397808731783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016445400","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.10561163,0.0029685486,0.8547269,0.01336996,0.00044987723,0.00026382654,0.0012410722,0.0015146551,0.019853534],"genre_scores_gemma":[0.6510222,0.0016964326,0.33207107,0.003062763,0.0007211138,0.0005142075,0.001475353,0.0007954835,0.00864144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.985594,0.0056606126,0.00086144294,0.0035563358,0.002962579,0.0013651017],"domain_scores_gemma":[0.95283157,0.030208385,0.002721148,0.010878366,0.0021044477,0.001256127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009642524,0.0016396522,0.0044375323,0.0012671937,0.0023118882,0.0054197107,0.0053046267,0.0041266973,0.0063065034],"category_scores_gemma":[0.05253233,0.0014808895,0.0027187697,0.0033356845,0.004631538,0.014863949,0.0054136715,0.0073244213,0.0017814094],"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.0024833519,0.00052754895,0.0051742196,0.00076052226,0.0002766848,0.0002642365,0.00063114305,0.27051896,0.0053687105,0.57625306,0.024404043,0.113337465],"study_design_scores_gemma":[0.00038057286,0.00020221308,0.00078261824,0.000069806236,0.000073118856,0.00040765098,0.00016024847,0.4641191,0.0041769757,0.5189683,0.01059196,0.00006738118],"about_ca_topic_score_codex":0.00357141,"about_ca_topic_score_gemma":0.002855187,"teacher_disagreement_score":0.009642524,"about_ca_system_score_codex":0.0070915986,"about_ca_system_score_gemma":0.004893363,"threshold_uncertainty_score":0.051453352},"labels":[],"label_agreement":null},{"id":"W3018088442","doi":"10.1137/1.9781611976465.75","title":"Dynamic Maintenance of Low-Stretch Probabilistic Tree Embeddings with Applications","year":2021,"lang":"en","type":"preprint","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Probabilistic logic; Tree (set theory); Pruning; Algorithm; Computer science; Binary logarithm; Embedding; Combinatorics; Time complexity; Approximation algorithm; Probabilistic analysis of algorithms; Dynamic problem; Mathematics; Discrete mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.032878644806735836,"score_gpt":0.2499828280805961,"score_spread":0.21710418327386027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018088442","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.08514331,0.0009910683,0.9047517,0.0011853353,0.00008806816,0.00012063521,0.00031826348,0.0038752637,0.0035262897],"genre_scores_gemma":[0.7055851,0.00045110757,0.28842086,0.00032394874,0.00013107088,0.00020803268,0.00066027144,0.00054468785,0.0036748992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978707,0.00040958676,0.00018469992,0.00062538235,0.0006295607,0.0002800343],"domain_scores_gemma":[0.9867634,0.005274138,0.0010617024,0.0057518184,0.0008015862,0.00034733818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019239299,0.0009263067,0.0012579346,0.00052090816,0.00095559895,0.001960381,0.0036193135,0.0018870052,0.0038489888],"category_scores_gemma":[0.015486327,0.0008889049,0.0007587542,0.0015005856,0.0013982414,0.010496557,0.006195817,0.002592112,0.0011743925],"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.0017637603,0.00041435627,0.0031412593,0.00076192775,0.00011972856,0.00045064377,0.0009690077,0.41364232,0.049254443,0.11500566,0.01256288,0.40191406],"study_design_scores_gemma":[0.00005877094,0.00024465204,0.0003306835,0.000029841092,0.000040155504,0.00040489386,0.00010852663,0.8904626,0.014122666,0.08902141,0.005139118,0.00003675961],"about_ca_topic_score_codex":0.000720229,"about_ca_topic_score_gemma":0.0008135375,"teacher_disagreement_score":0.0038489888,"about_ca_system_score_codex":0.0011493701,"about_ca_system_score_gemma":0.0008653661,"threshold_uncertainty_score":0.012876213},"labels":[],"label_agreement":null},{"id":"W3019550124","doi":"10.1016/j.dam.2020.04.004","title":"Matroid optimization problems with monotone monomials in the objective","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","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":"Matroid; Mathematics; Submodular set function; Monomial; Polytope; Rank (graph theory); Combinatorics; Monomial basis; Polynomial; Polyhedron; Monotonic function; Monotone polygon; Discrete mathematics","score_opus":0.022588330717927436,"score_gpt":0.22246510055214663,"score_spread":0.1998767698342192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019550124","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.10825709,0.0014411821,0.8566075,0.0029141775,0.00018440411,0.00013272656,0.0009524088,0.0001425288,0.02936795],"genre_scores_gemma":[0.74589366,0.0017716398,0.22612873,0.0004612473,0.00052207534,0.00022287556,0.0009210661,0.00020217677,0.023876622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989538,0.00055294845,0.000032216973,0.0001647879,0.00017451312,0.00012169287],"domain_scores_gemma":[0.99771833,0.001572911,0.0001939232,0.00017725662,0.00016519296,0.0001724213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018978185,0.0008754765,0.0014198453,0.00085279456,0.0005410882,0.0019934704,0.001384165,0.0018719283,0.0036000467],"category_scores_gemma":[0.005970638,0.0005277301,0.00079511554,0.0017785515,0.0011531942,0.0030869818,0.001524392,0.0026311786,0.00047572618],"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.00019378979,0.0002169604,0.0007656777,0.0003827435,0.00007673454,0.00020564938,0.00009194035,0.29267222,0.003693374,0.6519362,0.008512261,0.04125244],"study_design_scores_gemma":[0.000035334215,0.00008535453,0.00028748286,0.000036688685,0.000028284494,0.00013621182,0.000046446126,0.7364621,0.0013343567,0.25800318,0.0035242478,0.000020172649],"about_ca_topic_score_codex":0.0014039074,"about_ca_topic_score_gemma":0.0020547193,"teacher_disagreement_score":0.0036000467,"about_ca_system_score_codex":0.0016081356,"about_ca_system_score_gemma":0.0009891584,"threshold_uncertainty_score":0.0120434165},"labels":[],"label_agreement":null},{"id":"W3020969699","doi":"10.1137/1.9781611976465.132","title":"The Expander Hierarchy and its Applications to Dynamic Graph Algorithms","year":2021,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":40,"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":"Treewidth; Tree decomposition; Algorithm; Computer science; Hierarchy; Dynamic problem; Graph; Mathematics; Theoretical computer science; Combinatorics; Pathwidth; Line graph","score_opus":0.06587450508378731,"score_gpt":0.2717993298694636,"score_spread":0.20592482478567628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020969699","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.009593713,0.000998235,0.9772574,0.00070675777,0.000047490368,0.000061382954,0.00011145459,0.0008672592,0.01035628],"genre_scores_gemma":[0.272883,0.0020092544,0.7128554,0.00065878837,0.00024555303,0.00025758895,0.00044258582,0.00044237438,0.010205519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985147,0.00036537033,0.000058612433,0.00035071303,0.0005429712,0.00016763709],"domain_scores_gemma":[0.99681276,0.001695067,0.00022744334,0.0008074963,0.00030973824,0.00014745175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012938225,0.00067336374,0.00069674704,0.0015324879,0.000933244,0.0015468282,0.0019070131,0.0012349484,0.005739812],"category_scores_gemma":[0.0060086683,0.00069745927,0.00077059015,0.0022395998,0.0017688071,0.0055798194,0.0029049309,0.0034289702,0.0011095601],"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.00014248927,0.000086134634,0.0004742726,0.00016922891,0.000031693267,0.00012931055,0.0004435491,0.1252186,0.009449292,0.69155586,0.0063952715,0.16590431],"study_design_scores_gemma":[0.00003410434,0.00007196503,0.00030747315,0.000037144677,0.000017892646,0.0002345624,0.00008000061,0.49493074,0.004539977,0.474241,0.025471328,0.000033764023],"about_ca_topic_score_codex":0.0025783067,"about_ca_topic_score_gemma":0.0023174612,"teacher_disagreement_score":0.005739812,"about_ca_system_score_codex":0.0017735072,"about_ca_system_score_gemma":0.00079143274,"threshold_uncertainty_score":0.019201577},"labels":[],"label_agreement":null},{"id":"W3021430041","doi":"10.1080/10556788.2020.1864370","title":"Sparktope: linear programs from algorithms","year":2021,"lang":"en","type":"preprint","venue":"Optimization methods & software","topic":"Complexity and Algorithms in Graphs","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 New Brunswick; McGill University","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Compiler; Computer science; Algorithm; Polynomial; Matching (statistics); Bipartite graph; Extension (predicate logic); TRACE (psycholinguistics); Time complexity; Linear programming; Exponential function; Graph; Programming language; Theoretical computer science; Mathematics","score_opus":0.06472395234384083,"score_gpt":0.3537934815381213,"score_spread":0.2890695291942805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021430041","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.0010250881,0.00057724566,0.9772524,0.00048030735,0.000122255,0.00014657888,0.00060276996,0.009899721,0.009893642],"genre_scores_gemma":[0.025811998,0.0011133892,0.9560429,0.0005637796,0.00018565124,0.001068068,0.0027415322,0.005127076,0.007345626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973623,0.0006589807,0.00018760737,0.00048763017,0.0011204039,0.00018305937],"domain_scores_gemma":[0.9969638,0.0020807735,0.000120329605,0.00044683067,0.00030269416,0.00008564394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002033193,0.0020056618,0.0013019106,0.0015853567,0.00071808795,0.00252319,0.002494889,0.001144426,0.02131932],"category_scores_gemma":[0.007973906,0.0013955183,0.00241576,0.0021517782,0.0016759584,0.003354381,0.0031743285,0.0045037935,0.008823865],"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.00021820066,0.00015279885,0.00028726133,0.0016290401,0.00011155818,0.00028276836,0.00040328418,0.091958895,0.004122002,0.46321705,0.09184224,0.34577486],"study_design_scores_gemma":[0.0002175984,0.00008392182,0.00015151767,0.00024675333,0.000029737539,0.0002835566,0.00006259738,0.27301776,0.0065987823,0.48120984,0.23804438,0.00005358702],"about_ca_topic_score_codex":0.0016858982,"about_ca_topic_score_gemma":0.0018717081,"teacher_disagreement_score":0.02131932,"about_ca_system_score_codex":0.0012573776,"about_ca_system_score_gemma":0.0020698889,"threshold_uncertainty_score":0.071320236},"labels":[],"label_agreement":null},{"id":"W3021687661","doi":"10.4230/lipics.icalp.2017.93","title":"Subspace-Invariant AC^0 Formulas","year":2017,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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":"Linear subspace; Combinatorics; Mathematics; Invariant (physics); Parity function; Omega; Hamming weight; Subspace topology; Discrete mathematics; Upper and lower bounds; Boolean function; Hamming code; Mathematical analysis; Physics; Pure mathematics; Algorithm; Mathematical physics; Quantum mechanics","score_opus":0.0313715502383439,"score_gpt":0.2874558150757654,"score_spread":0.2560842648374215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021687661","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.54220843,0.00060258445,0.35251516,0.0011903265,0.0001906935,0.00012120782,0.0017187417,0.0020924597,0.099360354],"genre_scores_gemma":[0.93271655,0.00022218458,0.05466031,0.0003674979,0.00012636006,0.00009226731,0.001174902,0.00029537256,0.010344651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847645,0.00025432045,0.00010082882,0.00031940974,0.0005770144,0.0002719773],"domain_scores_gemma":[0.9963883,0.001623581,0.00030944843,0.0008848746,0.00060166157,0.00019219589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006127733,0.00041395766,0.00047694918,0.0008277076,0.000865115,0.0020432828,0.001186466,0.00044836942,0.008061885],"category_scores_gemma":[0.004057229,0.0002766908,0.0008381559,0.00092257955,0.0019001213,0.0038088644,0.0018494143,0.0014949697,0.0007482137],"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.00015482088,0.00005573546,0.0017520281,0.00014475096,0.00002049011,0.00016798389,0.00014369245,0.0033741912,0.009504414,0.9429795,0.0034241825,0.038278196],"study_design_scores_gemma":[0.000037004058,0.000064588436,0.0012311658,0.000023602644,0.000047432794,0.00028263987,0.00008775101,0.043830983,0.019131804,0.925991,0.009242044,0.000030097346],"about_ca_topic_score_codex":0.0019175119,"about_ca_topic_score_gemma":0.0020254643,"teacher_disagreement_score":0.008061885,"about_ca_system_score_codex":0.0015074048,"about_ca_system_score_gemma":0.001236819,"threshold_uncertainty_score":0.026969671},"labels":[],"label_agreement":null},{"id":"W3021945058","doi":"10.48550/arxiv.2005.02368","title":"Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Shortest path problem; Omega; Path (computing); Time complexity; Metric space; Binary logarithm; Discrete mathematics; Logarithm; Graph; Computer science; Physics","score_opus":0.03936896967354345,"score_gpt":0.1834978566868087,"score_spread":0.14412888701326526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021945058","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.029880367,0.00022568446,0.963422,0.00044389014,0.000038509777,0.000089123365,0.00043330772,0.0015161806,0.003950873],"genre_scores_gemma":[0.37122637,0.00033369346,0.6220975,0.00021794198,0.00010139566,0.0003562282,0.0012476025,0.0005191272,0.0039002174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982357,0.00031361292,0.00009719047,0.0005528878,0.00059092895,0.00020966031],"domain_scores_gemma":[0.995748,0.0015862695,0.0004563222,0.001785732,0.00027822948,0.00014555907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011373509,0.0012333167,0.0012325611,0.0011035159,0.00079178344,0.0025135702,0.0033403388,0.0014191328,0.0054062847],"category_scores_gemma":[0.009275591,0.0008108256,0.0010549668,0.0019595267,0.0018116857,0.008503222,0.0034495988,0.0034611663,0.0012637405],"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.00065314095,0.00015811756,0.0016802523,0.0002487951,0.000086376676,0.000103368715,0.00032149474,0.5964965,0.013769759,0.19850391,0.0065991795,0.18137912],"study_design_scores_gemma":[0.000044088283,0.000088450164,0.00019521183,0.000021404532,0.000018785651,0.00008190662,0.000075615324,0.85507256,0.007411893,0.13297696,0.0039928397,0.000020308858],"about_ca_topic_score_codex":0.0021057283,"about_ca_topic_score_gemma":0.003031532,"teacher_disagreement_score":0.0054062847,"about_ca_system_score_codex":0.0016623756,"about_ca_system_score_gemma":0.0013415305,"threshold_uncertainty_score":0.018085837},"labels":[],"label_agreement":null},{"id":"W3022052004","doi":"10.4230/lipics.itcs.2021.61","title":"Communication Memento: Memoryless Communication Complexity","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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","funders":"","keywords":"Communication complexity; Alice and Bob; Bipartite graph; Bounded function; Logarithm; Discrete mathematics; Alice (programming language); Computer science; Models of communication; Theoretical computer science; Combinatorics; Mathematics","score_opus":0.19462432414981565,"score_gpt":0.22901080656897504,"score_spread":0.0343864824191594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022052004","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.2002291,0.0024388947,0.74126005,0.010961816,0.00030382484,0.00025875645,0.001371862,0.00078226865,0.04239336],"genre_scores_gemma":[0.9335302,0.0008068638,0.05301205,0.00083469437,0.000419844,0.0005029595,0.00046324925,0.00022507312,0.010205032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99480695,0.001836116,0.00019199483,0.0008585533,0.0013309777,0.00097542827],"domain_scores_gemma":[0.96928096,0.023938747,0.00157064,0.003559771,0.00094625645,0.00070367305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003495869,0.001386027,0.0014697403,0.0010305714,0.0017500927,0.0040665306,0.0037976007,0.0030588345,0.009143099],"category_scores_gemma":[0.025521442,0.00071454945,0.0014246588,0.0017782765,0.0038873411,0.014299163,0.0041520935,0.005190122,0.0009870068],"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.00047785605,0.00014282706,0.0010063683,0.00032752578,0.000080461294,0.00026872737,0.00042754624,0.14644885,0.0022380382,0.82224673,0.006779154,0.019555887],"study_design_scores_gemma":[0.00005882488,0.000056197616,0.0001884494,0.000023592833,0.000025048708,0.00009524375,0.000058627065,0.44661975,0.0011429539,0.5494127,0.002300337,0.00001829053],"about_ca_topic_score_codex":0.0019005825,"about_ca_topic_score_gemma":0.0012404622,"teacher_disagreement_score":0.009143099,"about_ca_system_score_codex":0.004013119,"about_ca_system_score_gemma":0.0020273621,"threshold_uncertainty_score":0.03058666},"labels":[],"label_agreement":null},{"id":"W3022167047","doi":"","title":"Computational study of valid inequalities for the maximum \\(k\\)-cut problem","year":2016,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Complexity and Algorithms in Graphs","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":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Clique; Vertex (graph theory); Combinatorics; Focus (optics); Graph; Maximum cut; Inequality; Set (abstract data type); Semidefinite programming; Relaxation (psychology); Discrete mathematics; Mathematical optimization; Computer science; Mathematical analysis","score_opus":0.029454336079702333,"score_gpt":0.26497901753134984,"score_spread":0.2355246814516475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022167047","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.7831462,0.0018267534,0.18044047,0.0045453147,0.00022015882,0.00034320567,0.0024845323,0.0012255893,0.025767764],"genre_scores_gemma":[0.81272733,0.00043018715,0.1798494,0.00050015905,0.00008376683,0.0002989091,0.0033380084,0.00031114457,0.0024610157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978951,0.0010956727,0.00010267398,0.00026776918,0.00033246356,0.00030627364],"domain_scores_gemma":[0.954208,0.041288067,0.0016245908,0.0013815536,0.0008928916,0.0006048335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043020896,0.0016541525,0.0013244099,0.0013068713,0.00091719546,0.0025577473,0.0027294024,0.0014877731,0.0071555693],"category_scores_gemma":[0.024165183,0.00072217506,0.0013041892,0.0018501669,0.001582779,0.0033225731,0.0014612804,0.002435577,0.00043153524],"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.0014455133,0.00068622205,0.0047404445,0.00075139076,0.00015668118,0.00016887703,0.00015922233,0.9046056,0.0014435337,0.035022084,0.009219842,0.041600604],"study_design_scores_gemma":[0.000113082795,0.00007283023,0.00034326452,0.00002337123,0.00001869602,0.000034231794,0.000050916435,0.98316664,0.0005491871,0.015158944,0.00046116178,0.000007649562],"about_ca_topic_score_codex":0.007022846,"about_ca_topic_score_gemma":0.010029906,"teacher_disagreement_score":0.0071555693,"about_ca_system_score_codex":0.0021396687,"about_ca_system_score_gemma":0.0025767768,"threshold_uncertainty_score":0.023937762},"labels":[],"label_agreement":null},{"id":"W3033460939","doi":"10.1137/1.9781611976465.63","title":"Beyond Submodular Maximization via One-Sided Smoothness","year":2021,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","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 British Columbia","funders":"","keywords":"Submodular set function; Multilinear map; Matroid; Mathematics; Parameterized complexity; Set function; Rounding; Discrete mathematics; Polytope; Function (biology); Combinatorics; Extension (predicate logic); Monotone polygon; Mathematical optimization; Set (abstract data type); Pure mathematics; Computer science","score_opus":0.0661011885999601,"score_gpt":0.23213632313503543,"score_spread":0.16603513453507535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033460939","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.030335968,0.00089904625,0.9618428,0.0007821772,0.00003626065,0.00004299358,0.000108339096,0.00023100595,0.005721494],"genre_scores_gemma":[0.6756754,0.0017400593,0.31422922,0.00045862474,0.00023496358,0.00022066924,0.0003257491,0.00033552086,0.0067797513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872464,0.0005054741,0.000040385992,0.00025856664,0.0003269505,0.00014397276],"domain_scores_gemma":[0.99694353,0.0020727,0.00022669636,0.0004050898,0.00018939383,0.00016260278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030499483,0.0013279654,0.0015951967,0.00083411054,0.0006290891,0.0019487184,0.0013669019,0.0015041176,0.0025989916],"category_scores_gemma":[0.008536409,0.00062841794,0.0016119429,0.0012832487,0.0024623005,0.0038377955,0.0033172623,0.00390405,0.00043883614],"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.00013882393,0.000097031065,0.0009595693,0.00025061768,0.0000889722,0.00013018536,0.00017980406,0.57823324,0.00403955,0.3638055,0.0022738276,0.049802925],"study_design_scores_gemma":[0.000014284196,0.00008350883,0.00018961143,0.000027465901,0.000012504798,0.00005567483,0.000028127777,0.8038308,0.00096333784,0.1923283,0.00245018,0.000016149328],"about_ca_topic_score_codex":0.0014627931,"about_ca_topic_score_gemma":0.0011970943,"teacher_disagreement_score":0.0030499483,"about_ca_system_score_codex":0.001593335,"about_ca_system_score_gemma":0.0011917005,"threshold_uncertainty_score":0.016129911},"labels":[],"label_agreement":null},{"id":"W3035379790","doi":"","title":"On the unreasonable effectiveness of the greedy algorithm: Greedy adapts to sharpness","year":2020,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Complexity and Algorithms in Graphs","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":"Polytechnique Montréal","funders":"","keywords":"Submodular set function; Greedy algorithm; Cardinality (data modeling); Mathematical optimization; Convexity; Monotone polygon; Computer science; Constraint (computer-aided design); Maximization; Convergence (economics); Algorithm; Function (biology); Greedy randomized adaptive search procedure; Mathematics; Data mining","score_opus":0.01826483245907823,"score_gpt":0.22512493244021567,"score_spread":0.20686009998113744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035379790","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.11378232,0.0056028483,0.85475177,0.005405773,0.00037652891,0.00022076596,0.00019565123,0.0012621037,0.01840219],"genre_scores_gemma":[0.77835715,0.0025566437,0.21307096,0.0017706709,0.00037013408,0.00022994861,0.00022814478,0.0006649388,0.0027514359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99335665,0.0036612037,0.00023019749,0.00096651487,0.0011545726,0.0006307964],"domain_scores_gemma":[0.9241073,0.06357631,0.0023643835,0.007184689,0.0017770273,0.0009902633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013248842,0.0020588073,0.002382898,0.0016077636,0.0013773928,0.0031903412,0.0025617627,0.00317508,0.004039635],"category_scores_gemma":[0.080024354,0.0008650042,0.0017392674,0.0019707622,0.005797143,0.00720612,0.0032570593,0.0046972064,0.0011089758],"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.0013027504,0.00029675555,0.007905323,0.00072312064,0.0004647499,0.0003622233,0.00042853903,0.5733563,0.008723645,0.26404408,0.011924476,0.13046807],"study_design_scores_gemma":[0.00012975914,0.00041894396,0.001168455,0.0001393959,0.00009389699,0.00040187003,0.00013008015,0.80376667,0.0036528762,0.18722905,0.0028182534,0.000050835926],"about_ca_topic_score_codex":0.0017819556,"about_ca_topic_score_gemma":0.0018133095,"teacher_disagreement_score":0.013248842,"about_ca_system_score_codex":0.0023384786,"about_ca_system_score_gemma":0.0027921454,"threshold_uncertainty_score":0.070067406},"labels":[],"label_agreement":null},{"id":"W3036465868","doi":"10.48550/arxiv.2006.10957","title":"When Is Amplification Necessary for Composition in Randomized Query Complexity?","year":2020,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Logarithm; Decision tree; Function (biology); Upper and lower bounds; Mathematics; Combinatorics; Overhead (engineering); Tree (set theory); Discrete mathematics; Computer science; Statistics; Data mining; Mathematical analysis","score_opus":0.06031803637100492,"score_gpt":0.2985062379972715,"score_spread":0.23818820162626658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036465868","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.23393781,0.001995972,0.692962,0.025433186,0.0005547114,0.00060064805,0.00094277284,0.0034955845,0.040077273],"genre_scores_gemma":[0.9076694,0.0011329912,0.07320607,0.0046541984,0.0015794558,0.0007932692,0.0006670441,0.0010971748,0.00920046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97266364,0.009058927,0.001622638,0.0056502344,0.0067083575,0.004296238],"domain_scores_gemma":[0.79315066,0.17507608,0.0057322364,0.017861202,0.0045680916,0.003611708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018764732,0.0016912782,0.0041677263,0.0014323143,0.0029199424,0.008167026,0.003642969,0.00510928,0.01663993],"category_scores_gemma":[0.1440961,0.0024706163,0.0036832355,0.0019884687,0.010049727,0.040381566,0.009319465,0.011295271,0.0029167524],"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.004410301,0.0009968943,0.0099932365,0.0010553002,0.00026984053,0.0010718922,0.0021765819,0.08641568,0.020804467,0.77742475,0.010270777,0.08511024],"study_design_scores_gemma":[0.00028619103,0.0002463162,0.0013247394,0.0001231072,0.00015667969,0.00059139315,0.0002860819,0.21781828,0.009532021,0.7656107,0.0039225044,0.00010194281],"about_ca_topic_score_codex":0.0022311544,"about_ca_topic_score_gemma":0.0014571921,"teacher_disagreement_score":0.018764732,"about_ca_system_score_codex":0.0047095255,"about_ca_system_score_gemma":0.004327272,"threshold_uncertainty_score":0.099238575},"labels":[],"label_agreement":null},{"id":"W3037978064","doi":"","title":"QIP = PSPACE","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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; Perimeter Institute","funders":"","keywords":"PSPACE; Mathematics; Class (philosophy); Multiplicative function; Mathematical proof; Power (physics); Discrete mathematics; Computer science; Computational complexity theory; Combinatorics; Algorithm; Physics","score_opus":0.09210681672539393,"score_gpt":0.18616894085701446,"score_spread":0.09406212413162053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037978064","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.062368646,0.0005924197,0.78161055,0.010018141,0.00036318062,0.0004099132,0.003228001,0.002621481,0.13878766],"genre_scores_gemma":[0.77139264,0.000899587,0.18371955,0.0047962214,0.0007749263,0.0008951959,0.005539582,0.0012956215,0.03068667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944977,0.00069665455,0.00028916105,0.0017616311,0.001958053,0.00079686573],"domain_scores_gemma":[0.9840465,0.009859273,0.0010239643,0.0024528839,0.0017835363,0.0008338246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024414363,0.00082039984,0.0010690561,0.00097095006,0.002275956,0.0046528904,0.0017149216,0.0011470475,0.015942484],"category_scores_gemma":[0.012349852,0.00067377364,0.0019198777,0.0011537711,0.0033418045,0.00835762,0.005774358,0.00825362,0.0023805697],"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.00015270585,0.00012400934,0.00089268724,0.00045654242,0.00006365848,0.0001043674,0.0003341332,0.00872667,0.0025408075,0.9492219,0.012196446,0.025186138],"study_design_scores_gemma":[0.00003616915,0.00003703387,0.00032761553,0.00002390049,0.000025445215,0.0001478291,0.000065047876,0.02745157,0.0038887763,0.9549464,0.0130345,0.000015725096],"about_ca_topic_score_codex":0.0019404505,"about_ca_topic_score_gemma":0.001477905,"teacher_disagreement_score":0.015942484,"about_ca_system_score_codex":0.001924995,"about_ca_system_score_gemma":0.0026371127,"threshold_uncertainty_score":0.053332925},"labels":[],"label_agreement":null},{"id":"W3040249201","doi":"10.1007/s00037-024-00250-7","title":"KRW Composition Theorems via Lifting","year":2024,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation; Vetenskapsrådet; Natural Sciences and Engineering Research Council of Canada; European Commission; McGill University; Lunds Universitet","keywords":"Composition (language); Mathematics; Discrete mathematics; Combinatorics; Computer science; Linguistics; Philosophy","score_opus":0.03902938089658899,"score_gpt":0.28683573876716145,"score_spread":0.24780635787057245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040249201","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.0574233,0.0008497654,0.7993356,0.006014071,0.00044333455,0.00014797694,0.000525837,0.001154581,0.13410562],"genre_scores_gemma":[0.6717375,0.0026608694,0.2637619,0.0027915258,0.0016578896,0.0006957304,0.0013825975,0.0016094323,0.053702515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970799,0.0005433992,0.00015343454,0.0007306895,0.0010512908,0.00044116616],"domain_scores_gemma":[0.9926846,0.0044429204,0.0003101463,0.001556991,0.00064730225,0.0003580208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022720702,0.001245285,0.0014180285,0.0021122633,0.0020470025,0.003899774,0.002333105,0.0014487436,0.018795319],"category_scores_gemma":[0.007850565,0.0010726444,0.0025704901,0.002616042,0.00408262,0.023268986,0.007327393,0.009089425,0.0032114096],"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.000028427665,0.000044711098,0.00013422883,0.0000639728,0.000009079098,0.00004274194,0.00013279283,0.0010318343,0.00059803104,0.98523617,0.002053941,0.010623935],"study_design_scores_gemma":[0.000009473862,0.000005233709,0.000078960475,0.000008752218,0.00000993318,0.00004447092,0.000032863805,0.0043829507,0.00067389436,0.99221295,0.0025331024,0.0000073799815],"about_ca_topic_score_codex":0.00092380005,"about_ca_topic_score_gemma":0.0009522158,"teacher_disagreement_score":0.018795319,"about_ca_system_score_codex":0.001564627,"about_ca_system_score_gemma":0.0011217111,"threshold_uncertainty_score":0.06287658},"labels":[],"label_agreement":null},{"id":"W3045332431","doi":"10.1007/s10107-022-01780-0","title":"Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators","year":2022,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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; Agence Nationale de la Recherche","keywords":"Mathematics; Disjoint sets; Combinatorics; Cardinality (data modeling); Bounded function; Constant (computer programming); Discrete mathematics; Routing (electronic design automation); Tree (set theory)","score_opus":0.021040342107216572,"score_gpt":0.23371226578399504,"score_spread":0.21267192367677845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045332431","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.12373809,0.00081017596,0.8508767,0.0014221704,0.000118261916,0.00015190402,0.0002884682,0.0010477734,0.021546453],"genre_scores_gemma":[0.5521841,0.0009872649,0.43075448,0.00043540128,0.00017749604,0.00031993378,0.00056352053,0.0007500301,0.013827798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988079,0.0003236995,0.000050052982,0.00029035282,0.0003270448,0.00020091371],"domain_scores_gemma":[0.98926276,0.008984467,0.0004379721,0.00067879393,0.00037394633,0.00026207362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018247858,0.0013855249,0.0015046678,0.0015526881,0.0010104631,0.0035260646,0.0033569548,0.0019488148,0.0074893134],"category_scores_gemma":[0.017532155,0.0010079339,0.0014519292,0.0022331425,0.0018457385,0.0066180066,0.0037903697,0.0047394247,0.00094041723],"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.00060359476,0.00039590942,0.0016312336,0.0005536925,0.00010101222,0.00017155611,0.0007862052,0.40887463,0.0032393099,0.4446771,0.009411941,0.12955372],"study_design_scores_gemma":[0.00004418344,0.00003444937,0.00014370355,0.000050158258,0.000044420805,0.000060909162,0.00009134955,0.6111422,0.0010935044,0.38562822,0.0016572119,0.000009745699],"about_ca_topic_score_codex":0.0025579494,"about_ca_topic_score_gemma":0.004591237,"teacher_disagreement_score":0.0074893134,"about_ca_system_score_codex":0.0027161217,"about_ca_system_score_gemma":0.0016935951,"threshold_uncertainty_score":0.025054276},"labels":[],"label_agreement":null},{"id":"W3046523482","doi":"10.1109/focs46700.2020.00013","title":"KRW Composition Theorems via Lifting","year":2020,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada; Knut och Alice Wallenbergs Stiftelse; National Science Foundation; Vetenskapsrådet; Israel Science Foundation; Danmarks Frie Forskningsfond","keywords":"Composition (language); Computer science; Mathematics; Art; Literature","score_opus":0.025326781616408646,"score_gpt":0.22401855392817654,"score_spread":0.1986917723117679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046523482","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.09120525,0.0011187695,0.7194052,0.009488602,0.0006422789,0.00038348092,0.0012661975,0.005218773,0.17127147],"genre_scores_gemma":[0.6962792,0.0017470508,0.24366467,0.0066276463,0.0018077777,0.0009442963,0.002330551,0.0023231693,0.044275545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9916427,0.0010819182,0.00042252417,0.002029639,0.0033483915,0.0014748772],"domain_scores_gemma":[0.9849776,0.007993439,0.00074315723,0.004008962,0.0015281241,0.00074880087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004887198,0.0011748726,0.0016055203,0.0017843269,0.0021818131,0.0037578675,0.0028327804,0.0018238827,0.020094734],"category_scores_gemma":[0.018572116,0.0012966834,0.0037424397,0.0019647053,0.004165475,0.020646775,0.012230722,0.010373961,0.004945864],"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.00012630448,0.00011973514,0.00062853564,0.00019961692,0.000027916074,0.00021437673,0.00035225658,0.0035670695,0.0034199543,0.9604343,0.005874791,0.02503525],"study_design_scores_gemma":[0.00004721734,0.00004258508,0.00031551337,0.000041532563,0.00003627409,0.00024978237,0.00007940781,0.028126255,0.003912246,0.95566416,0.011454403,0.000030560208],"about_ca_topic_score_codex":0.0017228075,"about_ca_topic_score_gemma":0.0014847147,"teacher_disagreement_score":0.020094734,"about_ca_system_score_codex":0.003184237,"about_ca_system_score_gemma":0.0023353205,"threshold_uncertainty_score":0.06722355},"labels":[],"label_agreement":null},{"id":"W3081819253","doi":"10.48550/arxiv.2008.03327","title":"A $4/3$-Approximation Algorithm for the Minimum $2$-Edge Connected Multisubgraph Problem in the Half-Integral Case","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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 Ottawa; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Travelling salesman problem; Regular polygon; Enhanced Data Rates for GSM Evolution; Approximation algorithm; Discrete mathematics; Algorithm; Geometry; Computer science","score_opus":0.1051686159428374,"score_gpt":0.2179346125417006,"score_spread":0.1127659965988632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081819253","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.10607253,0.0014697822,0.843488,0.0028394358,0.00030592983,0.00094954896,0.0017937461,0.007387834,0.035693213],"genre_scores_gemma":[0.24589993,0.0004334532,0.7365691,0.0010027178,0.00013333344,0.00078261044,0.0042836717,0.00079674,0.0100983605],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988269,0.00015828357,0.000059341513,0.0003696759,0.00023194046,0.0003539082],"domain_scores_gemma":[0.99899477,0.0003849934,0.0000978158,0.00027551627,0.000109233646,0.00013770528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010494451,0.0024005247,0.0019896282,0.0012719841,0.0012520219,0.00215107,0.0040297825,0.002691572,0.01599178],"category_scores_gemma":[0.0028392987,0.0010036415,0.0019574352,0.0023785343,0.0008550814,0.004161661,0.0027592266,0.003376017,0.0043879156],"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.0018090095,0.0014789853,0.002467165,0.0007560862,0.0002058115,0.00046010187,0.0007113687,0.37041688,0.012279316,0.05629872,0.06346061,0.48965597],"study_design_scores_gemma":[0.00027221232,0.00015785405,0.0005356747,0.0000597506,0.000055152705,0.0002198589,0.00021820788,0.93971056,0.0024598713,0.04882266,0.007459856,0.000028398523],"about_ca_topic_score_codex":0.008571584,"about_ca_topic_score_gemma":0.01371646,"teacher_disagreement_score":0.01599178,"about_ca_system_score_codex":0.0028391827,"about_ca_system_score_gemma":0.0038655458,"threshold_uncertainty_score":0.05349785},"labels":[],"label_agreement":null},{"id":"W3082318583","doi":"10.1137/20m135515x","title":"Relaxed Locally Correctable Codes with Nearly-Linear Block Length and Constant Query Complexity","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","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":"","keywords":"Mathematics; Code word; Decoding methods; Block (permutation group theory); List decoding; Constant (computer programming); Block code; Upper and lower bounds; Algorithm; Discrete mathematics; Combinatorics; Computer science; Concatenated error correction code","score_opus":0.02585537324071933,"score_gpt":0.24398451927618517,"score_spread":0.21812914603546585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082318583","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.16047569,0.0017552872,0.81422764,0.0020213271,0.00019249058,0.0005352085,0.002159212,0.0028987203,0.015734421],"genre_scores_gemma":[0.6613343,0.0010520049,0.32198212,0.00114717,0.00017105087,0.00075086456,0.0026982499,0.00058810547,0.010276122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99577457,0.0006898616,0.00026795344,0.00086326466,0.0016153483,0.000789049],"domain_scores_gemma":[0.9848995,0.007076781,0.0012186369,0.0044146418,0.0019023044,0.00048817048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015636308,0.0013514954,0.001496932,0.00072757155,0.00091724313,0.0021497644,0.0026459717,0.0016057212,0.0040899203],"category_scores_gemma":[0.015954532,0.00060403056,0.0011081442,0.0018291022,0.0022870707,0.0041099354,0.003935632,0.0044016317,0.0017445051],"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.0019421517,0.0003214199,0.0025777407,0.0008453699,0.00013182961,0.0005460323,0.0010423454,0.4719072,0.045210827,0.35325915,0.015418723,0.10679728],"study_design_scores_gemma":[0.000273482,0.00042313346,0.0004673967,0.0001051782,0.000079653626,0.00045055168,0.00016371804,0.7779727,0.022871982,0.18904532,0.0080269445,0.000119922],"about_ca_topic_score_codex":0.004835597,"about_ca_topic_score_gemma":0.005797877,"teacher_disagreement_score":0.004835597,"about_ca_system_score_codex":0.0027423226,"about_ca_system_score_gemma":0.004473605,"threshold_uncertainty_score":0.019897044},"labels":[],"label_agreement":null},{"id":"W3083903395","doi":"10.48550/arxiv.2009.04892","title":"Toward Probabilistic Checking against Non-Signaling Strategies with Constant Locality","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Robustness (evolution); Mathematical proof; Locality; Probabilistic logic; Computation; Theoretical computer science; Computer science; Mathematics; Algorithm; Artificial intelligence","score_opus":0.12390603914664206,"score_gpt":0.2016284091420833,"score_spread":0.07772236999544124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083903395","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.10820729,0.00024230426,0.87751794,0.004426349,0.00007362668,0.00026091648,0.0003458755,0.0028839635,0.0060418337],"genre_scores_gemma":[0.8498602,0.00025132517,0.14302497,0.0017142082,0.00028295512,0.00044832748,0.00039380603,0.00062989467,0.0033943655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97211623,0.009014824,0.001586802,0.0060913754,0.008866687,0.0023240268],"domain_scores_gemma":[0.723937,0.21555164,0.010098407,0.037392166,0.010549073,0.0024717283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01508318,0.0012188316,0.0022124262,0.0019204911,0.0025687097,0.006140539,0.007107939,0.0040408634,0.0049067815],"category_scores_gemma":[0.09500005,0.0022348769,0.0039703646,0.0021657106,0.012877729,0.022946507,0.014661112,0.013387735,0.0012318357],"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.0006330586,0.000252327,0.0035569668,0.0006136376,0.0002126761,0.00046995055,0.0016502717,0.040604137,0.013729176,0.9109636,0.0021055096,0.025208736],"study_design_scores_gemma":[0.00014838608,0.00014322491,0.0003832247,0.000048235328,0.00013739275,0.0002111475,0.00014803583,0.16784312,0.016630331,0.81237113,0.0018547095,0.00008099118],"about_ca_topic_score_codex":0.0017936552,"about_ca_topic_score_gemma":0.0013111394,"teacher_disagreement_score":0.01508318,"about_ca_system_score_codex":0.0037931115,"about_ca_system_score_gemma":0.0060259374,"threshold_uncertainty_score":0.07976842},"labels":[],"label_agreement":null},{"id":"W3085262258","doi":"10.1109/tit.2020.3023962","title":"On List Recovery of High-Rate Tensor Codes","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Information Theory","topic":"Complexity and Algorithms in Graphs","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":"Natural Sciences and Engineering Research Council of Canada; Google; Simons Foundation; United States-Israel Binational Science Foundation; European Research Council; National Science Foundation","keywords":"Decoding methods; List decoding; Probabilistic logic; Tensor product; Mathematics; Linear code; Upper and lower bounds; Discrete mathematics; Code (set theory); Algorithm; Computer science; Block code; Concatenated error correction code; Statistics","score_opus":0.015167629555816676,"score_gpt":0.2153799879103764,"score_spread":0.20021235835455972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085262258","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.0889751,0.001119739,0.89547926,0.0009023858,0.000090118396,0.00010781245,0.00024496345,0.0010513344,0.012029275],"genre_scores_gemma":[0.82027036,0.0011752653,0.16501455,0.00036313853,0.00018389543,0.0002416133,0.0005066903,0.0004500985,0.011794275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967894,0.00085693976,0.00014188567,0.0004544461,0.0011819212,0.00057536084],"domain_scores_gemma":[0.98622376,0.0069695604,0.0014872763,0.003089861,0.0018930896,0.00033662005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028252488,0.00094837777,0.000911158,0.0012859122,0.0012162072,0.00178638,0.0015511445,0.0009940525,0.0038272496],"category_scores_gemma":[0.017341862,0.00040694186,0.0008478836,0.00153622,0.0034949554,0.005931702,0.0027183625,0.0034747024,0.0013021309],"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.000636942,0.00007652387,0.0009752301,0.00027090564,0.000029536393,0.00023186045,0.0006436479,0.27802882,0.01539961,0.65260136,0.0029486045,0.048157055],"study_design_scores_gemma":[0.00003671214,0.0001796387,0.00025264546,0.000051588082,0.000021690817,0.00020570806,0.00010212288,0.71222806,0.018714206,0.26454052,0.0036055355,0.000061543215],"about_ca_topic_score_codex":0.003207745,"about_ca_topic_score_gemma":0.0014766424,"teacher_disagreement_score":0.0038272496,"about_ca_system_score_codex":0.0027155755,"about_ca_system_score_gemma":0.0017118296,"threshold_uncertainty_score":0.019702971},"labels":[],"label_agreement":null},{"id":"W3085992258","doi":"10.1007/s00446-023-00451-3","title":"Four shades of deterministic leader election in anonymous networks","year":2023,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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é du Québec en Outaouais; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Leader election; Node (physics); Computer science; Task (project management); Context (archaeology); Identifier; Computer network; Distributed computing; Computer security; Engineering; Geography","score_opus":0.033896789744311755,"score_gpt":0.26759833705344255,"score_spread":0.23370154730913079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085992258","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.26212537,0.0012857417,0.6205562,0.009245734,0.0009495228,0.00022568386,0.00023864125,0.0021757397,0.10319744],"genre_scores_gemma":[0.9209938,0.0002971745,0.06304156,0.0005724218,0.00022666286,0.00010316685,0.00006674446,0.0002587073,0.014439778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970464,0.0012220849,0.00010246726,0.00039784654,0.00069435546,0.00053688645],"domain_scores_gemma":[0.99208117,0.003864269,0.00044682127,0.002327947,0.0005735595,0.00070619467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029077192,0.0003488641,0.001141146,0.0008120122,0.0027583083,0.0039139627,0.0021649285,0.0019058527,0.0082110595],"category_scores_gemma":[0.012476732,0.0005379964,0.0009289418,0.00079786044,0.0041397773,0.0051263133,0.0036421139,0.0023109359,0.0009306817],"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.00053510466,0.00010687823,0.000816236,0.000094012845,0.000035710727,0.000094197276,0.0006446456,0.052453905,0.0017784033,0.90954053,0.00661972,0.02728056],"study_design_scores_gemma":[0.000081624996,0.000073346535,0.00031519323,0.000024236719,0.000035231475,0.000069604415,0.00024146431,0.24073592,0.0011283447,0.75185084,0.005407809,0.000036433623],"about_ca_topic_score_codex":0.0016886033,"about_ca_topic_score_gemma":0.0022987395,"teacher_disagreement_score":0.0082110595,"about_ca_system_score_codex":0.0016155558,"about_ca_system_score_gemma":0.0014547498,"threshold_uncertainty_score":0.027468681},"labels":[],"label_agreement":null},{"id":"W3091841515","doi":"10.1109/focs46700.2020.00094","title":"Approximation Algorithms for Stochastic Minimum-Norm Combinatorial Optimization","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Norm (philosophy); Stochastic optimization; Mathematical optimization; Mathematics; Optimization problem; Approximation algorithm; Stochastic approximation; Random variable; Multivariate random variable; Combinatorial optimization; Computer science; Key (lock)","score_opus":0.054998356939426445,"score_gpt":0.2853151208686983,"score_spread":0.23031676392927186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091841515","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.0014359959,0.00089188357,0.99438053,0.00039181474,0.00006719888,0.000035474764,0.00010634785,0.000217494,0.0024733054],"genre_scores_gemma":[0.2023167,0.0029928184,0.78397536,0.0007707568,0.0005578035,0.00069459836,0.0013899369,0.0005495705,0.0067525455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977253,0.0010913147,0.00011103721,0.00033220384,0.0005497378,0.00019041091],"domain_scores_gemma":[0.9921864,0.0061264643,0.00039482838,0.00048170012,0.0006416932,0.00016896032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041943137,0.0023002252,0.0026322587,0.0017136224,0.00075950334,0.0029493412,0.0031290727,0.0024665205,0.005136477],"category_scores_gemma":[0.016289849,0.00097650057,0.0016824747,0.002874624,0.0016650875,0.003105121,0.0028850702,0.0049567996,0.00133042],"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.000068834626,0.000063661566,0.00047617487,0.00021201627,0.00008266956,0.000047361216,0.000065983135,0.8113264,0.00025738002,0.14185178,0.0059396406,0.039608054],"study_design_scores_gemma":[0.000009170116,0.000010161879,0.000031487078,0.000017415336,0.00000517711,0.000010953588,0.000008733354,0.9367785,0.000050746832,0.062063407,0.0010095862,0.0000045825377],"about_ca_topic_score_codex":0.005509159,"about_ca_topic_score_gemma":0.005425713,"teacher_disagreement_score":0.005509159,"about_ca_system_score_codex":0.0029529613,"about_ca_system_score_gemma":0.0021454745,"threshold_uncertainty_score":0.022181928},"labels":[],"label_agreement":null},{"id":"W3092028377","doi":"10.1007/978-3-030-59267-7_13","title":"Two-Stage Submodular Maximization Problem Beyond Non-negative and Monotone","year":2020,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"","keywords":"Submodular set function; Matroid; Monotone polygon; Cardinality (data modeling); Constraint (computer-aided design); Mathematics; Maximization; Approximation algorithm; Combinatorics; Discrete mathematics; Function (biology); Mathematical optimization; Computer science","score_opus":0.014829903372045872,"score_gpt":0.23276656047874233,"score_spread":0.21793665710669646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092028377","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.04353565,0.0011607577,0.90260834,0.0031584955,0.00029638995,0.00031485394,0.0011234919,0.00037782814,0.047424223],"genre_scores_gemma":[0.51332915,0.0015365954,0.40084437,0.0010777112,0.0006685798,0.00075497455,0.0014963972,0.0005853717,0.07970685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986871,0.00056647055,0.000044626995,0.000332808,0.00016069741,0.00020829256],"domain_scores_gemma":[0.99631715,0.0025891475,0.00016014172,0.0003615355,0.00023191432,0.00034005623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027296802,0.0015142579,0.0021489093,0.00042967845,0.00086766103,0.0020629035,0.003507401,0.0030332159,0.015216705],"category_scores_gemma":[0.0060958113,0.0010802215,0.0015049193,0.001208205,0.0015444556,0.006252774,0.0025747872,0.004672595,0.0013286144],"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.000700148,0.00052982185,0.00063631,0.0011572081,0.00018871493,0.00053390115,0.0003307527,0.14813708,0.006132528,0.7046331,0.041134033,0.09588644],"study_design_scores_gemma":[0.00014820592,0.0002093726,0.0004400679,0.000065992026,0.000051010735,0.00027046603,0.00007691278,0.39524576,0.0019495621,0.59129333,0.010206869,0.000042504165],"about_ca_topic_score_codex":0.0009742694,"about_ca_topic_score_gemma":0.0014433635,"teacher_disagreement_score":0.015216705,"about_ca_system_score_codex":0.0016276203,"about_ca_system_score_gemma":0.0018270114,"threshold_uncertainty_score":0.05090499},"labels":[],"label_agreement":null},{"id":"W3092815978","doi":"10.1007/s00453-020-00774-8","title":"The Inverse Voronoi Problem in Graphs II: Trees","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Javna Agencija za Raziskovalno Dejavnost RS; Agence Nationale de la Recherche","keywords":"Voronoi diagram; Combinatorics; Mathematics; Shortest path problem; Inverse; Omega; Metric (unit); Binary logarithm; Tree (set theory); Upper and lower bounds; Path (computing); Discrete mathematics; Graph; Physics; Computer science; Geometry","score_opus":0.021066763030633373,"score_gpt":0.22541036658677052,"score_spread":0.20434360355613715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092815978","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.15946807,0.008349291,0.75335246,0.0060221474,0.0006042343,0.00013904905,0.00097357016,0.0002826195,0.070808575],"genre_scores_gemma":[0.81734407,0.005650925,0.15107907,0.00071219367,0.0012725906,0.00017113052,0.001306212,0.00030336314,0.02216054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982521,0.00061007746,0.00007231827,0.0004177648,0.00044277334,0.00020491511],"domain_scores_gemma":[0.9932854,0.004942992,0.0004985574,0.00049467146,0.00041288446,0.00036551603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009853852,0.0005911613,0.0014371872,0.001457408,0.0012451457,0.005745805,0.002050847,0.0023156682,0.0062658065],"category_scores_gemma":[0.010962131,0.0007074572,0.0008957304,0.0027420083,0.0030980736,0.008536704,0.0024302956,0.0035164726,0.0009417349],"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.00008718199,0.0000562718,0.0010896414,0.0002624821,0.000033761808,0.00008392209,0.0003212502,0.03334029,0.0008666434,0.9291422,0.007911411,0.02680497],"study_design_scores_gemma":[0.000011851445,0.000008417288,0.00025214374,0.000023795561,0.000010396957,0.00013224037,0.00013181102,0.038156018,0.00036435324,0.9559444,0.0049553174,0.000009238448],"about_ca_topic_score_codex":0.0018775208,"about_ca_topic_score_gemma":0.0016786548,"teacher_disagreement_score":0.0062658065,"about_ca_system_score_codex":0.0015344387,"about_ca_system_score_gemma":0.0012191759,"threshold_uncertainty_score":0.020961225},"labels":[],"label_agreement":null},{"id":"W3092889289","doi":"10.4230/lipics.socg.2019.15","title":"Preconditioning for the Geometric Transportation Problem","year":2019,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Computational geometry; Logarithm; Euclidean space; Transportation theory; Euclidean geometry; Mathematics; Geometric networks; Mathematical optimization; Dimension (graph theory); Geometric programming; Integer (computer science); Simple (philosophy); Approximation algorithm; Discrete mathematics; Combinatorics; Computer science; Graph theory; Algorithm; Geometry; Mathematical analysis","score_opus":0.013973836162577013,"score_gpt":0.23837965907272265,"score_spread":0.22440582291014563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092889289","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.015549155,0.0003984718,0.9739276,0.00070867396,0.00014997328,0.000101046964,0.00016293455,0.00092432834,0.008077832],"genre_scores_gemma":[0.3123133,0.00092468114,0.6758497,0.00062300754,0.00027894473,0.0004319824,0.0008704181,0.00047053545,0.008237409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999186,0.00022940773,0.000045091536,0.00020583284,0.00018908846,0.00014462741],"domain_scores_gemma":[0.9982358,0.0009044961,0.0001553366,0.00039355727,0.00020167451,0.00010905578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010711511,0.0011850704,0.0010620857,0.00045420357,0.00073727395,0.0009021569,0.0011856976,0.0011723092,0.011365941],"category_scores_gemma":[0.006608769,0.0003539928,0.0009094385,0.00090511615,0.0013368992,0.0027980502,0.0018118755,0.0027365112,0.0018817156],"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.00067946326,0.00020763685,0.00119889,0.0004947162,0.000046766057,0.00020367895,0.00024460984,0.46613696,0.006335061,0.28296992,0.026912145,0.21457025],"study_design_scores_gemma":[0.00007063679,0.00012843106,0.0001837027,0.00003305449,0.000014927056,0.00008952903,0.00004984819,0.84124976,0.0019116345,0.14836957,0.007884742,0.000014033855],"about_ca_topic_score_codex":0.003159133,"about_ca_topic_score_gemma":0.0031827937,"teacher_disagreement_score":0.011365941,"about_ca_system_score_codex":0.0012125815,"about_ca_system_score_gemma":0.0017060166,"threshold_uncertainty_score":0.038022876},"labels":[],"label_agreement":null},{"id":"W3099735866","doi":"","title":"A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Bounded function; Spanning tree; Steiner tree problem; Minimum degree spanning tree; Minimum spanning tree; Minimum weight; Binary logarithm; Asymptotically optimal algorithm; Upper and lower bounds; Graph; k-minimum spanning tree; Discrete mathematics; K-ary tree; Tree structure; Algorithm; Mathematical analysis","score_opus":0.03766430405973071,"score_gpt":0.2539860380125754,"score_spread":0.2163217339528447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099735866","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.31360343,0.008410989,0.6510978,0.0050658477,0.00025459894,0.00023924862,0.00086845394,0.0013990062,0.019060694],"genre_scores_gemma":[0.93792844,0.002838913,0.052511804,0.0012208351,0.00029228767,0.00032950498,0.0005430904,0.00029952312,0.0040356494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693286,0.00076193194,0.00016740568,0.00078458624,0.00073423766,0.0006189862],"domain_scores_gemma":[0.96526384,0.026174756,0.0030361873,0.0019544978,0.0015232383,0.0020473849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004088656,0.0012895286,0.0023192037,0.0026010715,0.0015726583,0.0033790846,0.0032959464,0.0037064306,0.0035427592],"category_scores_gemma":[0.059128188,0.0015290398,0.0018903005,0.0020012322,0.0039116917,0.009342906,0.0038544536,0.0043797907,0.0007187151],"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.0013841449,0.00021003447,0.007000412,0.00121476,0.00027474662,0.0010829051,0.0010816252,0.1788013,0.024656408,0.7293738,0.010128698,0.044791088],"study_design_scores_gemma":[0.00016467788,0.00025049318,0.0029373476,0.00023857123,0.000119532044,0.0009111188,0.00017987516,0.51004577,0.0056029074,0.47468302,0.004766344,0.0001003283],"about_ca_topic_score_codex":0.0016857545,"about_ca_topic_score_gemma":0.0014295303,"teacher_disagreement_score":0.004088656,"about_ca_system_score_codex":0.0037047318,"about_ca_system_score_gemma":0.0010374034,"threshold_uncertainty_score":0.026879787},"labels":[],"label_agreement":null},{"id":"W3099773693","doi":"","title":"Regular finite decomposition complexity","year":2019,"lang":"en","type":"article","venue":"MPG.PuRe (Max Planck Society)","topic":"Complexity and Algorithms in Graphs","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":"McMaster University","funders":"","keywords":"Mathematics; Decomposition; Algebra over a field; Pure mathematics; Discrete mathematics","score_opus":0.019232649625109104,"score_gpt":0.24638448892453074,"score_spread":0.22715183929942165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099773693","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.4432566,0.0019487906,0.47207385,0.0013252327,0.00024026506,0.00008160998,0.0012714337,0.00054913305,0.079253115],"genre_scores_gemma":[0.9590722,0.00047334464,0.034575142,0.00016880495,0.00016577823,0.000080670354,0.00072124833,0.000097436656,0.004645474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986687,0.00024022105,0.00009155684,0.0003503559,0.0004204395,0.0002287628],"domain_scores_gemma":[0.99683124,0.0010032877,0.00035471504,0.00072232314,0.00060797116,0.000480451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086608453,0.00045818053,0.00051959674,0.001783033,0.0009005779,0.002017388,0.0009021771,0.0005351923,0.003606998],"category_scores_gemma":[0.004228362,0.00018734692,0.0009865105,0.0012926918,0.002692627,0.0045648376,0.002234588,0.0015044349,0.0004432307],"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.000021683289,0.00001616785,0.0014352994,0.000059162892,0.000017993316,0.00015148503,0.00033321476,0.0032473519,0.0018522767,0.9814612,0.0012303508,0.010173833],"study_design_scores_gemma":[0.0000055454393,0.00005219048,0.0017659981,0.000035274665,0.000017771908,0.00076703995,0.00014658582,0.021150665,0.0018115907,0.9583147,0.015904823,0.000027707081],"about_ca_topic_score_codex":0.00076752243,"about_ca_topic_score_gemma":0.00045791268,"teacher_disagreement_score":0.003606998,"about_ca_system_score_codex":0.0013955774,"about_ca_system_score_gemma":0.00042184003,"threshold_uncertainty_score":0.012066662},"labels":[],"label_agreement":null},{"id":"W3099873237","doi":"","title":"Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds","year":2020,"lang":"en","type":"article","venue":"Neural Information Processing Systems","topic":"Complexity and Algorithms in Graphs","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 British Columbia","funders":"","keywords":"Submodular set function; Regret; Computer science; Maximization; Order (exchange); Algorithm; Approximation algorithm; Mathematical optimization; Mathematics; Machine learning","score_opus":0.04129501515726763,"score_gpt":0.26037031659564563,"score_spread":0.219075301438378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099873237","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.0045807427,0.0008008614,0.9865568,0.0006433047,0.00021384582,0.00011621085,0.00021529275,0.0010241934,0.0058486625],"genre_scores_gemma":[0.20625512,0.0010553295,0.77227056,0.0011039057,0.0007913593,0.0008896793,0.0012440347,0.0016624638,0.014727648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948014,0.001772145,0.00027346116,0.0009955202,0.0013673346,0.0007901536],"domain_scores_gemma":[0.9772019,0.017224086,0.0008228455,0.002540199,0.0015993448,0.000611656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064898464,0.0041695274,0.0040655653,0.0023155515,0.001452802,0.0049270904,0.0075717648,0.0041905413,0.016706841],"category_scores_gemma":[0.03128014,0.0018889578,0.0026224847,0.0036870155,0.0026560691,0.009638143,0.005700934,0.010276528,0.0050167944],"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.00056468946,0.00077117747,0.00083465525,0.00058487593,0.00019392809,0.00014167571,0.00027003966,0.5662181,0.002446612,0.18085101,0.02973805,0.21738525],"study_design_scores_gemma":[0.000045332825,0.000038144553,0.000111791494,0.000027399734,0.000022086375,0.000029932091,0.0000178993,0.92070657,0.0005295198,0.07747309,0.0009810813,0.000017187065],"about_ca_topic_score_codex":0.004448918,"about_ca_topic_score_gemma":0.008058358,"teacher_disagreement_score":0.016706841,"about_ca_system_score_codex":0.00410941,"about_ca_system_score_gemma":0.004779099,"threshold_uncertainty_score":0.055890024},"labels":[],"label_agreement":null},{"id":"W3103645939","doi":"10.1007/978-3-030-83508-8_44","title":"Routing on Heavy-Path WSPD-Spanners","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Carleton University","funders":"","keywords":"Spanner; Combinatorics; Routing (electronic design automation); Equal-cost multi-path routing; Path (computing); Mathematics; Routing algorithm; Bounded function; Graph; Discrete mathematics; Static routing; Computer science; Computer network; Distributed computing; Routing protocol","score_opus":0.02440027243317933,"score_gpt":0.24931211597163747,"score_spread":0.22491184353845814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103645939","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.29296336,0.0007239924,0.61338127,0.0006249066,0.00038199848,0.00033413357,0.001957577,0.0020753248,0.08755742],"genre_scores_gemma":[0.7148985,0.0012358907,0.21971819,0.00025107872,0.00014814042,0.00021139925,0.002378795,0.00049629743,0.06066169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972063,0.000039473227,0.000023880883,0.00007364976,0.0000713301,0.00007099979],"domain_scores_gemma":[0.9993711,0.00014974918,0.00006564394,0.0002096619,0.0001019525,0.00010188524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030582672,0.0006306376,0.00065005716,0.00085091585,0.00073851756,0.0014569202,0.001208757,0.00054477947,0.011985343],"category_scores_gemma":[0.0011340441,0.00037370477,0.00043657588,0.0017070189,0.00049218326,0.002604181,0.0020889433,0.0009465727,0.0019397524],"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.0006528331,0.00020720379,0.0010267828,0.00053316413,0.000091431924,0.0005810398,0.0003294492,0.16323611,0.033279076,0.52944916,0.017813634,0.25280008],"study_design_scores_gemma":[0.0000537474,0.0002421466,0.0005783782,0.00008481739,0.00004431601,0.0004308393,0.00020043534,0.29426387,0.011815457,0.66625524,0.025997017,0.000033685013],"about_ca_topic_score_codex":0.000882125,"about_ca_topic_score_gemma":0.0014978659,"teacher_disagreement_score":0.011985343,"about_ca_system_score_codex":0.0006401916,"about_ca_system_score_gemma":0.00044375873,"threshold_uncertainty_score":0.040094912},"labels":[],"label_agreement":null},{"id":"W3108038062","doi":"10.1145/3488250","title":"Erasure-Resilient Sublinear-Time Graph Algorithms","year":2021,"lang":"en","type":"preprint","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","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":"Simons Institute for the Theory of Computing, University of California Berkeley; Israel Science Foundation; National Science Foundation","keywords":"Sublinear function; Degree (music); Property testing; Social connectedness; Erasure; Adjacency list; Mathematics; Algorithm; Discrete mathematics; Graph property; Computer science; Graph; Time complexity; Combinatorics; Theoretical computer science; Line graph","score_opus":0.026755156282618764,"score_gpt":0.27548059888454823,"score_spread":0.24872544260192947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108038062","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.122169845,0.0017281179,0.849926,0.0043703397,0.00027079092,0.00035438646,0.0011948367,0.0113328425,0.008652901],"genre_scores_gemma":[0.6737473,0.0006430035,0.31583714,0.0013776659,0.00030587657,0.0004178577,0.001386643,0.00085525884,0.0054292264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99434763,0.0016915911,0.00030322775,0.0018018945,0.0009704787,0.0008852242],"domain_scores_gemma":[0.967136,0.021786654,0.0021515808,0.0073794858,0.0009125558,0.0006336912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004020106,0.0024268518,0.0024489406,0.0014239271,0.0012051677,0.0032025506,0.0066381125,0.0029367218,0.0068974523],"category_scores_gemma":[0.027133035,0.0010908948,0.0017983229,0.0028612905,0.0028416205,0.012462117,0.0037993162,0.004019946,0.0020478289],"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.0020765776,0.00065011706,0.002010227,0.00066483923,0.00022501592,0.00023504453,0.0005546018,0.74339944,0.008819671,0.08361429,0.01478662,0.14296354],"study_design_scores_gemma":[0.000120844925,0.000112947055,0.00017199047,0.000015866057,0.000040383467,0.00011972133,0.00004901943,0.9107625,0.0040181866,0.083319664,0.0012490463,0.000019887404],"about_ca_topic_score_codex":0.0020532669,"about_ca_topic_score_gemma":0.0028865424,"teacher_disagreement_score":0.0068974523,"about_ca_system_score_codex":0.0038708616,"about_ca_system_score_gemma":0.0029350636,"threshold_uncertainty_score":0.028085172},"labels":[],"label_agreement":null},{"id":"W3108451666","doi":"10.48550/arxiv.2011.14450","title":"Approximation algorithms for hitting subgraphs","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Hypergraph; Combinatorics; Mathematics; Approximation algorithm; Vertex cover; Vertex (graph theory); Undirected graph; Discrete mathematics; Graph","score_opus":0.1562712320790418,"score_gpt":0.21712803545084147,"score_spread":0.06085680337179966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108451666","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.09579222,0.0033425586,0.8684983,0.0033054003,0.00026533345,0.00038825953,0.0027483392,0.005368117,0.020291418],"genre_scores_gemma":[0.5207253,0.0025944887,0.45276034,0.0010656269,0.0003920988,0.00062671554,0.008324408,0.0014387629,0.0120723015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969584,0.00073352293,0.00015685207,0.00089947105,0.00064385,0.00060801447],"domain_scores_gemma":[0.9920866,0.004448908,0.00055853795,0.0021057392,0.00039195255,0.00040828311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020546312,0.0024032588,0.0023063198,0.002348918,0.0014394707,0.004023193,0.0049441676,0.0026028648,0.011516658],"category_scores_gemma":[0.015155099,0.0010379589,0.0022421745,0.005052619,0.0016601376,0.009892821,0.0031197888,0.0039730337,0.0025759193],"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.0011196638,0.0006478943,0.0038960613,0.0009793451,0.00045529532,0.00027491606,0.0008191764,0.44806722,0.005125033,0.2303594,0.046576474,0.2616795],"study_design_scores_gemma":[0.00014228762,0.000091995455,0.00049527705,0.00006265999,0.00009581726,0.00018850247,0.00016332284,0.6625863,0.001635899,0.32887644,0.0056367354,0.000024808905],"about_ca_topic_score_codex":0.006533224,"about_ca_topic_score_gemma":0.0075068395,"teacher_disagreement_score":0.011516658,"about_ca_system_score_codex":0.004228932,"about_ca_system_score_gemma":0.0023413028,"threshold_uncertainty_score":0.03852707},"labels":[],"label_agreement":null},{"id":"W3109005260","doi":"10.1007/s00453-022-01000-3","title":"Monotone Circuit Lower Bounds from Robust Sunflowers","year":2022,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","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":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; University of Toronto; Fundação de Amparo à Pesquisa do Estado de São Paulo; Alfred P. Sloan Foundation","keywords":"Mathematics; Monotone polygon; Conjecture; Upper and lower bounds; Combinatorics; Discrete mathematics; Boolean function; Theory of computation; Algorithm","score_opus":0.0248240701737722,"score_gpt":0.21198124739635596,"score_spread":0.18715717722258376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3109005260","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.17037615,0.0064647067,0.6494907,0.008844434,0.00082078134,0.00047289202,0.0051998906,0.003061485,0.15526904],"genre_scores_gemma":[0.86471266,0.003523007,0.10683031,0.0033670543,0.0020489423,0.00071685715,0.0036574325,0.0011180333,0.014025721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629176,0.0005734711,0.00014190696,0.00080894335,0.0015453014,0.0006387059],"domain_scores_gemma":[0.9729998,0.021540998,0.00090257067,0.0023881637,0.0012962136,0.0008723056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024792089,0.001970074,0.001827514,0.0035222901,0.0015862944,0.0040871226,0.003764625,0.0022410122,0.02214851],"category_scores_gemma":[0.025013888,0.0009795565,0.0022913967,0.0023217374,0.0028145164,0.01031284,0.00505244,0.006833149,0.002153079],"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.00058442814,0.00025788037,0.00249518,0.0010769648,0.00016426254,0.00046773878,0.0004163417,0.103312105,0.010982363,0.7871249,0.029399363,0.06371852],"study_design_scores_gemma":[0.000054402462,0.00009886458,0.0005709491,0.000110313806,0.00006096728,0.00025325676,0.000050800492,0.20993662,0.004143577,0.77736515,0.0073060817,0.00004902368],"about_ca_topic_score_codex":0.0011773749,"about_ca_topic_score_gemma":0.0014905313,"teacher_disagreement_score":0.02214851,"about_ca_system_score_codex":0.002976614,"about_ca_system_score_gemma":0.0012273297,"threshold_uncertainty_score":0.07409418},"labels":[],"label_agreement":null},{"id":"W3113424924","doi":"10.1007/978-3-030-61792-9_25","title":"Monotone Circuit Lower Bounds from Robust Sunflowers","year":2020,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Monotone polygon; Clique; Combinatorics; Upper and lower bounds; Mathematics; Conjecture; Discrete mathematics; Function (biology); Generalization; Boolean function","score_opus":0.03200032741610515,"score_gpt":0.23597260365970743,"score_spread":0.20397227624360229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113424924","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.08625239,0.0050412696,0.73675483,0.005508568,0.0008593535,0.00044966335,0.0022920957,0.0023790004,0.1604628],"genre_scores_gemma":[0.7897599,0.005109843,0.15347657,0.0035086363,0.0017618537,0.00076928776,0.0024753914,0.0016815965,0.041456964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715245,0.0004967385,0.000108278975,0.0006342345,0.0010849641,0.0005232813],"domain_scores_gemma":[0.98796356,0.008781473,0.0006205679,0.0013195628,0.0007286019,0.0005863353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028573286,0.0034092518,0.002660189,0.0030686753,0.0017025386,0.00477638,0.0056775287,0.0028644009,0.030122008],"category_scores_gemma":[0.017214358,0.0015841986,0.003444182,0.003265296,0.0027716628,0.011285435,0.006314358,0.008230297,0.0027428116],"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.00071383757,0.00029662275,0.00065660966,0.00083639205,0.00019978044,0.00022188164,0.0002933829,0.093502246,0.008310554,0.7865267,0.023002932,0.08543921],"study_design_scores_gemma":[0.00006545913,0.00011055866,0.00027584223,0.000096938114,0.00009954252,0.00009719564,0.00003554728,0.114923455,0.0026827762,0.87590504,0.0056697745,0.000037892787],"about_ca_topic_score_codex":0.0016919586,"about_ca_topic_score_gemma":0.0024506408,"teacher_disagreement_score":0.030122008,"about_ca_system_score_codex":0.003740948,"about_ca_system_score_gemma":0.001405326,"threshold_uncertainty_score":0.10076815},"labels":[],"label_agreement":null},{"id":"W3115470548","doi":"10.1145/3402926","title":"Deterministic APSP, Orthogonal Vectors, and More","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":22,"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":"University of Waterloo; National Science Foundation","keywords":"Satisfiability; Deterministic algorithm; Combinatorics; Mathematics; Binary logarithm; Randomized algorithm; Discrete mathematics; Matching (statistics); Algorithm; Statistics","score_opus":0.0392331204555236,"score_gpt":0.2640326974534066,"score_spread":0.22479957699788297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115470548","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.065835446,0.00035975676,0.915037,0.001779551,0.0001807112,0.00013855966,0.0007208051,0.0021812294,0.013766874],"genre_scores_gemma":[0.53032404,0.00030245577,0.45486316,0.0007479355,0.0001482801,0.0003823348,0.0013064682,0.00039151608,0.011533819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743736,0.0005748976,0.00015377584,0.00073147414,0.00073242665,0.0003700719],"domain_scores_gemma":[0.99545765,0.0013713699,0.00044983652,0.0020412286,0.00045611258,0.00022372218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016030297,0.0011592524,0.0010783308,0.001038537,0.0014504008,0.002324079,0.0024186093,0.0012247075,0.013456744],"category_scores_gemma":[0.007267531,0.00059977133,0.0011662052,0.001984484,0.0019155581,0.005830616,0.004141356,0.0023605993,0.0017310368],"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.000776473,0.00036160866,0.00442479,0.0003980593,0.000074416144,0.0001996136,0.0003198249,0.15811901,0.010256523,0.628383,0.012557192,0.18412954],"study_design_scores_gemma":[0.00009516955,0.00024645147,0.0006057423,0.00003608338,0.000044340497,0.00019746742,0.000117541334,0.49085054,0.009715609,0.48582014,0.012200859,0.00007007932],"about_ca_topic_score_codex":0.0048549403,"about_ca_topic_score_gemma":0.008082647,"teacher_disagreement_score":0.013456744,"about_ca_system_score_codex":0.0021162028,"about_ca_system_score_gemma":0.0029031136,"threshold_uncertainty_score":0.045017242},"labels":[],"label_agreement":null},{"id":"W3116404732","doi":"10.4230/lipics.fsttcs.2020.33","title":"Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Algorithm; Computer science; Amortized analysis; Distributed algorithm; Vertex (graph theory); Sublinear function; Sequence (biology); Deterministic algorithm; Computation; Degree (music); Parallel algorithm; Combinatorics; Graph; Mathematics; Theoretical computer science; Data structure","score_opus":0.03316991790132955,"score_gpt":0.27476811442225246,"score_spread":0.2415981965209229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116404732","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.018050456,0.000575407,0.97344357,0.0004383107,0.000074232434,0.00016094507,0.0002802059,0.0017148827,0.005261966],"genre_scores_gemma":[0.35582083,0.00043419123,0.63597816,0.0002832507,0.00013067754,0.00041531335,0.0011526392,0.00055304787,0.005231842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973701,0.00054530584,0.00015620867,0.00087110454,0.00070241693,0.00035478428],"domain_scores_gemma":[0.9956813,0.0020240666,0.00033955037,0.0013384835,0.00042985968,0.00018662114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001956018,0.0010384712,0.0010761798,0.0009073002,0.0010536752,0.002119731,0.0034989847,0.0011977489,0.0052078706],"category_scores_gemma":[0.0060535097,0.00068877375,0.0008331418,0.0017575694,0.0012100892,0.004693164,0.0030037258,0.0017657123,0.0009698152],"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.0011757307,0.00033004826,0.0013185807,0.00057164417,0.00013126816,0.00011175573,0.00030139307,0.4545992,0.010721081,0.204933,0.014137144,0.31166908],"study_design_scores_gemma":[0.00010472001,0.000092772985,0.00019756872,0.000021601049,0.000026678314,0.00013023298,0.00004142679,0.83605784,0.003729699,0.1537945,0.005781554,0.000021419522],"about_ca_topic_score_codex":0.002019164,"about_ca_topic_score_gemma":0.0028905813,"teacher_disagreement_score":0.0052078706,"about_ca_system_score_codex":0.0019249658,"about_ca_system_score_gemma":0.001953017,"threshold_uncertainty_score":0.01742202},"labels":[],"label_agreement":null},{"id":"W3118028601","doi":"10.1007/s10107-025-02301-5","title":"Beyond submodular maximization via one-sided smoothness","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","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 British Columbia; University of British Columbia Hospital","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Multilinear map; Matroid; Combinatorics; Mathematics; Discrete mathematics; Monotone polygon; Nabla symbol; Parameterized complexity; Linear subspace; Polytope; Omega; Pure mathematics; Physics","score_opus":0.01847810080773667,"score_gpt":0.2587033691405789,"score_spread":0.24022526833284222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118028601","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.0069913687,0.00036461753,0.9872989,0.0005640928,0.00003434677,0.000029863879,0.00007013345,0.0001377652,0.0045089307],"genre_scores_gemma":[0.56157315,0.0011336026,0.42321047,0.0008548919,0.00027098996,0.00032626305,0.0003130405,0.00036576513,0.011951813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810493,0.00095015694,0.00004923751,0.00030783808,0.00042604384,0.00016177032],"domain_scores_gemma":[0.9970381,0.0020532808,0.00019197416,0.00031397812,0.000262326,0.00014034043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004208522,0.0011980092,0.0013615706,0.00080188527,0.00057688693,0.0016688823,0.0016138862,0.0013281475,0.004463794],"category_scores_gemma":[0.009211498,0.00053775054,0.0012287941,0.0011822494,0.0018470285,0.0027288417,0.0023837585,0.0036620814,0.0007479763],"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.00010347319,0.000089175985,0.0004379265,0.00019768941,0.000060692928,0.00011563796,0.000104772305,0.45796198,0.0025316314,0.46898615,0.005895112,0.06351581],"study_design_scores_gemma":[0.000010240256,0.000039148552,0.000081707214,0.000020118996,0.000007423576,0.000027475158,0.000012250362,0.83495665,0.0005932017,0.16183122,0.0024115527,0.000009082934],"about_ca_topic_score_codex":0.0018438929,"about_ca_topic_score_gemma":0.0014209909,"teacher_disagreement_score":0.004463794,"about_ca_system_score_codex":0.002120652,"about_ca_system_score_gemma":0.001350329,"threshold_uncertainty_score":0.02225703},"labels":[],"label_agreement":null},{"id":"W3125711631","doi":"10.1007/s10589-020-00261-4","title":"A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem","year":2021,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Mathematics; Bounding overwatch; Iterated function; Maximum cut; Eigenvalues and eigenvectors; Semidefinite programming; Upper and lower bounds; Mathematical optimization; Vertex (graph theory); Discrete mathematics; Graph; Computer science","score_opus":0.021822011724032295,"score_gpt":0.2932571728029479,"score_spread":0.2714351610789156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125711631","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.008778701,0.00013656919,0.9858838,0.00017497926,0.00009380625,0.00006439448,0.000046641133,0.00006889366,0.00475226],"genre_scores_gemma":[0.16491656,0.00027786513,0.8246684,0.00025929557,0.00013212439,0.00030839033,0.0002644622,0.00032317315,0.008849804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952304,0.00017840629,0.000019352774,0.00007211194,0.00016011465,0.0000469672],"domain_scores_gemma":[0.99933016,0.00029359953,0.00004584674,0.00008132091,0.00015207285,0.00009698519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014078136,0.00078899454,0.0009045463,0.00065667316,0.00064753677,0.0009457029,0.0019143313,0.0014016685,0.005684055],"category_scores_gemma":[0.0029410406,0.00049892545,0.0007698928,0.00057425443,0.0009440369,0.0012312193,0.0020908376,0.0027792659,0.00074000726],"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.0003319624,0.00028952202,0.0006327066,0.00034372427,0.000080984595,0.00019356907,0.0003182177,0.37036672,0.018639512,0.36503056,0.009641581,0.23413098],"study_design_scores_gemma":[0.00002474783,0.00004587221,0.000081505415,0.000023371476,0.000008899571,0.0000300971,0.000023133583,0.96390504,0.0006364582,0.033040106,0.0021707735,0.000010010066],"about_ca_topic_score_codex":0.0018769044,"about_ca_topic_score_gemma":0.0026970997,"teacher_disagreement_score":0.005684055,"about_ca_system_score_codex":0.0006154056,"about_ca_system_score_gemma":0.0014982875,"threshold_uncertainty_score":0.019015014},"labels":[],"label_agreement":null},{"id":"W3125922185","doi":"10.1142/s0217595921400017","title":"Non-Submodular Maximization with Matroid and Knapsack Constraints","year":2021,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Complexity and Algorithms in Graphs","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":"Submodular set function; Matroid; Knapsack problem; Maximization; Mathematics; Constraint (computer-aided design); Greedy algorithm; Combinatorics; Function (biology); Mathematical optimization; Discrete mathematics; Geometry","score_opus":0.04239402338292181,"score_gpt":0.3160553754276193,"score_spread":0.2736613520446975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125922185","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.017506197,0.00077333616,0.97413456,0.0006130693,0.000084057516,0.00008674457,0.00024811798,0.00019216751,0.0063615935],"genre_scores_gemma":[0.5296379,0.0018897834,0.45453954,0.00046375417,0.00034160537,0.00039272817,0.000660769,0.0003952015,0.011678795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860805,0.00065241853,0.000038372422,0.0003323941,0.00021653813,0.0001522576],"domain_scores_gemma":[0.9964384,0.0025521251,0.00036964592,0.00030568018,0.00016349369,0.00017073248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002064294,0.002064854,0.0022955616,0.00075373094,0.00047753126,0.0017902035,0.0028365543,0.0016021392,0.0050338344],"category_scores_gemma":[0.006923957,0.0007777476,0.0012722701,0.0028585654,0.0014189099,0.003960577,0.0017930219,0.0024084249,0.0010454591],"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.00015872976,0.00022782308,0.0004010021,0.00054847274,0.00013400555,0.00027972338,0.00008863597,0.8055757,0.0021796108,0.13874932,0.008088115,0.04356889],"study_design_scores_gemma":[0.000016647698,0.00005223901,0.00009947647,0.00001748623,0.000017827258,0.00007867061,0.000021532282,0.93157214,0.00058312353,0.06626979,0.0012605177,0.000010535702],"about_ca_topic_score_codex":0.0021280209,"about_ca_topic_score_gemma":0.0022497699,"teacher_disagreement_score":0.0050338344,"about_ca_system_score_codex":0.0016902754,"about_ca_system_score_gemma":0.0013001369,"threshold_uncertainty_score":0.016839802},"labels":[],"label_agreement":null},{"id":"W3126714247","doi":"10.1109/focs52979.2021.00058","title":"Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":35,"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":"U.S. Department of Defense; National Science Foundation","keywords":"Combinatorics; Integer (computer science); Bounded function; Algorithm; Computer science; Discrete mathematics; Mathematics; Artificial intelligence; Programming language; Mathematical analysis","score_opus":0.02194554114572731,"score_gpt":0.2572976699790676,"score_spread":0.2353521288333403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126714247","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.029148422,0.0006483422,0.94499147,0.0011640469,0.0002019703,0.00014186406,0.0006011954,0.007556269,0.015546455],"genre_scores_gemma":[0.3166713,0.00040020322,0.67027193,0.0004871509,0.00020885606,0.0003059542,0.0012574862,0.0010667044,0.009330298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922323,0.0002010237,0.00004389972,0.00019551563,0.00018211344,0.00015414243],"domain_scores_gemma":[0.9975193,0.0013679259,0.00016440585,0.0005985452,0.0002416476,0.000108086126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014482953,0.0016028717,0.0013244371,0.0014676724,0.0008097296,0.001669731,0.0019510541,0.0016204295,0.01597553],"category_scores_gemma":[0.008119062,0.0006869356,0.001179666,0.001648414,0.0009916481,0.005093952,0.0022968014,0.0018101697,0.0031580026],"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.000689645,0.00020149969,0.0011967078,0.00037769089,0.00009940287,0.00013787145,0.0002372058,0.50477123,0.0040535857,0.108308904,0.023057735,0.35686857],"study_design_scores_gemma":[0.000060241342,0.0000436226,0.00014567711,0.000028482358,0.000015747462,0.000044469067,0.000029636716,0.8904063,0.0012604966,0.10445899,0.0034913642,0.0000149764755],"about_ca_topic_score_codex":0.005042976,"about_ca_topic_score_gemma":0.008387851,"teacher_disagreement_score":0.01597553,"about_ca_system_score_codex":0.0014768041,"about_ca_system_score_gemma":0.0022292507,"threshold_uncertainty_score":0.05344349},"labels":[],"label_agreement":null},{"id":"W3127093867","doi":"10.1109/focs46700.2020.00031","title":"A Tight Composition Theorem for the Randomized Query Complexity of Partial Functions: Extended Abstract","year":2020,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Combinatorics; Composition (language); Mathematics; Conjecture; Measure (data warehouse); Characterization (materials science); Boolean function; Function (biology); Oracle; Randomized algorithm; Discrete mathematics; Type (biology); Physics; Computer science","score_opus":0.0623333746463483,"score_gpt":0.27544934783109226,"score_spread":0.21311597318474396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127093867","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.07030842,0.0010463042,0.89960366,0.004756452,0.00028744378,0.00037994576,0.00078633474,0.0027722544,0.020059224],"genre_scores_gemma":[0.75346655,0.0010652136,0.22315645,0.0031403012,0.0015558752,0.0016969859,0.0015549326,0.0017905531,0.01257319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.96760386,0.0063485145,0.0019507889,0.0073611545,0.012308537,0.0044271536],"domain_scores_gemma":[0.89099026,0.07882181,0.005223935,0.016279424,0.005690868,0.0029936947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019688535,0.002734906,0.0045816326,0.0033998163,0.003932554,0.010557794,0.006479797,0.0037471147,0.020643035],"category_scores_gemma":[0.08703522,0.0027159061,0.0070233755,0.0038803036,0.008904017,0.032881774,0.014635806,0.013417318,0.0033848365],"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.0016181706,0.00077524665,0.0039525647,0.00086088094,0.00030811637,0.00040714475,0.000799954,0.066715024,0.014889114,0.85451406,0.0074549513,0.047704868],"study_design_scores_gemma":[0.0002007254,0.00020626964,0.0009383139,0.000084485786,0.00017026444,0.00037167684,0.00011282645,0.30783707,0.013045542,0.6727103,0.0042255204,0.00009698164],"about_ca_topic_score_codex":0.0024792135,"about_ca_topic_score_gemma":0.001355048,"teacher_disagreement_score":0.020643035,"about_ca_system_score_codex":0.007522975,"about_ca_system_score_gemma":0.00622707,"threshold_uncertainty_score":0.10412413},"labels":[],"label_agreement":null},{"id":"W3127553026","doi":"10.1109/focs46700.2020.00045","title":"A New Minimax Theorem for Randomized Algorithms (Extended Abstract)","year":2020,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Minimax; Computer science; Minimax theorem; Algorithm; Mathematics; Mathematical optimization","score_opus":0.0333413938213585,"score_gpt":0.2703619376936957,"score_spread":0.2370205438723372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127553026","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.0066220537,0.0015371933,0.9724762,0.0037468772,0.0004890187,0.000097601966,0.000318313,0.0004441376,0.014268526],"genre_scores_gemma":[0.47276822,0.0046812412,0.46983105,0.0077258907,0.0048894254,0.0023206947,0.0009002181,0.0012342342,0.035649158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934396,0.0020093797,0.0003058089,0.0016506478,0.0020853989,0.00050920516],"domain_scores_gemma":[0.9848705,0.0109999655,0.0006779267,0.0018389019,0.0013172947,0.00029537812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007509952,0.0018041631,0.0021514117,0.0018477241,0.0013944011,0.0045867236,0.0031865675,0.0024971184,0.009037875],"category_scores_gemma":[0.026865702,0.0009633174,0.002897876,0.0028740966,0.0057244767,0.010696412,0.004426293,0.0109851975,0.0021023774],"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.0000657188,0.00004225816,0.00027791434,0.00014328428,0.00005380719,0.000058970996,0.000095641626,0.019862061,0.0009706656,0.95201933,0.00636653,0.02004372],"study_design_scores_gemma":[0.00004499922,0.000056920107,0.00017368188,0.00004558457,0.000022016555,0.00006712234,0.000011251618,0.10793687,0.0009031614,0.88326985,0.0074460385,0.000022491104],"about_ca_topic_score_codex":0.0010840807,"about_ca_topic_score_gemma":0.00076489314,"teacher_disagreement_score":0.009037875,"about_ca_system_score_codex":0.0037206868,"about_ca_system_score_gemma":0.0021205018,"threshold_uncertainty_score":0.0397169},"labels":[],"label_agreement":null},{"id":"W3128575592","doi":"","title":"The maximum weight stable set problem with a budget constraint","year":2020,"lang":"en","type":"dissertation","venue":"Summit (Simon Fraser University)","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","keywords":"Set (abstract data type); Constraint (computer-aided design); Budget constraint; Mathematical optimization; Computer science; Mathematics; Operations research; Economics; Microeconomics; Programming language","score_opus":0.011936377588198606,"score_gpt":0.20322566887286295,"score_spread":0.19128929128466435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128575592","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.07447856,0.0005432726,0.8861928,0.0015962112,0.00012034015,0.00018827515,0.000659381,0.00019980792,0.03602132],"genre_scores_gemma":[0.69138354,0.0010998063,0.28111964,0.00023978752,0.00019626417,0.0004239862,0.000883677,0.00015478746,0.024498474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991516,0.00036535377,0.000027565296,0.00015805727,0.00016932072,0.00012805607],"domain_scores_gemma":[0.9989434,0.0006719933,0.00013169712,0.000071384646,0.00008505779,0.00009646651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008503133,0.001091322,0.00086682674,0.0008632849,0.00066240825,0.0016071995,0.0014631803,0.0014756958,0.007756006],"category_scores_gemma":[0.00300464,0.0004981186,0.000940571,0.0017799134,0.0008816029,0.0028911491,0.001284091,0.0016343226,0.00071641157],"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.00015171124,0.00019491055,0.00067448796,0.00027984421,0.000076165765,0.000313431,0.00016036555,0.6250479,0.0038691512,0.3148961,0.0059795626,0.04835637],"study_design_scores_gemma":[0.00004318747,0.00012376267,0.0002892001,0.000046590034,0.000031113475,0.00015117342,0.00012633362,0.7920488,0.001668926,0.19759916,0.007850373,0.000021428297],"about_ca_topic_score_codex":0.002592027,"about_ca_topic_score_gemma":0.0028309787,"teacher_disagreement_score":0.007756006,"about_ca_system_score_codex":0.0011330077,"about_ca_system_score_gemma":0.0010607692,"threshold_uncertainty_score":0.025946379},"labels":[],"label_agreement":null},{"id":"W3131144142","doi":"10.1016/j.orl.2021.09.006","title":"Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid","year":2021,"lang":"en","type":"preprint","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","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":"Matroid; Automatic summarization; Heuristics; Greedy algorithm; Computer science; Set function; Set (abstract data type); Mathematical optimization; Submodular set function; Weighted matroid; Algorithm; Mathematics; Discrete mathematics; Artificial intelligence; Matroid partitioning; Graphic matroid","score_opus":0.0882885469965528,"score_gpt":0.33743894468261254,"score_spread":0.24915039768605973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131144142","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.17952311,0.0015092631,0.8063606,0.0012768178,0.00008458898,0.00016911078,0.0003345441,0.0007870312,0.009954944],"genre_scores_gemma":[0.83861023,0.0010621684,0.15618141,0.00037463065,0.000117322284,0.00025218655,0.00053430424,0.00029261856,0.0025751367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975938,0.0011492054,0.00008205918,0.00035409408,0.00045574026,0.00036508977],"domain_scores_gemma":[0.98896104,0.008079789,0.00080116984,0.0010189841,0.0006462964,0.0004926179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037129722,0.0022373227,0.0017730355,0.00081658637,0.0006451849,0.0019231645,0.0025011066,0.0018923222,0.002071487],"category_scores_gemma":[0.017426785,0.0005595712,0.0008788343,0.0014929433,0.0014342996,0.002715884,0.0020618583,0.0018147894,0.0006263732],"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.0009368425,0.00020810482,0.0013516513,0.0002575984,0.00009578579,0.000070997485,0.00014972684,0.86997247,0.0067862803,0.05269704,0.004428252,0.06304526],"study_design_scores_gemma":[0.000034331122,0.00013244346,0.00020815068,0.00001042453,0.000011818658,0.000034883004,0.000033822795,0.97877926,0.001721353,0.018707057,0.00031699348,0.000009453339],"about_ca_topic_score_codex":0.0016211848,"about_ca_topic_score_gemma":0.0015424922,"teacher_disagreement_score":0.0037129722,"about_ca_system_score_codex":0.0022173147,"about_ca_system_score_gemma":0.0019679319,"threshold_uncertainty_score":0.019636273},"labels":[],"label_agreement":null},{"id":"W3133702556","doi":"","title":"Shrinkage of Decision Lists and DNF Formulas.","year":2020,"lang":"en","type":"article","venue":"Electron. Colloquium Comput. Complex.","topic":"Complexity and Algorithms in Graphs","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":"Mathematics; Combinatorics; Shrinkage; Boolean function; Function (biology); Upper and lower bounds; Domain (mathematical analysis); Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.022438189867162603,"score_gpt":0.24991663093310237,"score_spread":0.22747844106593978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133702556","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.14434016,0.0020206482,0.8307095,0.0030629123,0.00025513404,0.0001790785,0.0010231546,0.0013347953,0.017074535],"genre_scores_gemma":[0.8768156,0.0015865929,0.10806298,0.0011887895,0.00065836083,0.000589251,0.0016724074,0.00057403435,0.008851883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99296415,0.0021680694,0.00033725135,0.0012540472,0.0023959307,0.00088057015],"domain_scores_gemma":[0.8924109,0.08735384,0.0052613686,0.008482576,0.004568822,0.0019223612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006636877,0.0011730945,0.0014359806,0.0015685181,0.000845809,0.0018464748,0.0024569482,0.0010457524,0.006550163],"category_scores_gemma":[0.07707805,0.0009147435,0.0012289188,0.0013629586,0.0023310403,0.007771835,0.003186478,0.003462339,0.0010484768],"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.0015069336,0.00028639493,0.011717902,0.00077380845,0.00024758282,0.0006870152,0.000537851,0.23493874,0.023428896,0.51260746,0.015264781,0.19800256],"study_design_scores_gemma":[0.00007123362,0.00018407652,0.0021845489,0.00006878844,0.00007544182,0.0004916109,0.00006903745,0.6377309,0.007829347,0.34690753,0.0043364433,0.00005113039],"about_ca_topic_score_codex":0.0011887493,"about_ca_topic_score_gemma":0.0017492315,"teacher_disagreement_score":0.006636877,"about_ca_system_score_codex":0.0024175006,"about_ca_system_score_gemma":0.0014686888,"threshold_uncertainty_score":0.035099566},"labels":[],"label_agreement":null},{"id":"W3136251153","doi":"10.48550/arxiv.2103.08061","title":"On distributed algorithms for minimum dominating set problem and beyond","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Dominating set; Set cover problem; Distributed algorithm; Algorithm; Computer science; Connected dominating set; Set (abstract data type); Upper and lower bounds; Graph; Theory of computation; Approximation algorithm; Cover (algebra); Randomized algorithm; Mathematics; Theoretical computer science; Distributed computing","score_opus":0.07399647599064386,"score_gpt":0.2143383928248311,"score_spread":0.14034191683418723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136251153","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.0049088355,0.002554325,0.98320454,0.0018926988,0.0003019462,0.00013939956,0.0000973474,0.00028940896,0.0066114278],"genre_scores_gemma":[0.25128338,0.005396587,0.73068416,0.001409467,0.00097090256,0.00082987815,0.0006367723,0.00039090042,0.008397948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99634224,0.0013755665,0.00019556643,0.00094399933,0.0008358149,0.00030676855],"domain_scores_gemma":[0.9921119,0.0057688993,0.0003430581,0.0009545445,0.0006003123,0.00022118003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035131474,0.0016414188,0.002201709,0.0015506705,0.0016951115,0.0027117534,0.0030770132,0.0022334324,0.0039898218],"category_scores_gemma":[0.012246234,0.0007319319,0.0015466507,0.0032631473,0.0023504437,0.0070038913,0.003556071,0.0042667896,0.0009818139],"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.00027279637,0.00016865754,0.0005819465,0.00069698144,0.00013151488,0.00012790551,0.0004283189,0.38893455,0.0022647993,0.4679284,0.013338094,0.12512602],"study_design_scores_gemma":[0.00007415886,0.00007810568,0.00013959635,0.00007034784,0.000024856836,0.00012609662,0.000073618525,0.5558906,0.0009919758,0.4278165,0.014687561,0.000026626527],"about_ca_topic_score_codex":0.0025356226,"about_ca_topic_score_gemma":0.0017653451,"teacher_disagreement_score":0.0039898218,"about_ca_system_score_codex":0.0032664246,"about_ca_system_score_gemma":0.0022525855,"threshold_uncertainty_score":0.0236997},"labels":[],"label_agreement":null},{"id":"W3138772443","doi":"10.4230/lipics.icdt.2021.3","title":"Box Covers and Domain Orderings for Beyond Worst-Case Join Processing","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Joins; Computer science; Join (topology); Generalization; Domain (mathematical analysis); Cover (algebra); Set (abstract data type); Algorithm; Approximation algorithm; Block (permutation group theory); Certificate; Theoretical computer science; Discrete mathematics; Mathematics; Combinatorics","score_opus":0.015119934348414504,"score_gpt":0.2510682944724922,"score_spread":0.2359483601240777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3138772443","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.035533383,0.00048804146,0.95652276,0.00054567115,0.000047578582,0.00011449081,0.00033958044,0.0025771896,0.003831299],"genre_scores_gemma":[0.2653891,0.000470909,0.72853905,0.00030868922,0.00018427912,0.00025159965,0.0015852952,0.00080309244,0.0024678223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99616784,0.00068674696,0.00027259966,0.0007865405,0.0016405438,0.00044559254],"domain_scores_gemma":[0.98968995,0.0059303236,0.0006473757,0.0027784542,0.0006708193,0.0002830984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002604057,0.0010168672,0.0014295921,0.0014416738,0.0010622967,0.0029093262,0.0015137849,0.0011962485,0.004446439],"category_scores_gemma":[0.010664172,0.00093251123,0.0017209903,0.0025712166,0.0020923405,0.0077176136,0.0027416851,0.0033164774,0.0012629336],"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.0010759126,0.0004280358,0.0030189252,0.00047426668,0.00011918794,0.0002969397,0.00063944876,0.3326778,0.030347206,0.35088515,0.015252256,0.26478484],"study_design_scores_gemma":[0.00008995059,0.00016166418,0.0004549291,0.0000419558,0.00003784106,0.00022858435,0.00012136932,0.7431127,0.013888385,0.2316945,0.010132764,0.00003545176],"about_ca_topic_score_codex":0.0020319296,"about_ca_topic_score_gemma":0.0032204906,"teacher_disagreement_score":0.004446439,"about_ca_system_score_codex":0.0019414915,"about_ca_system_score_gemma":0.0025517074,"threshold_uncertainty_score":0.014874876},"labels":[],"label_agreement":null},{"id":"W3159233598","doi":"10.26421/qic22.9-10-3","title":"Deterministic algorithms for the hidden subgroup problem","year":2022,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"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":"Order (exchange); Mathematics; Combinatorics; Abelian group; Deterministic algorithm; Time complexity; Algorithm; Discrete mathematics","score_opus":0.03099737201496289,"score_gpt":0.27165005824911126,"score_spread":0.24065268623414837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159233598","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.020673683,0.00066944846,0.96138155,0.0021251435,0.00019696601,0.0005125465,0.00081434933,0.003707435,0.009918876],"genre_scores_gemma":[0.3042433,0.0005143131,0.68138903,0.0011576343,0.00034141864,0.001158745,0.0024043014,0.0007344144,0.008056866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99142367,0.0019131294,0.0006481786,0.0022944375,0.0021836523,0.0015370676],"domain_scores_gemma":[0.98360217,0.0073385974,0.0010868808,0.006404698,0.0012232792,0.00034432122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036131933,0.0015109162,0.0015613915,0.0014497201,0.002496939,0.0036279473,0.0057329475,0.0032977029,0.010393173],"category_scores_gemma":[0.017627025,0.00094629545,0.002248046,0.0030319516,0.0022073898,0.0084955115,0.0057701324,0.0035381268,0.0033381],"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.0013485061,0.0008454996,0.0024894653,0.00075266947,0.00024283298,0.00014704278,0.0006107199,0.13806416,0.010610602,0.4586835,0.050479524,0.33572555],"study_design_scores_gemma":[0.00038959,0.00019360922,0.00041689,0.000048886624,0.00007637647,0.00022787214,0.00015858885,0.5500709,0.008678684,0.42232165,0.017327797,0.000089299094],"about_ca_topic_score_codex":0.0038587986,"about_ca_topic_score_gemma":0.0052050375,"teacher_disagreement_score":0.010393173,"about_ca_system_score_codex":0.004074874,"about_ca_system_score_gemma":0.0054307356,"threshold_uncertainty_score":0.03476864},"labels":[],"label_agreement":null},{"id":"W3160226286","doi":"10.1007/978-3-030-73879-2_23","title":"Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 British Columbia","funders":"Agence Nationale de la Recherche","keywords":"Disjoint sets; Cardinality (data modeling); Bounded function; Mathematics; Combinatorics; Constant (computer programming); Discrete mathematics; Tree (set theory); Routing (electronic design automation); Computer science","score_opus":0.016773846219433224,"score_gpt":0.2219259976952959,"score_spread":0.20515215147586266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160226286","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.10362939,0.0013131229,0.8506771,0.0012704462,0.00022220892,0.00021518154,0.00040553734,0.0022575103,0.040009584],"genre_scores_gemma":[0.36553356,0.0014039186,0.6086577,0.00042963328,0.00023062908,0.00036112257,0.00087127375,0.0013243231,0.021187803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892104,0.00022975956,0.0000489261,0.00027613487,0.00034028263,0.00018384833],"domain_scores_gemma":[0.99420327,0.004448678,0.00022700828,0.0006530943,0.00026904966,0.0001989526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001294111,0.0016281907,0.0015309192,0.0013871785,0.0009863169,0.0031225795,0.0035625836,0.0019486294,0.009601201],"category_scores_gemma":[0.01100254,0.0010205524,0.0015554368,0.002600468,0.0015734484,0.0061062984,0.0042174077,0.005045232,0.0016541871],"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.00093847606,0.0005099973,0.0011309041,0.00092948787,0.00012045703,0.00021063017,0.0010053425,0.28143042,0.008030201,0.35879874,0.018166972,0.32872835],"study_design_scores_gemma":[0.00009595681,0.00007966404,0.00023237489,0.00010997779,0.000083632935,0.00013880106,0.00016570729,0.54140484,0.00312813,0.44880566,0.0057375887,0.000017666174],"about_ca_topic_score_codex":0.0021678146,"about_ca_topic_score_gemma":0.0039121676,"teacher_disagreement_score":0.009601201,"about_ca_system_score_codex":0.0025158848,"about_ca_system_score_gemma":0.0014209875,"threshold_uncertainty_score":0.032119215},"labels":[],"label_agreement":null},{"id":"W3164533693","doi":"","title":"Fragile Complexity of Adaptive Algorithms","year":2021,"lang":"en","type":"book-chapter","venue":"IT University Of Copenhagen (IT University of Copenhagen)","topic":"Complexity and Algorithms in Graphs","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":"Carleton University","funders":"","keywords":"Parameterized complexity; Binary logarithm; Time complexity; Computational complexity theory; Log-log plot; Sorting; Sequence (biology); Element (criminal law); Algorithm; Worst-case complexity; Computer science; Rank (graph theory); Combinatorics; Mathematics","score_opus":0.05489166506460514,"score_gpt":0.21803141634772433,"score_spread":0.1631397512831192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164533693","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.13551268,0.0045448383,0.6943594,0.006725826,0.0007831358,0.00011061429,0.00063303823,0.00094732875,0.15638308],"genre_scores_gemma":[0.91404355,0.0014192391,0.046980698,0.0006045991,0.0007597339,0.00023369782,0.00052193116,0.00041715984,0.035019506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975223,0.00062985,0.00009658676,0.00046927243,0.0009816248,0.00030041684],"domain_scores_gemma":[0.98321486,0.012678043,0.00074176927,0.0019114004,0.0009176353,0.0005362805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015988536,0.0009435378,0.0010266942,0.0015205975,0.0011190259,0.0039565777,0.001600146,0.0020242387,0.01136907],"category_scores_gemma":[0.023960574,0.0007139845,0.00090136216,0.0012153683,0.0034916988,0.0062415428,0.003196932,0.005421089,0.0013528668],"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.00010376625,0.000024535366,0.0003161969,0.00008347368,0.000026853679,0.00003597599,0.000094942254,0.03591304,0.0009548854,0.9418672,0.0049216845,0.015657512],"study_design_scores_gemma":[0.000015212886,0.000018862995,0.0002742518,0.0000163943,0.000010913982,0.000049810635,0.00002048801,0.112936035,0.0005634233,0.8835048,0.0025734461,0.000016368944],"about_ca_topic_score_codex":0.000966089,"about_ca_topic_score_gemma":0.0006336657,"teacher_disagreement_score":0.01136907,"about_ca_system_score_codex":0.0025093523,"about_ca_system_score_gemma":0.0010694325,"threshold_uncertainty_score":0.038033366},"labels":[],"label_agreement":null},{"id":"W316638553","doi":"10.1007/s00037-008-0252-2","title":"On the Complexity of Succinct Zero-Sum Games","year":2005,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Game complexity; Mathematics; Multiplicative function; Zero-sum game; Zero (linguistics); Complement (music); Discrete mathematics; Combinatorics; PSPACE; Value (mathematics); Combinatorial game theory; Class (philosophy); P; Complexity class; Time complexity; Computational complexity theory; Repeated game; Game theory; Computer science; Algorithm; Mathematical economics; Average-case complexity","score_opus":0.08495536218311425,"score_gpt":0.2882672099705096,"score_spread":0.20331184778739533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W316638553","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.40478587,0.002730627,0.5336621,0.01369565,0.00028092726,0.00062442746,0.0045348727,0.0017121627,0.03797339],"genre_scores_gemma":[0.89024985,0.0016629904,0.0930165,0.0011508196,0.00038886548,0.0006589658,0.0030270235,0.0005065662,0.009338496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99379385,0.0019326425,0.0003378373,0.001178402,0.0016467026,0.0011104594],"domain_scores_gemma":[0.9600261,0.034523338,0.0014061352,0.0021970759,0.0009718349,0.0008754296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003456963,0.0017868715,0.0021673257,0.0012603062,0.001649428,0.0059682503,0.003728522,0.0025915576,0.009539934],"category_scores_gemma":[0.029111391,0.001045872,0.0021892847,0.0019598177,0.0038001286,0.01393161,0.004523263,0.00726642,0.0010386998],"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.001584628,0.00050525216,0.004248949,0.000890744,0.00022479949,0.0003567753,0.0011171037,0.46111417,0.0045123473,0.46968853,0.011316183,0.04444057],"study_design_scores_gemma":[0.00012129787,0.000053527066,0.00039529163,0.000043436594,0.000038715072,0.00008199382,0.00010840663,0.46523955,0.0011673794,0.5312537,0.0014680754,0.000028548366],"about_ca_topic_score_codex":0.0050305948,"about_ca_topic_score_gemma":0.0043686787,"teacher_disagreement_score":0.009539934,"about_ca_system_score_codex":0.0053237723,"about_ca_system_score_gemma":0.0031453317,"threshold_uncertainty_score":0.03862679},"labels":[],"label_agreement":null},{"id":"W3166952120","doi":"10.1007/978-3-030-36412-0_10","title":"A Randomized Approximation Algorithm for Metric Triangle Packing","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Triangle inequality; Approximation algorithm; Combinatorics; Disjoint sets; Randomized algorithm; Vertex (graph theory); Mathematics; Metric (unit); Graph; Discrete mathematics; Algorithm; Computer science","score_opus":0.027703865774299303,"score_gpt":0.2624524088311046,"score_spread":0.2347485430568053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166952120","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.033862635,0.0012846874,0.93036336,0.0014770362,0.0007446743,0.0006162173,0.0012264367,0.007702191,0.02272276],"genre_scores_gemma":[0.14242113,0.0005711097,0.83945143,0.0005189592,0.00035972698,0.0007800648,0.0034837453,0.00092695886,0.0114869075],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961002,0.00075793895,0.00024001625,0.0009021983,0.0014347143,0.0005650666],"domain_scores_gemma":[0.9950464,0.0019316322,0.0002572623,0.0018388258,0.0005260006,0.00039991213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015192428,0.0024983254,0.0036835473,0.0021435195,0.001839123,0.0036541254,0.0068640867,0.0033001679,0.02365098],"category_scores_gemma":[0.0098224,0.0014906959,0.001958749,0.0071732444,0.0015146299,0.0068797665,0.0063760797,0.0040710308,0.0070921965],"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.001898675,0.0011474119,0.0010675963,0.00056107837,0.0001533884,0.00017085686,0.00024297046,0.1377714,0.009286409,0.07337985,0.06120063,0.71311975],"study_design_scores_gemma":[0.0005397639,0.0003072782,0.00044963878,0.000053492688,0.000072247676,0.00026718198,0.00011985925,0.8899399,0.0036415844,0.092809916,0.01174706,0.000052031053],"about_ca_topic_score_codex":0.005417398,"about_ca_topic_score_gemma":0.0065680253,"teacher_disagreement_score":0.02365098,"about_ca_system_score_codex":0.0035595722,"about_ca_system_score_gemma":0.0038666753,"threshold_uncertainty_score":0.0791204},"labels":[],"label_agreement":null},{"id":"W3170119173","doi":"10.1137/22m1480616","title":"Unambiguous DNFs and Alon–Saks–Seymour","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"European Regional Development Fund","keywords":"Mathematics; Logarithm; Combinatorics; Partition (number theory); Chromatic scale; Graph; Discrete mathematics; Extremal graph theory; Line graph; Voltage graph","score_opus":0.025012964549539742,"score_gpt":0.27128595249382187,"score_spread":0.24627298794428212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170119173","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.19888124,0.0010427736,0.7199123,0.009120461,0.00068278745,0.00017786995,0.0008208747,0.0018672129,0.067494474],"genre_scores_gemma":[0.73010635,0.00069818174,0.23897827,0.0022250551,0.00041880013,0.00022143956,0.0007487282,0.0006048866,0.025998306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970944,0.0005484389,0.00018483381,0.000792002,0.0008255192,0.00055479107],"domain_scores_gemma":[0.9938898,0.0036135598,0.00035700932,0.0011862703,0.0006326244,0.0003207486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021670382,0.00086255267,0.0009562132,0.0013099686,0.0018033509,0.0029648028,0.00251769,0.0015721666,0.009655081],"category_scores_gemma":[0.012563203,0.0006836382,0.0017689621,0.0018113082,0.0031639074,0.012699,0.004225542,0.005075205,0.0012803747],"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.00037031854,0.00014180111,0.00088323007,0.00020615714,0.000035700352,0.00025666386,0.00030036422,0.016840257,0.004529745,0.92551315,0.00697278,0.043949865],"study_design_scores_gemma":[0.00004960799,0.000043059492,0.0001970914,0.000024924466,0.00002932054,0.00011044307,0.000100794416,0.050336167,0.0032943657,0.9388625,0.006923087,0.00002863614],"about_ca_topic_score_codex":0.00548437,"about_ca_topic_score_gemma":0.0075774165,"teacher_disagreement_score":0.009655081,"about_ca_system_score_codex":0.0031019386,"about_ca_system_score_gemma":0.0018820479,"threshold_uncertainty_score":0.03229946},"labels":[],"label_agreement":null},{"id":"W3174034613","doi":"10.1145/3409964.3461794","title":"Four Shades of Deterministic Leader Election in Anonymous Networks","year":2021,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Université du Québec en Outaouais; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Leader election; Node (physics); Computer science; Task (project management); Context (archaeology); Identifier; Computer network; Theoretical computer science; Computer security; Engineering","score_opus":0.02998807016376363,"score_gpt":0.24835406710797217,"score_spread":0.21836599694420855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174034613","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.021396155,0.001740479,0.916505,0.005960027,0.00039332896,0.00016043121,0.00010057574,0.00026896756,0.053474985],"genre_scores_gemma":[0.73215634,0.0027997058,0.24305569,0.0014024351,0.0008707005,0.0005232347,0.00011984588,0.00014083208,0.018931292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99435014,0.0027081573,0.00023506349,0.00068112585,0.0014317704,0.00059378945],"domain_scores_gemma":[0.9938678,0.003125611,0.00065707206,0.0015057911,0.00059328467,0.000250321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043160175,0.0005218302,0.0005429788,0.00077750784,0.0019942513,0.0034613225,0.0021916921,0.0022666308,0.0033519284],"category_scores_gemma":[0.01080068,0.0004545622,0.00114152,0.0011075721,0.0052797035,0.006594256,0.002995542,0.002921153,0.0006022235],"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.000040804996,0.00001730944,0.00020986142,0.000049805305,0.000008990507,0.00006127455,0.0003369573,0.013920649,0.000294138,0.97445655,0.0014620464,0.009141712],"study_design_scores_gemma":[0.000045570916,0.00007966338,0.0002579199,0.00006559058,0.00002950057,0.00019493003,0.00034069156,0.12933607,0.0011597723,0.83451027,0.033932965,0.000047043326],"about_ca_topic_score_codex":0.0020660276,"about_ca_topic_score_gemma":0.0015707435,"teacher_disagreement_score":0.0043160175,"about_ca_system_score_codex":0.0019404578,"about_ca_system_score_gemma":0.0017937125,"threshold_uncertainty_score":0.02282554},"labels":[],"label_agreement":null},{"id":"W3178051994","doi":"10.3934/jimo.2021116","title":"Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem","year":2021,"lang":"en","type":"article","venue":"Journal of Industrial and Management Optimization","topic":"Complexity and Algorithms in Graphs","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":"Steiner tree problem; Stochastic optimization; Mathematical optimization; Computer science; Stochastic programming; Tree (set theory); Constant (computer programming); Approximation algorithm; Optimization problem; Mathematics; Combinatorics","score_opus":0.037908615113591684,"score_gpt":0.23958581426675862,"score_spread":0.20167719915316695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178051994","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.04230188,0.0017249668,0.9396133,0.0016192697,0.00025948495,0.00030771023,0.00052869297,0.0011235732,0.012521043],"genre_scores_gemma":[0.44196087,0.0010746475,0.54648334,0.0007480743,0.00026319813,0.0006321588,0.0013723836,0.00045026455,0.0070150564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826604,0.0006351906,0.00006763628,0.0002868215,0.0003000943,0.00044431118],"domain_scores_gemma":[0.9972289,0.0017913999,0.00023947017,0.000251776,0.000257139,0.00023136828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024536664,0.0017561879,0.0029446587,0.0010696469,0.0010012387,0.0021896223,0.0034388248,0.0021919257,0.00776534],"category_scores_gemma":[0.00620947,0.0006479748,0.0015700214,0.0021616668,0.0008987285,0.0030104534,0.0023914159,0.0027936646,0.0013857419],"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.00064616126,0.00044364488,0.0013333415,0.00047112704,0.00011531182,0.00017750017,0.00021025103,0.827352,0.0015724272,0.054687746,0.018413914,0.094576545],"study_design_scores_gemma":[0.00006634985,0.000058984308,0.00011318719,0.00001998111,0.000018677087,0.00006362215,0.00004169356,0.97517383,0.00021822355,0.023053953,0.0011621824,0.000009299223],"about_ca_topic_score_codex":0.0045165517,"about_ca_topic_score_gemma":0.0046097864,"teacher_disagreement_score":0.00776534,"about_ca_system_score_codex":0.0025278893,"about_ca_system_score_gemma":0.003178263,"threshold_uncertainty_score":0.025977671},"labels":[],"label_agreement":null},{"id":"W3183859668","doi":"10.1007/978-3-030-79987-8_26","title":"Approximation Algorithms for Hitting Subgraphs","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Hypergraph; Combinatorics; Approximation algorithm; Vertex cover; Vertex (graph theory); Undirected graph; Graph; Discrete mathematics; Computer science; Mathematics; Algorithm","score_opus":0.033338767995964066,"score_gpt":0.26544700857681075,"score_spread":0.23210824058084667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183859668","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.04179594,0.0032966216,0.8973497,0.0022433493,0.00052452093,0.00043308464,0.0023026268,0.0053277845,0.04672633],"genre_scores_gemma":[0.26893976,0.004192672,0.67188054,0.0010218384,0.00080245093,0.0009166126,0.009599077,0.002558527,0.04008847],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977946,0.00048495168,0.0001119843,0.0005135126,0.0006844872,0.00041046971],"domain_scores_gemma":[0.9928001,0.004076604,0.00029454767,0.0019817776,0.00048232137,0.0003647013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016191539,0.0027599484,0.0028208564,0.0029452846,0.001614557,0.004689653,0.0071014767,0.002728193,0.029133096],"category_scores_gemma":[0.013115586,0.0015251022,0.0026686254,0.008801453,0.0017211043,0.0108627025,0.0037280063,0.005680871,0.0058459328],"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.00076977094,0.00055420975,0.001277379,0.0009637056,0.0002082562,0.00015591482,0.0004234479,0.15152177,0.003279495,0.29676688,0.076528214,0.467551],"study_design_scores_gemma":[0.00017271009,0.00009380731,0.00040465305,0.0001026917,0.00014171033,0.00022213912,0.00013756038,0.4334154,0.0020622108,0.5517837,0.011437432,0.00002613009],"about_ca_topic_score_codex":0.0049070865,"about_ca_topic_score_gemma":0.0057570166,"teacher_disagreement_score":0.029133096,"about_ca_system_score_codex":0.004279706,"about_ca_system_score_gemma":0.0021374808,"threshold_uncertainty_score":0.09745997},"labels":[],"label_agreement":null},{"id":"W3184920538","doi":"10.1109/focs52979.2021.00080","title":"LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic","year":2022,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Royal Society","keywords":"Equivalence (formal languages); Bounded function; Discrete mathematics; Computer science; Mathematics; Combinatorics; Algorithm","score_opus":0.022093047755522524,"score_gpt":0.23088522474277096,"score_spread":0.20879217698724845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184920538","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.09659766,0.003687777,0.8108853,0.016371671,0.0004201362,0.0003506354,0.002405718,0.005816155,0.063464954],"genre_scores_gemma":[0.856741,0.0020804256,0.11286963,0.005243127,0.0020292888,0.001054775,0.002811127,0.0021060754,0.015064595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.982313,0.004910335,0.00074914907,0.0044259336,0.0046706717,0.0029309418],"domain_scores_gemma":[0.8679013,0.109585114,0.0037069174,0.013235011,0.0033160974,0.0022556398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010478248,0.002790392,0.0028091914,0.00231864,0.0030283735,0.007860205,0.008053991,0.0038442253,0.017834483],"category_scores_gemma":[0.07937282,0.0018569486,0.005499877,0.0028102212,0.008485223,0.03224382,0.01069228,0.014416057,0.0028374675],"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.0009684693,0.0003994418,0.0028419872,0.00083240104,0.00019212972,0.00021702077,0.0007293316,0.062714964,0.003932879,0.8751692,0.010655226,0.04134691],"study_design_scores_gemma":[0.000096255855,0.00011774275,0.00041402958,0.00009734638,0.00010114451,0.0001259016,0.000059703158,0.12116994,0.003952967,0.870718,0.0031018981,0.00004504856],"about_ca_topic_score_codex":0.0020316474,"about_ca_topic_score_gemma":0.0022988862,"teacher_disagreement_score":0.017834483,"about_ca_system_score_codex":0.007820572,"about_ca_system_score_gemma":0.004000343,"threshold_uncertainty_score":0.059662282},"labels":[],"label_agreement":null},{"id":"W3185873601","doi":"10.1007/s10878-021-00753-x","title":"Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"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 New Brunswick","funders":"Qinglan Project of Jiangsu Province of China; Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Set cover problem; Mathematical optimization; Cover (algebra); Computer science; Stochastic programming; Approximation algorithm; Set (abstract data type); Covering problems; Stochastic optimization; Theory of computation; Optimization problem; Combinatorial optimization; Knapsack problem; Vertex cover; Mathematics; Algorithm","score_opus":0.031047118973509858,"score_gpt":0.2593955644821698,"score_spread":0.22834844550865996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185873601","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.062955864,0.0033819524,0.9088555,0.0044847624,0.0004824292,0.00075483875,0.0022953374,0.0019469905,0.0148423165],"genre_scores_gemma":[0.53819275,0.001908642,0.4325301,0.0015647743,0.0007512481,0.0014282232,0.003745724,0.0012006434,0.018677846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99599326,0.0015358271,0.00016157993,0.0007791867,0.0006758119,0.0008543255],"domain_scores_gemma":[0.98552877,0.0109638395,0.000795516,0.001213422,0.0006100576,0.0008884137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005937868,0.0043906015,0.008719405,0.0027899197,0.001863769,0.005391447,0.008923289,0.006236762,0.018778432],"category_scores_gemma":[0.020874936,0.0030838123,0.0038770463,0.006264162,0.002770544,0.010751908,0.0045254254,0.0069717905,0.0024148053],"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.0006347246,0.0006062259,0.0011859563,0.00047547568,0.00021347366,0.00012705404,0.00015346427,0.8762539,0.0005343057,0.05504263,0.017855002,0.046917833],"study_design_scores_gemma":[0.0000705672,0.00005045091,0.00007275706,0.000023563274,0.000027937816,0.000031291373,0.000031467098,0.96595985,0.000106544554,0.033058316,0.00055725384,0.000009899948],"about_ca_topic_score_codex":0.008933728,"about_ca_topic_score_gemma":0.013104123,"teacher_disagreement_score":0.018778432,"about_ca_system_score_codex":0.0065616937,"about_ca_system_score_gemma":0.00570588,"threshold_uncertainty_score":0.06282014},"labels":[],"label_agreement":null},{"id":"W3186369772","doi":"10.4230/lipics.ccc.2021.36","title":"On the Pseudo-Deterministic Query Complexity of NP Search Problems","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Deterministic algorithm; Mathematics; Randomized algorithm; Computational complexity theory; Time complexity; Contrast (vision); Algorithm; Discrete mathematics; Theoretical computer science; Combinatorics; Computer science","score_opus":0.06558652675906523,"score_gpt":0.2789850136981461,"score_spread":0.21339848693908087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186369772","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.18499559,0.0041639567,0.76588506,0.015458068,0.00028399902,0.00047428985,0.0015237739,0.0014081098,0.025807152],"genre_scores_gemma":[0.85665846,0.002345732,0.12953117,0.0020258874,0.0007937924,0.0011642632,0.0013651298,0.00096013397,0.0051553817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97193366,0.013741051,0.0014501308,0.0040140483,0.0059182066,0.0029428313],"domain_scores_gemma":[0.6900069,0.28197515,0.005601136,0.016385801,0.003992402,0.0020385447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019207265,0.0017975124,0.0027919582,0.002423978,0.0030059172,0.00858067,0.0049555534,0.0035909656,0.0066807717],"category_scores_gemma":[0.12364596,0.0015818472,0.0033239631,0.004137615,0.010596418,0.019472701,0.006566675,0.010915318,0.0010956847],"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.0012212123,0.00049808354,0.0050071804,0.00083799765,0.00030459085,0.00019102207,0.00077446544,0.32848737,0.004432999,0.61738336,0.007115213,0.033746492],"study_design_scores_gemma":[0.00012826592,0.000103271486,0.00091490103,0.00006457512,0.000070209164,0.00012754393,0.000101291414,0.54630023,0.0015762188,0.44905064,0.0015087671,0.00005402348],"about_ca_topic_score_codex":0.0031560443,"about_ca_topic_score_gemma":0.0023053512,"teacher_disagreement_score":0.019207265,"about_ca_system_score_codex":0.008284704,"about_ca_system_score_gemma":0.0054332013,"threshold_uncertainty_score":0.10157895},"labels":[],"label_agreement":null},{"id":"W3186774379","doi":"10.4230/lipics.icalp.2021.9","title":"Almost-Linear-Time Weighted &#120001; p -Norm Solvers in Slightly Dense Graphs via Sparsification.","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Multiplicative function; Mathematics; Voltage; Norm (philosophy); Iterative refinement; Combinatorics; Binary logarithm; Discrete mathematics; Applied mathematics; Algorithm; Mathematical analysis; Physics","score_opus":0.015473223014820708,"score_gpt":0.2422710938439041,"score_spread":0.2267978708290834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186774379","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.014439493,0.00032686608,0.9715881,0.00066153024,0.0001071071,0.00013644836,0.00046978262,0.0029944172,0.009276276],"genre_scores_gemma":[0.18831593,0.00025796323,0.79702926,0.0005691003,0.00012651335,0.00040662772,0.0024557214,0.0013809423,0.009457899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885356,0.00034736298,0.000055699584,0.0002772802,0.000284701,0.00018131663],"domain_scores_gemma":[0.996824,0.00204686,0.00018563081,0.0005384746,0.00027591072,0.00012916884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011662234,0.002440708,0.0011394504,0.00057437265,0.0004967445,0.0014545885,0.0018113382,0.0014530752,0.013307029],"category_scores_gemma":[0.00892533,0.00074850186,0.0011671836,0.0010671507,0.001022262,0.0030802402,0.0027647913,0.0030666366,0.0036938125],"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.00057151215,0.00021938773,0.0013502693,0.00063067506,0.00016226513,0.00027642585,0.00029747147,0.59334403,0.00733988,0.09200543,0.043423902,0.2603787],"study_design_scores_gemma":[0.00005764484,0.00004661784,0.0000957908,0.000023683897,0.000014051663,0.000056709,0.00004840333,0.92226094,0.0016723565,0.072842695,0.0028731325,0.00000793163],"about_ca_topic_score_codex":0.0036132773,"about_ca_topic_score_gemma":0.009738059,"teacher_disagreement_score":0.013307029,"about_ca_system_score_codex":0.0011030739,"about_ca_system_score_gemma":0.0015290631,"threshold_uncertainty_score":0.044516444},"labels":[],"label_agreement":null},{"id":"W3187834769","doi":"10.4230/lipics.disc.2021.13","title":"A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs","year":2021,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"Air Force Office of Scientific Research; Institute for Basic Science; Agence Nationale de la Recherche; National Science Foundation","keywords":"Dominating set; Mathematics; Vertex (graph theory); Combinatorics; Approximation algorithm; Constant (computer programming); Graph; Independent set; Discrete mathematics; Degree (music); Algorithm; Computer science; Physics","score_opus":0.0237182243147758,"score_gpt":0.27425245885769994,"score_spread":0.2505342345429241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187834769","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.033087082,0.000540604,0.9578513,0.0006655183,0.000057949856,0.00020365967,0.00027271966,0.0019038573,0.005417283],"genre_scores_gemma":[0.3587496,0.0005180796,0.6310019,0.00036457588,0.00010328103,0.00066177634,0.0014508805,0.0005302213,0.0066196625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981205,0.00048005246,0.000098414734,0.00060201104,0.0004249974,0.00027406993],"domain_scores_gemma":[0.99678135,0.0016002995,0.00029726533,0.00083017856,0.0002487056,0.00024211955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001567632,0.0010118888,0.0016623829,0.0009508826,0.0011160239,0.0017785407,0.0032305492,0.0011125018,0.0048101656],"category_scores_gemma":[0.0066975034,0.000641868,0.0009973919,0.00175684,0.0011052492,0.0037701514,0.004089763,0.0021349844,0.0017309512],"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.0012255199,0.0005583706,0.002040268,0.0011396052,0.0001800173,0.00024484852,0.0010459166,0.49380597,0.026856763,0.10841348,0.021329353,0.34315985],"study_design_scores_gemma":[0.0003192948,0.00036367457,0.0007080403,0.00007353322,0.0000796575,0.0002615558,0.00018433417,0.858926,0.0100601455,0.114572905,0.014405629,0.000045208802],"about_ca_topic_score_codex":0.0017572724,"about_ca_topic_score_gemma":0.0024293198,"teacher_disagreement_score":0.0048101656,"about_ca_system_score_codex":0.0017050966,"about_ca_system_score_gemma":0.0017708762,"threshold_uncertainty_score":0.016091585},"labels":[],"label_agreement":null},{"id":"W3193621667","doi":"10.1007/978-3-030-64018-7_1","title":"A Book About Network Design","year":2020,"lang":"en","type":"book-chapter","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Computer Research Institute of Montréal; Université de Montréal; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Mathematical optimization; Network planning and design; Selection (genetic algorithm); Computer science; Graph; Combinatorial optimization; Theoretical computer science; Mathematics; Artificial intelligence; Computer network","score_opus":0.04296006355214073,"score_gpt":0.22785402133400132,"score_spread":0.18489395778186057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193621667","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.00044498796,0.009032994,0.017135989,0.002563319,0.003089194,0.000052581745,0.00038446428,0.00047811956,0.96681845],"genre_scores_gemma":[0.0028707962,0.0060089855,0.0052306945,0.000882126,0.0007061754,0.00005062921,0.00027103833,0.00030720455,0.9836723],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997465,0.00003077737,0.000006184376,0.000041668158,0.00015452258,0.000020242467],"domain_scores_gemma":[0.99967957,0.00012543691,0.000011993468,0.000045195764,0.00009669931,0.000041185525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002143751,0.0010634009,0.00066409184,0.0013788824,0.0010277202,0.002612772,0.00094405666,0.0010759373,0.1610639],"category_scores_gemma":[0.0009525965,0.00068240374,0.00047997414,0.0024004905,0.00070554845,0.0032694032,0.0009349025,0.0022749081,0.079015546],"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.000010696693,0.00004601738,0.00004748089,0.00018462031,0.0000062173312,0.000028843719,0.00006894311,0.0017534298,0.0006175558,0.11957993,0.7207903,0.15686592],"study_design_scores_gemma":[0.000002382103,0.000007899919,0.000073806215,0.00008501788,0.0000029734942,0.000041696854,0.000023661512,0.00073286943,0.00015904104,0.04697443,0.951891,0.000005153952],"about_ca_topic_score_codex":0.001602365,"about_ca_topic_score_gemma":0.004699041,"teacher_disagreement_score":0.1610639,"about_ca_system_score_codex":0.0016478144,"about_ca_system_score_gemma":0.0008898973,"threshold_uncertainty_score":0.5388124},"labels":[],"label_agreement":null},{"id":"W3196918370","doi":"10.4230/lipics.esa.2021.36","title":"An Accelerated Newton-Dinkelbach Method and Its Application to Two Variables per Inequality Systems","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"European Commission","keywords":"Mathematics; Submodular set function; Mathematical optimization; Applied mathematics; Divergence (linguistics); Convergence (economics); Parametric statistics; Markov decision process; Newton's method; Time complexity; Polynomial; Combinatorics; Markov process; Nonlinear system","score_opus":0.10893362346287878,"score_gpt":0.25793020884617324,"score_spread":0.14899658538329447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196918370","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.005245994,0.000107972875,0.99177843,0.00020551906,0.000046563127,0.000033835393,0.000031527168,0.00018144501,0.0023686544],"genre_scores_gemma":[0.15470552,0.00017661572,0.83953905,0.0001740378,0.00006347424,0.0001982219,0.00010350138,0.00021272415,0.0048268447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991283,0.00030823893,0.000029256862,0.00013753047,0.00029726082,0.00009936747],"domain_scores_gemma":[0.9986399,0.0007651533,0.00008986596,0.00020049617,0.00022922004,0.000075441545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012676301,0.00084268046,0.000969587,0.0006163236,0.00049726706,0.00075921783,0.0013283488,0.0009926794,0.0050496124],"category_scores_gemma":[0.00469994,0.0005659949,0.00082920754,0.0006121108,0.00097509346,0.0010848794,0.0021175586,0.0024819945,0.0008748373],"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.00008702551,0.00005589544,0.000476472,0.00014046498,0.00003736526,0.00014356211,0.00017059725,0.75665426,0.005224263,0.13561521,0.00337728,0.09801767],"study_design_scores_gemma":[0.000010711326,0.000013904686,0.00004184353,0.0000076607785,0.0000030674823,0.000021361539,0.000004672662,0.98068935,0.0008135267,0.016613165,0.0017733633,0.0000074010236],"about_ca_topic_score_codex":0.0033324175,"about_ca_topic_score_gemma":0.003441991,"teacher_disagreement_score":0.0050496124,"about_ca_system_score_codex":0.0009637622,"about_ca_system_score_gemma":0.0015715754,"threshold_uncertainty_score":0.016892672},"labels":[],"label_agreement":null},{"id":"W3198583770","doi":"10.1007/s00037-023-00241-0","title":"The Power of Natural Properties as Oracles","year":2023,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","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":"Oracle; Combinatorics; Mathematics; Discrete mathematics; Randomized algorithm; Upper and lower bounds; Random oracle; Computer science","score_opus":0.06434584726470818,"score_gpt":0.28898157429051835,"score_spread":0.22463572702581017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198583770","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.084029354,0.0057433494,0.81652284,0.021266477,0.00057042466,0.000076990436,0.0007606166,0.0009690932,0.070060804],"genre_scores_gemma":[0.88399756,0.0028764461,0.102426894,0.0017291777,0.001342045,0.0001745897,0.00055839727,0.00038985015,0.006505048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924931,0.0038993629,0.00044603038,0.0014990806,0.0012577745,0.00040459447],"domain_scores_gemma":[0.9033436,0.078629486,0.0024894704,0.011424641,0.002594127,0.0015185238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072099245,0.0008439432,0.0015059292,0.0028951617,0.0019153693,0.008338857,0.0028413085,0.002711775,0.008394429],"category_scores_gemma":[0.052711546,0.0011997335,0.0016322705,0.0024242788,0.016756045,0.04607266,0.0054347864,0.006834978,0.0007504166],"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.000022553018,0.00001091604,0.00019756153,0.000044141336,0.0000058368205,0.000015902782,0.00011154884,0.0010809504,0.00009417079,0.9937261,0.00058654376,0.0041038957],"study_design_scores_gemma":[0.000004996146,0.0000032884354,0.0000366809,0.000008754872,0.000003111374,0.000012956014,0.000016623006,0.003029673,0.000069668284,0.99591774,0.00089232274,0.000004144736],"about_ca_topic_score_codex":0.0011056704,"about_ca_topic_score_gemma":0.0009405185,"teacher_disagreement_score":0.008394429,"about_ca_system_score_codex":0.0018726804,"about_ca_system_score_gemma":0.00114527,"threshold_uncertainty_score":0.038130164},"labels":[],"label_agreement":null},{"id":"W3201703753","doi":"10.4230/lipics.approx/random.2021.25","title":"Hitting Weighted Even Cycles in Planar Graphs","year":2021,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Mathematics; Transversal (combinatorics); Approximation algorithm; Discrete mathematics; Undirected graph; Graph; Minimum weight; Time complexity; Independent set","score_opus":0.018321825107868304,"score_gpt":0.2553436650242999,"score_spread":0.23702183991643158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201703753","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.28264895,0.0015889247,0.69278884,0.0014644647,0.00011355814,0.00020491153,0.0014814298,0.0018183915,0.01789051],"genre_scores_gemma":[0.67411554,0.0019880377,0.30206537,0.0006614151,0.00012184531,0.00031636114,0.0034884007,0.001069939,0.01617317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999169,0.00017468458,0.000034645993,0.000267606,0.0001787342,0.00017527463],"domain_scores_gemma":[0.9977531,0.0012944671,0.00030495675,0.0003152589,0.00015703743,0.00017525576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006889799,0.0012600188,0.0011809585,0.0010160877,0.00077832333,0.0017105312,0.0015629333,0.0010301822,0.008764017],"category_scores_gemma":[0.005352516,0.0009084269,0.0012200937,0.001774012,0.0010235085,0.0034693796,0.0022295953,0.0020056418,0.0013651892],"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.0007474144,0.00021201,0.003682353,0.00085488736,0.00019293623,0.00064835406,0.0005886421,0.548616,0.011626192,0.2228207,0.019291244,0.19071928],"study_design_scores_gemma":[0.0000689889,0.00011925682,0.00063417415,0.00008034174,0.000056410187,0.0003312759,0.00022223954,0.59627086,0.004465476,0.3905829,0.0071417065,0.000026388641],"about_ca_topic_score_codex":0.0035211525,"about_ca_topic_score_gemma":0.0044883317,"teacher_disagreement_score":0.008764017,"about_ca_system_score_codex":0.0013222377,"about_ca_system_score_gemma":0.0008702115,"threshold_uncertainty_score":0.029318571},"labels":[],"label_agreement":null},{"id":"W3202223927","doi":"10.48550/arxiv.2109.12736","title":"Hardness of Graph-Structured Algebraic and Symbolic Problems","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Finite field; Mathematics; Combinatorics; Algebraic number; Discrete mathematics; Diagonal; Laplacian matrix; Coefficient matrix; Polynomial ring; Polynomial; Matrix (chemical analysis); Graph; Ring (chemistry); Field (mathematics); Pure mathematics; Eigenvalues and eigenvectors; Mathematical analysis","score_opus":0.057932253981401345,"score_gpt":0.1750413654552177,"score_spread":0.11710911147381636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202223927","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.34970766,0.0026869245,0.54706055,0.026145555,0.00061638927,0.00044218413,0.006509245,0.004823583,0.062007945],"genre_scores_gemma":[0.86907643,0.0011798028,0.102313116,0.002154346,0.00079187175,0.00036441753,0.005326013,0.0010818723,0.017712206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952436,0.0010908882,0.00022334987,0.0012627062,0.0014268915,0.00075250724],"domain_scores_gemma":[0.9798917,0.015988031,0.00092114427,0.0019971817,0.00069727434,0.0005046125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001892996,0.0015547755,0.0017547255,0.0009091694,0.002109454,0.003698554,0.0033571974,0.002560044,0.018062657],"category_scores_gemma":[0.016392834,0.0008676258,0.0025943222,0.0016803058,0.0042048628,0.010714875,0.0041517327,0.0055844625,0.0022634487],"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.0011908789,0.00054417766,0.0035045699,0.002208301,0.00028774957,0.0005711785,0.0014051234,0.30423927,0.0057167644,0.5419187,0.046301957,0.092111334],"study_design_scores_gemma":[0.00015133148,0.000062566025,0.00047025745,0.000052044412,0.000047140154,0.0001353188,0.00024469694,0.2254235,0.0018740922,0.76606137,0.0054490217,0.000028634955],"about_ca_topic_score_codex":0.0027563167,"about_ca_topic_score_gemma":0.0031393094,"teacher_disagreement_score":0.018062657,"about_ca_system_score_codex":0.0024345187,"about_ca_system_score_gemma":0.0023479718,"threshold_uncertainty_score":0.06042558},"labels":[],"label_agreement":null},{"id":"W3204704467","doi":"10.1016/j.ipl.2022.106293","title":"On public-coin zero-error randomized communication complexity","year":2022,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Communication complexity; Zero (linguistics); Mathematics; Theoretical computer science; Upper and lower bounds; Computer science; Polynomial; PSPACE; Computational complexity theory; Discrete mathematics; Algorithm","score_opus":0.037043340476142904,"score_gpt":0.25551627706450736,"score_spread":0.21847293658836445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204704467","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.11444697,0.00340192,0.7887229,0.02620415,0.0010255289,0.0003786602,0.0019267583,0.0016219834,0.06227118],"genre_scores_gemma":[0.90707695,0.0022804723,0.0640357,0.0028830015,0.0016886436,0.0010244071,0.0011706227,0.00087032,0.018969804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97562134,0.011090628,0.00089807104,0.0033739212,0.0048577976,0.004158222],"domain_scores_gemma":[0.7944077,0.18111382,0.003823633,0.013462571,0.005024894,0.0021673597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016940981,0.0031408123,0.005526389,0.0031288273,0.0038470912,0.009606389,0.0070848935,0.006446377,0.015586924],"category_scores_gemma":[0.10138897,0.0019479397,0.0026467054,0.0056056543,0.010943685,0.025301937,0.010980525,0.011984862,0.0023953563],"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.00088576024,0.0002287379,0.0009128895,0.00027506065,0.00009944904,0.00011337296,0.0003009757,0.12160453,0.0009403724,0.847791,0.009977773,0.016870169],"study_design_scores_gemma":[0.00013797432,0.000043492375,0.00020118823,0.000052415857,0.000040075574,0.00004204044,0.000043887783,0.19790278,0.0005824812,0.8000008,0.0009112933,0.000041569918],"about_ca_topic_score_codex":0.0039258804,"about_ca_topic_score_gemma":0.003513037,"teacher_disagreement_score":0.016940981,"about_ca_system_score_codex":0.010311029,"about_ca_system_score_gemma":0.008998035,"threshold_uncertainty_score":0.08959353},"labels":[],"label_agreement":null},{"id":"W32072441","doi":"10.1007/s11060-020-03434-7","title":"Efficient Communication Using Partial Information.","year":2010,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Communication complexity; Computer science; Bounded function; Protocol (science); Theoretical computer science; Computational complexity theory; Discrete mathematics; Communications protocol; Mathematics; Algorithm; Computer network","score_opus":0.0231787037010444,"score_gpt":0.27372607558373924,"score_spread":0.2505473718826948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W32072441","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.0470354,0.0015076422,0.9200969,0.0034222174,0.00040312274,0.00025306753,0.0022157207,0.0016749952,0.02339095],"genre_scores_gemma":[0.8089951,0.0012569707,0.17024076,0.0006692144,0.0004198218,0.0005354042,0.0025059762,0.00035517447,0.015021583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960373,0.0013347848,0.00035149255,0.000645321,0.0008415809,0.0007895911],"domain_scores_gemma":[0.9696381,0.020286962,0.0013917048,0.0066216514,0.0014960116,0.0005655796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028268315,0.0012333356,0.001945679,0.0014677899,0.0018270679,0.0031924192,0.0025523761,0.0017979556,0.010140214],"category_scores_gemma":[0.024057124,0.00085085793,0.0011691817,0.0026063852,0.0014955613,0.00778044,0.0046691233,0.0019819029,0.0025545657],"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.0022600656,0.00031569114,0.0020193418,0.00090611115,0.00030335123,0.00041757923,0.00067532616,0.3386664,0.0067299376,0.3143268,0.047123663,0.28625575],"study_design_scores_gemma":[0.00013484163,0.00014095801,0.00037472803,0.00006128595,0.000086654334,0.00023359637,0.000116097384,0.6490185,0.0031719988,0.33997023,0.0066512963,0.000039784103],"about_ca_topic_score_codex":0.0022392685,"about_ca_topic_score_gemma":0.003245288,"teacher_disagreement_score":0.010140214,"about_ca_system_score_codex":0.0015682874,"about_ca_system_score_gemma":0.0029939404,"threshold_uncertainty_score":0.033922374},"labels":[],"label_agreement":null},{"id":"W3209675893","doi":"10.1002/jcd.21809","title":"The combinatorial game N<scp>ofil</scp> played on Steiner triple systems","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Designs","topic":"Complexity and Algorithms in Graphs","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":"Carleton University; Concordia University of Edmonton; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Graph; Steiner system; Hypergraph; Discrete mathematics; Complete graph","score_opus":0.030839130138622266,"score_gpt":0.2560989864287562,"score_spread":0.22525985629013395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209675893","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.7001054,0.00007868981,0.25903597,0.0012117813,0.0000645385,0.00044745012,0.0007716793,0.00038442094,0.037900016],"genre_scores_gemma":[0.9563199,0.000045344786,0.03959955,0.00013178898,0.000017524973,0.00013911517,0.00034608121,0.00006036986,0.0033402932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965089,0.0015270549,0.00012525843,0.00047958049,0.0004454247,0.00091373775],"domain_scores_gemma":[0.9941399,0.004077878,0.00038475785,0.00042956357,0.00028529353,0.00068260217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017138321,0.00070388964,0.0008678491,0.0006376147,0.0012105337,0.0031874673,0.0017697404,0.0011164624,0.0066247624],"category_scores_gemma":[0.0060839835,0.00042329644,0.0009241438,0.0005462921,0.0023891146,0.0026227091,0.0016108748,0.0017222089,0.00036938215],"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.0025428052,0.0008035611,0.009068394,0.00042750966,0.00021386494,0.0008489648,0.0011409649,0.31260663,0.02611743,0.5817285,0.008823078,0.055678345],"study_design_scores_gemma":[0.00012869635,0.00040800666,0.0014796129,0.000038667753,0.00004902768,0.00024685852,0.0007986253,0.70501643,0.008931309,0.27934116,0.0035068293,0.000054831686],"about_ca_topic_score_codex":0.004843382,"about_ca_topic_score_gemma":0.004926272,"teacher_disagreement_score":0.0066247624,"about_ca_system_score_codex":0.0030801718,"about_ca_system_score_gemma":0.0022918142,"threshold_uncertainty_score":0.022348344},"labels":[],"label_agreement":null},{"id":"W3211932688","doi":"10.1016/j.orl.2023.03.008","title":"On a partition LP relaxation for min-cost 2-node connected spanning subgraphs","year":2023,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","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":"Linear programming relaxation; Spanning tree; Combinatorics; Partition (number theory); Mathematics; Minimum spanning tree; Relaxation (psychology); Linear programming; Graph partition; Minimum degree spanning tree; Greedy algorithm; Graph factorization; Discrete mathematics; Graph; Mathematical optimization; Line graph; Graph power","score_opus":0.13134850434815168,"score_gpt":0.3851309175006559,"score_spread":0.25378241315250427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211932688","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.049187362,0.0022312917,0.88437915,0.0037228828,0.00045526904,0.00042830527,0.0013272297,0.00044092743,0.057827555],"genre_scores_gemma":[0.4150538,0.002822651,0.53989,0.002129568,0.0009919432,0.001158005,0.002465255,0.0011634168,0.03432534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987317,0.00053580204,0.00003249619,0.00022604332,0.0002448852,0.00022909533],"domain_scores_gemma":[0.9958352,0.0034170838,0.00015293407,0.00018947,0.00021650105,0.00018875887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021506543,0.0027606047,0.0021889282,0.0012347244,0.0009968356,0.0030507124,0.0029380429,0.0030992194,0.01774362],"category_scores_gemma":[0.009376697,0.0012440154,0.0016885913,0.0026269748,0.0016057556,0.0041186903,0.0033628226,0.0047600497,0.0016069333],"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.00046052597,0.00033451905,0.00054321653,0.0008142775,0.000109947076,0.00025811666,0.00035555716,0.77392125,0.0024367284,0.12831031,0.027746104,0.06470953],"study_design_scores_gemma":[0.00007697061,0.00009753075,0.00026392535,0.000107915315,0.000047422935,0.00008230146,0.00018264253,0.87245774,0.00051529024,0.12123847,0.0049130605,0.000016678812],"about_ca_topic_score_codex":0.005416098,"about_ca_topic_score_gemma":0.0058613946,"teacher_disagreement_score":0.01774362,"about_ca_system_score_codex":0.002241093,"about_ca_system_score_gemma":0.0016791575,"threshold_uncertainty_score":0.0593583},"labels":[],"label_agreement":null},{"id":"W3212014075","doi":"10.1145/3519935.3520024","title":"Locally testable codes with constant rate, distance, and locality","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Azrieli Foundation; Israel Science Foundation; European Commission","keywords":"Locality; Code (set theory); Construct (python library); Discrete mathematics; Constant (computer programming); Word (group theory); Mathematics; Computer science; Combinatorics; Programming language","score_opus":0.01958422355762212,"score_gpt":0.2422624260804508,"score_spread":0.22267820252282866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212014075","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.2605465,0.0015189274,0.71389675,0.0017526535,0.00008477934,0.00013877072,0.0007494276,0.0016258272,0.019686427],"genre_scores_gemma":[0.9329466,0.00062679936,0.057239298,0.00039608518,0.0002838051,0.00029742686,0.00041302532,0.00038105782,0.007415862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995458,0.0010389324,0.00022243983,0.00093896594,0.0016178128,0.000723913],"domain_scores_gemma":[0.94682103,0.03182109,0.005941939,0.009494051,0.0042690584,0.0016528304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018488712,0.0007998076,0.0018886647,0.0018130677,0.0013158733,0.0025656144,0.002133839,0.0021167598,0.0026390145],"category_scores_gemma":[0.03209011,0.00072780106,0.00090000534,0.002304236,0.004561244,0.005785137,0.003480188,0.00318429,0.0009118506],"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.0006847375,0.0001266393,0.0032407544,0.0003613658,0.00009460355,0.00057751045,0.0005580888,0.12405831,0.01729792,0.8157617,0.0035112044,0.033727176],"study_design_scores_gemma":[0.00016046688,0.00022265069,0.0010275518,0.00007598766,0.000056304096,0.0009847146,0.00008393815,0.2675769,0.0117484545,0.7142317,0.0037163005,0.00011503639],"about_ca_topic_score_codex":0.0021233906,"about_ca_topic_score_gemma":0.0013769764,"teacher_disagreement_score":0.0026390145,"about_ca_system_score_codex":0.0025657522,"about_ca_system_score_gemma":0.0018389988,"threshold_uncertainty_score":0.018615961},"labels":[],"label_agreement":null},{"id":"W3213138807","doi":"10.1007/s00453-021-00889-6","title":"Bounded-Angle Minimum Spanning Trees","year":2021,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","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 Waterloo; Carleton University; University of Windsor","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Theory of computation; Spanning tree; Minimum spanning tree; Combinatorics; Mathematics; Tree (set theory); Computer science; Discrete mathematics; Algorithm","score_opus":0.021689003908254963,"score_gpt":0.25106207579004597,"score_spread":0.229373071881791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213138807","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.18909113,0.0024747103,0.74399346,0.0045063724,0.0004635166,0.00023450618,0.002838972,0.0009006592,0.055496592],"genre_scores_gemma":[0.71393967,0.0027612373,0.25528988,0.00076204113,0.0004477357,0.0003104242,0.0045136595,0.00045596733,0.021519344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998782,0.00038245268,0.00008101335,0.00028411023,0.00028829163,0.00018223868],"domain_scores_gemma":[0.9936156,0.004069175,0.0005346999,0.00072699104,0.00059350586,0.00045999096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091165036,0.00086981157,0.0011968846,0.00087613653,0.0010838334,0.0026895069,0.0022170583,0.0013926082,0.012498637],"category_scores_gemma":[0.012202177,0.0006308041,0.0006818261,0.0021625452,0.0008516914,0.0067519415,0.0025286411,0.002339379,0.0022535953],"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.0010228336,0.00043883044,0.0040212106,0.000888841,0.00011855853,0.0002992796,0.00045475204,0.1528252,0.0104410155,0.6040832,0.037431777,0.18797448],"study_design_scores_gemma":[0.00012197063,0.00008545046,0.0010941628,0.000083967774,0.00006324218,0.00031783595,0.00022113933,0.2588761,0.0028934465,0.72562593,0.010595892,0.00002088802],"about_ca_topic_score_codex":0.000762291,"about_ca_topic_score_gemma":0.0014474199,"teacher_disagreement_score":0.012498637,"about_ca_system_score_codex":0.00091288117,"about_ca_system_score_gemma":0.0007930876,"threshold_uncertainty_score":0.041812122},"labels":[],"label_agreement":null},{"id":"W3213890954","doi":"10.1017/s0960129521000372","title":"Two-stage submodular maximization problem beyond nonnegative and monotone","year":2021,"lang":"en","type":"article","venue":"Mathematical Structures in Computer Science","topic":"Complexity and Algorithms in Graphs","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":"Submodular set function; Monotone polygon; Mathematics; Matroid; Combinatorics; Cardinality (data modeling); Maximization; Constraint (computer-aided design); Approximation algorithm; Function (biology); Discrete mathematics; Mathematical optimization; Computer science","score_opus":0.013735870939906622,"score_gpt":0.2589103105992053,"score_spread":0.24517443965929864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213890954","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.09884577,0.0003626646,0.89269716,0.0012665212,0.00008125246,0.0002489901,0.00052355323,0.00046251,0.005511558],"genre_scores_gemma":[0.677175,0.00017545442,0.31535172,0.00033206388,0.00010558459,0.0002933315,0.00065266615,0.00017535458,0.0057388926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983474,0.00069346896,0.00005306603,0.00041807312,0.00020030503,0.0002877068],"domain_scores_gemma":[0.99709797,0.0017898422,0.00023595891,0.00034343248,0.00025145378,0.0002814489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002843844,0.0014163285,0.0020517216,0.00050534966,0.0005580524,0.0013419853,0.002086664,0.0017539138,0.0058368384],"category_scores_gemma":[0.006242451,0.00065572787,0.0014011367,0.0011134959,0.001243526,0.0029805622,0.0017640389,0.002055519,0.0005078089],"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.001257245,0.00045107907,0.0021070195,0.00054122857,0.00022091139,0.00042866674,0.0001853469,0.75135815,0.010183524,0.13716659,0.012191681,0.08390865],"study_design_scores_gemma":[0.00009062375,0.000092321556,0.0002100092,0.000012045039,0.000021448635,0.0000627441,0.000019606052,0.9621253,0.0014068378,0.03508332,0.0008632893,0.000012414015],"about_ca_topic_score_codex":0.0024197258,"about_ca_topic_score_gemma":0.0021143216,"teacher_disagreement_score":0.0058368384,"about_ca_system_score_codex":0.0015765782,"about_ca_system_score_gemma":0.0015062232,"threshold_uncertainty_score":0.019526184},"labels":[],"label_agreement":null},{"id":"W3216441663","doi":"","title":"A $2$-Approximation Algorithm for Flexible Graph Connectivity","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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; University of Ottawa","funders":"","keywords":"Computer science; Approximation algorithm; Algorithm; Theoretical computer science","score_opus":0.07365225862169666,"score_gpt":0.1985476314444734,"score_spread":0.12489537282277674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216441663","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.047609325,0.0007503149,0.91870177,0.002524428,0.00033585788,0.0005094092,0.0017364301,0.004928472,0.022904033],"genre_scores_gemma":[0.25039268,0.00046794696,0.731289,0.0009044757,0.00019578257,0.00072805036,0.0041781054,0.0007618734,0.011082],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859816,0.00020012923,0.00007186474,0.00043421943,0.0003978785,0.00029770433],"domain_scores_gemma":[0.99773574,0.00086233247,0.00017874336,0.0008315074,0.00019402926,0.00019768752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007549396,0.0019398098,0.0015749427,0.0015946765,0.0012761434,0.0019415702,0.004659657,0.0025131304,0.014600913],"category_scores_gemma":[0.005250848,0.00086546876,0.0019022479,0.0028677925,0.00088575896,0.0047263457,0.0038423925,0.003997587,0.0032738878],"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.0011570724,0.0011265475,0.0020617468,0.0008384746,0.00021915253,0.0005242327,0.0005102544,0.26649055,0.020659085,0.110875174,0.080488354,0.51504934],"study_design_scores_gemma":[0.00037885387,0.00032662967,0.000876258,0.0000668573,0.00010783684,0.0007163789,0.00020727301,0.8078965,0.006988957,0.15935045,0.023016427,0.00006758188],"about_ca_topic_score_codex":0.0031235744,"about_ca_topic_score_gemma":0.0054145087,"teacher_disagreement_score":0.014600913,"about_ca_system_score_codex":0.0017781943,"about_ca_system_score_gemma":0.0017540475,"threshold_uncertainty_score":0.048844874},"labels":[],"label_agreement":null},{"id":"W3217052763","doi":"10.1016/j.dam.2022.07.023","title":"A counter-example to the probabilistic universal graph conjecture via randomized communication complexity","year":2022,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Sleep Foundation; National Science Foundation","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics; Bounded function; Probabilistic logic; Randomized algorithm; Graph; Regular graph; Graph power; Line graph","score_opus":0.025755645183202655,"score_gpt":0.23955181027054392,"score_spread":0.21379616508734128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217052763","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.15009058,0.002699331,0.585812,0.12995934,0.0019701999,0.0003652954,0.0026670727,0.003157117,0.12327914],"genre_scores_gemma":[0.92522675,0.0013067063,0.048822403,0.008017691,0.0020914758,0.0006072169,0.0008132677,0.0008185511,0.012295944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98723674,0.0053675966,0.00037796167,0.0027668637,0.0028423385,0.001408331],"domain_scores_gemma":[0.87205017,0.100002654,0.0032130776,0.019381285,0.003354875,0.001997983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008154062,0.0011434926,0.0031012634,0.0015794698,0.0048412154,0.0056595462,0.0059974464,0.008398717,0.01666111],"category_scores_gemma":[0.0855145,0.0014475763,0.0022437293,0.0033319204,0.011334895,0.02426214,0.008999481,0.012003923,0.002045022],"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.00017863097,0.00006504924,0.00035563824,0.00013559818,0.00003017438,0.000083701656,0.00023666813,0.010118017,0.00041775743,0.96973306,0.012405463,0.0062402766],"study_design_scores_gemma":[0.000081996135,0.000011735523,0.000099628065,0.000017511895,0.000011882535,0.00005943024,0.000033610027,0.02612687,0.00027949698,0.9710966,0.0021652123,0.00001618494],"about_ca_topic_score_codex":0.002427786,"about_ca_topic_score_gemma":0.0018294854,"teacher_disagreement_score":0.01666111,"about_ca_system_score_codex":0.0034636636,"about_ca_system_score_gemma":0.0032766792,"threshold_uncertainty_score":0.05573696},"labels":[],"label_agreement":null},{"id":"W326289323","doi":"10.1007/978-3-642-02017-9_29","title":"Kolmogorov Complexity and Combinatorial Methods in Communication Complexity","year":2009,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Kolmogorov complexity; Communication complexity; Kolmogorov structure function; Minimax; Mathematics; Upper and lower bounds; Worst-case complexity; Quantum complexity theory; Mutual information; Intuition; Computational complexity theory; Dimension (graph theory); Discrete mathematics; Matching (statistics); Kolmogorov equations (Markov jump process); Theoretical computer science; Computer science; Quantum; Combinatorics; Time complexity; Algorithm; Mathematical optimization; Quantum information; Statistics","score_opus":0.047070984818778014,"score_gpt":0.34114653367503217,"score_spread":0.29407554885625414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W326289323","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.022564508,0.031163478,0.8290741,0.032637306,0.0014877056,0.000088968365,0.0008182315,0.000365013,0.08180063],"genre_scores_gemma":[0.71370375,0.03963132,0.19312972,0.0046862867,0.013826667,0.0008827266,0.0013210982,0.00047365442,0.032344755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958412,0.0018350824,0.00025788357,0.00060176203,0.0011638404,0.0003001661],"domain_scores_gemma":[0.9592794,0.03598513,0.00084266445,0.0019637898,0.0014359461,0.0004930241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004522475,0.0017596654,0.0023501664,0.0046882485,0.0026933504,0.007943159,0.0031768477,0.0041271714,0.011844578],"category_scores_gemma":[0.023439245,0.0011760808,0.0023544345,0.005968049,0.011124385,0.027109193,0.0033741423,0.011306289,0.0014337252],"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.0000056532976,0.000009204334,0.000090478214,0.00005390375,0.000006763176,0.000011898894,0.000044375294,0.0014886489,0.00003933338,0.9943176,0.001424497,0.002507642],"study_design_scores_gemma":[0.0000035791168,0.000002596201,0.000059338356,0.000014416388,0.000004710115,0.000015800753,0.000015987174,0.0055577136,0.00004148427,0.99199694,0.0022808062,0.000006510828],"about_ca_topic_score_codex":0.0017120171,"about_ca_topic_score_gemma":0.001252666,"teacher_disagreement_score":0.011844578,"about_ca_system_score_codex":0.004978146,"about_ca_system_score_gemma":0.0017816646,"threshold_uncertainty_score":0.039624035},"labels":[],"label_agreement":null},{"id":"W34613702","doi":"10.1021/acs.est.1c04111","title":"Rigorous analysis of heuristics for NP-hard problems.","year":2005,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","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":"Canada First Research Excellence Fund","keywords":"Heuristics; Heuristic; Computer science; Mathematical optimization; Context (archaeology); Algorithm; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.023512675040069493,"score_gpt":0.2730710835262716,"score_spread":0.2495584084862021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34613702","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.02508046,0.0069485223,0.8993498,0.0062185666,0.000715232,0.0008845685,0.0018831915,0.0013482425,0.057571482],"genre_scores_gemma":[0.31439766,0.004772592,0.65689963,0.002603084,0.00093915913,0.0021528965,0.0030364038,0.0010066173,0.014191932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99493766,0.0022163757,0.00028877213,0.0006929596,0.0009833245,0.0008808746],"domain_scores_gemma":[0.93483645,0.058949903,0.0017019828,0.0017593092,0.0020038993,0.00074852584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007129329,0.0029431598,0.0023191485,0.0024000348,0.0018851451,0.005148188,0.0031087778,0.0026458588,0.012554871],"category_scores_gemma":[0.034311656,0.0014644943,0.0034962012,0.0030772123,0.0029745502,0.006072242,0.0027720174,0.006348329,0.0016984305],"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.0003810291,0.0005410335,0.002981366,0.0018069881,0.00049035926,0.0002537067,0.0005743629,0.45801315,0.0012199299,0.40537342,0.038514797,0.08984978],"study_design_scores_gemma":[0.000157829,0.00010657562,0.00048840826,0.00021879225,0.00011217321,0.00011470187,0.00018106506,0.548651,0.00037437098,0.43940783,0.010159501,0.00002771918],"about_ca_topic_score_codex":0.007750849,"about_ca_topic_score_gemma":0.011967546,"teacher_disagreement_score":0.012554871,"about_ca_system_score_codex":0.005265226,"about_ca_system_score_gemma":0.0053082863,"threshold_uncertainty_score":0.042000294},"labels":[],"label_agreement":null},{"id":"W35907325","doi":"10.1007/978-3-642-31594-7_2","title":"The NOF Multiparty Communication Complexity of Composed Functions","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Toronto; McGill University","funders":"","keywords":"Combinatorics; Communication complexity; Physics; Function (biology); Mathematics; Discrete mathematics","score_opus":0.04896195018404148,"score_gpt":0.2646787093088615,"score_spread":0.21571675912482002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W35907325","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.1769479,0.0071572186,0.48628846,0.020474574,0.0011079204,0.00019362677,0.0016007768,0.00060434575,0.30562523],"genre_scores_gemma":[0.899152,0.003659419,0.045690596,0.0010872524,0.002024243,0.0006254024,0.0008721001,0.0004939246,0.046395022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947055,0.0017143145,0.00021735312,0.000882743,0.0016005912,0.00087953254],"domain_scores_gemma":[0.9706232,0.022913074,0.0009041056,0.003548511,0.0011225094,0.00088861084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004081412,0.0013121101,0.0024397713,0.001870424,0.003043659,0.006908983,0.0040583373,0.004499347,0.014244404],"category_scores_gemma":[0.025765348,0.0011813472,0.0022603655,0.002430611,0.004903737,0.022680454,0.004479717,0.009280307,0.0018135459],"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.000071088216,0.000030306679,0.0002049426,0.000083659164,0.000018051871,0.000037558086,0.00010490218,0.007810835,0.00027158562,0.97808707,0.0037987893,0.009481196],"study_design_scores_gemma":[0.000010246981,0.0000067258343,0.00014236278,0.000017997721,0.000010987893,0.000044327266,0.00001818842,0.018759679,0.00020525885,0.97933394,0.0014386346,0.000011558817],"about_ca_topic_score_codex":0.0010834014,"about_ca_topic_score_gemma":0.00074402645,"teacher_disagreement_score":0.014244404,"about_ca_system_score_codex":0.005632318,"about_ca_system_score_gemma":0.0021520609,"threshold_uncertainty_score":0.047652304},"labels":[],"label_agreement":null},{"id":"W4205250726","doi":"10.1007/978-3-030-91434-9_6","title":"Differentially Private Submodular Maximization over Integer Lattice","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"","keywords":"Submodular set function; Monotone polygon; Computer science; Maximization; Cardinality (data modeling); Automatic summarization; Greedy algorithm; Integer (computer science); Theoretical computer science; Mathematical optimization; Mathematics; Artificial intelligence; Data mining; Algorithm","score_opus":0.01746079052434353,"score_gpt":0.2340155430445845,"score_spread":0.21655475252024098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205250726","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.07546539,0.002047923,0.80631167,0.006055843,0.00037190746,0.00017050124,0.0022025688,0.0014922186,0.10588195],"genre_scores_gemma":[0.78610706,0.0019741806,0.16487738,0.0008946379,0.00063536235,0.00024850472,0.0013404037,0.0005517203,0.04337069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985499,0.000602071,0.000041623996,0.00022079128,0.00037869078,0.00020694279],"domain_scores_gemma":[0.99793303,0.00123723,0.00012355963,0.0004588959,0.000112589696,0.00013469518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001492875,0.0007149292,0.0011227358,0.00041464466,0.00062244764,0.0024160314,0.0013388303,0.00078712945,0.006840777],"category_scores_gemma":[0.0057738326,0.00048317522,0.0004959494,0.0015792045,0.001242089,0.0042268904,0.0021599045,0.0029883503,0.0016305107],"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.0003516812,0.000123415,0.00022964504,0.00022516293,0.000031709587,0.000067468594,0.00011072949,0.07638684,0.0031154451,0.8240876,0.023923326,0.07134694],"study_design_scores_gemma":[0.000057691057,0.00003815081,0.000102868384,0.00002925272,0.000011917377,0.00008869534,0.000029840689,0.16536619,0.0017365755,0.82447195,0.008051844,0.000015056357],"about_ca_topic_score_codex":0.00064830837,"about_ca_topic_score_gemma":0.00093919237,"teacher_disagreement_score":0.006840777,"about_ca_system_score_codex":0.0023214356,"about_ca_system_score_gemma":0.0013502243,"threshold_uncertainty_score":0.022884667},"labels":[],"label_agreement":null},{"id":"W4205439189","doi":"10.17771/pucrio.acad.51356","title":"THE MULTI-PERIOD PRIZE-COLLECTING STEINER TREE PROBLEM WITH BUDGET CONSTRAINTS","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport","keywords":"Steiner tree problem; Benchmark (surveying); Period (music); Combinatorics; Tree (set theory); Revenue; Time horizon; Mathematics; Mathematical optimization; Computer science; Geography; Economics; Cartography; Physics","score_opus":0.01859464823067754,"score_gpt":0.25794409219994796,"score_spread":0.2393494439692704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205439189","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.20937258,0.0018716078,0.75107896,0.0016616242,0.0002933369,0.0004518997,0.0026796865,0.00045770424,0.032132573],"genre_scores_gemma":[0.7768109,0.0016256633,0.20484433,0.00015498116,0.00014694285,0.0003796979,0.0011904011,0.00022717731,0.01461995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918324,0.00033841212,0.000034401008,0.00015717871,0.000103087885,0.00018375562],"domain_scores_gemma":[0.99900407,0.0005377195,0.00012550408,0.0001088661,0.0000718531,0.00015205167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012855668,0.0008823214,0.0011453688,0.0005382528,0.0006357657,0.001442712,0.0016483214,0.0012538019,0.0061261915],"category_scores_gemma":[0.0024831614,0.00046025327,0.0008710141,0.0016035907,0.0004754689,0.002964765,0.0008691492,0.001128244,0.0004618748],"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.0005519527,0.00027307787,0.0010333132,0.00068094494,0.00014704154,0.00044282476,0.00018064887,0.75728637,0.0034322843,0.12842983,0.0124084065,0.09513329],"study_design_scores_gemma":[0.000110676825,0.00032672868,0.0014515466,0.000089555164,0.00008610104,0.00055163633,0.00021535311,0.84815025,0.0023136616,0.12967956,0.016983632,0.000041235133],"about_ca_topic_score_codex":0.0012495392,"about_ca_topic_score_gemma":0.0017945536,"teacher_disagreement_score":0.0061261915,"about_ca_system_score_codex":0.0011616191,"about_ca_system_score_gemma":0.0013233407,"threshold_uncertainty_score":0.020494163},"labels":[],"label_agreement":null},{"id":"W4205516090","doi":"10.1145/3487351.3489471","title":"Approximating 4-cliques in streaming graphs","year":2021,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Clique; Clique problem; Computer science; Scalability; Clique-sum; Split graph; Graph; Theoretical computer science; Chordal graph; Combinatorics; Mathematics; 1-planar graph","score_opus":0.020728732248032528,"score_gpt":0.25507014524213834,"score_spread":0.2343414129941058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205516090","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.10555494,0.00067722995,0.88795567,0.0006607755,0.000074688185,0.0001695083,0.0012397431,0.0017753929,0.001892023],"genre_scores_gemma":[0.54388416,0.00050585985,0.4470431,0.00034372005,0.00015392077,0.000272465,0.004302742,0.00049130135,0.0030027796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985593,0.00039122993,0.00006654788,0.00046097537,0.00031716807,0.00020481717],"domain_scores_gemma":[0.99238753,0.0048256274,0.0007137411,0.001025149,0.00067864143,0.00036929746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017665102,0.001165546,0.0014255017,0.0017474015,0.0010652631,0.0014643422,0.003199676,0.0016920392,0.0027405105],"category_scores_gemma":[0.012965321,0.00086782756,0.0012597597,0.0020643324,0.0010374725,0.004426371,0.001766606,0.0019381148,0.00080618163],"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.00050753896,0.0001962933,0.010838114,0.00032934116,0.00018551368,0.0003722171,0.00033189397,0.8364534,0.009187014,0.046667654,0.010010333,0.08492071],"study_design_scores_gemma":[0.000010235922,0.000015936183,0.0004042687,0.000008898459,0.0000072715115,0.000051085055,0.00003596892,0.9733855,0.00076100614,0.024529902,0.00078414055,0.0000057423135],"about_ca_topic_score_codex":0.010090563,"about_ca_topic_score_gemma":0.018006228,"teacher_disagreement_score":0.010090563,"about_ca_system_score_codex":0.0017479822,"about_ca_system_score_gemma":0.0013095295,"threshold_uncertainty_score":0.020063639},"labels":[],"label_agreement":null},{"id":"W4205934954","doi":"10.1007/978-3-030-92681-6_9","title":"A Linear-Time Streaming Algorithm for Cardinality-Constrained Maximizing Monotone Non-submodular Set Functions","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"","keywords":"Submodular set function; Cardinality (data modeling); Monotone polygon; Time complexity; Function (biology); Combinatorics; Matching (statistics); Discrete mathematics; Constraint (computer-aided design); Set (abstract data type); Streaming algorithm; Binary logarithm; Mathematics; Computer science; Algorithm; Upper and lower bounds","score_opus":0.023621794034393018,"score_gpt":0.2539519593697021,"score_spread":0.2303301653353091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205934954","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.03368455,0.00073048833,0.94699204,0.0007742494,0.00017724291,0.0006842123,0.0016081729,0.0051313285,0.010217735],"genre_scores_gemma":[0.11654353,0.0002578208,0.8743124,0.00024840346,0.00011252503,0.00048030846,0.002731029,0.0005691071,0.0047448506],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987016,0.00020980298,0.00010169034,0.0004133912,0.00037110716,0.00020248453],"domain_scores_gemma":[0.99752134,0.0014131718,0.00013415115,0.00043670938,0.0003230819,0.00017156098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015918904,0.001967063,0.0026967993,0.0010602812,0.001000657,0.002378867,0.00423803,0.001938956,0.015027038],"category_scores_gemma":[0.005404557,0.0011492611,0.0015185666,0.0030244873,0.00073892483,0.0047656284,0.0034100213,0.00298577,0.0026758905],"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.0011613285,0.0007755433,0.0010758945,0.0007883049,0.00015425056,0.00018382038,0.00027981546,0.16146168,0.013968653,0.04872838,0.040996388,0.730426],"study_design_scores_gemma":[0.00022653301,0.00013486508,0.0002760599,0.000037429974,0.00003311485,0.00015043753,0.0001033053,0.93348336,0.0030125189,0.05900714,0.003509949,0.00002517631],"about_ca_topic_score_codex":0.0039027096,"about_ca_topic_score_gemma":0.006808506,"teacher_disagreement_score":0.015027038,"about_ca_system_score_codex":0.0024345904,"about_ca_system_score_gemma":0.0032784268,"threshold_uncertainty_score":0.050270498},"labels":[],"label_agreement":null},{"id":"W4206483022","doi":"10.1137/1.9781611977073.7","title":"Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time","year":2022,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","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 Toronto; University of Waterloo","funders":"","keywords":"Combinatorics; Planar graph; Flow (mathematics); Mathematics; Bounded function; Planar; Algorithm; Linear programming; Discrete mathematics; Computer science; Graph; Computer graphics (images); Geometry","score_opus":0.0581106082261173,"score_gpt":0.24177144191080382,"score_spread":0.18366083368468653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206483022","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.024260003,0.000227265,0.9618429,0.00037160597,0.000038060174,0.00011009213,0.00029791964,0.0009797247,0.0118723875],"genre_scores_gemma":[0.11774014,0.00035334015,0.8699102,0.00013477517,0.00004685487,0.00019340645,0.0008448847,0.00037254905,0.010403956],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957544,0.00006464054,0.00001917364,0.00012890836,0.00015496984,0.000056816396],"domain_scores_gemma":[0.99939966,0.00034833996,0.000047300717,0.00012506715,0.00005153365,0.000028047501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043579235,0.001075822,0.0007476321,0.00048086068,0.0004850356,0.0011961586,0.0012041677,0.00067592174,0.010313978],"category_scores_gemma":[0.0024281358,0.00059456524,0.0007278704,0.0011227449,0.00070753717,0.0035766421,0.0016204015,0.0016430254,0.0018568753],"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.00037592466,0.0001291279,0.000715644,0.00069157244,0.000048035454,0.00015142042,0.00034410402,0.23161109,0.015082737,0.19926292,0.0175818,0.53400564],"study_design_scores_gemma":[0.00007013918,0.00013009415,0.00025939534,0.000038159404,0.000021113696,0.00019302066,0.00007919589,0.76981133,0.007167937,0.202395,0.01981348,0.000020996911],"about_ca_topic_score_codex":0.0022056187,"about_ca_topic_score_gemma":0.0028500548,"teacher_disagreement_score":0.010313978,"about_ca_system_score_codex":0.00094086764,"about_ca_system_score_gemma":0.0010047384,"threshold_uncertainty_score":0.0345037},"labels":[],"label_agreement":null},{"id":"W4206681002","doi":"10.1007/978-3-540-77120-3_3","title":"Integer Representation and Counting in the Bit Probe Model","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Integer (computer science); Logarithm; Bit (key); Bitwise operation; Mathematics; Discrete mathematics; Representation (politics); Subtraction; Measure (data warehouse); Arithmetic; Computation; Constant (computer programming); Omega; Algorithm; Combinatorics; Computer science","score_opus":0.05007665314434419,"score_gpt":0.29048685802540014,"score_spread":0.24041020488105597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206681002","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.081645295,0.0022682953,0.7680932,0.0061044195,0.0006826172,0.00010318547,0.0007016344,0.0011235141,0.13927783],"genre_scores_gemma":[0.731111,0.0026315537,0.19816868,0.0017172556,0.0011921166,0.00048719693,0.0010593649,0.0008542039,0.062778704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820113,0.00058121386,0.00008085867,0.00026809098,0.0005679997,0.00030069958],"domain_scores_gemma":[0.99624395,0.0021321054,0.0002957693,0.0009161121,0.0002552435,0.00015688846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014972314,0.0010684222,0.0015402965,0.0018583199,0.0014896819,0.005648817,0.0027694888,0.0027538368,0.0116667375],"category_scores_gemma":[0.009360748,0.0006635196,0.0010026242,0.003998071,0.0031002953,0.013203468,0.0023994835,0.0041968934,0.0021671175],"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.000027209342,0.000013861142,0.000034447105,0.000019618048,0.0000019859895,0.000017433751,0.000031784406,0.0030590403,0.00024398472,0.98890907,0.0018706183,0.005770942],"study_design_scores_gemma":[0.0000058166447,0.000004100651,0.00001455766,0.0000069525227,0.0000027514222,0.000028142736,0.000010792911,0.01834106,0.0002281997,0.97983354,0.0015180277,0.000006091561],"about_ca_topic_score_codex":0.00085396395,"about_ca_topic_score_gemma":0.0006592155,"teacher_disagreement_score":0.0116667375,"about_ca_system_score_codex":0.0017960928,"about_ca_system_score_gemma":0.0010128741,"threshold_uncertainty_score":0.03902912},"labels":[],"label_agreement":null},{"id":"W4206719352","doi":"10.1016/j.procs.2021.11.025","title":"The Speed and Threshold of the Biased Perfect Matching Game","year":2021,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Complexity and Algorithms in Graphs","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 Montréal; Dawson College; McGill University","funders":"","keywords":"Infinity; Matching (statistics); Computer science; Circuit breaker; Combinatorics; Mathematical economics; Algorithm; Discrete mathematics; Mathematics; Physics; Statistics; Mathematical analysis; Quantum mechanics","score_opus":0.016517971246204122,"score_gpt":0.2352522358121574,"score_spread":0.21873426456595327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206719352","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.62078947,0.0015037452,0.3036654,0.0049478123,0.0002908187,0.0002515732,0.00076635944,0.0010924152,0.06669233],"genre_scores_gemma":[0.9626856,0.00067423837,0.028578313,0.0004940015,0.00012389934,0.00020142001,0.0002279588,0.00018490954,0.006829666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966113,0.0011808595,0.00012448922,0.00059970253,0.0005833449,0.0009002841],"domain_scores_gemma":[0.9673162,0.025320368,0.0022100778,0.0018531968,0.0011667674,0.0021333408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005037459,0.00088941073,0.0016796795,0.001313478,0.0012283308,0.0044474,0.0028283428,0.0023493704,0.007547912],"category_scores_gemma":[0.048322074,0.0008860138,0.000990868,0.0008283281,0.0031848745,0.008493504,0.0027772565,0.003204097,0.0015081795],"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.003050149,0.00023141294,0.008803634,0.00043268566,0.00020787031,0.00036691516,0.0009484691,0.14860035,0.022818306,0.7660656,0.008960621,0.039514035],"study_design_scores_gemma":[0.00022853675,0.00017952036,0.0013111995,0.000072970375,0.00007063465,0.00025453087,0.00013328256,0.45049307,0.0042806426,0.5406201,0.002287741,0.00006775089],"about_ca_topic_score_codex":0.0020360965,"about_ca_topic_score_gemma":0.0012037824,"teacher_disagreement_score":0.007547912,"about_ca_system_score_codex":0.0027208056,"about_ca_system_score_gemma":0.002239505,"threshold_uncertainty_score":0.026640952},"labels":[],"label_agreement":null},{"id":"W4220679245","doi":"10.1287/ijoc.2022.1161","title":"A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Complexity and Algorithms in Graphs","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 Waterloo; University of British Columbia","funders":"","keywords":"Quadratic assignment problem; Bounding overwatch; Mathematical optimization; Relaxation (psychology); Mathematics; Optimization problem; Convergence (economics); Lagrangian relaxation; Quadratic equation; Dual (grammatical number); Multiplier (economics); Exploit; Computer science; Artificial intelligence","score_opus":0.03811457354944635,"score_gpt":0.3168046937288804,"score_spread":0.27869012017943406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220679245","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.004517035,0.000230172,0.9863615,0.00027039024,0.00009820362,0.000083440085,0.00006126232,0.000062814484,0.008315189],"genre_scores_gemma":[0.16735159,0.0005990305,0.8211531,0.00053127174,0.0002244127,0.0005176122,0.00031774913,0.0002952368,0.009009893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984713,0.00064740825,0.00006726048,0.00022412531,0.0004560424,0.00013391074],"domain_scores_gemma":[0.9977155,0.0011487997,0.00016134937,0.00032790285,0.00050066545,0.00014575044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035891198,0.0013544526,0.00073906605,0.000999166,0.0007634465,0.0011964833,0.0019118732,0.0012336035,0.008286566],"category_scores_gemma":[0.007276033,0.0005159427,0.0012349525,0.0007992088,0.0014859538,0.002213138,0.0026394501,0.0040537524,0.0013820562],"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.00023250027,0.00021065996,0.0009821776,0.0005733309,0.00008425518,0.0002550654,0.0003744509,0.43190733,0.015860217,0.3790485,0.012179153,0.1582924],"study_design_scores_gemma":[0.000021564805,0.00005824931,0.000162664,0.0000712984,0.000014519378,0.00006881987,0.00003582624,0.9378321,0.0019379796,0.053011987,0.0067701093,0.000014923294],"about_ca_topic_score_codex":0.002369918,"about_ca_topic_score_gemma":0.0030603977,"teacher_disagreement_score":0.008286566,"about_ca_system_score_codex":0.0013233521,"about_ca_system_score_gemma":0.0018923834,"threshold_uncertainty_score":0.027721345},"labels":[],"label_agreement":null},{"id":"W4221162731","doi":"10.1609/aaai.v36i9.21275","title":"Sparsification of Decomposable Submodular Functions","year":2022,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"Precursory Research for Embryonic Science and Technology; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Cardinality (data modeling); Matroid; Complement (music); Mathematics; Function (biology); Simple (philosophy); Time complexity; Discrete mathematics; Combinatorics; Computer science; Data mining","score_opus":0.08783125934303422,"score_gpt":0.2769420356941431,"score_spread":0.1891107763511089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221162731","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.12964702,0.00059007376,0.86059153,0.00086736213,0.0000624733,0.00020833434,0.0005712372,0.0016863071,0.005775782],"genre_scores_gemma":[0.61916435,0.0004700954,0.37374756,0.00037965752,0.00012153646,0.0002985197,0.0017096266,0.00037173973,0.0037368506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876034,0.00040583403,0.000057547484,0.00028597866,0.00031047396,0.00017986703],"domain_scores_gemma":[0.99539787,0.002662033,0.00035782528,0.0011627122,0.00024803422,0.00017145998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015280719,0.0014361789,0.0016296866,0.0006713703,0.00042335776,0.0013070618,0.0013858982,0.0010208401,0.0036482674],"category_scores_gemma":[0.0067696325,0.00050881424,0.001135676,0.0010314918,0.0010759716,0.002604897,0.0018471368,0.0021676682,0.0008694507],"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.0006860306,0.00032950216,0.0021433174,0.00034073467,0.00010961823,0.00034156008,0.00021461367,0.6656404,0.016152646,0.04929719,0.010565788,0.25417867],"study_design_scores_gemma":[0.00004018284,0.00006936242,0.00022151945,0.000015877178,0.000010644134,0.00011579144,0.000045246863,0.95861477,0.00362606,0.03609014,0.0011422659,0.000008087589],"about_ca_topic_score_codex":0.001354483,"about_ca_topic_score_gemma":0.002334775,"teacher_disagreement_score":0.0036482674,"about_ca_system_score_codex":0.0010096509,"about_ca_system_score_gemma":0.0011783269,"threshold_uncertainty_score":0.012204707},"labels":[],"label_agreement":null},{"id":"W4224209627","doi":"10.1145/3532737.3532746","title":"Guest Column","year":2022,"lang":"en","type":"article","venue":"ACM SIGACT News","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Computer science; Perspective (graphical); Communication complexity; Theoretical computer science; Column (typography); Circuit complexity; Upper and lower bounds; Computational complexity theory; Mathematics; Algorithm; Artificial intelligence; Electronic circuit","score_opus":0.02997993845767251,"score_gpt":0.2524561424002102,"score_spread":0.2224762039425377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224209627","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.0008128294,0.008820985,0.0031013526,0.037831467,0.20219599,0.00024906156,0.021535033,0.0034491578,0.7220041],"genre_scores_gemma":[0.002506721,0.0035827472,0.0006951373,0.008594166,0.029368784,0.000095439056,0.007826141,0.0016343247,0.9456966],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986745,0.000113550996,0.00007700307,0.00029648724,0.00064895145,0.00018949503],"domain_scores_gemma":[0.9924964,0.0010503648,0.00046329666,0.00073014875,0.0025454843,0.002714237],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013235568,0.000978495,0.0011186998,0.0025152627,0.0016497046,0.0074580344,0.0018003946,0.0017577794,0.7896928],"category_scores_gemma":[0.010116688,0.0004927123,0.00072913116,0.0028690994,0.0006048653,0.00424625,0.002477906,0.0032446694,0.72456056],"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.000015642512,0.000009840548,0.000040426432,0.000047436188,0.0000011267689,0.000010713439,0.0000035618798,0.000017496226,0.00008262145,0.0009658806,0.9837177,0.015087595],"study_design_scores_gemma":[0.0000071118566,0.0000083534605,0.00014983359,0.000055739125,0.0000013955467,0.0000383561,0.000012438231,0.00004695912,0.00010245279,0.0009748227,0.9985984,0.0000041870617],"about_ca_topic_score_codex":0.0013744876,"about_ca_topic_score_gemma":0.0028923922,"teacher_disagreement_score":0.7896928,"about_ca_system_score_codex":0.0012552544,"about_ca_system_score_gemma":0.0021892074,"threshold_uncertainty_score":0.29997766},"labels":[],"label_agreement":null},{"id":"W4225101446","doi":"10.1137/22n975482","title":"Special Section on the Forty-Ninth Annual ACM Symposium on the Theory of Computing (STOC 2017)","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","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":"Mathematics; Ninth; Combinatorics; Discrete mathematics; Computer science; Arithmetic; Physics","score_opus":0.03321610467084326,"score_gpt":0.2608543157344119,"score_spread":0.22763821106356866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225101446","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.0015203198,0.026177092,0.016517634,0.048024017,0.73166233,0.0008819553,0.009189693,0.0044380394,0.161589],"genre_scores_gemma":[0.008602785,0.0372043,0.0070009115,0.024795748,0.3844043,0.0013485355,0.01711609,0.0050428323,0.51448447],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9907198,0.0017970994,0.00083902455,0.0021215007,0.003626545,0.0008959548],"domain_scores_gemma":[0.98158115,0.004074976,0.00093865645,0.0024183812,0.00732914,0.0036576688],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0061029657,0.0033684834,0.0065384097,0.004575749,0.0042398716,0.015137607,0.0034817692,0.004122275,0.39488134],"category_scores_gemma":[0.019005848,0.001501747,0.0025463304,0.00564998,0.0022667225,0.009025447,0.0054525165,0.010276189,0.2651089],"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.000042162934,0.000028698654,0.00010659692,0.00016172063,0.000018316656,0.000026863723,0.00001622292,0.00006633002,0.00012331955,0.001993522,0.9810501,0.01636616],"study_design_scores_gemma":[0.000047560065,0.000059701837,0.00048322117,0.00031964487,0.000026525675,0.00009952437,0.000042201995,0.0005994765,0.00012731897,0.0033094513,0.9948567,0.000028566576],"about_ca_topic_score_codex":0.0018602463,"about_ca_topic_score_gemma":0.003552342,"teacher_disagreement_score":0.39488134,"about_ca_system_score_codex":0.005524374,"about_ca_system_score_gemma":0.005430983,"threshold_uncertainty_score":0.8631283},"labels":[],"label_agreement":null},{"id":"W4226108027","doi":"10.4230/lipics.icalp.2023.63","title":"An O(log k)-Approximation for Directed Steiner Tree in Planar Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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 Alberta","funders":"","keywords":"Steiner tree problem; Combinatorics; Mathematics; Bipartite graph; Minor (academic); Constant (computer programming); Linear programming relaxation; Discrete mathematics; Approximation algorithm; Dual (grammatical number); Tree (set theory); Linear programming; Algorithm; Graph; Computer science; Law","score_opus":0.11199471886834342,"score_gpt":0.2181126986295274,"score_spread":0.10611797976118398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226108027","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.110167526,0.0021131074,0.82893103,0.0034973996,0.0004220095,0.0003957743,0.0029743589,0.014232312,0.037266545],"genre_scores_gemma":[0.2964325,0.0014407102,0.68160254,0.00060112093,0.0001856732,0.0003401818,0.004775846,0.0015056342,0.013115791],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983693,0.00025831987,0.00009657339,0.00040420052,0.0004765474,0.0003951278],"domain_scores_gemma":[0.997124,0.0011812709,0.0002645967,0.0009890174,0.00022836933,0.00021275524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009063977,0.0023830961,0.0017343427,0.0015981345,0.0010400361,0.003091972,0.0037799033,0.0020673543,0.017446784],"category_scores_gemma":[0.006635362,0.0008912312,0.0020029035,0.0037442818,0.000978186,0.008112038,0.003344078,0.0027921891,0.0059908326],"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.0019556147,0.0008774355,0.0030932538,0.0016899644,0.0002852204,0.0005285634,0.00051998725,0.28208414,0.03952285,0.07954151,0.07731846,0.512583],"study_design_scores_gemma":[0.0003830335,0.00024332698,0.0010548485,0.000113556154,0.00014304415,0.000758146,0.0002948944,0.8313265,0.012693367,0.1336218,0.019302327,0.00006513343],"about_ca_topic_score_codex":0.0034243017,"about_ca_topic_score_gemma":0.006121255,"teacher_disagreement_score":0.017446784,"about_ca_system_score_codex":0.0028854595,"about_ca_system_score_gemma":0.0020272946,"threshold_uncertainty_score":0.058365285},"labels":[],"label_agreement":null},{"id":"W4232943531","doi":"10.1145/1109557.1109644","title":"Oblivious string embeddings and edit distance approximations","year":2006,"lang":"en","type":"article","venue":"Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Edit distance; Embedding; Combinatorics; String (physics); Distortion (music); Approximation algorithm; Discrete mathematics; Mathematics; Algorithm; Computer science; Artificial intelligence","score_opus":0.006974374443870286,"score_gpt":0.22273242763541046,"score_spread":0.21575805319154018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232943531","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.019682413,0.0004757719,0.974861,0.00030544246,0.000057379108,0.00005450277,0.00023938717,0.0018369888,0.0024871093],"genre_scores_gemma":[0.35646117,0.0006400464,0.63343704,0.00028852426,0.00013877875,0.00033347565,0.0012519388,0.0005590546,0.0068899603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635327,0.0008605585,0.00027525253,0.0008759529,0.0012933884,0.00034163418],"domain_scores_gemma":[0.9915592,0.0034017055,0.000760979,0.0036417425,0.00045623956,0.00018003304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012719823,0.0013615057,0.0015150829,0.0013470621,0.0007320627,0.002604861,0.004009307,0.0022346473,0.004242427],"category_scores_gemma":[0.01679778,0.0009143192,0.000987153,0.0027042483,0.0015537854,0.01038757,0.0037207894,0.0033069458,0.0020489262],"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.0007541944,0.0002930541,0.0013613953,0.0003721482,0.00010758575,0.00024648113,0.00040173094,0.5978806,0.009300991,0.19054425,0.0061726472,0.19256492],"study_design_scores_gemma":[0.00005359076,0.00009631454,0.00018179313,0.000023970242,0.000024866227,0.00021084954,0.00004930002,0.8024178,0.0066504814,0.18545067,0.004812004,0.000028365643],"about_ca_topic_score_codex":0.0016736853,"about_ca_topic_score_gemma":0.0017480529,"teacher_disagreement_score":0.004242427,"about_ca_system_score_codex":0.0023864803,"about_ca_system_score_gemma":0.0011854458,"threshold_uncertainty_score":0.017315209},"labels":[],"label_agreement":null},{"id":"W4233454535","doi":"10.1007/s00454-009-9165-3","title":"Dynamic Coresets","year":2009,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"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":"Mathematics; Combinatorics; Constant (computer programming); Bounded function; Dimension (graph theory); Amortized analysis; Integer (computer science); Binary logarithm; Bounding overwatch; Annulus (botany); Discrete mathematics; Data structure; Mathematical analysis; Computer science","score_opus":0.01138252880161875,"score_gpt":0.27628883777066476,"score_spread":0.264906308969046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233454535","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.17783034,0.00097262143,0.30260938,0.0036036638,0.00088220584,0.00038287902,0.0036294088,0.001662036,0.50842744],"genre_scores_gemma":[0.75179607,0.0009236557,0.052241985,0.0010017963,0.00042150996,0.0003575873,0.004814043,0.0008765182,0.1875669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903893,0.00010803771,0.00003689502,0.00031847425,0.0002562038,0.00024146473],"domain_scores_gemma":[0.9982886,0.0003564883,0.0001248383,0.0005690319,0.00033038203,0.0003307181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048473172,0.0007117871,0.00085922313,0.0013137101,0.0021087986,0.003050286,0.001390881,0.0010589649,0.043972272],"category_scores_gemma":[0.0032569852,0.000508597,0.0007369568,0.001419883,0.0015159624,0.006530458,0.0038061047,0.0027020073,0.0056897714],"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.000104140956,0.000058421843,0.0003740569,0.000055681903,0.00001260754,0.00009633843,0.00012127855,0.003120426,0.0011359595,0.9598263,0.012877916,0.022216795],"study_design_scores_gemma":[0.00002708009,0.000025603851,0.00024034994,0.000024627376,0.000013551149,0.00020327936,0.00018414794,0.0147188045,0.0013388895,0.9420692,0.041143246,0.000011209692],"about_ca_topic_score_codex":0.0010414217,"about_ca_topic_score_gemma":0.0016600514,"teacher_disagreement_score":0.043972272,"about_ca_system_score_codex":0.0011563997,"about_ca_system_score_gemma":0.0010106156,"threshold_uncertainty_score":0.14710194},"labels":[],"label_agreement":null},{"id":"W4235156957","doi":"10.1145/3196275","title":"Completeness for First-order Properties on Sparse Structures with Algorithmic Applications","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"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","funders":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; University of California, San Diego; National Science Foundation","keywords":"Tuple; Exponential time hypothesis; Mathematics; Completeness (order theory); Property (philosophy); Combinatorics; Time complexity; Set (abstract data type); Order (exchange); PSPACE; Exponential function; Class (philosophy); Discrete mathematics; Data structure; Algorithm; Computational complexity theory; Computer science","score_opus":0.050926100854386855,"score_gpt":0.26676406540761133,"score_spread":0.21583796455322446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235156957","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.20017654,0.0006995055,0.7696335,0.0044909916,0.000083781626,0.00023483114,0.0029827983,0.0036897052,0.01800834],"genre_scores_gemma":[0.69860375,0.00069403125,0.28501227,0.0009799635,0.0003738926,0.0003539782,0.0061896215,0.0009215269,0.0068709096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930119,0.0013614288,0.0005376403,0.0015381188,0.002522463,0.0010284558],"domain_scores_gemma":[0.96098906,0.025753818,0.0018248551,0.008431007,0.0023922138,0.000609132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041400855,0.0010602772,0.0015710142,0.0021775207,0.002057209,0.0056358045,0.0028508666,0.0017815442,0.0072314423],"category_scores_gemma":[0.023983,0.0012836392,0.0043520206,0.0037272165,0.0042632883,0.016132372,0.0044819633,0.006198704,0.0013057273],"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.0005933434,0.00043363485,0.0054618055,0.00090174214,0.00016297784,0.00025089475,0.0016303173,0.07606535,0.008259245,0.8096154,0.00997973,0.086645484],"study_design_scores_gemma":[0.000059029786,0.00004846072,0.0006725613,0.000037293798,0.00003842427,0.0001390345,0.00015391182,0.08505834,0.004953278,0.90567225,0.003142145,0.000025264995],"about_ca_topic_score_codex":0.0032617627,"about_ca_topic_score_gemma":0.0047475356,"teacher_disagreement_score":0.0072314423,"about_ca_system_score_codex":0.0027742998,"about_ca_system_score_gemma":0.0039097527,"threshold_uncertainty_score":0.024191618},"labels":[],"label_agreement":null},{"id":"W4237140089","doi":"10.1137/1.9781611973068.77","title":"A logarithmic approximation for unsplittable flow on line graphs","year":2009,"lang":"en","type":"article","venue":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bottleneck; Logarithm; Approximation algorithm; Bounded function; Mathematics; Time complexity; Computer science; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.020031024562312948,"score_gpt":0.2649339222629797,"score_spread":0.24490289770066673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237140089","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.16998033,0.0019864584,0.7831772,0.0043654144,0.0002555233,0.00042648654,0.0022384601,0.007696003,0.029874094],"genre_scores_gemma":[0.62932694,0.0009801091,0.3520992,0.0011596775,0.00019534933,0.00037717645,0.003372729,0.0011745141,0.011314225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836177,0.00044903698,0.00004862926,0.0003377977,0.0002793562,0.00052335305],"domain_scores_gemma":[0.9969855,0.0018964112,0.00031424128,0.00040864816,0.0001666221,0.00022853738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014832902,0.0019977982,0.0015240003,0.0010895681,0.0010569959,0.0028167525,0.0029459624,0.001649611,0.010437449],"category_scores_gemma":[0.0062818956,0.0007080852,0.0010242254,0.0022115528,0.0012123869,0.0065312805,0.0016570386,0.002875779,0.0019041671],"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.0013143122,0.0006225761,0.0011696683,0.00044848074,0.00008193444,0.0002437176,0.000289845,0.831351,0.005124887,0.048834532,0.019978654,0.09054042],"study_design_scores_gemma":[0.00010976101,0.0001036605,0.0001559596,0.000024777133,0.000013488486,0.000075421165,0.00007008685,0.93980336,0.0009200569,0.055674624,0.0030361272,0.000012660836],"about_ca_topic_score_codex":0.0052654357,"about_ca_topic_score_gemma":0.0060788845,"teacher_disagreement_score":0.010437449,"about_ca_system_score_codex":0.0037358233,"about_ca_system_score_gemma":0.002029735,"threshold_uncertainty_score":0.03491676},"labels":[],"label_agreement":null},{"id":"W4239068887","doi":"10.1007/978-0-387-39940-9_4054","title":"Wrapper Robustness","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Complexity and Algorithms in Graphs","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":"Robustness (evolution); Computer science; Chemistry","score_opus":0.021525749702203077,"score_gpt":0.2335625794180037,"score_spread":0.21203682971580062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239068887","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.018620973,0.003318145,0.75839907,0.0016360191,0.0013145808,0.00022588315,0.001954331,0.014305954,0.20022492],"genre_scores_gemma":[0.5635557,0.0049990653,0.2037889,0.002043035,0.0016103621,0.0005328668,0.008125392,0.008315788,0.2070289],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978561,0.00027154066,0.00013920687,0.0006584354,0.0008496217,0.00022523322],"domain_scores_gemma":[0.99420446,0.0014079558,0.00034548435,0.0030582803,0.00082130777,0.00016251551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012588575,0.0015895101,0.0013698596,0.002041447,0.0010730696,0.0037567073,0.0019455558,0.00187269,0.040157676],"category_scores_gemma":[0.010036153,0.0007346968,0.0014949846,0.0014226381,0.0015839783,0.005649792,0.0038542703,0.0022303285,0.024655363],"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.00037443225,0.00015284303,0.0008145618,0.00072040403,0.00015034877,0.000525272,0.00019782885,0.031800814,0.018211138,0.38857552,0.09891489,0.4595619],"study_design_scores_gemma":[0.000048112128,0.00014505582,0.000801498,0.0002464315,0.0001243046,0.0010291503,0.000098209035,0.088958986,0.04215402,0.68564373,0.18065445,0.00009609381],"about_ca_topic_score_codex":0.00041275148,"about_ca_topic_score_gemma":0.0002975775,"teacher_disagreement_score":0.040157676,"about_ca_system_score_codex":0.000819052,"about_ca_system_score_gemma":0.000745938,"threshold_uncertainty_score":0.13434082},"labels":[],"label_agreement":null},{"id":"W4239711818","doi":"10.1007/978-3-319-14115-2_31","title":"Linear Arrangement Problems and Interval Graphs","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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é du Québec à Chicoutimi","funders":"","keywords":"Bounding overwatch; Interval (graph theory); Indifference graph; Interval graph; Combinatorics; Mathematics; Upper and lower bounds; Chordal graph; Discrete mathematics; Pathwidth; Focus (optics); Computer science; 1-planar graph; Graph; Line graph; Physics; Mathematical analysis; Artificial intelligence","score_opus":0.025509850149295066,"score_gpt":0.24055500380338335,"score_spread":0.21504515365408827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239711818","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.047136776,0.032086786,0.39365312,0.006930121,0.0016738937,0.00014397554,0.00084735773,0.0006331231,0.5168949],"genre_scores_gemma":[0.51045513,0.052219365,0.24080019,0.0017021913,0.00540362,0.00059875206,0.0038869276,0.00056034856,0.1843734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942756,0.00018395855,0.000028349097,0.00012820913,0.00016704107,0.00006493067],"domain_scores_gemma":[0.99896765,0.000678307,0.00009926635,0.00011464692,0.00007969933,0.00006041497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056811544,0.0009270002,0.00079931546,0.00096534,0.0009891975,0.002743233,0.0018711345,0.0013494189,0.016452666],"category_scores_gemma":[0.002389827,0.00062099914,0.00071583013,0.004118831,0.0016953851,0.0051164813,0.0012938787,0.004298759,0.002979929],"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.000033861055,0.00006227437,0.00010359358,0.00028499964,0.000013170371,0.000060821345,0.00014016265,0.008273075,0.0005297119,0.8921389,0.027611217,0.070748195],"study_design_scores_gemma":[0.000012738426,0.000012940508,0.00009342381,0.000047517493,0.0000067687533,0.00009128742,0.000088410394,0.0053120735,0.00017300608,0.9710244,0.023128742,0.000008704797],"about_ca_topic_score_codex":0.0007248845,"about_ca_topic_score_gemma":0.0006501814,"teacher_disagreement_score":0.016452666,"about_ca_system_score_codex":0.0012400369,"about_ca_system_score_gemma":0.00043691188,"threshold_uncertainty_score":0.055039644},"labels":[],"label_agreement":null},{"id":"W4242064191","doi":"10.1002/rsa.20279","title":"Asymptotic random graph intuition for the biased connectivity game","year":2009,"lang":"en","type":"article","venue":"Random Structures and Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":52,"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":"Combinatorics; Intuition; Random graph; Mathematics; Graph; Discrete mathematics; Mathematical economics; Psychology","score_opus":0.01809614125711018,"score_gpt":0.2568782022790673,"score_spread":0.23878206102195715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242064191","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.5423672,0.00058719446,0.40677258,0.0034728546,0.00007560092,0.00014494438,0.00031809343,0.0003561873,0.04590539],"genre_scores_gemma":[0.9807581,0.00019761131,0.014989226,0.00037755302,0.000046832887,0.0001088069,0.000090876536,0.00005903273,0.0033720082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867874,0.0005526597,0.000040244577,0.00017581244,0.00036736965,0.00018515947],"domain_scores_gemma":[0.99247265,0.0047753965,0.00090097374,0.0007218928,0.0005224506,0.000606664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017961962,0.00043237032,0.0006790319,0.0008613651,0.00064036,0.0016522227,0.0014762649,0.0012059738,0.005238725],"category_scores_gemma":[0.013547485,0.000314295,0.00048040485,0.00047380713,0.0021929792,0.0033935017,0.001491964,0.0017298384,0.00040592268],"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.000091175854,0.000046268775,0.001396705,0.00005714281,0.000025034318,0.00015494972,0.00018544665,0.04066566,0.0027748481,0.94885063,0.0017449035,0.004007226],"study_design_scores_gemma":[0.000060642564,0.00003856673,0.0007123516,0.00001751961,0.000016483518,0.00020512436,0.00007974273,0.25464618,0.0007182388,0.74178714,0.0016967193,0.000021313606],"about_ca_topic_score_codex":0.00126537,"about_ca_topic_score_gemma":0.0012431317,"teacher_disagreement_score":0.005238725,"about_ca_system_score_codex":0.0018836609,"about_ca_system_score_gemma":0.0006458742,"threshold_uncertainty_score":0.017525256},"labels":[],"label_agreement":null},{"id":"W4242600797","doi":"10.1137/1.9781611974331.ch87","title":"Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky","year":2015,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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; National Science Foundation","keywords":"Satisfiability; Randomized algorithm; Deterministic algorithm; Combinatorics; Mathematics; Matching (statistics); Running time; Discrete mathematics; Algorithm; Computer science; Statistics","score_opus":0.03425324003984173,"score_gpt":0.26127349678342926,"score_spread":0.22702025674358753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242600797","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.20041537,0.00044024637,0.7795484,0.0030361041,0.0002183455,0.0002783301,0.00084971834,0.0040536146,0.011159875],"genre_scores_gemma":[0.6709406,0.000246714,0.32054046,0.0009482396,0.00014492244,0.0004975243,0.001025617,0.0008030087,0.0048529105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954022,0.0018352763,0.00025461934,0.00088502374,0.0010605836,0.0005621912],"domain_scores_gemma":[0.98756903,0.0068281395,0.0008051444,0.0037704,0.000633877,0.0003934383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038602287,0.001259516,0.0014456235,0.001039164,0.0014786068,0.0019264476,0.0028040214,0.0013015994,0.0064417296],"category_scores_gemma":[0.020610215,0.0007613886,0.0019411913,0.0017752757,0.0030274405,0.0062463363,0.0049768263,0.0034081098,0.0015268022],"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.0020102647,0.00028841678,0.0065531707,0.0004551633,0.00020088474,0.00026115344,0.00061894266,0.2320305,0.014791619,0.6043355,0.016581506,0.12187286],"study_design_scores_gemma":[0.00018604062,0.00016233353,0.00039235875,0.000033320637,0.000052210427,0.00009864899,0.00008405792,0.45272315,0.0061168666,0.5362712,0.0038316506,0.00004814113],"about_ca_topic_score_codex":0.0036327764,"about_ca_topic_score_gemma":0.0058476175,"teacher_disagreement_score":0.0064417296,"about_ca_system_score_codex":0.0027524699,"about_ca_system_score_gemma":0.0037576926,"threshold_uncertainty_score":0.021549761},"labels":[],"label_agreement":null},{"id":"W4243222502","doi":"10.1007/978-1-4939-7131-2_100561","title":"k-Cores","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Geology; Computer science","score_opus":0.03263804680829943,"score_gpt":0.23550820541233497,"score_spread":0.20287015860403554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243222502","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.0111462055,0.0038307067,0.1148611,0.0020046446,0.0016154476,0.00014134901,0.001400251,0.0019532794,0.86304706],"genre_scores_gemma":[0.2196882,0.0062784147,0.14174624,0.0024809896,0.0013076955,0.00040786335,0.0040690354,0.0026757992,0.6213457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995858,0.00004006096,0.000022842989,0.00014888613,0.00011837272,0.00008406004],"domain_scores_gemma":[0.99945337,0.000106132415,0.00003373587,0.0001808275,0.00015360497,0.0000723658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025109627,0.0010145806,0.0007148992,0.00074943324,0.0012020996,0.0028962425,0.0010907437,0.0007389611,0.07525302],"category_scores_gemma":[0.0013993237,0.00049269444,0.0006105894,0.0012794142,0.0009650661,0.0047696466,0.0018041802,0.0018037517,0.04166107],"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.0001244749,0.0000505325,0.00019698631,0.000545339,0.000019983943,0.000059772312,0.00014600104,0.0020535646,0.0027792135,0.6357842,0.14070764,0.21753222],"study_design_scores_gemma":[0.00001755354,0.00003045931,0.00025356835,0.00016547566,0.000016035108,0.00031004148,0.000095052135,0.003586784,0.0023690502,0.6027466,0.39039338,0.000015979114],"about_ca_topic_score_codex":0.00048637312,"about_ca_topic_score_gemma":0.0010667533,"teacher_disagreement_score":0.07525302,"about_ca_system_score_codex":0.0009036775,"about_ca_system_score_gemma":0.00090103934,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4243376123","doi":"10.1007/978-94-007-4978-8_102","title":"Mathematical Proof, Argumentation, and Reasoning","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"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":"Argumentation theory; Computer science; Calculus (dental); Cognitive science; Epistemology; Mathematics; Psychology; Philosophy; Medicine","score_opus":0.018974619462691928,"score_gpt":0.23723492313704247,"score_spread":0.21826030367435054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243376123","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.0033701325,0.121138126,0.13290903,0.017173504,0.0020683603,0.000082246945,0.00042916977,0.00039888846,0.7224306],"genre_scores_gemma":[0.2637546,0.15196286,0.16040318,0.005535545,0.00956887,0.00057774247,0.0019609935,0.00087990245,0.40535626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894184,0.00035884694,0.0000516395,0.00013542672,0.0004493435,0.00006292044],"domain_scores_gemma":[0.998154,0.0013414902,0.00007070967,0.00020071956,0.00018454807,0.00004853584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010272058,0.0010846773,0.0009425562,0.0019089326,0.0013923183,0.005859447,0.0016493881,0.0020174638,0.017070565],"category_scores_gemma":[0.004293069,0.00066312484,0.0009177419,0.0031013596,0.0055720014,0.008679301,0.0015766826,0.0045199017,0.0049804715],"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.0000031584648,0.000010036116,0.000021629172,0.00013236176,0.00000539349,0.000009493616,0.00011023058,0.0005184946,0.00006183688,0.9572509,0.0229836,0.01889287],"study_design_scores_gemma":[0.0000023216662,0.0000013777762,0.00003124866,0.00007578402,0.0000024050278,0.000021045787,0.000027939617,0.00049578946,0.00004149316,0.93259084,0.06670632,0.0000035018388],"about_ca_topic_score_codex":0.0020219772,"about_ca_topic_score_gemma":0.00223668,"teacher_disagreement_score":0.017070565,"about_ca_system_score_codex":0.003728683,"about_ca_system_score_gemma":0.0019312993,"threshold_uncertainty_score":0.057106733},"labels":[],"label_agreement":null},{"id":"W4243384718","doi":"10.1002/net.20188","title":"The maximum residual flow problem:<i>NP</i>‐hardness with two‐arc destruction","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"","keywords":"Arc (geometry); Residual; Mathematics; Flow (mathematics); Combinatorics; Maximum flow problem; Polynomial; Arc routing; Flow network; Computer science; Geometry; Algorithm; Mathematical analysis; Routing (electronic design automation); Computer network","score_opus":0.010911708731744182,"score_gpt":0.22936413531378097,"score_spread":0.21845242658203678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243384718","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.30135417,0.002759532,0.59986293,0.010628337,0.00029531828,0.00033593463,0.001941589,0.0021361492,0.08068599],"genre_scores_gemma":[0.8916697,0.0010770676,0.09068141,0.00081172417,0.00026810318,0.00021537357,0.0016853508,0.000400199,0.013191187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986179,0.00033993644,0.00007614142,0.00036590119,0.00024089316,0.00035919138],"domain_scores_gemma":[0.9950706,0.0032608886,0.00046906827,0.000619721,0.00019819518,0.00038153495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010670847,0.00083719724,0.0011717321,0.0006707966,0.00085650606,0.0025940433,0.002541308,0.0015877488,0.0076287617],"category_scores_gemma":[0.00522842,0.00059699954,0.001265111,0.0010543133,0.0023412504,0.0055576176,0.0020761043,0.0032677865,0.0005730825],"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.001153283,0.0005121422,0.0027598361,0.0015100699,0.00021572121,0.0009856212,0.0006415912,0.44613543,0.014365254,0.38128754,0.04591181,0.10452172],"study_design_scores_gemma":[0.00021581906,0.00014496462,0.0012008011,0.00010656439,0.000085353124,0.0012019702,0.00028948716,0.39332485,0.009879419,0.5747261,0.018767646,0.000056972287],"about_ca_topic_score_codex":0.0021965452,"about_ca_topic_score_gemma":0.0013126608,"teacher_disagreement_score":0.0076287617,"about_ca_system_score_codex":0.0012918236,"about_ca_system_score_gemma":0.0011455078,"threshold_uncertainty_score":0.025520802},"labels":[],"label_agreement":null},{"id":"W4244133084","doi":"10.1137/1.9781611974782.141","title":"Completeness for First-Order Properties on Sparse Structures with Algorithmic Applications","year":2017,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"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","funders":"Division of Computing and Communication Foundations; Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; University of California, San Diego; National Science Foundation","keywords":"Tuple; Completeness (order theory); Property (philosophy); Exponential time hypothesis; Time complexity; Exponential function; Set (abstract data type); Computer science; PSPACE; Class (philosophy); Data structure; Mathematics; Order (exchange); Algorithm; Computational complexity theory; Discrete mathematics; Combinatorics; Artificial intelligence","score_opus":0.06519014408323036,"score_gpt":0.2715318482800997,"score_spread":0.2063417041968693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244133084","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.21233094,0.00062320323,0.7555904,0.004655181,0.00007586611,0.0002463852,0.0030114406,0.0030026454,0.020464012],"genre_scores_gemma":[0.72485024,0.00074025965,0.25796092,0.00092379085,0.00033355888,0.00037354935,0.00614015,0.000836562,0.007841016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99367946,0.001230616,0.0004456956,0.001392812,0.0022805112,0.0009708852],"domain_scores_gemma":[0.962002,0.02542665,0.0018128338,0.007918484,0.0022441342,0.00059584295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036934407,0.0010273551,0.0014058455,0.002050445,0.002083875,0.0056092944,0.00284273,0.0018081624,0.0072732368],"category_scores_gemma":[0.021765292,0.0011465417,0.0037102038,0.0035303193,0.0040816544,0.01595865,0.0040808385,0.005920087,0.0011735762],"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.00044661626,0.0004049701,0.0047294623,0.0007857523,0.00014103409,0.00020070352,0.0014242262,0.07351736,0.0064908853,0.82599056,0.008873774,0.07699476],"study_design_scores_gemma":[0.00004721849,0.00004056603,0.0007137967,0.000035674148,0.000035514808,0.00014939735,0.00016065688,0.08756646,0.004612987,0.9031843,0.0034313041,0.000022044958],"about_ca_topic_score_codex":0.0034329793,"about_ca_topic_score_gemma":0.004909399,"teacher_disagreement_score":0.0072732368,"about_ca_system_score_codex":0.0026449428,"about_ca_system_score_gemma":0.003740742,"threshold_uncertainty_score":0.02433139},"labels":[],"label_agreement":null},{"id":"W4245020129","doi":"10.1109/lics.2017.8005099","title":"Uniform, integral and efficient proofs for the determinant identities","year":2017,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Mathematical proof; Bounded function; Algebraic number; Discrete mathematics; Combinatorics; Mathematics; Computer science","score_opus":0.03406652558910504,"score_gpt":0.2880806296348293,"score_spread":0.2540141040457242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245020129","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.022741143,0.0009719078,0.9201554,0.0036715392,0.0006448756,0.00029435026,0.0010866243,0.002641919,0.047792155],"genre_scores_gemma":[0.5143616,0.0019485557,0.45027044,0.0037433414,0.0013751795,0.00066004525,0.0021930817,0.0014057095,0.024042161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947043,0.0010395417,0.00027938405,0.00067651167,0.0024433902,0.0008568088],"domain_scores_gemma":[0.98659885,0.0082811145,0.0005844827,0.0023310736,0.001882962,0.0003214972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031658828,0.0012052951,0.00078742503,0.0018024936,0.0018999687,0.0040087756,0.0030569534,0.00120685,0.017839236],"category_scores_gemma":[0.019737756,0.00097492436,0.0018300017,0.0017725579,0.0024825907,0.009143065,0.007085229,0.0061704856,0.003650582],"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.00020425343,0.00022388312,0.0007053322,0.000500081,0.00006400622,0.00036471506,0.00061882735,0.0045761163,0.012633477,0.87449443,0.022466237,0.08314853],"study_design_scores_gemma":[0.00015676046,0.000120412464,0.0009240689,0.00020192542,0.00016442414,0.0008969282,0.00023376246,0.03465099,0.041337248,0.85914373,0.062049594,0.000120006414],"about_ca_topic_score_codex":0.0013235783,"about_ca_topic_score_gemma":0.0019546796,"teacher_disagreement_score":0.017839236,"about_ca_system_score_codex":0.0030610033,"about_ca_system_score_gemma":0.002858064,"threshold_uncertainty_score":0.059678137},"labels":[],"label_agreement":null},{"id":"W4250124835","doi":"10.1109/focs.2007.4389538","title":"Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lov&amp;#x0E9;sz-Schrijver Hierarchy","year":2007,"lang":"en","type":"article","venue":"Annual Symposium on Foundations of Computer Science","topic":"Complexity and Algorithms in Graphs","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":"Semidefinite programming; Vertex cover; Approximation algorithm; Cover (algebra); Combinatorics; Vertex (graph theory); Linear programming; Mathematics; Time complexity; Omega; Computer science; Algorithm; Discrete mathematics; Mathematical optimization; Graph; Physics","score_opus":0.027782965703401368,"score_gpt":0.31612913376889534,"score_spread":0.28834616806549396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250124835","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.1962413,0.00662465,0.5544449,0.011998697,0.0006794952,0.0004999249,0.0028296227,0.0026990667,0.22398238],"genre_scores_gemma":[0.8224946,0.0028510331,0.14317033,0.0023157701,0.00055736233,0.0006510647,0.001492047,0.0010246643,0.02544304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974655,0.0005723126,0.00007032697,0.0004433071,0.0006940838,0.0007545339],"domain_scores_gemma":[0.98845726,0.009006075,0.0004878747,0.00094534864,0.00034095446,0.000762406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036235892,0.0017881835,0.0026926375,0.001513764,0.0021888972,0.004370394,0.0030693044,0.0025395525,0.021370031],"category_scores_gemma":[0.016981138,0.0009807784,0.0021641469,0.0015338435,0.0030762367,0.006480946,0.004389991,0.009167318,0.0024690314],"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.0007812839,0.00039913057,0.0016452805,0.00084823585,0.000098082135,0.000269563,0.0007378384,0.15548585,0.0031440943,0.757301,0.024543013,0.054746617],"study_design_scores_gemma":[0.00007081809,0.00009993105,0.0005353055,0.00012696674,0.00004835623,0.00014500154,0.00011626304,0.3864463,0.0011799553,0.60410666,0.0070943916,0.000029972338],"about_ca_topic_score_codex":0.0033399882,"about_ca_topic_score_gemma":0.004199938,"teacher_disagreement_score":0.021370031,"about_ca_system_score_codex":0.005983052,"about_ca_system_score_gemma":0.0028695317,"threshold_uncertainty_score":0.07148987},"labels":[],"label_agreement":null},{"id":"W4254239736","doi":"10.1137/1.9781611973730.115","title":"Four terminal planar Delta-Wye reducibility via rooted <i>K</i><sub>2,4</sub> minors","year":2014,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Terminal (telecommunication); Planar; Combinatorics; Mathematics; Computer science; Discrete mathematics; Algorithm; Telecommunications","score_opus":0.020170558798452018,"score_gpt":0.22639555046168022,"score_spread":0.20622499166322822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254239736","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.7233651,0.0001233526,0.24092953,0.00045231447,0.00004708049,0.00020568621,0.00071657955,0.0011780123,0.03298232],"genre_scores_gemma":[0.85466945,0.00022578798,0.12667565,0.00012379019,0.000027352218,0.00010807937,0.0017523316,0.0003935772,0.016023966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997186,0.000031500043,0.000017371507,0.00007924542,0.0000794461,0.00007376482],"domain_scores_gemma":[0.9995371,0.00016296736,0.000067485154,0.00012829216,0.000052040723,0.000052198637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019121238,0.0005388028,0.00042864872,0.0005549653,0.00063397473,0.000997551,0.00068814226,0.00039311833,0.0056208735],"category_scores_gemma":[0.0009923223,0.0004200263,0.0011474709,0.00043802388,0.0010993838,0.0012402915,0.0017457072,0.0011921211,0.00083256204],"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.000736788,0.00035937657,0.0029933257,0.00058607064,0.00012259252,0.002122011,0.0020617873,0.06416817,0.11969828,0.64323616,0.008942124,0.15497324],"study_design_scores_gemma":[0.00013485222,0.00021049856,0.0020150023,0.00004891706,0.00010826745,0.0011981453,0.0006758935,0.0548325,0.083271496,0.8348019,0.022643387,0.000059135313],"about_ca_topic_score_codex":0.0012497094,"about_ca_topic_score_gemma":0.00187247,"teacher_disagreement_score":0.0056208735,"about_ca_system_score_codex":0.00059685414,"about_ca_system_score_gemma":0.00039634787,"threshold_uncertainty_score":0.018803656},"labels":[],"label_agreement":null},{"id":"W4282936435","doi":"10.1007/s10898-022-01183-7","title":"A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Complexity and Algorithms in Graphs","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":"University of New Brunswick","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Mathematics; Hypergraph; Combinatorics; Maximum cut; Vertex (graph theory); Disjoint sets; Semidefinite programming; Discrete mathematics; Mathematical optimization; Graph","score_opus":0.007454803762989175,"score_gpt":0.21333503972465478,"score_spread":0.2058802359616656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4282936435","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.11004255,0.0034471762,0.8628239,0.004177507,0.00032494473,0.00035792834,0.0010394742,0.00047950537,0.017306957],"genre_scores_gemma":[0.63397616,0.0024450861,0.34987715,0.00078290113,0.00068205013,0.0005302969,0.0014715481,0.00047208153,0.009762685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981522,0.0006066596,0.00006561253,0.00039159236,0.00043998382,0.000343931],"domain_scores_gemma":[0.98221934,0.014700461,0.0010360603,0.000662067,0.0007302495,0.000651852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038246836,0.0021332023,0.0030485333,0.0021347913,0.0012124701,0.00454715,0.0051417667,0.004275725,0.008719335],"category_scores_gemma":[0.024501765,0.0013318374,0.0019445784,0.0040876814,0.001801004,0.008078615,0.0029864814,0.0043081623,0.0006423542],"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.0007776478,0.00045492031,0.0022824537,0.0006427417,0.0001638287,0.00024859124,0.00020160081,0.83219856,0.0016702953,0.09299884,0.013374008,0.05498647],"study_design_scores_gemma":[0.000035499368,0.00003989296,0.00019725473,0.000032226817,0.00002611443,0.000082327664,0.000056705274,0.9562773,0.00022521829,0.042467102,0.000551312,0.00000901014],"about_ca_topic_score_codex":0.0046437914,"about_ca_topic_score_gemma":0.004860673,"teacher_disagreement_score":0.008719335,"about_ca_system_score_codex":0.0032915415,"about_ca_system_score_gemma":0.00293425,"threshold_uncertainty_score":0.029169023},"labels":[],"label_agreement":null},{"id":"W4285230523","doi":"10.4086/toc.2022.v018a019","title":"","year":2022,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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; National Science Foundation","keywords":"Mathematics; Rank (graph theory); Communication complexity; Combinatorics; Context (archaeology); Sign (mathematics); Dimension (graph theory); Discrete mathematics; Boolean function; Connection (principal bundle); Matrix (chemical analysis); VC dimension; Computational complexity theory; Omega; Algorithm","score_opus":0.021959954705695197,"score_gpt":0.2398138414644886,"score_spread":0.21785388675879339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285230523","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.14481111,0.002732001,0.73776215,0.016325945,0.0008552168,0.00015742029,0.0013107072,0.00061904243,0.0954264],"genre_scores_gemma":[0.9019286,0.0013231703,0.083762035,0.0014634809,0.0010080087,0.00019036006,0.00076881953,0.00016710057,0.009388415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956701,0.0011590993,0.00027570958,0.0006894499,0.001704341,0.0005013655],"domain_scores_gemma":[0.9832886,0.008541809,0.0018580843,0.0030796234,0.0020945903,0.001137347],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021766361,0.00063917466,0.0007652919,0.0011668819,0.0014240355,0.003476208,0.001141565,0.001551609,0.006631205],"category_scores_gemma":[0.017244054,0.00034095146,0.00062906,0.001579815,0.005830777,0.009161768,0.0039059287,0.004423991,0.0013643157],"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.00009703802,0.000032875203,0.000565916,0.00006246023,0.000006953309,0.000052330917,0.00015110946,0.0017741357,0.0016990666,0.975921,0.00313796,0.01649916],"study_design_scores_gemma":[0.000014873873,0.00007000348,0.00046462376,0.000026615899,0.000007900546,0.0002955636,0.00009111899,0.011161589,0.0024144386,0.97511363,0.010305725,0.000033800243],"about_ca_topic_score_codex":0.00036785298,"about_ca_topic_score_gemma":0.00039201413,"teacher_disagreement_score":0.9933688,"about_ca_system_score_codex":0.0011407341,"about_ca_system_score_gemma":0.0013884943,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4288734880","doi":"10.1016/j.tcs.2022.07.029","title":"Improved algorithms for non-submodular function maximization problem","year":2022,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"","keywords":"Submodular set function; Cardinality (data modeling); Maximization; Mathematical optimization; Monotone polygon; Mathematics; Constraint (computer-aided design); Function (biology); Greedy algorithm; Set function; Computer science; Set (abstract data type)","score_opus":0.013494570952473108,"score_gpt":0.2375044258966565,"score_spread":0.22400985494418338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288734880","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.0073243435,0.0005524388,0.98540896,0.00041728772,0.00016373552,0.000118096796,0.00016685366,0.00091069075,0.0049376064],"genre_scores_gemma":[0.0940563,0.00042709603,0.8966562,0.00039406688,0.00027159113,0.0004129055,0.00085524394,0.00057983055,0.0063467086],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977683,0.00077824586,0.00011608448,0.00047743245,0.0005718708,0.0002881279],"domain_scores_gemma":[0.9949569,0.0030498086,0.00023760507,0.0009341367,0.0006383827,0.00018327929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026713908,0.0019377392,0.002256943,0.0014690568,0.0009511268,0.0025881135,0.0048081027,0.0023486554,0.013084767],"category_scores_gemma":[0.009698653,0.00090659683,0.0016906415,0.0028131732,0.0010373169,0.005256986,0.0031128856,0.0047077043,0.0029258358],"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.00059735664,0.0007446911,0.0010818919,0.0007180075,0.00017582598,0.00013858243,0.00024975353,0.31616873,0.004347243,0.12579332,0.03504476,0.5149397],"study_design_scores_gemma":[0.00010606624,0.000053171403,0.0002680301,0.000027521342,0.000036778172,0.00006947906,0.00003086583,0.9215988,0.0010227829,0.072897986,0.0038710714,0.00001746699],"about_ca_topic_score_codex":0.0037464437,"about_ca_topic_score_gemma":0.0061225663,"teacher_disagreement_score":0.013084767,"about_ca_system_score_codex":0.002162644,"about_ca_system_score_gemma":0.0028346088,"threshold_uncertainty_score":0.043772936},"labels":[],"label_agreement":null},{"id":"W4296957141","doi":"10.4230/lipics.icalp.2023.15","title":"Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Commission","keywords":"Approximation algorithm; Mathematics; Dual (grammatical number); Discrete mathematics; Function (biology); Combinatorics; Algorithm; Graph; Class (philosophy); Computer science; Artificial intelligence","score_opus":0.06882819582855235,"score_gpt":0.21885638562654103,"score_spread":0.15002818979798868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296957141","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.0065329988,0.00040632527,0.9891454,0.00027024208,0.00007722301,0.000047026013,0.000047189453,0.0003131824,0.0031603181],"genre_scores_gemma":[0.15488794,0.0006488632,0.8389516,0.00030221225,0.0001633701,0.00024773178,0.00026865627,0.00031492166,0.0042146803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979352,0.0008340246,0.00009464717,0.00032521118,0.0005593759,0.0002516013],"domain_scores_gemma":[0.99639904,0.002027638,0.00024343458,0.000764988,0.0004186419,0.00014620952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041981074,0.0019408291,0.0017866615,0.0017616358,0.0006727018,0.0020549255,0.0027572683,0.0013083396,0.003363675],"category_scores_gemma":[0.008620575,0.0009919297,0.0018894764,0.0022469042,0.0015918154,0.0034720264,0.0027563716,0.004952975,0.0014131118],"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.00026768172,0.0002169584,0.000911618,0.00013702984,0.00011139947,0.00007272084,0.0001833725,0.73873794,0.002250573,0.104690336,0.0048244284,0.147596],"study_design_scores_gemma":[0.000023291563,0.000028282684,0.000047135938,0.0000136112785,0.0000113986325,0.000023137936,0.000010191159,0.96776015,0.0006129126,0.029247276,0.002215828,0.0000068043646],"about_ca_topic_score_codex":0.0036845326,"about_ca_topic_score_gemma":0.0029429318,"teacher_disagreement_score":0.0041981074,"about_ca_system_score_codex":0.0020816084,"about_ca_system_score_gemma":0.0021082116,"threshold_uncertainty_score":0.022201955},"labels":[],"label_agreement":null},{"id":"W4297907868","doi":"10.48550/arxiv.1305.1451","title":"Explicit bounds for graph minors","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Combinatorics; Sigma; Mathematics; Disjoint sets; Vertex (graph theory); Graph; Homeomorphism (graph theory); Discrete mathematics; Path (computing); Physics; Computer science; Quantum mechanics","score_opus":0.10544782032158255,"score_gpt":0.19369282895272355,"score_spread":0.088245008631141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297907868","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.3429719,0.0018371927,0.58772826,0.0055695423,0.00030884426,0.00035533318,0.0017079969,0.0051804744,0.054340433],"genre_scores_gemma":[0.80180323,0.00084900204,0.18028507,0.00061857374,0.00023089472,0.00048652713,0.0017450877,0.0017894894,0.012192073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99422187,0.0010135157,0.00031618908,0.0018716484,0.0014510435,0.001125652],"domain_scores_gemma":[0.97137386,0.017040566,0.0017327471,0.0072258683,0.0014358512,0.0011910358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029379325,0.0020528026,0.0017101591,0.002127214,0.002607428,0.0064085014,0.0054874658,0.0027803774,0.014406561],"category_scores_gemma":[0.033044524,0.0013579334,0.0021904474,0.00272127,0.004514237,0.019007044,0.007536569,0.005955847,0.0028185493],"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.0008356297,0.0004162187,0.0082541965,0.0011683841,0.00015022713,0.00035921743,0.0025089772,0.0619224,0.01591887,0.798365,0.013542135,0.09655887],"study_design_scores_gemma":[0.00012114127,0.00017758127,0.0019874063,0.00016768796,0.00021821445,0.0005699942,0.00048392778,0.19575287,0.015773505,0.7631081,0.02153332,0.00010633909],"about_ca_topic_score_codex":0.0014825644,"about_ca_topic_score_gemma":0.0029551405,"teacher_disagreement_score":0.014406561,"about_ca_system_score_codex":0.004736749,"about_ca_system_score_gemma":0.001994499,"threshold_uncertainty_score":0.048194766},"labels":[],"label_agreement":null},{"id":"W4301206442","doi":"10.48550/arxiv.1010.1481","title":"A Simple Deterministic Reduction for the Gap Minimum Distance of Code\\n Problem","year":2010,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Reduction (mathematics); Mathematics; Constant (computer programming); Simple (philosophy); Coding (social sciences); Minimum distance; Code (set theory); Discrete mathematics; Finite field; Combinatorics; Algorithm; Computer science; Statistics; Geometry","score_opus":0.10284293198063879,"score_gpt":0.22271202435021115,"score_spread":0.11986909236957236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301206442","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.07029248,0.0007363663,0.85126466,0.007672063,0.00071354903,0.00050604215,0.0015277048,0.0024296925,0.06485741],"genre_scores_gemma":[0.5919453,0.0006805192,0.37127885,0.0026017956,0.00056696625,0.0010116264,0.0023194274,0.0012467972,0.028348701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968606,0.0007011632,0.0001257699,0.0008744974,0.0009307117,0.0005072788],"domain_scores_gemma":[0.9949582,0.0029311292,0.00020841068,0.001351762,0.00029706114,0.00025339748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001418337,0.001097493,0.0011125624,0.0007527938,0.0020194405,0.0027036462,0.0035050604,0.0023991137,0.009461836],"category_scores_gemma":[0.008575101,0.0006075563,0.0023870764,0.0010514526,0.0024932802,0.004578306,0.006408486,0.0064219325,0.0022162707],"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.00053553603,0.00042062253,0.0009516674,0.00072773814,0.00013053189,0.00027259227,0.00053290714,0.07693967,0.0110243745,0.75693846,0.038495116,0.11303081],"study_design_scores_gemma":[0.00020535763,0.00016728176,0.00051546213,0.00006982871,0.00009299558,0.0003240458,0.000107428314,0.18637998,0.010129707,0.78312683,0.018807031,0.00007408501],"about_ca_topic_score_codex":0.0021598611,"about_ca_topic_score_gemma":0.002881044,"teacher_disagreement_score":0.009461836,"about_ca_system_score_codex":0.002787078,"about_ca_system_score_gemma":0.003616936,"threshold_uncertainty_score":0.031653047},"labels":[],"label_agreement":null},{"id":"W4302588649","doi":"10.48550/arxiv.1409.6365","title":"Lift &amp; Project Systems Performing on the Partial-Vertex-Cover Polytope","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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; University of Waterloo; Canada Research Chairs; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Polytope; Vertex cover; Mathematics; Cover (algebra); Lift (data mining); Approximation algorithm; Relaxation (psychology); Linear programming relaxation; Theory of computation; Discrete mathematics; Graph; Linear programming; Mathematical optimization; Computer science; Algorithm","score_opus":0.13041956807151922,"score_gpt":0.2075711145987895,"score_spread":0.07715154652727027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302588649","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.17178509,0.00067818485,0.7856527,0.0016976295,0.00015036076,0.00032204043,0.0005210984,0.0010224774,0.038170394],"genre_scores_gemma":[0.73878616,0.00067665306,0.24744682,0.0005262816,0.000166579,0.0005618729,0.0012989372,0.00043594214,0.010100801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810046,0.00045191968,0.000065762484,0.00037490635,0.00050703814,0.000500011],"domain_scores_gemma":[0.99465734,0.0033413845,0.00042521203,0.0007167086,0.00034414107,0.0005152009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003014174,0.0018222296,0.0016367034,0.0010679745,0.0011485454,0.0028220937,0.00263488,0.001421313,0.010773158],"category_scores_gemma":[0.014454903,0.00069027435,0.0020483306,0.0012345344,0.0020842627,0.00396506,0.0065513607,0.005654903,0.0012228289],"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.0005118595,0.00022431288,0.0018029951,0.0003945733,0.00006918214,0.00015661652,0.00038438317,0.6067974,0.00278049,0.3153246,0.007050305,0.064503275],"study_design_scores_gemma":[0.000028112676,0.00010530293,0.00013591636,0.000029630417,0.000014350886,0.000049264483,0.000062174135,0.9112246,0.0012469497,0.085530706,0.0015626089,0.000010371372],"about_ca_topic_score_codex":0.0028259486,"about_ca_topic_score_gemma":0.0024213146,"teacher_disagreement_score":0.010773158,"about_ca_system_score_codex":0.002713843,"about_ca_system_score_gemma":0.002032034,"threshold_uncertainty_score":0.03603977},"labels":[],"label_agreement":null},{"id":"W4312949591","doi":"10.1109/tac.2022.3226713","title":"Submodular Maximization With Limited Function Access","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Complexity and Algorithms in Graphs","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","keywords":"Submodular set function; Pairwise comparison; Function (biology); Maximization; Notation; Mathematics; Computer science; Combinatorics; Discrete mathematics; Algorithm; Mathematical optimization; Artificial intelligence","score_opus":0.016951647863755085,"score_gpt":0.22667549728313635,"score_spread":0.20972384941938127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312949591","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.045859452,0.001277006,0.9452966,0.001172868,0.000052701947,0.000158306,0.00043953385,0.00073732,0.005006289],"genre_scores_gemma":[0.706748,0.0008834808,0.28546223,0.00068472757,0.00017791173,0.00048865745,0.0007072809,0.00024703142,0.0046005985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996476,0.002030624,0.00010685263,0.00064972584,0.000435156,0.00030158332],"domain_scores_gemma":[0.98730356,0.010191506,0.0006953274,0.0010814315,0.00041983667,0.00030828806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005621854,0.0023101873,0.00335643,0.000717791,0.00060232024,0.001957355,0.00254827,0.0022611097,0.0037724392],"category_scores_gemma":[0.01819194,0.0008402302,0.0011019795,0.001970917,0.0016073266,0.0043320325,0.002268834,0.002831719,0.0009767839],"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.00060969766,0.0002749412,0.000903235,0.00039996047,0.00016262705,0.00016967562,0.00012817672,0.8457605,0.002104976,0.07936212,0.005147831,0.0649762],"study_design_scores_gemma":[0.000037239013,0.00007949787,0.00012021783,0.000015606896,0.000011552335,0.000033601376,0.000012888767,0.9464749,0.00070175796,0.052017037,0.00048452828,0.000011256329],"about_ca_topic_score_codex":0.0018122075,"about_ca_topic_score_gemma":0.0018144941,"teacher_disagreement_score":0.005621854,"about_ca_system_score_codex":0.0019009137,"about_ca_system_score_gemma":0.0020651086,"threshold_uncertainty_score":0.029731572},"labels":[],"label_agreement":null},{"id":"W4313227384","doi":"10.1109/focs54457.2022.00111","title":"Separations in Proof Complexity and TFNP","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Unary operation; Mathematical proof; Resolution (logic); Oracle; Combinatorics; Computer science; Discrete mathematics; Algorithm; Mathematics; Theoretical computer science; Artificial intelligence; Programming language","score_opus":0.025926062884421137,"score_gpt":0.28530665950310496,"score_spread":0.25938059661868385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313227384","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.09990442,0.0037572142,0.7704449,0.008971136,0.0002856618,0.00015111876,0.0008819292,0.0022233333,0.11338042],"genre_scores_gemma":[0.8160172,0.002098033,0.16169278,0.000898972,0.00047824244,0.00030238062,0.0011163395,0.0004531701,0.016942943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99372935,0.0022940894,0.00041338193,0.001303049,0.0016393586,0.0006206823],"domain_scores_gemma":[0.97714067,0.017985182,0.0008894505,0.0022761899,0.0010999279,0.00060854544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029890041,0.0005846173,0.000750492,0.0014259381,0.0012921817,0.004864441,0.0018483696,0.0014772894,0.016183266],"category_scores_gemma":[0.022556776,0.0007157759,0.0017422389,0.0018545045,0.0048449705,0.012647235,0.0037365027,0.0049160775,0.0016296803],"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.00007012531,0.00002178869,0.00034573587,0.00012455847,0.000014085125,0.000055229702,0.00019428234,0.006809661,0.0003607999,0.96934223,0.0018614295,0.02080008],"study_design_scores_gemma":[0.000023009103,0.000021630083,0.00018949555,0.000031949116,0.0000116597785,0.0001183431,0.000052401818,0.022766782,0.00072579406,0.9675839,0.008459725,0.000015275897],"about_ca_topic_score_codex":0.002758273,"about_ca_topic_score_gemma":0.001318688,"teacher_disagreement_score":0.016183266,"about_ca_system_score_codex":0.0042398493,"about_ca_system_score_gemma":0.0020493409,"threshold_uncertainty_score":0.054138362},"labels":[],"label_agreement":null},{"id":"W4313227811","doi":"10.1109/focs54457.2022.00065","title":"Randomised Composition and Small-Bias Minimax","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Bounded function; Omega; Combinatorics; Measure (data warehouse); Composition (language); Minimax; Mathematics; Discrete mathematics; Computer science; Physics; Mathematical economics; Philosophy; Data mining; Mathematical analysis","score_opus":0.024539535215569456,"score_gpt":0.25784443180688893,"score_spread":0.23330489659131948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313227811","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.09573705,0.0008939563,0.870202,0.0056702606,0.00022466773,0.00028640014,0.0004423164,0.0014237433,0.025119487],"genre_scores_gemma":[0.8154109,0.00049187476,0.16283605,0.0021913368,0.00057909713,0.0010192124,0.0005421955,0.00075152516,0.01617783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98776233,0.004441341,0.00046303583,0.002774815,0.0030140174,0.0015445298],"domain_scores_gemma":[0.94883096,0.038802445,0.0028516112,0.0056899996,0.0020534783,0.0017715287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009673039,0.0017949893,0.0025459998,0.0013109759,0.0021361834,0.003949154,0.0034318701,0.002847431,0.012497465],"category_scores_gemma":[0.05140085,0.0009775716,0.002689901,0.0015927318,0.0056818402,0.011461993,0.008507964,0.0076632197,0.0018971764],"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.00069146865,0.0001864806,0.0012999593,0.0003029111,0.00010984427,0.00012620953,0.00038559336,0.07738051,0.005265689,0.8907619,0.0036075008,0.019881867],"study_design_scores_gemma":[0.000111992114,0.00017422719,0.0003366794,0.000038376507,0.00003932421,0.00011450523,0.00004086335,0.30075684,0.0047735316,0.69117993,0.0023887937,0.00004485843],"about_ca_topic_score_codex":0.0008879056,"about_ca_topic_score_gemma":0.00097445044,"teacher_disagreement_score":0.012497465,"about_ca_system_score_codex":0.0046439767,"about_ca_system_score_gemma":0.0034604673,"threshold_uncertainty_score":0.05115658},"labels":[],"label_agreement":null},{"id":"W4313343183","doi":"10.1007/978-3-031-22105-7_40","title":"Two-Stage BP Maximization Under p-matroid Constraint","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"","keywords":"Submodular set function; Matroid; Parameterized complexity; Maximization; Constraint (computer-aided design); Mathematics; Monotonic function; Combinatorics; Function (biology); Mathematical optimization; Discrete mathematics; Mathematical analysis","score_opus":0.024827609823504546,"score_gpt":0.2528371644592893,"score_spread":0.22800955463578473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313343183","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.014338861,0.00029857957,0.96809155,0.00056965434,0.000096842654,0.00013320832,0.00036827798,0.00054015475,0.01556289],"genre_scores_gemma":[0.32938313,0.00049346295,0.634054,0.0004194869,0.000296307,0.00038573876,0.0009093475,0.00074334274,0.033315152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878377,0.00035581813,0.000049041013,0.00029657624,0.0002587297,0.0002560766],"domain_scores_gemma":[0.9983297,0.00089630135,0.000075221156,0.00029497748,0.00025178553,0.00015203902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001400755,0.0011291153,0.0016962247,0.00059112976,0.0008114877,0.0018579918,0.0031964383,0.002107642,0.00944846],"category_scores_gemma":[0.0038132912,0.0010668102,0.001237216,0.0016345693,0.0008582388,0.0035030374,0.002816968,0.0022461785,0.0021371453],"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.0011396736,0.0005256927,0.0012741106,0.0013620025,0.00021695273,0.00084855413,0.00043840075,0.28484726,0.03922759,0.33664897,0.037326816,0.296144],"study_design_scores_gemma":[0.00006118982,0.000103395636,0.00041501204,0.000031582793,0.0000428336,0.00025212235,0.000041725565,0.8307702,0.0077751814,0.15625161,0.004223316,0.00003175258],"about_ca_topic_score_codex":0.00212087,"about_ca_topic_score_gemma":0.0029432701,"teacher_disagreement_score":0.00944846,"about_ca_system_score_codex":0.0010979135,"about_ca_system_score_gemma":0.00202244,"threshold_uncertainty_score":0.031608284},"labels":[],"label_agreement":null},{"id":"W4313351104","doi":"10.1007/978-3-031-22105-7_1","title":"A Stochastic Non-monotone DR-Submodular Maximization Problem over a Convex Set","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"","keywords":"Submodular set function; Monotone polygon; Combinatorics; Regular polygon; Mathematics; Oracle; Maximization; Function (biology); Constraint (computer-aided design); Order (exchange); Discrete mathematics; Set (abstract data type); Set function; Convex function; Stochastic ordering; Mathematical optimization; Applied mathematics; Computer science","score_opus":0.016908042043018292,"score_gpt":0.2398259652213626,"score_spread":0.2229179231783443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313351104","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.04206838,0.0012444963,0.92383915,0.0039538625,0.00022331004,0.00021591007,0.0012199718,0.0002973748,0.026937459],"genre_scores_gemma":[0.6599344,0.0019590107,0.29335743,0.0012134709,0.00077040866,0.00058816327,0.0014608143,0.00048078937,0.040235482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984113,0.0007255547,0.000053614658,0.00043818852,0.0002357646,0.00013559457],"domain_scores_gemma":[0.99693453,0.002277939,0.00020827095,0.0001491684,0.00019705163,0.00023311119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027785972,0.001302036,0.0022716378,0.00060048257,0.0005454892,0.0022751573,0.002135592,0.0029217463,0.0072605745],"category_scores_gemma":[0.0065698833,0.0008937764,0.0012108744,0.0015361704,0.0013076918,0.0028392812,0.0020042497,0.0028808864,0.00071521645],"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.00028383895,0.00026477638,0.0005775245,0.0007622988,0.00018037685,0.0004129444,0.00014824049,0.51286286,0.0041064587,0.4089292,0.018664004,0.052807458],"study_design_scores_gemma":[0.00005164014,0.000100332785,0.00024162277,0.00003987147,0.00002131298,0.00015227162,0.000038735077,0.838943,0.00047843164,0.15668279,0.0032298558,0.000020180149],"about_ca_topic_score_codex":0.0015456018,"about_ca_topic_score_gemma":0.0014607906,"teacher_disagreement_score":0.0072605745,"about_ca_system_score_codex":0.002084336,"about_ca_system_score_gemma":0.0017341536,"threshold_uncertainty_score":0.024289012},"labels":[],"label_agreement":null},{"id":"W4313457405","doi":"10.21203/rs.3.rs-2170035/v1","title":"A Randomized Algorithm for Finding Local Maximum Cuts","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Complexity and Algorithms in Graphs","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":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Algorithm; Computer science; Randomized algorithm; Mathematical optimization; Mathematics","score_opus":0.17055799200511046,"score_gpt":0.42335887962679336,"score_spread":0.2528008876216829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313457405","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.00380135,0.00009635683,0.9938446,0.00007632259,0.000035992598,0.00009979092,0.000049062426,0.0005460452,0.0014504114],"genre_scores_gemma":[0.07424759,0.0000749269,0.9229943,0.00009773401,0.00003905997,0.0002993003,0.00026302936,0.00019395012,0.0017900764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969241,0.0010145608,0.00016503959,0.0007270078,0.00089813344,0.00027120297],"domain_scores_gemma":[0.9968167,0.001803286,0.00031616952,0.00036860182,0.00059426355,0.00010096406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020942271,0.0010555806,0.0014104055,0.0019313801,0.00091298646,0.0015567562,0.0025827105,0.0014564077,0.00931689],"category_scores_gemma":[0.0069961194,0.0006563572,0.0010075911,0.0017216164,0.0010228022,0.0018419938,0.0014810086,0.0019461911,0.0015791233],"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.00054534763,0.00029659062,0.00060351426,0.00032461938,0.00011578889,0.00014316084,0.00013875122,0.51248497,0.01055125,0.064444326,0.008701125,0.4016505],"study_design_scores_gemma":[0.00014769603,0.000089105204,0.00012625223,0.00002435982,0.000019424344,0.000085339,0.000028423865,0.969437,0.0029133211,0.02338867,0.0037225096,0.000017946877],"about_ca_topic_score_codex":0.0031596767,"about_ca_topic_score_gemma":0.0034855236,"teacher_disagreement_score":0.00931689,"about_ca_system_score_codex":0.0017585894,"about_ca_system_score_gemma":0.0021127106,"threshold_uncertainty_score":0.031168103},"labels":[],"label_agreement":null},{"id":"W4315471891","doi":"10.1109/cdc51059.2022.9992771","title":"A Programming Approach for Worst-case Studies in Distributed Submodular Maximization","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 61st Conference on Decision and Control (CDC)","topic":"Complexity and Algorithms in Graphs","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":"Submodular set function; Computer science; Maximization; Mathematical optimization; Mathematics","score_opus":0.08175591008355151,"score_gpt":0.31350981465584,"score_spread":0.23175390457228848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315471891","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.00040056673,0.000065173255,0.9974654,0.00015057971,0.000018869328,0.000039637544,0.000021827933,0.00003343614,0.0018044905],"genre_scores_gemma":[0.08793234,0.00069582043,0.9040404,0.0005503493,0.00034888557,0.0012623604,0.00018216993,0.00035637766,0.0046313084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927428,0.0043603554,0.0002604941,0.00078021124,0.0013953244,0.00046091],"domain_scores_gemma":[0.9833024,0.013330476,0.00088809343,0.00095757487,0.0011789318,0.00034250744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011533383,0.003941745,0.0020046073,0.0024568918,0.0011571121,0.0035666535,0.0040692836,0.0023861136,0.0074323327],"category_scores_gemma":[0.029399086,0.0016109984,0.0032176417,0.0035406507,0.0033870765,0.005542469,0.003183812,0.007880061,0.0010844149],"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.000070592476,0.00020914683,0.00037885198,0.0002858979,0.00012218114,0.00015883929,0.00023590695,0.5442489,0.0017077558,0.41464648,0.0051210965,0.032814376],"study_design_scores_gemma":[0.000018467283,0.00007084906,0.000058478392,0.0000551214,0.000026370168,0.000057341244,0.000045976223,0.81354076,0.0006847857,0.18201022,0.003411055,0.000020509002],"about_ca_topic_score_codex":0.0023986925,"about_ca_topic_score_gemma":0.0022614617,"teacher_disagreement_score":0.011533383,"about_ca_system_score_codex":0.0030943498,"about_ca_system_score_gemma":0.0027053773,"threshold_uncertainty_score":0.060995042},"labels":[],"label_agreement":null},{"id":"W4315472114","doi":"10.1109/cdc51059.2022.9993409","title":"Optimistic Greedy Strategies for Partially Known Submodular Functions","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 61st Conference on Decision and Control (CDC)","topic":"Complexity and Algorithms in Graphs","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":"Submodular set function; Set function; Greedy algorithm; Function (biology); Set (abstract data type); Maximization; Mathematical optimization; Entropy (arrow of time); Computer science; Mathematics","score_opus":0.04157984328601584,"score_gpt":0.26978825440398185,"score_spread":0.22820841111796603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315472114","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.062024165,0.0011045041,0.93066657,0.0007192414,0.000052195297,0.00014827523,0.00017343517,0.00039419168,0.004717414],"genre_scores_gemma":[0.79123616,0.0005800115,0.20464392,0.00032871033,0.0000683964,0.0002657736,0.00022732561,0.00009565378,0.0025540974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976683,0.0012913217,0.00008795377,0.00029068638,0.0004049309,0.00025672856],"domain_scores_gemma":[0.99323624,0.005234004,0.00045386684,0.0005302376,0.0002667545,0.00027889007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042660907,0.00148496,0.0018092764,0.0009305891,0.00067017064,0.0016801376,0.0020710602,0.0014071125,0.002236546],"category_scores_gemma":[0.011268093,0.00073046156,0.00080044434,0.0012852302,0.0014330702,0.0024917806,0.0019736672,0.0015903285,0.00041876055],"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.0005753134,0.00013148387,0.0007331054,0.00016634804,0.00011851895,0.000114191265,0.00018882484,0.87065655,0.0019627346,0.077830665,0.0027437103,0.044778526],"study_design_scores_gemma":[0.000041227715,0.000068115514,0.000083151645,0.000020381462,0.00001134356,0.000028426308,0.000026275777,0.9646001,0.00054161064,0.034116704,0.00045272493,0.0000099598055],"about_ca_topic_score_codex":0.0016847709,"about_ca_topic_score_gemma":0.0024209598,"teacher_disagreement_score":0.0042660907,"about_ca_system_score_codex":0.0021120661,"about_ca_system_score_gemma":0.0017204202,"threshold_uncertainty_score":0.02256155},"labels":[],"label_agreement":null},{"id":"W4315641735","doi":"10.1007/s10878-022-00978-4","title":"Two approximation algorithms for maximizing nonnegative weakly monotonic set functions","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Mathematics; Monotone polygon; Approximation algorithm; Monotonic function; Combinatorics; Greedy algorithm; Theory of computation; Maximization; Set function; Set (abstract data type); Discrete mathematics; Function (biology); Mathematical optimization; Algorithm; Computer science; Mathematical analysis","score_opus":0.03909375940252006,"score_gpt":0.2958453431144178,"score_spread":0.2567515837118977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315641735","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.019239368,0.00076835876,0.9730179,0.0011025999,0.00017434543,0.00017701296,0.00013969744,0.00042923936,0.004951491],"genre_scores_gemma":[0.22984791,0.0008140805,0.7582572,0.00058624835,0.00033346866,0.0005934726,0.0005495253,0.00036088415,0.008657227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956285,0.0020488894,0.00022367031,0.0006709441,0.00088956207,0.00053843745],"domain_scores_gemma":[0.98877525,0.0074796556,0.0005627464,0.0014275009,0.0010821798,0.0006727043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007313938,0.0030145424,0.003567094,0.0024018784,0.0013281027,0.004847298,0.007390582,0.0051543075,0.0051678973],"category_scores_gemma":[0.02894962,0.0016290142,0.0030232454,0.003882228,0.0026008477,0.0071060914,0.005832007,0.00602922,0.0010731494],"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.0013063452,0.00062024506,0.0021184713,0.000519129,0.00020280431,0.00013079583,0.0005745549,0.2968599,0.0032567626,0.36916405,0.014538828,0.3107081],"study_design_scores_gemma":[0.0001225201,0.00012033943,0.00027780238,0.00005578783,0.00006834511,0.000104262166,0.00006904346,0.8749598,0.0012165426,0.121077105,0.0018943364,0.000034067663],"about_ca_topic_score_codex":0.0026019996,"about_ca_topic_score_gemma":0.0031070344,"teacher_disagreement_score":0.007390582,"about_ca_system_score_codex":0.0048704697,"about_ca_system_score_gemma":0.0036241726,"threshold_uncertainty_score":0.038680255},"labels":[],"label_agreement":null},{"id":"W4318303117","doi":"10.1142/s0129054122460029","title":"Graph Algorithm Based Submodular Function for Sparsest Cut Problem","year":2023,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Complexity and Algorithms in Graphs","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":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Submodular set function; Mathematics; Minimum cut; Combinatorics; Subroutine; Graph partition; Maximum flow problem; Maximum cut; Partition (number theory); Graph; Weight function; Cut; Discrete mathematics; Minimum weight; Algorithm; Segmentation; Computer science; Image segmentation; Artificial intelligence","score_opus":0.03254517234860851,"score_gpt":0.3020471426313973,"score_spread":0.2695019702827888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318303117","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.03453886,0.0005762354,0.95778483,0.000619525,0.000069586145,0.0001701824,0.00030523533,0.0005792564,0.00535635],"genre_scores_gemma":[0.40104276,0.00092040235,0.58842427,0.0006316582,0.00013521827,0.0006755252,0.0014778938,0.00036774264,0.0063245515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904186,0.0003493049,0.00003215473,0.0002530635,0.00017553737,0.00014802211],"domain_scores_gemma":[0.99844956,0.0010035346,0.00012144159,0.00013709225,0.00018550473,0.000102765225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015479856,0.0014278126,0.0019254212,0.0011085822,0.00081726164,0.0015525639,0.0018752598,0.0016605875,0.0043999143],"category_scores_gemma":[0.003993312,0.0004006743,0.0009730092,0.0020326057,0.0010662839,0.0032662305,0.0017569319,0.0022864137,0.00079894235],"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.00026996745,0.00037864345,0.0010989936,0.0004840476,0.000084758736,0.00012967302,0.0002349317,0.65055126,0.0047904495,0.10422531,0.018492455,0.21925952],"study_design_scores_gemma":[0.00004025917,0.00010148013,0.0001611854,0.000018757173,0.000014644324,0.0000827636,0.0000499042,0.9236578,0.00087657885,0.07296831,0.002016365,0.000012105795],"about_ca_topic_score_codex":0.0019903062,"about_ca_topic_score_gemma":0.0019824717,"teacher_disagreement_score":0.0043999143,"about_ca_system_score_codex":0.0014065425,"about_ca_system_score_gemma":0.0019115884,"threshold_uncertainty_score":0.014719188},"labels":[],"label_agreement":null},{"id":"W4320487114","doi":"10.1137/18m1233418","title":"Inapproximability of Matrix \\(\\boldsymbol{p \\rightarrow q}\\) Norms","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Mathematics; Combinatorics; Hardness of approximation; Approximation algorithm; Exponential time hypothesis; Matrix (chemical analysis); Norm (philosophy); Matrix norm; Exponential function; Constant (computer programming); Discrete mathematics; Time complexity; Computer science; Physics; Eigenvalues and eigenvectors; Quantum mechanics; Mathematical analysis","score_opus":0.023548463633614986,"score_gpt":0.2929863234056024,"score_spread":0.2694378597719874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320487114","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.26851597,0.006836442,0.66630954,0.012854038,0.0009994693,0.00028389142,0.002594655,0.002481051,0.03912494],"genre_scores_gemma":[0.81679726,0.0019094197,0.15680648,0.0021518075,0.0013048192,0.00048673767,0.0034021533,0.0007209141,0.01642041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946786,0.001966302,0.00023267999,0.0012999239,0.0011216126,0.0007009217],"domain_scores_gemma":[0.9720044,0.022247154,0.0018082311,0.0014808953,0.0015640701,0.0008952679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004160213,0.0020844473,0.0018236717,0.001057286,0.001168576,0.004769187,0.0034112823,0.0030510908,0.0065402],"category_scores_gemma":[0.029404044,0.0006571618,0.0013751063,0.0019604603,0.0036054149,0.0072450726,0.0034311314,0.0051078205,0.0021185502],"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.0013190117,0.00058095437,0.0027908445,0.0013485466,0.000259856,0.00033498774,0.0006707001,0.22959612,0.0040774075,0.6140524,0.041285682,0.103683606],"study_design_scores_gemma":[0.00010376144,0.00016192035,0.00021461766,0.00007571704,0.00003144596,0.00018349379,0.00012791499,0.43697912,0.0027351922,0.55641615,0.0029388168,0.00003184022],"about_ca_topic_score_codex":0.0018174318,"about_ca_topic_score_gemma":0.0015234773,"teacher_disagreement_score":0.0065402,"about_ca_system_score_codex":0.002291859,"about_ca_system_score_gemma":0.002134882,"threshold_uncertainty_score":0.022001565},"labels":[],"label_agreement":null},{"id":"W4360610866","doi":"10.1142/s0217595923400122","title":"Minimization Problems with Non-Submodular Cover Constraint","year":2023,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Cover (algebra); Constraint (computer-aided design); Set function; Set cover problem; Mathematics; Greedy algorithm; Set (abstract data type); Mathematical optimization; Covering problems; Function (biology); Computer science","score_opus":0.06893791714868018,"score_gpt":0.33205864503315735,"score_spread":0.26312072788447716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360610866","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.0446072,0.0035676027,0.93112123,0.0022357926,0.00026822285,0.0001806098,0.00062772946,0.00027690767,0.017114848],"genre_scores_gemma":[0.59310734,0.0048381896,0.38264105,0.0008508421,0.0008034516,0.0005801544,0.0014619323,0.00034303064,0.015373949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986827,0.00045185848,0.000053036994,0.00030900334,0.00031555982,0.00018781885],"domain_scores_gemma":[0.99774253,0.0017045244,0.00018032645,0.00013903421,0.00013259689,0.00010102161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014060308,0.0015601915,0.0019777007,0.00074015395,0.0005578833,0.0018893419,0.0016327734,0.0018680611,0.0048266836],"category_scores_gemma":[0.004798183,0.0004976485,0.0013733023,0.0018564316,0.00086436066,0.0030731673,0.0015944594,0.002165109,0.00066574826],"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.0002243816,0.00036385073,0.001165151,0.00095096,0.00022703856,0.0005316537,0.00018081268,0.58209884,0.0037554386,0.26256818,0.019331275,0.12860247],"study_design_scores_gemma":[0.00005107689,0.00010839131,0.0004797473,0.00006763292,0.000047949634,0.00036303562,0.00008952569,0.7987909,0.0014300068,0.1915686,0.0069804415,0.000022678421],"about_ca_topic_score_codex":0.0012573615,"about_ca_topic_score_gemma":0.0012502337,"teacher_disagreement_score":0.0048266836,"about_ca_system_score_codex":0.0013218505,"about_ca_system_score_gemma":0.0010624299,"threshold_uncertainty_score":0.016146898},"labels":[],"label_agreement":null},{"id":"W4360985546","doi":"10.1007/s40305-023-00469-1","title":"Maximizing the Ratio of Monotone DR-Submodular Functions on Integer Lattice","year":2023,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Monotone polygon; Mathematics; Combinatorics; Integer (computer science); Lattice (music); Discrete mathematics; Integer lattice; Half-integer; Computer science; Physics","score_opus":0.08786346303967044,"score_gpt":0.35909603442660903,"score_spread":0.27123257138693857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360985546","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.34764585,0.0033359742,0.5833511,0.0029923636,0.00024348144,0.00035511513,0.0013236664,0.0016823557,0.05907012],"genre_scores_gemma":[0.85507315,0.0013981905,0.13420743,0.0004572086,0.00024129402,0.00032591738,0.00053410116,0.000445214,0.0073175915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960108,0.0021718906,0.000098865734,0.00051208684,0.00063664507,0.0005697336],"domain_scores_gemma":[0.9899682,0.007390787,0.0006505791,0.0007004727,0.0005708832,0.0007191477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045602918,0.0020477974,0.0029910835,0.0018825738,0.0007852329,0.004087437,0.0031930292,0.001796403,0.0062871845],"category_scores_gemma":[0.022190042,0.000902555,0.0009361066,0.002347295,0.0015276689,0.005494736,0.002279223,0.0022218789,0.0009783198],"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.0020055769,0.00064336834,0.0021134238,0.0011112719,0.0002000961,0.00031567033,0.0002776384,0.31628796,0.011418898,0.5133827,0.018103994,0.13413945],"study_design_scores_gemma":[0.00012297927,0.0003169695,0.0003691323,0.000066410386,0.000048130034,0.0002984661,0.000120175035,0.77709484,0.002290206,0.21676755,0.0024656272,0.000039428138],"about_ca_topic_score_codex":0.000939845,"about_ca_topic_score_gemma":0.00089340605,"teacher_disagreement_score":0.0062871845,"about_ca_system_score_codex":0.0028664854,"about_ca_system_score_gemma":0.0016645866,"threshold_uncertainty_score":0.02411741},"labels":[],"label_agreement":null},{"id":"W4366282323","doi":"10.4230/lipics.esa.2023.84","title":"Approximation Algorithms for the Airport and Railway Problem","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"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; European Commission; Bhabha Atomic Research Centre; Villum Fonden; National Science Foundation","keywords":"Treewidth; Combinatorics; Mathematics; Multiplicative function; Logarithm; Planar graph; Inverse; Embedding; Graph; Discrete mathematics; Pathwidth; Line graph; Computer science; Geometry","score_opus":0.15203343678785233,"score_gpt":0.2170879876616281,"score_spread":0.06505455087377576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366282323","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.029259257,0.0048549236,0.93364406,0.0029477589,0.0004778342,0.0003570876,0.0013499524,0.0029184332,0.024190787],"genre_scores_gemma":[0.3092428,0.0034412614,0.6664431,0.0016784793,0.00053508667,0.0007059495,0.004704075,0.0011176461,0.012131558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99688524,0.00086668093,0.00015783071,0.0007661416,0.0005997269,0.00072432414],"domain_scores_gemma":[0.9955706,0.002873007,0.0003378919,0.00069158233,0.00034043554,0.00018654684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023129212,0.0028274057,0.0024146228,0.0015434303,0.0012778151,0.003020958,0.004156364,0.0031534275,0.014024474],"category_scores_gemma":[0.01138647,0.00084859814,0.0023042734,0.0034583255,0.0010442133,0.0053540017,0.0023190824,0.004589433,0.0031628474],"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.00097493426,0.00069258903,0.001892627,0.0009368464,0.00026095856,0.00020711495,0.00033435726,0.6360549,0.0019085229,0.09807129,0.04640439,0.21226147],"study_design_scores_gemma":[0.00015928726,0.00009779919,0.0003083268,0.00007497216,0.000061755745,0.00021744327,0.00013644522,0.8972806,0.00057612784,0.09223711,0.008827235,0.00002294466],"about_ca_topic_score_codex":0.006993095,"about_ca_topic_score_gemma":0.009716383,"teacher_disagreement_score":0.014024474,"about_ca_system_score_codex":0.0036423944,"about_ca_system_score_gemma":0.0030490784,"threshold_uncertainty_score":0.046916485},"labels":[],"label_agreement":null},{"id":"W4367050013","doi":"10.1007/s10107-023-01961-5","title":"Approximation algorithms for flexible graph connectivity","year":2023,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":8,"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; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Virginia; National Science Foundation","keywords":"Approximation algorithm; Mathematics; Combinatorics; Partition (number theory); Graph; Undirected graph; Algorithm; Efficient algorithm; Discrete mathematics","score_opus":0.07737915461578086,"score_gpt":0.3207735815701585,"score_spread":0.24339442695437763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367050013","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.029838065,0.0008614264,0.95638883,0.0017184675,0.00012557939,0.00012122292,0.00041569708,0.0006352675,0.009895428],"genre_scores_gemma":[0.5271165,0.0017237292,0.45693663,0.0007109176,0.00048732889,0.00052322604,0.0016287033,0.00068084983,0.010192186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787354,0.0006237122,0.000089973066,0.0005227156,0.0005798659,0.0003101927],"domain_scores_gemma":[0.9856523,0.0104769245,0.000798951,0.0020102013,0.0005706693,0.0004909216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025300991,0.0016885671,0.002379201,0.0023872594,0.0014133172,0.0042050024,0.0056985645,0.0027049053,0.010120317],"category_scores_gemma":[0.025513627,0.0013434573,0.002037754,0.005257165,0.002528783,0.011771661,0.0043068635,0.006062068,0.0011389999],"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.0002541336,0.0002537881,0.0012157777,0.0003300654,0.000094123054,0.00011152177,0.00036508893,0.38055173,0.0008808668,0.5114534,0.014941789,0.089547694],"study_design_scores_gemma":[0.000041950676,0.000022528751,0.00013513668,0.000027703887,0.000027344386,0.00005343095,0.00006071971,0.57212734,0.00027733773,0.42536297,0.0018529084,0.000010625664],"about_ca_topic_score_codex":0.0035239274,"about_ca_topic_score_gemma":0.0045998027,"teacher_disagreement_score":0.010120317,"about_ca_system_score_codex":0.003475751,"about_ca_system_score_gemma":0.0018309025,"threshold_uncertainty_score":0.033855796},"labels":[],"label_agreement":null},{"id":"W4367369757","doi":"10.1145/3558481.3591101","title":"A Simple and Efficient Parallel Laplacian Solver","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Binary logarithm; Combinatorics; Cholesky decomposition; Factorization; Simple (philosophy); Laplacian matrix; Mathematics; Laplace operator; Diagonal; Upper and lower bounds; Log-log plot; Discrete mathematics; Graph; Computer science; Eigenvalues and eigenvectors; Algorithm; Physics; Mathematical analysis; Mathematical optimization; Geometry","score_opus":0.0479539260316339,"score_gpt":0.27860579142161734,"score_spread":0.23065186538998345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367369757","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.009712403,0.00022059258,0.95487964,0.0008816738,0.00025036707,0.00015478396,0.0006957972,0.0067017754,0.026503015],"genre_scores_gemma":[0.18339536,0.00027891903,0.7742881,0.0006446627,0.00026146704,0.0003386713,0.0017382546,0.0016543115,0.037400268],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947494,0.000044829947,0.000028366265,0.0001363444,0.00022574776,0.00008974062],"domain_scores_gemma":[0.999587,0.000085808366,0.000020961632,0.00010618893,0.00014695959,0.000053063657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028830805,0.0010970607,0.0008594749,0.0005473199,0.0008226117,0.0012377605,0.0017807363,0.0011842682,0.029395785],"category_scores_gemma":[0.0019330296,0.00044229647,0.00062506483,0.0009770548,0.00051924994,0.0016945451,0.0025322938,0.00142604,0.009788229],"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.0004255222,0.0003151134,0.0010709646,0.0004603533,0.00010203595,0.00077337277,0.0002582577,0.1947371,0.030599587,0.15937689,0.12157754,0.4903033],"study_design_scores_gemma":[0.00015273206,0.000049056303,0.00011911096,0.000017515602,0.000016405937,0.00034298544,0.00006896521,0.85794723,0.006667561,0.10974768,0.024846034,0.000024737308],"about_ca_topic_score_codex":0.0022533038,"about_ca_topic_score_gemma":0.005652107,"teacher_disagreement_score":0.029395785,"about_ca_system_score_codex":0.00055736,"about_ca_system_score_gemma":0.0017488485,"threshold_uncertainty_score":0.09833872},"labels":[],"label_agreement":null},{"id":"W4367397470","doi":"10.1016/j.parco.2023.103024","title":"A lightweight semi-centralized strategy for the massive parallelization of branching algorithms","year":2023,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Computer science; Programmer; Vertex cover; Bounded function; Algorithm; Branching (polymer chemistry); Parallel computing; Vertex (graph theory); Theoretical computer science; Graph; Approximation algorithm; Mathematics; Programming language","score_opus":0.05154537697838242,"score_gpt":0.30494632123818965,"score_spread":0.25340094425980725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367397470","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.012422202,0.00014718069,0.979081,0.00028361185,0.00009502871,0.000100986916,0.00008494946,0.0036205372,0.004164591],"genre_scores_gemma":[0.36176476,0.0001649858,0.6299503,0.00030772566,0.00023031107,0.00045689658,0.0004143639,0.0008990485,0.005811573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975988,0.00063307816,0.00013133412,0.00044277965,0.00087201124,0.00032199497],"domain_scores_gemma":[0.99495304,0.0011599746,0.00025868812,0.0024788287,0.0007088065,0.0004406556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017798964,0.0009875073,0.0014611997,0.0011069614,0.0015360732,0.0021758636,0.003417651,0.0009034149,0.006993963],"category_scores_gemma":[0.006548,0.00064841955,0.00083271717,0.0016106403,0.001443767,0.002679999,0.004385677,0.0023414474,0.0033192288],"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.0021771076,0.00073479797,0.0019465834,0.00045918894,0.0001859397,0.00034825513,0.0005189442,0.14920023,0.09675451,0.21732719,0.032813873,0.49753338],"study_design_scores_gemma":[0.00019377934,0.00015894708,0.0003655302,0.000021616646,0.00004595426,0.000107013075,0.00005723902,0.87922037,0.015239098,0.09918648,0.005365611,0.00003832134],"about_ca_topic_score_codex":0.0020535502,"about_ca_topic_score_gemma":0.004221062,"teacher_disagreement_score":0.006993963,"about_ca_system_score_codex":0.0012370634,"about_ca_system_score_gemma":0.0034272203,"threshold_uncertainty_score":0.023397088},"labels":[],"label_agreement":null},{"id":"W4376874065","doi":"10.1145/3583085","title":"Catalytic Branching Programs from Groups and General Protocols","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Computation Theory","topic":"Complexity and Algorithms in Graphs","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 Montréal","funders":"","keywords":"Branching (polymer chemistry); Amortized analysis; Boolean function; Exponential function; Mathematics; Multiplicity (mathematics); Binary decision diagram; Combinatorics; Range (aeronautics); Discrete mathematics; Data structure; Computer science; Algorithm; Geometry","score_opus":0.04121551144187059,"score_gpt":0.29964253833018345,"score_spread":0.25842702688831287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376874065","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.05830613,0.00082850346,0.8789152,0.001844194,0.00014936269,0.0003132331,0.00039409022,0.0014977384,0.05775169],"genre_scores_gemma":[0.627523,0.0012947111,0.33676288,0.0009253536,0.00029248654,0.0010939373,0.00095366506,0.00076889194,0.03038519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980166,0.0006168138,0.00009910065,0.0004173463,0.0005331368,0.00031705736],"domain_scores_gemma":[0.9964779,0.0019147795,0.00022053852,0.00096719316,0.00024545056,0.00017410498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016576989,0.0008005019,0.0006962731,0.00093487266,0.0011112553,0.0026253273,0.0017785407,0.0017013095,0.0116951475],"category_scores_gemma":[0.0058841137,0.0005617975,0.0012442452,0.0014495613,0.003216206,0.005758641,0.0041501243,0.0038748716,0.0014884094],"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.000056373283,0.000025962407,0.00009353747,0.00008585167,0.0000075641065,0.000053614458,0.00012426944,0.014644349,0.0011850012,0.96664935,0.0015414143,0.015532839],"study_design_scores_gemma":[0.000025654688,0.000024157856,0.000041631345,0.000018844396,0.000009215751,0.000053986212,0.00002233529,0.04330211,0.0015681987,0.94800293,0.006919243,0.000011543719],"about_ca_topic_score_codex":0.0012900003,"about_ca_topic_score_gemma":0.0012199624,"teacher_disagreement_score":0.0116951475,"about_ca_system_score_codex":0.0021175747,"about_ca_system_score_gemma":0.0016618433,"threshold_uncertainty_score":0.03912419},"labels":[],"label_agreement":null},{"id":"W4379622149","doi":"10.1016/j.dam.2023.05.022","title":"A local search approximation algorithm for the multiway cut problem","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Approximation algorithm; Combinatorics; Heuristic; Set (abstract data type); Local search (optimization); Algorithm; Graph; Discrete mathematics; Mathematical optimization; Computer science","score_opus":0.03813232295211413,"score_gpt":0.28438786931293325,"score_spread":0.24625554636081912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379622149","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.025538988,0.0005560302,0.96794575,0.0004176569,0.000107471635,0.00011336824,0.00014167585,0.00094253913,0.004236559],"genre_scores_gemma":[0.22255518,0.00030999552,0.7686149,0.00024582376,0.00011486693,0.00036857213,0.0006215922,0.00026098042,0.0069081783],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921477,0.00020855291,0.000032586533,0.00017084695,0.00025430298,0.00011882148],"domain_scores_gemma":[0.998161,0.0010971924,0.00012048687,0.0002523533,0.00022297578,0.00014587132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010745089,0.00075430685,0.001879039,0.0012027165,0.0006722346,0.0013869044,0.0029323227,0.0019287686,0.0076883314],"category_scores_gemma":[0.004668223,0.0005651383,0.00091810705,0.0019178075,0.0006383163,0.002595907,0.0020603656,0.0026973293,0.0014751835],"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.00088358804,0.000623999,0.001200323,0.00030334233,0.000106972344,0.00013437738,0.0001971952,0.44437793,0.0062360903,0.04879716,0.014631779,0.48250723],"study_design_scores_gemma":[0.000099821984,0.00008334276,0.00014099688,0.000014004906,0.00001922757,0.000046882986,0.000023565502,0.9864427,0.0006222925,0.0112158405,0.0012818356,0.000009546418],"about_ca_topic_score_codex":0.0033226176,"about_ca_topic_score_gemma":0.0043602847,"teacher_disagreement_score":0.0076883314,"about_ca_system_score_codex":0.0013080139,"about_ca_system_score_gemma":0.0014547728,"threshold_uncertainty_score":0.02572006},"labels":[],"label_agreement":null},{"id":"W4384918518","doi":"10.4230/lipics.icalp.2024.35","title":"A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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; National Science Foundation","keywords":"Enumeration; Bipartite graph; Combinatorics; Mathematics; Bounded function; Independent set; Subspace topology; Discrete mathematics; Dense graph; Maximal independent set; Cograph; Split graph; Counting problem; Pathwidth; Graph; Line graph","score_opus":0.12753554819873622,"score_gpt":0.21624135065149205,"score_spread":0.08870580245275583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384918518","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.010471469,0.00006292859,0.9853735,0.00031242016,0.000039409762,0.00006776649,0.00013296229,0.0008728471,0.0026666655],"genre_scores_gemma":[0.21507333,0.00014865478,0.77907497,0.00032673925,0.00010624476,0.00033936015,0.0005970139,0.0005583773,0.0037753908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713993,0.0010222719,0.00013561331,0.0006316726,0.00077811483,0.0002923825],"domain_scores_gemma":[0.99093074,0.004679932,0.0006590393,0.0025141388,0.00079548516,0.00042074302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027655421,0.0012293765,0.0013529848,0.0020607952,0.0013159912,0.0028476382,0.0038578128,0.0017253293,0.0061177425],"category_scores_gemma":[0.017612737,0.00088355085,0.001302511,0.0028010535,0.0024753143,0.006724435,0.0037522146,0.003437279,0.00207001],"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.00030020962,0.000299489,0.001891985,0.0002317653,0.00006904359,0.0000853196,0.00032831068,0.36094123,0.008399373,0.49680665,0.009609058,0.12103763],"study_design_scores_gemma":[0.000019244504,0.000034197026,0.00010983342,0.00001863554,0.000009358348,0.00005202443,0.00004251937,0.81981075,0.0024281568,0.17531843,0.0021382459,0.000018491382],"about_ca_topic_score_codex":0.0019720758,"about_ca_topic_score_gemma":0.002950128,"teacher_disagreement_score":0.0061177425,"about_ca_system_score_codex":0.0023938185,"about_ca_system_score_gemma":0.0024773628,"threshold_uncertainty_score":0.02046585},"labels":[],"label_agreement":null},{"id":"W4385317379","doi":"10.1007/978-3-031-38906-1_16","title":"Hardness of Graph-Structured Algebraic and Symbolic Problems","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Finite field; Mathematics; Algebraic number; Combinatorics; Discrete mathematics; Laplacian matrix; Coefficient matrix; Diagonal; Polynomial; Polynomial ring; Matrix (chemical analysis); Graph; Field (mathematics); Pure mathematics; Eigenvalues and eigenvectors","score_opus":0.022552788461934904,"score_gpt":0.23496622140103143,"score_spread":0.21241343293909654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385317379","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.21762542,0.0061999923,0.33719403,0.03157643,0.00094486435,0.00034291646,0.005155789,0.0015607856,0.3993998],"genre_scores_gemma":[0.8561659,0.0054349373,0.07245016,0.002336424,0.0022176309,0.00041791957,0.005718838,0.0006943834,0.05456386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975459,0.0005654635,0.000102682396,0.0005226718,0.00091924996,0.0003441147],"domain_scores_gemma":[0.9868461,0.010917562,0.00047198375,0.0009936752,0.0004150341,0.00035572477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011305856,0.0011579302,0.001783381,0.0016627738,0.0023533874,0.0051870104,0.0035465555,0.0024776938,0.017792094],"category_scores_gemma":[0.011270207,0.0011926135,0.0022973586,0.0035631033,0.0053511104,0.015851876,0.003885864,0.008534714,0.0019090625],"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.00022188222,0.00014383797,0.00051203027,0.00057881855,0.00005099506,0.0001310779,0.00052168313,0.019120324,0.00090764544,0.9255562,0.020529894,0.03172568],"study_design_scores_gemma":[0.000028622559,0.0000080340005,0.00016093781,0.000021722315,0.00001094184,0.00005234237,0.00007071718,0.007355457,0.00024612134,0.98837495,0.003662856,0.000007459715],"about_ca_topic_score_codex":0.0022351067,"about_ca_topic_score_gemma":0.0022008386,"teacher_disagreement_score":0.017792094,"about_ca_system_score_codex":0.0026824218,"about_ca_system_score_gemma":0.001719382,"threshold_uncertainty_score":0.059520543},"labels":[],"label_agreement":null},{"id":"W4385408288","doi":"10.1007/s00778-023-00805-0","title":"Accelerating directed densest subgraph queries with software and hardware approaches","year":2023,"lang":"en","type":"article","venue":"The VLDB Journal","topic":"Complexity and Algorithms in Graphs","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 British Columbia","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Shenzhen Science and Technology Innovation Program; National Natural Science Foundation of China; Chinese University of Hong Kong, Shenzhen","keywords":"Computer science; Speedup; Scalability; Parameterized complexity; Bipartite graph; Computation; Matching (statistics); Approximation algorithm; Linear programming; Theoretical computer science; Graph; Algorithm; Parallel computing; Mathematics","score_opus":0.08005984562599212,"score_gpt":0.2340146645626377,"score_spread":0.1539548189366456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385408288","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.13205193,0.0017531265,0.82059604,0.0023952802,0.0005577668,0.00030001698,0.00096387067,0.022702932,0.018679036],"genre_scores_gemma":[0.54525846,0.00043254183,0.44610518,0.0005482458,0.00024229128,0.00018608858,0.0015793683,0.001001853,0.0046458477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974148,0.00048489333,0.00014702308,0.00051619875,0.0010039301,0.00043307996],"domain_scores_gemma":[0.9941327,0.0026139228,0.00029862893,0.0021297187,0.00063271803,0.00019232892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085441157,0.0012414752,0.0010437763,0.0019363794,0.00081612426,0.0026229536,0.002646494,0.0012999072,0.007845215],"category_scores_gemma":[0.0073145404,0.0006017605,0.0011063715,0.0032406452,0.0010659934,0.006005454,0.0027421934,0.0014872347,0.0016483363],"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.0015506095,0.0008144849,0.00670225,0.00071724417,0.00022284995,0.00026213404,0.0003503669,0.17179945,0.048229456,0.06952446,0.047101825,0.6527249],"study_design_scores_gemma":[0.00018552369,0.0002760362,0.0007450313,0.000025840143,0.000081560975,0.00018187777,0.00018401255,0.90737957,0.013930005,0.0703106,0.0066674813,0.00003243486],"about_ca_topic_score_codex":0.007010965,"about_ca_topic_score_gemma":0.01849857,"teacher_disagreement_score":0.007845215,"about_ca_system_score_codex":0.0018416957,"about_ca_system_score_gemma":0.0029666696,"threshold_uncertainty_score":0.026244879},"labels":[],"label_agreement":null},{"id":"W4385460878","doi":"10.1007/s00453-023-01154-8","title":"A Combinatorial Cut-Toggling Algorithm for Solving Laplacian Linear Systems","year":2023,"lang":"en","type":"article","venue":"Algorithmica","topic":"Complexity and Algorithms in Graphs","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":"Algorithm; Mathematics; Theory of computation; Laplacian matrix; Matrix (chemical analysis); Current (fluid); Time complexity; Combinatorics; Discrete mathematics; Computer science; Graph; Physics","score_opus":0.028964233586653013,"score_gpt":0.27415611258489736,"score_spread":0.24519187899824435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385460878","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.017048307,0.00016559522,0.9708217,0.00032856627,0.00012927921,0.00019575407,0.00014729961,0.0013113372,0.009852243],"genre_scores_gemma":[0.14451538,0.00011697776,0.84512657,0.00031269426,0.00008094055,0.00041723734,0.0006953939,0.00041281097,0.008322026],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995036,0.00012319746,0.000024489165,0.00010894817,0.00016569006,0.00007393819],"domain_scores_gemma":[0.99883026,0.0006674218,0.000052135714,0.00015200258,0.0001942675,0.000103878236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069150596,0.0011774079,0.0011468617,0.0013857511,0.0011762702,0.0013700847,0.0024688905,0.0017001041,0.013673372],"category_scores_gemma":[0.0036861608,0.0006674722,0.00094117376,0.0016307683,0.00088325376,0.0015724299,0.0021994726,0.0026249115,0.001945304],"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.00040266398,0.0005927583,0.0008281002,0.0004231305,0.00007784747,0.00016677372,0.00021982874,0.3057171,0.008820652,0.09828188,0.030847864,0.5536214],"study_design_scores_gemma":[0.00009639644,0.000094902585,0.00011466952,0.000017046734,0.000017382505,0.000050680253,0.000041444175,0.93714607,0.0014280517,0.05796548,0.00301284,0.000015166235],"about_ca_topic_score_codex":0.004295609,"about_ca_topic_score_gemma":0.006567114,"teacher_disagreement_score":0.013673372,"about_ca_system_score_codex":0.0009595183,"about_ca_system_score_gemma":0.0019326361,"threshold_uncertainty_score":0.045741975},"labels":[],"label_agreement":null},{"id":"W4385767827","doi":"10.24963/ijcai.2023/240","title":"Computing (1+epsilon)-Approximate Degeneracy in Sublinear Time","year":2023,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Degeneracy (biology); Sublinear function; Computation; Mathematics; Running time; Approximation algorithm; Core (optical fiber); Discrete mathematics; Decomposition; Combinatorics; Computer science; Algorithm","score_opus":0.02525899246789385,"score_gpt":0.2665422157182012,"score_spread":0.24128322325030735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385767827","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.083161585,0.0004543522,0.8965176,0.001145183,0.00013140579,0.00014225152,0.00053661084,0.005896165,0.012014894],"genre_scores_gemma":[0.37953442,0.0002495636,0.6113415,0.00048693529,0.00007810276,0.00024357505,0.0013500991,0.0008816779,0.005834128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845946,0.00024049137,0.00009326735,0.00035237303,0.00058638066,0.0002679612],"domain_scores_gemma":[0.9959785,0.0021997567,0.00029677252,0.001002625,0.00033710257,0.00018520151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011411036,0.0013561441,0.0012818977,0.0012336862,0.0009489052,0.0018900306,0.001659854,0.0012279956,0.008763545],"category_scores_gemma":[0.010475066,0.00066428364,0.0010565363,0.0015267776,0.0011397651,0.0050064297,0.0026259054,0.002328355,0.0024558802],"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.0011750807,0.00048455974,0.006774998,0.0006425517,0.00016020222,0.0003415381,0.00049257174,0.4414611,0.021102747,0.06395076,0.02205191,0.44136202],"study_design_scores_gemma":[0.000059638085,0.00004653597,0.0005069987,0.000018854322,0.000015722786,0.00015567252,0.000087734654,0.92277896,0.0034145408,0.07056517,0.0023390285,0.00001113939],"about_ca_topic_score_codex":0.004202655,"about_ca_topic_score_gemma":0.009589536,"teacher_disagreement_score":0.008763545,"about_ca_system_score_codex":0.0019043928,"about_ca_system_score_gemma":0.0024645422,"threshold_uncertainty_score":0.029317021},"labels":[],"label_agreement":null},{"id":"W4385963754","doi":"10.46298/theoretics.23.9","title":"Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $\\Delta$-Coloring","year":2023,"lang":"en","type":"article","venue":"TheoretiCS","topic":"Complexity and Algorithms in Graphs","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":"European Commission; National Science Foundation","keywords":"Greedy coloring; Graph coloring; Fractional coloring; Edge coloring; Colored; Impossibility; Combinatorics; Complete coloring; Graph; Computer science; Streaming algorithm; Mathematics; Discrete mathematics; Algorithm; Theoretical computer science; Graph power; Line graph; Upper and lower bounds","score_opus":0.02922000910492449,"score_gpt":0.260946489951689,"score_spread":0.2317264808467645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385963754","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.02467962,0.00017497934,0.9664588,0.0012464602,0.00012781925,0.00022906429,0.00027396693,0.0028264727,0.003982834],"genre_scores_gemma":[0.3519761,0.00029050882,0.6362546,0.0012389885,0.00018290128,0.0006522392,0.00084979116,0.00097510044,0.0075796954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965113,0.00097511517,0.00019979767,0.0011115591,0.00079742743,0.00040474834],"domain_scores_gemma":[0.9855912,0.0073284023,0.00089285156,0.004177159,0.0011909995,0.0008193907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049644937,0.0015577638,0.0013921473,0.0009898777,0.0017613239,0.0021781796,0.004772368,0.0017910004,0.00523481],"category_scores_gemma":[0.022349149,0.00097234146,0.0017605972,0.0012197376,0.0031338942,0.0062688063,0.0034768577,0.0038157138,0.0016307513],"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.0016433544,0.00045961767,0.004222231,0.0004843111,0.00018337423,0.00031084937,0.0011619692,0.35873806,0.018871585,0.35202456,0.030646374,0.23125379],"study_design_scores_gemma":[0.00014912384,0.00011077831,0.00018522938,0.00003350092,0.000027988584,0.00011567913,0.00009352929,0.75377446,0.0051196124,0.23671572,0.003634951,0.000039470153],"about_ca_topic_score_codex":0.00728718,"about_ca_topic_score_gemma":0.008662761,"teacher_disagreement_score":0.00728718,"about_ca_system_score_codex":0.003347293,"about_ca_system_score_gemma":0.0056027607,"threshold_uncertainty_score":0.02625513},"labels":[],"label_agreement":null},{"id":"W4386041537","doi":"10.26599/tst.2022.9010013","title":"Maximizing Submodular+Supermodular Functions Subject to a Fairness Constraint","year":2023,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"Beijing University of Technology; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Constraint (computer-aided design); Greedy algorithm; Mathematical optimization; Mathematics; Function (biology); Approximation algorithm; Curvature","score_opus":0.025300504575868934,"score_gpt":0.26909489866672925,"score_spread":0.24379439409086032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386041537","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.051013127,0.00091444486,0.9399795,0.0009882797,0.000090251524,0.00012719192,0.00039196556,0.00036423656,0.0061310166],"genre_scores_gemma":[0.74664575,0.0013630729,0.2401986,0.00048129703,0.00037491086,0.00040035762,0.0005199079,0.00041890074,0.009597319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997686,0.0010029705,0.00006677277,0.00051172083,0.0003616071,0.00037102215],"domain_scores_gemma":[0.99188316,0.0061144135,0.000604662,0.00058630505,0.00040407042,0.0004073858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049160635,0.0028227523,0.0030580186,0.001039722,0.00069428893,0.0023257579,0.0026397351,0.0017530752,0.0044594714],"category_scores_gemma":[0.0121695,0.0006787433,0.0011715853,0.0024312146,0.0014449836,0.005007613,0.0020298297,0.0022449743,0.00081734103],"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.00039826886,0.00026063548,0.00095731596,0.0004429895,0.00014263284,0.00017321977,0.00012331054,0.7724376,0.0038085862,0.15110436,0.0059623257,0.064188845],"study_design_scores_gemma":[0.000023550272,0.00007631745,0.00014491598,0.000015011981,0.00001632363,0.00006489442,0.000021115544,0.9231208,0.0010450027,0.07471689,0.0007438855,0.000011286018],"about_ca_topic_score_codex":0.0017806479,"about_ca_topic_score_gemma":0.0015642033,"teacher_disagreement_score":0.0049160635,"about_ca_system_score_codex":0.0029790548,"about_ca_system_score_gemma":0.0021365006,"threshold_uncertainty_score":0.02599889},"labels":[],"label_agreement":null},{"id":"W4386376648","doi":"10.1016/j.tcs.2023.114161","title":"Communication costs in a geometric communication network","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Geometric networks; Convex hull; Mathematics; Asynchronous communication; Node (physics); Upper and lower bounds; Topology (electrical circuits); Computer science; Euclidean geometry; Graph; Discrete mathematics; Combinatorics; Theoretical computer science; Regular polygon; Graph theory; Geometry; Computer network","score_opus":0.01940915620891267,"score_gpt":0.2756832360992582,"score_spread":0.25627407989034556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386376648","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.1263842,0.0009941655,0.8483903,0.005231827,0.00018416837,0.00027323575,0.00079787965,0.0005503078,0.017193943],"genre_scores_gemma":[0.7551163,0.0016778935,0.23043083,0.00052491436,0.00026786746,0.000688118,0.0009914826,0.0002928576,0.010009681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995826,0.0013400851,0.00019571076,0.0008123211,0.0011750784,0.00065076543],"domain_scores_gemma":[0.98563564,0.010561173,0.0010327494,0.0016676292,0.0006721408,0.00043066597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002162497,0.0011312999,0.0012218353,0.0011071682,0.0015660184,0.0030155915,0.003032802,0.0020390344,0.007532269],"category_scores_gemma":[0.018173119,0.00060678663,0.00084339664,0.0023863884,0.0023532084,0.010055149,0.0025671937,0.002690922,0.00083576376],"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.00035954823,0.0001072208,0.0011046185,0.00025504726,0.000047786347,0.00017650481,0.00023860397,0.59337384,0.0026612636,0.3626125,0.00687476,0.032188345],"study_design_scores_gemma":[0.0000502831,0.00009778798,0.00047699502,0.00002802367,0.000032165353,0.00019161335,0.00015981097,0.7427501,0.0014729982,0.24910718,0.005608445,0.000024545905],"about_ca_topic_score_codex":0.00240306,"about_ca_topic_score_gemma":0.0020952376,"teacher_disagreement_score":0.007532269,"about_ca_system_score_codex":0.0036177079,"about_ca_system_score_gemma":0.0016358286,"threshold_uncertainty_score":0.026248395},"labels":[],"label_agreement":null},{"id":"W4386792249","doi":"10.48550/arxiv.2309.06554","title":"An improved protocol for ExactlyN with more than 3 players","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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; Fundação para a Ciência e a Tecnologia; Israel Science Foundation; European Commission","keywords":"Constructive; Randomness; Combinatorics; Communication complexity; Mathematics; Term (time); Computer science; Order (exchange); Protocol (science); Discrete mathematics; Field (mathematics); Point (geometry); Theoretical computer science; Pure mathematics; Statistics","score_opus":0.1440938354312595,"score_gpt":0.2510016155646354,"score_spread":0.1069077801333759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386792249","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.032290287,0.00041310597,0.91568935,0.0052192966,0.00053533044,0.00065778196,0.0004593786,0.002200246,0.042535234],"genre_scores_gemma":[0.44473964,0.00052600924,0.5170152,0.0036261894,0.0002528998,0.0017070355,0.00097054074,0.0007181334,0.030444356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98832977,0.0035294632,0.00079731835,0.0026118925,0.003190761,0.0015408337],"domain_scores_gemma":[0.9863193,0.0070340643,0.0005466901,0.0045177164,0.0009957874,0.0005863845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060482617,0.0009651892,0.0020953484,0.00080282416,0.0038488386,0.0030743654,0.0039336653,0.0036721774,0.007368759],"category_scores_gemma":[0.015835214,0.0010107659,0.0026025553,0.0010801171,0.004457264,0.011173742,0.016759304,0.0069620814,0.0026616796],"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.0004008562,0.00020724465,0.00066617737,0.0003047813,0.000051617142,0.00031613334,0.001605065,0.010096355,0.014743843,0.905683,0.0075300587,0.05839481],"study_design_scores_gemma":[0.00037842416,0.00031105857,0.00046589551,0.00021129572,0.00010762236,0.000834158,0.00051329046,0.14422329,0.035127204,0.73722917,0.08028824,0.00031036607],"about_ca_topic_score_codex":0.0021999655,"about_ca_topic_score_gemma":0.002607816,"teacher_disagreement_score":0.007368759,"about_ca_system_score_codex":0.0029805452,"about_ca_system_score_gemma":0.005478324,"threshold_uncertainty_score":0.031986654},"labels":[],"label_agreement":null},{"id":"W4387377762","doi":"10.1142/s0129054123410083","title":"Improved Linear-Time Streaming Algorithms for Maximizing Monotone Cardinality-Constrained Set Functions","year":2023,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Complexity and Algorithms in Graphs","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":"Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Cardinality (data modeling); Monotone polygon; Streaming algorithm; Time complexity; Set (abstract data type); Ideal (ethics); Algorithm; Function (biology); Computer science; Running time; Approximation algorithm; Integer (computer science); Mathematics; Discrete mathematics; Upper and lower bounds","score_opus":0.046945529046224205,"score_gpt":0.333160625608366,"score_spread":0.28621509656214184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387377762","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.027170783,0.0007988033,0.9663149,0.00062148867,0.00007698889,0.00018715982,0.0003009819,0.0014927369,0.0030360618],"genre_scores_gemma":[0.2530295,0.00048430462,0.7417522,0.00033427245,0.00021575113,0.0003444801,0.00078302843,0.000389334,0.002667159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737215,0.0007451162,0.00018793676,0.00064243015,0.0006897537,0.00036264886],"domain_scores_gemma":[0.9909043,0.005964834,0.0005701427,0.0014370205,0.0007856205,0.00033809262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037221916,0.0018449252,0.0021484238,0.0012669391,0.0009396905,0.0019329553,0.0040258495,0.0017624821,0.004201464],"category_scores_gemma":[0.016518699,0.0008513071,0.0015300886,0.002713194,0.0011582716,0.006522851,0.002628602,0.0029025339,0.001084888],"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.00093563437,0.0005149551,0.002269057,0.00059563015,0.00015724485,0.00020386778,0.00045227888,0.5082949,0.012718979,0.12605004,0.014946153,0.33286124],"study_design_scores_gemma":[0.000047507125,0.00006597743,0.00012154785,0.000012744163,0.000016793603,0.00008304153,0.00003105771,0.954518,0.002264455,0.041616898,0.001207845,0.0000141600385],"about_ca_topic_score_codex":0.0033490942,"about_ca_topic_score_gemma":0.0044090543,"teacher_disagreement_score":0.004201464,"about_ca_system_score_codex":0.0023109994,"about_ca_system_score_gemma":0.002752365,"threshold_uncertainty_score":0.01968509},"labels":[],"label_agreement":null},{"id":"W4387427243","doi":"10.1016/j.disc.2023.113718","title":"Improved bound for the Gerver-Ramsey collinearity problem","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Collinearity; Combinatorics; Sequence (biology); Upper and lower bounds; Discrete mathematics; Element (criminal law); Statistics; Mathematical analysis","score_opus":0.044815859182103866,"score_gpt":0.29272348703558326,"score_spread":0.2479076278534794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387427243","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.13816802,0.011004337,0.5685779,0.024848115,0.0023301032,0.00055561145,0.0041716527,0.0036105209,0.2467338],"genre_scores_gemma":[0.7676101,0.0052180504,0.17282405,0.0048606303,0.00234607,0.0010508,0.0044719987,0.0019056406,0.039712746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99372286,0.0014705842,0.0001938839,0.0012639153,0.0018102576,0.0015385179],"domain_scores_gemma":[0.9766226,0.015455758,0.0007872091,0.003913297,0.0017343218,0.0014867492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048467917,0.0029415567,0.0039185314,0.0028943138,0.0032909191,0.0072935885,0.00848855,0.0041169715,0.036158003],"category_scores_gemma":[0.029316574,0.0013020631,0.0024162359,0.005204794,0.0038679335,0.018716095,0.012869604,0.01123489,0.005688819],"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.0021386526,0.00071005645,0.002359294,0.0014159755,0.000313307,0.00045212582,0.0007558349,0.07789452,0.006482376,0.7240678,0.087229595,0.09618049],"study_design_scores_gemma":[0.00022216562,0.00014783775,0.00087569887,0.00014039979,0.00016117253,0.000254408,0.00023620891,0.15899383,0.002727778,0.8211581,0.015007268,0.00007507652],"about_ca_topic_score_codex":0.004172122,"about_ca_topic_score_gemma":0.0050186515,"teacher_disagreement_score":0.036158003,"about_ca_system_score_codex":0.005603037,"about_ca_system_score_gemma":0.0042173075,"threshold_uncertainty_score":0.12096053},"labels":[],"label_agreement":null},{"id":"W4387495189","doi":"10.1007/s00500-023-09230-5","title":"Finding local Max-Cut in graphs in randomized polynomial time","year":2023,"lang":"en","type":"article","venue":"Soft Computing","topic":"Complexity and Algorithms in Graphs","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":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Maximum cut; Solver; Time complexity; Algorithm; Discrete mathematics; Combinatorics; Mathematical optimization; Graph","score_opus":0.017210177391430312,"score_gpt":0.25941232174864787,"score_spread":0.24220214435721754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387495189","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.25641093,0.0012075331,0.70424515,0.0075776065,0.0003380534,0.0014193379,0.0036248644,0.008222979,0.016953543],"genre_scores_gemma":[0.5907753,0.00041794608,0.39070052,0.0012016712,0.00038710836,0.0007376818,0.0042788615,0.0017864885,0.009714397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947636,0.0016054454,0.00026855487,0.0015752177,0.00082079886,0.0009662772],"domain_scores_gemma":[0.95724,0.034220096,0.0022610852,0.0036961203,0.0010698756,0.0015127574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041839303,0.0028128603,0.004488702,0.0026942755,0.00288886,0.00684759,0.0062084165,0.0040397714,0.020248558],"category_scores_gemma":[0.025084184,0.0019938536,0.003483873,0.004499625,0.0031581016,0.013994426,0.0048082215,0.005770239,0.002890976],"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.005150951,0.00282142,0.009394622,0.002922786,0.0007573018,0.00044591693,0.00087035575,0.5452392,0.01323785,0.08655723,0.05050545,0.2820969],"study_design_scores_gemma":[0.000552615,0.00019997678,0.000922406,0.00007501375,0.00017887037,0.00015682261,0.00033897453,0.79970396,0.004110177,0.19196706,0.0017576396,0.000036563488],"about_ca_topic_score_codex":0.005629654,"about_ca_topic_score_gemma":0.0145025095,"teacher_disagreement_score":0.020248558,"about_ca_system_score_codex":0.004954251,"about_ca_system_score_gemma":0.006990182,"threshold_uncertainty_score":0.067738175},"labels":[],"label_agreement":null},{"id":"W4387618924","doi":"10.1016/j.tcs.2023.114254","title":"A single factor approximation ratio algorithm for DR-submodular maximization on integer lattice beyond non-negativity and monotonicity","year":2023,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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 New Brunswick","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; National University's Basic Research Foundation of China; China Scholarship Council; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Mathematics; Combinatorics; Cardinality (data modeling); Approximation algorithm; Discrete mathematics; Infimum and supremum; Monotone polygon; Monotonic function; Maximization; Algorithm; Mathematical optimization; Computer science","score_opus":0.0218563223892489,"score_gpt":0.2614628641893752,"score_spread":0.2396065418001263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387618924","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.017154407,0.0011059326,0.9658512,0.0012175333,0.0002759992,0.0002885017,0.00044509914,0.0028764864,0.010784845],"genre_scores_gemma":[0.13116722,0.00036494204,0.86107737,0.0006905321,0.0002782084,0.00046269098,0.0007147679,0.0008766593,0.0043676617],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619377,0.001352509,0.00018369606,0.0009940303,0.00074214645,0.00053382665],"domain_scores_gemma":[0.9929507,0.004345328,0.00031920444,0.001428026,0.00056591857,0.00039079302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036324402,0.002743233,0.0039104805,0.0016169884,0.0011101062,0.0033988247,0.0056658154,0.0024720032,0.014724102],"category_scores_gemma":[0.014747032,0.0013141856,0.0021887938,0.0030812537,0.001695072,0.008291806,0.0040985704,0.005138102,0.004688649],"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.0019606368,0.0009380863,0.001139312,0.0009394198,0.000262302,0.00020075386,0.00040134368,0.21623035,0.01026823,0.16200265,0.048429582,0.5572274],"study_design_scores_gemma":[0.00024518353,0.00020253847,0.00014269372,0.00004713597,0.00006297885,0.00015607676,0.00009209705,0.87457174,0.0023496242,0.11791745,0.004171727,0.000040665225],"about_ca_topic_score_codex":0.002400785,"about_ca_topic_score_gemma":0.003351457,"teacher_disagreement_score":0.014724102,"about_ca_system_score_codex":0.0025242164,"about_ca_system_score_gemma":0.0032959452,"threshold_uncertainty_score":0.04925704},"labels":[],"label_agreement":null},{"id":"W4388328539","doi":"10.4230/lipics.icalp.2024.7","title":"Finer-Grained Reductions in Fine-Grained Hardness of Approximation","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Environment and Climate Change Canada; Israel Science Foundation; European Commission","keywords":"Approx; Hardness of approximation; Approximation algorithm; Combinatorics; Dimension (graph theory); Euclidean geometry; Mathematics; Product (mathematics); Alphabet; Order (exchange); Time complexity; Euclidean distance; Discrete mathematics; Algorithm; Computer science; Geometry","score_opus":0.14076508460315465,"score_gpt":0.21070740946731187,"score_spread":0.06994232486415722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388328539","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.15163723,0.003129434,0.7905145,0.007975811,0.0007408635,0.00040811996,0.002144604,0.0045502223,0.03889913],"genre_scores_gemma":[0.64882004,0.0011069593,0.32963654,0.002463459,0.0005195685,0.0007165045,0.0023785632,0.0019872566,0.0123710185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99214786,0.0014798762,0.00046369745,0.0024347329,0.002070352,0.0014034503],"domain_scores_gemma":[0.97148085,0.014783329,0.0010071658,0.011082919,0.00091772253,0.0007280104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050182943,0.0021291177,0.003246539,0.0015174651,0.002229887,0.005195021,0.0062181507,0.0028911298,0.01699799],"category_scores_gemma":[0.029560838,0.001348323,0.004522228,0.002320208,0.0045848736,0.017409973,0.0091367895,0.009983612,0.0034749978],"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.001865663,0.0009344043,0.004967416,0.0015556356,0.0003120809,0.00034799852,0.0011693133,0.42589745,0.013243598,0.40158772,0.030132085,0.11798671],"study_design_scores_gemma":[0.00015506291,0.0001481281,0.0009887594,0.0000975703,0.00007968121,0.00017064536,0.00018499282,0.47162536,0.002741578,0.5139085,0.009844314,0.000055452718],"about_ca_topic_score_codex":0.004180959,"about_ca_topic_score_gemma":0.005824092,"teacher_disagreement_score":0.01699799,"about_ca_system_score_codex":0.004570156,"about_ca_system_score_gemma":0.002474629,"threshold_uncertainty_score":0.056863964},"labels":[],"label_agreement":null},{"id":"W4388482109","doi":"10.48550/arxiv.2311.03174","title":"Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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; Microsoft Research; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Maximum flow problem; Multiplicative function; Monotonic function; Mathematics; Undirected graph; Combinatorics; Minimum-cost flow problem; Algorithm; Norm (philosophy); Interior point method; Approximation algorithm; Graph; Computer science; Discrete mathematics; Flow network","score_opus":0.06854744414091743,"score_gpt":0.19270185921080343,"score_spread":0.124154415069886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388482109","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.03795382,0.00039487713,0.94569373,0.0010096927,0.000112287395,0.0002451829,0.0004704857,0.008989188,0.0051307827],"genre_scores_gemma":[0.38329282,0.00020940884,0.6086993,0.00048842275,0.00013793951,0.00060501695,0.0012774126,0.0008913118,0.0043983697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963032,0.0008346833,0.00021890434,0.00086380326,0.0012142769,0.0005651492],"domain_scores_gemma":[0.98573065,0.0073759537,0.001185088,0.0044031795,0.0009208488,0.00038440854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027959463,0.0019639453,0.0016802497,0.0013849753,0.0012327477,0.0021919988,0.005068244,0.0021379865,0.0049487394],"category_scores_gemma":[0.01862358,0.0009073578,0.0014670066,0.0023941156,0.0016925249,0.006619612,0.0034635996,0.0031182368,0.001892933],"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.0017529365,0.0005191437,0.0035981867,0.00055172166,0.00020045535,0.00021108123,0.00053858553,0.45316553,0.021792632,0.05639702,0.020313187,0.4409595],"study_design_scores_gemma":[0.00011763176,0.00011297927,0.00029382194,0.000018538356,0.000039283335,0.00011685869,0.000046755667,0.9534011,0.0061163804,0.037050568,0.0026651772,0.000020933194],"about_ca_topic_score_codex":0.004169326,"about_ca_topic_score_gemma":0.007069383,"teacher_disagreement_score":0.005068244,"about_ca_system_score_codex":0.0025145905,"about_ca_system_score_gemma":0.0040374314,"threshold_uncertainty_score":0.018244684},"labels":[],"label_agreement":null},{"id":"W4388651119","doi":"10.4230/lipics.icalp.2024.119","title":"Better Sparsifiers for Directed Eulerian Graphs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley","keywords":"Eulerian path; Combinatorics; Omega; Conjecture; Mathematics; Binary logarithm; Laplace operator; Laplacian matrix; Discrete mathematics; Graph; Physics; Mathematical analysis","score_opus":0.1469199772197672,"score_gpt":0.20703201414579406,"score_spread":0.060112036926026846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388651119","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.112095505,0.00053683104,0.8649065,0.0009089985,0.00012950848,0.00014950598,0.0009015796,0.0012761093,0.01909542],"genre_scores_gemma":[0.5340973,0.00090821675,0.44525957,0.0009136224,0.0002316906,0.00031880906,0.0031554895,0.00061836507,0.014496945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932253,0.00014349047,0.00004161634,0.000170674,0.00022188999,0.000099831545],"domain_scores_gemma":[0.99754083,0.0010691134,0.00018012724,0.0007788925,0.0002354243,0.00019555312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006604166,0.0010802215,0.00076222233,0.0007740049,0.0005090444,0.00090744375,0.0008208471,0.0007266402,0.008933859],"category_scores_gemma":[0.00433091,0.0006097874,0.00064542127,0.000923214,0.0013879819,0.0033432392,0.0021827,0.0030899958,0.0022050396],"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.00055118266,0.00023754794,0.0025371127,0.00037747063,0.000065640845,0.0005236672,0.0008536407,0.18127264,0.041534964,0.5745612,0.02067058,0.17681435],"study_design_scores_gemma":[0.00007499004,0.00017625242,0.0007376589,0.00009419216,0.00003033457,0.00043078093,0.00037453123,0.50087243,0.022242956,0.44857273,0.026343083,0.00004994585],"about_ca_topic_score_codex":0.00090856326,"about_ca_topic_score_gemma":0.0023955489,"teacher_disagreement_score":0.008933859,"about_ca_system_score_codex":0.0006181431,"about_ca_system_score_gemma":0.0005925227,"threshold_uncertainty_score":0.029886782},"labels":[],"label_agreement":null},{"id":"W4388739175","doi":"10.1007/978-3-031-38310-6_9","title":"Less Is More Approach","year":2023,"lang":"en","type":"book-chapter","venue":"Springer optimization and its applications","topic":"Complexity and Algorithms in Graphs","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":"Royal Military College of Canada","funders":"","keywords":"Diversity (politics); Phrase; Outcome (game theory); Computer science; Mathematical optimization; Optimization problem; Mathematics; Management science; Mathematical economics; Artificial intelligence; Sociology; Engineering","score_opus":0.048304344212709696,"score_gpt":0.2539577146107745,"score_spread":0.2056533703980648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388739175","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.001156549,0.01609375,0.008050793,0.07934535,0.009978908,0.000022438844,0.00017077467,0.00033955314,0.884842],"genre_scores_gemma":[0.022202186,0.008651072,0.0032548138,0.049596734,0.007872872,0.000052411808,0.000189536,0.0007085622,0.90747195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671626,0.00083473034,0.00007467066,0.00059510075,0.0015623465,0.00021700219],"domain_scores_gemma":[0.99698836,0.0007504132,0.00019880568,0.00080500415,0.0006251855,0.00063225464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002168965,0.0007990474,0.00090525456,0.0015586466,0.0021459188,0.007887557,0.0014227919,0.0030549166,0.14473313],"category_scores_gemma":[0.005134737,0.00041444745,0.0006343485,0.0015201841,0.005671452,0.013967966,0.0051282714,0.0064109457,0.051203806],"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.000025608955,0.000045353863,0.00012260642,0.00019759253,0.000015021942,0.000022597345,0.00066056824,0.0001504598,0.00040141598,0.48279682,0.42809868,0.08746325],"study_design_scores_gemma":[0.000003039252,0.0000071978384,0.00008832397,0.00006909025,0.0000032242708,0.000039206905,0.00019389688,0.0000369468,0.000045648976,0.05579572,0.9437128,0.0000049426867],"about_ca_topic_score_codex":0.0023497583,"about_ca_topic_score_gemma":0.005238727,"teacher_disagreement_score":0.14473313,"about_ca_system_score_codex":0.0035710265,"about_ca_system_score_gemma":0.0025240085,"threshold_uncertainty_score":0.48418057},"labels":[],"label_agreement":null},{"id":"W4389115885","doi":"10.48550/arxiv.2311.15346","title":"A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Maximum cut; Mathematics; Hyperplane; Combinatorics; Semidefinite programming; Duality (order theory); Generalization; Extension (predicate logic); Approximation algorithm; Linear programming relaxation; Relaxation (psychology); Discrete mathematics; Algorithm; Linear programming; Mathematical optimization; Computer science; Graph; Mathematical analysis","score_opus":0.09324186680180548,"score_gpt":0.2106296667674288,"score_spread":0.11738779996562333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389115885","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.01348354,0.0001345179,0.97857714,0.000418069,0.00007419473,0.00009585712,0.000067863475,0.00022553367,0.006923246],"genre_scores_gemma":[0.23595157,0.00023334038,0.7553005,0.0003791507,0.00010451454,0.0003089226,0.0003589848,0.00020792731,0.0071549905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867,0.0004453914,0.0000457155,0.00031359232,0.00033806896,0.00018722845],"domain_scores_gemma":[0.9988814,0.0005608762,0.00010102432,0.00021917923,0.00014326362,0.00009432258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018814014,0.0010668921,0.0011178746,0.00093948544,0.000730195,0.0015599153,0.002367099,0.0015610206,0.00494866],"category_scores_gemma":[0.005147165,0.0005389875,0.0011037488,0.0014866204,0.0012604359,0.0024447052,0.002191105,0.0029035597,0.0006858586],"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.0001716475,0.00020705054,0.0006936929,0.00013442144,0.000056655943,0.000112438174,0.00012898221,0.5746633,0.0028520706,0.30633265,0.006887174,0.10775986],"study_design_scores_gemma":[0.000023087352,0.000029680787,0.00005700518,0.00001392317,0.0000064988412,0.000039329992,0.000013668267,0.9420607,0.0006978842,0.054800548,0.0022508402,0.0000067495134],"about_ca_topic_score_codex":0.0026292158,"about_ca_topic_score_gemma":0.003075127,"teacher_disagreement_score":0.00494866,"about_ca_system_score_codex":0.0020508263,"about_ca_system_score_gemma":0.0020110826,"threshold_uncertainty_score":0.016554892},"labels":[],"label_agreement":null},{"id":"W4389179369","doi":"10.1016/j.compeleceng.2023.109048","title":"An approximation algorithm for high-dimensional table compression on balanced <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si5.svg\" display=\"inline\" id=\"d1e169\"><mml:mi>K</mml:mi></mml:math>-partite graph","year":2023,"lang":"en","type":"article","venue":"Computers & Electrical Engineering","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Table (database); Compression (physics); Approximation algorithm; Algorithm; Mathematics; Combinatorics; Data compression; Graph; Discrete mathematics; Computer science; Data mining; Physics","score_opus":0.013862896081772318,"score_gpt":0.23170229449090124,"score_spread":0.21783939840912891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389179369","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.05893671,0.0017707051,0.90269244,0.0011358566,0.0004769366,0.0004142401,0.0030538924,0.013127852,0.018391395],"genre_scores_gemma":[0.18572408,0.0006584043,0.7899448,0.00032671366,0.00024239365,0.00052042684,0.0068083727,0.000681556,0.015093299],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999038,0.0001002485,0.000095757736,0.0001866516,0.00041574662,0.00016364253],"domain_scores_gemma":[0.99871624,0.00039536937,0.00008282063,0.00046800243,0.0002596881,0.00007789121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061499135,0.0012995432,0.0013270476,0.0019834756,0.0009636236,0.00243381,0.0025313834,0.0013054196,0.01835235],"category_scores_gemma":[0.0030212854,0.0004854905,0.0010410909,0.004186929,0.0005581287,0.003619738,0.0023572114,0.0013769652,0.0072699874],"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.00095345196,0.00030347533,0.0012775521,0.0003440517,0.00011111495,0.00019148584,0.00032202443,0.052987922,0.0109541,0.029914724,0.07084145,0.83179855],"study_design_scores_gemma":[0.00053294277,0.00043445037,0.0013486829,0.00010151574,0.000110823246,0.0007131794,0.00036537842,0.88232917,0.018857345,0.06897242,0.026152184,0.0000817702],"about_ca_topic_score_codex":0.007021896,"about_ca_topic_score_gemma":0.011636755,"teacher_disagreement_score":0.01835235,"about_ca_system_score_codex":0.0017410981,"about_ca_system_score_gemma":0.0023975153,"threshold_uncertainty_score":0.06139475},"labels":[],"label_agreement":null},{"id":"W4389224840","doi":"10.1145/3633512","title":"Parallel Acyclic Joins: Optimal Algorithms and Cyclicity Separation","year":2023,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","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":"Joins; Join (topology); Tuple; Class (philosophy); Upper and lower bounds; Combinatorics; Mathematics; Algorithm; Argument (complex analysis); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.04162814898446222,"score_gpt":0.3084241444342037,"score_spread":0.2667959954497415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389224840","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.09143918,0.0007445538,0.8865502,0.0021564472,0.00009239036,0.00012816823,0.00021601563,0.0015741474,0.0170989],"genre_scores_gemma":[0.58880186,0.00056922704,0.40083292,0.0006625059,0.00032149768,0.00021483275,0.0005859016,0.00044235247,0.0075688986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979577,0.0004567599,0.00010530494,0.00056226813,0.00066666,0.00025131632],"domain_scores_gemma":[0.9924455,0.004407891,0.00061630004,0.0018431986,0.0003942402,0.0002928834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002239619,0.0006675078,0.000837131,0.0008197352,0.0012512255,0.002320719,0.0023108942,0.0011890891,0.0038481697],"category_scores_gemma":[0.0116097545,0.0005240843,0.00086962513,0.0017435107,0.0020850552,0.0068870676,0.0030745103,0.0031280632,0.00072860497],"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.0005853297,0.0003346479,0.0024791856,0.00033790554,0.000057151025,0.00012791221,0.00050871883,0.14497036,0.0075650876,0.721347,0.007034887,0.114651814],"study_design_scores_gemma":[0.000045628472,0.00006830577,0.0002306116,0.000017936693,0.000017811202,0.000120102144,0.00005678046,0.4878546,0.0047400836,0.5026817,0.004147908,0.000018559866],"about_ca_topic_score_codex":0.0012666218,"about_ca_topic_score_gemma":0.0015640946,"teacher_disagreement_score":0.0038481697,"about_ca_system_score_codex":0.001984468,"about_ca_system_score_gemma":0.0015832109,"threshold_uncertainty_score":0.014398336},"labels":[],"label_agreement":null},{"id":"W4389274127","doi":"10.1016/j.orl.2023.11.010","title":"The complexity of geometric scaling","year":2023,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Polytope; Combinatorics; Mathematics; Oracle; Scaling; Simplex; Upper and lower bounds; Integer (computer science); Simplex algorithm; Discrete mathematics; Linear programming; Mathematical optimization; Computer science; Geometry; Mathematical analysis","score_opus":0.20657309042899014,"score_gpt":0.387549487468558,"score_spread":0.18097639703956786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389274127","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.40857267,0.0059676585,0.21526313,0.034018338,0.0011146211,0.00017036956,0.0016189402,0.0010984628,0.3321758],"genre_scores_gemma":[0.9550955,0.0019297239,0.022896476,0.0008913133,0.0010536779,0.00017441559,0.0006201206,0.0003599755,0.016978834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99747366,0.00068179955,0.00010177165,0.0004131547,0.00098779,0.00034185316],"domain_scores_gemma":[0.9835284,0.011539178,0.0009052736,0.002596668,0.0007870953,0.00064338767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017645899,0.00074324734,0.0016678745,0.0017062698,0.0020912336,0.0057571423,0.0024049045,0.0024478203,0.017816417],"category_scores_gemma":[0.022758674,0.00079662894,0.0012051096,0.0027336031,0.0050227223,0.0135711795,0.0040994366,0.004870111,0.0014167966],"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.00004110715,0.000027144319,0.000381327,0.00005868935,0.000011120984,0.000042770935,0.0001059807,0.010541786,0.00023952141,0.9739817,0.0053989543,0.0091699455],"study_design_scores_gemma":[0.00001004685,0.0000042998763,0.0001909402,0.000006447447,0.000004119037,0.000029623006,0.00003966587,0.024486758,0.00010669272,0.9735204,0.001594125,0.0000069118914],"about_ca_topic_score_codex":0.0019256731,"about_ca_topic_score_gemma":0.0011213976,"teacher_disagreement_score":0.017816417,"about_ca_system_score_codex":0.0028204205,"about_ca_system_score_gemma":0.0014101214,"threshold_uncertainty_score":0.059601903},"labels":[],"label_agreement":null},{"id":"W4389488492","doi":"10.1007/978-3-031-49611-0_33","title":"An Approximation Algorithm for Covering Vertices by $$4^+$$-Paths","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Alberta","funders":"","keywords":"Disjoint sets; Approximation algorithm; Vertex cover; Vertex (graph theory); Algorithm; Combinatorics; Computer science; Graph; Matching (statistics); Running time; Path (computing); Mathematics","score_opus":0.02366334272043781,"score_gpt":0.2625619495429864,"score_spread":0.2388986068225486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389488492","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.08778123,0.0012561239,0.84862524,0.0020258492,0.0005794709,0.0010082329,0.0034947644,0.009493013,0.045736026],"genre_scores_gemma":[0.10937342,0.00048694984,0.8682087,0.000427591,0.00013565474,0.00053705886,0.0051080007,0.00083367416,0.014888987],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984061,0.00022143294,0.0000949625,0.00044089727,0.00044673943,0.00038974633],"domain_scores_gemma":[0.99757975,0.0011202133,0.00013570832,0.0007097563,0.0002596827,0.00019484664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000998304,0.0028712826,0.002337142,0.0018843154,0.0015993599,0.0030320308,0.0057081906,0.0030176654,0.028308848],"category_scores_gemma":[0.0042443653,0.0014278372,0.0030070853,0.005353664,0.0010952986,0.0053179883,0.0038906515,0.0029813275,0.005835082],"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.0014713331,0.0009103771,0.0017318464,0.00084689324,0.000224191,0.00019924942,0.00038357012,0.14291166,0.012000377,0.050825533,0.057769727,0.7307253],"study_design_scores_gemma":[0.00059043354,0.00034142728,0.0011175743,0.00012068392,0.0002493166,0.0005510202,0.00031230462,0.86323804,0.008919872,0.1015428,0.022952303,0.00006408765],"about_ca_topic_score_codex":0.009633489,"about_ca_topic_score_gemma":0.012886698,"teacher_disagreement_score":0.028308848,"about_ca_system_score_codex":0.003668786,"about_ca_system_score_gemma":0.004319644,"threshold_uncertainty_score":0.09470248},"labels":[],"label_agreement":null},{"id":"W4390072523","doi":"10.1007/978-3-031-49815-2_15","title":"Independent Set in k-Claw-Free Graphs: Conditional $$\\chi $$-Boundedness and the Power of LP/SDP Relaxations","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Regina","funders":"","keywords":"Combinatorics; Mathematics; Independent set; Discrete mathematics; Regular polygon; Treewidth; Chordal graph; Bounding overwatch; Upper and lower bounds; Convex set; Graph; Pathwidth; Line graph; Convex optimization; Computer science; Artificial intelligence","score_opus":0.022599768777134616,"score_gpt":0.2502445444154464,"score_spread":0.22764477563831179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390072523","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.08921077,0.0027633603,0.7919049,0.006274808,0.00043137977,0.00016498055,0.0015440761,0.0009076934,0.10679792],"genre_scores_gemma":[0.77380013,0.0027095615,0.17657319,0.0014813667,0.0010472939,0.0005702578,0.0022695092,0.001097421,0.04045124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998264,0.00049649156,0.00007085531,0.0004251852,0.00045267184,0.00029080643],"domain_scores_gemma":[0.98176783,0.014563868,0.00069301453,0.0012673971,0.0008107188,0.00089725637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029183284,0.0016264685,0.0017869278,0.00164443,0.0018254564,0.004310601,0.004726982,0.0017209043,0.010849329],"category_scores_gemma":[0.016859861,0.0014521831,0.0020599656,0.0031716588,0.004222072,0.008197105,0.0037368862,0.0091107655,0.0012398219],"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.00011323213,0.00008434187,0.0002825801,0.00026021848,0.000044394885,0.00009732867,0.00024289265,0.07163717,0.0010052788,0.8970154,0.010766492,0.01845065],"study_design_scores_gemma":[0.000015204605,0.000010769039,0.0001274418,0.0000362044,0.000015473615,0.000036866782,0.000041386727,0.12786992,0.00046877717,0.8695047,0.0018584692,0.000014769999],"about_ca_topic_score_codex":0.0041859653,"about_ca_topic_score_gemma":0.0048426352,"teacher_disagreement_score":0.010849329,"about_ca_system_score_codex":0.0032766263,"about_ca_system_score_gemma":0.0021441153,"threshold_uncertainty_score":0.03629464},"labels":[],"label_agreement":null},{"id":"W4390306948","doi":"10.4230/lipics.ccc.2024.20","title":"Lower Bounds for Set-Multilinear Branching Programs","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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; Tel Aviv University; Tata Institute of Fundamental Research","keywords":"Multilinear map; Branching (polymer chemistry); Set (abstract data type); Mathematics; Combinatorics; Computer science; Discrete mathematics; Pure mathematics; Chemistry; Programming language","score_opus":0.18618325325368926,"score_gpt":0.23415227357518315,"score_spread":0.04796902032149389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390306948","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.08195847,0.0042628245,0.8286146,0.013184454,0.00059396087,0.00031279874,0.002777364,0.0035746065,0.06472096],"genre_scores_gemma":[0.7635301,0.0036784916,0.19249664,0.0050778654,0.0018082993,0.0009895943,0.0043174303,0.003060476,0.02504109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98844004,0.0017876242,0.00038762312,0.0024858136,0.003690831,0.0032080552],"domain_scores_gemma":[0.941359,0.043945406,0.0020870445,0.006702587,0.0033322182,0.0025738142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058577,0.0031389631,0.0027589537,0.0031820254,0.003452357,0.007915132,0.007860811,0.002960911,0.023707155],"category_scores_gemma":[0.04080742,0.0015230436,0.0057980805,0.003801595,0.005230965,0.02517898,0.010007134,0.018828522,0.0045805667],"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.0009924482,0.00041622852,0.0036557394,0.0010214488,0.00022822597,0.00031642598,0.0007781488,0.10270743,0.009317166,0.82759106,0.015502898,0.03747278],"study_design_scores_gemma":[0.00006110323,0.000087175205,0.00040463006,0.00010149863,0.000110496665,0.00017029577,0.00010507708,0.2997207,0.003472932,0.68854886,0.0071653626,0.0000518209],"about_ca_topic_score_codex":0.0037594282,"about_ca_topic_score_gemma":0.005476191,"teacher_disagreement_score":0.023707155,"about_ca_system_score_codex":0.008650125,"about_ca_system_score_gemma":0.0046764817,"threshold_uncertainty_score":0.07930833},"labels":[],"label_agreement":null},{"id":"W4390575880","doi":"10.1137/1.9781611977912.106","title":"Incremental Approximate Maximum Flow on Undirected Graphs in Subpolynomial Update Time","year":2024,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","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; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Maximum flow problem; Multiplicative function; Monotonic function; Algorithm; Minimum-cost flow problem; Undirected graph; Mathematics; Interior point method; Norm (philosophy); Computer science; Combinatorics; Graph; Amortized analysis; Discrete mathematics; Mathematical optimization; Data structure; Flow network","score_opus":0.039921847726306324,"score_gpt":0.23120163386896045,"score_spread":0.19127978614265412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390575880","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.067033574,0.0006858802,0.9121053,0.0012444163,0.00014221597,0.0002935687,0.0010006264,0.009960259,0.007534156],"genre_scores_gemma":[0.4252177,0.0002885537,0.565381,0.00039998308,0.0001615247,0.00053471356,0.0017543595,0.0007227746,0.005539376],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971162,0.00061958825,0.00022476014,0.0007226881,0.0008867125,0.00042996136],"domain_scores_gemma":[0.98690844,0.0064623635,0.0009950106,0.0046723597,0.0006585826,0.00030330053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002458303,0.0015709403,0.0013752136,0.0012585634,0.0011415308,0.002322684,0.004260599,0.001951421,0.0046433597],"category_scores_gemma":[0.016345885,0.0007347896,0.0010862367,0.0027369277,0.001549303,0.007867873,0.0032559712,0.0026002924,0.0014380908],"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.0017253697,0.00049637014,0.003760636,0.00066291523,0.00021483142,0.00021464076,0.00050440634,0.33373988,0.029070178,0.06049564,0.028314235,0.54080087],"study_design_scores_gemma":[0.00014010587,0.00015105546,0.00051049475,0.000030991774,0.000057427045,0.00025461565,0.00007080388,0.902478,0.013086557,0.07802178,0.0051659415,0.000032123335],"about_ca_topic_score_codex":0.0024341366,"about_ca_topic_score_gemma":0.003967801,"teacher_disagreement_score":0.0046433597,"about_ca_system_score_codex":0.0023986697,"about_ca_system_score_gemma":0.0031019817,"threshold_uncertainty_score":0.017403662},"labels":[],"label_agreement":null},{"id":"W4391454139","doi":"10.2139/ssrn.4713947","title":"Space Reduction Techniques for the 3-Wise Kemeny Problem and Applications","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Complexity and Algorithms in Graphs","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":"Reduction (mathematics); Computer science; Space (punctuation); Mathematics; Geometry","score_opus":0.013637011326584193,"score_gpt":0.2698968676089408,"score_spread":0.25625985628235665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391454139","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.047323506,0.004509239,0.84193254,0.0053954325,0.0009757254,0.00023171176,0.00059881713,0.001251039,0.09778209],"genre_scores_gemma":[0.36309096,0.004740862,0.5615163,0.0014163564,0.0017513793,0.00066921103,0.0017742376,0.001556398,0.06348427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858946,0.00033168207,0.00006658144,0.00024527547,0.0005113574,0.0002556659],"domain_scores_gemma":[0.99736744,0.0014901352,0.00015117181,0.00062301813,0.0002191273,0.00014924812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011618182,0.0015291317,0.0013716383,0.003148328,0.002079085,0.0026939106,0.0036547938,0.0019077857,0.02136022],"category_scores_gemma":[0.0059004533,0.0005888374,0.0028301051,0.004405468,0.0026625444,0.0071469024,0.0054872865,0.0075247553,0.0039535966],"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.00027836702,0.00031605264,0.00058359024,0.00059893145,0.000076603,0.00016788072,0.00068912463,0.027202817,0.0051548565,0.7259783,0.03184041,0.20711306],"study_design_scores_gemma":[0.000045310255,0.000039710416,0.00028686793,0.000047731184,0.000036747748,0.00015696879,0.00016133091,0.040514227,0.002126537,0.94082326,0.015731283,0.000029909916],"about_ca_topic_score_codex":0.0018580139,"about_ca_topic_score_gemma":0.0031586494,"teacher_disagreement_score":0.02136022,"about_ca_system_score_codex":0.0015480991,"about_ca_system_score_gemma":0.0014421914,"threshold_uncertainty_score":0.07145703},"labels":[],"label_agreement":null},{"id":"W4392245251","doi":"10.1016/j.tcs.2024.114469","title":"Two-stage BP maximization under p-matroid constraint","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"Qinglan Project of Jiangsu Province of China; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Submodular set function; Matroid; Parameterized complexity; Maximization; Mathematics; Constraint (computer-aided design); Combinatorics; Monotonic function; Function (biology); Approximation algorithm; Discrete mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.016197485799270432,"score_gpt":0.274274897290326,"score_spread":0.25807741149105556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392245251","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.027319578,0.00030132386,0.9595979,0.0010281014,0.000096315314,0.00020732312,0.00048493448,0.0006469614,0.010317537],"genre_scores_gemma":[0.42351207,0.00033737445,0.554989,0.00052753714,0.0002672109,0.00042505912,0.0009398776,0.00059141,0.018410498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979534,0.000677441,0.00008405308,0.00044602357,0.00039871977,0.0004402668],"domain_scores_gemma":[0.9964887,0.0020009747,0.00015927227,0.0005310853,0.0005027836,0.00031716935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020135534,0.0011744307,0.002094822,0.00076399307,0.0010438418,0.0021422042,0.0036198567,0.0025770722,0.008422211],"category_scores_gemma":[0.0061900443,0.0011721947,0.001382748,0.0016988914,0.0009826593,0.004209535,0.0031970614,0.0024810655,0.001585559],"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.002090466,0.00083987194,0.0029595457,0.0017062457,0.0003441152,0.0010969802,0.00070790434,0.36071724,0.039870918,0.27076933,0.036216114,0.28268123],"study_design_scores_gemma":[0.00009316204,0.0001268879,0.0005022929,0.00002759422,0.000054303735,0.0002396999,0.000053493048,0.8736838,0.006930191,0.11570263,0.0025526036,0.000033179957],"about_ca_topic_score_codex":0.003129888,"about_ca_topic_score_gemma":0.004432934,"teacher_disagreement_score":0.008422211,"about_ca_system_score_codex":0.0013608088,"about_ca_system_score_gemma":0.0032758445,"threshold_uncertainty_score":0.028175175},"labels":[],"label_agreement":null},{"id":"W4392488727","doi":"10.1145/3717823.3718211","title":"Online Locality Meets Distributed Quantum Computing","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","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 Calgary","funders":"Agence Nationale de la Recherche","keywords":"Locality; Computer science; Quantum computer; Quantum; Distributed computing; Physics; Quantum mechanics","score_opus":0.043436889373090336,"score_gpt":0.3103039341269586,"score_spread":0.2668670447538683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392488727","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.06938689,0.0012792114,0.8599768,0.017883688,0.00038712256,0.00019910665,0.00038929284,0.0014193121,0.049078636],"genre_scores_gemma":[0.89844984,0.00073106965,0.08539989,0.0024136424,0.00071149785,0.0004362299,0.00025262416,0.00044388452,0.011161278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99305254,0.002004709,0.000236549,0.001821567,0.0019477252,0.0009369293],"domain_scores_gemma":[0.9593119,0.027931212,0.0017564369,0.007944708,0.0017660882,0.001289718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046336954,0.00078569516,0.0017515194,0.0008563342,0.0029080608,0.0042318064,0.0037265422,0.0038124055,0.014889917],"category_scores_gemma":[0.027706895,0.00085751084,0.0016164775,0.0013406262,0.006556812,0.017946921,0.008934234,0.010368666,0.0019858556],"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.00012514381,0.00010216502,0.00030427455,0.00016064187,0.00002223662,0.00007020534,0.0001859757,0.018986354,0.0014703249,0.9660245,0.0022958277,0.010252293],"study_design_scores_gemma":[0.000034772103,0.000037237383,0.00008751123,0.000014869782,0.000011157106,0.000044714994,0.000049420607,0.09306084,0.0011199653,0.90187955,0.0036448415,0.000015156006],"about_ca_topic_score_codex":0.002008899,"about_ca_topic_score_gemma":0.0018705308,"teacher_disagreement_score":0.014889917,"about_ca_system_score_codex":0.0041831755,"about_ca_system_score_gemma":0.003472634,"threshold_uncertainty_score":0.04981178},"labels":[],"label_agreement":null},{"id":"W4394569093","doi":"10.1287/moor.2022.0320","title":"On Constrained Mixed-Integer DR-Submodular Minimization","year":2024,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Complexity and Algorithms in Graphs","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 Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Submodular set function; Mathematics; Integer (computer science); Integer programming; Mathematical optimization; Minification; Combinatorics; Computer science","score_opus":0.0928491537130744,"score_gpt":0.38163962710865945,"score_spread":0.28879047339558506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394569093","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.0147520425,0.0011951496,0.9718525,0.00093933527,0.00007511927,0.00011562734,0.00025031922,0.0001331552,0.010686808],"genre_scores_gemma":[0.5037022,0.0035765092,0.47391662,0.0010478044,0.0003996011,0.00078610296,0.0008959287,0.0003458266,0.015329463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871945,0.0007012926,0.00003826947,0.00022264333,0.00018460632,0.0001337352],"domain_scores_gemma":[0.9958326,0.003457445,0.00023716484,0.0001851758,0.00018681797,0.00010070762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022801796,0.0017705205,0.001282314,0.0007964161,0.00047890216,0.001519689,0.0013274034,0.0012199391,0.0046178717],"category_scores_gemma":[0.007795917,0.0005903896,0.0007659975,0.0016888953,0.0016780499,0.0025604775,0.001697855,0.002365568,0.000736023],"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.00013517325,0.00013274168,0.0006003189,0.00030597262,0.00007337407,0.00020541402,0.00011894394,0.70687497,0.0017900313,0.23108377,0.005967298,0.05271197],"study_design_scores_gemma":[0.000019448817,0.000050300398,0.00012213286,0.000034330656,0.000009418621,0.000039746366,0.000021384152,0.8805387,0.00046158241,0.11653844,0.0021539717,0.00001050181],"about_ca_topic_score_codex":0.0026880738,"about_ca_topic_score_gemma":0.0027581141,"teacher_disagreement_score":0.0046178717,"about_ca_system_score_codex":0.0017417554,"about_ca_system_score_gemma":0.0014507399,"threshold_uncertainty_score":0.015448332},"labels":[],"label_agreement":null},{"id":"W4395099388","doi":"10.1007/978-3-031-48679-1_11","title":"A Survey of Cover-Free Families: Constructions, Applications, and Generalizations","year":2023,"lang":"en","type":"book-chapter","venue":"Fields Institute communications","topic":"Complexity and Algorithms in Graphs","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":"University of Ottawa","funders":"","keywords":"Cover (algebra); Geography; Computer science; Engineering; Mechanical engineering","score_opus":0.09135086160397184,"score_gpt":0.28939632643648017,"score_spread":0.19804546483250834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395099388","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.02974783,0.50819397,0.22872558,0.008134627,0.0011378825,0.00019826689,0.002051772,0.00068275584,0.22112735],"genre_scores_gemma":[0.18777335,0.6368238,0.11735273,0.0024668667,0.004164492,0.00051744,0.003475656,0.0005069036,0.04691877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894124,0.00019577351,0.00006409834,0.00025496495,0.0004155092,0.00012853926],"domain_scores_gemma":[0.9969951,0.002091723,0.00014101509,0.00033731182,0.00028921588,0.00014578027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016309229,0.0010035406,0.0013293916,0.0056731855,0.002027232,0.0036079527,0.0016740032,0.0013488786,0.010091435],"category_scores_gemma":[0.004525492,0.0011514681,0.0010346979,0.014746901,0.0021355383,0.0121966945,0.0027333796,0.0029227063,0.0024345638],"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.000042993426,0.00008977269,0.000987665,0.0014646244,0.000021677599,0.00009599678,0.00032920236,0.0032546185,0.0008141242,0.6945425,0.03682788,0.261529],"study_design_scores_gemma":[0.000021553666,0.00009280638,0.0017602525,0.0010850296,0.000043695218,0.0021966633,0.0003279799,0.010481694,0.0012456628,0.5738056,0.40887764,0.00006138025],"about_ca_topic_score_codex":0.0013486447,"about_ca_topic_score_gemma":0.0013357385,"teacher_disagreement_score":0.010091435,"about_ca_system_score_codex":0.0027183457,"about_ca_system_score_gemma":0.0014902736,"threshold_uncertainty_score":0.033759177},"labels":[],"label_agreement":null},{"id":"W4396661433","doi":"10.1007/s00182-024-00896-1","title":"Stable source connection and assignment problems as multi-period shortest path problems","year":2024,"lang":"en","type":"article","venue":"International Journal of Game Theory","topic":"Complexity and Algorithms in Graphs","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 Windsor","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Period (music); Connection (principal bundle); Shortest path problem; Path (computing); Constrained Shortest Path First; Mathematics; Computer science; K shortest path routing; Mathematical optimization; Combinatorics; Computer network; Physics; Graph; Geometry","score_opus":0.020033509547972585,"score_gpt":0.2676365030996414,"score_spread":0.2476029935516688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396661433","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.1417732,0.0012986928,0.81948954,0.0032311885,0.00034913947,0.00044813554,0.0011643273,0.00026004823,0.031985797],"genre_scores_gemma":[0.7776112,0.001963712,0.17921974,0.00046528643,0.0005558361,0.0008157104,0.0010102642,0.00026581957,0.038092494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980228,0.000986791,0.00008397775,0.00042653177,0.00025770545,0.0002222592],"domain_scores_gemma":[0.9940507,0.004310296,0.00064902625,0.00025509627,0.00027146522,0.00046337701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021093998,0.0012169171,0.0018634542,0.0011018883,0.0012954923,0.0042452705,0.0031557383,0.0033435824,0.011092457],"category_scores_gemma":[0.0089640785,0.0010430475,0.0014750053,0.0031008052,0.0016432046,0.0072574434,0.0021352305,0.002928,0.0007476421],"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.0005558111,0.0002953659,0.000801053,0.00058314507,0.0001830383,0.00037930504,0.00046314942,0.36815906,0.0017509492,0.5871586,0.011445715,0.02822479],"study_design_scores_gemma":[0.00014082056,0.000083671584,0.00030454944,0.000034827088,0.000056716355,0.00015002456,0.00019340975,0.5320647,0.0004934965,0.4620604,0.004385223,0.000032187745],"about_ca_topic_score_codex":0.0015787889,"about_ca_topic_score_gemma":0.0022254041,"teacher_disagreement_score":0.011092457,"about_ca_system_score_codex":0.0022317509,"about_ca_system_score_gemma":0.0020375086,"threshold_uncertainty_score":0.037107944},"labels":[],"label_agreement":null},{"id":"W4396981007","doi":"10.1145/3665453.3665458","title":"Complexity Column","year":2024,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Complexity and Algorithms in Graphs","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":"Column (typography); Computer science; Telecommunications","score_opus":0.06455749615922264,"score_gpt":0.29774494069782637,"score_spread":0.23318744453860374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396981007","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.0010782417,0.008816852,0.006601263,0.020921811,0.017608773,0.00010578103,0.019441076,0.002500558,0.9229256],"genre_scores_gemma":[0.014492971,0.008159051,0.0035266147,0.0067333877,0.010161374,0.00013610946,0.024050996,0.0017538519,0.9309856],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985821,0.00008284363,0.00007956494,0.0003281686,0.0007675394,0.0001597846],"domain_scores_gemma":[0.9959604,0.00063479476,0.00022733709,0.0007545653,0.0014100994,0.0010127539],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005888574,0.0008800325,0.00093862426,0.003762535,0.00201504,0.008450016,0.0013994237,0.0013415758,0.5739163],"category_scores_gemma":[0.005726855,0.0005615031,0.0007114605,0.0052720783,0.000984225,0.006344907,0.0025055562,0.0038062944,0.2994326],"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.000019855494,0.00001636012,0.00009687299,0.00013284945,0.0000063833086,0.000023339422,0.00002766929,0.000108047985,0.00038165782,0.035549834,0.91529566,0.048341468],"study_design_scores_gemma":[0.00000254734,0.000005028322,0.00020830202,0.00004827744,0.0000019660417,0.000053687632,0.000018579925,0.00008481192,0.00011779013,0.008567339,0.99088657,0.0000052220694],"about_ca_topic_score_codex":0.0031003791,"about_ca_topic_score_gemma":0.005816587,"teacher_disagreement_score":0.5739163,"about_ca_system_score_codex":0.0034333756,"about_ca_system_score_gemma":0.002822354,"threshold_uncertainty_score":0.6077566},"labels":[],"label_agreement":null},{"id":"W4398180128","doi":"10.1007/978-3-031-59835-7_30","title":"Online Algorithms for Spectral Hypergraph Sparsification","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Computer science; Hypergraph; Algorithm; Theoretical computer science; Discrete mathematics; Mathematics","score_opus":0.040178526043008166,"score_gpt":0.27858003125385694,"score_spread":0.23840150521084877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398180128","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.011174537,0.00060184853,0.964822,0.00089032017,0.00028177773,0.00019792515,0.00067601434,0.0034428546,0.017912783],"genre_scores_gemma":[0.18882419,0.0009476353,0.78029615,0.00069842197,0.000653613,0.00082163967,0.0033579387,0.0017871845,0.022613276],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981895,0.0004257152,0.00009271021,0.00048690077,0.0005671178,0.00023800043],"domain_scores_gemma":[0.9916536,0.004458279,0.00033425257,0.0026657581,0.0005614703,0.00032650604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015579693,0.0022026792,0.002183031,0.0014936735,0.0011754659,0.0034138693,0.0048228214,0.0025670705,0.031937562],"category_scores_gemma":[0.011833026,0.0013281311,0.0016514496,0.0032475048,0.0018302394,0.008057753,0.0060256915,0.0066365693,0.008333677],"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.00075658865,0.00074715784,0.0006823241,0.0006303841,0.00012078427,0.00014796654,0.00029829462,0.14716478,0.005657103,0.2174398,0.06406136,0.5622935],"study_design_scores_gemma":[0.00015389036,0.00005892543,0.00016457551,0.000056757053,0.000032498323,0.000119073855,0.00012205931,0.5791101,0.0023957153,0.41056928,0.0071926042,0.000024520217],"about_ca_topic_score_codex":0.0020043058,"about_ca_topic_score_gemma":0.0040280237,"teacher_disagreement_score":0.031937562,"about_ca_system_score_codex":0.0016825717,"about_ca_system_score_gemma":0.0021463751,"threshold_uncertainty_score":0.1068418},"labels":[],"label_agreement":null},{"id":"W4398886544","doi":"10.4230/lipics.ccc.2024.7","title":"Polynomial Pass Semi-Streaming Lower Bounds for K-Cores and Degeneracy","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"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":"Fundação para a Ciência e a Tecnologia; European Commission; Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; University of Waterloo; UK Research and Innovation; National Science Foundation","keywords":"Degeneracy (biology); Polynomial; Mathematics; Combinatorics; Pure mathematics; Mathematical analysis; Biology","score_opus":0.05976760516020513,"score_gpt":0.2013693260096444,"score_spread":0.14160172084943928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398886544","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.12880436,0.0064128526,0.73991776,0.01669951,0.00087550585,0.00057232234,0.003181325,0.0064176884,0.09711879],"genre_scores_gemma":[0.70346135,0.0051072137,0.23536357,0.00460759,0.0020130414,0.0013056356,0.004376592,0.004365171,0.039399814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913931,0.001316533,0.00036113104,0.001768972,0.0030598284,0.0021004155],"domain_scores_gemma":[0.94920933,0.032853015,0.0022724278,0.010156149,0.0031399499,0.0023691517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054930765,0.0038688397,0.0036259796,0.0023679233,0.0034992094,0.005743394,0.009068414,0.0039928416,0.022455558],"category_scores_gemma":[0.042450596,0.0015428822,0.0045072776,0.0036417334,0.0056319204,0.029031005,0.0096045025,0.018104976,0.0071796207],"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.0028981862,0.0013229391,0.0070117544,0.0022667141,0.00036238888,0.0008165421,0.0019925344,0.12650992,0.020213291,0.64417964,0.055489354,0.13693668],"study_design_scores_gemma":[0.0001530243,0.00031532685,0.00139424,0.00023303741,0.00020223437,0.00045051298,0.00038902333,0.33411264,0.009615807,0.6373822,0.015661502,0.00009037461],"about_ca_topic_score_codex":0.0040257117,"about_ca_topic_score_gemma":0.0045914594,"teacher_disagreement_score":0.022455558,"about_ca_system_score_codex":0.005289351,"about_ca_system_score_gemma":0.004652316,"threshold_uncertainty_score":0.07512128},"labels":[],"label_agreement":null},{"id":"W4399520984","doi":"10.1145/3618260.3649708","title":"New Graph and Hypergraph Container Lemmas with Applications in Property Testing","year":2024,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"","keywords":"Hypergraph; Container (type theory); Property testing; Graph; Computer science; Property (philosophy); Theoretical computer science; Mathematics; Combinatorics; Algorithm; Engineering","score_opus":0.027830951325252713,"score_gpt":0.23653505565392868,"score_spread":0.20870410432867598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399520984","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.014770982,0.0010369488,0.9651348,0.0025350356,0.00028264968,0.00010042839,0.00041058744,0.0007291074,0.014999528],"genre_scores_gemma":[0.33847874,0.0021916518,0.6444426,0.0023365149,0.0016877617,0.0009445056,0.0013238186,0.0015214371,0.0070729647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99419665,0.0024697548,0.0003245507,0.0012047153,0.0012844177,0.000519941],"domain_scores_gemma":[0.9324743,0.054885987,0.002876009,0.005226418,0.0028597114,0.0016775373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006300064,0.002016358,0.001886075,0.0057623577,0.0020142423,0.0038373766,0.0039127343,0.002223429,0.0102078505],"category_scores_gemma":[0.037251458,0.0011230792,0.0038354264,0.007330037,0.010489151,0.017072134,0.0077712876,0.01198894,0.0019418334],"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.000084640604,0.000088952154,0.0017615753,0.00019057909,0.000037958707,0.0006305069,0.00035503143,0.0056022992,0.0018602005,0.9571522,0.006465153,0.025770858],"study_design_scores_gemma":[0.0000302942,0.000051018287,0.0005828253,0.0000573106,0.000042665928,0.00044222793,0.00009972324,0.037420303,0.0016963826,0.95073694,0.008789936,0.000050320188],"about_ca_topic_score_codex":0.0020350842,"about_ca_topic_score_gemma":0.0017147885,"teacher_disagreement_score":0.0102078505,"about_ca_system_score_codex":0.002376459,"about_ca_system_score_gemma":0.0013361755,"threshold_uncertainty_score":0.034148693},"labels":[],"label_agreement":null},{"id":"W4399521007","doi":"10.1145/3618260.3649664","title":"Tree Evaluation Is in Space 𝑂 (log 𝑛 · log log 𝑛)","year":2024,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Environment and Climate Change Canada; University of Warwick","keywords":"Conjecture; Combinatorics; Logarithm; Branching (polymer chemistry); Binary logarithm; Mathematics; Linear space; Space (punctuation); Amortized analysis; Tree (set theory); Function (biology); Binary decision diagram; Time complexity; Polynomial; Discrete mathematics; Data structure; Computer science; Algorithm; Chemistry","score_opus":0.05139376386046279,"score_gpt":0.312845261571606,"score_spread":0.26145149771114323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399521007","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.389915,0.004483052,0.4753539,0.03189973,0.0010057369,0.0009302876,0.009984438,0.01684246,0.06958552],"genre_scores_gemma":[0.70688814,0.0023147282,0.24577017,0.00244147,0.0005896211,0.0005471192,0.009477611,0.0019777266,0.029993486],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99587125,0.0008871405,0.00029219518,0.0012150869,0.0008873284,0.0008470023],"domain_scores_gemma":[0.9877351,0.0067384173,0.00077429187,0.0033318591,0.0007556024,0.0006647577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022290843,0.0014753627,0.0017357912,0.00062971114,0.001885077,0.0071258238,0.0033295315,0.0023197534,0.02603634],"category_scores_gemma":[0.009321815,0.00089075364,0.0031312378,0.002260899,0.0022706955,0.01990483,0.0039351513,0.0049003577,0.0053236163],"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.0054797167,0.0013668571,0.012422224,0.0035897053,0.000589411,0.00069636415,0.0016018782,0.08921133,0.035614066,0.24413966,0.0929179,0.5123709],"study_design_scores_gemma":[0.0007242399,0.0005932512,0.003117891,0.0002558791,0.0004041172,0.0012844029,0.0010508205,0.26945457,0.025839258,0.64184403,0.055292152,0.00013935036],"about_ca_topic_score_codex":0.0030652273,"about_ca_topic_score_gemma":0.00793555,"teacher_disagreement_score":0.02603634,"about_ca_system_score_codex":0.003227742,"about_ca_system_score_gemma":0.00426122,"threshold_uncertainty_score":0.08710027},"labels":[],"label_agreement":null},{"id":"W4399849664","doi":"10.26599/tst.2023.9010107","title":"Two-Stage Submodular Maximization Under Knapsack Problem","year":2024,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"Qinglan Project of Jiangsu Province of China; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Knapsack problem; Submodular set function; Maximization; Mathematics; Stage (stratigraphy); Mathematical optimization; Computer science; Biology; Paleontology","score_opus":0.01857924213785202,"score_gpt":0.27978680528301986,"score_spread":0.26120756314516785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399849664","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.027805427,0.0029035215,0.9488866,0.0016495622,0.00025603225,0.0005284563,0.0019801345,0.00072011893,0.0152702965],"genre_scores_gemma":[0.46265906,0.00419158,0.49928558,0.001459268,0.0006644559,0.0017512393,0.0048568705,0.000803192,0.024328802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960756,0.001755738,0.0001651985,0.00091368717,0.00050375034,0.00058607844],"domain_scores_gemma":[0.9964992,0.002069622,0.00033466908,0.0003158392,0.00043539068,0.00034530117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040949793,0.0029411889,0.004024968,0.0013949071,0.0010934252,0.0030247862,0.0027128637,0.0029373122,0.009953207],"category_scores_gemma":[0.006392166,0.0011891082,0.0020903691,0.0044575813,0.0011839377,0.0041847965,0.0025492134,0.002888003,0.00213136],"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.00068371004,0.00052680465,0.0013096821,0.0020478573,0.000368903,0.0006220396,0.00023378177,0.76434195,0.003994956,0.07310472,0.040114835,0.11265071],"study_design_scores_gemma":[0.000087454886,0.00020117914,0.00044083243,0.00006473956,0.00007157485,0.0002128538,0.00009877931,0.9230369,0.0016128557,0.06840757,0.0057150307,0.00005021307],"about_ca_topic_score_codex":0.0033135044,"about_ca_topic_score_gemma":0.0037042124,"teacher_disagreement_score":0.009953207,"about_ca_system_score_codex":0.0019798912,"about_ca_system_score_gemma":0.0027981407,"threshold_uncertainty_score":0.033296764},"labels":[],"label_agreement":null},{"id":"W4400004372","doi":"10.1137/23m1603856","title":"Erratum: Multitasking Capacity: Hardness Results and Improved Constructions","year":2024,"lang":"en","type":"erratum","venue":"SIAM Journal on Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Human multitasking; Mathematics; Combinatorics; Discrete mathematics; Cognitive psychology; Psychology","score_opus":0.03213379434423039,"score_gpt":0.2703348595808777,"score_spread":0.23820106523664733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400004372","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.006168458,0.004712556,0.07238902,0.23900788,0.46246526,0.0002808675,0.0076047303,0.0019164872,0.20545481],"genre_scores_gemma":[0.13047734,0.011462578,0.11446844,0.06291841,0.11604763,0.00093567715,0.012197609,0.0062115593,0.54528075],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99581087,0.00069948664,0.00038817775,0.00069270446,0.0020272937,0.00038148012],"domain_scores_gemma":[0.9774901,0.011947009,0.0006894825,0.0027056935,0.006290752,0.0008769277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029480052,0.0023594238,0.001903087,0.0031218494,0.0052379244,0.004618071,0.00440761,0.004379261,0.08384679],"category_scores_gemma":[0.035616957,0.0013711883,0.0021164455,0.0042906315,0.004117587,0.013424364,0.0030195625,0.013052577,0.028239826],"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.00016050007,0.00004251839,0.00010426652,0.00024793367,0.000016353077,0.00018836113,0.000072244045,0.0011114711,0.00031996172,0.0614152,0.9176716,0.018649628],"study_design_scores_gemma":[0.00012498324,0.00007770799,0.00083583815,0.00039010012,0.00013451319,0.0010226609,0.00028453965,0.008634021,0.0023758754,0.3561954,0.6297525,0.00017188296],"about_ca_topic_score_codex":0.003840509,"about_ca_topic_score_gemma":0.0050591603,"teacher_disagreement_score":0.08384679,"about_ca_system_score_codex":0.0044480083,"about_ca_system_score_gemma":0.0033699293,"threshold_uncertainty_score":0.28049546},"labels":[],"label_agreement":null},{"id":"W4400668514","doi":"10.4230/lipics.mfcs.2024.45","title":"Nearly-Tight Bounds for Flow Sparsifiers in Quasi-Bipartite Graphs","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Agence Nationale de la Recherche","keywords":"Bipartite graph; Combinatorics; Bounded function; Treewidth; Physics; Graph; Mathematics; Discrete mathematics; Line graph; Mathematical analysis; Pathwidth","score_opus":0.08587823683852365,"score_gpt":0.20668371998355356,"score_spread":0.12080548314502991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400668514","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.19377638,0.0030429277,0.7415923,0.0041035577,0.00047123476,0.00050777994,0.004293959,0.004208847,0.048003033],"genre_scores_gemma":[0.6974873,0.0025413907,0.27503496,0.0026020797,0.0007139466,0.00078686234,0.0061146985,0.0018852819,0.012833437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99596244,0.0007070419,0.00019228218,0.00086044206,0.0014720497,0.00080563733],"domain_scores_gemma":[0.9754868,0.016772775,0.0011863591,0.004036797,0.0014853062,0.0010319158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028730333,0.0031917333,0.0022907131,0.0014217165,0.0012725932,0.003714525,0.003266611,0.0024847325,0.016117243],"category_scores_gemma":[0.024548735,0.0014869494,0.0019463531,0.0022202844,0.0030892584,0.012544696,0.004519335,0.006690924,0.003775941],"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.0022107782,0.00075827446,0.0042554773,0.0015555228,0.00027214817,0.0007592017,0.0010369444,0.5298034,0.03348868,0.2592561,0.029134938,0.13746858],"study_design_scores_gemma":[0.0001345641,0.00028615768,0.00097596936,0.00014635798,0.00008606026,0.00047643666,0.00023481515,0.6656378,0.011138391,0.31232956,0.008492812,0.000061077684],"about_ca_topic_score_codex":0.0017931124,"about_ca_topic_score_gemma":0.0031230827,"teacher_disagreement_score":0.016117243,"about_ca_system_score_codex":0.002298651,"about_ca_system_score_gemma":0.0016378018,"threshold_uncertainty_score":0.053917527},"labels":[],"label_agreement":null},{"id":"W4401025033","doi":"10.24963/ijcai.2024/292","title":"Verified Certificates via SAT and Computer Algebra Systems for the Ramsey R(3,8) and R(3,9) Problems","year":2024,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Windsor; University of Waterloo","funders":"","keywords":"Democracy; Computer science; Political science; Law; Politics","score_opus":0.03572882690136296,"score_gpt":0.24087611798748693,"score_spread":0.20514729108612395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401025033","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.05172388,0.00027367382,0.91993475,0.0012026739,0.00020744414,0.00039196844,0.0011042432,0.010317916,0.014843495],"genre_scores_gemma":[0.35855627,0.00026470728,0.6328329,0.00036189475,0.00009815481,0.00040585524,0.0023956678,0.0009556692,0.0041289264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956892,0.001567508,0.00026376027,0.00079147215,0.0012459634,0.0004421454],"domain_scores_gemma":[0.9896653,0.0070637283,0.0006710784,0.0014010798,0.0009911598,0.00020771442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00287345,0.00090191886,0.0009838861,0.0011974451,0.0011731471,0.0027468866,0.0018201882,0.0011356382,0.012167935],"category_scores_gemma":[0.016962267,0.00066718477,0.0022164267,0.0012281986,0.0022725414,0.0034021128,0.0030333877,0.0028616046,0.002012112],"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.0005077605,0.00039973017,0.002955253,0.00078431895,0.000117368974,0.00051644316,0.0005298439,0.4588436,0.011083502,0.36544922,0.018290907,0.14052203],"study_design_scores_gemma":[0.00015514862,0.00008006743,0.0002631549,0.00006660893,0.000035392066,0.0001121726,0.00012650367,0.8173522,0.012382327,0.16118634,0.008212095,0.000028093153],"about_ca_topic_score_codex":0.0041574677,"about_ca_topic_score_gemma":0.0068299915,"teacher_disagreement_score":0.012167935,"about_ca_system_score_codex":0.0018878469,"about_ca_system_score_gemma":0.0048486986,"threshold_uncertainty_score":0.0407058},"labels":[],"label_agreement":null},{"id":"W4401103106","doi":"10.1007/s10878-024-01193-z","title":"Maximizing stochastic set function under a matroid constraint from decomposition","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Matroid; Combinatorics; Pi; Lattice (music); Physics; Mathematics; Discrete mathematics","score_opus":0.016183519577256323,"score_gpt":0.26374662749282485,"score_spread":0.24756310791556851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401103106","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.036330484,0.00021509246,0.9556914,0.0005258006,0.00004936339,0.000049034064,0.00024131614,0.00020097867,0.006696469],"genre_scores_gemma":[0.69017226,0.0005217436,0.2965086,0.00035744638,0.00023530086,0.000273209,0.000778669,0.0003880621,0.010764777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986326,0.00057201757,0.00004926171,0.00026486182,0.00032375846,0.00015742428],"domain_scores_gemma":[0.99736905,0.0014795851,0.00024468522,0.00029087145,0.00033266496,0.00028308752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019981205,0.0010363286,0.0020661622,0.0009415146,0.0005027621,0.0020446,0.001677669,0.001594067,0.003755062],"category_scores_gemma":[0.0062771114,0.00073132664,0.0011577394,0.0013794295,0.0010201479,0.0023503776,0.0023205702,0.0019072018,0.0005030682],"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.00019019116,0.00018077112,0.0009129568,0.0002495924,0.0001151111,0.00020896264,0.00011944221,0.5358267,0.00765696,0.40709698,0.0074789836,0.03996338],"study_design_scores_gemma":[0.000012007649,0.000033336357,0.00018129496,0.000012783393,0.000014672313,0.000075178395,0.000011043455,0.8930246,0.00082236796,0.105033815,0.00076890405,0.000010020947],"about_ca_topic_score_codex":0.0012869291,"about_ca_topic_score_gemma":0.0011098814,"teacher_disagreement_score":0.003755062,"about_ca_system_score_codex":0.0015993827,"about_ca_system_score_gemma":0.0015209182,"threshold_uncertainty_score":0.012561917},"labels":[],"label_agreement":null},{"id":"W4402057635","doi":"10.1061/9780784485569.067","title":"Concrete Solutions: Repurposing Existing C76 Gravity Pipe to Save $1M and Costly Permitting Delays","year":2024,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Stantec (Canada)","funders":"","keywords":"Repurposing; Computer science; Engineering; Waste management","score_opus":0.05934920457637657,"score_gpt":0.29619355814957826,"score_spread":0.2368443535732017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402057635","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.1397031,0.00094712165,0.63702196,0.010635764,0.0009674415,0.000678211,0.0011242002,0.0108661335,0.19805616],"genre_scores_gemma":[0.48193696,0.0008008864,0.44543985,0.0009996517,0.00017486144,0.00027558565,0.0012965045,0.0007831554,0.06829264],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992895,0.00012999015,0.000023128003,0.00012656824,0.00027230315,0.00015851039],"domain_scores_gemma":[0.99854505,0.00019944488,0.00013825779,0.0004566164,0.00043366084,0.00022707938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008127712,0.0008042805,0.00030682495,0.0009228587,0.0012541548,0.00092050695,0.0016954466,0.0009783198,0.035521258],"category_scores_gemma":[0.0031007873,0.00030425368,0.0004809888,0.0010752585,0.00057360594,0.0021930598,0.0017801234,0.0011173855,0.007776948],"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.00029296472,0.00044118305,0.002385956,0.00034499043,0.000059418217,0.00064433593,0.0004005835,0.091175795,0.021524657,0.12281144,0.11675991,0.6431588],"study_design_scores_gemma":[0.00023315694,0.0009114533,0.0047575426,0.000310763,0.00010112236,0.0011056181,0.0015458941,0.25063717,0.022658654,0.14214195,0.57546407,0.00013252033],"about_ca_topic_score_codex":0.009477272,"about_ca_topic_score_gemma":0.030636532,"teacher_disagreement_score":0.035521258,"about_ca_system_score_codex":0.0014679318,"about_ca_system_score_gemma":0.0023613842,"threshold_uncertainty_score":0.1188305},"labels":[],"label_agreement":null},{"id":"W4402564803","doi":"10.1016/j.disopt.2024.100860","title":"Approximation schemes for Min-Sum <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si35.svg\" display=\"inline\" id=\"d1e488\"><mml:mi>k</mml:mi></mml:math>-Clustering","year":2024,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cluster analysis; Mathematics; Algorithm; Computer science; Combinatorics; Computer graphics (images); Statistics","score_opus":0.020656615144146215,"score_gpt":0.2545916724953852,"score_spread":0.233935057351239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402564803","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.030178376,0.0038615821,0.9488713,0.0021969604,0.00029007392,0.00025531446,0.001315782,0.0024956653,0.010534901],"genre_scores_gemma":[0.3554804,0.0023326117,0.62609833,0.0010565609,0.00042595773,0.00048265516,0.0036005522,0.0010846654,0.00943819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99530184,0.0010128644,0.00029648267,0.0012194936,0.0014097034,0.00075964804],"domain_scores_gemma":[0.9918201,0.003850221,0.00067374896,0.0022808823,0.0009948935,0.00038013706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039706402,0.0031747087,0.0031769187,0.0020474126,0.0017297938,0.0041626985,0.005996537,0.0028749628,0.008235549],"category_scores_gemma":[0.017334573,0.00091042597,0.0029411495,0.004336632,0.0016084012,0.009193225,0.0047572968,0.0046891207,0.0038838976],"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.0014754352,0.00046819396,0.0027710688,0.0014213804,0.00033493244,0.00019503596,0.0007561756,0.5279212,0.0049931398,0.1537429,0.03377086,0.27214968],"study_design_scores_gemma":[0.000059739297,0.00013957643,0.00038077973,0.000089170084,0.00007414163,0.00026955965,0.00017394472,0.84458464,0.0028230504,0.1439499,0.007418457,0.00003703726],"about_ca_topic_score_codex":0.0048559103,"about_ca_topic_score_gemma":0.007288126,"teacher_disagreement_score":0.008235549,"about_ca_system_score_codex":0.0053838347,"about_ca_system_score_gemma":0.0031213167,"threshold_uncertainty_score":0.03906262},"labels":[],"label_agreement":null},{"id":"W4402855487","doi":"10.3390/math12192995","title":"Generalized Shortest Path Problem: An Innovative Approach for Non-Additive Problems in Conditional Weighted Graphs","year":2024,"lang":"en","type":"article","venue":"Mathematics","topic":"Complexity and Algorithms in Graphs","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":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Shortest path problem; Longest path problem; Mathematics; Path (computing); Widest path problem; Combinatorics; Mathematical optimization; Computer science; Discrete mathematics; Graph","score_opus":0.03580666959357446,"score_gpt":0.2776638185410328,"score_spread":0.24185714894745833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402855487","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.0032821225,0.00016479965,0.9944073,0.000272053,0.000042182615,0.00006261475,0.00004867558,0.000059324535,0.0016608379],"genre_scores_gemma":[0.19062635,0.0013699488,0.80009955,0.00028530165,0.00037882608,0.00050854665,0.00044117327,0.00025866026,0.0060317083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760926,0.0010290522,0.00010137695,0.00051117706,0.00057806633,0.00017114321],"domain_scores_gemma":[0.9958734,0.0028956672,0.0003057155,0.00039227257,0.00033956423,0.00019341311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002629257,0.0017577918,0.001232665,0.0019375215,0.0009888456,0.0019290247,0.003237086,0.0017021067,0.0051046954],"category_scores_gemma":[0.008127899,0.0006220331,0.0016096276,0.0028584038,0.0021166198,0.005376733,0.0031844475,0.0038896312,0.0006489664],"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.00006532238,0.000120155884,0.0004974679,0.0004579765,0.00008443587,0.00017326753,0.00020289082,0.298115,0.002527101,0.62110925,0.0050313342,0.07161582],"study_design_scores_gemma":[0.000016688971,0.000061433275,0.00017086051,0.00003840827,0.00003088323,0.0001239775,0.0000638802,0.57344973,0.00081555446,0.41831622,0.006892886,0.000019501786],"about_ca_topic_score_codex":0.0017544917,"about_ca_topic_score_gemma":0.0022684615,"teacher_disagreement_score":0.0051046954,"about_ca_system_score_codex":0.0018331324,"about_ca_system_score_gemma":0.0021768815,"threshold_uncertainty_score":0.01707691},"labels":[],"label_agreement":null},{"id":"W4404168112","doi":"10.1145/3717823.3718233","title":"Distributed Quantum Advantage for Local Problems","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Core Research for Evolutional Science and Technology; National Science Foundation; Institut national de recherche en informatique et en automatique (INRIA); Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Japan Society for the Promotion of Science; Ministry of Education, Culture, Sports, Science and Technology; Agence Nationale de la Recherche","keywords":"Iterated function; Constant (computer programming); Omega; Computer science; Distributed algorithm; Quantum; Quantum algorithm; Mathematics; Discrete mathematics; Quantum mechanics; Physics; Distributed computing","score_opus":0.031124418485892587,"score_gpt":0.29088518299159216,"score_spread":0.25976076450569957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404168112","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.099274136,0.0007327915,0.8269979,0.007932117,0.00022402845,0.0002865466,0.00033652023,0.0011832291,0.06303277],"genre_scores_gemma":[0.86935514,0.000372993,0.109844744,0.001150329,0.0002581268,0.0005336487,0.00024804572,0.000477921,0.017758908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955141,0.0016079259,0.00015195273,0.0011055255,0.0010322738,0.0005883087],"domain_scores_gemma":[0.98038745,0.01336422,0.00082046667,0.0040710475,0.0006891281,0.00066774565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037877457,0.0006366464,0.0013659383,0.000641259,0.002350257,0.003526634,0.0031272245,0.0022938324,0.017455589],"category_scores_gemma":[0.019126657,0.000536644,0.001674416,0.00079094723,0.004722227,0.010557201,0.006937525,0.0065224157,0.0015884716],"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.0001603612,0.00006007498,0.00021331054,0.00013536983,0.000030011706,0.00005968409,0.00021917858,0.0146880215,0.002105215,0.96902275,0.0024187197,0.010887291],"study_design_scores_gemma":[0.00008186084,0.000056967147,0.00016937777,0.00002225863,0.000032708926,0.00006531528,0.000080022284,0.0997611,0.0026778227,0.8915732,0.0054574437,0.000021970836],"about_ca_topic_score_codex":0.0010655223,"about_ca_topic_score_gemma":0.00130468,"teacher_disagreement_score":0.017455589,"about_ca_system_score_codex":0.0034284943,"about_ca_system_score_gemma":0.0023874296,"threshold_uncertainty_score":0.05839473},"labels":[],"label_agreement":null},{"id":"W4404848383","doi":"10.1109/focs61266.2024.00061","title":"Approximation Algorithms for Noncommutative CSPs","year":2024,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"European Commission; Office of Science; Villum Fonden; U.S. Department of Energy","keywords":"Noncommutative geometry; Computer science; Approximation algorithm; Algorithm; Theoretical computer science; Mathematics; Pure mathematics","score_opus":0.048695906007020597,"score_gpt":0.31913695464619485,"score_spread":0.27044104863917423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404848383","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.06460236,0.0004636508,0.9274556,0.0008417935,0.000068057845,0.00008064276,0.00021375368,0.00095805794,0.0053160996],"genre_scores_gemma":[0.58341414,0.0004539269,0.40903166,0.00032614163,0.00013348203,0.00016720935,0.0011473127,0.00035878932,0.004967361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765694,0.000602504,0.00018559713,0.0005261635,0.0007140891,0.0003146812],"domain_scores_gemma":[0.9934362,0.0040510776,0.00043129278,0.0013128791,0.0005092204,0.00025931705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023589819,0.000800725,0.0009337478,0.001027777,0.0007474369,0.002053948,0.0027343468,0.0010818116,0.004524345],"category_scores_gemma":[0.010991069,0.0003468445,0.0012203215,0.0021617983,0.0013737438,0.005627759,0.0029528926,0.003105003,0.00064597087],"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.00031249048,0.00028677957,0.0018960133,0.00025660582,0.00010374023,0.00014515093,0.00039638087,0.30226922,0.0034489918,0.54227316,0.006151778,0.14245978],"study_design_scores_gemma":[0.00003919798,0.000025447327,0.00020178592,0.000012739661,0.000014368817,0.000059665446,0.000060356615,0.70483005,0.0015017332,0.29141626,0.0018283825,0.000009989238],"about_ca_topic_score_codex":0.002532154,"about_ca_topic_score_gemma":0.004221098,"teacher_disagreement_score":0.004524345,"about_ca_system_score_codex":0.002536257,"about_ca_system_score_gemma":0.0019253113,"threshold_uncertainty_score":0.018401861},"labels":[],"label_agreement":null},{"id":"W4405179551","doi":"10.26599/tst.2023.9010121","title":"Maximization of k-Submodular Function with d-Knapsack Constraints Over Sliding Window","year":2024,"lang":"en","type":"article","venue":"Tsinghua Science & Technology","topic":"Complexity and Algorithms in Graphs","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":"National Natural Science Foundation of China","keywords":"Submodular set function; Knapsack problem; Sliding window protocol; Maximization; Window (computing); Function (biology); Mathematics; Mathematical optimization; Computer science; Biology","score_opus":0.010435708302929282,"score_gpt":0.23778928449261688,"score_spread":0.2273535761896876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405179551","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.011857511,0.0008527858,0.9843962,0.00031429672,0.00007026827,0.00011618372,0.00023663217,0.00039178217,0.0017644579],"genre_scores_gemma":[0.39856744,0.0017602073,0.5915769,0.0005247619,0.00017540882,0.00076202373,0.0011300932,0.00034716283,0.0051560123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984914,0.00051737425,0.00008025536,0.0004569085,0.00022631655,0.00022781572],"domain_scores_gemma":[0.99726355,0.0018976774,0.000294956,0.0001908386,0.00020204147,0.00015094905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022985952,0.0023852603,0.0034257912,0.00095017895,0.00064360554,0.0015842814,0.002452525,0.0015789218,0.005430687],"category_scores_gemma":[0.0051017734,0.0009438072,0.0014400512,0.0031212945,0.0009806621,0.0029103237,0.0018178221,0.0024923105,0.00096434035],"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.00021770824,0.00015831302,0.0007089281,0.0003954315,0.00010849723,0.00013116302,0.00006525855,0.90601164,0.0015068614,0.018358959,0.005395571,0.06694156],"study_design_scores_gemma":[0.000023761304,0.000050405062,0.00010569672,0.000011727125,0.000011980339,0.000027676913,0.000019865225,0.99007916,0.0005084341,0.008627423,0.0005237782,0.000010112249],"about_ca_topic_score_codex":0.007589586,"about_ca_topic_score_gemma":0.0075666024,"teacher_disagreement_score":0.007589586,"about_ca_system_score_codex":0.0019311998,"about_ca_system_score_gemma":0.0025240171,"threshold_uncertainty_score":0.018167496},"labels":[],"label_agreement":null},{"id":"W4405206838","doi":"10.1007/s10107-024-02166-0","title":"On rank-monotone graph operations and minimal obstruction graphs for the Lovász–Schrijver SDP hierarchy","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","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; University of Saskatchewan","funders":"","keywords":"Combinatorics; Mathematics; Polytope; Vertex (graph theory); Rank (graph theory); Graph; Operator (biology); Discrete mathematics; Monotone polygon","score_opus":0.027944331652606805,"score_gpt":0.28410354848886915,"score_spread":0.25615921683626236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405206838","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.4350491,0.0024036162,0.335354,0.008786525,0.00041568367,0.00016340645,0.0010912609,0.0006463923,0.21609005],"genre_scores_gemma":[0.9264651,0.0012611854,0.04923093,0.0009880416,0.0005847645,0.00015534718,0.00091062527,0.00024671026,0.020157212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899703,0.00029078856,0.000047460875,0.00016545581,0.00029766795,0.00020147944],"domain_scores_gemma":[0.9975388,0.0013371164,0.00023296903,0.00024972513,0.00023561632,0.00040581342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012239366,0.0008062641,0.0014402693,0.0026081868,0.0026888843,0.004126968,0.0016243119,0.0015984076,0.009755718],"category_scores_gemma":[0.0051670936,0.00057920115,0.0014248373,0.0025608074,0.0037963793,0.008119005,0.0029833706,0.0047289636,0.0008663508],"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.000008805719,0.000013934257,0.000071165596,0.000021773338,0.0000031183943,0.000018163682,0.00008867088,0.0007933169,0.00014146195,0.9964281,0.0007682451,0.0016432267],"study_design_scores_gemma":[0.000004836836,0.000002850861,0.00006543269,0.000004555432,0.000002293958,0.000013096538,0.000025188852,0.004158615,0.000037693484,0.99507457,0.0006065193,0.0000044008743],"about_ca_topic_score_codex":0.0030967128,"about_ca_topic_score_gemma":0.0032847172,"teacher_disagreement_score":0.009755718,"about_ca_system_score_codex":0.002787,"about_ca_system_score_gemma":0.0013344581,"threshold_uncertainty_score":0.032636166},"labels":[],"label_agreement":null},{"id":"W4406247024","doi":"10.1007/s00446-024-00475-3","title":"($$\\Delta + 1$$) vertex coloring in O(n) communication","year":2025,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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":"University of Waterloo","keywords":"Combinatorics; Fractional coloring; Vertex (graph theory); Complete coloring; List coloring; Mathematics; Computer science; Graph; Line graph","score_opus":0.013701662946639616,"score_gpt":0.2683874029262402,"score_spread":0.2546857399796006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406247024","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.16375248,0.0012210347,0.67530155,0.010083989,0.0013194709,0.0009789455,0.0030702166,0.011123798,0.13314846],"genre_scores_gemma":[0.5223725,0.0007864247,0.4024832,0.0016289443,0.0006042898,0.0010319253,0.0026541962,0.0017584254,0.06668014],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724835,0.0007509329,0.00012737664,0.0007031737,0.00053181214,0.00063844124],"domain_scores_gemma":[0.9937589,0.0031491735,0.00034755073,0.0020652234,0.0002723921,0.0004067461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011217287,0.0016632179,0.0012778954,0.000979969,0.002002366,0.0035155052,0.003797943,0.0016596137,0.041873734],"category_scores_gemma":[0.0054659946,0.0006478161,0.001414329,0.002955235,0.0013256408,0.0055066287,0.0036253852,0.001952165,0.009840458],"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.0040554167,0.0019489134,0.004816294,0.0014565159,0.0003242683,0.00071180786,0.00045416842,0.22880757,0.036342934,0.097956784,0.09961303,0.5235123],"study_design_scores_gemma":[0.0015228225,0.00033571303,0.0032562155,0.00015134558,0.0003091865,0.00077266415,0.0005339243,0.6944885,0.021086147,0.2439471,0.033503085,0.00009327768],"about_ca_topic_score_codex":0.007054407,"about_ca_topic_score_gemma":0.022021778,"teacher_disagreement_score":0.041873734,"about_ca_system_score_codex":0.0040565873,"about_ca_system_score_gemma":0.004317493,"threshold_uncertainty_score":0.14008158},"labels":[],"label_agreement":null},{"id":"W4407126070","doi":"10.1007/978-3-031-83438-7_16","title":"Algorithms and Hardness Results for the (3, 1)-Cover Problem","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"Carleton University","funders":"","keywords":"Computer science; Cover (algebra); Algorithm; Theoretical computer science; Mechanical engineering; Engineering","score_opus":0.02337062143164717,"score_gpt":0.25785019098540135,"score_spread":0.23447956955375418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407126070","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.12450547,0.011388521,0.5196059,0.02942491,0.0019055502,0.0009716744,0.0076333922,0.0033353723,0.3012292],"genre_scores_gemma":[0.42705414,0.011161851,0.42500377,0.007118861,0.0046715047,0.0021183807,0.01623493,0.0029565603,0.10367997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972119,0.0005659225,0.00014663444,0.0007533963,0.00083542266,0.00048673293],"domain_scores_gemma":[0.9893974,0.008456035,0.0004990138,0.0009640601,0.0003080313,0.00037533825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020514806,0.0028944088,0.0026291357,0.002098014,0.0036348503,0.008793257,0.0063655213,0.005588608,0.02974703],"category_scores_gemma":[0.010299397,0.002053086,0.0047005913,0.005591555,0.00386196,0.018191617,0.0052196723,0.014827789,0.0053012613],"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.0012412725,0.0010097608,0.0016998154,0.0019243456,0.00023531224,0.0003152359,0.0007886541,0.049659006,0.004396631,0.6761216,0.1191728,0.14343569],"study_design_scores_gemma":[0.00019900381,0.00006214542,0.0007411878,0.00013282911,0.00010698473,0.00034299394,0.00015653422,0.052112103,0.001894975,0.92573816,0.018460933,0.000052201594],"about_ca_topic_score_codex":0.002659912,"about_ca_topic_score_gemma":0.0027562159,"teacher_disagreement_score":0.02974703,"about_ca_system_score_codex":0.004050758,"about_ca_system_score_gemma":0.002781701,"threshold_uncertainty_score":0.09951377},"labels":[],"label_agreement":null},{"id":"W4408059813","doi":"10.1016/j.ipl.2025.106572","title":"A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees","year":2025,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Complexity and Algorithms in Graphs","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Simple (philosophy); Binary number; Mathematics; Binary tree; Algorithm; Combinatorics; Weight-balanced tree; Tree (set theory); Binary search tree; Arithmetic","score_opus":0.015516512004594286,"score_gpt":0.2570153997252107,"score_spread":0.24149888772061642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408059813","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.028733103,0.00040688703,0.9590368,0.00073355634,0.00012123543,0.0003418362,0.0004109264,0.0027448693,0.0074708727],"genre_scores_gemma":[0.11636829,0.00014499949,0.8791697,0.00024200129,0.0000650749,0.0003452429,0.0008680526,0.00029269815,0.0025039478],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983321,0.00028243006,0.000108494474,0.00036559242,0.0004906862,0.00042064482],"domain_scores_gemma":[0.9974674,0.0013601586,0.00021497264,0.00047491607,0.00033560148,0.00014699185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012629024,0.0014667223,0.0014425946,0.0011285567,0.001147165,0.0020523074,0.0022849622,0.0017338177,0.010309657],"category_scores_gemma":[0.0053705787,0.00075150974,0.0014996199,0.002245893,0.0007508944,0.0037099875,0.002536806,0.0034096988,0.0026712704],"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.0010692463,0.00076245755,0.0015835383,0.00063564157,0.00011515054,0.00031542088,0.00055669044,0.3354999,0.015897874,0.075222336,0.027206559,0.5411352],"study_design_scores_gemma":[0.0002722035,0.00013945234,0.00025949674,0.000051925836,0.000035321435,0.00021635083,0.00016381353,0.9012407,0.0042446284,0.08606655,0.007280682,0.000028820217],"about_ca_topic_score_codex":0.0028023391,"about_ca_topic_score_gemma":0.0042227902,"teacher_disagreement_score":0.010309657,"about_ca_system_score_codex":0.002023998,"about_ca_system_score_gemma":0.0028713017,"threshold_uncertainty_score":0.034489274},"labels":[],"label_agreement":null},{"id":"W4408293789","doi":"10.1145/3723141.3723144","title":"Complexity Column","year":2025,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Complexity and Algorithms in Graphs","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":"Column (typography); Computer science; Computer network","score_opus":0.04422964664292883,"score_gpt":0.2960666793611475,"score_spread":0.25183703271821867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408293789","genre_codex":"methods","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.016853807,0.021997578,0.5175707,0.030402638,0.0042944155,0.00040018256,0.0076681953,0.0030022096,0.39781037],"genre_scores_gemma":[0.43499947,0.026302587,0.26359424,0.008112792,0.0071265157,0.0012939989,0.017846921,0.0025964747,0.23812713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964988,0.0005735449,0.00016907051,0.0012214266,0.0011449766,0.00039208174],"domain_scores_gemma":[0.99189174,0.0034736847,0.00032511086,0.0027230883,0.0011886563,0.00039764642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016261302,0.0012749151,0.001477682,0.0013853314,0.0018267913,0.008249156,0.0025551757,0.0017475954,0.050931234],"category_scores_gemma":[0.012141409,0.000637095,0.0013864837,0.0028436345,0.0018562133,0.008525209,0.0028819044,0.006925679,0.016147872],"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.0001593766,0.000104792314,0.0006926048,0.00043821734,0.00007919423,0.000073181945,0.00011828208,0.014063454,0.0013638049,0.6714107,0.14151764,0.16997881],"study_design_scores_gemma":[0.000026509762,0.000043581676,0.00059372373,0.00012012614,0.00003504512,0.00028129847,0.00006636343,0.051634837,0.0013623913,0.79532456,0.15048175,0.000029695304],"about_ca_topic_score_codex":0.0024454577,"about_ca_topic_score_gemma":0.002341569,"teacher_disagreement_score":0.050931234,"about_ca_system_score_codex":0.0037786018,"about_ca_system_score_gemma":0.003017027,"threshold_uncertainty_score":0.17038196},"labels":[],"label_agreement":null},{"id":"W4409280356","doi":"10.1145/3728631","title":"Maximum Flow and Minimum-Cost Flow in Almost-Linear Time","year":2025,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"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; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Minimum-cost flow problem; Flow (mathematics); Maximum flow problem; Mathematics; Computer science; Mathematical optimization; Geometry","score_opus":0.015960487311521922,"score_gpt":0.2604227304612225,"score_spread":0.24446224314970058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409280356","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.042394556,0.00023501045,0.94486344,0.00051381293,0.00006095308,0.00016121744,0.000623652,0.004620914,0.0065264646],"genre_scores_gemma":[0.29145688,0.00015187038,0.70192796,0.00017951128,0.00006781746,0.00022464366,0.0017968571,0.0007996465,0.0033948158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901533,0.00017566132,0.00006251939,0.000295905,0.0002881627,0.00016237327],"domain_scores_gemma":[0.9978009,0.0011377688,0.00020466083,0.00047576084,0.0002952723,0.00008565202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085275515,0.0014515138,0.000858074,0.0011219595,0.00076075655,0.0016016802,0.0016605692,0.0012780068,0.0060653016],"category_scores_gemma":[0.00734357,0.00059675495,0.00092579104,0.0015275715,0.0008578877,0.0039030025,0.0013965154,0.001656682,0.0015210913],"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.00052180677,0.00022087115,0.0021273184,0.0003125757,0.00009184873,0.0001324299,0.00023242524,0.6082665,0.0088901725,0.06833792,0.0135226175,0.29734355],"study_design_scores_gemma":[0.000037366557,0.000025679748,0.0002387086,0.000012560424,0.00001063953,0.00004999516,0.000036713744,0.9297438,0.0028540036,0.06524307,0.0017379053,0.0000095064115],"about_ca_topic_score_codex":0.0062708594,"about_ca_topic_score_gemma":0.007973064,"teacher_disagreement_score":0.0062708594,"about_ca_system_score_codex":0.0020312297,"about_ca_system_score_gemma":0.0026053467,"threshold_uncertainty_score":0.020290494},"labels":[],"label_agreement":null},{"id":"W4409704918","doi":"10.1007/s10107-025-02209-0","title":"A primal-dual extension of the Goemans–Williamson algorithm for the weighted fractional cut-covering problem","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Extension (predicate logic); Mathematics; Dual (grammatical number); Combinatorics; Algorithm; Maximum cut; Applied mathematics; Mathematical optimization; Computer science; Graph","score_opus":0.020471976019507402,"score_gpt":0.2747189467901412,"score_spread":0.2542469707706338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409704918","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.011884451,0.0003984098,0.9725882,0.0004785874,0.0002117511,0.000104238825,0.00009214919,0.0001811376,0.014060982],"genre_scores_gemma":[0.22992346,0.00055723323,0.75325423,0.00045062217,0.0002982384,0.00033945296,0.00035406323,0.0003083071,0.014514358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990387,0.00039487914,0.000028511613,0.00016760577,0.00024985409,0.000120529454],"domain_scores_gemma":[0.99890685,0.00061161804,0.00006706042,0.00012332405,0.00018749642,0.00010358022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019257858,0.0011095178,0.0014463947,0.0014095167,0.0008028307,0.0020330022,0.0024340705,0.0021352232,0.008582596],"category_scores_gemma":[0.0054125804,0.0006573435,0.0011371451,0.0016807169,0.0011295704,0.0021723486,0.0022256952,0.0029776902,0.0011026048],"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.0003340051,0.00044404157,0.0006014839,0.00032540868,0.00010944187,0.0001473259,0.00015583796,0.39975852,0.003534362,0.36888015,0.014694982,0.21101438],"study_design_scores_gemma":[0.000034769924,0.0000447636,0.000083395906,0.00003767353,0.000015829844,0.00006332578,0.000016269503,0.91253954,0.0005426365,0.083011545,0.0035994097,0.00001093765],"about_ca_topic_score_codex":0.0018064479,"about_ca_topic_score_gemma":0.0020862224,"teacher_disagreement_score":0.008582596,"about_ca_system_score_codex":0.0014809248,"about_ca_system_score_gemma":0.0018122394,"threshold_uncertainty_score":0.028711617},"labels":[],"label_agreement":null},{"id":"W4410951340","doi":"10.1007/s10878-025-01311-5","title":"Approximation algorithms for the total dominating set problem","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Dominating set; Theory of computation; Approximation algorithm; Algorithm; Set (abstract data type); Set cover problem; Mathematics; Computer science; Mathematical optimization; Combinatorics; Graph; Vertex (graph theory)","score_opus":0.018128412770283365,"score_gpt":0.27632276594259153,"score_spread":0.25819435317230816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410951340","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.038682938,0.0038475476,0.9355152,0.0030700476,0.00059833453,0.00025106163,0.0007474095,0.0011367116,0.016150722],"genre_scores_gemma":[0.4425764,0.003319315,0.53646266,0.0011686769,0.00083222537,0.0005825668,0.0022336403,0.0006361252,0.012188321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715865,0.0010015935,0.00013189406,0.00055063877,0.0006986131,0.0004586233],"domain_scores_gemma":[0.9890542,0.008201197,0.0005005649,0.0010832142,0.00065051886,0.0005103111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00379405,0.0022314896,0.0032134538,0.0022489736,0.0014189071,0.004420963,0.0048235557,0.002561056,0.006005918],"category_scores_gemma":[0.016443964,0.0010943589,0.002113735,0.004288648,0.0014507815,0.006596043,0.0030401205,0.004542878,0.0011050127],"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.0010121778,0.0007240938,0.00149396,0.00065750536,0.0002850798,0.00010347075,0.00030935262,0.62508696,0.0015344584,0.13043843,0.026899166,0.21145529],"study_design_scores_gemma":[0.00015167843,0.000090163514,0.00018962425,0.000042089297,0.0000748409,0.00008398227,0.00006464439,0.87850916,0.0004330313,0.117658496,0.0026876272,0.000014678473],"about_ca_topic_score_codex":0.004353843,"about_ca_topic_score_gemma":0.0057807043,"teacher_disagreement_score":0.006005918,"about_ca_system_score_codex":0.004157118,"about_ca_system_score_gemma":0.0032778007,"threshold_uncertainty_score":0.030162096},"labels":[],"label_agreement":null},{"id":"W4411141691","doi":"10.1145/3725235","title":"Fast Matrix Multiplication meets the Submodular Width","year":2025,"lang":"en","type":"article","venue":"Proceedings of the ACM on Management of Data","topic":"Complexity and Algorithms in Graphs","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":"Universitas Brawijaya","keywords":"Matrix multiplication; Submodular set function; Multiplication (music); Matrix (chemical analysis); Computer science; Mathematics; Arithmetic; Combinatorics; Physics; Materials science","score_opus":0.0438812084694511,"score_gpt":0.3106361800602223,"score_spread":0.2667549715907712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411141691","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.079799905,0.002171641,0.8963785,0.007230886,0.00022262683,0.00034133784,0.0015845204,0.0020073594,0.010263243],"genre_scores_gemma":[0.6055515,0.0016240686,0.38183513,0.0021885277,0.0010559871,0.00070901896,0.0014201353,0.00067393115,0.0049417205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9912349,0.001926647,0.000701551,0.002892561,0.002035923,0.0012083545],"domain_scores_gemma":[0.96171135,0.02605462,0.0020887894,0.0074821715,0.0017563405,0.00090666825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055986997,0.002120182,0.0031925652,0.001435435,0.0015560677,0.007350797,0.0033150245,0.0028490233,0.006124865],"category_scores_gemma":[0.03382564,0.0012754186,0.0029335357,0.003613947,0.0036336381,0.027274953,0.004628514,0.006633448,0.0017730101],"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.002000887,0.00058162864,0.0037989216,0.001423446,0.00027351294,0.00032379612,0.0010600699,0.11677308,0.022326613,0.5965684,0.022496352,0.2323732],"study_design_scores_gemma":[0.00009803737,0.00020118515,0.0004680363,0.000050899303,0.000059199614,0.0003810377,0.00016408981,0.20460333,0.0063030478,0.78322875,0.0043984717,0.000043842596],"about_ca_topic_score_codex":0.0024352667,"about_ca_topic_score_gemma":0.001981932,"teacher_disagreement_score":0.007350797,"about_ca_system_score_codex":0.0027352897,"about_ca_system_score_gemma":0.003355478,"threshold_uncertainty_score":0.029609084},"labels":[],"label_agreement":null},{"id":"W4411278309","doi":"10.1145/3732772.3733530","title":"Brief Announcement: Distributed Graph Algorithms with Predictions","year":2025,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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","keywords":"Computer science; Distributed algorithm; Algorithm; Theoretical computer science; Distributed computing","score_opus":0.01203827415186444,"score_gpt":0.23897547277520506,"score_spread":0.2269371986233406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411278309","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.011866814,0.03591511,0.412899,0.26119283,0.18568613,0.0005566393,0.0039153225,0.0067377836,0.08123036],"genre_scores_gemma":[0.32383636,0.039988667,0.1349732,0.042575378,0.2757644,0.00096399453,0.010334918,0.002986619,0.1685764],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767095,0.0009808077,0.000101973856,0.0003435713,0.0007043984,0.0001982902],"domain_scores_gemma":[0.9857717,0.00931849,0.00041140028,0.0008880358,0.0025012656,0.0011090809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005098916,0.0013028485,0.0010866625,0.0012091375,0.001153236,0.003308375,0.001603547,0.0035441953,0.024808077],"category_scores_gemma":[0.023780262,0.0006210098,0.0006384395,0.0021654838,0.0014043207,0.0065335,0.0009131861,0.0064972513,0.008562398],"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.00032957387,0.00010822104,0.0005746494,0.0004075201,0.000047987272,0.00013552787,0.00006799474,0.0058874353,0.0009421334,0.08534361,0.8047532,0.10140218],"study_design_scores_gemma":[0.0003214561,0.00077776535,0.0015074953,0.0002822575,0.00012546129,0.00040870893,0.00014780092,0.07908111,0.004635073,0.23649023,0.67607766,0.00014497967],"about_ca_topic_score_codex":0.0012261092,"about_ca_topic_score_gemma":0.0012187278,"teacher_disagreement_score":0.024808077,"about_ca_system_score_codex":0.0015180078,"about_ca_system_score_gemma":0.0010804526,"threshold_uncertainty_score":0.0829913},"labels":[],"label_agreement":null},{"id":"W4411319863","doi":"10.1145/3717823.3718265","title":"Vizing’s Theorem in Near-Linear Time","year":2025,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"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":"University of Waterloo; Natural Sciences and Engineering Research Council of Canada; European Commission; Simons Institute for the Theory of Computing, University of California Berkeley; United States-Israel Binational Science Foundation; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Computer science; Mathematics","score_opus":0.010081720040346649,"score_gpt":0.2535451831704213,"score_spread":0.24346346313007464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411319863","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.03984879,0.0018752675,0.90356666,0.0053944984,0.0008238612,0.0007221073,0.001957582,0.017294427,0.02851685],"genre_scores_gemma":[0.3928995,0.0013906296,0.57783437,0.0026105633,0.00069944456,0.00089425105,0.004345695,0.0023046632,0.01702084],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99090636,0.0016870098,0.00081576634,0.0032449411,0.002157419,0.0011884395],"domain_scores_gemma":[0.9769564,0.010607981,0.0011193379,0.009508757,0.0014366197,0.00037096054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003977295,0.0028104323,0.0021513586,0.0018335511,0.0020586809,0.004686898,0.0055882023,0.002937301,0.015460418],"category_scores_gemma":[0.020131925,0.0015190946,0.0039259307,0.0038507185,0.0027098171,0.009727952,0.006097299,0.005303349,0.008730433],"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.0032703718,0.00059562805,0.005306586,0.0020405168,0.00068307825,0.0005129151,0.0007498012,0.11967535,0.036278088,0.27535853,0.07866919,0.47685987],"study_design_scores_gemma":[0.0006510341,0.00033696642,0.0014146197,0.00012026107,0.00032192006,0.0008089774,0.00024961628,0.29561767,0.02059125,0.63722587,0.04251617,0.00014554782],"about_ca_topic_score_codex":0.002711378,"about_ca_topic_score_gemma":0.0038817006,"teacher_disagreement_score":0.015460418,"about_ca_system_score_codex":0.004029342,"about_ca_system_score_gemma":0.004986257,"threshold_uncertainty_score":0.05172032},"labels":[],"label_agreement":null},{"id":"W4411320007","doi":"10.1145/3717823.3718303","title":"When Connectivity Is Hard, Random Walks Are Easy with Non-determinism","year":2025,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Random walk; Computer science; Determinism; Theoretical computer science; Statistical physics; Mathematics; Physics; Statistics","score_opus":0.015476538454911475,"score_gpt":0.2387348822514241,"score_spread":0.22325834379651263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411320007","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.5068298,0.0047013094,0.33447576,0.00937812,0.0008897879,0.00023448747,0.0020504103,0.0014177276,0.14002268],"genre_scores_gemma":[0.95093215,0.0013638643,0.026396843,0.00037310927,0.0006454581,0.00018783902,0.00096120354,0.0003528023,0.018786715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99736124,0.0006766295,0.0001581279,0.0008801819,0.00041718085,0.00050661043],"domain_scores_gemma":[0.9837345,0.012473885,0.0008795247,0.0012527693,0.00058614457,0.0010731703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001263309,0.0007442087,0.0016608711,0.002457009,0.0021228944,0.0055390797,0.0015846187,0.0018949197,0.007893871],"category_scores_gemma":[0.015801704,0.0011087909,0.0016231587,0.001771952,0.0030708017,0.0052605453,0.0031458044,0.004206254,0.00096983556],"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.00040933935,0.00016697534,0.0018191178,0.0003882641,0.00009922782,0.00044461346,0.00038109606,0.038157504,0.0025322612,0.91984546,0.010241369,0.025514735],"study_design_scores_gemma":[0.000040942155,0.00003185381,0.00089296524,0.00003991771,0.00002786501,0.00020731891,0.00006319535,0.059805453,0.00090916606,0.93518096,0.0027688243,0.00003141378],"about_ca_topic_score_codex":0.0018028163,"about_ca_topic_score_gemma":0.0027812647,"teacher_disagreement_score":0.007893871,"about_ca_system_score_codex":0.0023222056,"about_ca_system_score_gemma":0.0014966612,"threshold_uncertainty_score":0.0264076},"labels":[],"label_agreement":null},{"id":"W4412825210","doi":"10.46298/theoretics.25.16","title":"A Simple $(1-ε)$-Approximation Semi-Streaming Algorithm for Maximum (Weighted) Matching","year":2025,"lang":"en","type":"article","venue":"TheoretiCS","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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; University of Waterloo","keywords":"Simple (philosophy); Matching (statistics); Algorithm; Computer science; Mathematics; Mathematical optimization; Statistics","score_opus":0.011563491496002689,"score_gpt":0.26232859526662544,"score_spread":0.2507651037706228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412825210","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.017348696,0.00035131173,0.96868336,0.000784372,0.00021909387,0.00028590905,0.00055096054,0.004591446,0.0071849045],"genre_scores_gemma":[0.11144751,0.00017896552,0.8780288,0.00034964675,0.00011826665,0.0003210807,0.0013267697,0.00058408856,0.007644876],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871004,0.00023579017,0.00009438278,0.00035917346,0.00043667323,0.00016391207],"domain_scores_gemma":[0.9983228,0.00048395555,0.0001364687,0.0007107047,0.00020884658,0.0001372034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001166505,0.0012498397,0.0012055144,0.0007953528,0.0007541167,0.0015485582,0.0032689637,0.0018535401,0.014657703],"category_scores_gemma":[0.005502199,0.00063152204,0.0011160978,0.001554646,0.00082385115,0.004253252,0.0030015465,0.0021265086,0.00579328],"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.0010790079,0.00061161653,0.0012283996,0.0006388748,0.00013968442,0.0001849408,0.00032009196,0.10916147,0.042000838,0.09917694,0.048277326,0.69718075],"study_design_scores_gemma":[0.00023003937,0.00020313202,0.0003331074,0.000045609846,0.0000445431,0.0003711548,0.00009089236,0.86016774,0.012522295,0.11004375,0.015906945,0.00004071631],"about_ca_topic_score_codex":0.0019937085,"about_ca_topic_score_gemma":0.0039029242,"teacher_disagreement_score":0.014657703,"about_ca_system_score_codex":0.0013679054,"about_ca_system_score_gemma":0.0022220153,"threshold_uncertainty_score":0.049034894},"labels":[],"label_agreement":null},{"id":"W4413483942","doi":"10.1016/j.cosrev.2025.100806","title":"Polynomial property testing","year":2025,"lang":"en","type":"article","venue":"Computer Science Review","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; United States - Israel Binational Science Foundation","keywords":"Computer science; Property (philosophy); Property testing; Polynomial; Algorithm; Mathematics; Mathematical analysis","score_opus":0.04482246225547628,"score_gpt":0.30111749325256554,"score_spread":0.2562950309970893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413483942","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.03893962,0.015138731,0.90102506,0.004849136,0.00047601658,0.00080522354,0.0021509726,0.0032830085,0.03333226],"genre_scores_gemma":[0.62629557,0.015845936,0.33878237,0.0024422489,0.0010189015,0.00088835467,0.0047023864,0.0005541095,0.009470137],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936306,0.0016675373,0.00029729545,0.0018636694,0.0020422759,0.000498628],"domain_scores_gemma":[0.97078294,0.021214215,0.001826989,0.004330634,0.0014903389,0.0003548826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030876496,0.0011521786,0.0016194407,0.0021842518,0.00087949645,0.0027939542,0.004092862,0.0014614384,0.0061640153],"category_scores_gemma":[0.018850371,0.00061444443,0.0015705648,0.0032497577,0.002920974,0.007340995,0.0025735926,0.00226687,0.0018859726],"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.00026159282,0.00042272502,0.0067959093,0.002162651,0.0002139775,0.00031456677,0.0002536279,0.03740308,0.0095363585,0.31883717,0.02631638,0.597482],"study_design_scores_gemma":[0.00011895635,0.00034835344,0.0034596294,0.00040602387,0.00012769323,0.0017785274,0.00029400142,0.23776981,0.016988266,0.67183566,0.0667912,0.00008182037],"about_ca_topic_score_codex":0.0017830346,"about_ca_topic_score_gemma":0.0017293486,"teacher_disagreement_score":0.0061640153,"about_ca_system_score_codex":0.002176486,"about_ca_system_score_gemma":0.0026211778,"threshold_uncertainty_score":0.020620704},"labels":[],"label_agreement":null},{"id":"W4413895517","doi":"10.4086/toc.2025.v021a004","title":"","year":2025,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","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":"Vetenskapsrådet; Kungliga Tekniska Högskolan; University of Toronto; European Commission","keywords":"Computer science; Mathematics","score_opus":0.014534446798497138,"score_gpt":0.26385536255630854,"score_spread":0.2493209157578114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413895517","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.016669868,0.22051595,0.5050302,0.05247817,0.0062234565,0.00016451663,0.0024218776,0.001838881,0.19465709],"genre_scores_gemma":[0.30957577,0.19528379,0.33713344,0.020132972,0.015501208,0.0004489161,0.006293248,0.0020711578,0.11355942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9928411,0.001374128,0.0004595594,0.0028333527,0.0022209208,0.0002708661],"domain_scores_gemma":[0.96322113,0.02468542,0.0016117884,0.004704538,0.00474272,0.001034419],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0054435665,0.0008115171,0.0012267114,0.002709455,0.0012125699,0.004844235,0.0023550438,0.0018652874,0.0265795],"category_scores_gemma":[0.027073447,0.00089427305,0.0011623407,0.003597147,0.0040696044,0.011711131,0.0037098376,0.0044736434,0.009776991],"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.00016901811,0.000048195845,0.0009704491,0.0011678032,0.000053384225,0.00006073544,0.0002369836,0.0024205996,0.0012059067,0.7507728,0.035649247,0.20724474],"study_design_scores_gemma":[0.000022233879,0.00006489613,0.0010301397,0.00041469446,0.000040372815,0.00047634653,0.00015655032,0.0066447235,0.0018482895,0.4965838,0.49267608,0.0000419112],"about_ca_topic_score_codex":0.0014279642,"about_ca_topic_score_gemma":0.001271777,"teacher_disagreement_score":0.9734205,"about_ca_system_score_codex":0.005372879,"about_ca_system_score_gemma":0.0020789248,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4415829623","doi":"10.1016/j.jcss.2025.103727","title":"Algorithms and hardness results for the (k,ℓ)-cover problem","year":2025,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Complexity and Algorithms in Graphs","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":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada","keywords":"Approximation algorithm; Efficient algorithm; Minification; Key (lock)","score_opus":0.027734756578015954,"score_gpt":0.2790050750009111,"score_spread":0.25127031842289516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415829623","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.2967536,0.005611297,0.6074074,0.018297222,0.00041851666,0.0008643283,0.0065371906,0.0038111995,0.060299363],"genre_scores_gemma":[0.63585776,0.004416228,0.3270545,0.001962197,0.0011759789,0.00095918245,0.010801969,0.0010099865,0.01676227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966678,0.00062815746,0.00024193642,0.0010932784,0.0006613464,0.0007074988],"domain_scores_gemma":[0.9864646,0.009842196,0.0010959556,0.0016037611,0.00045929753,0.0005341246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001721268,0.0019441978,0.0016648046,0.0015702597,0.0024505265,0.0061665275,0.0040666135,0.0038111527,0.0082511455],"category_scores_gemma":[0.012104057,0.0011499423,0.0028716242,0.0031880839,0.0027009323,0.013498734,0.0030737196,0.005239833,0.001703908],"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.0036230425,0.0021002565,0.011639002,0.0028736,0.00057354226,0.000915942,0.0020976982,0.32053202,0.015491646,0.33909634,0.074857906,0.22619899],"study_design_scores_gemma":[0.0004937707,0.00021322869,0.0029418292,0.00019848572,0.00024685968,0.0014375462,0.0004585778,0.4692757,0.0069275545,0.49842882,0.019256862,0.00012079168],"about_ca_topic_score_codex":0.0042863516,"about_ca_topic_score_gemma":0.003686616,"teacher_disagreement_score":0.0082511455,"about_ca_system_score_codex":0.003855867,"about_ca_system_score_gemma":0.0028340977,"threshold_uncertainty_score":0.027976394},"labels":[],"label_agreement":null},{"id":"W4415966320","doi":"10.48550/arxiv.2510.17740","title":"Generalized Flow in Nearly-linear Time on Moderately Dense Graphs","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Complexity and Algorithms in Graphs","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; Simons Institute for the Theory of Computing, University of California Berkeley; Microsoft Research; National Science Foundation","keywords":"Flow (mathematics); Maximum flow problem; Enhanced Data Rates for GSM Evolution; Graph; Point (geometry); Flow network; Control flow graph","score_opus":0.06437540954912388,"score_gpt":0.28995719206980053,"score_spread":0.22558178252067665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415966320","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.11873798,0.0013258313,0.85209167,0.0032503726,0.00026639886,0.00047733344,0.0019927528,0.006350658,0.015507096],"genre_scores_gemma":[0.4898706,0.0005892224,0.4927105,0.00094506075,0.000273486,0.0006288951,0.0034795103,0.0010695605,0.010433212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973246,0.00077391136,0.000114823306,0.0008172364,0.0005102608,0.0004590804],"domain_scores_gemma":[0.99393106,0.0038144619,0.00049584534,0.0011036822,0.00032413958,0.00033073858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019104059,0.002355371,0.0021447192,0.0008981939,0.0012570848,0.0027978136,0.002981472,0.0017639424,0.010166385],"category_scores_gemma":[0.01191839,0.0010457026,0.0013945218,0.0020146538,0.0015196747,0.007547512,0.0035409688,0.0029468255,0.0020928234],"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.0009957724,0.00035933327,0.0018271453,0.00088538096,0.00017062626,0.00036510546,0.0004891362,0.71237457,0.00528871,0.121076226,0.022094794,0.13407318],"study_design_scores_gemma":[0.00012108172,0.000062042636,0.00021319887,0.000021403259,0.000023665076,0.00008992437,0.00007527785,0.8022991,0.0007350358,0.19393763,0.0024088281,0.000012845514],"about_ca_topic_score_codex":0.005990935,"about_ca_topic_score_gemma":0.013287253,"teacher_disagreement_score":0.010166385,"about_ca_system_score_codex":0.0024058758,"about_ca_system_score_gemma":0.0022364492,"threshold_uncertainty_score":0.034009933},"labels":[],"label_agreement":null},{"id":"W4416052615","doi":"10.48550/arxiv.2504.11256","title":"Covering Approximate Shortest Paths with DAGs","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Complexity and Algorithms in Graphs","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; Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Directed acyclic graph; Upper and lower bounds; Directed graph; Probabilistic logic; Embedding; Tree (set theory); Cover (algebra); Simple (philosophy); K-ary tree","score_opus":0.04341478645897524,"score_gpt":0.262463454533178,"score_spread":0.21904866807420276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416052615","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.11643823,0.0018242624,0.8676887,0.0008254876,0.00012973478,0.00017241144,0.0013488567,0.002052188,0.009520129],"genre_scores_gemma":[0.62438625,0.0015879227,0.36295283,0.0004684522,0.00018982186,0.00031089707,0.0031273377,0.0005196779,0.006456837],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803215,0.00040754493,0.00010703767,0.00047344662,0.0006939631,0.00028578652],"domain_scores_gemma":[0.9955824,0.0022885336,0.00050736277,0.0011798406,0.00025392743,0.00018789046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010613373,0.0012269462,0.0013309701,0.0016143589,0.0006733487,0.0015572542,0.0019061838,0.0011722724,0.0046263617],"category_scores_gemma":[0.01128627,0.00073136576,0.0010366574,0.0038474202,0.00096629665,0.006619142,0.0025390682,0.0015943439,0.0010513895],"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.0005408053,0.00019452136,0.0026093826,0.0005150102,0.00012739626,0.00032994163,0.00033212433,0.65143216,0.008359776,0.14821354,0.008610934,0.17873432],"study_design_scores_gemma":[0.000043767654,0.000126826,0.00038739567,0.000028319166,0.00003358049,0.00033237235,0.000067480476,0.797347,0.0029093965,0.18925993,0.009441271,0.000022699387],"about_ca_topic_score_codex":0.0032667397,"about_ca_topic_score_gemma":0.0038800747,"teacher_disagreement_score":0.0046263617,"about_ca_system_score_codex":0.0022197699,"about_ca_system_score_gemma":0.0011288922,"threshold_uncertainty_score":0.016105592},"labels":[],"label_agreement":null},{"id":"W4416091488","doi":"10.1016/j.ic.2025.105378","title":"Approximation algorithms for the maximum path cover problem using long paths","year":2025,"lang":"en","type":"article","venue":"Information and Computation","topic":"Complexity and Algorithms in Graphs","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 Alberta","funders":"Research Grants Council, University Grants Committee; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Ministry of Science and Technology of the People's Republic of China; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Approximation algorithm; Path (computing); Cover (algebra); Matching (statistics); Approximation theory; Stability (learning theory)","score_opus":0.026057032211216403,"score_gpt":0.27926336159475795,"score_spread":0.25320632938354154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416091488","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.091149054,0.0024744142,0.89132756,0.001085391,0.00011508472,0.00028423118,0.00085692,0.0029758809,0.009731424],"genre_scores_gemma":[0.47789398,0.0012711753,0.5114144,0.00028946085,0.0001485777,0.000522349,0.002637023,0.00052751676,0.005295605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983284,0.00037427864,0.00008007362,0.00043867496,0.0003856331,0.00039292808],"domain_scores_gemma":[0.9971782,0.0018317872,0.0002740518,0.00041654622,0.00015131518,0.00014818033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012492101,0.0015969343,0.0015390627,0.001625644,0.0011703862,0.0018067705,0.002952926,0.0018504524,0.005668368],"category_scores_gemma":[0.0070792637,0.00083691295,0.0013443545,0.0038000925,0.00083813077,0.00541265,0.0023247644,0.0020688805,0.0010504548],"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.0009106859,0.0003809153,0.0016430919,0.0006251417,0.00017224958,0.0002599754,0.00043576377,0.72374254,0.0048928475,0.04980725,0.014918557,0.20221101],"study_design_scores_gemma":[0.00013998052,0.00009675089,0.00026746918,0.000043142518,0.00003514798,0.00019031722,0.00007568975,0.9266437,0.0014993369,0.067611665,0.0033790562,0.000017860251],"about_ca_topic_score_codex":0.0049760896,"about_ca_topic_score_gemma":0.005442983,"teacher_disagreement_score":0.005668368,"about_ca_system_score_codex":0.002511418,"about_ca_system_score_gemma":0.0017261246,"threshold_uncertainty_score":0.018962622},"labels":[],"label_agreement":null},{"id":"W4416902920","doi":"10.1137/24m1635570","title":"Exact Algorithms and Lower Bounds for Stable Instances of Euclidean \\(\\boldsymbol{k}\\)- <scp>means</scp>","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","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 Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Euclidean geometry; Approximation algorithm; Upper and lower bounds; Time complexity; Euclidean domain; Euclidean distance","score_opus":0.018779879089882767,"score_gpt":0.2781844359888292,"score_spread":0.2594045568989464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416902920","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.16163744,0.005721701,0.7044347,0.013963054,0.001474941,0.00078396086,0.007108552,0.005515757,0.09935988],"genre_scores_gemma":[0.60635173,0.0018156406,0.3498165,0.0021425837,0.0012556656,0.0008134715,0.009270215,0.0035201812,0.025013939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99311674,0.0015309256,0.0003402503,0.0018664273,0.0015768494,0.0015688419],"domain_scores_gemma":[0.96524805,0.02356062,0.002208001,0.005030678,0.0022056734,0.0017469623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00514006,0.0041194097,0.0034801995,0.0034232605,0.003594494,0.0108627025,0.011533118,0.0050912993,0.038280357],"category_scores_gemma":[0.037374225,0.0020381915,0.0036928095,0.0071466793,0.0042135925,0.016624628,0.007509323,0.009172278,0.006556437],"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.0026960657,0.0015347867,0.0037288154,0.0016427634,0.0003874399,0.00022929106,0.00066248747,0.32448414,0.004455024,0.42237428,0.098804764,0.13900025],"study_design_scores_gemma":[0.00018257732,0.00013121824,0.00060488674,0.00010817316,0.00010768005,0.00014401256,0.00018220142,0.5907785,0.0021942316,0.40204766,0.0034660788,0.000052654123],"about_ca_topic_score_codex":0.0056802644,"about_ca_topic_score_gemma":0.015047399,"teacher_disagreement_score":0.038280357,"about_ca_system_score_codex":0.007616015,"about_ca_system_score_gemma":0.007833195,"threshold_uncertainty_score":0.12806058},"labels":[],"label_agreement":null},{"id":"W4417091733","doi":"10.48550/arxiv.2504.13105","title":"A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Complexity and Algorithms in Graphs","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":"Rounding; Cover (algebra); Covering problems; Approximation algorithm; Set cover problem; Relaxation (psychology); Linear programming relaxation; Polyhedron; Iterative method; Set packing","score_opus":0.10042766214381417,"score_gpt":0.3023558924078041,"score_spread":0.20192823026398993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417091733","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.0096523315,0.0011416645,0.9466547,0.007491893,0.0004604362,0.00017346189,0.00035307818,0.0008262944,0.033246156],"genre_scores_gemma":[0.21523857,0.0014199134,0.76074404,0.0042903936,0.0005165151,0.00063602824,0.0005893457,0.0005322589,0.016032916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961175,0.0013304827,0.00012990803,0.00070320436,0.0013040267,0.0004148989],"domain_scores_gemma":[0.99078393,0.006390301,0.0003886477,0.0014762726,0.00076608616,0.00019468734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042037903,0.0013764434,0.001277416,0.0008569779,0.002207246,0.0030755803,0.002464547,0.0027973999,0.008839489],"category_scores_gemma":[0.022917073,0.0006663514,0.0017649141,0.0023147166,0.0029938847,0.0063571124,0.0021228925,0.008700092,0.0022893536],"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.0004121868,0.00015976815,0.00061068905,0.00024966322,0.00006649193,0.0002970547,0.00033611275,0.054324217,0.0019694814,0.78372437,0.058618594,0.09923131],"study_design_scores_gemma":[0.000128117,0.00012501246,0.00034869244,0.00009648889,0.000043640357,0.0005678817,0.00012341459,0.23094636,0.0028884844,0.72249216,0.04218019,0.000059616992],"about_ca_topic_score_codex":0.0031230918,"about_ca_topic_score_gemma":0.0030031935,"teacher_disagreement_score":0.008839489,"about_ca_system_score_codex":0.0018774673,"about_ca_system_score_gemma":0.0020058851,"threshold_uncertainty_score":0.029571056},"labels":[],"label_agreement":null},{"id":"W4417092764","doi":"10.4230/lipics.ccc.2025.15","title":"Algebraic Pseudorandomness in VNC⁰","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Complexity and Algorithms in Graphs","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":"National Science Foundation","keywords":"Constant (computer programming); Polynomial; Algebraic number; Ideal (ethics); Generator (circuit theory); Correctness; Degree (music); Unary operation; Arithmetic circuit complexity; Corollary","score_opus":0.0238879756256104,"score_gpt":0.26902055791595436,"score_spread":0.24513258229034396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417092764","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.519151,0.000596093,0.4461472,0.0031221872,0.0000937502,0.0001890962,0.00051205914,0.00091790303,0.029270766],"genre_scores_gemma":[0.96418697,0.00025538282,0.029203407,0.00027935053,0.00013665565,0.00016434878,0.00033091006,0.000116585856,0.005326449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970873,0.00074593426,0.0001261261,0.0007021632,0.00086904975,0.00046954065],"domain_scores_gemma":[0.97710174,0.016850961,0.0019386811,0.002426692,0.0010288013,0.00065313873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019467312,0.00055826915,0.00084259734,0.0013250704,0.0013709775,0.0034137846,0.001584974,0.00094875915,0.0045975633],"category_scores_gemma":[0.015643876,0.00047322124,0.0011857038,0.0010456279,0.0037253916,0.0066696615,0.0030059917,0.0032796816,0.0005975005],"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.00010207647,0.00004006715,0.0010807876,0.00008045274,0.00002235605,0.00009190637,0.00025179883,0.021949189,0.0023286408,0.9668943,0.00090099825,0.0062573296],"study_design_scores_gemma":[0.000031767486,0.000052836487,0.00044035632,0.000015377027,0.000026380641,0.00011433161,0.000046511144,0.1145246,0.0043904074,0.8780058,0.0023284433,0.000023155353],"about_ca_topic_score_codex":0.0007892637,"about_ca_topic_score_gemma":0.0006935638,"teacher_disagreement_score":0.0045975633,"about_ca_system_score_codex":0.003095278,"about_ca_system_score_gemma":0.001065264,"threshold_uncertainty_score":0.022457957},"labels":[],"label_agreement":null},{"id":"W4417194548","doi":"10.1007/s10107-025-02315-z","title":"Online Algorithms for Spectral Hypergraph Sparsification","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Complexity and Algorithms in Graphs","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":"Japan Society for the Promotion of Science","keywords":"Hypergraph; Multiplicative function; Exponential function; Computational complexity theory; Online algorithm; Exponential growth; Rank (graph theory); Space (punctuation)","score_opus":0.05109511184521867,"score_gpt":0.31989459856978447,"score_spread":0.2687994867245658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417194548","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.012853095,0.00037430346,0.9750166,0.0012070709,0.00016486883,0.00013637105,0.0003837106,0.001386479,0.008477563],"genre_scores_gemma":[0.31242606,0.00082965515,0.6673468,0.00090677605,0.00070690876,0.0007960198,0.00213972,0.0013066493,0.013541455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975182,0.00080406433,0.00010955634,0.0006298351,0.0006548334,0.00028361115],"domain_scores_gemma":[0.98307693,0.011366355,0.0008219905,0.0032238474,0.00092880183,0.000582108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024271428,0.0019296152,0.0022930128,0.0016479212,0.0011967415,0.0039063296,0.004582339,0.0026518132,0.019940047],"category_scores_gemma":[0.021784768,0.0013319547,0.0016504799,0.0028776296,0.002190487,0.009443031,0.0053671133,0.0075340625,0.0039779223],"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.00071545277,0.0009685186,0.0013344543,0.00063124276,0.00014589063,0.00016688951,0.0003640903,0.2962017,0.003597075,0.34458184,0.040042106,0.31125066],"study_design_scores_gemma":[0.000079637575,0.00003562336,0.00011952029,0.000033423843,0.000019515563,0.000056650093,0.00006683159,0.67020977,0.0009497023,0.32628465,0.002129468,0.000015216646],"about_ca_topic_score_codex":0.0021786636,"about_ca_topic_score_gemma":0.004295087,"teacher_disagreement_score":0.019940047,"about_ca_system_score_codex":0.0020796212,"about_ca_system_score_gemma":0.0029093674,"threshold_uncertainty_score":0.06670612},"labels":[],"label_agreement":null},{"id":"W4417317377","doi":"10.1137/24m1653173","title":"Testing Graph Properties with the Container Method","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","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":"","score_opus":0.03708113139195662,"score_gpt":0.2806205290011702,"score_spread":0.24353939760921356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417317377","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.32893053,0.00020970221,0.64746875,0.0010973975,0.00030871463,0.0003769825,0.002411816,0.00879916,0.010396974],"genre_scores_gemma":[0.7719459,0.00010783441,0.22040018,0.0002294328,0.0000829902,0.00038663013,0.0030756395,0.0015330812,0.002238305],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920819,0.0024121408,0.00048007048,0.001958386,0.0022196837,0.00084785616],"domain_scores_gemma":[0.95743465,0.019994438,0.0024497996,0.016122116,0.0028384328,0.0011604961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036853463,0.0014597519,0.001477879,0.002051994,0.0010814772,0.001954865,0.0039734626,0.002147921,0.0083085345],"category_scores_gemma":[0.031810943,0.0009272299,0.0028701758,0.0017467005,0.0026072185,0.011233396,0.005135307,0.0027374106,0.0016635283],"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.006259054,0.0025227692,0.09929316,0.0012858345,0.00096270395,0.0017206799,0.0008604106,0.17185232,0.06316832,0.2099381,0.04720383,0.39493287],"study_design_scores_gemma":[0.00036264645,0.0010362846,0.005278906,0.00011455675,0.00020711464,0.0007070042,0.0007162181,0.74568117,0.040233556,0.19800812,0.0075532864,0.00010115326],"about_ca_topic_score_codex":0.0031076001,"about_ca_topic_score_gemma":0.0029172031,"teacher_disagreement_score":0.0083085345,"about_ca_system_score_codex":0.0008920783,"about_ca_system_score_gemma":0.002543168,"threshold_uncertainty_score":0.027794778},"labels":[],"label_agreement":null},{"id":"W44589754","doi":"10.1007/978-3-642-20807-2_2","title":"Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":11,"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":"Polytope; Combinatorics; Matching (statistics); Birkhoff polytope; Mathematics; Operator (biology); Discrete mathematics; Statistics","score_opus":0.09363086593594758,"score_gpt":0.297366810238937,"score_spread":0.20373594430298944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44589754","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.184426,0.006022659,0.67401177,0.00887432,0.000576733,0.00038429984,0.0017466241,0.0004960344,0.123461574],"genre_scores_gemma":[0.68272096,0.0047001382,0.24634902,0.0013122318,0.0013842446,0.0009824118,0.0030608543,0.0010926691,0.058397435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973117,0.0008004927,0.0000880828,0.00042508822,0.00089090713,0.00048362496],"domain_scores_gemma":[0.9894114,0.007928897,0.00058620307,0.0007949373,0.00066547253,0.0006130848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038081412,0.0018637868,0.0028322414,0.002787578,0.0021750345,0.0047881906,0.0047811177,0.0027499686,0.018667273],"category_scores_gemma":[0.017377537,0.0015870648,0.0035822643,0.004148686,0.0032631147,0.011113636,0.0036673779,0.008824036,0.0014237073],"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.0002122748,0.00024670683,0.0006396526,0.00028847106,0.00008583894,0.00006132129,0.00036802006,0.10682817,0.0011879175,0.85247016,0.012992054,0.024619458],"study_design_scores_gemma":[0.000058728863,0.000049044305,0.00060481037,0.000057502224,0.000046292545,0.00004224667,0.00013440005,0.2821923,0.0005501166,0.7124727,0.0037571366,0.000034776658],"about_ca_topic_score_codex":0.0052046357,"about_ca_topic_score_gemma":0.0060515646,"teacher_disagreement_score":0.018667273,"about_ca_system_score_codex":0.0053303214,"about_ca_system_score_gemma":0.0025322638,"threshold_uncertainty_score":0.062448263},"labels":[],"label_agreement":null},{"id":"W46202281","doi":"10.1007/978-3-642-22006-7_2","title":"An Improved Approximation Algorithm for Minimum-Cost Subset k-Connectivity","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"","keywords":"Approximation algorithm; Disjoint sets; Combinatorics; Vertex (graph theory); Steiner tree problem; Vertex connectivity; Graph; Mathematics; Computer science; Algorithm; Discrete mathematics","score_opus":0.03058419392283176,"score_gpt":0.26004901500276495,"score_spread":0.22946482107993318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W46202281","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.1094942,0.0014460004,0.8590748,0.0016173524,0.00046535436,0.00065769895,0.0015823292,0.0055124895,0.020149864],"genre_scores_gemma":[0.2250105,0.00051183463,0.763646,0.00035020936,0.00021741097,0.0005532059,0.0027959696,0.00045409845,0.006460651],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988275,0.00018457137,0.00007597272,0.00028792754,0.0004215081,0.00020255856],"domain_scores_gemma":[0.9976539,0.0010581578,0.00013528488,0.0006311652,0.00036134676,0.00016018479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008304145,0.0019312026,0.00257626,0.0019072209,0.0012872546,0.002324644,0.004845005,0.002176379,0.014671195],"category_scores_gemma":[0.0049253376,0.0008834107,0.0016689316,0.0041842125,0.00076591497,0.0047783144,0.002605757,0.0024169383,0.0024735513],"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.0017350204,0.0009633271,0.0022957649,0.0009446118,0.00017933852,0.00030338045,0.0004758149,0.23796353,0.015576372,0.042384632,0.038087543,0.6590906],"study_design_scores_gemma":[0.00033215902,0.0002039532,0.0008250272,0.00004610874,0.00011712258,0.00038108378,0.00015587204,0.9547425,0.0042467546,0.032463774,0.0064492393,0.000036404334],"about_ca_topic_score_codex":0.004533912,"about_ca_topic_score_gemma":0.0071555595,"teacher_disagreement_score":0.014671195,"about_ca_system_score_codex":0.002389302,"about_ca_system_score_gemma":0.0021495824,"threshold_uncertainty_score":0.049080074},"labels":[],"label_agreement":null},{"id":"W579949368","doi":"10.1007/978-1-4613-0279-7_25","title":"Strengthened Semidefinite Programming Relaxations for the Max-Cut Problem","year":2001,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Complexity and Algorithms in Graphs","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":"Semidefinite programming; Maximum cut; Semidefinite embedding; Mathematics; Relaxation (psychology); Enhanced Data Rates for GSM Evolution; Combinatorics; Mathematical optimization; Computer science; Quadratically constrained quadratic program; Artificial intelligence; Quadratic programming","score_opus":0.030757240695933663,"score_gpt":0.25227113805011137,"score_spread":0.2215138973541777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W579949368","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.0070993756,0.0013711139,0.9494917,0.0012976711,0.00036608655,0.000095494375,0.0004092576,0.00027223228,0.03959707],"genre_scores_gemma":[0.2079222,0.0039352668,0.73425317,0.0011401442,0.0011161017,0.00081187754,0.0017674449,0.00081650994,0.048237387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856204,0.0006138438,0.000061924824,0.00018778846,0.00047801415,0.000096427015],"domain_scores_gemma":[0.99686843,0.0019342919,0.00022478745,0.000402995,0.00044975436,0.00011963902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002823092,0.0017626818,0.0012366517,0.0009285711,0.0005963254,0.0022033502,0.0022163158,0.0012610741,0.011400257],"category_scores_gemma":[0.0074122204,0.0008383644,0.0010909915,0.0017639424,0.0013334989,0.003817086,0.0018567983,0.0077116815,0.0025119162],"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.00023851104,0.00024975403,0.0001440912,0.0006650362,0.000054205964,0.00014022263,0.00018287101,0.20121598,0.0038698586,0.60934377,0.045105703,0.13879007],"study_design_scores_gemma":[0.00006199072,0.00008156099,0.00017968823,0.00012334947,0.000024606243,0.00015683181,0.00005278201,0.5393908,0.0018765791,0.43595508,0.022064041,0.000032684264],"about_ca_topic_score_codex":0.0008733041,"about_ca_topic_score_gemma":0.0012234709,"teacher_disagreement_score":0.011400257,"about_ca_system_score_codex":0.0013242454,"about_ca_system_score_gemma":0.0012306167,"threshold_uncertainty_score":0.038137615},"labels":[],"label_agreement":null},{"id":"W6888425079","doi":"10.20382/jocg.v13i1a14","title":"Algorithms for approximate sparse regression and nearest induced hulls","year":2021,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Complexity and Algorithms in Graphs","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":"Degeneracy (biology); Set (abstract data type); Affine transformation; Regular polygon; Approximation algorithm; Convex hull; Conjecture; k-nearest neighbors algorithm; Randomized algorithm; Simple (philosophy)","score_opus":0.03918475331428511,"score_gpt":0.25983895760885284,"score_spread":0.22065420429456772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888425079","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.010350219,0.0005089263,0.98013353,0.0006054076,0.00008591981,0.0001499433,0.00075450283,0.003683466,0.0037279874],"genre_scores_gemma":[0.17126878,0.0005840922,0.81163704,0.00045069418,0.00024132343,0.0006658041,0.0059521687,0.00092296884,0.008277117],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99611,0.00071889046,0.00025567887,0.0010776464,0.0013202145,0.00051756826],"domain_scores_gemma":[0.99495196,0.002268811,0.0004550612,0.0015694882,0.0006017346,0.0001529652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014914442,0.0021682305,0.0031776724,0.0024607866,0.0013445998,0.0027808049,0.0045604343,0.0023813015,0.013840662],"category_scores_gemma":[0.012790061,0.0012160161,0.00223643,0.0058529484,0.0014918034,0.0065859337,0.004522557,0.0040631816,0.0055241906],"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.00067025184,0.00046034378,0.001579238,0.00053715653,0.00015220189,0.00017992352,0.0004081122,0.37795153,0.0037153512,0.101852424,0.04037794,0.47211552],"study_design_scores_gemma":[0.00010868105,0.000055804434,0.00022488312,0.0000250435,0.000023751538,0.000100412646,0.00009284003,0.90880764,0.0014554294,0.084672116,0.0044122976,0.000021125155],"about_ca_topic_score_codex":0.007293077,"about_ca_topic_score_gemma":0.010378598,"teacher_disagreement_score":0.013840662,"about_ca_system_score_codex":0.0023796174,"about_ca_system_score_gemma":0.0021040456,"threshold_uncertainty_score":0.046301663},"labels":[],"label_agreement":null},{"id":"W6891547493","doi":"10.4230/lipics.itcs.2025.37","title":"A Lower Bound on the Trace Norm of Boolean Matrices and Its Applications","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Victoria; University of Toronto; McGill University","funders":"University of Toronto; Natural Sciences and Engineering Research Council of Canada; University of Rochester","keywords":"Boolean function; Logarithm; Parity function; Binary decision diagram; Exponential function; Norm (philosophy); Upper and lower bounds; Integer (computer science); Binary number","score_opus":0.015653053134792778,"score_gpt":0.26034667450172133,"score_spread":0.24469362136692854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891547493","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.011844712,0.0014297797,0.96400815,0.0019987945,0.00040624358,0.00008253716,0.0002754121,0.00035789228,0.019596506],"genre_scores_gemma":[0.4950076,0.0049713836,0.46798322,0.0029245066,0.0027019263,0.0010266997,0.0009750971,0.0009933687,0.023416176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99550325,0.0011113256,0.000204684,0.0008618882,0.0018060062,0.0005128551],"domain_scores_gemma":[0.9765276,0.017014828,0.0008629251,0.0026177191,0.002162517,0.0008143299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005035624,0.0021671825,0.0015178799,0.002316478,0.0010861348,0.003127064,0.0030158253,0.002128273,0.008636189],"category_scores_gemma":[0.03697269,0.0007722596,0.0025557568,0.0023042536,0.0046758777,0.010742427,0.005671989,0.011131829,0.0028547838],"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.00020804766,0.00019009027,0.0010445289,0.00030713866,0.00005665009,0.00021364354,0.0002607888,0.034600604,0.01053014,0.8744567,0.006395291,0.071736336],"study_design_scores_gemma":[0.000025204476,0.00015117394,0.0003972058,0.00009009515,0.000032747015,0.00021493158,0.000044281584,0.27676228,0.006620716,0.70868886,0.006908418,0.00006422129],"about_ca_topic_score_codex":0.0010560518,"about_ca_topic_score_gemma":0.00089876534,"teacher_disagreement_score":0.008636189,"about_ca_system_score_codex":0.002681766,"about_ca_system_score_gemma":0.0018106987,"threshold_uncertainty_score":0.028890908},"labels":[],"label_agreement":null},{"id":"W6891657421","doi":"10.48550/arxiv.1103.5215","title":"Formalizing Randomized Matching Algorithms","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Bipartite graph; Correctness; Lemma (botany); Matching (statistics); Time complexity; Blossom algorithm; Probabilistic logic; 3-dimensional matching","score_opus":0.10095548723909412,"score_gpt":0.19691255218897472,"score_spread":0.0959570649498806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891657421","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.004030573,0.00041239153,0.98218,0.0011560055,0.00013556344,0.00015907451,0.00022780203,0.000765018,0.010933444],"genre_scores_gemma":[0.29091358,0.0013944198,0.69269437,0.001457407,0.00063640776,0.0011095047,0.0010530307,0.00068268477,0.010058573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98130393,0.0065240134,0.0014214804,0.0037489363,0.0053658057,0.001635943],"domain_scores_gemma":[0.9776833,0.014719198,0.0010839188,0.004295093,0.0018594606,0.00035909988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011301445,0.0015622601,0.0017258929,0.0027597565,0.0021161907,0.007461629,0.0065688435,0.0036507829,0.009529171],"category_scores_gemma":[0.041947193,0.0013670367,0.002917027,0.003482807,0.008176336,0.017224928,0.007212382,0.0063324403,0.0020389587],"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.000013911504,0.00001776924,0.00006718044,0.00005142505,0.000008811441,0.000018992208,0.000063938925,0.010212424,0.00017680439,0.98338187,0.0005930206,0.0053938576],"study_design_scores_gemma":[0.000028114355,0.000014176006,0.000032169635,0.000029119552,0.000011183074,0.000028192808,0.000024713443,0.06519224,0.00057869573,0.92799294,0.0060539944,0.000014439162],"about_ca_topic_score_codex":0.003955394,"about_ca_topic_score_gemma":0.0028771576,"teacher_disagreement_score":0.011301445,"about_ca_system_score_codex":0.006449532,"about_ca_system_score_gemma":0.005279172,"threshold_uncertainty_score":0.05976844},"labels":[],"label_agreement":null},{"id":"W6891703795","doi":"10.48550/arxiv.0904.2203","title":"A Weakly-Robust PTAS for Minimum Clique Partition in Unit Disk Graphs","year":2009,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","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":"Clique graph; Partition (number theory); Vertex (graph theory); Polynomial-time approximation scheme; Approximation algorithm; Independent set; Clique; Graph; Unit disk graph","score_opus":0.1346992862128803,"score_gpt":0.2149697447596503,"score_spread":0.08027045854677001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891703795","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.08578171,0.00021804166,0.9052841,0.0007496001,0.000062739244,0.00022693037,0.0005594582,0.002659307,0.0044580866],"genre_scores_gemma":[0.45025998,0.00019785928,0.5422845,0.00028755236,0.000078941724,0.00025044577,0.0014793876,0.0004809526,0.0046803555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982755,0.00030839053,0.0000826577,0.00061487796,0.00048559715,0.00023279428],"domain_scores_gemma":[0.997391,0.0008383081,0.00030964287,0.001003508,0.00022982436,0.00022777633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009887805,0.0009278782,0.0011930526,0.0006663212,0.0010278994,0.0020800638,0.0032934037,0.0014703493,0.004564157],"category_scores_gemma":[0.0062387343,0.00053694466,0.0011149946,0.0015648723,0.0011565742,0.0044238204,0.0029311099,0.0022721414,0.0013199766],"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.0015667414,0.00045035224,0.002344963,0.00053223094,0.0001366839,0.00028363758,0.00076031557,0.60079795,0.058467016,0.12727281,0.013255172,0.19413215],"study_design_scores_gemma":[0.00006360574,0.00014254027,0.00030953423,0.000020066378,0.000025431049,0.00012805958,0.00010629164,0.92794687,0.010313833,0.056884263,0.0040369527,0.000022483011],"about_ca_topic_score_codex":0.0025936856,"about_ca_topic_score_gemma":0.0027919607,"teacher_disagreement_score":0.004564157,"about_ca_system_score_codex":0.0021824401,"about_ca_system_score_gemma":0.0017353188,"threshold_uncertainty_score":0.015834749},"labels":[],"label_agreement":null},{"id":"W6908534628","doi":"10.3386/w31233","title":"The Aggregate Importance of Intermediate Input Substitutability","year":2023,"lang":"en","type":"report","venue":"National Bureau of Economic Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":16,"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":"Stanford Institute for Economic Policy Research; HEC Montréal","keywords":"Aggregate (composite); Agrégation; Production (economics); Component (thermodynamics); Work (physics)","score_opus":0.4381251778231931,"score_gpt":0.5172616427501187,"score_spread":0.07913646492692555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6908534628","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.8527055,0.0009320573,0.08361129,0.002292807,0.00013623112,0.00006930627,0.0018093843,0.0003449314,0.05809851],"genre_scores_gemma":[0.99384105,0.00028429262,0.0034826146,0.000069012705,0.00007537244,0.000018716879,0.00025434635,0.00005921684,0.0019153862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984787,0.0004891819,0.000061475774,0.0002435094,0.00044100967,0.000286134],"domain_scores_gemma":[0.9513448,0.03810795,0.0021553386,0.004229412,0.0028859419,0.0012765733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018529738,0.0003811335,0.0011520726,0.0017539031,0.0007047242,0.0023366415,0.001028472,0.0011749526,0.013458547],"category_scores_gemma":[0.026105193,0.00034077922,0.0006971516,0.0021071807,0.0010861487,0.0048192525,0.0011197046,0.0018612888,0.00063604355],"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.0027937638,0.0005611325,0.05348388,0.0009128606,0.00041653562,0.0007160914,0.0004073362,0.23414963,0.026419304,0.4534649,0.01858479,0.20808984],"study_design_scores_gemma":[0.00010811087,0.00037735968,0.04316695,0.00007848263,0.0004936828,0.0006860064,0.00044547833,0.40728042,0.01777068,0.52387816,0.005645656,0.000069012756],"about_ca_topic_score_codex":0.001310803,"about_ca_topic_score_gemma":0.0018553487,"teacher_disagreement_score":0.013458547,"about_ca_system_score_codex":0.0011867406,"about_ca_system_score_gemma":0.0008680401,"threshold_uncertainty_score":0.045023322},"labels":[],"label_agreement":null},{"id":"W6910201977","doi":"10.4230/lipics.ccc.2024.29","title":"Exact Search-To-Decision Reductions for Time-Bounded Kolmogorov Complexity","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"University of Warwick; UK Research and Innovation","keywords":"Reduction (mathematics); Bounded function; String (physics); Measure (data warehouse); Kolmogorov complexity; Upper and lower bounds","score_opus":0.0385608933092483,"score_gpt":0.31197945965250806,"score_spread":0.2734185663432598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910201977","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.033660863,0.0005848559,0.94572943,0.0019890734,0.00016479047,0.00024928793,0.0004947327,0.0022871091,0.014839866],"genre_scores_gemma":[0.5821951,0.0007664484,0.39904672,0.001580999,0.0006207717,0.0010518288,0.0013721463,0.0014186628,0.011947321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9862694,0.0022251976,0.0006636133,0.0030019763,0.006265182,0.0015746212],"domain_scores_gemma":[0.958966,0.031010669,0.0013102666,0.006095325,0.0019545604,0.00066301704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004618606,0.0015146869,0.0015720032,0.0016551213,0.0014568979,0.0038574645,0.0036627846,0.0014211384,0.0069557442],"category_scores_gemma":[0.033143125,0.00077931816,0.004196796,0.0015568525,0.0044340244,0.009406886,0.0054388857,0.01014346,0.0014467459],"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.00046815164,0.00037672324,0.0009258122,0.00043828005,0.00011032864,0.00016337472,0.00039015114,0.16726357,0.009659432,0.7430705,0.00794553,0.069188185],"study_design_scores_gemma":[0.0000788048,0.0000892474,0.00030797446,0.000039098024,0.00007043177,0.00007659987,0.000043048374,0.36705616,0.0076180333,0.6209617,0.0036163747,0.000042442854],"about_ca_topic_score_codex":0.0022969565,"about_ca_topic_score_gemma":0.0037086357,"teacher_disagreement_score":0.0069557442,"about_ca_system_score_codex":0.005568657,"about_ca_system_score_gemma":0.0052000773,"threshold_uncertainty_score":0.040403605},"labels":[],"label_agreement":null},{"id":"W6910264862","doi":"10.4230/lipics.ccc.2023.36","title":"Colourful TFNP and Propositional Proofs","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical proof; Unary operation; Class (philosophy); Proof complexity; Intersection (aeronautics); Resolution (logic); Propositional calculus; Analytic proof","score_opus":0.017782138798735237,"score_gpt":0.2582630661033912,"score_spread":0.24048092730465598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6910264862","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.078818455,0.002498325,0.871352,0.0027777904,0.00028357952,0.00014994339,0.0007640016,0.001892876,0.041463062],"genre_scores_gemma":[0.81753457,0.0013479346,0.16466565,0.001051339,0.00042073615,0.00020386724,0.0008732676,0.00035126475,0.013551274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664235,0.00073390396,0.00025112374,0.0007949858,0.0011203343,0.00045725895],"domain_scores_gemma":[0.9874374,0.007754306,0.0008201431,0.0021825705,0.0013317645,0.00047376854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002387986,0.00046848276,0.00042313608,0.0015464047,0.0010866221,0.0035586925,0.0015812132,0.00091186276,0.0071094604],"category_scores_gemma":[0.014021428,0.0005833463,0.0013219934,0.0013048335,0.00422935,0.007982918,0.0025938067,0.0031315533,0.0005758837],"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.000043782264,0.000017778966,0.00039727066,0.00014243934,0.000015866248,0.00008863411,0.00023811689,0.0042092307,0.0011077494,0.97175986,0.0014193093,0.020560052],"study_design_scores_gemma":[0.000018011138,0.000017345572,0.00032367915,0.000031316293,0.000017451031,0.00015025356,0.00004533236,0.017989077,0.0012404104,0.96865875,0.011492896,0.000015638589],"about_ca_topic_score_codex":0.004809837,"about_ca_topic_score_gemma":0.0026139738,"teacher_disagreement_score":0.0071094604,"about_ca_system_score_codex":0.0038466929,"about_ca_system_score_gemma":0.0016057235,"threshold_uncertainty_score":0.027909815},"labels":[],"label_agreement":null},{"id":"W6925036136","doi":"10.15468/dl.ru2vsr","title":"Occurrence Download","year":2023,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Complexity and Algorithms in Graphs","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":"Download; Matching (statistics); Range (aeronautics); Real world data; Data set","score_opus":0.024388405500497198,"score_gpt":0.23172240401211036,"score_spread":0.20733399851161316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925036136","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.000063592575,0.000045648816,0.000070160495,0.000050577804,0.000012233574,0.000007879487,0.9981123,0.00073457585,0.000902945],"genre_scores_gemma":[0.00021313815,0.000049460235,0.0002664438,0.000053779742,0.0000032985201,0.000043014436,0.99875474,0.00017237126,0.0004437013],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990688,0.000115876304,0.00011585873,0.0003222613,0.00022710791,0.00015007082],"domain_scores_gemma":[0.9979032,0.00056544784,0.00016319078,0.0006005002,0.00054303167,0.00022450999],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00075185497,0.0022888854,0.001617188,0.0045746067,0.00096681644,0.0025798953,0.0031620807,0.0023616785,0.121411175],"category_scores_gemma":[0.0057450063,0.0009084269,0.0012886333,0.009935016,0.0004232976,0.0024457194,0.0022946356,0.0021234027,0.18578142],"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.00002512637,0.000013255424,0.00029153898,0.0004913135,0.000013124554,0.00001546316,0.000017188166,0.0001651891,0.000087621826,0.0004583751,0.9969189,0.001502856],"study_design_scores_gemma":[0.00009575635,0.000008384823,0.0014637009,0.00017681779,0.000013167296,0.000049793714,0.000064071595,0.00032606735,0.0002119985,0.0013284435,0.99624544,0.000016359203],"about_ca_topic_score_codex":0.021767145,"about_ca_topic_score_gemma":0.038561366,"teacher_disagreement_score":0.8785888,"about_ca_system_score_codex":0.0019498448,"about_ca_system_score_gemma":0.0021368575,"threshold_uncertainty_score":0.40616083},"labels":[],"label_agreement":null},{"id":"W6927327761","doi":"10.34726/hss.2013.23219&lt;/div&gt;\\n&lt;/div&gt","title":"A new partition-based heuristic for the Steiner tree problem in large graphs","year":2013,"lang":"en","type":"article","venue":"reposiTUm (TU Wien)","topic":"Complexity and Algorithms in Graphs","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":"Steiner tree problem; Heuristic; Tree (set theory); Greedy algorithm; Field (mathematics); Generalization; Class (philosophy); Set (abstract data type); Term (time)","score_opus":0.014380747554923863,"score_gpt":0.23388314958933323,"score_spread":0.21950240203440938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6927327761","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.020179024,0.00058240205,0.97270614,0.0002521167,0.00010365199,0.00025266287,0.00012632353,0.00061580003,0.005181834],"genre_scores_gemma":[0.15611774,0.00040809906,0.83831155,0.00025253493,0.00008326305,0.0004430742,0.00063015503,0.0002821214,0.0034715193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993808,0.0001605536,0.000029914214,0.00013708917,0.00016694264,0.00012464875],"domain_scores_gemma":[0.9993493,0.0003622357,0.00006267093,0.00008282525,0.00008676272,0.00005623596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006463647,0.0011166965,0.0012990538,0.0011135839,0.0008349522,0.0011588064,0.0020435378,0.0015023198,0.003284166],"category_scores_gemma":[0.0020098763,0.00073190255,0.0011740392,0.0012904427,0.00069306657,0.0019947696,0.0014534966,0.0011308165,0.00068269775],"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.00015693608,0.0001766138,0.00049952674,0.000187227,0.000067302855,0.00015040468,0.00017080425,0.7994518,0.005992892,0.021852344,0.007857727,0.16343634],"study_design_scores_gemma":[0.000044238903,0.000061893326,0.000109293185,0.000018837805,0.000020833066,0.00006521061,0.00003723513,0.98758715,0.0011431909,0.008177247,0.002723834,0.000011006486],"about_ca_topic_score_codex":0.003216981,"about_ca_topic_score_gemma":0.0045988946,"teacher_disagreement_score":0.003284166,"about_ca_system_score_codex":0.0012943976,"about_ca_system_score_gemma":0.0017442054,"threshold_uncertainty_score":0.010986626},"labels":[],"label_agreement":null},{"id":"W6929079456","doi":"10.4230/lipics.approx/random.2024.51","title":"Consequences of Randomized Reductions from SAT to Time-Bounded Kolmogorov Complexity","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kolmogorov complexity; Randomized algorithm; Constant (computer programming); Reduction (mathematics); Time complexity; Computational complexity theory; Class (philosophy); Running time","score_opus":0.02830620384657163,"score_gpt":0.2812607922792531,"score_spread":0.2529545884326815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929079456","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.25918227,0.0015741244,0.6233323,0.030544281,0.0008064607,0.0005700187,0.0014513828,0.0039358893,0.078603275],"genre_scores_gemma":[0.92251015,0.00070374284,0.06067731,0.0044944906,0.0007943668,0.0007440215,0.0008799609,0.0009519675,0.008244081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97695404,0.008319974,0.00090705924,0.0046079606,0.0064823646,0.0027286299],"domain_scores_gemma":[0.89993244,0.07932898,0.0029007052,0.013987968,0.0024201863,0.0014296662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009136315,0.0009563541,0.0017636083,0.0009031567,0.002486654,0.004343642,0.0042660846,0.002713376,0.0075172205],"category_scores_gemma":[0.059867356,0.0011965905,0.004000208,0.00092716096,0.007877676,0.012326988,0.007895005,0.01374832,0.00091677],"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.0008844421,0.0003954652,0.0031194377,0.0003489397,0.00016769565,0.00034586768,0.0005855428,0.07040807,0.006905611,0.89196634,0.007843668,0.017029015],"study_design_scores_gemma":[0.0002929767,0.00022324095,0.0021851505,0.00006938023,0.000111274356,0.00025613108,0.0002540756,0.16513161,0.008754905,0.81672835,0.005910224,0.00008255032],"about_ca_topic_score_codex":0.0019332956,"about_ca_topic_score_gemma":0.001830324,"teacher_disagreement_score":0.009136315,"about_ca_system_score_codex":0.0038378409,"about_ca_system_score_gemma":0.0034125615,"threshold_uncertainty_score":0.04831803},"labels":[],"label_agreement":null},{"id":"W6930485136","doi":"10.5281/zenodo.12304255","title":"el mecánico de la espalda pdf descargar","year":2024,"lang":"es","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complexity and Algorithms in Graphs","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":"Download; Bachelor; State (computer science)","score_opus":0.028042663558011386,"score_gpt":0.2690329688877634,"score_spread":0.24099030532975202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930485136","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.001950211,0.0063130097,0.0031260445,0.01629941,0.0050112437,0.00008278032,0.00094905443,0.0005690697,0.9656991],"genre_scores_gemma":[0.03000046,0.01380048,0.002726464,0.0028529926,0.0017078575,0.000111919835,0.00132631,0.0005226659,0.9469509],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985487,0.00024008797,0.00005466259,0.00013427049,0.00086075044,0.00016153321],"domain_scores_gemma":[0.99800116,0.00031276574,0.00007800085,0.0001683514,0.0010132374,0.00042635476],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013962109,0.00051528803,0.00034999588,0.0016851319,0.0020489702,0.007780319,0.0008921514,0.0017539206,0.31779158],"category_scores_gemma":[0.005640994,0.000302028,0.00039913013,0.0015694884,0.0016842907,0.005535015,0.0031032541,0.0020898806,0.1559639],"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.000023916615,0.000025472438,0.00057334057,0.00022030382,0.000003632923,0.00017030432,0.0004681496,0.00014256545,0.00042749368,0.026566891,0.8146239,0.15675403],"study_design_scores_gemma":[0.0000022691534,0.0000087325825,0.00088882394,0.00022254679,0.0000014432904,0.00018137014,0.00049419334,0.00003430732,0.0001293127,0.0025927883,0.9954372,0.0000069736516],"about_ca_topic_score_codex":0.0082137715,"about_ca_topic_score_gemma":0.010269348,"teacher_disagreement_score":0.6822084,"about_ca_system_score_codex":0.0017927565,"about_ca_system_score_gemma":0.003636733,"threshold_uncertainty_score":0.9730875},"labels":[],"label_agreement":null},{"id":"W6931625855","doi":"10.5683/sp3/oxjdb1","title":"UNI-CEN Boundaries (DBF-Original Shorelines) - Census Tract (CT) - 2006 - Esri Shapefile format (WGS84 / EPSG:4326)","year":2023,"lang":"en","type":"dataset","venue":"Borealis","topic":"Complexity and Algorithms in Graphs","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":"Western University","funders":"","keywords":"Shapefile; North American Datum of 1927; File format; Census; Documentation; Geocoding; Boundary (topology)","score_opus":0.03334873771499019,"score_gpt":0.28415834470722445,"score_spread":0.25080960699223426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931625855","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.00013157955,0.000019797793,0.000109294764,0.000026288619,0.000011111776,0.000009858862,0.9980135,0.00044825257,0.0012302102],"genre_scores_gemma":[0.00031521032,0.000029964674,0.00031860825,0.000016448279,0.0000031269497,0.00005427521,0.99853885,0.0001276079,0.0005958173],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987698,0.00016121654,0.00015486812,0.00030607413,0.00039022532,0.00021780668],"domain_scores_gemma":[0.9960233,0.00057128083,0.00039486078,0.0012903967,0.001393289,0.00032688593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012653194,0.0017488137,0.0013347416,0.0051410375,0.000751716,0.0023624361,0.0029188015,0.0010782065,0.08259032],"category_scores_gemma":[0.0073822085,0.0008892463,0.0008306832,0.012580938,0.00043519036,0.0015262638,0.0018697546,0.0019774428,0.12993649],"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.00002149757,0.000010733773,0.00056721986,0.00023651084,0.000008488231,0.0000076545,0.00002541984,0.000114974035,0.00006056649,0.00064151525,0.9967803,0.0015250458],"study_design_scores_gemma":[0.000084999185,0.0000060726215,0.0046972935,0.00014413512,0.00000888846,0.00003584455,0.00009278325,0.00020476979,0.0002930181,0.0009101718,0.99350727,0.000014803655],"about_ca_topic_score_codex":0.048994113,"about_ca_topic_score_gemma":0.070486285,"teacher_disagreement_score":0.08259032,"about_ca_system_score_codex":0.0023669503,"about_ca_system_score_gemma":0.0032421257,"threshold_uncertainty_score":0.27629215},"labels":[],"label_agreement":null},{"id":"W6947992690","doi":"10.4230/lipics.icalp.2025.20","title":"Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Approximation algorithm; Rounding; Graph; Set cover problem; Strength of a graph; Set (abstract data type); Graph theory; Connected dominating set; Network planning and design; Graph algorithms","score_opus":0.02941959307669111,"score_gpt":0.2704119662591975,"score_spread":0.24099237318250638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6947992690","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.013154493,0.00076755387,0.97855765,0.00054875977,0.00009287762,0.0001012878,0.00023111097,0.0011285464,0.005417705],"genre_scores_gemma":[0.27673694,0.00078157,0.71544826,0.00038726843,0.00018711566,0.00046394055,0.0013038017,0.00036045891,0.004330594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997619,0.00067209447,0.000108814944,0.000479087,0.0006868382,0.000434251],"domain_scores_gemma":[0.99576277,0.0023955575,0.00034257065,0.0009003994,0.0004403055,0.00015850143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001959468,0.0022029914,0.0016082183,0.0016208552,0.0008694088,0.001808091,0.0038785841,0.0022977567,0.0062975064],"category_scores_gemma":[0.01006373,0.0010270277,0.0017621331,0.0038623891,0.0012552853,0.0045299153,0.0021197814,0.0035835155,0.0011227615],"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.00022705388,0.0001638882,0.0006006925,0.0001970849,0.000069886155,0.0000832025,0.00013552539,0.8582892,0.0014975552,0.045146585,0.0071618487,0.08642749],"study_design_scores_gemma":[0.000039448838,0.000031219042,0.00006670811,0.000013261046,0.0000127740195,0.000040610892,0.000018643375,0.9746361,0.00042725186,0.023022603,0.0016848149,0.00000663181],"about_ca_topic_score_codex":0.007715452,"about_ca_topic_score_gemma":0.008745335,"teacher_disagreement_score":0.007715452,"about_ca_system_score_codex":0.003488974,"about_ca_system_score_gemma":0.002327675,"threshold_uncertainty_score":0.02531439},"labels":[],"label_agreement":null},{"id":"W6948961494","doi":"10.5281/zenodo.10800642","title":"Galled Perfect Transfer Networks","year":2024,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complexity and Algorithms in Graphs","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":"Transfer (computing); Table (database); Upper and lower bounds; Imperfect","score_opus":0.031928593006099244,"score_gpt":0.23853445751643879,"score_spread":0.20660586451033955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6948961494","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.03414829,0.002612811,0.41699725,0.0049346816,0.001891746,0.0005903461,0.22713026,0.011631291,0.30006322],"genre_scores_gemma":[0.47960642,0.0034991757,0.11655927,0.0021893482,0.0008395327,0.0013459476,0.20137241,0.006884397,0.1877034],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928063,0.00014811342,0.000031890406,0.00020822979,0.00021334049,0.000117737945],"domain_scores_gemma":[0.99728453,0.0010386764,0.00018392825,0.00094603776,0.0003784097,0.0001683708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070990407,0.0007936232,0.00064360583,0.0021587692,0.0009595051,0.0019420793,0.0012805363,0.0014401122,0.14619297],"category_scores_gemma":[0.008708708,0.00048129173,0.00062653207,0.002129972,0.00069854956,0.003474727,0.0022718096,0.001643009,0.03477737],"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.00029307505,0.00004741015,0.00049877213,0.0006638446,0.00007224788,0.00026063627,0.00022002072,0.018492872,0.002642555,0.41068906,0.48122376,0.08489576],"study_design_scores_gemma":[0.00005683559,0.000024582847,0.00058215746,0.0001325721,0.000033398097,0.00028857304,0.00008551616,0.035409737,0.002791724,0.73064435,0.22990552,0.000045066645],"about_ca_topic_score_codex":0.0013493411,"about_ca_topic_score_gemma":0.0012546399,"teacher_disagreement_score":0.14619297,"about_ca_system_score_codex":0.0007982848,"about_ca_system_score_gemma":0.00059382303,"threshold_uncertainty_score":0.48906422},"labels":[],"label_agreement":null},{"id":"W6949890927","doi":"10.5281/zenodo.16782810","title":"Data for Efficient Volume Computation for SMT Formulas (KR-25 paper)","year":2025,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Complexity and Algorithms in Graphs","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":"Computation; Volume (thermodynamics); Artifact (error); Term (time)","score_opus":0.05883467154912076,"score_gpt":0.2913341506859124,"score_spread":0.23249947913679164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6949890927","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.0006199357,0.00011915593,0.00035569508,0.000100387406,0.00005950605,0.000034896966,0.99494934,0.002502996,0.0012581552],"genre_scores_gemma":[0.0009769985,0.000044451725,0.0007944448,0.000044661083,0.000010059142,0.00010045582,0.997456,0.00020697647,0.0003660316],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99800164,0.00022753984,0.00023321233,0.00045133996,0.00079427246,0.0002920299],"domain_scores_gemma":[0.9957403,0.0008956001,0.00032387694,0.0016523214,0.0010914763,0.0002965352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013815147,0.0039611715,0.0016576595,0.0038945486,0.0009654679,0.002720583,0.004317266,0.0034280056,0.04881672],"category_scores_gemma":[0.008373843,0.00093012326,0.002000008,0.0066853515,0.0007058148,0.0016273104,0.0019228553,0.002782421,0.07364043],"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.00017260663,0.000092472,0.0005392654,0.00084472506,0.000037174585,0.000035003377,0.000015404155,0.0016867012,0.00040661014,0.0010901919,0.99047476,0.004605221],"study_design_scores_gemma":[0.001740821,0.00011925773,0.0045681796,0.00033387443,0.00006909978,0.00022382244,0.00007779796,0.0075772377,0.0042574555,0.00887068,0.97209364,0.000068189576],"about_ca_topic_score_codex":0.011503387,"about_ca_topic_score_gemma":0.017997393,"teacher_disagreement_score":0.04881672,"about_ca_system_score_codex":0.002003503,"about_ca_system_score_gemma":0.002566973,"threshold_uncertainty_score":0.16330814},"labels":[],"label_agreement":null},{"id":"W6966814896","doi":"10.4230/lipics.aofa.2024.2","title":"Enumeration and Succinct Encoding of AVL Trees","year":2024,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Enumeration; Tree (set theory); Class (philosophy); Node (physics); Encoding (memory); Variety (cybernetics); Upper and lower bounds; Constant (computer programming)","score_opus":0.01592361490010857,"score_gpt":0.25835598425096706,"score_spread":0.2424323693508585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966814896","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.118566774,0.00036161422,0.8642323,0.0011460594,0.00011559863,0.000099225974,0.0014953121,0.0022706587,0.011712486],"genre_scores_gemma":[0.65233207,0.00037039473,0.33602792,0.00046329622,0.000113690396,0.00033099885,0.0030338904,0.0006450205,0.0066827587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829024,0.00037861324,0.00014015427,0.00026012774,0.0006552877,0.0002755208],"domain_scores_gemma":[0.9928235,0.0028843416,0.00059596926,0.0026764872,0.0008131276,0.00020662931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011847804,0.0004266863,0.0006548146,0.0013277435,0.00077977544,0.0028465213,0.0017279538,0.00084826344,0.0040536085],"category_scores_gemma":[0.009143907,0.0005704383,0.00072244625,0.0021833146,0.0016854007,0.006773086,0.0032608714,0.0020889859,0.0012899179],"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.00034833798,0.00019295109,0.0018377239,0.00024399634,0.000021900463,0.00025914487,0.00073911075,0.058539465,0.025585147,0.75191844,0.009834553,0.15047929],"study_design_scores_gemma":[0.00005513782,0.00008522657,0.00035231697,0.000089609144,0.000024993056,0.00024496648,0.00017570354,0.31610873,0.026270403,0.64298177,0.013562625,0.00004853753],"about_ca_topic_score_codex":0.0008173204,"about_ca_topic_score_gemma":0.0016868399,"teacher_disagreement_score":0.0040536085,"about_ca_system_score_codex":0.001895698,"about_ca_system_score_gemma":0.0013119995,"threshold_uncertainty_score":0.013754308},"labels":[],"label_agreement":null},{"id":"W6967458180","doi":"10.4230/lipics.approx/random.2023.14","title":"Algorithms for 2-Connected Network Design and Flexible Steiner Trees with a Constant Number of Terminals","year":2023,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Commission","keywords":"Steiner tree problem; Partition (number theory); Constant (computer programming); Randomized algorithm; Generalization; Approximation algorithm; Graph; Set (abstract data type); Network planning and design; Undirected graph","score_opus":0.0399989508806633,"score_gpt":0.2908798143270963,"score_spread":0.250880863446433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6967458180","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.025419584,0.00086799084,0.9543445,0.0012729063,0.00013783535,0.00041155177,0.00080040004,0.0019565998,0.0147887105],"genre_scores_gemma":[0.24992959,0.00086148526,0.73543286,0.0004895178,0.00014515994,0.0009112076,0.0019878559,0.00055636384,0.009685972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828917,0.00044210217,0.000094719304,0.0005606317,0.00036245512,0.0002508528],"domain_scores_gemma":[0.99736744,0.0015752652,0.0002463019,0.00055725686,0.00015701851,0.000096622796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013657205,0.0018210158,0.0012525247,0.0009535771,0.0010450707,0.002218408,0.0029873264,0.0019061374,0.013735484],"category_scores_gemma":[0.005786506,0.0011116168,0.0017061651,0.0023422719,0.0012880475,0.0049464814,0.002311656,0.0023420178,0.0019415248],"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.00039561902,0.00027416524,0.0007198941,0.0008166544,0.00011999092,0.00016243676,0.0002450989,0.6053223,0.0030186852,0.19376735,0.0225737,0.17258404],"study_design_scores_gemma":[0.00019662699,0.00007415747,0.00017556897,0.00006483742,0.000038132024,0.00012516968,0.00005896998,0.7265521,0.0011984941,0.26299357,0.008499606,0.000022852553],"about_ca_topic_score_codex":0.0035787956,"about_ca_topic_score_gemma":0.0059267106,"teacher_disagreement_score":0.013735484,"about_ca_system_score_codex":0.0033102413,"about_ca_system_score_gemma":0.0026616089,"threshold_uncertainty_score":0.045949757},"labels":[],"label_agreement":null},{"id":"W6976528289","doi":"10.60692/c4e3b-jf440","title":"Consensus Guidelines for the Definition of Time-to-Event End Points in Image-guided Tumor Ablation: Results of the SIO and DATECAN Initiative","year":2021,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Complexity and Algorithms in Graphs","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. Thomas Hospital","funders":"","keywords":"Delphi method; Delphi; Consensus conference; Appropriateness criteria; Outcome (game theory); MEDLINE; Quality (philosophy); Conflict of interest","score_opus":0.11306084619515358,"score_gpt":0.27971552220949564,"score_spread":0.16665467601434206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976528289","genre_codex":"commentary","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.0093897,0.17587714,0.2813387,0.37207678,0.045694612,0.041594185,0.012885579,0.0017709176,0.059372418],"genre_scores_gemma":[0.040528003,0.071061194,0.7686775,0.040129047,0.004132629,0.050373156,0.014873336,0.0010481634,0.009177106],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.61436903,0.23173949,0.078142375,0.007355565,0.06500949,0.0033840567],"domain_scores_gemma":[0.50466096,0.21723732,0.02570383,0.013342229,0.23149754,0.0075581837],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.40054262,0.002347804,0.004247807,0.0114060035,0.0028732752,0.011286035,0.010234449,0.009901353,0.004140241],"category_scores_gemma":[0.39606225,0.0018252869,0.010519394,0.009019755,0.003867173,0.0053033438,0.009662706,0.015755193,0.0036923059],"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.00066812703,0.0005857333,0.0030786442,0.04031102,0.0013489807,0.00050444173,0.0106893005,0.0026988327,0.0011791534,0.034868803,0.39798847,0.5060785],"study_design_scores_gemma":[0.0015459274,0.00058650266,0.008270632,0.13472003,0.0024282993,0.0007938394,0.0053120535,0.004658801,0.0022365358,0.041516345,0.79731554,0.0006154784],"about_ca_topic_score_codex":0.011778386,"about_ca_topic_score_gemma":0.011136938,"teacher_disagreement_score":0.5994574,"about_ca_system_score_codex":0.0153108835,"about_ca_system_score_gemma":0.055388354,"threshold_uncertainty_score":0.73923767},"labels":[],"label_agreement":null},{"id":"W6976963569","doi":"10.6084/m9.figshare.c.6946243.v1","title":"Alterations to the bovine bacterial ocular surface microbiome in the context of infectious bovine keratoconjunctivitis","year":2024,"lang":"en","type":"other","venue":"Figshare","topic":"Complexity and Algorithms in Graphs","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 Saskatchewan","funders":"","keywords":"Keratoconjunctivitis; Moraxella; Context (archaeology); Polymerase chain reaction; Ribosomal RNA; Microbiome","score_opus":0.021833958259665553,"score_gpt":0.2516233448364871,"score_spread":0.22978938657682152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6976963569","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.9992112,0.00037203875,0.00012054832,0.000011108879,0.0000022584256,0.000003518373,0.0001201685,0.0000019305826,0.00015721518],"genre_scores_gemma":[0.9995065,0.00011916363,0.0001356178,0.000023081127,0.0000022824768,0.000003674151,0.00013207809,0.0000010249383,0.000076584394],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9993524,0.000137189,0.000044128126,0.00017376417,0.0001202076,0.00017236045],"domain_scores_gemma":[0.9994541,0.00008827825,0.0002665482,0.000019774046,0.00009959904,0.000071711554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005074631,0.000251018,0.00036458104,0.00049984583,0.000409399,0.001145695,0.00017392366,0.00041315853,0.00063769124],"category_scores_gemma":[0.00071160734,0.00017037673,0.00018732154,0.00045054682,0.0004392025,0.00034152612,0.0003519722,0.00028422702,0.00010044651],"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.0008354507,0.00010257772,0.8443144,0.00018276014,0.00012562382,0.00031956934,0.0007889438,0.0001910131,0.14721736,0.00005187579,0.000102484824,0.0057680337],"study_design_scores_gemma":[0.0000034778584,0.00021863573,0.99491936,0.000018685136,0.000046520636,0.00043727833,0.00087086554,0.00030150014,0.0028801148,0.00003615723,0.0002620583,0.000005208685],"about_ca_topic_score_codex":0.0067771873,"about_ca_topic_score_gemma":0.008680195,"teacher_disagreement_score":0.0067771873,"about_ca_system_score_codex":0.0006602083,"about_ca_system_score_gemma":0.00032676428,"threshold_uncertainty_score":0.013475478},"labels":[],"label_agreement":null},{"id":"W6987960037","doi":"","title":"Variants of Pseudo-deterministic Algorithms and Duality in TFNP","year":2023,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Complexity and Algorithms in Graphs","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":"Randomized algorithm; Bounded function; Deterministic algorithm; Quantum algorithm; Verifiable secret sharing; Relaxation (psychology); Duality (order theory); Search algorithm; Perspective (graphical)","score_opus":0.020996894585441246,"score_gpt":0.2356262123878076,"score_spread":0.21462931780236635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6987960037","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.008902119,0.0005813226,0.96769476,0.0032028107,0.00030946799,0.00015207153,0.00034313183,0.00087755,0.017936857],"genre_scores_gemma":[0.45003262,0.0011221552,0.523304,0.0041789166,0.0010974173,0.0012558143,0.0009827954,0.001070698,0.01695564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98401135,0.005253708,0.0009428668,0.003196555,0.004532328,0.0020632113],"domain_scores_gemma":[0.95946056,0.028349638,0.0013503715,0.007536132,0.002297033,0.001006265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011164715,0.0014681792,0.0019481862,0.0017216835,0.0022116136,0.007592873,0.005688873,0.0036704545,0.008451803],"category_scores_gemma":[0.048039928,0.0012863256,0.0037516996,0.0027934706,0.0072597805,0.016914692,0.008561297,0.012406093,0.0019665107],"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.00011522721,0.000056892746,0.00025937028,0.000114166854,0.000026046726,0.00007372628,0.00020488763,0.02441161,0.00047777846,0.95854074,0.0028761704,0.0128434105],"study_design_scores_gemma":[0.000044204535,0.000036109224,0.0000674328,0.000034791436,0.00001990077,0.00010900444,0.0000375338,0.12286507,0.00086871826,0.868544,0.007348603,0.000024610312],"about_ca_topic_score_codex":0.003134015,"about_ca_topic_score_gemma":0.002214488,"teacher_disagreement_score":0.011164715,"about_ca_system_score_codex":0.006215107,"about_ca_system_score_gemma":0.005428274,"threshold_uncertainty_score":0.059045315},"labels":[],"label_agreement":null},{"id":"W6989107854","doi":"","title":"Algorithmic embeddings","year":2006,"lang":"en","type":"dissertation","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Complexity and Algorithms in Graphs","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":"Sequence (biology); Set (abstract data type); Matching (statistics); Algebra over a field; Field (mathematics); Key (lock); Stability (learning theory); Feature (linguistics)","score_opus":0.009857931847348947,"score_gpt":0.24944986277631098,"score_spread":0.23959193092896203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6989107854","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.023517542,0.009335877,0.3727416,0.01339254,0.0021808997,0.00022538056,0.0039547808,0.0016408854,0.57301056],"genre_scores_gemma":[0.4173278,0.010308649,0.2641748,0.0032244453,0.0024453895,0.0005941531,0.01254432,0.0019866396,0.28739387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986733,0.0002578663,0.00011122256,0.0004700703,0.00035125145,0.00013636256],"domain_scores_gemma":[0.99782073,0.00090186764,0.00013530518,0.0005518419,0.00041509693,0.00017504398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008082761,0.0012092649,0.00069348677,0.0021859985,0.0018646598,0.0051004817,0.0013604681,0.0012152374,0.05791956],"category_scores_gemma":[0.0055213915,0.00064788404,0.0014159307,0.002350891,0.0020254026,0.009481817,0.00405434,0.0037926605,0.011957283],"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.000026393443,0.000039739396,0.00026392174,0.0001250715,0.000015930336,0.000065764456,0.00020567089,0.0009005204,0.00039098453,0.9189931,0.03721815,0.041754693],"study_design_scores_gemma":[0.000009715209,0.000012359166,0.00024019257,0.000049288894,0.000012949652,0.00016536462,0.000153001,0.0022,0.0003556549,0.90225434,0.09453992,0.0000072374055],"about_ca_topic_score_codex":0.0007548335,"about_ca_topic_score_gemma":0.0011432583,"teacher_disagreement_score":0.05791956,"about_ca_system_score_codex":0.0018550687,"about_ca_system_score_gemma":0.0006957372,"threshold_uncertainty_score":0.19376022},"labels":[],"label_agreement":null},{"id":"W7024048979","doi":"","title":"Politique institutionnelle d'évaluation des apprentissages du Collège MultiHexa Québec","year":2015,"lang":"fr","type":"other","venue":"Bibliothèque et Archives nationales du Québec (Québec government)","topic":"Complexity and Algorithms in Graphs","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":"Power (physics); Politics; Context (archaeology); Field (mathematics); Feature (linguistics)","score_opus":0.027938165970894893,"score_gpt":0.24488069018461817,"score_spread":0.2169425242137233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024048979","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.7583902,0.005742454,0.01519182,0.020786462,0.0004953705,0.0009683787,0.010586136,0.0005829217,0.18725625],"genre_scores_gemma":[0.8606395,0.0014706977,0.0060037803,0.0008937774,0.00015259409,0.0005148013,0.0027626795,0.00009425045,0.12746787],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932835,0.0016215739,0.00018302341,0.00066187227,0.0025115549,0.0017384404],"domain_scores_gemma":[0.9822083,0.004202379,0.0009608045,0.0007192567,0.008227293,0.0036818616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056093764,0.0005671173,0.0007032104,0.0029291958,0.0033577287,0.006691219,0.001426908,0.0014956027,0.023875535],"category_scores_gemma":[0.015739016,0.0004138012,0.0007596753,0.0029924377,0.0015492263,0.0017176886,0.0014862417,0.0023456227,0.0014579041],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024704023,0.0016465037,0.28450277,0.00087788363,0.00060026365,0.0005230777,0.0051735826,0.049217265,0.005157621,0.16830966,0.0894192,0.39210185],"study_design_scores_gemma":[0.0003208532,0.00046644258,0.77859527,0.0005176733,0.00010033407,0.000097096236,0.006020035,0.030617679,0.0031238785,0.004673719,0.17534113,0.00012590089],"about_ca_topic_score_codex":0.97268337,"about_ca_topic_score_gemma":0.97263056,"teacher_disagreement_score":0.08313399,"about_ca_system_score_codex":0.08313399,"about_ca_system_score_gemma":0.09277638,"threshold_uncertainty_score":0.60318214},"labels":[],"label_agreement":null},{"id":"W7024536365","doi":"","title":"Sitting Room Stories by Lindsay Zier-Vogel","year":2006,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Complexity and Algorithms in Graphs","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":"Sitting; Queen (butterfly); Exhibition; Craft; Clothing","score_opus":0.005985769966687052,"score_gpt":0.18370879007493957,"score_spread":0.17772302010825253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024536365","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.0020200748,0.061205223,0.0027266184,0.04833537,0.012780252,0.00006425456,0.0018725073,0.0018220787,0.86917365],"genre_scores_gemma":[0.0067505026,0.016623156,0.00090363587,0.004805955,0.00094335474,0.000038822807,0.0005327629,0.0005039487,0.96889794],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995975,0.000096531985,0.000010093812,0.00006074184,0.00017677146,0.000058386897],"domain_scores_gemma":[0.9994843,0.00013320273,0.000026457992,0.000032035736,0.00015421947,0.00016985138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005628201,0.00095821015,0.00046087688,0.0006100319,0.002210035,0.0026942843,0.0005606883,0.00085906597,0.14671792],"category_scores_gemma":[0.0014354693,0.00053084386,0.0002761221,0.0007241143,0.0007120673,0.002726376,0.0018672487,0.0024608898,0.10052887],"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.0000037822324,0.0000034627278,0.0000112498265,0.000014194407,5.529201e-7,0.000013039838,0.00009248222,0.000017429824,0.00003969668,0.0008153744,0.9931155,0.0058732834],"study_design_scores_gemma":[0.0000010345015,0.0000041628828,0.00011877495,0.00004573299,8.0479055e-7,0.000044261476,0.00022178024,0.000020515476,0.0000476955,0.00033221286,0.9991598,0.0000032346197],"about_ca_topic_score_codex":0.011742221,"about_ca_topic_score_gemma":0.0353003,"teacher_disagreement_score":0.14671792,"about_ca_system_score_codex":0.0013510669,"about_ca_system_score_gemma":0.0009205802,"threshold_uncertainty_score":0.49082035},"labels":[],"label_agreement":null},{"id":"W7028837214","doi":"","title":"1967 House Bill 4679. An Act Authorizing The Board Of Trustees Of State Colleges To Acquire A Certain Parcel Of Land In The Town Of Bridgewater, And To Convey A Certain Parcel Of Land In Said Town To The Roman Catholic Archbishop Of Boston In Exchange Therefor.","year":2016,"lang":"en","type":"other","venue":"State Library's electronic repository (State Library of Massachusetts)","topic":"Complexity and Algorithms in Graphs","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":"Legislature; State (computer science); Legislative assembly; State legislature; Legislation; Quarter (Canadian coin)","score_opus":0.013328335664568446,"score_gpt":0.23449944616265772,"score_spread":0.22117111049808927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7028837214","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.001613735,0.00096305483,0.0006797937,0.00877157,0.0012819972,0.00009947978,0.010167822,0.00029614556,0.97612643],"genre_scores_gemma":[0.011118139,0.00084822054,0.0005508922,0.0032506906,0.00025583783,0.0001191414,0.0029200828,0.0001283889,0.9808086],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986467,0.00009898039,0.000085232,0.0002078559,0.00059464347,0.00036664525],"domain_scores_gemma":[0.998747,0.00026870257,0.000080755344,0.00013651873,0.00063699356,0.00013012803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005713208,0.00087861274,0.0004801022,0.0013159912,0.0048744967,0.002550973,0.0007432615,0.0036215598,0.25648206],"category_scores_gemma":[0.003954179,0.0008093559,0.00045278625,0.0020822661,0.0012625211,0.0020114435,0.0012030813,0.003328984,0.13080814],"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.00002475862,0.000014530944,0.00018318795,0.000029383258,0.0000022078293,0.00006475253,0.00012933258,0.000091889655,0.00011447985,0.075426474,0.9096735,0.014245524],"study_design_scores_gemma":[0.00001208061,0.000007279209,0.0011817905,0.00006999697,0.0000047521285,0.000037838756,0.00009711371,0.000047675912,0.00009393125,0.0065645855,0.99187356,0.000009362078],"about_ca_topic_score_codex":0.13352703,"about_ca_topic_score_gemma":0.27964297,"teacher_disagreement_score":0.25648206,"about_ca_system_score_codex":0.0058508064,"about_ca_system_score_gemma":0.005240487,"threshold_uncertainty_score":0.858018},"labels":[],"label_agreement":null},{"id":"W7039554618","doi":"","title":"LL.D. citation for Hon. Brian Lennox, 12 June 2007","year":2007,"lang":"en","type":"other","venue":"Internet Archive (Internet Archive)","topic":"Complexity and Algorithms in Graphs","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":"Citation; Citation analysis; Bibliometrics","score_opus":0.025183137492322448,"score_gpt":0.26423547779048384,"score_spread":0.2390523402981614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039554618","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.00013317964,0.002815321,0.00035021265,0.012833628,0.008651965,0.000080652295,0.0043592546,0.0006359228,0.9701398],"genre_scores_gemma":[0.0007209963,0.0015499888,0.00008529931,0.0010868565,0.0004643113,0.000031088573,0.0009001992,0.00013697759,0.9950244],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99919075,0.000063835585,0.000045968613,0.00013485157,0.00043084152,0.00013372253],"domain_scores_gemma":[0.9964713,0.00039427116,0.00013293195,0.00023668342,0.0020093373,0.00075558986],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008834443,0.0008447889,0.0012391708,0.0024953198,0.0018368469,0.003968621,0.0013361418,0.0023579474,0.7464158],"category_scores_gemma":[0.006230875,0.00046788767,0.0004525369,0.002973237,0.00066881353,0.0018772137,0.001818342,0.0022329786,0.76329595],"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.000004142828,0.0000052086493,0.000026131544,0.00002933429,4.896755e-7,0.000004972759,0.000006852337,0.000014264292,0.000018783936,0.0009858091,0.99012977,0.0087743085],"study_design_scores_gemma":[0.0000043912196,0.0000057180887,0.00020263658,0.000078252655,0.0000011426049,0.00001056829,0.0000234672,0.000032430355,0.000033676533,0.00052966556,0.99907506,0.0000030121148],"about_ca_topic_score_codex":0.01482189,"about_ca_topic_score_gemma":0.032655798,"teacher_disagreement_score":0.7464158,"about_ca_system_score_codex":0.003207881,"about_ca_system_score_gemma":0.0028257687,"threshold_uncertainty_score":0.3617071},"labels":[],"label_agreement":null},{"id":"W7039988198","doi":"","title":"Nouvelles normes financières / New financial standards","year":2010,"lang":"fr","type":"other","venue":"OpenEdition (OpenEdition)","topic":"Complexity and Algorithms in Graphs","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":"Lien; Quarter (Canadian coin); Financial management","score_opus":0.017611868905331934,"score_gpt":0.24818968609001235,"score_spread":0.23057781718468043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039988198","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.006638798,0.10285886,0.0200803,0.17798197,0.01749715,0.00007187601,0.0019136792,0.00053727586,0.6724201],"genre_scores_gemma":[0.1637822,0.07347594,0.025686009,0.014962332,0.015579341,0.00019370735,0.0023769345,0.00070192467,0.7032417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977018,0.0005331471,0.00012725167,0.00037713873,0.0010690234,0.00019161506],"domain_scores_gemma":[0.997863,0.000528299,0.0003364333,0.00032034673,0.0007552404,0.00019676847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025662538,0.00063508534,0.0004073944,0.002097079,0.0016508438,0.006486723,0.0006361306,0.0020160568,0.040586956],"category_scores_gemma":[0.0051541384,0.00034085347,0.0005019263,0.002559702,0.0030135307,0.00803833,0.0015734364,0.0042478736,0.009186838],"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.000023197528,0.00002126205,0.00041858794,0.00011801064,0.0000066064167,0.000039350965,0.00050096127,0.00018611434,0.00020501864,0.5787822,0.35065764,0.06904099],"study_design_scores_gemma":[0.000005036909,0.000006611207,0.0010801639,0.00016635297,0.000003520718,0.0000791863,0.0002339572,0.00020076009,0.00020436957,0.0710176,0.9269886,0.000013824335],"about_ca_topic_score_codex":0.013022084,"about_ca_topic_score_gemma":0.016622195,"teacher_disagreement_score":0.040586956,"about_ca_system_score_codex":0.003680694,"about_ca_system_score_gemma":0.0025250546,"threshold_uncertainty_score":0.13577688},"labels":[],"label_agreement":null},{"id":"W7042847394","doi":"","title":"On the resilient behaviour of unbound aggregates","year":2000,"lang":"en","type":"article","venue":"NPARC","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":3,"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":"King Saud University; National Science Foundation","keywords":"Modulus; Aggregate (composite); Factorial experiment; Elastic modulus; Young's modulus; Granular material; Dynamic modulus; Triaxial shear test; Resilience (materials science)","score_opus":0.01771136611647199,"score_gpt":0.23638809322063672,"score_spread":0.21867672710416475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042847394","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.9751418,0.00018468917,0.023055268,0.000033300355,0.0000068476133,0.000010920521,0.00006131746,0.0000581621,0.0014475546],"genre_scores_gemma":[0.9963245,0.00007770697,0.0031879747,0.000011436893,0.0000032673042,0.0000048549346,0.00004675609,0.000009528636,0.00033385752],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996406,0.000066096145,0.000014325655,0.0000783816,0.00015913797,0.000041494342],"domain_scores_gemma":[0.9984806,0.0009491504,0.0002602836,0.000145349,0.00010983296,0.000054729957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040719932,0.00025101728,0.00022865838,0.0007245098,0.00017926045,0.00027138402,0.0002306527,0.00023690028,0.0014084888],"category_scores_gemma":[0.0019270014,0.00010883525,0.00016355481,0.00036814157,0.00058976247,0.00075290067,0.0002941966,0.00028960782,0.0002488939],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035612725,0.00006625274,0.008472021,0.00011301,0.00002482415,0.00045463507,0.00021129202,0.031460524,0.9235659,0.0021934665,0.00008435178,0.032997645],"study_design_scores_gemma":[0.000011823839,0.0014921012,0.03356018,0.000025881955,0.000040352406,0.00082025817,0.000263936,0.16715863,0.78921103,0.005670001,0.0016925636,0.000053080043],"about_ca_topic_score_codex":0.00035738436,"about_ca_topic_score_gemma":0.00046421684,"teacher_disagreement_score":0.0014084888,"about_ca_system_score_codex":0.00015758946,"about_ca_system_score_gemma":0.000076512886,"threshold_uncertainty_score":0.0047118664},"labels":[],"label_agreement":null},{"id":"W7043540244","doi":"","title":"Succinct Data Structures for Chordal Graphs","year":2019,"lang":"en","type":"dissertation","venue":"UWSpace (University of Waterloo)","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo","keywords":"Chordal graph; Interval graph; Neighbourhood (mathematics); Shortest path problem; Vertex (graph theory); Distance; Longest path problem; Graph; Induced path","score_opus":0.025651131041929152,"score_gpt":0.2386570289104132,"score_spread":0.21300589786848406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7043540244","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.08123839,0.0022439174,0.8909946,0.0034874578,0.00033426075,0.00045604014,0.006730555,0.006034344,0.008480541],"genre_scores_gemma":[0.47108626,0.0020036544,0.5053106,0.0010302089,0.00031046793,0.00077088946,0.010695796,0.0006542806,0.008137857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997104,0.00047641667,0.0003684499,0.00051133835,0.0012628837,0.00027681483],"domain_scores_gemma":[0.98842156,0.004214583,0.0009814845,0.004956078,0.0011226358,0.00030358948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001602034,0.0009258135,0.0012239313,0.0015344496,0.0012947312,0.0033637164,0.0034041216,0.0013391032,0.0076929675],"category_scores_gemma":[0.012105557,0.00077586295,0.00093494164,0.004421473,0.0015343677,0.013982442,0.0032066444,0.0025289368,0.0016151714],"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.0019091927,0.0005747386,0.0035749602,0.001590793,0.00012565608,0.00024532588,0.0010727439,0.13445501,0.02524712,0.44375214,0.0482504,0.33920184],"study_design_scores_gemma":[0.00027722106,0.0004102447,0.0007193812,0.0002183181,0.000085036554,0.0004116729,0.0005233539,0.35324827,0.032223765,0.5692791,0.042496193,0.000107562104],"about_ca_topic_score_codex":0.0022625925,"about_ca_topic_score_gemma":0.0032788708,"teacher_disagreement_score":0.0076929675,"about_ca_system_score_codex":0.0032520476,"about_ca_system_score_gemma":0.0019972003,"threshold_uncertainty_score":0.025735497},"labels":[],"label_agreement":null},{"id":"W7084153732","doi":"10.6084/m9.figshare.30109760.v1","title":"Additional file 1 of Trends in maternal mortality and stillbirths by county in health facility data, Kenya, 2011-2022","year":2025,"lang":"en","type":"article","venue":"Figshare","topic":"Complexity and Algorithms in Graphs","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 Manitoba","funders":"","keywords":"Health facility; Perinatal mortality; Fetal death; Population; Maternal health; Pregnancy","score_opus":0.057874356744398996,"score_gpt":0.3062634764698677,"score_spread":0.24838911972546868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084153732","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.00008703219,0.000004836489,0.000029358986,0.00001554472,0.0000046700698,0.000010176778,0.9995732,0.000026497442,0.00024868466],"genre_scores_gemma":[0.0052428897,0.00007810109,0.0007612447,0.00008941295,0.000021585152,0.00045523586,0.9901674,0.000116734416,0.0030674052],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99935776,0.000095575684,0.00012948271,0.00014181915,0.0001397478,0.00013564083],"domain_scores_gemma":[0.99042904,0.0056864643,0.0011787276,0.0005611199,0.0017201384,0.00042458723],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010370575,0.00065431517,0.00087463146,0.003427131,0.0006141382,0.0011303024,0.0015387607,0.00075556396,0.72069895],"category_scores_gemma":[0.019810768,0.000592732,0.0007077398,0.008745161,0.00017178156,0.0013948174,0.00083333865,0.0008581676,0.08314135],"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.00012789604,0.00005476636,0.0056666406,0.0016109399,0.000049752947,0.00003122214,0.00004767359,0.0005269344,0.000037333666,0.00061246107,0.98543096,0.005803461],"study_design_scores_gemma":[0.003683518,0.00029558028,0.16342327,0.004393472,0.00035096644,0.00052183494,0.0010748978,0.0034208253,0.0005567134,0.0070321937,0.8151041,0.00014269493],"about_ca_topic_score_codex":0.03772213,"about_ca_topic_score_gemma":0.056799494,"teacher_disagreement_score":0.72069895,"about_ca_system_score_codex":0.001223524,"about_ca_system_score_gemma":0.002751537,"threshold_uncertainty_score":0.39838904},"labels":[],"label_agreement":null},{"id":"W7091187777","doi":"","title":"The Branch-and-Bound Tree Closure","year":2025,"lang":"en","type":"article","venue":"ArXiv.org","topic":"Complexity and Algorithms in Graphs","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":"Canada First Research Excellence Fund; Institut de Valorisation des Données; Compute Canada","keywords":"Hierarchy; Knapsack problem; Tree (set theory); Closure (psychology); Branching (polymer chemistry); Computational complexity theory; Linear programming; Integer programming","score_opus":0.024061339789402152,"score_gpt":0.25960561717554353,"score_spread":0.2355442773861414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7091187777","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.0055342587,0.00018303479,0.9918724,0.00015694243,0.000014739166,0.000043352684,0.00009187974,0.00009025545,0.002013211],"genre_scores_gemma":[0.28338152,0.0009694611,0.7106797,0.00033951478,0.00013176104,0.00043635408,0.00069245556,0.00040037898,0.0029689556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961991,0.0014592145,0.00015017828,0.0005432884,0.0013324762,0.0003157314],"domain_scores_gemma":[0.9793991,0.017184898,0.0009204695,0.0011362331,0.001062989,0.0002962847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061602974,0.0012923435,0.0013980496,0.0020714605,0.00092693884,0.002545174,0.0017516544,0.0012430548,0.0055028223],"category_scores_gemma":[0.028519867,0.001114382,0.002099676,0.0014293323,0.0024527293,0.0052219834,0.0020715059,0.0051062237,0.000860209],"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.00029541526,0.00012064511,0.0014225877,0.00035994902,0.00008102889,0.0001155089,0.00046885037,0.4214223,0.0061617494,0.48481846,0.0026986625,0.082034886],"study_design_scores_gemma":[0.000018185821,0.00008273829,0.0001999764,0.00009006288,0.000024296427,0.00006256932,0.000032088417,0.82861495,0.0026274035,0.16511184,0.0031197737,0.000015994307],"about_ca_topic_score_codex":0.0020722246,"about_ca_topic_score_gemma":0.0012732896,"teacher_disagreement_score":0.0061602974,"about_ca_system_score_codex":0.0018309368,"about_ca_system_score_gemma":0.002663085,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W7092316957","doi":"","title":"Decoding Balanced Linear Codes With Preprocessing","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Complexity and Algorithms in Graphs","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; National Research Foundation Singapore; National Research Foundation","keywords":"Decoding methods; Hamming code; Linear code; Error detection and correction; Preprocessor; Decodes; Code (set theory); Set (abstract data type); Cryptography; Hamming distance","score_opus":0.041778495898573305,"score_gpt":0.29439412298193485,"score_spread":0.25261562708336155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7092316957","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.08455611,0.00019994541,0.9049298,0.0006061772,0.000047324185,0.000100251345,0.0004714495,0.0024499097,0.006639117],"genre_scores_gemma":[0.6209198,0.0002666973,0.36772293,0.00041181763,0.000104252475,0.00039432204,0.0017012097,0.00047839544,0.008000582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976082,0.0005323781,0.00013962053,0.00051559764,0.0009050453,0.00029915955],"domain_scores_gemma":[0.994356,0.0026202982,0.000610926,0.0016668921,0.0006206734,0.00012518562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010632135,0.0009513996,0.0009310467,0.000711002,0.00072008214,0.0014326492,0.001292908,0.0013020273,0.0026848477],"category_scores_gemma":[0.011354577,0.0005239195,0.0006839119,0.0011494878,0.0014042398,0.0026345253,0.0023059116,0.0019186293,0.0020316443],"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.0014380493,0.00024715802,0.0025155647,0.00031005644,0.000106060936,0.00026435763,0.00047955755,0.49711382,0.056533746,0.18140312,0.008430295,0.25115824],"study_design_scores_gemma":[0.00008953988,0.0001620945,0.00041574062,0.00003338342,0.00002424493,0.00014348004,0.000032721557,0.8279626,0.026927823,0.14139055,0.0027855067,0.000032363758],"about_ca_topic_score_codex":0.0013752183,"about_ca_topic_score_gemma":0.0017782146,"teacher_disagreement_score":0.0026848477,"about_ca_system_score_codex":0.0015108688,"about_ca_system_score_gemma":0.0019149337,"threshold_uncertainty_score":0.010962188},"labels":[],"label_agreement":null},{"id":"W7096919117","doi":"","title":"University of Alberta Correct and Efficient Search Algorithms in the Presence of Repetitions","year":2008,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Search algorithm; Key (lock); Feature (linguistics); Search engine indexing","score_opus":0.02883123464871475,"score_gpt":0.23009643804069543,"score_spread":0.20126520339198067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096919117","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.14742778,0.008243465,0.56850195,0.021534387,0.0028046789,0.0002305179,0.0023144009,0.0050328206,0.2439101],"genre_scores_gemma":[0.5732851,0.0039670207,0.28542128,0.0010943762,0.001114607,0.00018230292,0.0026531785,0.0011300361,0.131152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963617,0.0007361651,0.00015312688,0.0008192896,0.0014554345,0.00047425163],"domain_scores_gemma":[0.97682774,0.014396608,0.0008000789,0.003502395,0.003702111,0.0007710588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020848222,0.001131675,0.0017151803,0.0022941881,0.002328684,0.004780741,0.0024558476,0.0025401046,0.022114517],"category_scores_gemma":[0.024043372,0.0010749082,0.0011769807,0.0031844538,0.003273026,0.003472555,0.0021196776,0.0041958936,0.0043269205],"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.0016055382,0.00031741563,0.003676752,0.00065378007,0.00014733576,0.00061934994,0.0005274613,0.20880635,0.00830186,0.4873924,0.077324234,0.2106275],"study_design_scores_gemma":[0.0002728832,0.000101974445,0.0016002805,0.00021167067,0.00012326617,0.00047154928,0.00018028995,0.3369106,0.0074279066,0.59493375,0.057663735,0.00010206463],"about_ca_topic_score_codex":0.06277515,"about_ca_topic_score_gemma":0.082127884,"teacher_disagreement_score":0.06277515,"about_ca_system_score_codex":0.005809683,"about_ca_system_score_gemma":0.00709187,"threshold_uncertainty_score":0.12481946},"labels":[],"label_agreement":null},{"id":"W7099757918","doi":"","title":"THE UNIVERSITY OF CALGARY The Classical and Quantum Complexity of the Goldreich-Levin Problem with Applications to Bit Commitment","year":2004,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"License; Bit (key); Copyright law","score_opus":0.028236035629157975,"score_gpt":0.2273549514697166,"score_spread":0.19911891584055863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099757918","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.032865554,0.20515294,0.022558259,0.1469909,0.011667287,0.00010889055,0.0055679698,0.0010103933,0.5740779],"genre_scores_gemma":[0.37076104,0.12600432,0.031797875,0.006883919,0.01127374,0.00029702048,0.0056889034,0.0009035374,0.4463897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983777,0.00026792346,0.000077925644,0.00050442293,0.00057782285,0.00019420465],"domain_scores_gemma":[0.9949403,0.0024696912,0.00033816576,0.00068135,0.001080486,0.0004899939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015749307,0.0013640767,0.0024365135,0.0036747253,0.004791316,0.011443082,0.0018813502,0.0027324723,0.058785446],"category_scores_gemma":[0.010773656,0.0012974828,0.0011506046,0.009630731,0.0052983705,0.0053161955,0.004224553,0.008660317,0.0071231513],"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.00014695323,0.000048177928,0.0013072584,0.0006391184,0.00007686772,0.0002111669,0.00054037693,0.007184387,0.00032548164,0.7281266,0.1788533,0.0825404],"study_design_scores_gemma":[0.000039038463,0.000019675917,0.0020240261,0.0006652523,0.00003738326,0.00012861696,0.00026025085,0.0050535626,0.00052659726,0.7128529,0.2783254,0.00006713398],"about_ca_topic_score_codex":0.12863407,"about_ca_topic_score_gemma":0.101957895,"teacher_disagreement_score":0.12863407,"about_ca_system_score_codex":0.038886167,"about_ca_system_score_gemma":0.012630424,"threshold_uncertainty_score":0.2821402},"labels":[],"label_agreement":null},{"id":"W7104183500","doi":"","title":"Relaxed vs. Full Local Decodability with Few Queries: Equivalence and Separations for Linear Codes","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Complexity and Algorithms in Graphs","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":"Banff International Research Station for Mathematical Innovation and Discovery; Johns Hopkins University; National Science Foundation","keywords":"Code word; Soundness; Equivalence (formal languages); Constant (computer programming); Code (set theory); Simple (philosophy); Decoding methods; Upper and lower bounds","score_opus":0.041800537560898174,"score_gpt":0.30927556710363674,"score_spread":0.26747502954273855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104183500","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.22575529,0.0026163852,0.71445,0.0044266917,0.0002079472,0.00041136538,0.0012251026,0.0016741679,0.049233112],"genre_scores_gemma":[0.8810504,0.0015674374,0.10360628,0.0019317447,0.00037004068,0.0005142172,0.00097120146,0.00065723987,0.009331393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918417,0.0019325968,0.00050240196,0.0016393401,0.0025630328,0.0015209591],"domain_scores_gemma":[0.96606666,0.023159647,0.001782662,0.006161112,0.0017563128,0.0010735351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038949598,0.0011367877,0.0018651764,0.0011661585,0.0016285009,0.0038728332,0.0029409286,0.002706726,0.008001473],"category_scores_gemma":[0.030078586,0.0006953355,0.001441402,0.0017326428,0.0057596485,0.013621361,0.0067473385,0.008118578,0.0018487999],"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.0009138726,0.00026701565,0.0005694237,0.00034532647,0.000031321648,0.00019864275,0.0009693912,0.0344157,0.008961018,0.9074205,0.004260863,0.04164707],"study_design_scores_gemma":[0.00013197293,0.00028735676,0.0002769427,0.00008123727,0.000032387226,0.0003016072,0.00019232646,0.12687291,0.0067852004,0.86053777,0.004415562,0.00008475202],"about_ca_topic_score_codex":0.0014468823,"about_ca_topic_score_gemma":0.00073994236,"teacher_disagreement_score":0.008001473,"about_ca_system_score_codex":0.002891083,"about_ca_system_score_gemma":0.0029814795,"threshold_uncertainty_score":0.026767612},"labels":[],"label_agreement":null},{"id":"W7109950510","doi":"10.4230/lipics.icalp.2025.28","title":"Faster & Deterministic FPT Algorithm for Worst-Case Tensor Decomposition","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Tensor (intrinsic definition); Decomposition; Deterministic algorithm; Rank (graph theory); Cluster analysis; Time complexity; State (computer science); Randomized algorithm","score_opus":0.015887207734168993,"score_gpt":0.2990740121710311,"score_spread":0.28318680443686206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109950510","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.036756024,0.000848013,0.91725624,0.0029745467,0.00031632945,0.00038537057,0.002240465,0.023863558,0.015359443],"genre_scores_gemma":[0.31203517,0.00030737033,0.6697902,0.0011364106,0.00025099158,0.00049372273,0.005048871,0.0021133565,0.00882389],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995407,0.0005609412,0.00029762962,0.0015110599,0.0011445087,0.0010789926],"domain_scores_gemma":[0.99176216,0.0028054027,0.0005935646,0.0036011229,0.0008844496,0.00035320924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002312469,0.0022335704,0.0020910506,0.0011799729,0.0019338166,0.0036056393,0.0038167904,0.0022399824,0.0122234365],"category_scores_gemma":[0.0087542925,0.0009652007,0.002901248,0.0023466216,0.0016733977,0.0067519,0.0032946246,0.003666005,0.00707254],"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.0024699627,0.0010875503,0.004807548,0.001171054,0.0003440953,0.00048878475,0.0005895813,0.16618112,0.04646801,0.12740791,0.106180556,0.54280376],"study_design_scores_gemma":[0.00040703797,0.00020800471,0.0007768274,0.00006328522,0.00017193537,0.00052220863,0.0001442664,0.8192951,0.021316081,0.13841748,0.018585736,0.000092044764],"about_ca_topic_score_codex":0.006731509,"about_ca_topic_score_gemma":0.0095083425,"teacher_disagreement_score":0.0122234365,"about_ca_system_score_codex":0.0045915945,"about_ca_system_score_gemma":0.0064789713,"threshold_uncertainty_score":0.04089141},"labels":[],"label_agreement":null},{"id":"W7109957065","doi":"10.4230/lipics.itcs.2025.43","title":"Space Complexity of Minimum Cut Problems in Single-Pass Streams","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Upper and lower bounds; Minimum cut; Graph; Streaming algorithm; Time complexity; Space (punctuation); Data stream mining; Cut; Matching (statistics)","score_opus":0.03389015576445151,"score_gpt":0.26518836974327176,"score_spread":0.23129821397882025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109957065","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.15543674,0.0011334956,0.82967716,0.0022498493,0.00011195754,0.0003584295,0.0015842125,0.0031230538,0.006325128],"genre_scores_gemma":[0.5228822,0.0008801105,0.46684274,0.00034313905,0.0001591506,0.0005611523,0.0029613602,0.0006202925,0.004749907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696904,0.00064587843,0.00025985582,0.0008777745,0.0008622301,0.00038525218],"domain_scores_gemma":[0.9877446,0.008972505,0.0007634215,0.001389339,0.0007078712,0.00042218843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023619158,0.0013375984,0.0016708975,0.00092686294,0.0010837843,0.0037049516,0.0029919997,0.0020799786,0.0065808943],"category_scores_gemma":[0.016729448,0.00075216923,0.001560242,0.0021219796,0.0012970626,0.0076979776,0.0024944262,0.0029524711,0.0010983481],"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.0016848816,0.0004256868,0.003774285,0.0010149569,0.00019881547,0.00035420826,0.0006337639,0.72894746,0.014136792,0.07892165,0.00823579,0.16167176],"study_design_scores_gemma":[0.00008422963,0.00008404917,0.00029429185,0.000024847232,0.00002930387,0.0001247913,0.00011328575,0.90448594,0.0044991923,0.08886652,0.0013784181,0.000015088512],"about_ca_topic_score_codex":0.0026570016,"about_ca_topic_score_gemma":0.0034663263,"teacher_disagreement_score":0.0065808943,"about_ca_system_score_codex":0.0019772623,"about_ca_system_score_gemma":0.0017642599,"threshold_uncertainty_score":0.022015274},"labels":[],"label_agreement":null},{"id":"W7109976180","doi":"10.4230/lipics.icalp.2025.135","title":"Deterministic Independent Sets in the Semi-Streaming Model","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Independent set; Randomized algorithm; Set (abstract data type); Deterministic algorithm; Graph; Simple (philosophy)","score_opus":0.021156863291202654,"score_gpt":0.2862342634690988,"score_spread":0.26507740017789616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109976180","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.06359271,0.0008298439,0.9247036,0.002165687,0.00014018282,0.00024347546,0.0011268326,0.00069139816,0.006506306],"genre_scores_gemma":[0.69184667,0.0015966707,0.29154015,0.00085664087,0.00069882383,0.00072101766,0.0022222803,0.0002900641,0.010227589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937224,0.002215863,0.00034787535,0.0016090441,0.001403632,0.0007011209],"domain_scores_gemma":[0.9760342,0.015754804,0.0016748754,0.0043797386,0.0012524251,0.0009039567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042614588,0.0011954774,0.0022863147,0.0010762387,0.0013161214,0.0028763905,0.0038962713,0.0020219542,0.004951074],"category_scores_gemma":[0.017001176,0.00092358317,0.001984756,0.0024021456,0.0027439857,0.008872391,0.0031060216,0.0038453373,0.0011254782],"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.00077830435,0.00031998864,0.0015871292,0.00050360925,0.00016802807,0.00044555817,0.0003798818,0.3715225,0.006489112,0.57287824,0.007861203,0.037066452],"study_design_scores_gemma":[0.00006895843,0.000081760074,0.00022243267,0.000018499297,0.000025471269,0.00017899406,0.000042615568,0.6335657,0.001507361,0.3618117,0.0024510676,0.000025493508],"about_ca_topic_score_codex":0.0018248681,"about_ca_topic_score_gemma":0.0015452588,"teacher_disagreement_score":0.004951074,"about_ca_system_score_codex":0.0022986126,"about_ca_system_score_gemma":0.0017236351,"threshold_uncertainty_score":0.022537053},"labels":[],"label_agreement":null},{"id":"W7109987506","doi":"10.4230/lipics.icdt.2025.30","title":"An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Leibniz-Gemeinschaft; University of Toronto; Austrian Science Fund","keywords":"Binary decision diagram; Branching (polymer chemistry); Bounding overwatch; Focus (optics); Binary number; Boolean function; Branching process; Propositional formula","score_opus":0.02417305238824984,"score_gpt":0.3103360934267998,"score_spread":0.28616304103854995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7109987506","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.01709821,0.0007717365,0.9668394,0.0042653107,0.00020601977,0.00015093182,0.00065926573,0.002524757,0.0074843583],"genre_scores_gemma":[0.41860607,0.0013702483,0.55920666,0.003627635,0.0011445672,0.00092047,0.0018421657,0.0017923039,0.01148994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98594904,0.0041486192,0.00054598216,0.004081168,0.0035288206,0.0017464298],"domain_scores_gemma":[0.92278737,0.05920541,0.002687511,0.010064475,0.003251087,0.002004059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011306902,0.0030669633,0.003897721,0.0034042913,0.0025783768,0.008284046,0.0068934304,0.0037433254,0.009635045],"category_scores_gemma":[0.06685082,0.0015667933,0.006192682,0.0038182775,0.0063332412,0.016412128,0.007900475,0.017262617,0.0022867976],"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.00069799303,0.00039303993,0.0028171109,0.0005987334,0.00023021342,0.00022096882,0.00059104135,0.116722435,0.0048366757,0.76096976,0.01882048,0.093101524],"study_design_scores_gemma":[0.00004509072,0.00007030719,0.00023509716,0.000074143994,0.000105416155,0.00012265431,0.00005350332,0.5030086,0.0021888884,0.49024335,0.0037944154,0.000058522543],"about_ca_topic_score_codex":0.0045831613,"about_ca_topic_score_gemma":0.0050780443,"teacher_disagreement_score":0.011306902,"about_ca_system_score_codex":0.008598394,"about_ca_system_score_gemma":0.0064650853,"threshold_uncertainty_score":0.062385976},"labels":[],"label_agreement":null},{"id":"W7110000962","doi":"10.4230/lipics.ccc.2025.21","title":"Reconstruction of Depth 3 Arithmetic Circuits with Top Fan-In 3","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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","keywords":"Electronic circuit; Polynomial; Context (archaeology); Bounded function; Arithmetic circuit complexity; Constant (computer programming); Time complexity; Boolean circuit","score_opus":0.01237422835916938,"score_gpt":0.24770829661888488,"score_spread":0.2353340682597155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110000962","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.5289472,0.0005722724,0.44678882,0.0017523908,0.00008585739,0.00020604704,0.00091891584,0.004127848,0.016600695],"genre_scores_gemma":[0.9379511,0.00019735859,0.055612765,0.00043973138,0.000043374275,0.000075923905,0.0008052549,0.0002261597,0.0046482556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862874,0.00021597155,0.000073754716,0.0002678541,0.0004676023,0.0003460427],"domain_scores_gemma":[0.99463886,0.0031681075,0.0005848571,0.001035796,0.0003805193,0.00019184928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081689487,0.00061571505,0.0007395251,0.00051624177,0.00072966603,0.0022413032,0.0010505589,0.0010004586,0.007451744],"category_scores_gemma":[0.0075715855,0.00049362733,0.0013709827,0.0005566658,0.0015002142,0.0039111306,0.002297171,0.002275614,0.000956544],"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.0020030353,0.00031536305,0.013092628,0.0008315317,0.00014915284,0.0010169371,0.0012288159,0.11904735,0.057038397,0.5842403,0.009336016,0.2117005],"study_design_scores_gemma":[0.00020668173,0.0003371801,0.0019629775,0.000116527655,0.00015530392,0.00081095076,0.00033485173,0.33211207,0.06383927,0.5899262,0.010103159,0.000094846786],"about_ca_topic_score_codex":0.0016970291,"about_ca_topic_score_gemma":0.0024073445,"teacher_disagreement_score":0.007451744,"about_ca_system_score_codex":0.0016947679,"about_ca_system_score_gemma":0.0016554625,"threshold_uncertainty_score":0.02492857},"labels":[],"label_agreement":null},{"id":"W7110046025","doi":"10.4230/lipics.approx/random.2025.18","title":"A Randomized Rounding Approach for DAG Edge Deletion","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Rounding; Bipartite graph; Directed acyclic graph; Vertex (graph theory); Directed graph; Complete bipartite graph; Graph; Enhanced Data Rates for GSM Evolution; Set (abstract data type)","score_opus":0.02299139336251356,"score_gpt":0.2822831772117847,"score_spread":0.25929178384927115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110046025","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.033203036,0.0006879002,0.9538949,0.0012559767,0.00037169398,0.00023812221,0.000626489,0.002279283,0.0074426755],"genre_scores_gemma":[0.3876764,0.0004917365,0.60127914,0.0013282535,0.00033200003,0.0005554286,0.0013943792,0.00058412534,0.006358633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961139,0.0016984378,0.00016726082,0.00086785486,0.00065830775,0.00049409043],"domain_scores_gemma":[0.99270827,0.0043075797,0.00054381264,0.0016491432,0.0005072001,0.0002840921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031333757,0.001413206,0.0017634814,0.000848183,0.0012019651,0.0018887968,0.002913382,0.0015380217,0.00555932],"category_scores_gemma":[0.014214846,0.0007360122,0.0013424687,0.0017685655,0.0012060566,0.0032581822,0.0024466258,0.004183932,0.0016867651],"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.0013344391,0.0005063199,0.0016880655,0.00033858602,0.0001322016,0.0002899262,0.00027309224,0.6910345,0.0067694993,0.08693741,0.019764986,0.190931],"study_design_scores_gemma":[0.00020467317,0.0001734438,0.00023377418,0.00003943732,0.000034086468,0.00017977465,0.00009445817,0.9097515,0.0028889265,0.081035,0.0053233476,0.0000415361],"about_ca_topic_score_codex":0.0026607318,"about_ca_topic_score_gemma":0.0031039375,"teacher_disagreement_score":0.00555932,"about_ca_system_score_codex":0.0016350338,"about_ca_system_score_gemma":0.002303379,"threshold_uncertainty_score":0.018597782},"labels":[],"label_agreement":null},{"id":"W7110111634","doi":"10.4230/lipics.socg.2025.52","title":"Uniform Bounds on Product Sylvester-Gallai Configurations","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Product (mathematics); Bounded function; Extension (predicate logic); Algebraically closed field; Degree (music); Homogeneous; Scalar (mathematics); Polynomial","score_opus":0.015473343887221776,"score_gpt":0.273397003867277,"score_spread":0.25792365998005523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110111634","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.574034,0.0022128455,0.33193928,0.0027595386,0.00022873854,0.00023576047,0.0017772382,0.002171629,0.08464085],"genre_scores_gemma":[0.9622191,0.0005272965,0.027429849,0.00049564923,0.00019789295,0.00027304093,0.0010432563,0.00031496852,0.007498927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617934,0.0007594445,0.0002034381,0.0011221727,0.00081978756,0.0009158614],"domain_scores_gemma":[0.98279446,0.011915163,0.0011575536,0.002177946,0.00082475814,0.0011300459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002315937,0.0011298561,0.0015395515,0.002185983,0.002416974,0.0037451822,0.0027933908,0.0013825025,0.01962277],"category_scores_gemma":[0.017730145,0.000989353,0.001210717,0.001963408,0.0042351675,0.011776411,0.0072713876,0.0040339394,0.0020952108],"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.00060993497,0.000103652805,0.0039485395,0.0002612971,0.000056020363,0.00031628195,0.00047148153,0.020838775,0.004893936,0.94354475,0.0045253676,0.020429881],"study_design_scores_gemma":[0.000087583896,0.00022230638,0.0012477437,0.00007645667,0.00007719034,0.00042315785,0.00011728507,0.06161132,0.007134979,0.9222939,0.0066357795,0.000072273564],"about_ca_topic_score_codex":0.00049488357,"about_ca_topic_score_gemma":0.0006906182,"teacher_disagreement_score":0.01962277,"about_ca_system_score_codex":0.002496735,"about_ca_system_score_gemma":0.0007535388,"threshold_uncertainty_score":0.06564474},"labels":[],"label_agreement":null},{"id":"W7110127072","doi":"10.4230/lipics.esa.2025.44","title":"Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Azrieli Foundation; European Commission","keywords":"Steiner tree problem; Vertex (graph theory); Upper and lower bounds; Graph; Connectivity; Vertex connectivity; Set (abstract data type); Spanning tree; Terminal (telecommunication)","score_opus":0.014488975413341154,"score_gpt":0.27196938662608927,"score_spread":0.2574804112127481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110127072","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.20303342,0.0005878411,0.7853176,0.00076363474,0.00009304102,0.00016337291,0.0010123659,0.0029763035,0.0060523404],"genre_scores_gemma":[0.68003756,0.00021678797,0.31582364,0.0002057583,0.00006644985,0.00021588223,0.0009828757,0.000205968,0.0022450837],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876934,0.00025130186,0.00008727301,0.00031458534,0.0004057723,0.0001716831],"domain_scores_gemma":[0.99582374,0.0015167317,0.0005589298,0.0016010813,0.00030074394,0.00019880728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006485772,0.00061140413,0.0009184417,0.00076411944,0.0010349551,0.0013068041,0.001521168,0.0012118483,0.002656415],"category_scores_gemma":[0.0049925204,0.0004408632,0.00046172622,0.0011675229,0.0011054445,0.0034477846,0.0020830224,0.0015531841,0.0006632904],"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.0027234457,0.0002788429,0.0021597014,0.00057866186,0.000067153574,0.0003361562,0.00083728053,0.28606725,0.12419504,0.21818532,0.0109387925,0.3536323],"study_design_scores_gemma":[0.00020552128,0.0007468171,0.00080869184,0.00007662621,0.00004773632,0.00039571724,0.00016754701,0.7542213,0.04771314,0.18543854,0.010100039,0.0000783215],"about_ca_topic_score_codex":0.00078207004,"about_ca_topic_score_gemma":0.0010132833,"teacher_disagreement_score":0.002656415,"about_ca_system_score_codex":0.0018139078,"about_ca_system_score_gemma":0.0008325093,"threshold_uncertainty_score":0.013160825},"labels":[],"label_agreement":null},{"id":"W7110184166","doi":"10.4230/lipics.disc.2025.58","title":"Brief Announcement: Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Broadcasting (networking); Node (physics); Gossip; Constant (computer programming); Radio networks; Scheme (mathematics); Asymptotically optimal algorithm; Radio broadcasting","score_opus":0.01384619250655066,"score_gpt":0.27325991403683453,"score_spread":0.25941372153028386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110184166","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.015093679,0.0063281995,0.94717735,0.010043982,0.0045293043,0.00016716095,0.00028956684,0.0010503635,0.015320341],"genre_scores_gemma":[0.31140104,0.015789157,0.6232144,0.003672689,0.011018498,0.0007130589,0.0011467821,0.0008924455,0.032151826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821556,0.0006936538,0.00011143099,0.00031247066,0.0004531982,0.00021385663],"domain_scores_gemma":[0.99248546,0.005157071,0.00043736288,0.00076363544,0.0008514859,0.00030491155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029078491,0.00097400433,0.00083028397,0.0010075715,0.0012787367,0.002227795,0.0016685065,0.0021181027,0.0065227835],"category_scores_gemma":[0.016537558,0.00078924414,0.0010450016,0.0020191667,0.0021523384,0.006543696,0.0014156422,0.0046591684,0.002582955],"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.00052457536,0.000117190546,0.0006845956,0.0008384582,0.000049318955,0.0001273627,0.00049021543,0.033097796,0.010811978,0.7204035,0.05363193,0.17922309],"study_design_scores_gemma":[0.0001764325,0.0007962822,0.00072867895,0.00021693972,0.00013148702,0.00049050857,0.00018345848,0.19719933,0.0119842505,0.56891966,0.2189797,0.00019317152],"about_ca_topic_score_codex":0.0011647309,"about_ca_topic_score_gemma":0.00077892875,"teacher_disagreement_score":0.0065227835,"about_ca_system_score_codex":0.0024029799,"about_ca_system_score_gemma":0.0011180366,"threshold_uncertainty_score":0.021820843},"labels":[],"label_agreement":null},{"id":"W7110198478","doi":"10.4230/lipics.itcs.2025.89","title":"Optimal Communication Complexity of Chained Index","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"University of Waterloo","keywords":"String (physics); Generalization; Upper and lower bounds; Index (typography); Position (finance); Value (mathematics)","score_opus":0.02479467919637605,"score_gpt":0.27863430581502757,"score_spread":0.2538396266186515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110198478","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.4237282,0.0033462197,0.5137674,0.009028798,0.000500482,0.0006805749,0.0053791134,0.0033150094,0.04025427],"genre_scores_gemma":[0.8478982,0.0010211263,0.13087115,0.0010420987,0.00041807207,0.00059150363,0.0041586314,0.0010290742,0.012970142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99322,0.0016716566,0.00036325844,0.0017124645,0.0013389478,0.0016936245],"domain_scores_gemma":[0.96189916,0.028657913,0.0019793415,0.0042642653,0.0014702604,0.0017289942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003920944,0.0020775008,0.003130306,0.0011152299,0.0018904597,0.0045635593,0.006548491,0.0035093396,0.014980351],"category_scores_gemma":[0.030541878,0.0011643564,0.001689499,0.003130553,0.0025256262,0.012722636,0.005503057,0.004454696,0.0020122104],"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.0036682084,0.00089365145,0.0036259806,0.0014004847,0.00022579753,0.0006301598,0.0010752209,0.65426075,0.0067574023,0.1961238,0.034345444,0.096993096],"study_design_scores_gemma":[0.00021625645,0.00014942407,0.00024448137,0.00004631216,0.000039836825,0.00013221698,0.00010201417,0.8124862,0.0018377365,0.18265358,0.0020625764,0.00002932236],"about_ca_topic_score_codex":0.004264499,"about_ca_topic_score_gemma":0.0032374908,"teacher_disagreement_score":0.014980351,"about_ca_system_score_codex":0.0052549215,"about_ca_system_score_gemma":0.0039832424,"threshold_uncertainty_score":0.050114274},"labels":[],"label_agreement":null},{"id":"W7110209134","doi":"10.4230/lipics.approx/random.2025.1","title":"Approximation Schemes for Orienteering and Deadline TSP in Doubling Metrics","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orienteering; Bounded function; Travelling salesman problem; Hamiltonian path; Treewidth; Dimension (graph theory); Path (computing); Graph","score_opus":0.01875167200096725,"score_gpt":0.2838451202113926,"score_spread":0.26509344821042535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110209134","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.15563138,0.006005253,0.8050879,0.00277159,0.0004311172,0.00029018935,0.0014886365,0.0029859939,0.025307925],"genre_scores_gemma":[0.5668187,0.0025493875,0.41483137,0.00088426116,0.000277203,0.00031080627,0.0030671498,0.00053749385,0.010723701],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99727374,0.00063310063,0.00017479777,0.00050366274,0.0008500374,0.0005646885],"domain_scores_gemma":[0.9957229,0.0019097439,0.00034956704,0.0012559482,0.0003742022,0.0003875688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021957073,0.001885909,0.0017293091,0.0013908864,0.0010655985,0.00302661,0.0039441064,0.0017568266,0.0075227506],"category_scores_gemma":[0.011699029,0.00045294387,0.0016735275,0.0031422894,0.0009945296,0.008677852,0.0032217414,0.0029135454,0.0015007914],"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.0015812685,0.00044628474,0.0035850836,0.00092110765,0.00021614469,0.00036237773,0.0008885305,0.35515478,0.007076728,0.30072376,0.025859712,0.3031842],"study_design_scores_gemma":[0.00012558553,0.00022746716,0.00074641354,0.00008190005,0.00009790969,0.00037335022,0.00026177563,0.78314847,0.0021274844,0.19816446,0.014603272,0.000041916508],"about_ca_topic_score_codex":0.0054579363,"about_ca_topic_score_gemma":0.00562431,"teacher_disagreement_score":0.0075227506,"about_ca_system_score_codex":0.003918816,"about_ca_system_score_gemma":0.0019623935,"threshold_uncertainty_score":0.028433084},"labels":[],"label_agreement":null},{"id":"W7110276226","doi":"10.4230/lipics.approx/random.2025.22","title":"Directed Buy-At-Bulk Spanners","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Office of Naval Research; National Science Foundation","keywords":"Sublinear function; Approximation algorithm; Randomized algorithm; Enhanced Data Rates for GSM Evolution; Online algorithm; Terminal (telecommunication); Spanner; Time complexity","score_opus":0.011666012322819446,"score_gpt":0.2558468628575314,"score_spread":0.24418085053471195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110276226","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.045636266,0.00059064775,0.9353905,0.0009334641,0.00015708673,0.000332476,0.0007819359,0.0009852672,0.015192421],"genre_scores_gemma":[0.3915701,0.0006313913,0.5818751,0.000684164,0.00017422829,0.0004977109,0.0020520927,0.0004926847,0.022022579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987764,0.00033457062,0.00006168511,0.00044170945,0.00020721587,0.00017843986],"domain_scores_gemma":[0.9978011,0.0010362775,0.00025833392,0.00051998004,0.00015716937,0.00022709183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013519814,0.0014420424,0.0015504129,0.00061651453,0.00073977455,0.001649996,0.0022991868,0.0018319417,0.017207237],"category_scores_gemma":[0.0047031622,0.000620171,0.0011669903,0.0013660393,0.0009031593,0.0046913936,0.0022704655,0.0021645061,0.0025692706],"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.00074663776,0.00055942236,0.0016087315,0.0007585938,0.00015610577,0.00047432486,0.00037655197,0.41580066,0.010067202,0.3059285,0.021298245,0.24222496],"study_design_scores_gemma":[0.00010137583,0.0002512234,0.00023391774,0.000051105177,0.00003792743,0.00026745573,0.00012459062,0.65760183,0.0050319177,0.32326537,0.013002497,0.000030828433],"about_ca_topic_score_codex":0.0009188219,"about_ca_topic_score_gemma":0.0018019464,"teacher_disagreement_score":0.017207237,"about_ca_system_score_codex":0.0010050117,"about_ca_system_score_gemma":0.00086083956,"threshold_uncertainty_score":0.05756396},"labels":[],"label_agreement":null},{"id":"W7110382014","doi":"10.4230/lipics.itcs.2025.20","title":"Estimating Euclidean Distance to Linearity","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"Bounded function; Estimator; Function (biology); Oracle; Euclidean distance; Linearity; Upper and lower bounds; Euclidean geometry","score_opus":0.01426574667479549,"score_gpt":0.28729682927286787,"score_spread":0.2730310825980724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110382014","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.12674621,0.0022748776,0.86075664,0.0023091247,0.00013721755,0.00010208847,0.0007534807,0.00082366803,0.006096708],"genre_scores_gemma":[0.8394385,0.0009965017,0.1526889,0.00053820125,0.00034018853,0.00026624833,0.0017999285,0.00021879323,0.0037126096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993343,0.0028040814,0.00038837444,0.0015343683,0.0013156278,0.0006145316],"domain_scores_gemma":[0.95393145,0.0359708,0.0020038735,0.004662048,0.0025514446,0.0008803474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054950044,0.0010513464,0.0018229601,0.0014031183,0.00065891247,0.0024831838,0.0027080148,0.0015860881,0.0036369872],"category_scores_gemma":[0.06801004,0.00063161954,0.00095601927,0.0016420215,0.0024471448,0.0066812336,0.004411131,0.0034809075,0.0011710426],"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.0021073967,0.00031541314,0.016899565,0.0007409436,0.00028043985,0.00023071608,0.0005298948,0.57656926,0.007141539,0.21236344,0.0129215745,0.16989975],"study_design_scores_gemma":[0.000038492544,0.00015649422,0.0017743243,0.000055507557,0.00002544289,0.00013705039,0.00009841384,0.87141633,0.003398841,0.12120864,0.0016478852,0.000042673484],"about_ca_topic_score_codex":0.0025530949,"about_ca_topic_score_gemma":0.0017782433,"teacher_disagreement_score":0.0054950044,"about_ca_system_score_codex":0.0025742438,"about_ca_system_score_gemma":0.0014728599,"threshold_uncertainty_score":0.029060662},"labels":[],"label_agreement":null},{"id":"W7110418722","doi":"10.4230/lipics.icalp.2025.10","title":"On the Complexity of Telephone Broadcasting from Cacti to Bounded Pathwidth Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Bounded function; Pathwidth; Vertex (graph theory); Cactus; Simple (philosophy); Indifference graph; Broadcasting (networking); Clique-sum","score_opus":0.038594561658899726,"score_gpt":0.26846180345618703,"score_spread":0.2298672417972873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110418722","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.7252734,0.006223626,0.18375818,0.020547131,0.0003840328,0.0005974857,0.007878377,0.0027122684,0.052625574],"genre_scores_gemma":[0.91733897,0.0033883294,0.059355017,0.0021986705,0.0006004628,0.00050247926,0.0066342605,0.0008210332,0.009160826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974445,0.0006888006,0.00009934685,0.0006161386,0.0005195607,0.000631487],"domain_scores_gemma":[0.9603639,0.03388836,0.0016563849,0.0018120146,0.0011501746,0.0011291385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001774942,0.0015430194,0.0021678065,0.0012504522,0.0023719324,0.004602939,0.0036608814,0.0030578848,0.011803278],"category_scores_gemma":[0.022632191,0.0009013295,0.001776761,0.00281847,0.0028499353,0.009166483,0.0030594158,0.005065972,0.001148284],"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.0022556158,0.0006129069,0.008052481,0.0018869414,0.00027396335,0.00086922763,0.0027805786,0.6122133,0.008171722,0.22425365,0.065456875,0.07317282],"study_design_scores_gemma":[0.00026778443,0.000093130235,0.0020305146,0.0001028148,0.00010833805,0.0004152301,0.00051571603,0.64178514,0.0016972363,0.3474812,0.0054458138,0.000057194553],"about_ca_topic_score_codex":0.01916095,"about_ca_topic_score_gemma":0.013452787,"teacher_disagreement_score":0.01916095,"about_ca_system_score_codex":0.006277361,"about_ca_system_score_gemma":0.0032510816,"threshold_uncertainty_score":0.045545697},"labels":[],"label_agreement":null},{"id":"W7111085514","doi":"10.4230/lipics.fsttcs.2025.40","title":"Improved Upper Bounds on Multiflow-Multicut Gaps in Cactus Graphs","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Upper and lower bounds; Rounding; Graph; Cactus; Set (abstract data type); Path (computing); Graph theory","score_opus":0.010337931241448365,"score_gpt":0.2653205778688018,"score_spread":0.2549826466273534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7111085514","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.3358881,0.016506445,0.5527926,0.004812644,0.00062008144,0.00040687484,0.002370309,0.004319571,0.08228342],"genre_scores_gemma":[0.83723295,0.0030413775,0.14917997,0.0009351081,0.00045665217,0.0003413293,0.001311479,0.0007872079,0.0067140106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964623,0.000585708,0.00012465224,0.0006607121,0.0010507592,0.001115966],"domain_scores_gemma":[0.9866941,0.008810353,0.0009958177,0.0016722133,0.0009240429,0.00090348447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027455704,0.002333589,0.0019917502,0.0031059447,0.0021420605,0.0041728118,0.0042992774,0.0018075334,0.0090368325],"category_scores_gemma":[0.015085985,0.0010091268,0.0013061123,0.0032718065,0.0021178569,0.008606552,0.0054144985,0.004717187,0.0013094455],"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.0015720612,0.00053031923,0.0037177345,0.0013942848,0.00015273252,0.00048777132,0.0008628232,0.4822039,0.014988919,0.3215988,0.024304044,0.14818661],"study_design_scores_gemma":[0.00008420741,0.0002793401,0.0016394521,0.00028785464,0.00009241885,0.0004673857,0.00034645933,0.6715586,0.010992477,0.30094078,0.013221364,0.00008969493],"about_ca_topic_score_codex":0.0026736849,"about_ca_topic_score_gemma":0.0037347388,"teacher_disagreement_score":0.0090368325,"about_ca_system_score_codex":0.0038047943,"about_ca_system_score_gemma":0.0017073131,"threshold_uncertainty_score":0.030231237},"labels":[],"label_agreement":null},{"id":"W7111411162","doi":"10.20382/jocg.v16i2a10","title":"Fine-Grained Complexity of Earth Mover’s Distance Under Translation","year":2025,"lang":"en","type":"article","venue":"Journal of Computational Geometry (Carleton University)","topic":"Complexity and Algorithms in Graphs","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":"Translation (biology); Earth (classical element); Algebra over a field; Context (archaeology)","score_opus":0.0288278873048255,"score_gpt":0.24364669503923286,"score_spread":0.21481880773440737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7111411162","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.698425,0.0014983139,0.1761106,0.0048727375,0.0004252635,0.00009023062,0.0020474482,0.0008282259,0.11570225],"genre_scores_gemma":[0.9665127,0.00045468783,0.016286157,0.0002217485,0.0003054534,0.000053922002,0.0008599497,0.00023970648,0.015065804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885476,0.0001695381,0.00007715178,0.0002698448,0.00039250136,0.00023626062],"domain_scores_gemma":[0.9940102,0.0033829568,0.0005092804,0.0010047315,0.00061011896,0.00048264588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010054642,0.00042528295,0.0010295288,0.002517762,0.0013761865,0.0037253525,0.0014629142,0.0012945007,0.01589355],"category_scores_gemma":[0.009404964,0.00039594172,0.0006799981,0.0018403542,0.002617182,0.0068158777,0.002412967,0.0020516748,0.0018304957],"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.000091330585,0.000025913003,0.0013369647,0.00007725849,0.000013928608,0.00015657226,0.0002606266,0.02236066,0.0009736959,0.95579016,0.0067153824,0.012197653],"study_design_scores_gemma":[0.000012620431,0.000018351064,0.00081291684,0.000011299544,0.000006589564,0.00013635748,0.00007292846,0.043898277,0.00047135592,0.95098877,0.0035547747,0.000015745043],"about_ca_topic_score_codex":0.002735469,"about_ca_topic_score_gemma":0.0018908422,"teacher_disagreement_score":0.01589355,"about_ca_system_score_codex":0.0019438927,"about_ca_system_score_gemma":0.0006459302,"threshold_uncertainty_score":0.05316919},"labels":[],"label_agreement":null},{"id":"W7114820834","doi":"","title":"Direct Product Theorems for Randomized Query Complexity","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Complexity and Algorithms in Graphs","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":"Direct product; Product (mathematics); Bounded function; Boolean function; Function (biology); Measure (data warehouse)","score_opus":0.057718812193491065,"score_gpt":0.29899303075830297,"score_spread":0.2412742185648119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7114820834","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.029019307,0.0018615604,0.9341734,0.002609615,0.00019469805,0.00023658948,0.0008096211,0.0007380671,0.03035719],"genre_scores_gemma":[0.70375204,0.0028181842,0.2666617,0.0025310048,0.001613895,0.0021802362,0.0016142591,0.0012977902,0.017530931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9831871,0.004346432,0.0009267557,0.0043886257,0.005901291,0.0012498741],"domain_scores_gemma":[0.8905296,0.087734096,0.0034432602,0.010600572,0.006055152,0.0016373392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010891072,0.0025620223,0.0026400804,0.0029092582,0.0017071059,0.0072468696,0.005372446,0.0027622748,0.018630374],"category_scores_gemma":[0.06787779,0.0014284451,0.004429579,0.003734036,0.0076361406,0.02737917,0.007995022,0.010437154,0.003439372],"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.00012706942,0.000078442295,0.00069133873,0.0002545176,0.000054005897,0.000092599825,0.00024408022,0.013737995,0.0012041889,0.958026,0.003031793,0.02245793],"study_design_scores_gemma":[0.00005246428,0.000087481705,0.0003125951,0.000034091427,0.000040959607,0.00017332021,0.000032472246,0.11228143,0.0017555952,0.8818829,0.0033056606,0.000041040268],"about_ca_topic_score_codex":0.0017917192,"about_ca_topic_score_gemma":0.001119018,"teacher_disagreement_score":0.018630374,"about_ca_system_score_codex":0.0064762067,"about_ca_system_score_gemma":0.0026027902,"threshold_uncertainty_score":0.062324822},"labels":[],"label_agreement":null},{"id":"W7118052205","doi":"","title":"Thin Tree Verification is coNP-Complete","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Complexity and Algorithms in Graphs","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":"K-ary tree; Interval tree; Tree (set theory); Graph; Segment tree; Gomory–Hu tree; Kruskal's algorithm; Spanning tree","score_opus":0.0661122184933786,"score_gpt":0.2855311649564319,"score_spread":0.21941894646305327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7118052205","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.26136872,0.0014470062,0.64064795,0.018906428,0.0007997974,0.0012408243,0.014851509,0.01260454,0.048133183],"genre_scores_gemma":[0.70326626,0.00090081355,0.2635875,0.0028612155,0.00032436554,0.0007627903,0.014015994,0.0017069546,0.012574098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946445,0.0008634078,0.0003759703,0.001561972,0.0016292187,0.0009250126],"domain_scores_gemma":[0.96050256,0.025783665,0.002111403,0.0072125774,0.003380135,0.0010095984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003007108,0.0013171567,0.0019985437,0.0007816916,0.0031557097,0.0044175247,0.0033205114,0.0024191546,0.014051558],"category_scores_gemma":[0.026144927,0.0017375404,0.0029117854,0.002064127,0.0023793932,0.0114812115,0.004972908,0.0050982363,0.003918455],"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.0034934606,0.001295462,0.016009223,0.0046677147,0.0006761979,0.0028842015,0.0017729086,0.22242534,0.044249512,0.29730305,0.14521843,0.26000446],"study_design_scores_gemma":[0.0002524386,0.00014329,0.0015292262,0.00014732394,0.00014773026,0.0010868609,0.000717645,0.33281845,0.013650656,0.63228524,0.017159306,0.000061838204],"about_ca_topic_score_codex":0.003835244,"about_ca_topic_score_gemma":0.0059447116,"teacher_disagreement_score":0.014051558,"about_ca_system_score_codex":0.0021119758,"about_ca_system_score_gemma":0.0054875407,"threshold_uncertainty_score":0.047007143},"labels":[],"label_agreement":null},{"id":"W7126101570","doi":"10.1109/comcomap68359.2025.11353181","title":"Heuristic-Guided Iterative Compression for Efficient Graph Bipartization","year":2025,"lang":"","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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 Winnipeg","funders":"","keywords":"Scalability; Bipartite graph; Graph; Heuristic; Compression (physics); Iterative method; Comparability graph","score_opus":0.03637757582799904,"score_gpt":0.31744835008705896,"score_spread":0.2810707742590599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7126101570","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.08829546,0.0006689403,0.8996879,0.00048631948,0.0000909257,0.0002788114,0.0003609244,0.0022288614,0.007901924],"genre_scores_gemma":[0.42461333,0.00032307394,0.56995344,0.00025727603,0.00004896353,0.0003816951,0.0012262037,0.00055055565,0.0026455354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994085,0.00016763776,0.000028660354,0.00009985918,0.00018416761,0.00011118285],"domain_scores_gemma":[0.9982298,0.0010569153,0.000114370334,0.00029790404,0.00022578606,0.00007532632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065898756,0.0011168193,0.0010018107,0.0012254034,0.00078247365,0.00091033016,0.0012496922,0.0008477329,0.0041052653],"category_scores_gemma":[0.004006912,0.00043157558,0.0008235313,0.001402545,0.0008487061,0.001481683,0.0014339404,0.0012323463,0.0008773332],"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.00029725913,0.00021842498,0.0018718921,0.0003159877,0.000058450736,0.00033972642,0.00040429784,0.64981115,0.016812442,0.027627664,0.01045471,0.29178795],"study_design_scores_gemma":[0.000038962626,0.0000574465,0.0001821931,0.00002119525,0.000015003018,0.000090340014,0.00011212084,0.97302365,0.004030748,0.02005042,0.0023683594,0.000009679731],"about_ca_topic_score_codex":0.002950222,"about_ca_topic_score_gemma":0.005022684,"teacher_disagreement_score":0.0041052653,"about_ca_system_score_codex":0.00078243896,"about_ca_system_score_gemma":0.0014818587,"threshold_uncertainty_score":0.013733506},"labels":[],"label_agreement":null},{"id":"W7128626216","doi":"10.1109/focs63196.2025.00114","title":"Rank Bounds and PIT for depth-4 circuits with top fan-in 3 and constant bottom fan-in via a non-linear Edelstein-Kelly theorem","year":2025,"lang":"","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Constant (computer programming); Conjecture; Rank (graph theory); Polynomial; Quadratic equation; Degree (music)","score_opus":0.014302633408031493,"score_gpt":0.26011567146059156,"score_spread":0.24581303805256005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128626216","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.40542772,0.002023825,0.49840727,0.0066822856,0.00019055876,0.0003853352,0.0035192894,0.0062597133,0.07710401],"genre_scores_gemma":[0.8729302,0.0005976906,0.10547552,0.00096195773,0.00016491815,0.00020313563,0.0016955605,0.00059127365,0.017379744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676645,0.00043192387,0.00014464257,0.0006956019,0.0011237087,0.00083765446],"domain_scores_gemma":[0.99070376,0.0054130885,0.00088439835,0.0017869002,0.0006507517,0.00056118506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019719782,0.0014885255,0.001345447,0.0013308229,0.0014004828,0.0043071397,0.003596814,0.001418899,0.013138955],"category_scores_gemma":[0.014444262,0.0008044281,0.0015694563,0.0019360238,0.002493406,0.009801627,0.0047775027,0.004523123,0.0023540636],"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.0022210907,0.00049886806,0.008100074,0.0011630832,0.00016227507,0.0004559658,0.0012716915,0.117480904,0.021520453,0.6379669,0.025086649,0.18407214],"study_design_scores_gemma":[0.00023002259,0.00035368907,0.0016321199,0.00010376418,0.00023631183,0.0004086285,0.00025668857,0.34391806,0.024932718,0.6175703,0.010226309,0.00013138782],"about_ca_topic_score_codex":0.0042862375,"about_ca_topic_score_gemma":0.008143232,"teacher_disagreement_score":0.013138955,"about_ca_system_score_codex":0.0047252355,"about_ca_system_score_gemma":0.003764804,"threshold_uncertainty_score":0.043954194},"labels":[],"label_agreement":null},{"id":"W7128633611","doi":"10.1109/focs63196.2025.00038","title":"Direct Product Theorems for Randomized Query Complexity","year":2025,"lang":"","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Direct product; Product (mathematics); Bounded function; Measure (data warehouse); Function (biology); Boolean function","score_opus":0.03415585052121464,"score_gpt":0.2938558317782489,"score_spread":0.2596999812570343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128633611","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.03488996,0.0018539581,0.9317103,0.0027927912,0.00018311648,0.00022379549,0.00085716223,0.0006759202,0.026813082],"genre_scores_gemma":[0.7284162,0.002590282,0.24510601,0.002365282,0.001532577,0.0018819469,0.0015775865,0.0011937901,0.015336254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98406845,0.0042543444,0.00091437245,0.0041003604,0.0054769088,0.0011856299],"domain_scores_gemma":[0.877719,0.098001234,0.0041747843,0.011618003,0.006527376,0.0019595334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010646643,0.0024469644,0.002736873,0.0028474077,0.0017116161,0.007187327,0.0053219344,0.0026720846,0.016071182],"category_scores_gemma":[0.07323436,0.0013218649,0.004294677,0.0038198123,0.0075260405,0.02750391,0.008012805,0.0101389075,0.0030608692],"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.00015902545,0.00009393218,0.00096699735,0.00026223616,0.000059574064,0.000108554166,0.00030001134,0.01608525,0.0014519596,0.95218533,0.0032958745,0.025031248],"study_design_scores_gemma":[0.00005198964,0.00009679746,0.00038194974,0.000034249166,0.0000453204,0.0002063902,0.000034471468,0.119970515,0.0018459469,0.8742264,0.0030613265,0.000044643228],"about_ca_topic_score_codex":0.0017817349,"about_ca_topic_score_gemma":0.0011256079,"teacher_disagreement_score":0.016071182,"about_ca_system_score_codex":0.0064216554,"about_ca_system_score_gemma":0.002717343,"threshold_uncertainty_score":0.056305468},"labels":[],"label_agreement":null},{"id":"W7128638588","doi":"10.1109/focs63196.2025.00014","title":"Almost Tight Additive Guarantees for k-Edge-Connectivity","year":2025,"lang":"","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Multigraph; Vertex connectivity; Enhanced Data Rates for GSM Evolution; Graph; Graph factorization; Connected component; Induced subgraph isomorphism problem; Time complexity; Connectivity","score_opus":0.02057121839299205,"score_gpt":0.282924901054808,"score_spread":0.26235368266181597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128638588","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.16074824,0.004622215,0.7224971,0.01280877,0.0005980401,0.00037373122,0.007299265,0.0059983484,0.08505426],"genre_scores_gemma":[0.7999932,0.0027202305,0.1709497,0.0036350908,0.0009781348,0.0006125608,0.00547016,0.0015689874,0.014071912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951676,0.0010683314,0.00018925109,0.0011122385,0.0013609651,0.0011016476],"domain_scores_gemma":[0.9791531,0.013990737,0.0014222082,0.0032163847,0.0009783086,0.001239377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032000425,0.003974525,0.0031994495,0.0016011419,0.0017582941,0.004609778,0.007975317,0.0035800457,0.015427695],"category_scores_gemma":[0.022816075,0.0014433744,0.0018842553,0.0034949786,0.0025344363,0.013871976,0.0066456725,0.0069248327,0.0034123508],"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.0032557775,0.0011256194,0.002870124,0.0020731245,0.00036168905,0.000655231,0.0006668767,0.48525062,0.0129917255,0.30525982,0.06889875,0.1165906],"study_design_scores_gemma":[0.00027736576,0.00027736614,0.000897166,0.000112033995,0.000115467716,0.00049669505,0.0002017082,0.58620816,0.0030132039,0.399944,0.008408033,0.000048728674],"about_ca_topic_score_codex":0.0019693512,"about_ca_topic_score_gemma":0.004226463,"teacher_disagreement_score":0.015427695,"about_ca_system_score_codex":0.0029144583,"about_ca_system_score_gemma":0.0022158362,"threshold_uncertainty_score":0.051610827},"labels":[],"label_agreement":null},{"id":"W7128645685","doi":"10.1109/focs63196.2025.00040","title":"Distributed Triangle Detection is Hard in Few Rounds","year":2025,"lang":"","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Distributed algorithm; Graph; Upper and lower bounds; Vertex (graph theory); Bandwidth (computing); Distributed database","score_opus":0.026083166142783512,"score_gpt":0.2712957111889411,"score_spread":0.24521254504615758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128645685","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.1516359,0.00084513274,0.8010326,0.012619701,0.00037448693,0.0008239483,0.0019940082,0.002900922,0.02777328],"genre_scores_gemma":[0.8113283,0.00073496986,0.16039085,0.002665277,0.0005940059,0.0010501514,0.0023537008,0.0010455516,0.01983712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9892671,0.0025566504,0.00062355725,0.0036086133,0.0023033808,0.0016406376],"domain_scores_gemma":[0.9066748,0.07255214,0.0046400893,0.010917696,0.0029797591,0.0022355707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005051225,0.0015390943,0.00354943,0.00086175336,0.0031769292,0.005597909,0.006718196,0.003994237,0.010782106],"category_scores_gemma":[0.040054128,0.0017060149,0.002789965,0.0019817972,0.0036713106,0.016890865,0.0064964727,0.00733265,0.002529797],"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.0049828864,0.0009721436,0.0070153684,0.002108126,0.0005682354,0.0015734015,0.0023692388,0.3360285,0.025760397,0.43743175,0.048246063,0.13294381],"study_design_scores_gemma":[0.00037652126,0.0002151492,0.0008659704,0.00006775744,0.00011182613,0.0005448598,0.00043719445,0.49491638,0.0080454685,0.48792484,0.0064288676,0.000065254724],"about_ca_topic_score_codex":0.0021377332,"about_ca_topic_score_gemma":0.0021229128,"teacher_disagreement_score":0.010782106,"about_ca_system_score_codex":0.0030730665,"about_ca_system_score_gemma":0.0028933685,"threshold_uncertainty_score":0.03606969},"labels":[],"label_agreement":null},{"id":"W7128645802","doi":"10.1109/focs63196.2025.00057","title":"Generalized Flow in Nearly-linear Time on Moderately Dense Graphs","year":2025,"lang":"","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Flow (mathematics); Maximum flow problem; Enhanced Data Rates for GSM Evolution; Graph; Point (geometry); Flow network; Control flow graph","score_opus":0.025896086117352765,"score_gpt":0.27222287339320267,"score_spread":0.2463267872758499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128645802","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.09458077,0.00061665906,0.88751125,0.0013483955,0.00013723694,0.0002750969,0.0009371085,0.00478169,0.009811845],"genre_scores_gemma":[0.4570914,0.00035485972,0.5295012,0.0004975187,0.00016380739,0.00048059376,0.0021379932,0.0007873845,0.008985188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998055,0.00058114814,0.00007558829,0.0005165695,0.00039812387,0.00037370756],"domain_scores_gemma":[0.99631315,0.0021954,0.00030400566,0.00072897197,0.00024637286,0.00021215205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016717128,0.0018569458,0.001658902,0.0008035991,0.00097525655,0.0020834396,0.002259841,0.001293017,0.0078993095],"category_scores_gemma":[0.008106549,0.0008703405,0.001115865,0.0015559663,0.0013924185,0.0053248736,0.003210886,0.002178645,0.0015553035],"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.00072936504,0.00021398289,0.0011289287,0.0005123084,0.0001036144,0.00030738738,0.00036973352,0.75632626,0.004600864,0.09924327,0.013419517,0.12304483],"study_design_scores_gemma":[0.00008147018,0.000043471315,0.00012969303,0.000012931036,0.000012154652,0.000052168365,0.000054036365,0.87336266,0.0007198146,0.12384936,0.0016736024,0.000008636456],"about_ca_topic_score_codex":0.007000934,"about_ca_topic_score_gemma":0.014391145,"teacher_disagreement_score":0.0078993095,"about_ca_system_score_codex":0.0018387318,"about_ca_system_score_gemma":0.0018522701,"threshold_uncertainty_score":0.026425838},"labels":[],"label_agreement":null},{"id":"W7128646609","doi":"10.1109/focs63196.2025.00068","title":"Inapproximability of Finding Sparse Vectors in Codes, Subspaces, and Lattices","year":2025,"lang":"","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","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":"Linear subspace; Ball (mathematics); Reduction (mathematics); Subspace topology; Completeness (order theory); Lattice problem; Hardness of approximation; Randomized algorithm; Property testing","score_opus":0.031192959823531412,"score_gpt":0.2880982432880844,"score_spread":0.256905283464553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128646609","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.17685726,0.002091927,0.7762586,0.012998792,0.00033235454,0.00024449886,0.0019640725,0.0017670526,0.027485447],"genre_scores_gemma":[0.75851655,0.0022918826,0.21845427,0.0025643583,0.0011893129,0.0007457504,0.0029070613,0.0010033785,0.01232748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99235016,0.0022579278,0.0003954166,0.0021200306,0.0019773056,0.0008990277],"domain_scores_gemma":[0.9548645,0.035487242,0.0021922286,0.0048994212,0.0015674207,0.0009891237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004070984,0.0020439404,0.0025154182,0.00128029,0.0022206213,0.0061040213,0.003277349,0.0026217438,0.008484778],"category_scores_gemma":[0.03459249,0.0012336676,0.0036985697,0.0022790127,0.005879619,0.012744918,0.006016494,0.011247245,0.0018879422],"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.0009970611,0.00052542234,0.00418897,0.0012522668,0.00022175125,0.00030770645,0.0012370828,0.2253576,0.008551572,0.6543807,0.021288816,0.08169113],"study_design_scores_gemma":[0.00012545023,0.000129049,0.00042330092,0.000070526,0.000053471045,0.00019891682,0.00023178018,0.21288857,0.0061168605,0.77510583,0.004603972,0.000052103187],"about_ca_topic_score_codex":0.0024339582,"about_ca_topic_score_gemma":0.0019238183,"teacher_disagreement_score":0.008484778,"about_ca_system_score_codex":0.0031932918,"about_ca_system_score_gemma":0.00308265,"threshold_uncertainty_score":0.028384447},"labels":[],"label_agreement":null},{"id":"W7132867898","doi":"","title":"K-clique and k-cycle counting in the streaming model","year":2006,"lang":"","type":"dissertation","venue":"TSpace","topic":"Complexity and Algorithms in Graphs","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":"University of Toronto","keywords":"Streaming algorithm; Sketch; Integer (computer science); Pseudorandom number generator; Counting problem; Set (abstract data type); Alpha (finance); Constant (computer programming)","score_opus":0.02405808419401693,"score_gpt":0.3159181598543659,"score_spread":0.29186007566034894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132867898","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.026764018,0.0002954924,0.96376824,0.0009895834,0.00007289932,0.00020799035,0.00041374113,0.0008804694,0.0066075684],"genre_scores_gemma":[0.2267176,0.00053086627,0.7609076,0.00034193537,0.0002361336,0.0004701203,0.0011015893,0.00037983508,0.009314449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985833,0.00034158723,0.00007657534,0.0003991505,0.00042348754,0.0001759226],"domain_scores_gemma":[0.9959067,0.0021398817,0.00031193765,0.0010136868,0.00042912667,0.0001986313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001280171,0.00083049125,0.0008477665,0.0009376451,0.0011799999,0.0018284215,0.0023610697,0.0013291979,0.0065830294],"category_scores_gemma":[0.0069884346,0.00051165937,0.0010752687,0.0021246923,0.001097608,0.0074519343,0.0019410048,0.002202915,0.001284023],"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.00043709055,0.00026318937,0.0017356424,0.00033960782,0.00006493562,0.00014573027,0.00032262265,0.13786483,0.005813181,0.6680462,0.023217574,0.16174944],"study_design_scores_gemma":[0.000053459615,0.0000526875,0.00032904107,0.0000225031,0.000019730982,0.00017886597,0.00006308954,0.6198989,0.004049749,0.36505386,0.010248435,0.000029685345],"about_ca_topic_score_codex":0.0023870957,"about_ca_topic_score_gemma":0.0031978227,"teacher_disagreement_score":0.0065830294,"about_ca_system_score_codex":0.0018506462,"about_ca_system_score_gemma":0.0018953291,"threshold_uncertainty_score":0.022022426},"labels":[],"label_agreement":null},{"id":"W7132914093","doi":"","title":"The Complexity of Composition: New Approaches to Depth and Space","year":2022,"lang":"","type":"dissertation","venue":"TSpace","topic":"Complexity and Algorithms in Graphs","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":"Conjecture; Disjoint sets; Function (biology); Space (punctuation); Communication complexity; Composition (language); Key (lock); Gadget","score_opus":0.1877929628544652,"score_gpt":0.33214893276220087,"score_spread":0.14435596990773567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132914093","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.03676385,0.0030319805,0.921306,0.010514416,0.0004006331,0.0002030331,0.00043182197,0.00097403023,0.026374284],"genre_scores_gemma":[0.46498504,0.003743738,0.50460017,0.0032512436,0.00329682,0.00087313674,0.0006741174,0.0021946668,0.016381133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9871401,0.0028993313,0.0008157356,0.0034116062,0.0041459175,0.0015872198],"domain_scores_gemma":[0.9376437,0.044087593,0.0022448753,0.011817558,0.002223124,0.001983087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008220233,0.002863672,0.0025923538,0.005053797,0.002887392,0.009656576,0.0071326513,0.003827804,0.010549215],"category_scores_gemma":[0.040055208,0.0025774413,0.006604732,0.0052160886,0.016361946,0.056684252,0.01865443,0.023369541,0.001503648],"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.0002318162,0.00012657943,0.0013416768,0.00031400647,0.00007297816,0.00009598847,0.0008651961,0.015639732,0.002563825,0.93272346,0.003534251,0.042490587],"study_design_scores_gemma":[0.000037169877,0.00006330393,0.00038866923,0.00005747071,0.000052741052,0.000102688544,0.00013149444,0.050183658,0.0020017226,0.9399565,0.006976268,0.000048387017],"about_ca_topic_score_codex":0.0032405327,"about_ca_topic_score_gemma":0.0025169344,"teacher_disagreement_score":0.010549215,"about_ca_system_score_codex":0.0073996936,"about_ca_system_score_gemma":0.0026942894,"threshold_uncertainty_score":0.053688765},"labels":[],"label_agreement":null},{"id":"W7133009582","doi":"","title":"Algebraic Methods in Query and Proof Complexity","year":2024,"lang":"","type":"dissertation","venue":"TSpace","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Computational complexity theory; Quantum complexity theory; Unitary state; Time complexity; Algebraic number; Upper and lower bounds; Oracle; Real algebraic geometry; Polynomial hierarchy; Quantum computer","score_opus":0.07664616918694764,"score_gpt":0.43475986434274044,"score_spread":0.35811369515579283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133009582","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.008282982,0.013964329,0.9203517,0.0122852465,0.0008053769,0.00013222295,0.0004898403,0.0004768814,0.0432114],"genre_scores_gemma":[0.3708643,0.021251293,0.5756576,0.0037323246,0.0075898212,0.0010704686,0.0009503895,0.0006312483,0.018252628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9891671,0.004274469,0.0006922777,0.0015734447,0.0037123773,0.0005802324],"domain_scores_gemma":[0.95851,0.033324126,0.0011033806,0.004387194,0.002208952,0.00046644013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008964202,0.0016186668,0.0015787956,0.003304091,0.001890091,0.006819112,0.002808374,0.0021485167,0.009364499],"category_scores_gemma":[0.024915086,0.0010016818,0.0031629782,0.0040989793,0.010856587,0.018678328,0.0046336553,0.012000649,0.001686103],"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.0000074835325,0.000008087586,0.000064316526,0.00009011867,0.000011258653,0.00001232838,0.000070280534,0.0020248452,0.00012524454,0.9897753,0.0012545935,0.0065561356],"study_design_scores_gemma":[0.000010502365,0.000010590631,0.000060966962,0.000026855632,0.0000070310775,0.000023013465,0.000022962298,0.013507925,0.00016464472,0.9791229,0.00703186,0.000010764143],"about_ca_topic_score_codex":0.0021473772,"about_ca_topic_score_gemma":0.0014093267,"teacher_disagreement_score":0.009364499,"about_ca_system_score_codex":0.0057768137,"about_ca_system_score_gemma":0.002734374,"threshold_uncertainty_score":0.047407746},"labels":[],"label_agreement":null},{"id":"W7135374935","doi":"10.4230/lipics.fsttcs.2023.32","title":"Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error","year":2023,"lang":"en","type":"article","venue":"UvA-DARE (University of Amsterdam)","topic":"Complexity and Algorithms in Graphs","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":"QuantERA; Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Multiplicative function; Upper and lower bounds; Protocol (science); Qubit; Communication complexity; Quantum information science; Function (biology); Constant (computer programming); Quantum","score_opus":0.062190032047302106,"score_gpt":0.24650446336122256,"score_spread":0.18431443131392045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7135374935","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.11979582,0.0031070353,0.8180533,0.009598422,0.00033574033,0.0003763597,0.0006445818,0.0014242128,0.04666446],"genre_scores_gemma":[0.8487142,0.002189906,0.12337637,0.0016795454,0.00087184494,0.0015636575,0.00066229317,0.0011218073,0.019820409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9773309,0.006084576,0.00087310263,0.0046027447,0.0067709214,0.0043377476],"domain_scores_gemma":[0.8429674,0.1292243,0.005666657,0.016571695,0.0037270351,0.0018428065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012933803,0.0027654872,0.0032058507,0.0028477057,0.0034367368,0.00745193,0.007714149,0.0056412374,0.014538811],"category_scores_gemma":[0.07641916,0.0018977517,0.00447137,0.0027609132,0.011860322,0.033296525,0.010543856,0.015506319,0.0027197434],"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.001025073,0.0004384555,0.0016217123,0.00059320114,0.00015439677,0.0002917461,0.00059644727,0.1870792,0.007048295,0.76758766,0.0042784475,0.029285286],"study_design_scores_gemma":[0.00010160176,0.00009694242,0.0005919978,0.000079231955,0.00007926174,0.00014256763,0.000109041874,0.43046632,0.0068983263,0.55924886,0.0021020637,0.00008378857],"about_ca_topic_score_codex":0.002758922,"about_ca_topic_score_gemma":0.0021406005,"teacher_disagreement_score":0.014538811,"about_ca_system_score_codex":0.009473311,"about_ca_system_score_gemma":0.005929779,"threshold_uncertainty_score":0.06873399},"labels":[],"label_agreement":null},{"id":"W7145951013","doi":"","title":"Path Cover Problems withLength Cost","year":2022,"lang":"en","type":"article","venue":"Institutional Repositories DataBase (IRDB)","topic":"Complexity and Algorithms in Graphs","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":"Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Path (computing); Longest path problem; Minimum weight; Widest path problem; Induced path; Vertex (graph theory); Cardinality (data modeling); Cover (algebra)","score_opus":0.02366442485002743,"score_gpt":0.2403529839601594,"score_spread":0.21668855911013196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7145951013","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.40504295,0.0074092057,0.47933286,0.030611524,0.00078513916,0.0010994227,0.013342669,0.0023812854,0.05999497],"genre_scores_gemma":[0.73744416,0.0059935027,0.18477578,0.0024145513,0.0016037311,0.0011939087,0.012116864,0.0017827741,0.052674778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99535996,0.0012696356,0.00021940486,0.0008920896,0.0012910066,0.000967905],"domain_scores_gemma":[0.9662318,0.026509726,0.0020117583,0.0026931162,0.000997207,0.0015562847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028356574,0.0027518598,0.0034167045,0.0032953857,0.00394811,0.00694415,0.0061557395,0.0064893262,0.032270614],"category_scores_gemma":[0.022590758,0.002253753,0.0033993917,0.00970855,0.0039479095,0.022706682,0.0065570734,0.0069110934,0.0017620794],"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.0013666524,0.0010800784,0.0042856485,0.0019575076,0.00039410125,0.0006519756,0.0008052733,0.2910865,0.0036785793,0.5272303,0.078910954,0.08855245],"study_design_scores_gemma":[0.00023736212,0.00009348663,0.00074920984,0.00008212126,0.000112417976,0.00031058132,0.00017336197,0.24230409,0.0014211214,0.7480052,0.0064691054,0.00004194432],"about_ca_topic_score_codex":0.0053784424,"about_ca_topic_score_gemma":0.006240682,"teacher_disagreement_score":0.032270614,"about_ca_system_score_codex":0.0077106636,"about_ca_system_score_gemma":0.004002068,"threshold_uncertainty_score":0.10795593},"labels":[],"label_agreement":null},{"id":"W7548172","doi":"10.4086/toc.2010.v006a009","title":"","year":2010,"lang":"en","type":"article","venue":"Theory of Computing","topic":"Complexity and Algorithms in Graphs","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 Calgary; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft; National Science Foundation","keywords":"Communication complexity; Combinatorics; Mathematics; Nondeterministic algorithm; Function (biology); Logarithm; Discrete mathematics; Upper and lower bounds; Binary logarithm","score_opus":0.014675079421145891,"score_gpt":0.2465031238987778,"score_spread":0.2318280444776319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7548172","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.034521315,0.00034423123,0.9306086,0.0062611527,0.00025941437,0.0001644878,0.00020472554,0.0005511955,0.027084956],"genre_scores_gemma":[0.6041505,0.000712117,0.3572952,0.002051259,0.00055985316,0.00043118864,0.0006282029,0.00037467128,0.03379696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972705,0.00074613397,0.0000805359,0.000734265,0.0005831393,0.00058541656],"domain_scores_gemma":[0.99169064,0.004223601,0.0006475391,0.002582764,0.000452398,0.00040314393],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025176168,0.0008678582,0.0009994769,0.0006741973,0.002566863,0.003134274,0.0032206683,0.0030668934,0.009567602],"category_scores_gemma":[0.014990486,0.00045157896,0.0017051721,0.0008748732,0.0028394621,0.012190486,0.0048038536,0.0057632537,0.0019530023],"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.000107569664,0.00012054036,0.00067246245,0.00017680727,0.00003159805,0.00010649616,0.00024332502,0.024401352,0.0020302117,0.9153723,0.010067697,0.046669614],"study_design_scores_gemma":[0.000026213853,0.00006270555,0.00028283868,0.00004268243,0.00002468588,0.00018717724,0.00012604041,0.14746703,0.004560771,0.8301309,0.017059145,0.000029773331],"about_ca_topic_score_codex":0.0012496368,"about_ca_topic_score_gemma":0.0012188223,"teacher_disagreement_score":0.9904324,"about_ca_system_score_codex":0.0023101664,"about_ca_system_score_gemma":0.0020378316,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W792477341","doi":"10.1007/978-3-319-12691-3_45","title":"A Fast Greedy Algorithm for the Critical Node Detection Problem","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","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 Toronto","funders":"","keywords":"Computer science; Greedy algorithm; Cardinality (data modeling); Algorithm; Vertex (graph theory); Pairwise comparison; Computational complexity theory; Node (physics); Benchmark (surveying); Graph; Theoretical computer science; Data mining; Artificial intelligence","score_opus":0.020383153145591346,"score_gpt":0.25655851560882564,"score_spread":0.23617536246323428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W792477341","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.0060416874,0.0005581385,0.9874823,0.00041371371,0.0002481183,0.00030030933,0.00023971674,0.0014701351,0.0032458086],"genre_scores_gemma":[0.069080025,0.00046741197,0.92239857,0.00036768673,0.00025117878,0.00065692246,0.00093729456,0.00040877797,0.0054320707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834216,0.00037242164,0.00009131748,0.0004336573,0.00050279585,0.00025759157],"domain_scores_gemma":[0.9952944,0.0029404194,0.0002102736,0.0005763785,0.00069832127,0.0002802008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019084703,0.0025197517,0.002853949,0.0022809077,0.0017207102,0.0021865177,0.004858056,0.002793816,0.008722234],"category_scores_gemma":[0.008852274,0.0012082078,0.001488702,0.0030813036,0.0013416467,0.0034019093,0.0040150825,0.0032553603,0.0034875332],"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.0010343072,0.00045730357,0.00090981275,0.00065438775,0.00017815708,0.00023937717,0.0002365782,0.23483674,0.009172726,0.054305702,0.0528612,0.6451137],"study_design_scores_gemma":[0.00035378485,0.00013662639,0.00021400567,0.000043812328,0.000073842864,0.00020898423,0.00007506104,0.89616233,0.0023476952,0.09423129,0.006111068,0.00004140444],"about_ca_topic_score_codex":0.0055037173,"about_ca_topic_score_gemma":0.006229452,"teacher_disagreement_score":0.008722234,"about_ca_system_score_codex":0.0018303276,"about_ca_system_score_gemma":0.0043524066,"threshold_uncertainty_score":0.029178798},"labels":[],"label_agreement":null},{"id":"W88251305","doi":"10.5555/2095116.2095168","title":"A little advice can be very helpful","year":2012,"lang":"en","type":"article","venue":"Symposium on Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","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":"York University; University of Toronto","funders":"","keywords":"Logarithm; Advice (programming); Communication complexity; Multiplicative function; Conjecture; Computer science; Set (abstract data type); Protocol (science); Mathematics; Time complexity; Theoretical computer science; Upper and lower bounds; Discrete mathematics","score_opus":0.020448014219507833,"score_gpt":0.26048270278324615,"score_spread":0.2400346885637383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88251305","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.045390103,0.0048340396,0.5089405,0.094053365,0.0039003755,0.00040583717,0.0025094838,0.009562772,0.33040348],"genre_scores_gemma":[0.48300496,0.003789251,0.23287621,0.016815903,0.0016159777,0.00073788303,0.0029433984,0.0036107665,0.25460568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950971,0.0011577134,0.00022544742,0.0013645164,0.0014788778,0.0006763055],"domain_scores_gemma":[0.9752157,0.01431304,0.0010141715,0.0062013925,0.0019687978,0.0012868948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027985491,0.0015737632,0.001415421,0.0009406839,0.003300213,0.0045905528,0.0024984826,0.004861211,0.07356017],"category_scores_gemma":[0.026778776,0.001144977,0.0013585525,0.0013288112,0.0035814065,0.017350078,0.005349311,0.0068036187,0.04001835],"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.0009471826,0.00048721526,0.001873474,0.0008681668,0.000112981485,0.000445378,0.0010454044,0.0053411303,0.013429059,0.5842596,0.16064541,0.23054497],"study_design_scores_gemma":[0.00009917645,0.00018566009,0.00065284705,0.00024519593,0.00007265813,0.00068468734,0.0004684773,0.020306278,0.009333703,0.70044255,0.2674126,0.0000961982],"about_ca_topic_score_codex":0.0011429513,"about_ca_topic_score_gemma":0.0017411436,"teacher_disagreement_score":0.07356017,"about_ca_system_score_codex":0.0019261652,"about_ca_system_score_gemma":0.0017054164,"threshold_uncertainty_score":0.24608332},"labels":[],"label_agreement":null},{"id":"W974563791","doi":"10.1016/j.jda.2015.05.013","title":"On the hardness of full Steiner tree problems","year":2015,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"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":"Steiner tree problem; Combinatorics; k-minimum spanning tree; Mathematics; Gomory–Hu tree; Vertex (graph theory); K-ary tree; Tree (set theory); Time complexity; Approximation algorithm; Discrete mathematics; Bottleneck; Graph; Tree structure; Binary tree; Computer science","score_opus":0.052736863236860866,"score_gpt":0.2655842799530101,"score_spread":0.21284741671614923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W974563791","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.3754695,0.015932668,0.30734208,0.0659053,0.0017380557,0.0003868017,0.0061674393,0.0015950757,0.22546312],"genre_scores_gemma":[0.90221,0.008652661,0.05222139,0.004328086,0.0033897785,0.00041344838,0.004109873,0.00085868896,0.02381608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946004,0.0018407961,0.00024473426,0.00090069906,0.0014000152,0.0010134019],"domain_scores_gemma":[0.9281379,0.063174844,0.0018780321,0.0032276788,0.0015597045,0.002021757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046518636,0.0017862958,0.0039508822,0.003049442,0.0032113346,0.0065631703,0.006129212,0.0041953516,0.022428587],"category_scores_gemma":[0.042590875,0.0020672244,0.0027702646,0.005081838,0.007113402,0.023032328,0.0075194044,0.011291523,0.0019269484],"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.002226375,0.000607095,0.0035907961,0.0014411006,0.0002849317,0.0003969289,0.0012908386,0.13172886,0.0020906273,0.72270316,0.06725062,0.06638872],"study_design_scores_gemma":[0.00018098358,0.000060435104,0.0007554166,0.00009239956,0.000051697913,0.00015315309,0.00026947886,0.07906499,0.00033977555,0.9142644,0.0047368817,0.00003041405],"about_ca_topic_score_codex":0.0034945984,"about_ca_topic_score_gemma":0.0029841708,"teacher_disagreement_score":0.022428587,"about_ca_system_score_codex":0.0036588,"about_ca_system_score_gemma":0.002565617,"threshold_uncertainty_score":0.07503116},"labels":[],"label_agreement":null}]}