{"meta":{"query_hash":"06cf318476e5","filters":{"venue":"Journal of Combinatorial Optimization"},"cohort_total":133,"direct_labels_cover":1,"predictions_cover":133,"exported":133,"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/06cf318476e5","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Combinatorial+Optimization"},"results":[{"id":"W1061820890","doi":"10.1007/s10878-015-9936-0","title":"Lower bounds for positive semidefinite zero forcing and their applications","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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":"University of Regina","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Vertex cover; Positive-definite matrix; Theory of computation; Vertex (graph theory); Zero (linguistics); Discrete mathematics; Graph; Forcing (mathematics); Semidefinite programming; Upper and lower bounds; Algorithm; Mathematical optimization","score_opus":0.019747254604522393,"score_gpt":0.28322497922973683,"score_spread":0.26347772462521446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1061820890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052006723,0.00021941509,0.9972149,0.00042559797,0.0009866639,0.000277026,0.0000032361886,0.000018338784,0.0003347224],"genre_scores_gemma":[0.62132806,0.000051723626,0.37807208,0.00009549541,0.00034962903,0.00003072392,0.000005165243,0.000020561978,0.000046536745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991074,0.00007555647,0.0002948085,0.00013344709,0.00022973935,0.00015905249],"domain_scores_gemma":[0.9979289,0.0003073178,0.00029915944,0.00017329447,0.0011313846,0.00015992881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086930976,0.00009574161,0.00017822049,0.00018199586,0.00013476364,0.00017089493,0.00034627176,0.000057940957,6.981671e-7],"category_scores_gemma":[0.0002435857,0.0000797134,0.00006299618,0.00035722734,0.00006357171,0.0009516778,0.0000899092,0.00013173782,5.790991e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002993879,0.00014301518,0.00005911406,0.000012335404,0.00005122606,0.0000027855904,0.00088845514,0.111242145,0.0002794772,0.8806314,0.00051089027,0.005879752],"study_design_scores_gemma":[0.0022871234,0.0008064778,0.000009858778,0.000032168857,0.000011602039,0.000049812876,0.000068198315,0.14844295,0.0011466536,0.8445807,0.0024290646,0.00013538114],"about_ca_topic_score_codex":6.7505914e-7,"about_ca_topic_score_gemma":5.5844342e-8,"teacher_disagreement_score":0.620808,"about_ca_system_score_codex":0.00008393243,"about_ca_system_score_gemma":0.00015784036,"threshold_uncertainty_score":0.3250618},"labels":[],"label_agreement":null},{"id":"W1492783741","doi":"10.1023/a:1011688823715","title":"Robot Map Verification of a Graph World","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","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":"York University","funders":"","keywords":"Vertex (graph theory); Robot; Traverse; Robotics; Artificial intelligence; Theory of computation; Combinatorics; Computer science; Orientation (vector space); Graph; Automation; Topology (electrical circuits); Mathematics; Algorithm; Geometry; Geography; Engineering; Cartography","score_opus":0.01678363309690364,"score_gpt":0.2575980775032374,"score_spread":0.24081444440633373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492783741","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026700218,0.000095742864,0.9945013,0.0012455413,0.002565607,0.00012919867,3.8609073e-7,0.000026663818,0.0011685853],"genre_scores_gemma":[0.4037691,0.0003841625,0.5951508,0.000090094145,0.00028334447,0.0000035902062,0.0000056972317,0.000016220738,0.00029693285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839467,0.00014233503,0.0006608458,0.00012538809,0.0005287616,0.0001480253],"domain_scores_gemma":[0.99782705,0.00007319906,0.0007457397,0.00025772752,0.0009893078,0.0001069519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067467935,0.00009875642,0.00022934908,0.0005132093,0.000068735506,0.000101193276,0.0005630003,0.00005897051,0.000058939797],"category_scores_gemma":[0.00011475072,0.00009157608,0.00010684404,0.0011637835,0.00003640144,0.0010213441,0.000051541807,0.00015400484,0.000004145059],"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.00006934693,0.00024055212,0.0004347005,0.000013189463,0.000026632557,0.000005807758,0.00021726225,0.8870621,0.0004165726,0.10899921,0.0009763952,0.0015382429],"study_design_scores_gemma":[0.005083735,0.0009574431,0.000784261,0.00017362693,0.00004339272,0.00006812456,0.000044153625,0.93855345,0.003923427,0.039927423,0.01006829,0.00037266698],"about_ca_topic_score_codex":0.0000036853603,"about_ca_topic_score_gemma":3.4016068e-7,"teacher_disagreement_score":0.4035021,"about_ca_system_score_codex":0.000053429823,"about_ca_system_score_gemma":0.00014184965,"threshold_uncertainty_score":0.37343642},"labels":[],"label_agreement":null},{"id":"W1530791066","doi":"10.1023/a:1011453115618","title":"Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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":"Hypergraph; Mathematics; Combinatorics; Satisfiability; Discrete mathematics; Theory of computation; Approximation algorithm; Upper and lower bounds; Heuristic; Algorithm; Mathematical optimization","score_opus":0.02127682984858473,"score_gpt":0.297354183519847,"score_spread":0.27607735367126224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530791066","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013665363,0.00010501017,0.984367,0.00040851603,0.0010274356,0.00030665513,0.0000013069742,0.000026177871,0.000092498536],"genre_scores_gemma":[0.42284498,0.00017816645,0.5765918,0.00004606478,0.0002841296,0.000016535001,0.000004648506,0.00001526052,0.000018389806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987416,0.00012954598,0.00041281385,0.00017505427,0.00035076038,0.00019021986],"domain_scores_gemma":[0.9982784,0.00026785495,0.0003399724,0.0002076428,0.0007926208,0.00011351873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012143599,0.00010273225,0.00021438587,0.00023138532,0.00014974074,0.00013546119,0.0003715739,0.00007563421,0.0000064980754],"category_scores_gemma":[0.00046432618,0.00009268585,0.000082167615,0.00053311145,0.000058611382,0.0012636743,0.00007049081,0.00013468546,4.2087834e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009868774,0.00066433876,0.003206427,0.00007620524,0.00009459782,0.000018013869,0.00055967283,0.291913,0.00091602077,0.6253567,0.00037332939,0.075834826],"study_design_scores_gemma":[0.0021875429,0.00068215927,0.0003059789,0.000010700253,0.000011864739,0.00005131961,0.000025601184,0.51119965,0.00062342675,0.48361725,0.0011629128,0.00012159849],"about_ca_topic_score_codex":0.0000012589593,"about_ca_topic_score_gemma":1.1652363e-7,"teacher_disagreement_score":0.40917963,"about_ca_system_score_codex":0.00006404694,"about_ca_system_score_gemma":0.00007390562,"threshold_uncertainty_score":0.37796193},"labels":[],"label_agreement":null},{"id":"W1537002715","doi":"10.1007/s10878-015-9951-1","title":"Almost separable matrices","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"SARS-CoV-2 detection and testing","field":"Medicine","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 Manitoba","funders":"","keywords":"Separable space; Cardinality (data modeling); Simple (philosophy); Theory of computation; Row; Matrix (chemical analysis); Upper and lower bounds","score_opus":0.03478843338879645,"score_gpt":0.3056192439964332,"score_spread":0.27083081060763675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537002715","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8761363,0.0015059024,0.06226442,0.0010899142,0.021044323,0.00044444573,0.0000013978397,0.00016150266,0.03735181],"genre_scores_gemma":[0.9599284,0.00003112061,0.03794626,0.00037935327,0.0015826938,0.0000012883302,0.000002259945,0.000025185855,0.00010345098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99900013,0.00004560132,0.00038963233,0.00006728802,0.00039181387,0.0001055335],"domain_scores_gemma":[0.9984535,0.00005731199,0.0004025045,0.00008397726,0.0008948836,0.00010784631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049614813,0.00008048227,0.00022902964,0.00018639964,0.00004302301,0.00004045268,0.000059465205,0.000077366814,0.00002334628],"category_scores_gemma":[0.00087772275,0.00006806562,0.00007281756,0.0003644588,0.000016255957,0.00026964134,0.000012909482,0.00017276748,0.000012678132],"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.01505681,0.005450469,0.054942776,0.00048425695,0.0014367924,0.0016946151,0.004751514,0.6600762,0.09798981,0.012305035,0.13087495,0.014936777],"study_design_scores_gemma":[0.062417515,0.010834092,0.00068458094,0.0010751219,0.0014252344,0.00859827,0.0014131936,0.36469463,0.38492566,0.013920114,0.148931,0.001080613],"about_ca_topic_score_codex":0.00000779907,"about_ca_topic_score_gemma":6.806047e-8,"teacher_disagreement_score":0.29538158,"about_ca_system_score_codex":0.00011780563,"about_ca_system_score_gemma":0.0002299428,"threshold_uncertainty_score":0.27756354},"labels":[],"label_agreement":null},{"id":"W1558845130","doi":"10.1023/a:1009841718561","title":"A Heuristic Algorithm for Multiple Sequence Alignment Based on Blocks","year":2001,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Algorithms and Data Compression","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":"IBM (Canada)","funders":"","keywords":"Pairwise comparison; Sequence (biology); Computer science; Similarity (geometry); Theory of computation; Multiple sequence alignment; Process (computing); Algorithm; Theoretical computer science; Mathematics; Sequence alignment; Artificial intelligence; Image (mathematics); Biology","score_opus":0.01824847569133728,"score_gpt":0.26190464464571916,"score_spread":0.24365616895438189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1558845130","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014027202,0.00003271391,0.9950536,0.00038702306,0.0040250616,0.0002227297,0.000008808979,0.000030863015,0.00009890978],"genre_scores_gemma":[0.07654569,0.000042971595,0.92247856,0.00022498544,0.0006353862,0.000011581403,0.000016102238,0.000014606615,0.000030144052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998521,0.000072779505,0.00046426922,0.00019990363,0.00054257584,0.00019951501],"domain_scores_gemma":[0.9983023,0.00030360898,0.00048038765,0.00030082557,0.00047904684,0.00013386461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004891121,0.00014375028,0.00022994286,0.00016722243,0.00015156993,0.00015768658,0.0005823006,0.00007839459,0.000013087776],"category_scores_gemma":[0.0002146006,0.00012073571,0.00011055705,0.00027394653,0.000019244286,0.0005319809,0.000060545808,0.00013025351,0.0000016753759],"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.00015862714,0.0005323441,0.0000703449,0.000007606854,0.00002103187,0.00005367569,0.000059215366,0.93830913,0.00010640324,0.003414142,0.0025376487,0.054729853],"study_design_scores_gemma":[0.002964981,0.00088239746,0.00001561655,0.000074024116,0.000014741114,0.000031755255,0.000004378799,0.9870966,0.00046080112,0.002995417,0.0053231614,0.00013614226],"about_ca_topic_score_codex":0.000004466061,"about_ca_topic_score_gemma":4.9553563e-8,"teacher_disagreement_score":0.07640542,"about_ca_system_score_codex":0.0001283772,"about_ca_system_score_gemma":0.00015153398,"threshold_uncertainty_score":0.49234596},"labels":[],"label_agreement":null},{"id":"W1565289258","doi":"10.1023/a:1014847925683","title":"A Novel Eigenvector Technique for Large Scale Combinatorial Problems in VLSI Layout","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematics","score_opus":0.012512469230286226,"score_gpt":0.2189235804871578,"score_spread":0.20641111125687156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1565289258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016324415,0.0002856099,0.9915534,0.000049559276,0.0045317328,0.0009829742,0.000018767454,0.00015851746,0.0007869524],"genre_scores_gemma":[0.9046152,0.00021604309,0.09388969,0.00002139616,0.0009875926,0.00013691615,0.000012529681,0.000094815645,0.000025797599],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984489,0.00004167154,0.0007630328,0.00013288995,0.00029836685,0.00031510196],"domain_scores_gemma":[0.9991118,0.00007765838,0.0002440058,0.0001548124,0.0003117042,0.000100043304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006799777,0.00021126286,0.00042451377,0.00037515914,0.000059820868,0.0000638744,0.0002511227,0.00028574117,0.00005149354],"category_scores_gemma":[0.00011253121,0.00021297122,0.00014998855,0.0004104615,0.00001694903,0.00044929178,0.000020536836,0.00033168503,0.0000018382574],"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.00022078937,0.0025549983,0.0009657817,0.00049211725,0.00017533648,0.000018025816,0.002168451,0.8906484,0.070491925,0.018216196,0.013242485,0.000805478],"study_design_scores_gemma":[0.016984776,0.001911585,0.00008628922,0.0005945019,0.0001239354,0.00011971711,0.00008826172,0.89196604,0.05851888,0.018260505,0.010311625,0.0010338895],"about_ca_topic_score_codex":0.0000029932828,"about_ca_topic_score_gemma":9.373739e-7,"teacher_disagreement_score":0.9029828,"about_ca_system_score_codex":0.00022696893,"about_ca_system_score_gemma":0.000027762735,"threshold_uncertainty_score":0.8684714},"labels":[],"label_agreement":null},{"id":"W1599901748","doi":"10.1023/a:1009833410742","title":"On Some Polyhedra Covering Problems","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Computational Geometry and Mesh Generation","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":"Memorial University of Newfoundland","funders":"","keywords":"Polyhedron; Combinatorics; Mathematics; Regular polygon; Theory of computation; Translation (biology); Cover (algebra); Dual polyhedron; Simple (philosophy); Geometry; Algorithm; Chemistry","score_opus":0.007005178050143841,"score_gpt":0.21680079423530862,"score_spread":0.2097956161851648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599901748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032650456,0.00015597382,0.9594297,0.0008266603,0.004826564,0.00013279279,6.8243224e-7,0.000045530247,0.0019316478],"genre_scores_gemma":[0.9094789,0.0001692206,0.088679925,0.0004252945,0.0009297747,0.0000027708213,0.000005529814,0.000013948744,0.0002946465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885744,0.00006911373,0.0003835933,0.00011996507,0.0004499882,0.00011988492],"domain_scores_gemma":[0.9992222,0.000089973364,0.00024610406,0.00013486833,0.00022707712,0.00007975314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033653894,0.000094502095,0.00014797114,0.00019033845,0.000100974205,0.00016509976,0.00031260075,0.000053635926,0.000098868084],"category_scores_gemma":[0.00006503646,0.0000871837,0.0000742625,0.00039090798,0.000010328754,0.001222865,0.000020506153,0.0001304794,0.000017883282],"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.000033267544,0.00009648315,0.000003940592,0.0000030964748,0.00001075069,0.000003990419,0.00007602919,0.85475487,0.00008186874,0.13597086,0.00042236058,0.008542513],"study_design_scores_gemma":[0.0024025373,0.0010806064,0.0001263985,0.00007537673,0.000014394836,0.00007283475,0.0000029246119,0.8435091,0.0016438649,0.14561246,0.0052343314,0.00022517295],"about_ca_topic_score_codex":0.0000012042,"about_ca_topic_score_gemma":2.1745297e-8,"teacher_disagreement_score":0.87682843,"about_ca_system_score_codex":0.00007020858,"about_ca_system_score_gemma":0.000107354776,"threshold_uncertainty_score":0.3555248},"labels":[],"label_agreement":null},{"id":"W1603740932","doi":"10.1023/a:1013370208101","title":"3-Partitioning Problems for Maximizing the Minimum Load","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Alberta; McMaster University; University of Waterloo","funders":"","keywords":"Theory of computation; Computer science; Combinatorics; Mathematics; Mathematical optimization; Algorithm; Discrete mathematics","score_opus":0.017086504420512526,"score_gpt":0.21396738456052777,"score_spread":0.19688088014001526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603740932","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012907592,0.001024094,0.9879255,0.0007301759,0.007225921,0.00026769412,0.000002426846,0.00009831295,0.0014351129],"genre_scores_gemma":[0.48479354,0.0007273601,0.51164144,0.00011703154,0.0024054393,0.00003548506,0.000009487317,0.00009524369,0.00017500787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899656,0.000030248479,0.00046705682,0.00006773237,0.00027821574,0.00016020026],"domain_scores_gemma":[0.9989984,0.00012835527,0.00020658154,0.00010428871,0.00050171313,0.000060647577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004265759,0.000111547924,0.00017205422,0.00008115488,0.00014884138,0.000119980854,0.00016034147,0.00008019971,0.00007869593],"category_scores_gemma":[0.00022901161,0.00008810639,0.00010411863,0.00023990264,0.000022294642,0.00029729458,0.000008531394,0.0001614344,0.000004377242],"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.0000111986665,0.000030455769,0.000010596637,0.00001758879,0.000035774905,7.004194e-7,0.00036208547,0.99606496,0.000038726346,0.00075868744,0.0020194508,0.000649801],"study_design_scores_gemma":[0.0014083325,0.00009968458,0.0000035218911,0.00005204383,0.00004376449,0.000020075482,0.00006668931,0.994215,0.00035110855,0.0007090717,0.0029220013,0.000108667366],"about_ca_topic_score_codex":4.2422613e-7,"about_ca_topic_score_gemma":7.296302e-8,"teacher_disagreement_score":0.48350278,"about_ca_system_score_codex":0.00010695104,"about_ca_system_score_gemma":0.00002225497,"threshold_uncertainty_score":0.35928744},"labels":[],"label_agreement":null},{"id":"W1917899534","doi":"10.1007/s10878-015-9947-x","title":"Reconfiguration of dominating sets","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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 Waterloo","funders":"","keywords":"Dominating set; Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Connected dominating set; Graph; Domination analysis; Control reconfiguration; Discrete mathematics; Adjacency list; Computer science","score_opus":0.02884581217723134,"score_gpt":0.30399583347759573,"score_spread":0.27515002130036437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1917899534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077879103,0.0000780013,0.98769766,0.0002606885,0.0025677949,0.00009148865,3.8978757e-7,0.0000135009295,0.0015025942],"genre_scores_gemma":[0.6868042,0.000017377864,0.31300506,0.000011698158,0.00013535048,0.0000010122128,0.0000010523624,0.0000072329303,0.000017053386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853015,0.00020813517,0.0005061911,0.00008766549,0.00055425783,0.00011358394],"domain_scores_gemma":[0.9972365,0.0001527192,0.00072886626,0.00017925768,0.0015916253,0.00011105305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001547856,0.00006976878,0.00019423588,0.00024984707,0.000037436173,0.000055727778,0.00046633644,0.000054948927,0.0000060836123],"category_scores_gemma":[0.0010028018,0.000063160114,0.000059544018,0.0005057614,0.00003286919,0.0012843178,0.000056891946,0.00014371758,0.0000014744998],"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.0002543993,0.00019117579,0.0002167449,0.000018366998,0.00003602986,0.000014706199,0.001332274,0.6529474,0.0014237683,0.3280293,0.0005440103,0.014991797],"study_design_scores_gemma":[0.0051985793,0.0015848797,0.00008433179,0.00011062003,0.000017935166,0.000103168524,0.0001923902,0.57656926,0.026683766,0.38880596,0.0004334279,0.00021567727],"about_ca_topic_score_codex":0.0000012384907,"about_ca_topic_score_gemma":4.7534964e-8,"teacher_disagreement_score":0.67901623,"about_ca_system_score_codex":0.000078941586,"about_ca_system_score_gemma":0.00022149821,"threshold_uncertainty_score":0.25755948},"labels":[],"label_agreement":null},{"id":"W1934623130","doi":"10.1007/s10878-017-0184-3","title":"A characterization of linearizable instances of the quadratic minimum spanning tree problem","year":2017,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Characterization (materials science); Bipartite graph; Minimum spanning tree; Combinatorics; Mathematics; Spanning tree; Discrete mathematics; Quadratic equation; Graph","score_opus":0.01362348622236394,"score_gpt":0.24508003233905526,"score_spread":0.2314565461166913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1934623130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034929425,0.00014804614,0.95155567,0.0004889712,0.0115624275,0.00046128282,0.0000099933695,0.000016546008,0.0008276423],"genre_scores_gemma":[0.86367154,0.00021994954,0.13509476,0.000016032564,0.0007905655,0.0000065779454,0.00001122751,0.00002343263,0.00016591087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763834,0.00028525927,0.0011275802,0.0001862883,0.00062448607,0.00013801444],"domain_scores_gemma":[0.9925323,0.000088531924,0.0056867837,0.0006401516,0.0010007292,0.00005149795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011452439,0.0001938892,0.00060437893,0.00019143688,0.00014129053,0.00020132145,0.0018216694,0.00021855519,0.0000065936742],"category_scores_gemma":[0.00029098592,0.00014302474,0.00024289625,0.0002424886,0.000092288356,0.00074453314,0.0005242896,0.00042328794,2.6122532e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004019471,0.0010369415,0.00082244026,0.0015791534,0.00041984665,0.000013544516,0.0051482012,0.8107003,0.019299546,0.15199922,0.00011542024,0.00846346],"study_design_scores_gemma":[0.0027663226,0.00064070965,0.00053483684,0.003528872,0.0002216285,0.000027274587,0.000041825566,0.8188672,0.050034516,0.12249571,0.00037620906,0.00046488474],"about_ca_topic_score_codex":0.0000057422117,"about_ca_topic_score_gemma":3.0371672e-7,"teacher_disagreement_score":0.82874215,"about_ca_system_score_codex":0.00005084243,"about_ca_system_score_gemma":0.0006199868,"threshold_uncertainty_score":0.58323795},"labels":[],"label_agreement":null},{"id":"W1963695813","doi":"10.1007/s10878-012-9591-7","title":"Algorithms for the minimum diameter terminal Steiner tree problem","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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":"Brock University","funders":"University of Alberta","keywords":"Steiner tree problem; Terminal (telecommunication); Theory of computation; Combinatorics; Mathematics; Computer science; Tree (set theory); Mathematical optimization; Discrete mathematics; Algorithm; Computer network","score_opus":0.010906366297011227,"score_gpt":0.2224046219714752,"score_spread":0.21149825567446398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963695813","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001026027,0.00023271867,0.9948063,0.0002293066,0.0024587966,0.00054365856,0.000002129555,0.00007327763,0.0006277663],"genre_scores_gemma":[0.48551694,0.0003142317,0.5109392,0.00008544885,0.0025929532,0.00017117996,0.000007686416,0.00010057731,0.00027182634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918616,0.000024263292,0.00039758632,0.000058451347,0.00018603374,0.00014750434],"domain_scores_gemma":[0.9992187,0.00015501885,0.00015249905,0.000109009045,0.0003111794,0.000053569554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002595202,0.00011756735,0.00018445191,0.00009359956,0.0000553109,0.00010394442,0.00019491256,0.00009126303,0.000046418656],"category_scores_gemma":[0.000043995216,0.00007761211,0.00011360623,0.00011335906,0.00002094948,0.00039916456,0.000011090678,0.00013950287,0.000002700106],"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.00015190899,0.0003064897,0.00016232941,0.00018936543,0.00048075704,0.000012392674,0.0008534987,0.6229569,0.009330449,0.002688723,0.14463054,0.21823668],"study_design_scores_gemma":[0.0021691595,0.00080695096,0.00010195063,0.00007634549,0.00013642419,0.000053386288,0.000056482066,0.9710824,0.007813041,0.009707447,0.007722992,0.00027345004],"about_ca_topic_score_codex":0.0000023629298,"about_ca_topic_score_gemma":7.598026e-8,"teacher_disagreement_score":0.4844909,"about_ca_system_score_codex":0.00004978506,"about_ca_system_score_gemma":0.000021511061,"threshold_uncertainty_score":0.316493},"labels":[],"label_agreement":null},{"id":"W1964440534","doi":"10.1023/b:joco.0000017385.39168.0d","title":"Exordium for DNA Codes","year":2003,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":45,"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":"Los Alamos National Laboratory; Francis Crick Institute; Alexander von Humboldt-Stiftung; University of California Berkeley; Laboratory Directed Research and Development; U.S. Department of Energy; University of Calgary; National Science Foundation","keywords":"Generalization; Computer science; Sequence (biology); DNA; Code (set theory); Theoretical computer science; Combinatorics; Mathematics; Discrete mathematics; Genetics; Biology; Programming language","score_opus":0.010751031605100343,"score_gpt":0.2501131395328206,"score_spread":0.23936210792772025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964440534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33801088,0.00042372252,0.6544119,0.0001447946,0.004945365,0.0002274273,0.0000035783683,0.000007962456,0.0018243671],"genre_scores_gemma":[0.9641097,0.000048214526,0.035075933,0.00007387558,0.0006160513,0.0000015926993,0.000013258334,0.000008111192,0.000053251006],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994265,0.00006439771,0.00024548112,0.00008099495,0.00008017452,0.000102492115],"domain_scores_gemma":[0.99933577,0.000026976577,0.00022483063,0.00006336443,0.00030323677,0.000045848145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038221525,0.00006899444,0.00012405116,0.000025917732,0.00005493814,0.000022629514,0.00008886426,0.00010033468,0.000009182059],"category_scores_gemma":[0.0005408352,0.000053896165,0.000099787925,0.000053366384,0.000018521278,0.0000045762613,0.000013000412,0.00004595046,3.9749307e-7],"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.0020946392,0.0010441045,0.004616851,0.000074972326,0.00038428,0.000010077403,0.00008167446,0.2952661,0.6199534,0.05717559,0.016279362,0.0030189333],"study_design_scores_gemma":[0.011022223,0.008321178,0.0004243408,0.000068314526,0.00015505127,0.00015026663,0.00013064401,0.006596649,0.70875365,0.017858144,0.24579535,0.0007242156],"about_ca_topic_score_codex":1.1765866e-7,"about_ca_topic_score_gemma":3.1971837e-8,"teacher_disagreement_score":0.6260989,"about_ca_system_score_codex":0.000009653948,"about_ca_system_score_gemma":0.00005526712,"threshold_uncertainty_score":0.21978219},"labels":[],"label_agreement":null},{"id":"W1968583908","doi":"10.1007/s10878-010-9310-1","title":"Convex partitions with 2-edge connected dual graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Dual graph; Discrete mathematics; Line graph; Graph","score_opus":0.00663102312623348,"score_gpt":0.2194565676998637,"score_spread":0.21282554457363023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968583908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053321313,0.00002188534,0.93880564,0.0010906382,0.0060809106,0.00011131816,0.0000014202056,0.00004289437,0.0005239766],"genre_scores_gemma":[0.82336223,0.000008935559,0.17606205,0.0001069462,0.00041676188,0.0000030594015,0.000010458159,0.0000071990203,0.000022360873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989029,0.00007000932,0.00036924813,0.00012849923,0.0004024237,0.0001269145],"domain_scores_gemma":[0.99803156,0.00013210908,0.0004010375,0.00016565251,0.0011135747,0.0001560627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003617865,0.000103324346,0.00017108793,0.00025189258,0.00015153732,0.00017869013,0.00024342899,0.000074924625,0.000048667644],"category_scores_gemma":[0.00023994852,0.00008653193,0.0000618243,0.00072799705,0.000041741365,0.00094148185,0.000031204854,0.0002565794,0.000004107669],"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.00007296516,0.00024862864,0.0002268164,0.0000052263117,0.0000496579,0.00002170464,0.00019883446,0.37118086,0.0020797136,0.6228915,0.0021103444,0.00091378303],"study_design_scores_gemma":[0.010526965,0.0028049287,0.0027210938,0.00007930358,0.00014220196,0.0011431628,0.00005689887,0.71138704,0.0152366385,0.24302416,0.012067478,0.00081011775],"about_ca_topic_score_codex":0.0000013788999,"about_ca_topic_score_gemma":8.8449553e-7,"teacher_disagreement_score":0.7700409,"about_ca_system_score_codex":0.00001933293,"about_ca_system_score_gemma":0.00032280377,"threshold_uncertainty_score":0.35286698},"labels":[],"label_agreement":null},{"id":"W1971099568","doi":"10.1007/s10878-014-9825-y","title":"An improved two-machine flowshop scheduling with intermediate transportation","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Job shop scheduling; Scheduling (production processes); Bin packing problem; Computer science; Theory of computation; Mathematical optimization; Bin; Approximation algorithm; Algorithm; Mathematics; Schedule","score_opus":0.008314866666477752,"score_gpt":0.23253248476679536,"score_spread":0.2242176181003176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971099568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07547784,0.00014844247,0.92001414,0.000041693103,0.003956797,0.00011098411,0.000004494558,0.00013572487,0.00010990481],"genre_scores_gemma":[0.6477708,0.000033331893,0.35158962,0.000019450945,0.00049149856,0.0000023836851,0.000048203183,0.000041689025,0.0000030235208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988342,0.000048721307,0.00051551516,0.00010764043,0.00033595518,0.0001579702],"domain_scores_gemma":[0.99863416,0.000026239599,0.00023511198,0.0001381555,0.0007094003,0.0002569118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004263221,0.00016983911,0.00025964426,0.00020649847,0.000042808824,0.00009417065,0.00016687677,0.00008954787,0.000017241779],"category_scores_gemma":[0.00006716051,0.00014660269,0.00005235843,0.00032742147,0.000023838675,0.0008328895,0.0000027186813,0.00025594083,0.0000016515899],"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.0002089607,0.000069594535,0.00019349661,0.000010120558,0.000045540946,0.000008531451,0.0005604157,0.9979947,0.0001613211,0.00010838222,0.000014780941,0.0006241596],"study_design_scores_gemma":[0.0045401836,0.0005461711,0.000041856845,0.000046084286,0.0000672042,0.000017023798,0.00019887876,0.9932129,0.0009682896,0.00015048511,0.000029382527,0.00018158632],"about_ca_topic_score_codex":0.0000051586803,"about_ca_topic_score_gemma":0.0000021873523,"teacher_disagreement_score":0.572293,"about_ca_system_score_codex":0.00010498875,"about_ca_system_score_gemma":0.000110275,"threshold_uncertainty_score":0.5978284},"labels":[],"label_agreement":null},{"id":"W1976269048","doi":"10.1007/s10878-009-9270-5","title":"Just-in-time scheduling with controllable processing times on parallel machines","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"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; Israel Science Foundation","keywords":"Theory of computation; Computer science; Scheduling (production processes); Parallel computing; Distributed computing; Mathematics; Mathematical optimization; Algorithm","score_opus":0.005926028021514501,"score_gpt":0.22068265834988926,"score_spread":0.21475663032837475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976269048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061154928,0.001524205,0.9237782,0.001159398,0.0031462063,0.0005596566,0.0000027464678,0.00040959392,0.0082651],"genre_scores_gemma":[0.5857547,0.000085870444,0.4134277,0.00011008567,0.0005062301,0.000002238733,0.0000072177054,0.00004024616,0.0000657124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876314,0.00004030597,0.0004938791,0.00010807281,0.00039367971,0.00020089887],"domain_scores_gemma":[0.9992522,0.00005302574,0.00022441136,0.000095071235,0.0002844729,0.00009081308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003372974,0.00018449644,0.0003534929,0.00029352953,0.000066193126,0.00017092488,0.00016501728,0.000109338536,0.000044364817],"category_scores_gemma":[0.00008933593,0.00015249135,0.000052871605,0.00043479586,0.000014997766,0.00042078295,0.0000045103056,0.0002779191,0.000005827008],"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.0002987067,0.000107134874,0.00009196349,0.000010804808,0.000019573306,0.000014165911,0.00009767531,0.9975366,0.000051775965,0.0003333833,0.000056920733,0.0013812842],"study_design_scores_gemma":[0.004171728,0.0004253748,0.000058941874,0.00021595777,0.00003237231,0.000021973221,0.000025322557,0.9941748,0.00018333097,0.00046983527,0.00003779131,0.00018261612],"about_ca_topic_score_codex":6.4760815e-7,"about_ca_topic_score_gemma":5.3988142e-8,"teacher_disagreement_score":0.52459973,"about_ca_system_score_codex":0.00009848461,"about_ca_system_score_gemma":0.00006932995,"threshold_uncertainty_score":0.6218417},"labels":[],"label_agreement":null},{"id":"W1976933290","doi":"10.1007/s10878-008-9164-y","title":"Linear time construction of 5-phylogenetic roots for tree chordal graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; McGill University","funders":"","keywords":"Phylogenetic tree; Combinatorics; Theory of computation; Mathematics; Chordal graph; Tree (set theory); Constructive; Discrete mathematics; Treewidth; Time complexity; Root (linguistics); Graph; Pathwidth; Computer science; Algorithm; Biology; Line graph","score_opus":0.0077324450531980355,"score_gpt":0.22357302615700256,"score_spread":0.21584058110380452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976933290","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7514332,0.00057265535,0.24411066,0.00012548067,0.0028975294,0.00049324706,0.000018319226,0.0000075583757,0.0003413805],"genre_scores_gemma":[0.83466566,0.00047644947,0.16349882,0.000017455697,0.0011028913,0.000007165105,0.000088269364,0.000036534442,0.0001067663],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99912655,0.000046369078,0.00041545954,0.00010664051,0.00019167604,0.00011330739],"domain_scores_gemma":[0.9987313,0.000014575707,0.00046861678,0.00011667951,0.00059823657,0.000070592236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019461593,0.00010185452,0.00020842039,0.00011308593,0.000054578373,0.0000057925536,0.00012425358,0.00012342061,0.00001620264],"category_scores_gemma":[0.00015262076,0.00009951254,0.0001546994,0.00012388307,0.000071648705,0.000008729692,0.000020042025,0.000053920397,6.453083e-7],"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.0018458368,0.00064693973,0.0052796784,0.00007832645,0.0005686902,0.0000074497007,0.00013080244,0.26502156,0.71686906,0.0010206657,0.0033654736,0.0051654987],"study_design_scores_gemma":[0.041716766,0.020555796,0.0069089904,0.00016775758,0.0008589337,0.0011148374,0.00013266619,0.1026712,0.79300547,0.014465338,0.016844274,0.001557951],"about_ca_topic_score_codex":7.2231865e-7,"about_ca_topic_score_gemma":8.594378e-8,"teacher_disagreement_score":0.16235036,"about_ca_system_score_codex":0.00001594965,"about_ca_system_score_gemma":0.00013445325,"threshold_uncertainty_score":0.40580034},"labels":[],"label_agreement":null},{"id":"W1977507713","doi":"10.1007/s10878-007-9106-0","title":"Lower bounds and a tabu search algorithm for the minimum deficiency problem","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Theory of computation; Tabu search; Graph; Graph coloring; Edge coloring; Neighbourhood (mathematics); Discrete mathematics; Algorithm; Graph power; Line graph","score_opus":0.01375133543579926,"score_gpt":0.2907933059047155,"score_spread":0.27704197046891627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977507713","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010878049,0.00046154181,0.9954109,0.000511304,0.0019690131,0.00034713003,9.737748e-7,0.000015214237,0.00019607588],"genre_scores_gemma":[0.123230524,0.00017716459,0.87590384,0.000065602115,0.00049782306,0.0000074421396,8.1200824e-7,0.000019813855,0.00009699572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983963,0.000081684,0.0004218218,0.00016315865,0.0006101715,0.00032688287],"domain_scores_gemma":[0.99765545,0.00081225135,0.00024592748,0.00022074644,0.00094210304,0.00012354043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034740446,0.00010686861,0.00016663896,0.00022941398,0.0003153585,0.00024527093,0.00068100955,0.000070041155,0.00000415566],"category_scores_gemma":[0.00018893875,0.00007456545,0.00008202333,0.00064603717,0.000121482,0.00075377006,0.00013211623,0.00024662606,6.2443064e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065313844,0.0006683498,0.00017885692,0.000050270646,0.000100068726,0.000049106322,0.001859062,0.120255,0.00064007496,0.5657966,0.00076721376,0.30898225],"study_design_scores_gemma":[0.0035990765,0.0019335845,0.00012309251,0.000043057116,0.000027714252,0.00015528168,0.00016293798,0.861908,0.0011458473,0.12791969,0.0027541048,0.00022758146],"about_ca_topic_score_codex":0.0000014956249,"about_ca_topic_score_gemma":1.8023759e-7,"teacher_disagreement_score":0.741653,"about_ca_system_score_codex":0.000071223476,"about_ca_system_score_gemma":0.0001691695,"threshold_uncertainty_score":0.30406907},"labels":[],"label_agreement":null},{"id":"W1978440339","doi":"10.1007/s10878-008-9148-y","title":"A nonlinear optimization methodology for VLSI fixed-outline floorplanning","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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 Guelph; University of Waterloo","funders":"","keywords":"Floorplan; Very-large-scale integration; Mathematical optimization; Nonlinear programming; Sizing; Computer science; Optimization problem; Nonlinear system; Mathematics","score_opus":0.03905878121476061,"score_gpt":0.2762490240574581,"score_spread":0.2371902428426975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978440339","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030991656,0.00026562705,0.9929583,0.00005205987,0.0029986822,0.00023651085,0.0000062117756,0.00016568339,0.00021776576],"genre_scores_gemma":[0.04156905,0.0004775142,0.95664203,0.000033086166,0.0011509313,0.00001140239,0.000035816873,0.00005699383,0.000023186747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987662,0.00009173511,0.0006452203,0.00009933468,0.00020698125,0.00019055155],"domain_scores_gemma":[0.9987901,0.00021954055,0.00027431312,0.00011506944,0.0005169568,0.0000840331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006165267,0.00016393625,0.00039042527,0.00027514508,0.00010407838,0.000026040161,0.00016843168,0.0002039499,0.000024541161],"category_scores_gemma":[0.00037318605,0.00016052242,0.00013741326,0.00024925024,0.000029241713,0.00036702253,0.000013215567,0.0002052443,8.0160464e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010183167,0.000052098112,0.00005523991,0.000025771269,0.000051948045,0.000010235194,0.00018684249,0.995799,0.0007461821,0.00025374678,0.002203915,0.00051315886],"study_design_scores_gemma":[0.0018574805,0.00045994774,0.000008124551,0.000043971424,0.00006416592,0.00016293867,0.000030316149,0.9846958,0.010547998,0.00062014186,0.0013152639,0.00019388551],"about_ca_topic_score_codex":0.0000013894381,"about_ca_topic_score_gemma":5.5137274e-8,"teacher_disagreement_score":0.038469885,"about_ca_system_score_codex":0.000087720604,"about_ca_system_score_gemma":0.00006276011,"threshold_uncertainty_score":0.65459144},"labels":[],"label_agreement":null},{"id":"W1985672280","doi":"10.1007/s10878-006-7120-2","title":"Genome rearrangements with partially ordered chromosomes","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Ottawa","funders":"","keywords":"Genome; Directed acyclic graph; Biology; Genetics; Chromosome; Combinatorics; Whole genome sequencing; Graph; Directed graph; Mathematics; Computational biology; Gene","score_opus":0.004616278146711241,"score_gpt":0.20568677464747243,"score_spread":0.2010704965007612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985672280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8303585,0.0011761979,0.16130342,0.0004102115,0.0025657942,0.0005840251,0.000010554316,0.000023463886,0.0035678158],"genre_scores_gemma":[0.9687466,0.00016956504,0.029057845,0.000026971229,0.001555761,0.0000055142586,0.000111730624,0.00003758936,0.0002883913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896884,0.000055946617,0.0003547191,0.00013576855,0.00031559877,0.0001691555],"domain_scores_gemma":[0.99896306,0.0000050577073,0.00038173035,0.00015496022,0.00043702385,0.00005819586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002170801,0.00013162887,0.00017975397,0.00008277899,0.000059653292,0.000049286326,0.00016389783,0.00008904935,0.000049624323],"category_scores_gemma":[0.000025612691,0.000110961126,0.00006822392,0.0001494995,0.000035000892,0.00001652198,0.00003106766,0.00007155445,0.0000027351214],"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.0010862596,0.00070061366,0.00582018,0.00003619056,0.0003986047,0.00004504457,0.000063814456,0.69782025,0.29158127,0.00047776464,0.0015759361,0.00039408178],"study_design_scores_gemma":[0.10528323,0.035234336,0.08397786,0.00046387909,0.0019872414,0.0011275784,0.0005446505,0.013908318,0.35888016,0.0077106217,0.38572204,0.0051600817],"about_ca_topic_score_codex":0.0000054582706,"about_ca_topic_score_gemma":0.0000017272135,"teacher_disagreement_score":0.6839119,"about_ca_system_score_codex":0.000033497206,"about_ca_system_score_gemma":0.00010897525,"threshold_uncertainty_score":0.45248634},"labels":[],"label_agreement":null},{"id":"W1989900196","doi":"10.1007/s10878-007-9121-1","title":"Standard directed search strategies and their applications","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","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 Regina","funders":"","keywords":"Digraph; Directed acyclic graph; Directed graph; Computer science; Theory of computation; Search problem; Upper and lower bounds; Combinatorics; Theoretical computer science; Mathematics; Discrete mathematics; Algorithm","score_opus":0.01290475218289373,"score_gpt":0.2732350615311445,"score_spread":0.2603303093482508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989900196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061020645,0.0001774306,0.9965518,0.00038943795,0.000544782,0.0001942765,0.0000010296,0.00006401548,0.0014670056],"genre_scores_gemma":[0.53670204,0.00028739075,0.46260166,0.000057146488,0.00029719056,0.0000037276718,0.0000041870057,0.000014556678,0.00003213535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998814,0.00009275909,0.00042177516,0.0001270143,0.0003589408,0.0001855234],"domain_scores_gemma":[0.9982971,0.00016681253,0.00022708726,0.00016354572,0.0009895966,0.00015589196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013505718,0.00009923328,0.0001810269,0.00026039258,0.00015347975,0.0004463598,0.00034947204,0.00007076067,0.000012595154],"category_scores_gemma":[0.00005586694,0.00007971993,0.000043880304,0.00060598954,0.000053114396,0.0013492884,0.00007535719,0.00019518645,9.786986e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015844686,0.00020044274,0.00016260693,0.000030315257,0.000062858075,0.000008970672,0.001916504,0.3636852,0.00054814,0.60472125,0.00031063825,0.028194638],"study_design_scores_gemma":[0.0061534327,0.0016774564,0.0005969231,0.00009783988,0.00002563811,0.0001640842,0.0017053728,0.8865085,0.005752544,0.0841487,0.012574109,0.0005954035],"about_ca_topic_score_codex":0.0000024463875,"about_ca_topic_score_gemma":4.1082123e-7,"teacher_disagreement_score":0.5360918,"about_ca_system_score_codex":0.00006177252,"about_ca_system_score_gemma":0.00026418432,"threshold_uncertainty_score":0.4304258},"labels":[],"label_agreement":null},{"id":"W1996752577","doi":"10.1007/s10878-006-9007-7","title":"Editorial: In memoriam: Yong He (1969–2005)","year":2006,"lang":"en","type":"editorial","venue":"Journal of Combinatorial Optimization","topic":"National Identity and Symbolism","field":"Social Sciences","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":"Theory of computation; Mathematical economics; Philosophy; Computer science; Mathematics; Combinatorics; Algorithm","score_opus":0.007353157911017553,"score_gpt":0.2884633582687355,"score_spread":0.28111020035771794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996752577","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016414118,0.0003263007,0.0008541984,0.0006627659,0.9926199,0.00029258602,0.000029458235,0.00003206366,0.005166337],"genre_scores_gemma":[0.00012605924,0.001331879,0.0017648864,0.000010908104,0.9946529,0.0000068049776,0.00014198103,0.00005390085,0.0019106691],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99213386,0.0008724168,0.0015882245,0.0002920708,0.0045887292,0.0005246945],"domain_scores_gemma":[0.99294937,0.0013188773,0.0020215288,0.00019901086,0.0032867077,0.0002245102],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.005627206,0.00032646456,0.00088304625,0.0009289851,0.00038492447,0.00055646367,0.0008936637,0.002048069,0.00015828636],"category_scores_gemma":[0.007749262,0.00035399947,0.0003320131,0.0007981358,0.00016540274,0.0013310356,0.00006544275,0.001712411,0.000014696472],"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.00013452808,0.00019838261,0.000020106172,0.000022962407,0.0000472074,0.000018178704,0.00059355673,0.024245638,9.727507e-7,0.004750121,0.9699377,0.000030682666],"study_design_scores_gemma":[0.00249167,0.000088552624,0.0000057681737,0.00018703003,0.00011752299,6.95e-7,0.00014657958,0.00009348095,0.0000026173047,0.018742897,0.9777981,0.00032509034],"about_ca_topic_score_codex":0.0023321824,"about_ca_topic_score_gemma":0.00065672956,"teacher_disagreement_score":0.024152158,"about_ca_system_score_codex":0.0016381574,"about_ca_system_score_gemma":0.0037487596,"threshold_uncertainty_score":0.9998912},"labels":[],"label_agreement":null},{"id":"W1998169461","doi":"10.1007/s10878-008-9160-2","title":"On broadcasting in unicyclic graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Computer science; Graph; Vertex (graph theory); Combinatorics; Time complexity; Broadcasting (networking); Connectivity; Theory of computation; Discrete mathematics; Mathematics; Theoretical computer science; Algorithm; Computer network","score_opus":0.015147910409883919,"score_gpt":0.22888807424789512,"score_spread":0.2137401638380112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998169461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05148584,0.00006290989,0.93512034,0.00025048232,0.010446948,0.00008629166,9.8449775e-8,0.000023995332,0.0025230714],"genre_scores_gemma":[0.9861191,0.00004063374,0.013457096,0.000089900415,0.0002575666,8.9119345e-7,2.6430715e-7,0.000006003168,0.000028549086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988607,0.00013655153,0.0004931575,0.00009732887,0.000289866,0.00012236295],"domain_scores_gemma":[0.9990552,0.00013220406,0.000386939,0.00013067691,0.00022647541,0.00006849746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045893775,0.00007765767,0.00018578646,0.0003098079,0.00008304159,0.0000507159,0.00030464403,0.000064492975,0.000006820141],"category_scores_gemma":[0.00019352442,0.000068268375,0.00007599059,0.00053326046,0.00001338544,0.0004978493,0.000026270074,0.00019769094,0.0000025725224],"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.000029055009,0.00010757407,0.00036304505,0.0000021372105,0.000008736005,0.000058773232,0.00036099183,0.8340936,0.000015542491,0.16289936,0.0012512074,0.00080999284],"study_design_scores_gemma":[0.0022187305,0.00062809815,0.00025344192,0.00013881076,0.0000031039103,0.00035588728,0.00001963631,0.97387975,0.00010395741,0.021834282,0.0004222223,0.00014207845],"about_ca_topic_score_codex":0.0000066351504,"about_ca_topic_score_gemma":2.6268907e-7,"teacher_disagreement_score":0.93463326,"about_ca_system_score_codex":0.00007831062,"about_ca_system_score_gemma":0.00008135652,"threshold_uncertainty_score":0.27839038},"labels":[],"label_agreement":null},{"id":"W2000364035","doi":"10.1007/s10878-009-9258-1","title":"Galaxy cutsets in graphs","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"HIV Research and Treatment","field":"Immunology and Microbiology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Theory of computation; Tree (set theory); Graph; Discrete mathematics; Algorithm","score_opus":0.008167575881669966,"score_gpt":0.25677174567623134,"score_spread":0.24860416979456137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000364035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9205205,0.010451665,0.018123966,0.009216267,0.02127825,0.0013342184,0.00003258703,0.00010269381,0.018939877],"genre_scores_gemma":[0.9983245,0.00021393313,0.0012740212,0.000038205795,0.00004224898,9.240005e-7,0.00002299121,0.0000040823998,0.00007906743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925834,0.00013284384,0.00031092213,0.00006591327,0.000061874416,0.00017013052],"domain_scores_gemma":[0.99952793,0.000046537,0.00016290646,0.000073661504,0.00015138475,0.000037589325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026944262,0.00007354321,0.00018691043,0.0002387062,0.000042954034,0.000014092878,0.000108126864,0.00010476056,0.00017627816],"category_scores_gemma":[0.00018066977,0.000059374088,0.000067212604,0.00020175726,0.00002609629,0.00016013601,0.000007832367,0.00020988524,0.000042238917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01772924,0.017415674,0.094231024,0.000074414274,0.0018845376,0.001770767,0.0053180824,0.25418144,0.116325766,0.21264543,0.16675398,0.111669645],"study_design_scores_gemma":[0.190493,0.0420371,0.20447232,0.0010252513,0.0005293408,0.0024552944,0.00073613087,0.0015072179,0.09488497,0.39465317,0.06494047,0.0022657213],"about_ca_topic_score_codex":0.000004803501,"about_ca_topic_score_gemma":3.011308e-7,"teacher_disagreement_score":0.25267422,"about_ca_system_score_codex":0.000066802604,"about_ca_system_score_gemma":0.00010933308,"threshold_uncertainty_score":0.2421205},"labels":[],"label_agreement":null},{"id":"W2002849997","doi":"10.1007/s10878-015-9880-z","title":"An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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":"Beijing University of Technology; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Rounding; Semidefinite programming; Randomized rounding; Univariate; Approximation algorithm; Maximum cut; Theory of computation; Linear programming; Bivariate analysis; Mathematics; Partition (number theory); Semidefinite embedding; Mathematical optimization; Algorithm; Graph partition; Graph; Computer science; Discrete mathematics; Combinatorics; Quadratically constrained quadratic program; Quadratic programming","score_opus":0.04340661387300668,"score_gpt":0.28112499689139314,"score_spread":0.23771838301838646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002849997","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074291765,0.0001398813,0.99673676,0.000026442905,0.001583874,0.00053046405,0.000003220722,0.00014530095,0.00009111175],"genre_scores_gemma":[0.15474495,0.00003353388,0.844399,0.0000113467195,0.0007212977,0.000021417043,0.00002247387,0.000043600576,0.0000023684015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886304,0.00005923603,0.0004964704,0.00008465983,0.00030596947,0.00019064818],"domain_scores_gemma":[0.99888366,0.00008133126,0.00030662795,0.00012474973,0.00050666556,0.00009694426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010147801,0.00014346102,0.00023616779,0.00013402039,0.00012254085,0.00020744157,0.00019825889,0.00010428252,0.000002659618],"category_scores_gemma":[0.00005722478,0.0001145304,0.000075137155,0.00023518392,0.00002116599,0.000759688,0.000011254777,0.00016275838,2.6745826e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031506843,0.00005139133,0.000028881363,0.000030258812,0.000046825822,0.000001314262,0.0003300216,0.9644042,0.0014216438,0.0011314397,0.00032252268,0.032199983],"study_design_scores_gemma":[0.0011568302,0.0002916508,0.000004597237,0.0000573363,0.0000681361,0.000034317283,0.00014544518,0.9919748,0.0012007502,0.0037254747,0.0012003748,0.00014034384],"about_ca_topic_score_codex":0.0000040872264,"about_ca_topic_score_gemma":1.03110914e-7,"teacher_disagreement_score":0.15400204,"about_ca_system_score_codex":0.00023808955,"about_ca_system_score_gemma":0.00006351552,"threshold_uncertainty_score":0.46704143},"labels":[],"label_agreement":null},{"id":"W2007520294","doi":"10.1007/s10878-008-9194-5","title":"Periodic complementary binary sequences and Combinatorial Optimization algorithms","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Coding theory and cryptography","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":"Wilfrid Laurier University","funders":"","keywords":"Formalism (music); Autocorrelation; Combinatorial optimization; Theory of computation; Algorithm; Binary number; Mathematics; Optimization problem; Computer science; Theoretical computer science","score_opus":0.01615915097400654,"score_gpt":0.2401402947344964,"score_spread":0.2239811437604899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007520294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024421992,0.0005542338,0.96290886,0.00072502013,0.010640633,0.00024009192,0.0000038428557,0.00009558118,0.00040976005],"genre_scores_gemma":[0.658083,0.0007167142,0.34023413,0.00013167544,0.0007870735,0.000004670954,0.000013707297,0.000020558933,0.000008444444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788237,0.00029262865,0.0006932239,0.00026073426,0.0006228711,0.0002481731],"domain_scores_gemma":[0.99824905,0.00015900095,0.0006427518,0.00025240378,0.0005133608,0.00018345588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075814535,0.00022010405,0.0003772433,0.0004038619,0.0005321428,0.00019494722,0.00063833216,0.000113961665,0.00005247808],"category_scores_gemma":[0.00008818183,0.000208394,0.00013894068,0.0007385272,0.00019234707,0.0016425094,0.00016993357,0.00026039337,0.0000013601882],"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.00039617007,0.0006481174,0.0024191898,0.00003504055,0.00017013239,0.00020338902,0.0024567721,0.82265747,0.00020545197,0.1667306,0.001931213,0.0021464566],"study_design_scores_gemma":[0.009146118,0.0032594174,0.00064566365,0.00014369728,0.00011310563,0.0010837249,0.00022788685,0.9264815,0.0006036775,0.05522406,0.0022999865,0.0007712044],"about_ca_topic_score_codex":0.0000089679415,"about_ca_topic_score_gemma":6.676575e-8,"teacher_disagreement_score":0.63366103,"about_ca_system_score_codex":0.000077565586,"about_ca_system_score_gemma":0.00020255076,"threshold_uncertainty_score":0.8498061},"labels":[],"label_agreement":null},{"id":"W2010884279","doi":"10.1007/s10878-013-9656-2","title":"A 0.5358-approximation for Bandpass-2","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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 Alberta","funders":"Alberta Innovates - Technology Futures","keywords":"Partition (number theory); Theory of computation; Mathematics; Matching (statistics); Travelling salesman problem; Combinatorics; Approximation algorithm; Band-pass filter; Partition problem; Bipartite graph; Discrete mathematics; Algorithm; Graph; Physics; Optics","score_opus":0.013518144185773052,"score_gpt":0.27259833383196913,"score_spread":0.25908018964619606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010884279","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011890403,0.000043210886,0.9951225,0.000979535,0.0019472621,0.0003822846,4.535879e-7,0.000025662175,0.0003100668],"genre_scores_gemma":[0.19642168,0.00002543202,0.80299807,0.000058763628,0.0003800376,0.000034508994,0.0000025381162,0.000014463133,0.00006449731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988215,0.000093096154,0.0004048166,0.00011673702,0.00038352588,0.00018031104],"domain_scores_gemma":[0.99775517,0.00022304908,0.00041244595,0.0001990075,0.001311354,0.00009894671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006408696,0.000087904,0.00017815141,0.00022829948,0.00009992429,0.00021348524,0.000549126,0.00006353701,0.000024553798],"category_scores_gemma":[0.00042427218,0.000075706695,0.00010023155,0.0003938568,0.000026005879,0.0021081932,0.000054525706,0.00012536939,0.000006683439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008999169,0.00017859093,0.00005284981,0.000024581712,0.000036911213,0.0000016913388,0.00024740314,0.17532286,0.0012339513,0.809953,0.0023351987,0.0105230035],"study_design_scores_gemma":[0.0017741972,0.00045299123,0.00004871697,0.000019994586,0.0000066974203,0.000015221343,0.000015753283,0.4934157,0.0021973618,0.50133586,0.0006177315,0.00009977831],"about_ca_topic_score_codex":0.0000010902459,"about_ca_topic_score_gemma":2.3413651e-8,"teacher_disagreement_score":0.31809285,"about_ca_system_score_codex":0.00007090045,"about_ca_system_score_gemma":0.00012539575,"threshold_uncertainty_score":0.30872294},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024804154,0.0003987211,0.9591489,0.0013853739,0.008889867,0.0001882425,0.0000026371351,0.00013558794,0.0050465427],"genre_scores_gemma":[0.6870133,0.00033877368,0.31065255,0.00032847867,0.0013262011,0.000003032405,0.000006379056,0.000027710597,0.00030358063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984673,0.00013891228,0.0005495595,0.00016055841,0.00047550764,0.00020811646],"domain_scores_gemma":[0.99869007,0.00011225578,0.00032558237,0.0002871855,0.0004480201,0.00013689257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040556054,0.00014284832,0.00027011434,0.00026433906,0.00014587535,0.00021058673,0.0007732587,0.00009152209,0.00033080854],"category_scores_gemma":[0.00007400622,0.00012919598,0.00016677617,0.0009063779,0.00005176506,0.0010367539,0.000048672468,0.0002334727,0.000011461923],"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.00036868895,0.0011449151,0.00042361012,0.000026296999,0.00022339787,0.00014169906,0.0012016307,0.3315854,0.00032984465,0.57555497,0.0067519154,0.0822476],"study_design_scores_gemma":[0.009904099,0.0020643792,0.0013908544,0.00017280784,0.00009294331,0.0004865779,0.00004468701,0.78544927,0.0023577418,0.16464098,0.03248083,0.00091483543],"about_ca_topic_score_codex":0.000006532092,"about_ca_topic_score_gemma":1.930145e-7,"teacher_disagreement_score":0.66220915,"about_ca_system_score_codex":0.000042382282,"about_ca_system_score_gemma":0.000111014764,"threshold_uncertainty_score":0.5268459},"labels":[],"label_agreement":null},{"id":"W2013280510","doi":"10.1007/s10878-015-9871-0","title":"New analysis and computational study for the planar connected dominating set problem","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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":"Combinatorics; Planar graph; Mathematics; Matrix multiplication; Planar; Matrix (chemical analysis); Discrete mathematics; Algorithm; Graph; Computer science; Physics","score_opus":0.028811646897640365,"score_gpt":0.31579021679778535,"score_spread":0.286978569900145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013280510","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00377963,0.00008072675,0.9945837,0.0006085903,0.00048709317,0.0004189809,0.0000016605785,0.000015133617,0.00002445779],"genre_scores_gemma":[0.4652695,0.0000044692597,0.53450745,0.00002076129,0.00016255294,0.0000061251653,0.0000037381121,0.000007215885,0.000018159364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985419,0.00021991265,0.00040545454,0.0001426508,0.00055361586,0.00013646118],"domain_scores_gemma":[0.99708897,0.0010353383,0.00044728108,0.00015020496,0.0011314639,0.00014675396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018159617,0.00009314005,0.00023837238,0.0003220646,0.00016683507,0.00022316072,0.00047020084,0.00003495624,0.0000024557735],"category_scores_gemma":[0.0005322246,0.000066298155,0.000072709045,0.0011439514,0.000028406155,0.0006034346,0.000070656795,0.00013875337,2.558124e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001784939,0.000077356955,0.0012979379,0.000002850893,0.00032565638,0.0000035084831,0.0015106384,0.94695127,0.0000035257015,0.04743647,0.00034586634,0.0018664394],"study_design_scores_gemma":[0.0043224716,0.00089973095,0.0005696743,0.0000070535402,0.00017636345,0.0000160149,0.0004203986,0.8467325,0.000019011091,0.14666808,0.00007890155,0.00008980202],"about_ca_topic_score_codex":0.000009241652,"about_ca_topic_score_gemma":0.0000014368551,"teacher_disagreement_score":0.4614899,"about_ca_system_score_codex":0.0000579031,"about_ca_system_score_gemma":0.00023678434,"threshold_uncertainty_score":0.27035603},"labels":[],"label_agreement":null},{"id":"W2014621567","doi":"10.1007/s10878-008-9167-8","title":"Editorial, COCOON 2007 special issue","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Biotechnology and Related Fields","field":"Medicine","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":"Theory of computation; Mathematical economics; Computer science; Mathematics; Calculus (dental); Algorithm","score_opus":0.006779990404217673,"score_gpt":0.23784467389342925,"score_spread":0.23106468348921158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014621567","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071031814,0.0006230931,0.0112264855,0.010474767,0.95131177,0.00036880746,0.0000012365075,0.000081838196,0.018808836],"genre_scores_gemma":[0.032087896,0.004998812,0.01458133,0.00039208613,0.94660586,0.0000015967214,0.000010949534,0.000036790934,0.0012846651],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989167,0.00003522508,0.00044334843,0.00008426882,0.00038247724,0.00013802004],"domain_scores_gemma":[0.9986512,0.00003988387,0.00033362146,0.000118589334,0.0007490704,0.00010761311],"candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00024176571,0.00010255852,0.00031565814,0.00018317116,0.000112913134,0.000007901997,0.00009371719,0.0018414347,0.0006219637],"category_scores_gemma":[0.0003835299,0.00008336294,0.00010061739,0.0003007003,0.00010276548,0.00015471717,0.000016774562,0.0015917346,0.000032303033],"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.0009471059,0.00030418835,0.0002918453,0.0000123081145,0.000097303884,0.000108809756,0.000115936244,0.003793611,0.00017461638,0.0016118768,0.992331,0.00021136644],"study_design_scores_gemma":[0.0068089496,0.0015936781,0.00018054146,0.00011119566,0.00017737653,0.0009711221,0.00004131699,0.0006521549,0.0023617344,0.0005025484,0.9864578,0.00014153127],"about_ca_topic_score_codex":0.0000019054451,"about_ca_topic_score_gemma":2.3735259e-8,"teacher_disagreement_score":0.024984717,"about_ca_system_score_codex":0.00006990178,"about_ca_system_score_gemma":0.00024758658,"threshold_uncertainty_score":0.9994544},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069042575,0.00020620436,0.9887932,0.0015624906,0.0019911348,0.0002263061,0.00000282871,0.000033213924,0.00028038467],"genre_scores_gemma":[0.3665302,0.00017033963,0.63232064,0.00014582352,0.000673886,0.00001690702,0.0000064198925,0.000022296033,0.00011345652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988772,0.0000765411,0.00044621193,0.00020009668,0.00022912618,0.0001708002],"domain_scores_gemma":[0.9986448,0.00022899109,0.0004167121,0.0001953996,0.00038171504,0.00013237665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000605082,0.00014513532,0.00027740543,0.00023885895,0.00027242093,0.00022837606,0.0003072283,0.00008995254,0.000004718462],"category_scores_gemma":[0.0002099506,0.00012663443,0.000093938026,0.0002724387,0.000058735015,0.00070736127,0.0001297198,0.00011587069,2.1283536e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022237569,0.00038645894,0.00043508242,0.00011507951,0.00014958384,0.0000029390992,0.0011808459,0.017344777,0.0026815063,0.95344865,0.0010701023,0.022962617],"study_design_scores_gemma":[0.003081369,0.0006928836,0.00025972378,0.000036243146,0.0000390285,0.00005424761,0.000013376819,0.9161119,0.0006760479,0.07304461,0.00579131,0.00019925444],"about_ca_topic_score_codex":0.0000026438852,"about_ca_topic_score_gemma":0.0000021144413,"teacher_disagreement_score":0.8987671,"about_ca_system_score_codex":0.00002943093,"about_ca_system_score_gemma":0.00003509464,"threshold_uncertainty_score":0.5164003},"labels":[],"label_agreement":null},{"id":"W2014859375","doi":"10.1023/b:joco.0000031419.12290.2b","title":"A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Sorting; Combinatorics; Approximation algorithm; Theory of computation; Mathematics; Graph; Decomposition; Discrete mathematics; Breakpoint; Computer science; Algorithm","score_opus":0.005139858459938569,"score_gpt":0.23965066921381553,"score_spread":0.23451081075387697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014859375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014434356,0.00014806168,0.98322874,0.00023473872,0.001507598,0.0003815266,0.0000073355445,0.000007253661,0.0000503579],"genre_scores_gemma":[0.19815774,0.00016213239,0.79980177,0.00006835442,0.0014944203,0.000029043487,0.00021900954,0.00004536086,0.000022178605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99914956,0.00003451471,0.00037912323,0.00013266933,0.0001643003,0.00013981048],"domain_scores_gemma":[0.99884737,0.00000774399,0.00041477854,0.000116406256,0.0005482338,0.00006548374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032610033,0.00012031323,0.00015903909,0.000109789544,0.00006207649,0.0000442356,0.0001195798,0.00012809175,0.000006307992],"category_scores_gemma":[0.000043368804,0.00011528435,0.00015637034,0.00011223938,0.000021682852,0.00002314517,0.000020506948,0.00006513204,7.931768e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010095278,0.0012451892,0.00004726827,0.00007466883,0.0005383549,0.0000045577017,0.00044410117,0.51452893,0.4395247,0.0016106612,0.00046191877,0.040510137],"study_design_scores_gemma":[0.063746944,0.014463265,0.0003408737,0.00023223861,0.0006957418,0.0004095804,0.00048378544,0.2222212,0.62201923,0.067736894,0.006036867,0.0016133934],"about_ca_topic_score_codex":0.0000028552479,"about_ca_topic_score_gemma":2.535376e-7,"teacher_disagreement_score":0.2923077,"about_ca_system_score_codex":0.000063512336,"about_ca_system_score_gemma":0.000105992476,"threshold_uncertainty_score":0.47011593},"labels":[],"label_agreement":null},{"id":"W2017143580","doi":"10.1007/s10878-011-9386-2","title":"Some results on the injective chromatic number of graphs","year":2011,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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":"Université de Montréal","funders":"","keywords":"Injective function; Combinatorics; Mathematics; Chromatic scale; Graph; Vertex (graph theory); Monomorphism; Edge coloring; Brooks' theorem; Discrete mathematics; Graph power; Line graph","score_opus":0.025532179805133403,"score_gpt":0.2815818603931285,"score_spread":0.2560496805879951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017143580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12492523,0.00015698184,0.84592295,0.0017016438,0.0108143445,0.0009414557,0.0000081838825,0.000084229156,0.015444976],"genre_scores_gemma":[0.94688666,0.000051403804,0.052834924,0.00005881578,0.00013451619,0.000003051397,4.3112837e-7,0.000010915955,0.000019307116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982506,0.0003447573,0.0005373255,0.000120750345,0.0005933347,0.000153247],"domain_scores_gemma":[0.997693,0.00045864814,0.00075973244,0.00036552417,0.0006393985,0.00008370196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012705516,0.000101838596,0.00021219083,0.00019887196,0.00009064655,0.00003485965,0.0008651792,0.000058193542,0.000018018509],"category_scores_gemma":[0.0010452828,0.00006719391,0.00011362801,0.00068066607,0.00010322052,0.00082590256,0.0000912156,0.000256807,0.0000060700227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037998732,0.00021784386,0.00006134139,0.000005718979,0.00004557848,0.0000072963653,0.0013765317,0.010249707,0.00007593691,0.98706007,0.00028766625,0.0002323471],"study_design_scores_gemma":[0.0014720117,0.00080778974,0.0002564678,0.00007459145,0.000011112248,0.00002613713,0.000061756575,0.0120138265,0.0060204696,0.9791456,0.000020488422,0.00008977052],"about_ca_topic_score_codex":0.0000032857868,"about_ca_topic_score_gemma":4.0935973e-8,"teacher_disagreement_score":0.8219614,"about_ca_system_score_codex":0.000050362763,"about_ca_system_score_gemma":0.0001286079,"threshold_uncertainty_score":0.2740088},"labels":[],"label_agreement":null},{"id":"W2017999844","doi":"10.1007/s10878-013-9613-0","title":"Algorithms for local similarity between forests","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University","funders":"","keywords":"Prime (order theory); Similarity (geometry); Combinatorics; Tree (set theory); Theory of computation; Mathematics; Order (exchange); Computer science; Algorithm; Artificial intelligence; Image (mathematics)","score_opus":0.014081223842914834,"score_gpt":0.2582894242161091,"score_spread":0.2442082003731943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017999844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027418537,0.00011100216,0.9705572,0.00024070707,0.0012632015,0.0003117239,0.0000052249015,0.000004109172,0.00008826263],"genre_scores_gemma":[0.9171801,0.000041011273,0.081043094,0.000051847746,0.0015650758,0.000018225004,0.00003329638,0.000021988593,0.000045318036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99918896,0.000059855887,0.00033921655,0.00010609542,0.00016642947,0.00013946873],"domain_scores_gemma":[0.9989477,0.000037585887,0.000297342,0.00011670379,0.0005089814,0.00009168459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034344886,0.000100793986,0.00018342152,0.000045660345,0.00006489509,0.000042844542,0.00016577558,0.00018246527,0.000034708584],"category_scores_gemma":[0.00020218221,0.000088427885,0.00012839335,0.000053340373,0.000027315193,0.000018980218,0.00002739948,0.00006349168,0.000001988368],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002144318,0.0012377925,0.010902164,0.00025855243,0.0014198152,0.000011778107,0.00026608194,0.49356034,0.25209564,0.010451765,0.052799992,0.17485175],"study_design_scores_gemma":[0.008893008,0.006278771,0.0020674472,0.00010112246,0.0002610569,0.000045579196,0.00012491918,0.031824317,0.8631374,0.066392034,0.020066764,0.000807565],"about_ca_topic_score_codex":0.000004117313,"about_ca_topic_score_gemma":1.9946481e-7,"teacher_disagreement_score":0.8897616,"about_ca_system_score_codex":0.000018900042,"about_ca_system_score_gemma":0.00007407087,"threshold_uncertainty_score":0.36059844},"labels":[],"label_agreement":null},{"id":"W2018095942","doi":"10.1007/s10878-004-4834-x","title":"Protein Threading by Linear Programming: Theoretical Analysis and Computational Results","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Biochemical and Structural Characterization","field":"Biochemistry, Genetics and Molecular Biology","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":"Theory of computation; Integer programming; Threading (protein sequence); Linear programming; Pairwise comparison; Branch and cut; Computer science; Protein structure prediction; Mathematics; Mathematical optimization; Algorithm; Protein structure; Artificial intelligence","score_opus":0.0039135947789993904,"score_gpt":0.22850884557300247,"score_spread":0.22459525079400308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018095942","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7483266,0.000072929404,0.25058496,0.00064934016,0.00018700716,0.00012380096,0.00001287283,0.0000055162473,0.000036969177],"genre_scores_gemma":[0.9436477,0.000022648563,0.055772986,0.000026849595,0.00021893664,0.0000013997899,0.0002960539,0.0000069196917,0.0000065341314],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992475,0.000034803383,0.00033047918,0.00012608171,0.00017263507,0.000088519235],"domain_scores_gemma":[0.9993159,0.000008803425,0.00025886312,0.000076323784,0.00026501832,0.000075052994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017143722,0.00008766404,0.00014626002,0.000058709193,0.000051900497,0.000038881328,0.00009200676,0.000120352735,0.000003675853],"category_scores_gemma":[0.0002389087,0.00007202316,0.000071970906,0.0002039204,0.000081143386,0.000013514224,0.00003456947,0.000085811116,1.5103423e-7],"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.003812969,0.00043541897,0.0007684691,0.00004199339,0.0009154493,0.000007713143,0.0001876308,0.38362414,0.563693,0.044257384,0.00016068915,0.002095183],"study_design_scores_gemma":[0.016492922,0.004903473,0.0012471635,0.00013045469,0.0009283081,0.00012632148,0.0000720474,0.038494382,0.8593109,0.075621225,0.0017343804,0.0009383746],"about_ca_topic_score_codex":0.0000014600854,"about_ca_topic_score_gemma":6.715906e-8,"teacher_disagreement_score":0.34512976,"about_ca_system_score_codex":0.000017739894,"about_ca_system_score_gemma":0.000041498173,"threshold_uncertainty_score":0.29370195},"labels":[],"label_agreement":null},{"id":"W2031691607","doi":"10.1007/s10878-012-9547-y","title":"Paired versus double domination in K 1,r -free graphs","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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":"Saint Mary's University","funders":"","keywords":"Combinatorics; Dominating set; Mathematics; Induced subgraph; Vertex (graph theory); Domination analysis; Graph; Bipartite graph; Discrete mathematics","score_opus":0.026302531656783684,"score_gpt":0.29455605431372744,"score_spread":0.26825352265694374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031691607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011265336,0.00076509255,0.96602166,0.0014416085,0.018361539,0.00024763355,6.133678e-7,0.000040173738,0.0018563238],"genre_scores_gemma":[0.82579756,0.00013098282,0.17356655,0.00002566196,0.0004136647,0.0000063885514,0.0000018229349,0.000015637319,0.000041749827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984158,0.00019491719,0.00042305668,0.00010296283,0.00056960323,0.0002936052],"domain_scores_gemma":[0.9985484,0.00021372431,0.0003433373,0.00031493435,0.0004029456,0.0001766506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016893535,0.00009967206,0.00018740968,0.0005269995,0.000061268394,0.0000791923,0.0007692394,0.000088528766,0.00001434327],"category_scores_gemma":[0.00057865935,0.000096442316,0.000081704755,0.0010550448,0.000040111954,0.0031449962,0.00013293063,0.00024187387,0.0000032722191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010322349,0.0003492175,0.00057061785,0.000008631321,0.000021046531,0.000009306345,0.0004987763,0.068518735,0.00010395229,0.92511564,0.0008167665,0.0029550702],"study_design_scores_gemma":[0.051704388,0.0014971746,0.0009774688,0.00013109617,0.000036525547,0.000084544976,0.00015207946,0.08259235,0.0052338704,0.8540721,0.0029302218,0.00058820966],"about_ca_topic_score_codex":0.0000033669291,"about_ca_topic_score_gemma":3.5366438e-7,"teacher_disagreement_score":0.8145322,"about_ca_system_score_codex":0.00016357466,"about_ca_system_score_gemma":0.00010889282,"threshold_uncertainty_score":0.39328033},"labels":[],"label_agreement":null},{"id":"W2034408278","doi":"10.1007/s10878-008-9151-3","title":"Computing monotone disjoint paths on polytopes","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polytope; Digraph; Combinatorics; Disjoint sets; Mathematics; Monotone polygon; Vertex (graph theory); Polyhedron; Discrete mathematics; Cardinality (data modeling); Submodular set function; Time complexity; Degeneracy (biology); Convex polytope; Regular polygon; Graph; Computer science; Convex set; Convex optimization","score_opus":0.018289594816103014,"score_gpt":0.272463716427228,"score_spread":0.25417412161112496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034408278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02450704,0.00007695166,0.971706,0.00035614986,0.002540525,0.000118073156,4.3289958e-7,0.000041437386,0.0006534178],"genre_scores_gemma":[0.84564793,0.0000988763,0.15375507,0.00008086668,0.00037367232,8.4853184e-7,7.7497856e-7,0.000013791372,0.000028139406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982192,0.00019546313,0.0004926187,0.0001683302,0.0006917095,0.00023268544],"domain_scores_gemma":[0.9983836,0.00023357828,0.0004627686,0.0002840394,0.00049255893,0.00014344724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061669305,0.00012984485,0.00026168922,0.00030535122,0.00023822232,0.00007502234,0.00068635895,0.00006310232,0.000009619931],"category_scores_gemma":[0.00031346502,0.00011189163,0.000116733696,0.00056247204,0.00006647621,0.0007676795,0.00013053702,0.00031725477,0.000007317194],"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.00017999807,0.00033368444,0.0003329546,0.0000059890203,0.000031716685,0.0001395714,0.00059905887,0.7661259,0.0003308215,0.22671877,0.00036326735,0.0048382413],"study_design_scores_gemma":[0.005311951,0.0028066305,0.0014434294,0.00016880594,0.0000151507775,0.00056150113,0.00006105692,0.8986103,0.009255153,0.08033807,0.000916405,0.0005115244],"about_ca_topic_score_codex":0.000001377003,"about_ca_topic_score_gemma":2.1555927e-8,"teacher_disagreement_score":0.82114094,"about_ca_system_score_codex":0.000102298465,"about_ca_system_score_gemma":0.00013636949,"threshold_uncertainty_score":0.45628083},"labels":[],"label_agreement":null},{"id":"W2038358052","doi":"10.1007/s10878-010-9335-5","title":"A modified power spectral density test applied to weighing matrices with small weight","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"graph theory and CDMA systems","field":"Engineering","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":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Theory of computation; Row; Prime (order theory); Spectral density; Combinatorics; Algorithm; Combinatorial optimization; Computer science; Statistics","score_opus":0.0037058371705139593,"score_gpt":0.17038198146559572,"score_spread":0.16667614429508176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038358052","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8092255,0.000027165099,0.17691539,0.00006605939,0.00781266,0.00024481319,0.0000018720892,0.00010129833,0.005605217],"genre_scores_gemma":[0.97246146,0.0000068434024,0.02687147,0.0000137023235,0.0005996958,0.0000031597142,0.0000014014261,0.00003205747,0.000010194124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907297,0.000022252028,0.00037549288,0.000097576434,0.00024558997,0.00018609088],"domain_scores_gemma":[0.9992445,0.00008651595,0.00017769603,0.00014635373,0.0001896777,0.0001552429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036849824,0.00015965772,0.00027264588,0.0002069721,0.00007690338,0.00009741447,0.00019595327,0.00011491121,0.000029822391],"category_scores_gemma":[0.000047132486,0.00013098505,0.00006241257,0.00033348353,0.000017253678,0.000199895,0.000013261264,0.0003669961,0.0000056372537],"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.00037006204,0.00014378499,0.0007048493,0.00003793504,0.00010091058,0.000030926552,0.00063583197,0.92702866,0.017922707,0.052519783,0.00029670238,0.00020786129],"study_design_scores_gemma":[0.051031567,0.00903795,0.016534265,0.0015891765,0.001835297,0.0025076577,0.0015821006,0.4666322,0.31883103,0.10039472,0.022045543,0.007978503],"about_ca_topic_score_codex":0.0000020787543,"about_ca_topic_score_gemma":0.0000019925367,"teacher_disagreement_score":0.46039647,"about_ca_system_score_codex":0.00004050705,"about_ca_system_score_gemma":0.00003132088,"threshold_uncertainty_score":0.53414154},"labels":[],"label_agreement":null},{"id":"W2041621858","doi":"10.1007/s10878-008-9203-8","title":"Well paired-dominated graphs","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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":"Saint Mary's University; University of Prince Edward Island","funders":"","keywords":"Dominating set; Combinatorics; Mathematics; Induced subgraph; Matching (statistics); Cardinality (data modeling); Set (abstract data type); Discrete mathematics; Theory of computation; Graph; Computer science; Vertex (graph theory); Algorithm","score_opus":0.014786778482132978,"score_gpt":0.2552395727820874,"score_spread":0.24045279429995445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041621858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0117753325,0.0001541989,0.98229444,0.00050316105,0.0036057567,0.00013618941,4.0557322e-7,0.00005847383,0.0014720383],"genre_scores_gemma":[0.8019154,0.00029033527,0.19734396,0.000085569816,0.00021460485,0.0000025071129,0.0000015189135,0.000019451347,0.00012664075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820447,0.0002348114,0.0004961929,0.00015694225,0.00067168596,0.00023592611],"domain_scores_gemma":[0.9979874,0.00017211583,0.00045149977,0.00029974812,0.00087676867,0.00021244973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007076648,0.0001261324,0.00025479845,0.00042190938,0.00019737282,0.00006021562,0.00086562027,0.000084316394,0.00003076427],"category_scores_gemma":[0.0004202601,0.000112607595,0.00014408141,0.0010533938,0.00009861284,0.0012892433,0.00010398444,0.0002835012,0.000011676636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039627455,0.0005345721,0.000897543,0.000014507131,0.00008981512,0.0003926609,0.0006820245,0.39398834,0.0006796927,0.5941485,0.0062933816,0.0018827015],"study_design_scores_gemma":[0.008900744,0.001936341,0.00051808776,0.00008709692,0.000030013192,0.0012076491,0.00004734007,0.34873334,0.008662185,0.62440103,0.0048843212,0.0005918944],"about_ca_topic_score_codex":0.000001258752,"about_ca_topic_score_gemma":2.7835407e-8,"teacher_disagreement_score":0.7901401,"about_ca_system_score_codex":0.000072801784,"about_ca_system_score_gemma":0.0002330591,"threshold_uncertainty_score":0.45920044},"labels":[],"label_agreement":null},{"id":"W2041819532","doi":"10.1007/s10878-010-9340-8","title":"Solving haplotype inference problem with non-genotyped founders via integer linear programming","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genetic Mapping and Diversity in Plants and Animals","field":"Biochemistry, Genetics and Molecular Biology","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":"Pedigree chart; Combinatorics; Haplotype; Integer programming; Integer (computer science); Inference; Genetics; Theory of computation; Linear programming; Genotype; Mathematics; Computer science; Biology; Algorithm; Genealogy; Artificial intelligence; Gene","score_opus":0.006523494128164597,"score_gpt":0.22811571672593461,"score_spread":0.22159222259777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041819532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.359516,0.00004940915,0.6368258,0.00016854357,0.0020971054,0.00022479873,0.0000019756865,0.000012969425,0.0011034048],"genre_scores_gemma":[0.9037924,0.000033345517,0.09562225,0.000030463263,0.00044192327,0.0000010511402,0.000014238692,0.000010317631,0.000054020446],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993463,0.00002039914,0.0002137134,0.000112982394,0.0001703796,0.00013621186],"domain_scores_gemma":[0.9991038,0.000012853532,0.00026466796,0.00009785791,0.00044188532,0.0000789455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022047463,0.00010386515,0.00013582046,0.000054474025,0.00009749876,0.00005525338,0.0001448705,0.00012214661,0.00001909703],"category_scores_gemma":[0.00008459171,0.00008223745,0.000050183997,0.000080912425,0.000043223976,0.000013857238,0.000037838898,0.00018004575,0.0000016199166],"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.0028185397,0.0010822223,0.0253064,0.00017088487,0.00063293154,0.000049533475,0.0011330368,0.37265778,0.5811025,0.001968514,0.001982188,0.011095475],"study_design_scores_gemma":[0.056515828,0.050816484,0.008626339,0.0017602085,0.0021031504,0.0018454475,0.0031598052,0.28747386,0.33335117,0.009099463,0.23832814,0.006920131],"about_ca_topic_score_codex":0.000009925787,"about_ca_topic_score_gemma":0.0000034635523,"teacher_disagreement_score":0.5442764,"about_ca_system_score_codex":0.0000068278787,"about_ca_system_score_gemma":0.00013209692,"threshold_uncertainty_score":0.33535457},"labels":[],"label_agreement":null},{"id":"W2042572227","doi":"10.1007/s10878-012-9541-4","title":"A lower bound of the surviving rate of a planar graph with girth at least seven","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"St. Francis Xavier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Planar graph; Graph; Wheel graph; Mathematics; Upper and lower bounds; Girth (graph theory); Discrete mathematics; Graph power; Line graph","score_opus":0.007577310179705699,"score_gpt":0.21246243814157073,"score_spread":0.20488512796186503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042572227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99135804,0.0001976892,0.007039229,0.00004620946,0.0010638144,0.00006870903,0.0000028137244,0.0000012821275,0.00022224044],"genre_scores_gemma":[0.9979638,0.000031192638,0.0016628356,0.00002439076,0.0002771304,3.3047428e-7,0.0000047163467,0.0000066416014,0.00002895677],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992773,0.0001371958,0.00028192092,0.000060472128,0.00012856163,0.000114560564],"domain_scores_gemma":[0.99902236,0.000027547567,0.00056385534,0.0001027049,0.00024069764,0.000042851403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046625943,0.00007786763,0.0001644772,0.000026736117,0.000051568968,0.0000072364296,0.00014092197,0.00008174641,0.0000073650403],"category_scores_gemma":[0.0001124024,0.000044491695,0.00009534202,0.00012105369,0.000064935106,0.000009501539,0.000053599237,0.00007056873,1.1348669e-7],"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.004774605,0.0012564661,0.20647475,0.000108700166,0.0005856492,0.000004805952,0.00042470198,0.099334806,0.68254864,0.0027995661,0.001075855,0.0006114683],"study_design_scores_gemma":[0.01766799,0.013872233,0.16543318,0.0009616086,0.00071953685,0.00054813793,0.0005075484,0.0027539562,0.78278315,0.0030271348,0.010344656,0.0013808634],"about_ca_topic_score_codex":0.000003906413,"about_ca_topic_score_gemma":9.929221e-7,"teacher_disagreement_score":0.100234516,"about_ca_system_score_codex":0.00001195155,"about_ca_system_score_gemma":0.00004555853,"threshold_uncertainty_score":0.18143186},"labels":[],"label_agreement":null},{"id":"W2043815754","doi":"10.1007/s10878-013-9634-8","title":"An optimal randomized online algorithm for the $$k$$ k -Canadian Traveller Problem on node-disjoint paths","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":30,"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":"Competitive analysis; Randomized algorithm; Theory of computation; Disjoint sets; Online algorithm; Shortest path problem; Computer science; Node (physics); Graph; Combinatorics; Path (computing); Algorithm; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Mathematics; Discrete mathematics; Artificial intelligence; Computer network","score_opus":0.014345798641235114,"score_gpt":0.2585192954949509,"score_spread":0.24417349685371578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043815754","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000076079414,0.000052755302,0.9906677,0.0049569868,0.0023051465,0.0015714488,0.0000069685325,0.000034548346,0.00032835393],"genre_scores_gemma":[0.020331306,0.0001361288,0.9779619,0.00073587283,0.0006004316,0.00008416885,0.000025557243,0.000031260584,0.00009339024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975368,0.00037972652,0.0008437555,0.00023480157,0.0006351356,0.00036978073],"domain_scores_gemma":[0.9964847,0.00049091823,0.0005792229,0.00036772448,0.0016823778,0.0003950685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019235921,0.00021237029,0.00046432423,0.00033688053,0.00043531987,0.00079987047,0.0009811347,0.0001511675,0.00013740621],"category_scores_gemma":[0.00025206566,0.00013801124,0.00025009256,0.00039585467,0.00008854517,0.001222005,0.0000385528,0.00033898908,0.000009560694],"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.00058723544,0.00030449504,0.0000014843886,0.0000053026683,0.000070362476,0.0000023786204,0.000493466,0.947393,0.000008092514,0.018889936,0.0014097785,0.030834462],"study_design_scores_gemma":[0.032541543,0.00062464585,0.000010282627,0.000030111029,0.00002804741,0.0000129454165,0.000043931905,0.9615598,0.000060935916,0.0039388323,0.0009813634,0.0001675815],"about_ca_topic_score_codex":0.0004308694,"about_ca_topic_score_gemma":0.00003217256,"teacher_disagreement_score":0.03195431,"about_ca_system_score_codex":0.00017311724,"about_ca_system_score_gemma":0.0006198512,"threshold_uncertainty_score":0.7713169},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002437117,0.0005264325,0.99067605,0.000523429,0.004819364,0.000092809125,0.0000026436564,0.000033569562,0.0008885953],"genre_scores_gemma":[0.50818324,0.00051116664,0.4905804,0.000060816303,0.00047633963,0.0000021055755,0.000003275479,0.000018058374,0.00016460688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981608,0.00012091116,0.00079884054,0.00014143651,0.0005908859,0.00018712868],"domain_scores_gemma":[0.99766994,0.0002354119,0.0010024989,0.0003176355,0.0006660821,0.00010843135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006015208,0.00012997484,0.00031822323,0.00051835354,0.00012827189,0.00009570929,0.000698634,0.00011374176,0.00013958896],"category_scores_gemma":[0.00027853806,0.00012563696,0.0001938076,0.0012454892,0.000059287224,0.0009117833,0.000106396874,0.0002800595,0.000007965344],"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.0000697745,0.0010156707,0.00059107615,0.000060999842,0.00017832448,0.00003901426,0.0010945561,0.5723305,0.0003251404,0.40548936,0.00455826,0.014247337],"study_design_scores_gemma":[0.002699823,0.0005930211,0.00020001555,0.00010106897,0.000058374426,0.00016892605,0.000020247895,0.9293103,0.0010314386,0.062389124,0.0031642343,0.00026339307],"about_ca_topic_score_codex":0.0000046725045,"about_ca_topic_score_gemma":1.239331e-7,"teacher_disagreement_score":0.5057461,"about_ca_system_score_codex":0.00005967978,"about_ca_system_score_gemma":0.000047658712,"threshold_uncertainty_score":0.5123326},"labels":[],"label_agreement":null},{"id":"W2048232458","doi":"10.1007/s10878-013-9630-z","title":"Snakes, coils, and single-track circuit codes with spread $$k$$ k","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"VLSI and Analog Circuit Testing","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":"University of Guelph","funders":"","keywords":"Backtracking; Hypercube; Combinatorics; Path (computing); Generalization; Theory of computation; Algorithm; Track (disk drive); Mathematics; Computer science; Discrete mathematics; Mathematical analysis","score_opus":0.013259033712852182,"score_gpt":0.20154860744370795,"score_spread":0.18828957373085578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048232458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03968969,0.00025552433,0.95628804,0.0005306825,0.001277994,0.00014993384,4.820145e-7,0.00005743458,0.0017501937],"genre_scores_gemma":[0.972181,0.00003484994,0.027393073,0.0000815071,0.00027456018,0.0000017250303,0.0000012347797,0.000011573029,0.00002047244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885875,0.00007031851,0.00037867663,0.00015123172,0.00035812767,0.00018288188],"domain_scores_gemma":[0.9984655,0.00014073272,0.00047674682,0.00015889964,0.0006162276,0.00014191701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028757617,0.00012753886,0.000240901,0.00013031172,0.0001139826,0.00043414952,0.00033480505,0.00006661157,0.000014185896],"category_scores_gemma":[0.00015225395,0.000100548226,0.000038375947,0.0003055548,0.000047426856,0.001498894,0.00004003676,0.00016855069,0.00000348126],"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.000033959142,0.0021406666,0.03204923,0.00023805538,0.00048868865,0.00032766847,0.0040832176,0.34902602,0.017072586,0.28631905,0.005702573,0.30251828],"study_design_scores_gemma":[0.016301395,0.0091468,0.013406227,0.001614387,0.00032253948,0.00381949,0.0004381269,0.8184502,0.009463618,0.122138016,0.0026038096,0.0022953686],"about_ca_topic_score_codex":0.000017063125,"about_ca_topic_score_gemma":4.2019482e-7,"teacher_disagreement_score":0.9324913,"about_ca_system_score_codex":0.00004808799,"about_ca_system_score_gemma":0.00009634319,"threshold_uncertainty_score":0.41865137},"labels":[],"label_agreement":null},{"id":"W2049678150","doi":"10.1007/s10878-008-9149-x","title":"A quadratic lower bound for colourful simplicial depth","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Computational Geometry and Mesh Generation","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 New Brunswick; Simon Fraser University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Convex hull; Mathematics; Theory of computation; Regular polygon; Quadratic equation; Point (geometry); Set (abstract data type); Graph; Computer science; Geometry; Algorithm","score_opus":0.018591734842085907,"score_gpt":0.26025837418015757,"score_spread":0.24166663933807167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049678150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027943656,0.00006559028,0.9644783,0.00049215264,0.0065855,0.000201857,9.39795e-7,0.000022475295,0.00020953944],"genre_scores_gemma":[0.746017,0.000027388374,0.25250128,0.00017533849,0.0011915577,0.000006353187,0.0000065700574,0.000010025392,0.00006452875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987454,0.00006963381,0.00050236983,0.00013430609,0.000398492,0.00014983889],"domain_scores_gemma":[0.99816096,0.00021279287,0.00046824187,0.00012936763,0.0009340295,0.0000946205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003993564,0.000107726926,0.0002147991,0.00020110152,0.00024844415,0.000114651484,0.0003275133,0.00007643115,0.000009272611],"category_scores_gemma":[0.00030070718,0.00010254493,0.00013097626,0.00044829742,0.00002499673,0.0008187303,0.000035019748,0.00009859021,0.0000026611224],"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.00019565901,0.00030947648,0.00007421105,0.000010014287,0.000040879193,0.000017329387,0.00037860157,0.9217218,0.00028562313,0.070492126,0.0049418686,0.001532384],"study_design_scores_gemma":[0.0043391646,0.0019497273,0.00049573934,0.000026170355,0.000039677336,0.00030498957,0.000012130355,0.94360167,0.0016785865,0.038803104,0.008464387,0.00028464993],"about_ca_topic_score_codex":0.0000014658536,"about_ca_topic_score_gemma":4.2309176e-7,"teacher_disagreement_score":0.7180733,"about_ca_system_score_codex":0.00010443679,"about_ca_system_score_gemma":0.00041773953,"threshold_uncertainty_score":0.4181661},"labels":[],"label_agreement":null},{"id":"W2057791178","doi":"10.1007/s10878-012-9540-5","title":"A unified dual-fitting approximation algorithm for the facility location problems with linear/submodular penalties","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Facility location problem; Submodular set function; Theory of computation; Approximation algorithm; Dual (grammatical number); Mathematical optimization; Mathematics; 1-center problem; Linear programming; Computer science; Algorithm","score_opus":0.023861231496029426,"score_gpt":0.2293149594884278,"score_spread":0.2054537279923984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057791178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043522883,0.00014060787,0.99044436,0.0012126381,0.0027690332,0.00083049445,0.0000024789972,0.000039126095,0.00020898538],"genre_scores_gemma":[0.9571387,0.00004063648,0.039346945,0.00024198646,0.0029133027,0.00007503378,0.00011743397,0.000025033996,0.000100898054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985704,0.000031999138,0.0005890147,0.000116884905,0.00047079756,0.00022095018],"domain_scores_gemma":[0.9977046,0.00005260797,0.0005572717,0.00017265519,0.0014912465,0.000021605349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019283528,0.00015298053,0.00019522707,0.00017794898,0.00031487606,0.00016556123,0.00016201727,0.00006116513,0.000042403484],"category_scores_gemma":[0.000317959,0.00010514173,0.00007817007,0.000538007,0.00004097357,0.0021218394,0.00003969623,0.00012884453,0.000007969226],"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.00013287787,0.00029590633,0.00057982793,0.00026307852,0.000098604134,1.9203546e-7,0.0003571685,0.97345686,0.000016114076,0.013139148,0.00061011803,0.011050075],"study_design_scores_gemma":[0.0016624787,0.00006376303,0.0007090859,0.00005139759,0.00018878991,0.0000025254308,0.0006613284,0.982653,0.00005192778,0.00080921664,0.012974139,0.00017232631],"about_ca_topic_score_codex":0.000063945314,"about_ca_topic_score_gemma":0.0000029693197,"teacher_disagreement_score":0.95278645,"about_ca_system_score_codex":0.00007549548,"about_ca_system_score_gemma":0.000043364562,"threshold_uncertainty_score":0.42875552},"labels":[],"label_agreement":null},{"id":"W2063096021","doi":"10.1007/s10878-012-9552-1","title":"An improved algorithm for tree edit distance with applications for RNA secondary structure comparison","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","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":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Edit distance; Tree (set theory); Theory of computation; Recursion (computer science); Computer science; Algorithm; Speedup; Computation; Search tree; Tree structure; K-ary tree; Interval tree; Sequence (biology); Theoretical computer science; Mathematics; Combinatorics; Binary tree; Search algorithm; Parallel computing","score_opus":0.006026028654255869,"score_gpt":0.2510503325650696,"score_spread":0.24502430391081373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063096021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025952575,0.00033227762,0.9950067,0.00004340095,0.0012509491,0.00066500984,0.00007334958,0.00000488355,0.000028204446],"genre_scores_gemma":[0.46471775,0.000020055577,0.5316664,0.000032151172,0.0032346575,0.000082019564,0.00019431251,0.000029582276,0.000023096889],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992705,0.00003647968,0.00029543255,0.00011762631,0.00011343082,0.00016651927],"domain_scores_gemma":[0.998836,0.000026322796,0.000455791,0.00015894578,0.00041317038,0.00010981511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024317483,0.00012003949,0.00019727723,0.000035870566,0.00011239855,0.00003748989,0.00016187798,0.00014612,0.000007667623],"category_scores_gemma":[0.000031289725,0.0000985945,0.00007710628,0.00005478698,0.000021817952,0.00003681378,0.0000088117895,0.000068200614,7.29219e-8],"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.002753761,0.0009164768,0.00026271655,0.00011420884,0.00035347993,2.6708108e-7,0.00019832118,0.01877026,0.7786109,0.005751489,0.0020792065,0.19018894],"study_design_scores_gemma":[0.0066215624,0.004855709,0.000061223516,0.000029167823,0.00023789643,0.000023540244,0.0001558564,0.037665118,0.8849316,0.0035220839,0.061436992,0.00045921188],"about_ca_topic_score_codex":5.0157746e-7,"about_ca_topic_score_gemma":6.5669565e-7,"teacher_disagreement_score":0.46334028,"about_ca_system_score_codex":0.000021741002,"about_ca_system_score_gemma":0.00009377145,"threshold_uncertainty_score":0.40205672},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043775758,0.00050707546,0.9909008,0.0017106669,0.005686138,0.00070696557,0.0000017186477,0.000020828755,0.000028036606],"genre_scores_gemma":[0.49064776,0.00047466284,0.5063072,0.00017670395,0.0021884555,0.00013438087,0.000018528073,0.000023011587,0.000029301056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988495,0.00013927744,0.00044579688,0.000105210325,0.00028880293,0.00017137993],"domain_scores_gemma":[0.9983867,0.00041008618,0.00062067196,0.0001842284,0.0003407177,0.000057616307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019293812,0.00011279277,0.00017015738,0.00008984826,0.00040525556,0.0002733305,0.0003380741,0.000056469118,0.0000023481382],"category_scores_gemma":[0.00016521921,0.00006437478,0.00010776618,0.00029332784,0.000097522374,0.001403704,0.00007676137,0.00015800413,2.94493e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065037474,0.0006235522,0.00023942583,0.00012555232,0.00031488884,4.4103618e-7,0.009448821,0.15538144,0.0006732627,0.7077362,0.0007781679,0.12402787],"study_design_scores_gemma":[0.003492536,0.00016685469,0.00016806324,0.000018014187,0.000062799125,0.000045124943,0.00012520404,0.95805633,0.0005636581,0.036810987,0.00039396188,0.00009647484],"about_ca_topic_score_codex":0.000010376448,"about_ca_topic_score_gemma":3.357073e-7,"teacher_disagreement_score":0.8026749,"about_ca_system_score_codex":0.00005910395,"about_ca_system_score_gemma":0.000041678057,"threshold_uncertainty_score":0.3116939},"labels":[],"label_agreement":null},{"id":"W2065681991","doi":"10.1007/s10878-006-5981-z","title":"Data relaying with constraints in hierarchical sensor networks","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Energy Efficient Wireless Sensor Networks","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":"Queen's University","funders":"","keywords":"Relay; Computer science; Wireless sensor network; Computer network; Hop (telecommunications); Theory of computation; Base station; Set (abstract data type); Data flow diagram; Distributed computing; Algorithm","score_opus":0.011004496495718207,"score_gpt":0.22512834602068815,"score_spread":0.21412384952496993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065681991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007230243,0.00009321468,0.9891635,0.0004513652,0.002119994,0.00008972693,0.0000010936086,0.00003340872,0.0008174375],"genre_scores_gemma":[0.6731597,0.000024512727,0.3262038,0.00003782437,0.0005349482,5.980764e-7,0.000013983806,0.0000141777855,0.000010430069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809074,0.00020742745,0.0006541531,0.00025925046,0.0005115234,0.00027691247],"domain_scores_gemma":[0.99842215,0.00021773246,0.00052021333,0.00049446523,0.0002619382,0.00008348333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007493122,0.00014766246,0.00028884644,0.00023574375,0.000075947166,0.00017599258,0.0010151995,0.00012989217,0.0000056428817],"category_scores_gemma":[0.00008280569,0.00012457362,0.0000376862,0.00074044545,0.00009899231,0.0008463271,0.00017507505,0.00046462603,6.184206e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006349032,0.00014490496,0.00092806225,0.0000022904192,0.000010446192,0.0001301721,0.000023209996,0.9671248,0.000009870268,0.0304549,0.00019750703,0.0009103019],"study_design_scores_gemma":[0.0019755736,0.00015414006,0.00032547824,0.00010098827,0.000010938197,0.00016635451,0.0000092609125,0.9962739,0.000019028786,0.0005981247,0.00021692373,0.00014931528],"about_ca_topic_score_codex":0.000008683166,"about_ca_topic_score_gemma":0.0000028712582,"teacher_disagreement_score":0.6659295,"about_ca_system_score_codex":0.00008960531,"about_ca_system_score_gemma":0.00015449685,"threshold_uncertainty_score":0.5079965},"labels":[],"label_agreement":null},{"id":"W2070890709","doi":"10.1007/s10878-007-9109-x","title":"An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Iran National Science Foundation","keywords":"Arc routing; Subgradient method; Theory of computation; Mathematical optimization; Linear programming relaxation; Integer programming; Mathematics; Context (archaeology); Relaxation (psychology); Extension (predicate logic); Lagrangian relaxation; Algorithm; Linear programming; Branch and cut; Computer science; Routing (electronic design automation)","score_opus":0.015020409437286941,"score_gpt":0.2665742300886776,"score_spread":0.25155382065139065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070890709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09264158,0.0000313686,0.90304184,0.000013744424,0.0038243013,0.0003258294,0.0000051350007,0.000027206317,0.00008901257],"genre_scores_gemma":[0.5733537,0.000011583956,0.42589125,0.0000028340617,0.0007024083,0.000001100627,0.0000039286806,0.000030779,0.0000024259948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981234,0.00011632417,0.0011539994,0.00010217337,0.0003190249,0.00018508309],"domain_scores_gemma":[0.99698734,0.00028542642,0.0011590254,0.00018652162,0.0013125587,0.000069101974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002795251,0.00013706415,0.00032259553,0.000224865,0.000110120236,0.00002640782,0.0001620752,0.00015439643,0.000008090428],"category_scores_gemma":[0.00078998297,0.000117820666,0.00013525084,0.00053559185,0.000043719454,0.00041185674,0.000016541284,0.0002134623,6.658638e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050817114,0.000075532254,0.00011448822,0.000047336704,0.000034819393,0.000006064998,0.0011677834,0.9805858,0.007410305,0.0006593871,0.000027903925,0.00981973],"study_design_scores_gemma":[0.0016408209,0.00024649868,0.00015613688,0.00017253059,0.00007720055,0.00013987234,0.00026484704,0.973718,0.022662282,0.00079180265,0.000015307447,0.000114739734],"about_ca_topic_score_codex":0.000008988626,"about_ca_topic_score_gemma":0.0000015432414,"teacher_disagreement_score":0.48071212,"about_ca_system_score_codex":0.00013899167,"about_ca_system_score_gemma":0.00006739046,"threshold_uncertainty_score":0.48045874},"labels":[],"label_agreement":null},{"id":"W2074049387","doi":"10.1007/s10878-006-9625-0","title":"Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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":"Université de Montréal","funders":"","keywords":"Theory of computation; Constant (computer programming); Mathematics; Rank (graph theory); Combinatorics; Quadratic equation; Quadratic programming; Discrete mathematics; Mathematical optimization; Applied mathematics; Computer science; Algorithm; Geometry","score_opus":0.02051957195072803,"score_gpt":0.2957860368845196,"score_spread":0.2752664649337916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074049387","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012112191,0.00021575259,0.9791534,0.00072556717,0.0025720324,0.0016711317,0.00001585149,0.000063888954,0.0034702038],"genre_scores_gemma":[0.3482143,0.000023493703,0.65107363,0.000011724816,0.00035434696,0.000010504145,0.0000049634305,0.000045395995,0.00026167548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972107,0.00025466134,0.0012846274,0.00013416621,0.00084400235,0.00027184872],"domain_scores_gemma":[0.99593914,0.0006546492,0.0016082419,0.0002447647,0.0014764874,0.00007671315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009199566,0.00018425257,0.00046600902,0.00019617208,0.00017703696,0.00008553509,0.00034524166,0.00012110355,0.00007528115],"category_scores_gemma":[0.0014513752,0.00013318227,0.00019092119,0.0006719659,0.00021926334,0.00040556237,0.000063935135,0.0002882566,6.1433633e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003407516,0.0008050166,0.00044168392,0.00016546364,0.00010350149,0.000029940042,0.00019581677,0.87649643,0.00070287765,0.11859075,0.0012631677,0.0008646183],"study_design_scores_gemma":[0.0349713,0.0032609776,0.00010299585,0.0020148295,0.00094552874,0.0013712993,0.0016878606,0.3303717,0.03020843,0.5902644,0.003198746,0.0016019535],"about_ca_topic_score_codex":0.000021065765,"about_ca_topic_score_gemma":0.000004279258,"teacher_disagreement_score":0.5461247,"about_ca_system_score_codex":0.00018067077,"about_ca_system_score_gemma":0.0006863404,"threshold_uncertainty_score":0.5431015},"labels":[],"label_agreement":null},{"id":"W2074067065","doi":"10.1023/b:joco.0000038910.06360.0a","title":"Minimal Tetrahedralizations of a Class of Polyhedra","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Computational Geometry and Mesh Generation","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":"Memorial University of Newfoundland; University of Regina","funders":"","keywords":"Polyhedron; Tetrahedron; Combinatorics; Class (philosophy); Mathematics; Dual polyhedron; Theory of computation; Euclidean space; Simple (philosophy); Graph; Discrete mathematics; Computer science; Algorithm; Geometry; Artificial intelligence","score_opus":0.009299103776380803,"score_gpt":0.2412016995222419,"score_spread":0.2319025957458611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074067065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024220023,0.00012142591,0.97267926,0.0004469382,0.0021117965,0.00008182998,0.0000020515229,0.000010180159,0.0003265119],"genre_scores_gemma":[0.7462502,0.00002874707,0.2535318,0.00002012514,0.00015165552,6.123881e-7,0.0000037767488,0.000004729193,0.000008337853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998528,0.00006180231,0.000737329,0.00009535939,0.0004838216,0.000093690185],"domain_scores_gemma":[0.9977073,0.00008451062,0.0008899259,0.00014763622,0.0011070285,0.00006360237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034220636,0.00008642882,0.00023976996,0.00037419322,0.000047811514,0.000033103614,0.0003495323,0.0000683043,0.000010610943],"category_scores_gemma":[0.0002216805,0.00008306023,0.000115296825,0.0009243045,0.00003782241,0.0007110875,0.000044632765,0.000082823004,6.0487827e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029808578,0.00021042633,0.00006909253,0.000012109841,0.00002256322,0.0000016690434,0.00024642862,0.76786375,0.0016614979,0.2293648,0.00005029678,0.00046754847],"study_design_scores_gemma":[0.016031452,0.005020522,0.003391161,0.00046740653,0.00020566783,0.0002669784,0.00016655542,0.58287627,0.1920783,0.19688123,0.0019065791,0.00070785143],"about_ca_topic_score_codex":0.00000481475,"about_ca_topic_score_gemma":1.7672792e-7,"teacher_disagreement_score":0.72203016,"about_ca_system_score_codex":0.000057358702,"about_ca_system_score_gemma":0.00041675204,"threshold_uncertainty_score":0.33870977},"labels":[],"label_agreement":null},{"id":"W2075485134","doi":"10.1007/s10878-010-9366-y","title":"Exact and approximation algorithms for the complementary maximal strip recovery problem","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Substring; Approximation algorithm; Combinatorics; Mathematics; Theory of computation; Algorithm; Sequence (biology); Set (abstract data type); Constant (computer programming); Running time; Discrete mathematics; Computer science","score_opus":0.011198615586671824,"score_gpt":0.24746728216516203,"score_spread":0.23626866657849022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075485134","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089321636,0.0004912101,0.90213,0.0011682094,0.0053857258,0.0012356322,0.00003508827,0.000009281092,0.00022322449],"genre_scores_gemma":[0.4381807,0.0008004349,0.55662256,0.00013389069,0.003751811,0.000048546986,0.00029163936,0.000058798312,0.00011163371],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992357,0.000035949473,0.0003165726,0.00011487244,0.00017345005,0.0001234537],"domain_scores_gemma":[0.9991395,0.000041764466,0.00033988134,0.00012184663,0.00030772196,0.000049293514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006053758,0.00010137512,0.00012469248,0.000052121224,0.00011676004,0.000066988454,0.00014460227,0.00008943036,0.000016516691],"category_scores_gemma":[0.00008229517,0.000076931545,0.00007358737,0.000063873355,0.00003861131,0.000022658645,0.000042808882,0.00012548645,2.444475e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044637527,0.0016487209,0.0034824044,0.0003539813,0.0020026148,0.0000081606695,0.00069339585,0.22014649,0.5423642,0.007985799,0.021570416,0.19528009],"study_design_scores_gemma":[0.053527985,0.017805582,0.006210411,0.00016327872,0.001600029,0.0006922011,0.0013814457,0.4993156,0.13009997,0.045595154,0.2412765,0.0023318664],"about_ca_topic_score_codex":0.0000031664563,"about_ca_topic_score_gemma":9.017182e-7,"teacher_disagreement_score":0.4122642,"about_ca_system_score_codex":0.000014157877,"about_ca_system_score_gemma":0.00006210518,"threshold_uncertainty_score":0.31371775},"labels":[],"label_agreement":null},{"id":"W2076264749","doi":"10.1007/s10878-010-9328-4","title":"Fast searching games on graphs","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Artificial Intelligence in Games","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 Regina","funders":"","keywords":"Combinatorics; Mathematics; Time complexity; Discrete mathematics; Graph; Pathwidth; Quadratic equation; Chordal graph; Line graph","score_opus":0.013975031462997141,"score_gpt":0.27683168646508555,"score_spread":0.2628566550020884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076264749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036934108,0.000015357067,0.9436128,0.0014915639,0.015508576,0.00010243803,4.0979108e-7,0.000051352086,0.0022833557],"genre_scores_gemma":[0.843208,0.000020207786,0.15603219,0.0001317364,0.0005650488,0.0000011620027,4.3041916e-7,0.000011595393,0.00002964756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985612,0.00009309514,0.00045097843,0.00014187617,0.0005715714,0.0001812985],"domain_scores_gemma":[0.9984356,0.00021621845,0.00041081413,0.00027771527,0.0004977764,0.00016187131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007395385,0.000110788525,0.00017868173,0.0002964409,0.00012393967,0.0002716074,0.00082152925,0.000088591005,0.00003363553],"category_scores_gemma":[0.00079493975,0.00009495455,0.00010950093,0.00039620616,0.000056567962,0.00089452305,0.00007652354,0.00054239924,0.000015040987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052389736,0.00020595895,0.00028485866,0.000003943912,0.00002159906,0.000021255111,0.0008032647,0.27090308,0.0021648167,0.6990901,0.0010435574,0.025405131],"study_design_scores_gemma":[0.0008091407,0.0012524732,0.00024357604,0.000091195354,0.000019610647,0.00010897903,0.000107262684,0.55841047,0.037220355,0.3984311,0.0029180232,0.00038779923],"about_ca_topic_score_codex":0.000004117742,"about_ca_topic_score_gemma":4.601977e-7,"teacher_disagreement_score":0.8062739,"about_ca_system_score_codex":0.000030513875,"about_ca_system_score_gemma":0.00015884585,"threshold_uncertainty_score":0.3872134},"labels":[],"label_agreement":null},{"id":"W2076965738","doi":"10.1007/s10878-007-9042-z","title":"Monotonicity of strong searching on digraphs","year":2007,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","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 Regina","funders":"","keywords":"Digraph; Monotonic function; Theory of computation; Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Discrete mathematics; Computer science; Algorithm; Artificial intelligence","score_opus":0.015271290622068032,"score_gpt":0.2832409714051561,"score_spread":0.267969680783088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076965738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058092494,0.0000276286,0.98888755,0.00022274227,0.0015148388,0.00013090041,5.223363e-7,0.000020753636,0.0033858358],"genre_scores_gemma":[0.8092666,0.000054203167,0.19048779,0.000040295214,0.00012468945,4.527737e-7,0.0000010815661,0.000008657275,0.000016188895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981831,0.00012611209,0.00063811423,0.00012052792,0.00072109496,0.00021109227],"domain_scores_gemma":[0.99814224,0.00022913294,0.0005962446,0.00021238587,0.00067877653,0.00014124179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001935529,0.00009918689,0.00022503566,0.00044112524,0.00008647009,0.000088037894,0.00055266125,0.00007162761,0.000013471043],"category_scores_gemma":[0.00024490195,0.00008751806,0.00011363517,0.00060279144,0.000037030193,0.0007255424,0.000071383845,0.0002763564,0.0000012323834],"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.00009913997,0.00020843587,0.00032047663,0.000009051159,0.0000230954,0.000006713098,0.00033479172,0.77122706,0.0001459402,0.224834,0.00008262708,0.0027086916],"study_design_scores_gemma":[0.003991438,0.002040171,0.0009499192,0.00015942704,0.000017554694,0.000023583312,0.00008677304,0.9664499,0.010286319,0.0151968915,0.000535287,0.00026270296],"about_ca_topic_score_codex":0.000004838543,"about_ca_topic_score_gemma":2.2788322e-7,"teacher_disagreement_score":0.8034574,"about_ca_system_score_codex":0.000072945324,"about_ca_system_score_gemma":0.00014249473,"threshold_uncertainty_score":0.3568883},"labels":[],"label_agreement":null},{"id":"W2077309477","doi":"10.1007/s10878-008-9155-z","title":"Foreword: selected papers from the Franco-Canadian workshop on combinatorial algorithms","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Graph Labeling and Dimension Problems","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":true,"ca_institutions":"McMaster University; University of New Brunswick","funders":"","keywords":"Theory of computation; Computer science; Operations research; Algorithm; Mathematics","score_opus":0.011765711029413277,"score_gpt":0.2126057162043196,"score_spread":0.2008400051749063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077309477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18416196,0.0028855286,0.5360879,0.02734876,0.2369085,0.0021736901,0.00006551544,0.0006987789,0.00966937],"genre_scores_gemma":[0.962805,0.00022795971,0.035434227,0.0007969102,0.00064558926,0.000004686408,0.000013638064,0.000028671164,0.00004336461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977487,0.00023393615,0.00062454643,0.00025208527,0.00079742837,0.000343329],"domain_scores_gemma":[0.99740714,0.00046038965,0.00050646975,0.0004277663,0.00088044937,0.00031779846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005436636,0.00021641901,0.00032462986,0.00024121067,0.0005699932,0.00013725422,0.00095816446,0.00020686601,0.000040355782],"category_scores_gemma":[0.0005068406,0.00015750276,0.00015291336,0.001236564,0.00008176097,0.00046144778,0.00005270833,0.00054187997,0.000013602841],"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.0005179565,0.0008857212,0.00193716,0.0000069547273,0.0004312248,0.0002745734,0.0041599013,0.54942757,0.00025775365,0.35483953,0.07958252,0.007679152],"study_design_scores_gemma":[0.026246741,0.0028385457,0.0056707263,0.0006458578,0.00022272098,0.00034127934,0.00022252012,0.6385344,0.0018392946,0.28272507,0.038865358,0.0018474723],"about_ca_topic_score_codex":0.0008010189,"about_ca_topic_score_gemma":0.000038531052,"teacher_disagreement_score":0.778643,"about_ca_system_score_codex":0.00013912728,"about_ca_system_score_gemma":0.000628615,"threshold_uncertainty_score":0.6422776},"labels":[],"label_agreement":null},{"id":"W2078856178","doi":"10.1007/s10878-008-9156-y","title":"The canadian traveller problem and its competitive analysis","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":48,"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":"Theory of computation; Vertex (graph theory); Computer science; Competitive analysis; Adaptive strategies; Graph; Grid; Mathematical optimization; Shortest path problem; Greedy algorithm; Enhanced Data Rates for GSM Evolution; Mathematics; Combinatorics; Theoretical computer science; Algorithm; Upper and lower bounds; Artificial intelligence; Geography","score_opus":0.014219725251747941,"score_gpt":0.2319537224110097,"score_spread":0.21773399715926176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078856178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013504444,0.0008027229,0.9654975,0.008935316,0.0024678994,0.00053821877,0.0000035973203,0.000044496217,0.02035982],"genre_scores_gemma":[0.9248303,0.0012640712,0.07331842,0.00014560501,0.00013716314,0.000003449101,0.0000032868172,0.000009351854,0.00028834183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987197,0.0001651579,0.0003811427,0.00011682179,0.00042021464,0.00019694485],"domain_scores_gemma":[0.99821705,0.00012211232,0.00028777754,0.00012821292,0.0009952759,0.00024954684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065411243,0.0000913264,0.00018980564,0.00034539853,0.00072257593,0.00024350715,0.0004075766,0.00006601939,0.000016386106],"category_scores_gemma":[0.000107617845,0.000065651,0.000082969396,0.0010232853,0.00005818233,0.0005610033,0.000042813033,0.00018621385,0.0000022597542],"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.000016147764,0.00003796671,0.00031683396,0.000002646632,0.00019129731,0.000019484545,0.0009697797,0.4659965,0.000004585108,0.5316869,0.00044856375,0.00030931685],"study_design_scores_gemma":[0.0012947308,0.00025930456,0.0010580932,0.000013287982,0.00007276633,0.000090400456,0.000046407265,0.98535836,0.00007697709,0.003910818,0.0076491567,0.00016968424],"about_ca_topic_score_codex":0.00031009142,"about_ca_topic_score_gemma":0.0006136157,"teacher_disagreement_score":0.92347986,"about_ca_system_score_codex":0.000103534054,"about_ca_system_score_gemma":0.0005212546,"threshold_uncertainty_score":0.5557543},"labels":[],"label_agreement":null},{"id":"W2081776044","doi":"10.1007/s10878-008-9142-4","title":"Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Formal Methods in Verification","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Heuristics; Satisfiability; Cardinality (data modeling); Propositional formula; Computer science; Theory of computation; Propositional calculus; Boolean satisfiability problem; Algorithm; Propositional variable; Theoretical computer science; Mathematics; Discrete mathematics; Mathematical optimization","score_opus":0.053358679394723676,"score_gpt":0.30089530516683954,"score_spread":0.24753662577211588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081776044","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16255452,0.000027902748,0.83436704,0.00007837979,0.0025563634,0.00023307456,8.446687e-7,0.00001694985,0.000164915],"genre_scores_gemma":[0.3309772,0.000017288761,0.66884077,0.000025314966,0.00012093292,0.0000021128233,6.1581414e-7,0.000008308357,0.0000074335276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978633,0.00024098776,0.0009189117,0.00019370121,0.0005458771,0.00023722411],"domain_scores_gemma":[0.9982558,0.00012425482,0.00058001344,0.00031445452,0.00059079065,0.00013470046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014588019,0.00013922251,0.00031022597,0.00034362142,0.00011820709,0.00007758382,0.00054542307,0.00011312547,0.000009711253],"category_scores_gemma":[0.0010704928,0.00013884784,0.000062842344,0.0010147638,0.000041201733,0.0012278205,0.00009954872,0.00023784908,0.0000026362645],"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.000059677113,0.00016217037,0.004983586,0.000018159006,0.000007020388,0.000011665383,0.0009867776,0.97606593,0.00053128606,0.016536698,0.00007866364,0.00055834587],"study_design_scores_gemma":[0.001375377,0.00053706986,0.009330694,0.000075740674,0.000009672516,0.00014057901,0.000015464819,0.97879004,0.0019910499,0.0073102494,0.00020558591,0.00021849024],"about_ca_topic_score_codex":0.000029678891,"about_ca_topic_score_gemma":6.870942e-7,"teacher_disagreement_score":0.1684227,"about_ca_system_score_codex":0.00033078034,"about_ca_system_score_gemma":0.00032414406,"threshold_uncertainty_score":0.5662051},"labels":[],"label_agreement":null},{"id":"W2083833523","doi":"10.1007/s10878-009-9213-1","title":"An approximation algorithm for the k-level capacitated facility location problem","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":21,"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":"Facility location problem; Theory of computation; 1-center problem; Approximation algorithm; Combinatorics; Mathematics; Combinatorial optimization; Mathematical optimization; Supply chain management; Computer science; Discrete mathematics; Algorithm; Supply chain","score_opus":0.02788160282492381,"score_gpt":0.248890497160571,"score_spread":0.2210088943356472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083833523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013477969,0.00003116922,0.993495,0.0020681755,0.0020558478,0.0006722643,0.0000056383674,0.000042005326,0.0002821235],"genre_scores_gemma":[0.9078012,0.00003744696,0.08895041,0.00089578057,0.0019133886,0.000034227767,0.00027365662,0.000016423619,0.00007744569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870765,0.000027352131,0.0006022244,0.00013549544,0.00037959265,0.00014770174],"domain_scores_gemma":[0.9975981,0.000027395672,0.00041148264,0.00018560943,0.0017598541,0.000017531676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012497228,0.00013036309,0.000166055,0.00018497677,0.0002587728,0.00024989652,0.00026504206,0.000065664535,0.00004740423],"category_scores_gemma":[0.00019355078,0.000099534125,0.00008149128,0.0005368312,0.000025614081,0.0020061173,0.000011536933,0.00010322928,0.00000737287],"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.00011617254,0.00038538498,0.00003443446,0.00005529871,0.000034862565,2.5112317e-7,0.00013441971,0.87746674,0.00005097628,0.024895765,0.002240206,0.0945855],"study_design_scores_gemma":[0.0013262717,0.00011813978,0.0010613262,0.000016785338,0.00009192072,8.525032e-7,0.0002104819,0.9799412,0.000039465805,0.011886557,0.005175043,0.00013199651],"about_ca_topic_score_codex":0.000050902017,"about_ca_topic_score_gemma":0.0000027741987,"teacher_disagreement_score":0.90645343,"about_ca_system_score_codex":0.00007473849,"about_ca_system_score_gemma":0.00004334775,"threshold_uncertainty_score":0.40588838},"labels":[],"label_agreement":null},{"id":"W2085562535","doi":"10.1007/s10878-012-9475-x","title":"Coverage with k-transmitters in the presence of obstacles","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Computational Geometry and Mesh Generation","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; Carleton University","funders":"","keywords":"Transmitter; Cover (algebra); Combinatorics; Plane (geometry); Integer (computer science); Theory of computation; Line (geometry); Range (aeronautics); Upper and lower bounds; Mathematics; Computer science; Geometry; Telecommunications; Algorithm; Mathematical analysis","score_opus":0.008990101363827583,"score_gpt":0.2259723087213967,"score_spread":0.21698220735756912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085562535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075378254,0.00015206657,0.9225463,0.0004430884,0.0011899642,0.00009001583,3.1837547e-7,0.0000035984162,0.00019638009],"genre_scores_gemma":[0.95009,0.000033495682,0.049645565,0.00006085547,0.00016270978,0.0000012120497,0.0000010417821,0.0000025291884,0.0000026006312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900055,0.00014462332,0.00028958943,0.00005102562,0.0004171463,0.00009704495],"domain_scores_gemma":[0.99912316,0.00022285979,0.00029781167,0.00010589832,0.00021736344,0.00003289369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072180136,0.00005798683,0.00011105142,0.00013332315,0.000034022556,0.0000450386,0.0003228067,0.00002714468,0.0000046252367],"category_scores_gemma":[0.00007011924,0.000037549904,0.000034160832,0.0005294146,0.000018775705,0.0010535679,0.000014912187,0.00009404844,2.823018e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059498154,0.00022741494,0.0024459737,0.000009158093,0.000011429419,0.0000028205384,0.0018026738,0.91971123,0.00014395712,0.073733814,0.00013224527,0.0017197877],"study_design_scores_gemma":[0.015701454,0.0042056674,0.09890869,0.0005158072,0.0001565356,0.00051135605,0.00074122095,0.7988362,0.018742992,0.055864103,0.00483564,0.0009803713],"about_ca_topic_score_codex":0.0000028981897,"about_ca_topic_score_gemma":1.447348e-7,"teacher_disagreement_score":0.87471175,"about_ca_system_score_codex":0.00002577066,"about_ca_system_score_gemma":0.00008273178,"threshold_uncertainty_score":0.15312406},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012885135,0.000071869836,0.9926343,0.00021354923,0.004796506,0.0008446702,0.0000018571584,0.00011321943,0.000035499736],"genre_scores_gemma":[0.032445017,0.00004500635,0.9666787,0.000030084915,0.0006588617,0.00008995759,0.000020829004,0.000023132017,0.000008403312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980664,0.00017064594,0.0007609035,0.0002668342,0.00041952016,0.00031564783],"domain_scores_gemma":[0.9974551,0.00016101907,0.0008777716,0.00027254698,0.0010790678,0.00015448206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001132117,0.00020387785,0.0003057068,0.00058483623,0.0003786696,0.0009711463,0.0006065385,0.00012686913,0.0000058941446],"category_scores_gemma":[0.000120040684,0.00019061686,0.00018576729,0.00085485156,0.00005282599,0.0040556868,0.000060324972,0.00025114111,9.3927264e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045176883,0.00077285734,0.00008809759,0.00010743442,0.00011937749,0.0000019766223,0.0014882048,0.15197183,0.0015949603,0.042557098,0.00014467537,0.8011083],"study_design_scores_gemma":[0.0013088534,0.0009285496,0.000034765024,0.000054927015,0.000020976551,0.000032814172,0.00006222641,0.82174003,0.00047050675,0.1748736,0.0002811594,0.0001916157],"about_ca_topic_score_codex":0.00002550823,"about_ca_topic_score_gemma":4.706136e-7,"teacher_disagreement_score":0.8009167,"about_ca_system_score_codex":0.00010516024,"about_ca_system_score_gemma":0.000096940166,"threshold_uncertainty_score":0.9364786},"labels":[],"label_agreement":null},{"id":"W2087455919","doi":"10.1007/s10878-008-9150-4","title":"Packing trees in communication networks","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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 Guelph; Canadian Imperial Bank of Commerce (Canada); McMaster University","funders":"","keywords":"Mathematics; Solver; Linear programming relaxation; Approximation algorithm; Multicast; Integer programming; Theory of computation; Steiner tree problem; Combinatorics; Spanning tree; Relaxation (psychology); Tree (set theory); Independent set; Block (permutation group theory); Time complexity; k-minimum spanning tree; Linear programming; Discrete mathematics; Graph; Computer science; Mathematical optimization; Algorithm; Tree structure; Binary tree; K-ary tree","score_opus":0.018935291267582425,"score_gpt":0.27444761545684493,"score_spread":0.2555123241892625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087455919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0096682515,0.00039844651,0.9882054,0.00029670843,0.000893852,0.00008432178,7.538917e-8,0.000018977611,0.00043401212],"genre_scores_gemma":[0.88938546,0.00068047247,0.10979008,0.000023721479,0.00009969281,0.0000016190958,9.649016e-7,0.0000073884503,0.000010573335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866205,0.0003012613,0.00043085,0.00009229078,0.00035302926,0.00016049827],"domain_scores_gemma":[0.9986755,0.0002329308,0.00035927867,0.00030227576,0.0003659027,0.000064085725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008363646,0.0000772336,0.00018135141,0.00030318327,0.00012259692,0.000052756714,0.0007739884,0.0000658666,0.0000055858263],"category_scores_gemma":[0.00022385184,0.00007316235,0.000057761223,0.0007930225,0.00005732155,0.0012448741,0.00011264737,0.00031485417,9.104818e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004689994,0.00008469422,0.0015658252,9.76576e-7,0.0000062618324,0.000020972448,0.00031244673,0.9299923,0.00002513458,0.06682894,0.00008968511,0.0010258274],"study_design_scores_gemma":[0.0021742163,0.00023784295,0.0022646713,0.00007024759,0.0000033741069,0.00012097135,0.00003209698,0.9406192,0.00023285761,0.053899627,0.00020638193,0.00013852742],"about_ca_topic_score_codex":0.000002964275,"about_ca_topic_score_gemma":6.5647686e-7,"teacher_disagreement_score":0.87971723,"about_ca_system_score_codex":0.000097986514,"about_ca_system_score_gemma":0.00008734258,"threshold_uncertainty_score":0.2983474},"labels":[],"label_agreement":null},{"id":"W2088810319","doi":"10.1007/s10878-013-9614-z","title":"Generalized Canadian traveller problems","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":11,"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":"National Tsing Hua University; National Science Council","keywords":"Competitive analysis; Theory of computation; Combinatorics; Constant (computer programming); Upper and lower bounds; Bounded function; Online algorithm; Vertex (graph theory); Enhanced Data Rates for GSM Evolution; Computer science; Mathematics; Generalization; Discrete mathematics; Mathematical optimization; Graph; Algorithm; Telecommunications","score_opus":0.013212597777398477,"score_gpt":0.2240957758642578,"score_spread":0.21088317808685933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088810319","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089268846,0.0000913671,0.9860761,0.004329685,0.0036778708,0.00040427284,6.4369993e-7,0.00003913103,0.0044882516],"genre_scores_gemma":[0.29870978,0.00028996152,0.6988647,0.0008396737,0.0005510161,0.00002098797,0.000008799733,0.00003346739,0.0006815955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984717,0.00014177209,0.00053711166,0.00013525695,0.00043429103,0.00027988432],"domain_scores_gemma":[0.9978805,0.00003662764,0.00032507733,0.0002116814,0.0011358119,0.00041025708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004724387,0.00012117741,0.00021120494,0.00038879286,0.00013401256,0.00042330538,0.00063989504,0.00010340046,0.00041546018],"category_scores_gemma":[0.00010470933,0.0001040635,0.000087641885,0.00053747796,0.000024443169,0.0014787674,0.000040760264,0.0001895243,0.000040521285],"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.0000050384506,0.000080213635,0.00010182985,0.000007847273,0.000031246567,0.000005805915,0.00048631296,0.9065456,0.000117901014,0.080968335,0.00962259,0.002027313],"study_design_scores_gemma":[0.0021722503,0.0002771165,0.0001506386,0.00003065359,0.000008504367,0.000040167997,0.00001751136,0.97122675,0.00020521967,0.016447175,0.00921045,0.00021354432],"about_ca_topic_score_codex":0.001844694,"about_ca_topic_score_gemma":0.0000406465,"teacher_disagreement_score":0.29781708,"about_ca_system_score_codex":0.00014149975,"about_ca_system_score_gemma":0.0005376439,"threshold_uncertainty_score":0.4548998},"labels":[],"label_agreement":null},{"id":"W2093200602","doi":"10.1007/s10878-005-6857-3","title":"Clustering Binary Oligonucleotide Fingerprint Vectors for DNA Clone Classification Analysis","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Gene expression and cancer classification","field":"Biochemistry, Genetics and Molecular Biology","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 Alberta","funders":"","keywords":"Cluster analysis; Computer science; Pattern recognition (psychology); Computational biology; Data mining; Artificial intelligence; Mathematics; Biology","score_opus":0.014050185990246622,"score_gpt":0.27284609980497626,"score_spread":0.25879591381472966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093200602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18635023,0.00022593042,0.81063783,0.0008044408,0.0015468213,0.00020489002,0.000004323036,0.0000108924805,0.00021467358],"genre_scores_gemma":[0.96486527,0.00022306168,0.033547465,0.000074381336,0.0011044027,0.0000128928,0.00007046865,0.000018701065,0.00008335185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989645,0.0000642734,0.00048253156,0.00017476708,0.00018730677,0.00012662691],"domain_scores_gemma":[0.99868584,0.000017958446,0.0005731817,0.00020372374,0.00043657477,0.00008272347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035909994,0.00011269491,0.000195486,0.00024042139,0.0000895459,0.000044176035,0.00016973708,0.00012930365,0.000020507045],"category_scores_gemma":[0.00013987043,0.00010869263,0.00021800678,0.00031938148,0.000021592969,0.000022836903,0.000031096573,0.00007313366,0.0000010044486],"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.00045293334,0.0001496428,0.00049739913,0.000011323569,0.00021818693,2.5686035e-7,0.000059800594,0.68849725,0.3053814,0.00027949444,0.0017086022,0.0027437417],"study_design_scores_gemma":[0.0048118485,0.0011937653,0.009103964,0.00005421321,0.00086219364,0.00001329201,0.00021061416,0.72410476,0.20858909,0.00016852617,0.050368648,0.00051907584],"about_ca_topic_score_codex":9.3070577e-7,"about_ca_topic_score_gemma":8.55124e-7,"teacher_disagreement_score":0.77851504,"about_ca_system_score_codex":0.00007408125,"about_ca_system_score_gemma":0.00009242334,"threshold_uncertainty_score":0.44323567},"labels":[],"label_agreement":null},{"id":"W2093224514","doi":"10.1007/s10878-005-1778-8","title":"Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices","year":2005,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","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":"McMaster University","funders":"","keywords":"Travelling salesman problem; Theory of computation; Scheduling (production processes); Mathematics; Computer science; Implementation; Combinatorics; Mathematical optimization; Algorithm","score_opus":0.015425101370619199,"score_gpt":0.2412177868623189,"score_spread":0.2257926854916997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093224514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023233064,0.00028021587,0.95718545,0.0036959765,0.007266866,0.00083919935,0.0000038079565,0.000073093805,0.007422341],"genre_scores_gemma":[0.65428907,0.0001993364,0.34322852,0.0001133203,0.0019653426,0.0000026340044,0.0000023642174,0.000024386596,0.00017500856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976575,0.00021714185,0.00088294514,0.00019705722,0.00078585936,0.0002595386],"domain_scores_gemma":[0.9975929,0.00017134869,0.0010477724,0.00029930545,0.0007600244,0.0001286512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007336813,0.00018084727,0.00033299948,0.00023289691,0.00022450487,0.00023375842,0.0009668889,0.00012505795,0.000047018522],"category_scores_gemma":[0.00018139846,0.00013663838,0.00018376349,0.0006950668,0.000053339976,0.0009233813,0.00012051452,0.00034177114,0.000005171157],"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.00007863035,0.00036877356,0.000098813965,0.00001987705,0.000020676693,0.0000048566185,0.00046000764,0.9820893,0.00030794562,0.015445494,0.00047679886,0.00062884984],"study_design_scores_gemma":[0.0031971459,0.00073422585,0.00009655448,0.00016308986,0.000044588454,0.000047267455,0.000058916936,0.9874484,0.0057723275,0.0013201818,0.00088025077,0.00023705467],"about_ca_topic_score_codex":0.0000064582555,"about_ca_topic_score_gemma":0.0000013759401,"teacher_disagreement_score":0.631056,"about_ca_system_score_codex":0.00013835171,"about_ca_system_score_gemma":0.0004332616,"threshold_uncertainty_score":0.5571952},"labels":[],"label_agreement":null},{"id":"W2104070086","doi":"10.1007/s10878-012-9462-2","title":"Finding paths with minimum shared edges","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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":"Carleton University","funders":"","keywords":"Disjoint sets; Heuristics; Theory of computation; Combinatorics; Mathematics; Approximation algorithm; Generalization; Graph; Maximum flow problem; Constant (computer programming); Discrete mathematics; Computer science; Algorithm; Mathematical optimization","score_opus":0.021607571279802694,"score_gpt":0.2802607690312165,"score_spread":0.2586531977514138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104070086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008126068,0.00021443814,0.9876491,0.00024076102,0.0029974726,0.00010819532,6.3490353e-7,0.000028250466,0.00063510146],"genre_scores_gemma":[0.75640285,0.000031189993,0.24293028,0.000028120447,0.00054724,0.0000025595298,0.0000012393336,0.000014486504,0.000042018808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985791,0.0001419364,0.00031427748,0.00010322129,0.00056573254,0.00029577038],"domain_scores_gemma":[0.99852395,0.00017757379,0.00039923625,0.00022069526,0.0004917855,0.00018673309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008313355,0.00010990527,0.00019507106,0.00025640478,0.00011584362,0.00013575121,0.00057905965,0.00005994598,0.000023332892],"category_scores_gemma":[0.00022305235,0.000085211366,0.000060435836,0.00058986095,0.00003820795,0.0025246353,0.00009366424,0.00021781979,0.0000048880524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009164387,0.0011672629,0.012201127,0.000059091755,0.00021915104,0.00008312896,0.0045392206,0.31619316,0.0017412791,0.6474009,0.0025366573,0.0129425535],"study_design_scores_gemma":[0.043833088,0.013890547,0.011004148,0.0016136722,0.0003554005,0.0025201822,0.0013749542,0.5204754,0.06979055,0.30748165,0.023460025,0.0042004264],"about_ca_topic_score_codex":3.4522733e-7,"about_ca_topic_score_gemma":2.3187814e-8,"teacher_disagreement_score":0.74827677,"about_ca_system_score_codex":0.00008180528,"about_ca_system_score_gemma":0.000105556624,"threshold_uncertainty_score":0.34748185},"labels":[],"label_agreement":null},{"id":"W2108310473","doi":"10.1023/a:1009859026994","title":"Graph Algorithms with Small Communication Costs","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Computational Geometry and Mesh Generation","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Theory of computation; Focus (optics); Shortest path problem; Parallel algorithm; Theoretical computer science; Cost efficiency; Graph theory; Communication complexity; Mathematical optimization; Graph; Algorithm; Parallel computing; Mathematics","score_opus":0.009833638694845234,"score_gpt":0.22079303252200846,"score_spread":0.21095939382716322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108310473","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00793347,0.00021827496,0.988638,0.0006550012,0.0008125282,0.000114460636,5.561743e-7,0.00003336139,0.0015943872],"genre_scores_gemma":[0.20375055,0.00033505517,0.7953225,0.00014821012,0.000290144,0.000003739255,0.000015627282,0.0000113148435,0.00012286265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988328,0.00015157726,0.00039386962,0.000120530174,0.00038470226,0.0001164722],"domain_scores_gemma":[0.9985485,0.000101880425,0.00033878375,0.00024802546,0.0006736211,0.000089206245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047332296,0.00010603012,0.00016501851,0.00020134545,0.00014889291,0.00018549553,0.0005000698,0.000059117803,0.000054724962],"category_scores_gemma":[0.00003377568,0.000090211426,0.000059795846,0.0007339766,0.00002715582,0.00089006434,0.000027540178,0.00015489799,0.0000055676956],"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.00008481308,0.00015945686,0.000037000016,0.0000030271747,0.000030802712,0.000006206974,0.00016671226,0.9070481,0.00002303528,0.027956689,0.00035598897,0.064128175],"study_design_scores_gemma":[0.006795771,0.0019189084,0.0009090464,0.00017712996,0.0000785107,0.00043988376,0.000037734433,0.94245356,0.0019022808,0.030684324,0.014059013,0.00054383365],"about_ca_topic_score_codex":0.0000058536907,"about_ca_topic_score_gemma":5.848806e-7,"teacher_disagreement_score":0.19581707,"about_ca_system_score_codex":0.00007802907,"about_ca_system_score_gemma":0.00014124696,"threshold_uncertainty_score":0.3678715},"labels":[],"label_agreement":null},{"id":"W2113634042","doi":"10.1007/s10878-012-9590-8","title":"The edge-centered surface area of the arrangement graph","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Interconnection Networks and Systems","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":"Brock University","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Vertex (graph theory); Surface (topology); Interconnection; Edge cover; Graph; Theory of computation; Mathematics; Combinatorics; Edge contraction; Geometry; Computer science; Line graph; Voltage graph; Algorithm; Telecommunications","score_opus":0.011125182015517042,"score_gpt":0.2056278399757366,"score_spread":0.19450265796021957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113634042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02920435,0.00029667094,0.928856,0.0034230861,0.03632993,0.00048550358,4.875439e-7,0.000016517419,0.0013874212],"genre_scores_gemma":[0.99639404,0.00006140653,0.0030943064,0.000049284397,0.0002691034,0.0000027300925,1.6948742e-7,0.000005402025,0.00012357344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986769,0.00020288181,0.0005368293,0.00007345812,0.00038960695,0.000120343306],"domain_scores_gemma":[0.9980013,0.00012223043,0.0007511223,0.00027440808,0.000809413,0.000041528507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006221783,0.00007792065,0.00015281356,0.000036447793,0.00018411086,0.0002011341,0.00074279204,0.000044994027,0.00001528551],"category_scores_gemma":[0.00006922129,0.000040811043,0.00014744043,0.00031254697,0.000034536995,0.00040682012,0.00007911028,0.00012823024,0.0000018062098],"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.00004692646,0.00018485455,0.00088442693,0.000012041201,0.0001234396,9.549041e-7,0.0007067944,0.88931006,0.00046360822,0.07170032,0.035082266,0.0014842835],"study_design_scores_gemma":[0.0031514415,0.00062737893,0.0013136927,0.00026316714,0.0000388568,0.00005050704,0.00028488005,0.9585174,0.0024657324,0.022588242,0.010462955,0.00023579242],"about_ca_topic_score_codex":0.000012725693,"about_ca_topic_score_gemma":7.5171397e-7,"teacher_disagreement_score":0.96718967,"about_ca_system_score_codex":0.000048496306,"about_ca_system_score_gemma":0.000054277665,"threshold_uncertainty_score":0.19395408},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049613267,0.000028007104,0.9879391,0.002431826,0.0039608167,0.00016970294,9.486333e-7,0.000040586223,0.00046769177],"genre_scores_gemma":[0.8414066,0.000060195496,0.15687314,0.0011288356,0.00048940483,0.000008544741,0.0000023044947,0.000021709904,0.000009262853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863595,0.00011492061,0.00034843013,0.00018034954,0.0005512044,0.0001691243],"domain_scores_gemma":[0.99880236,0.00025042752,0.00037419065,0.00025329133,0.00023451108,0.00008523315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007405863,0.00015001626,0.00018920924,0.00026431822,0.0003158328,0.00025788657,0.000417974,0.00007445179,0.000008681693],"category_scores_gemma":[0.00011103137,0.00010790567,0.00010327091,0.00050851423,0.0000631202,0.00041464684,0.000054496682,0.00031333705,0.0000015875547],"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.00009995332,0.0001801337,0.000008193223,0.000005166678,0.000017468543,0.000008809575,0.00007919567,0.6068959,0.000013343536,0.39126953,0.000101210324,0.0013210884],"study_design_scores_gemma":[0.0025679,0.0015257567,0.00011420058,0.0001162904,0.000021241187,0.00002655003,0.00001767848,0.62565297,0.0005722026,0.3690809,0.00015010027,0.00015423255],"about_ca_topic_score_codex":0.000003408626,"about_ca_topic_score_gemma":1.6932624e-7,"teacher_disagreement_score":0.8364453,"about_ca_system_score_codex":0.00008135234,"about_ca_system_score_gemma":0.00008703222,"threshold_uncertainty_score":0.44002652},"labels":[],"label_agreement":null},{"id":"W2141410486","doi":"10.1007/s10878-006-9019-3","title":"On edge orienting methods for graph coloring","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Digraph; Graph coloring; Edge coloring; Tabu search; Theory of computation; Fractional coloring; Mathematics; Graph; Combinatorics; Computer science; Theoretical computer science; Discrete mathematics; Algorithm; Line graph; Graph power","score_opus":0.07129417282979277,"score_gpt":0.4222655733320862,"score_spread":0.3509714005022934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141410486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01076601,0.00010922188,0.9749966,0.00030443375,0.0123637095,0.00013061885,0.0000018798827,0.000019416495,0.001308056],"genre_scores_gemma":[0.26508647,0.000005536499,0.7334011,0.000033684588,0.0012135232,0.0000049376454,0.0000030651688,0.000015763917,0.0002358985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976034,0.0002922441,0.0010138782,0.00018091981,0.0006975906,0.00021194931],"domain_scores_gemma":[0.99354255,0.0033699754,0.0010589691,0.00019636669,0.0017535819,0.000078549456],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0075489692,0.00010967111,0.00032705616,0.000575002,0.00031964763,0.00028723638,0.00035592305,0.00009644851,0.00003728111],"category_scores_gemma":[0.010938686,0.00008581145,0.00026461747,0.0010173403,0.00003632853,0.0003830212,0.000025415493,0.00017136463,0.0000052576365],"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.00014034424,0.00013896957,0.00019220672,0.0000017306845,0.000017984183,8.227966e-7,0.000040708037,0.8464494,0.00017023171,0.14803931,0.002546395,0.0022619062],"study_design_scores_gemma":[0.0028913664,0.00053743564,0.00019320175,0.000046103214,0.000088449415,0.000013531141,0.000081673905,0.21973047,0.00275106,0.7626322,0.010852305,0.00018220839],"about_ca_topic_score_codex":0.0000049125206,"about_ca_topic_score_gemma":1.6499777e-7,"teacher_disagreement_score":0.62671894,"about_ca_system_score_codex":0.00006737349,"about_ca_system_score_gemma":0.00012556667,"threshold_uncertainty_score":0.9973926},"labels":[],"label_agreement":null},{"id":"W2143633463","doi":"10.1007/s10878-014-9712-6","title":"Zero-visibility cops and robber and the pathwidth of a graph","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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 Regina; Memorial University of Newfoundland","funders":"Narodowe Centrum Nauki","keywords":"Bounded function; Monotonic function; Visibility; Theory of computation; Pathwidth; Mathematics; Zero (linguistics); Discrete mathematics; Visibility graph; Graph; Combinatorics; Line graph; Algorithm; Mathematical analysis; Physics","score_opus":0.006789592392098764,"score_gpt":0.24293138834825068,"score_spread":0.23614179595615192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143633463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04002545,0.00021768968,0.9583136,0.0004518728,0.0006651871,0.00013698856,4.1870288e-7,0.0000075653843,0.00018125781],"genre_scores_gemma":[0.9503626,0.00015019561,0.04937921,0.000034652956,0.00006191546,0.0000012241371,2.025981e-7,0.0000051200163,0.000004862659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985935,0.00044972726,0.0003706472,0.00012051918,0.00035477558,0.00011082523],"domain_scores_gemma":[0.99825513,0.000574274,0.00039169798,0.00024046461,0.00046619694,0.000072254836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002392001,0.0000792419,0.00024706806,0.00011852145,0.000090027126,0.00007613021,0.00033877813,0.000046065154,0.0000019462643],"category_scores_gemma":[0.000576012,0.000050933915,0.000055733723,0.0003250985,0.00025981377,0.0005113614,0.00013473751,0.00016843819,1.2773987e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004326013,0.00007993017,0.0012820925,0.00002252655,0.000030877512,0.0000014586954,0.0005455123,0.030503549,0.00013776378,0.9615262,0.000051193325,0.0053862776],"study_design_scores_gemma":[0.005193233,0.00043457703,0.00075179443,0.000032397424,0.000016135455,0.000035266883,0.000020050089,0.12968598,0.00050331606,0.86312824,0.00011829647,0.00008069648],"about_ca_topic_score_codex":0.0000026012603,"about_ca_topic_score_gemma":1.04456156e-7,"teacher_disagreement_score":0.91033715,"about_ca_system_score_codex":0.000012398884,"about_ca_system_score_gemma":0.000039359496,"threshold_uncertainty_score":0.20770247},"labels":[],"label_agreement":null},{"id":"W2211969678","doi":"10.1007/s10878-015-9915-5","title":"Towards the price of leasing online","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","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":"Simon Fraser University","funders":"Deutsche Forschungsgemeinschaft; Deutscher Akademischer Austauschdienst","keywords":"Theory of computation; Order (exchange); Set cover problem; Integer programming; Online algorithm; Computer science; Integer (computer science); Randomized rounding; Operations research; Set (abstract data type); Mathematical economics; Facility location problem; Service (business); Mathematics; Combinatorics; Approximation algorithm; Economics; Algorithm; Business; Marketing; Finance","score_opus":0.04894002924072742,"score_gpt":0.2914331280640873,"score_spread":0.24249309882335984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2211969678","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011827823,0.00013317658,0.99169147,0.0028227335,0.0027082264,0.000107089494,6.900277e-7,0.00001643661,0.0013373732],"genre_scores_gemma":[0.37469327,0.00012792666,0.62443894,0.00018585591,0.00047357232,0.0000010157721,0.00000308754,0.000013222669,0.000063117885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842775,0.00019916349,0.0005069735,0.000079424,0.0006657359,0.00012095998],"domain_scores_gemma":[0.9973953,0.000077564844,0.0006065996,0.00020748013,0.0015939444,0.000119108736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001182563,0.000077383535,0.0001837241,0.00013555345,0.00007087592,0.00014530389,0.00069622946,0.000052353123,0.000008334252],"category_scores_gemma":[0.0006085757,0.000052220592,0.000070019574,0.00059726206,0.000052951786,0.0007542818,0.000107335436,0.00017303479,0.0000010748905],"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.000041383133,0.000195924,0.00005700784,0.000006645144,0.00002087274,0.0000028867871,0.0010832646,0.9354973,0.000033933688,0.059648573,0.0010372853,0.0023749368],"study_design_scores_gemma":[0.002318894,0.0006120329,0.00009778821,0.00005143943,0.000016256221,0.000047719368,0.00014132769,0.9772213,0.0005697016,0.014605492,0.0042072725,0.000110778514],"about_ca_topic_score_codex":0.000006477958,"about_ca_topic_score_gemma":1.2118589e-7,"teacher_disagreement_score":0.37351048,"about_ca_system_score_codex":0.00006816941,"about_ca_system_score_gemma":0.00060641137,"threshold_uncertainty_score":0.2129494},"labels":[],"label_agreement":null},{"id":"W2435530825","doi":"10.1007/s10878-016-0044-6","title":"Approximation algorithms for precedence-constrained identical machine scheduling with rejection","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":27,"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":"Theory of computation; Rounding; Submodular set function; Computer science; Job shop scheduling; Scheduling (production processes); Approximation algorithm; Mathematical optimization; Linear programming; Algorithm; Mathematics","score_opus":0.011674666186575705,"score_gpt":0.2380949645483972,"score_spread":0.2264202983618215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2435530825","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031710626,0.00010826983,0.99278504,0.00021685309,0.0031967477,0.00025792455,0.0000068831,0.00012171376,0.00013551075],"genre_scores_gemma":[0.20564032,0.00014598892,0.7933742,0.000009612839,0.0007303126,0.000015271748,0.000012298207,0.00004710299,0.000024913397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986739,0.00004467344,0.00062342314,0.00012641217,0.00034246946,0.00018912034],"domain_scores_gemma":[0.99861735,0.00016867202,0.00030442225,0.00011071065,0.00068872067,0.000110133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005792449,0.00016780755,0.0002618694,0.00023138133,0.00009108523,0.0000862644,0.00012842075,0.00013500854,0.000033301618],"category_scores_gemma":[0.00036862024,0.000116746705,0.00008969411,0.00029127073,0.000042462918,0.00068653806,0.000008006221,0.00013062965,0.0000019220479],"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.0001952397,0.000053220414,0.000050647468,0.000030804094,0.00007441279,0.0000019369734,0.000058404006,0.98945165,0.00053641526,0.0014873209,0.000023443925,0.008036516],"study_design_scores_gemma":[0.0042105797,0.00041088203,0.000015644408,0.00019180881,0.00007946313,0.00008054566,0.00004124639,0.98826146,0.0049514985,0.0014961261,0.00006737876,0.000193337],"about_ca_topic_score_codex":6.906809e-7,"about_ca_topic_score_gemma":1.7998417e-7,"teacher_disagreement_score":0.20246924,"about_ca_system_score_codex":0.00014881215,"about_ca_system_score_gemma":0.00007174522,"threshold_uncertainty_score":0.47607926},"labels":[],"label_agreement":null},{"id":"W2464795612","doi":"10.1007/s10878-018-0281-y","title":"Optimum turn-restricted paths, nested compatibility, and optimum convex polygons","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Theory of computation; Compatibility (geochemistry); Cutting-plane method; Regular polygon; Mathematical optimization; Combinatorics; Integer programming; Algorithm; Geometry","score_opus":0.013462062895030939,"score_gpt":0.2613608915506082,"score_spread":0.24789882865557727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464795612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1767209,0.00035611563,0.8120822,0.00024249178,0.008568142,0.00039223337,0.000012141966,0.000302967,0.0013228087],"genre_scores_gemma":[0.73246145,0.00016117113,0.26635498,0.000040260857,0.00088346866,0.0000024974725,0.000012392445,0.00006617303,0.0000176276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977541,0.00027879578,0.0009991,0.00019974807,0.0004506342,0.0003176543],"domain_scores_gemma":[0.9976638,0.0002673074,0.0004651103,0.00027833684,0.001063132,0.00026229123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075207005,0.0002824437,0.0005387263,0.00036199836,0.00016807776,0.0001721154,0.00027368066,0.00025153274,0.00009877647],"category_scores_gemma":[0.0005987437,0.00028187942,0.00009758153,0.0007591706,0.00016092621,0.00059814664,0.000067911256,0.0003966065,0.000004974376],"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.000117032774,0.000106123094,0.0016685136,0.00003782767,0.00009488672,0.000009527177,0.00043232978,0.99357754,0.0011006375,0.0008261983,0.0010308451,0.000998517],"study_design_scores_gemma":[0.002873867,0.0005217673,0.002037068,0.000087014436,0.00010344616,0.00009008652,0.00007354196,0.9909204,0.0018245782,0.0006676734,0.00047279807,0.00032771347],"about_ca_topic_score_codex":0.000005975561,"about_ca_topic_score_gemma":3.2086652e-7,"teacher_disagreement_score":0.55574054,"about_ca_system_score_codex":0.00015392751,"about_ca_system_score_gemma":0.00011061868,"threshold_uncertainty_score":0.99996334},"labels":[],"label_agreement":null},{"id":"W2513559281","doi":"10.1007/s10878-016-0079-8","title":"On the online multi-agent O–D k-Canadian Traveler Problem","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":21,"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":"Disjoint sets; Computer science; Focus (optics); Theory of computation; Graph; A priori and a posteriori; Enhanced Data Rates for GSM Evolution; Node (physics); Competitive analysis; Combinatorics; Theoretical computer science; Mathematics; Upper and lower bounds; Artificial intelligence; Algorithm","score_opus":0.026356182436590086,"score_gpt":0.2547440991462963,"score_spread":0.22838791670970623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513559281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047494072,0.000020362484,0.9793867,0.016951714,0.0020266229,0.0002498068,0.0000037419152,0.000023720031,0.0008624191],"genre_scores_gemma":[0.5095323,0.00031638745,0.48676494,0.0018773909,0.0005367285,0.00001075854,0.000004376613,0.00003950434,0.0009176325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984496,0.00021028437,0.0004589932,0.00014440595,0.0004883524,0.00024832255],"domain_scores_gemma":[0.99832076,0.00017107363,0.00033294887,0.00026789823,0.000654121,0.00025321226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007865075,0.00012395148,0.00016041861,0.00026124285,0.00016844105,0.00016453228,0.00077083043,0.00007956372,0.00014847987],"category_scores_gemma":[0.00032983813,0.0000645117,0.00009213024,0.00038934549,0.00003875685,0.0005713632,0.000044818975,0.00018028285,0.000023613562],"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.000051088282,0.0005281401,0.00008963898,0.0000062401878,0.000051474013,0.000021309954,0.000508977,0.3671167,0.00019861452,0.61081266,0.008053963,0.012561187],"study_design_scores_gemma":[0.009646433,0.0018922177,0.00057490467,0.0004032884,0.00003258165,0.000074726144,0.000060625825,0.90773034,0.0008676885,0.051242534,0.026849346,0.0006253157],"about_ca_topic_score_codex":0.000055310156,"about_ca_topic_score_gemma":0.000029298155,"teacher_disagreement_score":0.55957013,"about_ca_system_score_codex":0.00019399603,"about_ca_system_score_gemma":0.00042045937,"threshold_uncertainty_score":0.2630711},"labels":[],"label_agreement":null},{"id":"W2521482842","doi":"10.1007/s10878-016-0080-2","title":"An approximation algorithm for k-facility location problem with linear penalties using local search scheme","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Facility location problem; Theory of computation; Zhàng; Local search (optimization); Extension (predicate logic); Approximation algorithm; Algorithm; Scheme (mathematics); Mathematics; 1-center problem; Computer science; Contrast (vision); Mathematical optimization; Combinatorics; Artificial intelligence","score_opus":0.026248234243784658,"score_gpt":0.26137359800469606,"score_spread":0.2351253637609114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521482842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014113251,0.000013415688,0.9839106,0.0004919512,0.00082532543,0.0005273697,0.0000046594355,0.00003895298,0.000074467745],"genre_scores_gemma":[0.6827602,0.000015888812,0.31561765,0.00010349775,0.0013317227,0.000021229494,0.00007828265,0.000027661054,0.00004390686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984621,0.000036705143,0.0005830543,0.00019361034,0.0005253105,0.0001992445],"domain_scores_gemma":[0.9968939,0.000024072022,0.0003511001,0.00017664957,0.002523844,0.000030447241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001177231,0.00015618339,0.00021868225,0.00029517323,0.00019138138,0.000139764,0.00019976383,0.00007631343,0.00007361344],"category_scores_gemma":[0.000088421024,0.000109496716,0.00006202965,0.00046416186,0.00007161704,0.0029823966,0.0000309612,0.000080816724,0.0000075388084],"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.00043281412,0.0003826256,0.0004842778,0.00025050086,0.000057420835,7.843677e-7,0.00007553878,0.9501212,0.0002819459,0.009539437,0.0001469845,0.038226426],"study_design_scores_gemma":[0.0024581882,0.00017754256,0.00011523328,0.000096072545,0.000065543594,0.0000020933783,0.0002343111,0.99391174,0.00033210593,0.0012817085,0.0011466035,0.00017887223],"about_ca_topic_score_codex":0.000086866276,"about_ca_topic_score_gemma":0.000004301396,"teacher_disagreement_score":0.6686469,"about_ca_system_score_codex":0.00016541648,"about_ca_system_score_gemma":0.00011744931,"threshold_uncertainty_score":0.44651467},"labels":[],"label_agreement":null},{"id":"W2567527899","doi":"10.1007/s10878-016-0107-8","title":"Is there any polynomial upper bound for the universal labeling of graphs?","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Graph Labeling and Dimension Problems","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":"Carleton University","funders":"","keywords":"Graph; Upper and lower bounds; Edge-graceful labeling; Graph labeling; Bound graph; Theory of computation; Complement graph; Time complexity","score_opus":0.012562332345063607,"score_gpt":0.23358023687300947,"score_spread":0.22101790452794587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567527899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0333217,0.00088994147,0.9495563,0.007576619,0.008279381,0.00023631412,0.0000060018806,0.000027789576,0.000105938256],"genre_scores_gemma":[0.9237513,0.00026753187,0.075644,0.00014798291,0.00010634838,0.0000015475883,3.6309171e-7,0.000013098083,0.00006784126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989494,0.00006110705,0.00041971685,0.00011344494,0.00031003117,0.00014631022],"domain_scores_gemma":[0.99804413,0.0003437448,0.00056863215,0.00022137737,0.0007476633,0.000074431184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067384786,0.00009418465,0.00018331806,0.00014665157,0.00014567446,0.00007106295,0.00050720363,0.00007394146,0.000013950852],"category_scores_gemma":[0.00018327504,0.000051692823,0.0001656959,0.0002831678,0.00006659534,0.00050777866,0.000053516713,0.00007598106,8.058804e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060570793,0.0003681732,0.0020601328,0.000036705682,0.00038154586,0.000004971436,0.0013479526,0.05741605,0.013958959,0.8972253,0.020334497,0.0062599625],"study_design_scores_gemma":[0.024760926,0.0031939277,0.00048924144,0.00078314147,0.0003805899,0.00007205777,0.0002483233,0.2056333,0.041398585,0.7106303,0.011654777,0.0007548212],"about_ca_topic_score_codex":0.0000071501076,"about_ca_topic_score_gemma":1.188124e-7,"teacher_disagreement_score":0.89042956,"about_ca_system_score_codex":0.000030799554,"about_ca_system_score_gemma":0.00018684652,"threshold_uncertainty_score":0.21079722},"labels":[],"label_agreement":null},{"id":"W2615340271","doi":"10.1007/s10878-020-00588-y","title":"A class of exponential neighbourhoods for the quadratic travelling salesman problem","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorial Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamiltonian path; Combinatorics; Travelling salesman problem; Mathematics; Quadratic equation; Digraph; Exponential function; Rank (graph theory); Heuristics; Discrete mathematics; Time complexity; Shortest path problem; Graph; Mathematical optimization; Mathematical analysis","score_opus":0.02603628727455053,"score_gpt":0.2718217439551514,"score_spread":0.24578545668060087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615340271","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009225056,0.0004325925,0.9885948,0.0004526672,0.008464465,0.0008179355,0.000018399958,0.00007432578,0.00022231854],"genre_scores_gemma":[0.40480182,0.00044856625,0.5928011,0.000018821664,0.0017368447,0.000029098048,0.000031395128,0.00012442395,0.000007942904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99721926,0.00022974591,0.0016015718,0.0001910186,0.0005297282,0.0002286452],"domain_scores_gemma":[0.996764,0.00061783736,0.0014169839,0.0002865163,0.0008004451,0.000114188944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012975092,0.00032654803,0.00078644627,0.00021217598,0.00009801871,0.00013857688,0.000594368,0.00039576253,0.000023575645],"category_scores_gemma":[0.00045794708,0.0002805991,0.00042334598,0.00030701602,0.000052224474,0.00017313313,0.00010126766,0.0008352393,4.7210412e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014291966,0.000053790176,0.000015631977,0.0005390737,0.00033577633,0.0000016205485,0.00075612403,0.9935415,0.0004989662,0.0029835694,0.00033296554,0.00079811167],"study_design_scores_gemma":[0.001702482,0.00019965989,0.0000150579845,0.00033595986,0.00045335392,0.000008331004,0.00007159974,0.98715866,0.0021983143,0.007407746,0.00020336683,0.00024545728],"about_ca_topic_score_codex":0.000002689417,"about_ca_topic_score_gemma":1.7966909e-7,"teacher_disagreement_score":0.4038793,"about_ca_system_score_codex":0.00015356684,"about_ca_system_score_gemma":0.00027707499,"threshold_uncertainty_score":0.9999646},"labels":[],"label_agreement":null},{"id":"W2755780781","doi":"10.1007/s10878-012-9452-4","title":"Some variations on constrained minimum enclosing circle problem","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":36,"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; Theory of computation; Space (punctuation); Computational geometry; Set (abstract data type); Time complexity; Algorithm; Discrete mathematics; Computer science","score_opus":0.011808940651114049,"score_gpt":0.2434845912251584,"score_spread":0.23167565057404435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755780781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004098414,0.00013747039,0.98685783,0.00078259123,0.007110931,0.00013612547,0.0000011138346,0.000033230735,0.0008422736],"genre_scores_gemma":[0.7572695,0.000020541003,0.24071477,0.00016233211,0.0017933035,0.000002501257,0.0000060616135,0.0000073263163,0.000023675204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986264,0.00013293694,0.0004811879,0.000108035194,0.00046119277,0.00019025001],"domain_scores_gemma":[0.99858177,0.00019658722,0.00049686996,0.00013793312,0.00044605194,0.00014081705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007423242,0.00010222684,0.00016725887,0.00028951632,0.00016170998,0.0001448015,0.00026008254,0.00007257888,0.000017410168],"category_scores_gemma":[0.00018922143,0.00010404201,0.000082829014,0.00048319326,0.000018080009,0.0018925705,0.000038486385,0.00014521038,0.000008404339],"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.000025186055,0.0003624974,0.000048989183,0.000006310185,0.000029861707,0.0000018280238,0.0003896802,0.49497694,0.0006337451,0.4988051,0.0005752592,0.004144595],"study_design_scores_gemma":[0.0057709827,0.001527766,0.0016512156,0.00015939902,0.00010048022,0.00021421706,0.00005516461,0.8212391,0.008282286,0.15694895,0.0034002082,0.000650223],"about_ca_topic_score_codex":6.561642e-7,"about_ca_topic_score_gemma":1.187146e-8,"teacher_disagreement_score":0.7531711,"about_ca_system_score_codex":0.00010054832,"about_ca_system_score_gemma":0.00019055406,"threshold_uncertainty_score":0.42427102},"labels":[],"label_agreement":null},{"id":"W2759640845","doi":"10.1007/s10878-017-0179-0","title":"A local search approximation algorithm for the uniform capacitated k-facility location problem","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Facility location problem; Theory of computation; Constraint (computer-aided design); Set (abstract data type); Cardinality (data modeling); Computer science; Approximation algorithm; Mathematical optimization; 1-center problem; Combinatorial optimization; Local search (optimization); Total cost; Service (business); Algorithm; Mathematics; Database","score_opus":0.028842919533698698,"score_gpt":0.25760099709944384,"score_spread":0.22875807756574515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759640845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009819363,0.000025591884,0.9918041,0.0027232578,0.0028563186,0.000751852,0.000004701822,0.000025991398,0.00082620705],"genre_scores_gemma":[0.97056293,0.00005090493,0.027594531,0.00020192863,0.001252219,0.00005051194,0.000101461526,0.000019951784,0.00016558323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859643,0.000021728727,0.00057733525,0.00014108706,0.00048068358,0.00018272796],"domain_scores_gemma":[0.996821,0.00004085918,0.0005640336,0.0003295311,0.0022259732,0.00001864432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018771859,0.00013423823,0.00018555284,0.00016252679,0.00085010874,0.0005776275,0.00048785892,0.00007506526,0.000059998314],"category_scores_gemma":[0.00037247283,0.0001009035,0.00010354893,0.00024126272,0.00011229076,0.0021478473,0.00007772928,0.00014779049,0.000015508496],"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.00015018563,0.00018855574,0.00010510415,0.00017968199,0.00007600272,5.4427375e-7,0.00011836892,0.89680606,0.000008061302,0.025620861,0.00179222,0.07495437],"study_design_scores_gemma":[0.0016282845,0.000046823403,0.00059638906,0.00003147522,0.000091489645,0.0000010209486,0.00033339745,0.9846468,0.000043735294,0.0044798306,0.007980903,0.00011982856],"about_ca_topic_score_codex":0.00032223147,"about_ca_topic_score_gemma":0.000013066599,"teacher_disagreement_score":0.96958095,"about_ca_system_score_codex":0.00011913456,"about_ca_system_score_gemma":0.000077163495,"threshold_uncertainty_score":0.6538435},"labels":[],"label_agreement":null},{"id":"W2769085521","doi":"10.1007/s10878-017-0213-2","title":"A quadratic time exact algorithm for continuous connected 2-facility location problem in trees","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Brock University","funders":"","keywords":"Combinatorics; Mathematics; Tree (set theory); Physics; Discrete mathematics","score_opus":0.014817847499789876,"score_gpt":0.24140757804933563,"score_spread":0.22658973054954576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769085521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08396345,0.00012950203,0.890024,0.0056619584,0.010858146,0.0035403492,0.000023091727,0.00014742877,0.0056520877],"genre_scores_gemma":[0.97987765,0.00002402612,0.018395655,0.0001606143,0.0010660805,0.000045203527,0.00010411075,0.000022310502,0.00030436972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856216,0.000030597494,0.00075238297,0.00016821324,0.00030420264,0.00018243179],"domain_scores_gemma":[0.9977699,0.000038670638,0.00073247537,0.0002600748,0.0011798507,0.000019035042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001203323,0.00015103816,0.0003475646,0.00027822674,0.00025936487,0.00042722322,0.00034526124,0.00008336419,0.00014023909],"category_scores_gemma":[0.0009217707,0.00014469844,0.000098135024,0.00022170476,0.00004325606,0.0019468958,0.000054506232,0.00010520848,0.000024613184],"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.0008662694,0.0017836093,0.005908393,0.00058321306,0.00020731686,0.000011730762,0.0003245354,0.8976089,0.00020275668,0.017231492,0.008917086,0.06635474],"study_design_scores_gemma":[0.0045451685,0.0001049414,0.005058747,0.00010357037,0.000086994776,0.000001076652,0.00009743941,0.97979146,0.00003265997,0.0048065023,0.005142943,0.00022848495],"about_ca_topic_score_codex":0.00025029224,"about_ca_topic_score_gemma":0.000030697498,"teacher_disagreement_score":0.8959142,"about_ca_system_score_codex":0.00009614756,"about_ca_system_score_gemma":0.00006411413,"threshold_uncertainty_score":0.5900631},"labels":[],"label_agreement":null},{"id":"W2783206260","doi":"10.1007/s10878-017-0247-5","title":"A combinatorial auction mechanism for surgical scheduling considering surgeon’s private availability information","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","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":"Concordia University","funders":"Program for New Century Excellent Talents in University; China Scholarship Council; National Natural Science Foundation of China","keywords":"Bidding; Scheduling (production processes); Theory of computation; Computer science; Mathematical optimization; Combinatorial auction; Operations research; Private information retrieval; Mathematics; Economics; Microeconomics; Algorithm","score_opus":0.039526576676322235,"score_gpt":0.3611763905004438,"score_spread":0.32164981382412156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783206260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16639955,0.000021650401,0.79625124,0.0015921871,0.03332271,0.001652692,0.000019874764,0.00010793474,0.00063214777],"genre_scores_gemma":[0.84932625,0.000097636934,0.14536835,0.00023948959,0.0047264695,0.00007334879,0.000098410084,0.00004322224,0.000026830652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958945,0.0006737456,0.0022000854,0.000205317,0.00056548306,0.0004608514],"domain_scores_gemma":[0.9903624,0.0006748837,0.0016912641,0.00025795214,0.0067696865,0.00024379994],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003762335,0.00023409651,0.00054738956,0.00036324776,0.0014070282,0.00010667037,0.00019110997,0.0005043075,0.0002276766],"category_scores_gemma":[0.003633118,0.0002214295,0.00017064752,0.00049290387,0.00008586523,0.0017881324,0.000058909765,0.00061178417,0.000026852558],"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.0033069963,0.0003853028,0.0033946198,0.00044094253,0.00015351418,0.0000050677827,0.0038749008,0.22275813,0.00015905379,0.76352704,0.0010717681,0.0009226338],"study_design_scores_gemma":[0.025877554,0.0026627874,0.00020681517,0.00070260727,0.00021293965,0.000059902326,0.001466387,0.8669756,0.0013594772,0.074643634,0.025072344,0.0007599332],"about_ca_topic_score_codex":0.000039772483,"about_ca_topic_score_gemma":0.000002732325,"teacher_disagreement_score":0.6888834,"about_ca_system_score_codex":0.0005493353,"about_ca_system_score_gemma":0.0011377942,"threshold_uncertainty_score":0.999893},"labels":[],"label_agreement":null},{"id":"W2796790483","doi":"10.1007/s10878-009-9236-7","title":"The robot cleans up","year":2009,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","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":"Eulerian path; Enhanced Data Rates for GSM Evolution; Weighting; Theory of computation; Property (philosophy); Computer science; Graph; Robot; Combinatorics; Mathematics; Mathematical optimization; Algorithm; Artificial intelligence; Lagrangian; Physics; Applied mathematics","score_opus":0.011572052617344274,"score_gpt":0.25832733421325754,"score_spread":0.24675528159591326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796790483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044128712,0.00011306232,0.98629653,0.0068256482,0.0048089563,0.00010024008,1.1855773e-7,0.000033467666,0.0017778336],"genre_scores_gemma":[0.5516163,0.0012991573,0.4442181,0.0009846577,0.0010883426,0.0000025214445,0.000002511189,0.000020188256,0.00076818775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859583,0.00014829052,0.00046348825,0.000097154174,0.00050829665,0.00018695855],"domain_scores_gemma":[0.9984381,0.000121377605,0.00039326717,0.00023966847,0.0006950417,0.00011255256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087805087,0.00008914085,0.00014195885,0.00010441157,0.00028083875,0.0004295431,0.00081259623,0.00005793124,0.000010226923],"category_scores_gemma":[0.00024396533,0.000060613027,0.00009010067,0.00046269305,0.000027526006,0.0008940556,0.000041470477,0.00020706575,0.0000051197526],"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.000036705605,0.00007106765,0.0000094799825,0.0000010471487,0.00001191002,0.0000039761353,0.00022381116,0.7126184,0.000048726914,0.27065954,0.0033538279,0.0129615115],"study_design_scores_gemma":[0.0023274766,0.0009803155,0.00020594453,0.000029791361,0.000012269566,0.000053788604,0.000038447146,0.9149472,0.0003842374,0.06776986,0.0130701475,0.00018048918],"about_ca_topic_score_codex":6.0654133e-7,"about_ca_topic_score_gemma":6.9651115e-8,"teacher_disagreement_score":0.5515722,"about_ca_system_score_codex":0.0000578123,"about_ca_system_score_gemma":0.00015362744,"threshold_uncertainty_score":0.41420943},"labels":[],"label_agreement":null},{"id":"W2805549752","doi":"10.1007/s10878-018-0314-6","title":"A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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 Alberta","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Theory of computation; Computer science; Job shop scheduling; Time complexity; Scheduling (production processes); Mathematical optimization; Polynomial-time approximation scheme; Dynamic programming; Approximation algorithm; Schedule; sort; Algorithm; Parallel computing; Mathematics","score_opus":0.013612547916405274,"score_gpt":0.2620959733299292,"score_spread":0.24848342541352392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805549752","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019928051,0.00004325074,0.9731244,0.0001655874,0.005358213,0.0003477444,0.0000070679566,0.00012228584,0.0009033967],"genre_scores_gemma":[0.11647367,0.000019929626,0.87998813,0.000067996625,0.0032119877,0.000012497353,0.000034856614,0.00007271943,0.00011821512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832124,0.0000556267,0.0007957229,0.00016033907,0.00040534954,0.00026172298],"domain_scores_gemma":[0.9984485,0.0001362428,0.00033425548,0.00016748189,0.0007609421,0.00015256643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071433926,0.00021323671,0.0003503677,0.00028480668,0.00015750465,0.00019841362,0.00023634372,0.00016870804,0.00012992953],"category_scores_gemma":[0.00051754975,0.00021261677,0.0001551455,0.0003034032,0.0000521362,0.0005020544,0.000021733591,0.00024119648,0.000037218408],"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.0004016071,0.00008762372,0.00001537817,0.000021362577,0.00006851366,0.0000018946168,0.00011483837,0.9947385,0.0005301442,0.0031343526,0.0005686224,0.00031712596],"study_design_scores_gemma":[0.004571142,0.0004918219,0.000008237909,0.00007769468,0.000047349586,0.000012196446,0.000035234545,0.9916114,0.0020797092,0.00041775775,0.00042409205,0.00022335602],"about_ca_topic_score_codex":8.100104e-7,"about_ca_topic_score_gemma":7.938159e-8,"teacher_disagreement_score":0.096545614,"about_ca_system_score_codex":0.00015853344,"about_ca_system_score_gemma":0.00009076598,"threshold_uncertainty_score":0.86702603},"labels":[],"label_agreement":null},{"id":"W2807719019","doi":"10.1007/s10878-020-00587-z","title":"Power domination on triangular grids with triangular and hexagonal shape","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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":"Carleton University","funders":"","keywords":"Vertex (graph theory); Combinatorics; Hexagonal crystal system; Mathematics; Graph; Theory of computation; Dominating set; Grid; Domination analysis; Hexagonal tiling; Geometry; Crystallography; Chemistry; Algorithm","score_opus":0.011670298745533731,"score_gpt":0.2498061933835625,"score_spread":0.23813589463802876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807719019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023944905,0.00019559574,0.97028863,0.0038214514,0.0010181048,0.00027737257,0.0000015546829,0.00003670095,0.00041567473],"genre_scores_gemma":[0.88501066,0.000076803226,0.1139968,0.0004033,0.00046436142,0.0000040125115,0.0000028558763,0.000025680782,0.000015508074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982193,0.00023439189,0.00038778194,0.00021829977,0.0007614751,0.00017874042],"domain_scores_gemma":[0.9984874,0.00019887155,0.00039355876,0.00016616003,0.0005276009,0.0002263983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070688856,0.0001459002,0.0002837739,0.00022648249,0.000107273336,0.00017442663,0.00043885142,0.00007739079,0.00004044228],"category_scores_gemma":[0.0004689249,0.00011524049,0.000070718495,0.0006727096,0.00006075038,0.0010093345,0.000071427035,0.00029205348,0.000002697162],"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.0071947607,0.0005078438,0.00022577397,0.000042658005,0.00020952937,0.0002976761,0.002291505,0.28707615,0.0016567311,0.6870325,0.0010980141,0.012366858],"study_design_scores_gemma":[0.0385721,0.020485535,0.0006633428,0.00024121627,0.000095767675,0.00030436012,0.00025114318,0.84325856,0.008979079,0.08020723,0.005979901,0.00096174184],"about_ca_topic_score_codex":2.2976627e-7,"about_ca_topic_score_gemma":1.4577733e-8,"teacher_disagreement_score":0.86106575,"about_ca_system_score_codex":0.000059194575,"about_ca_system_score_gemma":0.00013566687,"threshold_uncertainty_score":0.4699371},"labels":[],"label_agreement":null},{"id":"W2823384615","doi":"10.1007/s10878-018-0324-4","title":"Competitive analysis of randomized online strategies for the multi-agent k-Canadian Traveler Problem","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"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":"Competitive analysis; Theory of computation; Randomized algorithm; Disjoint sets; Computer science; Graph; Online algorithm; Enhanced Data Rates for GSM Evolution; Node (physics); Combinatorics; Mathematics; Mathematical optimization; Theoretical computer science; Upper and lower bounds; Algorithm; Artificial intelligence","score_opus":0.025514663311642347,"score_gpt":0.2938431342376827,"score_spread":0.26832847092604034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2823384615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011096659,0.00007766838,0.99608994,0.0011728932,0.0012179929,0.00064392184,0.000013920292,0.000010835986,0.0006618645],"genre_scores_gemma":[0.3780223,0.00018796611,0.62127215,0.0001609545,0.0002498079,0.0000157034,0.000020642248,0.000012191398,0.00005827407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998132,0.00029001196,0.0008394007,0.00013817164,0.000401214,0.00019923698],"domain_scores_gemma":[0.99572927,0.00043650033,0.0008074817,0.00021128915,0.002676088,0.00013938651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018414127,0.00012327773,0.00059866795,0.00062676845,0.00018521213,0.00021402935,0.0006314623,0.00007502233,0.000055622946],"category_scores_gemma":[0.00030646194,0.00008205663,0.00036836584,0.0011718193,0.00017830607,0.00056345796,0.00003682184,0.00012594099,6.962404e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007110216,0.00012780329,0.000010440401,0.000006153784,0.00059871696,5.7945897e-7,0.0011374224,0.6031584,0.000013145025,0.3937417,0.00010730113,0.00038731293],"study_design_scores_gemma":[0.024730578,0.00027827438,0.00006168686,0.0000232489,0.00044500735,0.000001841553,0.00024928726,0.9696543,0.000055510907,0.003100861,0.0013069817,0.000092410795],"about_ca_topic_score_codex":0.00036531172,"about_ca_topic_score_gemma":0.00050872687,"teacher_disagreement_score":0.39064083,"about_ca_system_score_codex":0.00007930786,"about_ca_system_score_gemma":0.00067180215,"threshold_uncertainty_score":0.33461723},"labels":[],"label_agreement":null},{"id":"W2883365810","doi":"10.1007/s10878-018-0326-2","title":"Client assignment problems for latency minimization","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","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":"Fondation Pour La Conservation Du Saumon Atlantique","keywords":"Interactivity; Computer science; Latency (audio); Server; Approximation algorithm; Theory of computation; Computer network; Algorithm; Operating system","score_opus":0.02113870338034317,"score_gpt":0.2740284831865448,"score_spread":0.25288977980620164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883365810","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013517603,0.000041651532,0.99209476,0.0011813865,0.0050627324,0.00047240293,0.0000013635307,0.000044725475,0.00096582266],"genre_scores_gemma":[0.15102586,0.00014531676,0.8471814,0.0002345864,0.0011319002,0.000024934423,0.000012578603,0.000027935357,0.00021549643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981327,0.00012404622,0.00074287155,0.00020052052,0.0005526422,0.00024722045],"domain_scores_gemma":[0.9967893,0.00009908231,0.00072088384,0.00023423164,0.0020043808,0.00015214588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008935296,0.00013856213,0.00023626626,0.00026157932,0.00020327767,0.00024869677,0.0005686061,0.00010585788,0.00004698317],"category_scores_gemma":[0.00028118957,0.00012126404,0.00011314298,0.0005230962,0.000051625353,0.0010865233,0.000076763405,0.00011082497,0.0000064039946],"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.000096962394,0.00040005014,0.00011373346,0.000028922916,0.000050091807,0.0000016681217,0.0009131465,0.8723359,0.0001950927,0.11686745,0.0053757946,0.0036211882],"study_design_scores_gemma":[0.0029308905,0.0019330234,0.000029327555,0.00006153784,0.000020442152,0.000014360793,0.000017989021,0.96669996,0.0011357655,0.015632628,0.011342704,0.00018139182],"about_ca_topic_score_codex":0.0000011014158,"about_ca_topic_score_gemma":1.4538318e-7,"teacher_disagreement_score":0.1508907,"about_ca_system_score_codex":0.0001264506,"about_ca_system_score_gemma":0.0002308141,"threshold_uncertainty_score":0.4945004},"labels":[],"label_agreement":null},{"id":"W2886895431","doi":"10.1007/s10878-018-0339-x","title":"Approximation algorithms for the graph balancing problem with two speeds and two job lengths","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Job shop scheduling; Approximation algorithm; Combinatorics; Theory of computation; Mathematics; Cardinality (data modeling); Graph; Algorithm; Discrete mathematics; Schedule; Computer science","score_opus":0.009381341884826729,"score_gpt":0.24075798057857492,"score_spread":0.2313766386937482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886895431","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004218327,0.00023242515,0.9920261,0.00019103813,0.0025888234,0.0003405866,0.0000024778756,0.00006933824,0.00033090235],"genre_scores_gemma":[0.21833272,0.00016252011,0.7794791,0.000035930185,0.0018952208,0.000014765086,0.000007577697,0.000053558313,0.00001861128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989763,0.000034878027,0.0004182006,0.00010722458,0.0002861632,0.00017723365],"domain_scores_gemma":[0.99868697,0.00016135428,0.0002428562,0.000118462835,0.0007123889,0.00007793919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006159426,0.00015855614,0.000217132,0.00015856161,0.00020491837,0.00015712147,0.00013789423,0.00006327929,0.000011308207],"category_scores_gemma":[0.00007484104,0.00011072834,0.000053702148,0.00035837345,0.000071868286,0.00041515808,0.0000129370555,0.00016993072,7.8614636e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008645717,0.00002072967,0.00010653977,0.000023686021,0.00008724249,7.10853e-7,0.00046317314,0.99336386,0.000048473285,0.0022597162,0.00014591352,0.0033935213],"study_design_scores_gemma":[0.0037599187,0.00035046146,0.00003864923,0.000072589,0.00010850088,0.000051365834,0.00015303936,0.99251634,0.00080724445,0.0017930982,0.00019361173,0.00015515473],"about_ca_topic_score_codex":0.000003623354,"about_ca_topic_score_gemma":0.0000010650806,"teacher_disagreement_score":0.2141144,"about_ca_system_score_codex":0.00005577164,"about_ca_system_score_gemma":0.000046551635,"threshold_uncertainty_score":0.45153704},"labels":[],"label_agreement":null},{"id":"W2888977297","doi":"10.1007/s10878-018-0346-y","title":"An approximation algorithm for genome sorting by reversals to recover all adjacencies","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Alberta","funders":"Natural Science Foundation of Shandong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Georgia Southern University; Office of the Vice President for Research and Economic Development, University at Buffalo; National Science Foundation","keywords":"Genome; Sorting; Approximation algorithm; Biology; Genomics; Gene; Computational biology; Mathematics; Algorithm; Computer science; Genetics","score_opus":0.01089987414633301,"score_gpt":0.2672347587110028,"score_spread":0.25633488456466974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888977297","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041656353,0.000119731,0.95585734,0.00015950363,0.0016773684,0.00040250964,0.00002048454,0.000007850932,0.0000988679],"genre_scores_gemma":[0.12758325,0.00015153685,0.867142,0.00034286862,0.00408482,0.000023787501,0.00040539715,0.00006501001,0.00020130664],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99893856,0.00006204771,0.00042307252,0.00017393424,0.00021604933,0.00018633838],"domain_scores_gemma":[0.9984623,0.000010779877,0.0004314407,0.0001592901,0.0008174365,0.000118752585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063930365,0.00012148082,0.00017354907,0.00008739629,0.00008110592,0.00006463183,0.00019755491,0.0001217734,0.000020125226],"category_scores_gemma":[0.00016280396,0.00012063959,0.00007873838,0.000113856506,0.000023855457,0.000036715748,0.000030157547,0.000052293763,0.0000024777669],"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.0005394031,0.00043738354,0.000120821176,0.00003255417,0.0002793747,0.0000012399298,0.00066327036,0.040912174,0.9182376,0.00013126196,0.013362559,0.025282321],"study_design_scores_gemma":[0.013977831,0.025352031,0.00035864906,0.00011195575,0.0004596783,0.000068376314,0.00064291304,0.19862525,0.5371566,0.0029992496,0.21858229,0.0016651814],"about_ca_topic_score_codex":0.0000019847564,"about_ca_topic_score_gemma":2.7756954e-7,"teacher_disagreement_score":0.38108104,"about_ca_system_score_codex":0.000056372977,"about_ca_system_score_gemma":0.00006545308,"threshold_uncertainty_score":0.49195397},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019568797,0.00004136748,0.9936192,0.00057177653,0.005064058,0.0003927434,0.0000030725184,0.000040812116,0.000071281625],"genre_scores_gemma":[0.046177838,0.000025587817,0.9516367,0.00009410567,0.0020136016,0.000021617243,0.000007745248,0.000012004743,0.000010826167],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872065,0.00010619064,0.00049525243,0.00016701901,0.0003263915,0.00018452384],"domain_scores_gemma":[0.99769187,0.00015515552,0.0006076342,0.00029602082,0.0011687558,0.000080561236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010644589,0.000119938784,0.00017288745,0.000121763645,0.0003725111,0.0003274039,0.0007109864,0.00007939062,0.000008718799],"category_scores_gemma":[0.00007497685,0.00008815218,0.0001121642,0.00040520582,0.00008122086,0.0014160092,0.000047881735,0.00012933672,0.000001161786],"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.0003080864,0.0014747091,0.000027287357,0.00005129258,0.00020545267,0.0000038538265,0.0033805415,0.06476787,0.001675933,0.31362948,0.0033619595,0.61111355],"study_design_scores_gemma":[0.0012647626,0.0014044713,0.000020278207,0.00002034323,0.000026832546,0.000017693836,0.000034510937,0.925954,0.0011939082,0.068853654,0.0011032568,0.00010630755],"about_ca_topic_score_codex":0.0000034462962,"about_ca_topic_score_gemma":3.0802994e-7,"teacher_disagreement_score":0.8611861,"about_ca_system_score_codex":0.000053115513,"about_ca_system_score_gemma":0.00013178361,"threshold_uncertainty_score":0.35947415},"labels":[],"label_agreement":null},{"id":"W2910174849","doi":"10.1007/s10878-019-00378-1","title":"On the randomized online strategies for the k-Canadian traveler problem","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":14,"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":"Competitive analysis; Theory of computation; Combinatorics; Graph; Randomized algorithm; Computer science; Disjoint sets; Undirected graph; Node (physics); Online algorithm; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Mathematics; Upper and lower bounds; Mathematical optimization; Algorithm; Artificial intelligence; Physics","score_opus":0.017103845037781597,"score_gpt":0.25547395398773054,"score_spread":0.23837010894994895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910174849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002552624,0.00005741535,0.9761607,0.01623107,0.002871639,0.001477169,0.0000026422356,0.000016707632,0.0029273678],"genre_scores_gemma":[0.7981842,0.0002046439,0.19808212,0.0022351556,0.0005826635,0.00006131876,0.0000111867175,0.00003621962,0.00060248247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845195,0.00028117836,0.0004799413,0.000117926415,0.0004622034,0.00020678091],"domain_scores_gemma":[0.9972491,0.0011598855,0.00041825438,0.00026382162,0.000810802,0.000098113196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022731735,0.00011814389,0.0002749639,0.00015571844,0.00028976274,0.00063748803,0.0008464044,0.00007681797,0.00008521537],"category_scores_gemma":[0.0003311463,0.000059063233,0.0001803544,0.0003283155,0.000059433398,0.00058166747,0.000028234615,0.00026160642,0.0000066988423],"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.00052783726,0.0000318792,0.0000010122899,0.000003159958,0.000025108286,2.8958834e-7,0.00022526378,0.48694953,0.0000024200483,0.5111561,0.0008399707,0.00023741316],"study_design_scores_gemma":[0.024269162,0.00027539054,0.0000049625164,0.0000301256,0.000018962624,0.000005193926,0.00008642024,0.8640991,0.000013800536,0.10888643,0.0022252656,0.00008521507],"about_ca_topic_score_codex":0.00015225746,"about_ca_topic_score_gemma":0.00007333986,"teacher_disagreement_score":0.7979289,"about_ca_system_score_codex":0.00008760597,"about_ca_system_score_gemma":0.0008341489,"threshold_uncertainty_score":0.6147312},"labels":[],"label_agreement":null},{"id":"W2919974563","doi":"10.1007/s10878-007-9126-9","title":"Priority algorithms for the subset-sum problem","year":2008,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","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":"Theory of computation; Algorithm; Computer science; Subset sum problem; Mathematics; Combinatorics; Discrete mathematics; Knapsack problem","score_opus":0.0313018334077141,"score_gpt":0.27724368333323646,"score_spread":0.24594184992552237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2919974563","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010983313,0.00017292645,0.99299735,0.0024822815,0.0034155995,0.00047060812,0.0000014886072,0.000039659724,0.00031026057],"genre_scores_gemma":[0.03822669,0.0007684382,0.9596705,0.00021112393,0.00082724524,0.000022606755,0.0000045218662,0.000021595977,0.0002472863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983497,0.00012222464,0.000565976,0.0001524727,0.0005782848,0.00023128632],"domain_scores_gemma":[0.9974913,0.0003148159,0.00051755994,0.00026778106,0.0012896819,0.00011886452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010914009,0.00012556247,0.00022382887,0.00013251326,0.00043503795,0.00016704666,0.00086481683,0.00008695423,0.000014155336],"category_scores_gemma":[0.00024311393,0.00008712402,0.00014923903,0.0005061924,0.00006572744,0.0010019388,0.00008503571,0.00022414998,0.0000025826075],"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.00008201629,0.00027087555,0.00018157317,0.00001830382,0.00007046378,0.000010361179,0.0010063231,0.9027239,0.000031612635,0.083992414,0.0069475323,0.004664611],"study_design_scores_gemma":[0.0026623628,0.0005078315,0.0001204439,0.00001971435,0.000019596617,0.00011529689,0.000018892366,0.97409236,0.00025412554,0.008611847,0.01342388,0.00015363649],"about_ca_topic_score_codex":0.0000038499247,"about_ca_topic_score_gemma":1.4902481e-7,"teacher_disagreement_score":0.07538057,"about_ca_system_score_codex":0.000077911376,"about_ca_system_score_gemma":0.00037024057,"threshold_uncertainty_score":0.35528144},"labels":[],"label_agreement":null},{"id":"W2920974405","doi":"10.1007/s10878-019-00400-6","title":"A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Interconnection Networks and Systems","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":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Neighbourhood (mathematics); Vertex connectivity; Connectivity; Graph; Time complexity; Theory of computation; Discrete mathematics; Algorithm","score_opus":0.005635936552762238,"score_gpt":0.2127651921359911,"score_spread":0.20712925558322887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920974405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110454455,0.00006689922,0.86964923,0.000092842114,0.01907858,0.00016390572,9.021606e-7,0.000022666438,0.00047049188],"genre_scores_gemma":[0.9610576,0.000012772066,0.038550034,0.000033302473,0.00030647725,0.0000012455287,7.593701e-7,0.000010845738,0.000026945072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983628,0.00020279961,0.0006950584,0.00015956078,0.00041298932,0.00016678804],"domain_scores_gemma":[0.99797946,0.00017604308,0.0009566471,0.00025565596,0.0005310294,0.000101157624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078086264,0.00012767277,0.00042139608,0.00026022957,0.000059988943,0.00009876192,0.0004589045,0.000120244506,0.000019304855],"category_scores_gemma":[0.0001167594,0.00011567868,0.0002027965,0.00039554122,0.000023083876,0.00086641696,0.00006857924,0.00017836993,0.0000032994856],"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.00040771975,0.00083677477,0.005169816,0.00010416766,0.0004906152,0.000055438813,0.002330699,0.85079485,0.00635312,0.07274183,0.007911279,0.05280368],"study_design_scores_gemma":[0.002924831,0.0010337135,0.0002980131,0.00015081547,0.000023597497,0.00013206998,0.000050926712,0.98921,0.0025075562,0.0028073236,0.0006710297,0.00019013985],"about_ca_topic_score_codex":0.000011060199,"about_ca_topic_score_gemma":2.0006041e-7,"teacher_disagreement_score":0.85060316,"about_ca_system_score_codex":0.00007286706,"about_ca_system_score_gemma":0.0001303012,"threshold_uncertainty_score":0.47172397},"labels":[],"label_agreement":null},{"id":"W2944974408","doi":"10.1007/s10878-019-00413-1","title":"An evolutionary approach for the target search problem in uncertain environment","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Université Laval","funders":"","keywords":"Theory of computation; Evolutionary algorithm; Mathematical optimization; Computer science; Mathematical economics; Mathematics; Theoretical computer science; Algorithm","score_opus":0.014416983642847468,"score_gpt":0.24734171364396731,"score_spread":0.23292473000111985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944974408","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001692688,0.00012745573,0.9974348,0.0004200518,0.0012277595,0.00048828006,0.0000011271331,0.000011408476,0.00011983357],"genre_scores_gemma":[0.019574955,0.000020727291,0.9801162,0.000026805255,0.00020623683,0.000012015762,0.000007511167,0.000009267882,0.000026269978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858636,0.00017873028,0.00038353942,0.00016997696,0.00048654404,0.000194877],"domain_scores_gemma":[0.9990829,0.00018995586,0.00024731708,0.0002721542,0.000144382,0.00006327804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001390696,0.0000967261,0.00017735652,0.00013632461,0.00007961986,0.000084318264,0.00074460846,0.00007207509,0.00000696853],"category_scores_gemma":[0.000035221696,0.00007086279,0.000057725123,0.0002404856,0.00002246658,0.00067269156,0.00005618953,0.00020813271,0.00000228283],"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.00004107434,0.00019592278,0.00091866433,0.000009236736,0.0000124830985,0.0000020473449,0.0003476227,0.992761,0.000036437657,0.005191971,0.00013169071,0.00035181793],"study_design_scores_gemma":[0.0013218392,0.00048048468,0.00058621395,0.00001556272,0.0000055969113,0.000019831932,0.000058284753,0.9945028,0.00003899649,0.0027219725,0.00016289503,0.00008556736],"about_ca_topic_score_codex":0.0000058691908,"about_ca_topic_score_gemma":1.0363208e-9,"teacher_disagreement_score":0.019405687,"about_ca_system_score_codex":0.00019219944,"about_ca_system_score_gemma":0.00017449739,"threshold_uncertainty_score":0.28897008},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"agree"},{"id":"W2987505511","doi":"10.1007/s10878-019-00466-2","title":"On the König deficiency of zero-reducible graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Graph theory and applications","field":"Mathematics","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":"Memorial University of Newfoundland","funders":"Horizon 2020","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Matching (statistics); Theory of computation; Context (archaeology); Discrete mathematics; Line graph; Algorithm; Statistics","score_opus":0.018655397149084107,"score_gpt":0.2690757413895451,"score_spread":0.250420344240461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2987505511","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95409364,0.000053193056,0.032710128,0.0008138474,0.0025443817,0.00045169576,0.0000039619463,0.000017902361,0.00931124],"genre_scores_gemma":[0.9942539,0.000017614959,0.005561164,0.000040262206,0.00004255105,0.0000029154953,8.6843073e-7,0.0000121441435,0.00006858254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894917,0.000110650726,0.0004573835,0.00007363,0.00031586987,0.000093312934],"domain_scores_gemma":[0.9980345,0.0006453617,0.00067821104,0.00026045195,0.00033786945,0.000043613556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008610692,0.00008394883,0.00020063086,0.00012913876,0.0000750022,0.000020192208,0.00026285916,0.000060130187,0.00015193013],"category_scores_gemma":[0.0005992415,0.000055178214,0.00013802775,0.00038768398,0.00004318056,0.000117189215,0.00001664341,0.00016105369,0.000007715928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000618889,0.00028194571,0.00008098141,0.000014699808,0.000018442026,2.0454392e-7,0.00015514535,0.020232007,0.0005117627,0.97643894,0.0021804944,0.000023499702],"study_design_scores_gemma":[0.0006286817,0.0003066337,0.000020837157,0.00005365447,0.000040728788,0.000005326279,0.00007822852,0.0009694965,0.0026238963,0.9951186,0.000095235286,0.0000586803],"about_ca_topic_score_codex":7.261959e-7,"about_ca_topic_score_gemma":1.9858641e-8,"teacher_disagreement_score":0.04016025,"about_ca_system_score_codex":0.00001869363,"about_ca_system_score_gemma":0.000067404646,"threshold_uncertainty_score":0.22501023},"labels":[],"label_agreement":null},{"id":"W3008182893","doi":"10.1007/s10878-020-00550-y","title":"An approximation algorithm for the uniform capacitated k-means problem","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Cardinality (data modeling); Mathematics; Theory of computation; Combinatorics; Constant (computer programming); Integer (computer science); Space (punctuation); Approximation algorithm; Extension (predicate logic); Point (geometry); Constraint (computer-aided design); Upper and lower bounds; Discrete mathematics; Algorithm; Computer science; Mathematical analysis; Geometry","score_opus":0.02308144935452432,"score_gpt":0.23222037315191923,"score_spread":0.2091389237973949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008182893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045906522,0.000017767505,0.9905514,0.0058384906,0.0019320042,0.00054352044,0.0000028831382,0.00004334896,0.0006115218],"genre_scores_gemma":[0.60352683,0.00013843892,0.37798354,0.006156083,0.011505923,0.00009601676,0.00038383142,0.000105832456,0.00010348074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998961,0.00001561915,0.00048301098,0.00010579848,0.00031197944,0.00012264034],"domain_scores_gemma":[0.99863833,0.000023470515,0.00033886466,0.00010356353,0.0008731037,0.000022689064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060565356,0.000107483786,0.00014813062,0.00010194436,0.00019590362,0.00022518975,0.0002672812,0.000045797042,0.00008359495],"category_scores_gemma":[0.0001435694,0.00007963942,0.00008440851,0.00045371777,0.000022637432,0.0016264423,0.000022301361,0.00009815396,0.000007803226],"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.00009577437,0.00012432896,0.00002400567,0.00007928191,0.00004955685,4.29179e-7,0.00024143198,0.947213,0.000029252556,0.033821482,0.0036352081,0.014686267],"study_design_scores_gemma":[0.0012222242,0.000094559065,0.000033101373,0.000010156326,0.00009143337,4.1452188e-7,0.00040993968,0.9706221,0.000023162243,0.002919721,0.024476811,0.00009637508],"about_ca_topic_score_codex":0.00003276152,"about_ca_topic_score_gemma":0.0000016506413,"teacher_disagreement_score":0.61256784,"about_ca_system_score_codex":0.000035834502,"about_ca_system_score_gemma":0.000030138155,"threshold_uncertainty_score":0.32476017},"labels":[],"label_agreement":null},{"id":"W3041287753","doi":"10.1007/s10878-020-00604-1","title":"Shortest paths among transient obstacles","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Theory of computation; Transient (computer programming); Computer science; Mathematics; Combinatorics; Mathematical optimization; Algorithm","score_opus":0.015981058834448825,"score_gpt":0.22437255145828916,"score_spread":0.20839149262384032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041287753","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031512922,0.00009238443,0.99103796,0.0014672289,0.0038090886,0.00009468326,8.7084584e-7,0.000059157708,0.00028729963],"genre_scores_gemma":[0.49171814,0.000028361472,0.5074473,0.00018790118,0.0005967358,0.0000011190508,0.0000020323337,0.000013424254,0.0000049501978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984598,0.000104531995,0.0005442947,0.000163901,0.0005538852,0.00017356782],"domain_scores_gemma":[0.9986992,0.0000932668,0.0004431998,0.00015785235,0.00036814954,0.00023835807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032757164,0.00012753138,0.00026585476,0.000093027884,0.00007342733,0.00016311515,0.00065234123,0.00007947612,0.000008173063],"category_scores_gemma":[0.00026801793,0.00011619891,0.00010651887,0.00046236947,0.000029592475,0.00091718766,0.00005026023,0.00023499102,0.000004060231],"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.000020499288,0.00007999771,0.00074301823,0.000006360892,0.000025450041,0.000095276424,0.0013679452,0.99231845,0.00010452541,0.0029310307,0.0009773003,0.0013301591],"study_design_scores_gemma":[0.001170247,0.00053639075,0.0014011955,0.000044863158,0.000024060635,0.000031666932,0.000036111105,0.9951759,0.00039726583,0.00063083717,0.00039472108,0.00015673994],"about_ca_topic_score_codex":0.0000019006516,"about_ca_topic_score_gemma":1.30726905e-8,"teacher_disagreement_score":0.48856685,"about_ca_system_score_codex":0.000050968447,"about_ca_system_score_gemma":0.00013156193,"threshold_uncertainty_score":0.47384542},"labels":[],"label_agreement":null},{"id":"W3082111916","doi":"10.1007/s10878-020-00630-z","title":"Incremental optimization of independent sets under the reconfiguration framework","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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","funders":"Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Mathematics; Combinatorics; Treewidth; Chordal graph; Pathwidth; Independent set; Vertex cover; Maximal independent set; Discrete mathematics; Bounded function; Degeneracy (biology); Vertex (graph theory); Dominating set; Planar graph; Clique-sum; Upper and lower bounds; Time complexity; Graph; 1-planar graph; Line graph","score_opus":0.02336265583839775,"score_gpt":0.288456861819923,"score_spread":0.2650942059815253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082111916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025139991,0.00008028384,0.9921265,0.0034333267,0.0014086004,0.00021108991,0.0000012936176,0.00001997932,0.00020491173],"genre_scores_gemma":[0.7668264,0.00009026148,0.2325869,0.0002515413,0.00022417503,0.0000024953304,0.0000030880713,0.000012714993,0.0000024280548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787134,0.0003474219,0.0006513649,0.0001562203,0.0008220077,0.00015162007],"domain_scores_gemma":[0.99778056,0.00027460392,0.0008505928,0.00023518008,0.0007446835,0.0001143661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082959695,0.00011830245,0.000226103,0.00013455714,0.00012550109,0.0001246126,0.0008251876,0.000108105996,0.00006220971],"category_scores_gemma":[0.0004671361,0.00009086356,0.00010095966,0.0008012728,0.00006198536,0.0011323863,0.00012628685,0.0003760377,0.0000020617167],"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.00012508054,0.000057445708,0.000046728004,0.000007444853,0.000032844207,0.0000022629893,0.00046466474,0.86754054,0.00029562626,0.13073598,0.00008908878,0.0006023043],"study_design_scores_gemma":[0.0014910827,0.00076429226,0.000112775924,0.0000592449,0.000025649744,0.000022428902,0.00027437817,0.9198388,0.005813179,0.0713811,0.00006670712,0.00015040056],"about_ca_topic_score_codex":0.0000015530915,"about_ca_topic_score_gemma":7.0146115e-8,"teacher_disagreement_score":0.7643124,"about_ca_system_score_codex":0.00008550086,"about_ca_system_score_gemma":0.00017140305,"threshold_uncertainty_score":0.37053084},"labels":[],"label_agreement":null},{"id":"W3128641904","doi":"10.1007/s10878-021-00699-0","title":"Designing emergency flood evacuation plans using robust optimization and artificial intelligence","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Evacuation and Crowd Dynamics","field":"Engineering","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":"Concordia University; Center for Interuniversity Research and Analysis on Organizations","funders":"","keywords":"Computer science; Flood myth; Robust optimization; Operations research; Theory of computation; Emergency evacuation; Mathematical optimization; Set (abstract data type); Plan (archaeology); Engineering; Mathematics; Algorithm","score_opus":0.029201225714560155,"score_gpt":0.2539812705037813,"score_spread":0.22478004478922112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128641904","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01186784,0.0002563816,0.98407745,0.00005560243,0.003475405,0.00007834075,0.0000029191642,0.00004015016,0.00014589746],"genre_scores_gemma":[0.4299207,0.0011299277,0.5682509,0.000012478485,0.0005910466,0.0000017021848,0.000039615814,0.00004521205,0.000008426681],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986966,0.00008231434,0.0006878772,0.000106222345,0.0002930367,0.00013392152],"domain_scores_gemma":[0.9989093,0.00004372241,0.00023957642,0.00008879814,0.0006349573,0.00008363934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035086574,0.00013355986,0.00019897988,0.00016553981,0.00010888175,0.000094689356,0.00007564321,0.00012402616,0.00013019782],"category_scores_gemma":[0.0002102115,0.00014988736,0.00005591109,0.00041649435,0.000014411409,0.00056580175,0.000017098573,0.00017448726,9.749768e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018511126,0.000040368417,0.00009781854,0.000022372637,0.00003576465,0.00000622779,0.00021300439,0.9947449,0.0016677057,0.0023233306,0.000024768417,0.0008052552],"study_design_scores_gemma":[0.00024339651,0.000050012262,0.000016987466,0.00004727035,0.000078783385,0.000048015114,0.00023586591,0.9918447,0.00503541,0.0022417028,0.000010561642,0.00014730438],"about_ca_topic_score_codex":9.615592e-7,"about_ca_topic_score_gemma":9.581264e-7,"teacher_disagreement_score":0.41805288,"about_ca_system_score_codex":0.00011129095,"about_ca_system_score_gemma":0.00009169064,"threshold_uncertainty_score":0.6112229},"labels":[],"label_agreement":null},{"id":"W3129946810","doi":"10.1007/s10878-021-00710-8","title":"A simple method for proving lower bounds in the zero-visibility cops and robber game","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Guidance and Control Systems","field":"Engineering","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 Regina","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Simple (philosophy); Theory of computation; Zero-sum game; Visibility; Zero (linguistics); Mathematics; Computer science; Game theory; Combinatorics; Discrete mathematics; Calculus (dental); Mathematical economics; Algorithm; Physics; Epistemology; Philosophy","score_opus":0.007303446554271235,"score_gpt":0.24982790039421496,"score_spread":0.24252445383994373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129946810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05870688,0.00077805517,0.93689394,0.0002162837,0.002785305,0.00032164183,0.0000027476099,0.000016319833,0.00027881973],"genre_scores_gemma":[0.98775816,0.000031412415,0.011802071,0.00004426286,0.00032610935,0.000011316284,0.000002744191,0.000013822127,0.000010096519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911946,0.00011648768,0.00040397415,0.0000760454,0.000163973,0.00012006129],"domain_scores_gemma":[0.9992967,0.00020502365,0.00011711016,0.00010676487,0.00024386286,0.000030510108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010030878,0.000081556376,0.0002247215,0.00004470284,0.00003519812,0.00011419222,0.0000825856,0.00006696891,0.000005767986],"category_scores_gemma":[0.00025950957,0.000063145366,0.000066500405,0.00016110565,0.000007949532,0.00023752812,0.000009527555,0.00012988033,1.6460369e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010694344,0.00008531757,0.0008768339,0.00008922397,0.000048732552,0.000013177755,0.0007145191,0.99191827,0.001344684,0.002661444,0.0008686584,0.00127218],"study_design_scores_gemma":[0.004801888,0.00026510906,0.0009480901,0.00009357306,0.00007510381,0.00007437612,0.00034328317,0.96968406,0.0006067767,0.016122598,0.00679992,0.00018521637],"about_ca_topic_score_codex":0.000006091256,"about_ca_topic_score_gemma":0.000003103359,"teacher_disagreement_score":0.9290513,"about_ca_system_score_codex":0.00006491698,"about_ca_system_score_gemma":0.00006105594,"threshold_uncertainty_score":0.25749934},"labels":[],"label_agreement":null},{"id":"W3143897082","doi":"10.1007/s10878-021-00757-7","title":"The Steiner cycle and path cover problem on interval graphs","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"VLSI and FPGA Design Techniques","field":"Engineering","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":"Surrey Memorial Hospital; Simon Fraser University; Fraser Health","funders":"Austrian Science Fund; TU Graz, Internationale Beziehungen und Mobilitätsprogramme","keywords":"Steiner tree problem; Combinatorics; Mathematics; Hamiltonian path; Path (computing); Cover (algebra); Longest path problem; Discrete mathematics; Set cover problem; Dominating set; Graph; Shortest path problem; Computer science; Set (abstract data type); Vertex (graph theory)","score_opus":0.004398170932766899,"score_gpt":0.19789507340397589,"score_spread":0.193496902471209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143897082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11758691,0.0053205383,0.82980585,0.002071121,0.018810406,0.0008240671,0.000013200882,0.00052248203,0.025045412],"genre_scores_gemma":[0.98742807,0.0011988942,0.011005038,0.000049024526,0.00023388563,0.0000030940603,0.0000022503002,0.00002524962,0.000054485132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993974,0.00004823038,0.00025068386,0.00004900559,0.00016817995,0.00008647823],"domain_scores_gemma":[0.99953556,0.00006758835,0.00008659248,0.00007837353,0.00017906495,0.000052821528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022899693,0.000076939825,0.000123632,0.000044772576,0.00006105569,0.0000944564,0.00007081233,0.00005775041,0.00001148277],"category_scores_gemma":[0.0000673608,0.000054891745,0.000050440118,0.00011796251,0.000016585409,0.00016132309,0.000014112936,0.00016277331,9.1638793e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017816559,0.00017532741,0.0002699506,0.000065869004,0.00020407618,0.00007238765,0.00041849937,0.88136566,0.0030215157,0.07648116,0.026558336,0.011189068],"study_design_scores_gemma":[0.008316739,0.002944125,0.00055630546,0.0009013647,0.00025719733,0.00040926697,0.00027639323,0.61259454,0.047484163,0.28176847,0.043474592,0.0010168387],"about_ca_topic_score_codex":3.815476e-7,"about_ca_topic_score_gemma":6.040919e-8,"teacher_disagreement_score":0.86984116,"about_ca_system_score_codex":0.00003422474,"about_ca_system_score_gemma":0.000027665938,"threshold_uncertainty_score":0.22384204},"labels":[],"label_agreement":null},{"id":"W3162151920","doi":"10.1007/s10878-021-00755-9","title":"A two-machine no-wait flow shop problem with two competing agents","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Job shop scheduling; Theory of computation; Computer science; Flow shop scheduling; Tabu search; Mathematical optimization; Scheduling (production processes); Branch and bound; Upper and lower bounds; Constraint (computer-aided design); Heuristic; Algorithm; Mathematics; Schedule","score_opus":0.007408698531007035,"score_gpt":0.22623472547130521,"score_spread":0.21882602694029818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162151920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005701545,0.00046625253,0.97934955,0.00019867631,0.0067368494,0.00018766498,0.000007068858,0.00018852045,0.007163864],"genre_scores_gemma":[0.111203834,0.00014104001,0.8874543,0.000055303226,0.0009480147,0.000003594753,0.00004977319,0.00007130971,0.00007288062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849147,0.00009025518,0.00059265585,0.00013729572,0.00047100135,0.00021731755],"domain_scores_gemma":[0.99826425,0.00007530997,0.0002631319,0.0001534383,0.0010938578,0.00015002229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035270673,0.00020103024,0.00034553322,0.00014525368,0.000103603765,0.00015773906,0.00015436187,0.0000734411,0.00021790537],"category_scores_gemma":[0.00013527538,0.00018303252,0.00009139319,0.0005120844,0.000020426927,0.00036863412,0.000027152548,0.00034466985,0.000010238479],"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.0000634562,0.000093179326,0.00026033644,0.00003105365,0.000108129614,0.000056548393,0.00017481927,0.9980989,0.00007776387,0.00037401382,0.00015665228,0.000505113],"study_design_scores_gemma":[0.0047864323,0.00012836445,0.000009732818,0.00017208987,0.00007447723,0.00013493838,0.000072570205,0.9931175,0.00076800195,0.00012879723,0.0003925481,0.00021452004],"about_ca_topic_score_codex":0.0000024119756,"about_ca_topic_score_gemma":8.803219e-7,"teacher_disagreement_score":0.10550229,"about_ca_system_score_codex":0.00011912771,"about_ca_system_score_gemma":0.00012821953,"threshold_uncertainty_score":0.746385},"labels":[],"label_agreement":null},{"id":"W3174843980","doi":"10.1007/s10878-006-8459-0","title":"Construction of the nearest neighbor embracing graph of a point set","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Computational Geometry and Mesh Generation","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":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Hong Kong University of Science and Technology; National Science Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Degree (music); Binary logarithm; Bounded function; Omega; Discrete mathematics; Physics","score_opus":0.005909669366623995,"score_gpt":0.21035003031206229,"score_spread":0.2044403609454383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3174843980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07164978,0.00007365613,0.9235081,0.00036214368,0.0039107082,0.000096884934,0.0000020015761,0.0000075214953,0.00038918923],"genre_scores_gemma":[0.8986458,0.000008369621,0.10106977,0.000014433755,0.00024678037,5.418842e-7,0.0000026611476,0.000003849756,0.00000774633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987025,0.00011634126,0.0006037767,0.00008086213,0.00042272088,0.000073751275],"domain_scores_gemma":[0.9978867,0.00009423156,0.0010518343,0.00014723642,0.0007941878,0.000025796582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003964938,0.00007247589,0.00017453473,0.00019383115,0.00007399609,0.00004306921,0.00027904476,0.00005086514,0.000006667107],"category_scores_gemma":[0.00011332984,0.000056127687,0.000121331046,0.0007757318,0.000046864487,0.0005370079,0.000050387098,0.000094893054,1.879644e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002611825,0.00006490111,0.00038560727,0.000011369949,0.000012782408,5.476789e-7,0.00008108962,0.7937821,0.0015234305,0.20338114,0.0001622017,0.00056872226],"study_design_scores_gemma":[0.0035065955,0.00061060523,0.0070705363,0.00020120839,0.00008121121,0.00017974243,0.00007131445,0.62700313,0.083960325,0.27678517,0.0002916158,0.00023855505],"about_ca_topic_score_codex":0.000013677344,"about_ca_topic_score_gemma":4.9072014e-7,"teacher_disagreement_score":0.8269961,"about_ca_system_score_codex":0.000033397275,"about_ca_system_score_gemma":0.00017330195,"threshold_uncertainty_score":0.22888206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027387606,0.00014565416,0.9943435,0.00052970025,0.0019644466,0.00020421694,0.0000057462357,0.000024671375,0.000043277054],"genre_scores_gemma":[0.17234471,0.000041178002,0.8268877,0.000091899215,0.00051163736,0.000008150143,0.00002535621,0.000020261088,0.00006905685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860317,0.00009556595,0.0004270648,0.0002270408,0.0004617921,0.00018538123],"domain_scores_gemma":[0.9979757,0.0002158726,0.00047268666,0.00021352654,0.0010102243,0.00011195908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043928542,0.00014890808,0.00029204218,0.00014485062,0.00018232084,0.00034111855,0.0002637386,0.00007897685,0.000016437421],"category_scores_gemma":[0.0002530751,0.000120699384,0.00007667223,0.00049064896,0.000051539508,0.0009937672,0.00008294306,0.00015164283,6.052121e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080375036,0.0009771821,0.000052694115,0.00015217761,0.00023178189,0.0000957982,0.0013768043,0.9025235,0.0006988055,0.07677143,0.0010529306,0.015263115],"study_design_scores_gemma":[0.003908475,0.0012623781,0.000041871575,0.00012784763,0.00006278907,0.00036816348,0.00005962603,0.9667606,0.0015813342,0.025065145,0.00053638004,0.00022542727],"about_ca_topic_score_codex":0.0000014709494,"about_ca_topic_score_gemma":3.3379905e-7,"teacher_disagreement_score":0.16960596,"about_ca_system_score_codex":0.000076113436,"about_ca_system_score_gemma":0.00023629589,"threshold_uncertainty_score":0.4921978},"labels":[],"label_agreement":null},{"id":"W3194415976","doi":"10.1007/s10878-021-00794-2","title":"A new metric to compare local community detection algorithms in social networks using geodesic distance","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Concordia University","funders":"","keywords":"Geodesic; Theory of computation; Metric (unit); Computer science; Algorithm; Equivalence of metrics; Metric space; Mathematics; Theoretical computer science; Discrete mathematics; Convex metric space; Geometry","score_opus":0.019148137395329702,"score_gpt":0.29009733340416777,"score_spread":0.27094919600883804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194415976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018287374,0.000074072144,0.9806068,0.000044006254,0.0007397557,0.00009273367,0.000001436498,0.000013622122,0.00014018948],"genre_scores_gemma":[0.95123994,0.0000038377043,0.047442082,0.000017246244,0.0012554899,0.0000016626781,0.000014350187,0.000017092958,0.0000082800725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839365,0.00042990397,0.0005928363,0.000108850094,0.00028193157,0.00019284392],"domain_scores_gemma":[0.99871725,0.000106104846,0.0004398697,0.00014082679,0.00048948283,0.00010645395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049591507,0.00014091156,0.0004163499,0.0002701962,0.00024130437,0.00010522361,0.00019174952,0.00004549168,0.00006694879],"category_scores_gemma":[0.000026610358,0.00015624655,0.00016348528,0.001917687,0.000018302948,0.00024253338,0.00007977619,0.0005289323,4.0613637e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007076124,0.000177231,0.002189534,0.0000029646276,0.00005778047,0.0000038380717,0.0001500423,0.97683513,0.00004373001,0.0017198108,0.00027105704,0.018478146],"study_design_scores_gemma":[0.0015292526,0.00009395283,0.0011787874,0.00007901877,0.00011900513,0.0000058544806,0.00036211964,0.9852598,0.0010585128,0.009772798,0.0003141396,0.00022679404],"about_ca_topic_score_codex":0.0004230092,"about_ca_topic_score_gemma":0.000031573145,"teacher_disagreement_score":0.9331647,"about_ca_system_score_codex":0.00031183116,"about_ca_system_score_gemma":0.00016385427,"threshold_uncertainty_score":0.6371549},"labels":[],"label_agreement":null},{"id":"W3211038545","doi":"10.1007/s10878-021-00827-w","title":"Bicriteria streaming algorithms to balance gain and cost with cardinality constraint","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","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 New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Submodular set function; Cardinality (data modeling); Constraint (computer-aided design); Theory of computation; Monotone polygon; Function (biology); Mathematical optimization; Greedy algorithm; Competitive analysis; Computer science; Extension (predicate logic); Online algorithm; Mathematics; Enumeration; Algorithm; Discrete mathematics; Upper and lower bounds","score_opus":0.015028489032291308,"score_gpt":0.2669975924391859,"score_spread":0.2519691034068946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211038545","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017219719,0.00009185333,0.9950142,0.0014070938,0.001105046,0.00016450773,0.000003419279,0.000022179423,0.00046973422],"genre_scores_gemma":[0.22533621,0.0001244301,0.7740014,0.00025776148,0.00019974836,0.000004610809,0.00000586656,0.0000123980335,0.000057566976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986166,0.00019338008,0.00037866854,0.00020209185,0.00042262088,0.00018663637],"domain_scores_gemma":[0.9981088,0.00008878119,0.00023016291,0.00019574534,0.0011429727,0.00023353961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005841594,0.000118067524,0.00026212676,0.00012163913,0.00010794893,0.0003802379,0.00023157116,0.000054615455,0.00001916782],"category_scores_gemma":[0.00019789216,0.00010258792,0.000040279963,0.0005478188,0.00004298592,0.0006388658,0.00010329485,0.00015810196,9.532003e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001065115,0.0002503449,0.0015079743,0.00003977941,0.0000996664,0.00023368894,0.0011514077,0.9382246,0.00078589655,0.04371228,0.00078948966,0.013098335],"study_design_scores_gemma":[0.005325137,0.001024207,0.00070083654,0.0002940381,0.000039720348,0.0007548099,0.00030057188,0.9814827,0.0033673863,0.0025686985,0.0036821617,0.0004597636],"about_ca_topic_score_codex":0.0000048403845,"about_ca_topic_score_gemma":4.6392177e-7,"teacher_disagreement_score":0.22361423,"about_ca_system_score_codex":0.00007692025,"about_ca_system_score_gemma":0.000311345,"threshold_uncertainty_score":0.4183414},"labels":[],"label_agreement":null},{"id":"W384563215","doi":"10.1007/s10878-015-9905-7","title":"The Canadian Tour Operator Problem on paths: tight bounds and resource augmentation","year":2015,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"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":"Combinatorics; Travelling salesman problem; Vertex (graph theory); Operator (biology); Competitive analysis; Theory of computation; Mathematics; Graph; Path (computing); Computer science; Lin–Kernighan heuristic; Discrete mathematics; Bottleneck traveling salesman problem; Mathematical optimization; Upper and lower bounds; Algorithm","score_opus":0.018060388072599094,"score_gpt":0.25227332735515046,"score_spread":0.23421293928255135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W384563215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00521372,0.00095117086,0.8899059,0.052610796,0.013049465,0.0018443312,0.000007223044,0.00016040828,0.036256958],"genre_scores_gemma":[0.68991137,0.00042436126,0.30419257,0.0023359708,0.0014790115,0.000033066823,0.000023701688,0.00007195354,0.0015280271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983868,0.0002469119,0.00040620295,0.00013768785,0.00060817954,0.00021422096],"domain_scores_gemma":[0.99820656,0.00009427901,0.0002899582,0.00018633658,0.0008076068,0.0004152525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014630595,0.00011029005,0.00013785796,0.00019551825,0.0004874369,0.0010095721,0.00043576144,0.00008083626,0.0000049217115],"category_scores_gemma":[0.00024196763,0.000078281235,0.000034430166,0.00037741457,0.000048259637,0.0007713873,0.00005205913,0.00021504241,0.000004091057],"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.00013484691,0.00010580332,0.00020073722,0.000007715169,0.000043567226,0.000021252417,0.0025181044,0.68086433,0.00001382193,0.27965623,0.029153861,0.0072797113],"study_design_scores_gemma":[0.006566068,0.0026985416,0.00014242799,0.000112222006,0.000026169979,0.000092543334,0.00034490795,0.76628125,0.0002876274,0.02342141,0.19961804,0.00040882058],"about_ca_topic_score_codex":0.00032461327,"about_ca_topic_score_gemma":0.0002551927,"teacher_disagreement_score":0.6846976,"about_ca_system_score_codex":0.0003124518,"about_ca_system_score_gemma":0.00092071644,"threshold_uncertainty_score":0.9735327},"labels":[],"label_agreement":null},{"id":"W4280645929","doi":"10.1007/s10878-022-00865-y","title":"Improved approximation algorithms for non-preemptive multiprocessor scheduling with testing","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiprocessor scheduling; Theory of computation; Computer science; Competitive analysis; Multiprocessing; Job shop scheduling; Upper and lower bounds; Scheduling (production processes); Algorithm; Approximation algorithm; Online algorithm; Parallel computing; Flow shop scheduling; Partition (number theory); Mathematical optimization; Mathematics; Combinatorics; Schedule","score_opus":0.014826289961299985,"score_gpt":0.2346524241045523,"score_spread":0.21982613414325233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280645929","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006207561,0.00007651883,0.9902265,0.000044987057,0.0027483695,0.0004397716,0.000011491293,0.00010862398,0.00013619254],"genre_scores_gemma":[0.20512845,0.0000065790528,0.79421216,0.000017283413,0.00046430682,0.00007026598,0.000030190926,0.000060035,0.00001072817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986461,0.00003990495,0.00056300854,0.00014630034,0.00038734722,0.0002173594],"domain_scores_gemma":[0.99820477,0.00019294243,0.0004683516,0.00011189664,0.0009302725,0.000091788046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006033804,0.00018557583,0.0002947475,0.0002540823,0.00030502613,0.00008988001,0.00021325007,0.000068993424,0.000017408785],"category_scores_gemma":[0.00029808734,0.00017962328,0.00007712557,0.00063684053,0.000019883466,0.0004532959,0.000029218121,0.0003312604,3.0460748e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017956091,0.00008065857,0.00003475177,0.000047247057,0.000068985864,0.000002065839,0.0003797635,0.996914,0.00040708223,0.00009008878,0.000020609843,0.0017751681],"study_design_scores_gemma":[0.004034427,0.0007195728,0.000007714396,0.000043252225,0.000069864014,0.000040106694,0.00048930146,0.9921182,0.001960333,0.00026150217,0.000033632725,0.00022210451],"about_ca_topic_score_codex":0.0000017873707,"about_ca_topic_score_gemma":5.8674104e-8,"teacher_disagreement_score":0.19892089,"about_ca_system_score_codex":0.00022220347,"about_ca_system_score_gemma":0.00015032294,"threshold_uncertainty_score":0.7324825},"labels":[],"label_agreement":null},{"id":"W4295008616","doi":"10.1007/s10878-022-00900-y","title":"Linear time algorithms on mirror trees","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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":"Group for Research in Decision Analysis; HEC Montréal; Université du Québec à Chicoutimi","funders":"Agence Nationale de la Recherche","keywords":"Theory of computation; Time complexity; Algorithm; Mathematics; Linear programming; Running time; Isomorphism (crystallography); Graph algorithms; Graph; Combinatorics; Computer science; Discrete mathematics","score_opus":0.015391637546273932,"score_gpt":0.2813810696624643,"score_spread":0.26598943211619036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295008616","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052763657,0.000114438924,0.9806909,0.002042576,0.010071168,0.00029617682,0.000006324831,0.00008988936,0.0014121721],"genre_scores_gemma":[0.18906337,0.000070224145,0.80764824,0.0004658352,0.0013128767,0.000028345063,0.000013846745,0.000074409676,0.0013228484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978876,0.0003646647,0.00038327443,0.00016195656,0.0009806515,0.0002218517],"domain_scores_gemma":[0.9986746,0.00020757574,0.000389871,0.00027906633,0.0003384135,0.00011052643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001164554,0.000107907275,0.0002109039,0.00037541895,0.00030785482,0.00006845991,0.0009946122,0.000035241705,0.00015980563],"category_scores_gemma":[0.00018361036,0.000101325066,0.00011697241,0.00078062364,0.000030970423,0.0005692263,0.00026469555,0.0004154293,0.000015179501],"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.00025775292,0.00036921035,0.000017059065,0.0000022677932,0.000031715485,0.000059998376,0.00020694098,0.9311558,0.00043390834,0.06388645,0.0011749273,0.0024039845],"study_design_scores_gemma":[0.0029190504,0.0032160517,0.00004232444,0.000016163405,0.000011762706,0.00011133574,0.00003547027,0.93919283,0.0015005792,0.04374202,0.008987339,0.00022509789],"about_ca_topic_score_codex":0.000001125972,"about_ca_topic_score_gemma":1.8796039e-8,"teacher_disagreement_score":0.183787,"about_ca_system_score_codex":0.00016659916,"about_ca_system_score_gemma":0.00014646024,"threshold_uncertainty_score":0.41319162},"labels":[],"label_agreement":null},{"id":"W4313400513","doi":"10.1007/s10878-022-00976-6","title":"Approximation algorithms for the lower bounded correlation clustering problem","year":2022,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Postdoctoral Research Foundation of China; National Natural Science Foundation of China","keywords":"Rounding; Mathematics; Cluster analysis; Bounded function; Combinatorics; Theory of computation; Approximation algorithm; Algorithm; Correlation clustering; Generalization; Discrete mathematics; Time complexity; Computer science","score_opus":0.01637880291401984,"score_gpt":0.24217942203516082,"score_spread":0.225800619121141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313400513","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003562696,0.000058361766,0.9882629,0.0012311056,0.009705113,0.00045718224,0.0000029407433,0.000029462493,0.00021734028],"genre_scores_gemma":[0.044617265,0.000043906348,0.9537602,0.00019112375,0.0009467416,0.00008992017,0.000044685876,0.00002411963,0.00028203806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867964,0.00009076041,0.0004308778,0.00013107395,0.0005301609,0.00013747721],"domain_scores_gemma":[0.99870336,0.0001463808,0.00063995185,0.0002099523,0.00026762826,0.000032727592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001318017,0.000091029935,0.00013131165,0.00014260245,0.00052730954,0.00035369713,0.00075373956,0.00002597349,0.000019049172],"category_scores_gemma":[0.00006373126,0.00007299134,0.00009110193,0.00042401862,0.000014773061,0.0014056095,0.00026285514,0.00016768006,7.7999476e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005860666,0.00013731785,0.0000059790564,0.0000083257855,0.000033231066,0.0000017920282,0.00021007098,0.9321685,0.0000059692147,0.04962706,0.0019722607,0.015770894],"study_design_scores_gemma":[0.0014031322,0.00046768037,0.0000119143715,0.000007667118,0.000030035924,0.000015689147,0.000055139364,0.97174203,0.000014214358,0.014600534,0.011563842,0.00008812358],"about_ca_topic_score_codex":0.000002317158,"about_ca_topic_score_gemma":8.7253895e-8,"teacher_disagreement_score":0.044581637,"about_ca_system_score_codex":0.00013687607,"about_ca_system_score_gemma":0.00007088879,"threshold_uncertainty_score":0.4055692},"labels":[],"label_agreement":null},{"id":"W4313887027","doi":"10.1007/s10878-022-00984-6","title":"RETRACTED ARTICLE: The mechanism and test of the impact of environmental regulation and technological innovation on high quality development","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Energy, Environment, Economic Growth","field":"Economics, Econometrics and Finance","cited_by":21,"is_retracted":true,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Anhui Office of Philosophy and Social Science; Federation for the Humanities and Social Sciences","keywords":"Quality (philosophy); Promotion (chess); Environmental quality; Investment (military); Technological change; Business; Industrial organization; Mechanism (biology); Economics; Environmental regulation; Economic system; Natural resource economics; Ecology; Macroeconomics","score_opus":0.019016614265766986,"score_gpt":0.22000485980940415,"score_spread":0.20098824554363717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313887027","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9981543,0.000022338838,0.0011236564,0.0002700978,0.00022985127,0.00011823575,0.000015584314,0.000005180035,0.0000607795],"genre_scores_gemma":[0.998979,0.0000967151,0.0008547822,0.000009228064,0.000031860956,0.0000020068824,0.0000052758096,0.000008048392,0.00001308443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988768,0.00003739609,0.000822981,0.00010630326,0.00007801584,0.000078514466],"domain_scores_gemma":[0.9982489,0.00015862555,0.0014151043,0.00013478428,0.000024469753,0.000018130202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012278394,0.00007937632,0.0002188346,0.00017387513,0.000070102775,0.000016106178,0.00010443223,0.00011974243,0.000030019677],"category_scores_gemma":[0.0005267905,0.000056354365,0.000038939346,0.0003195875,0.00009993804,0.00014837614,0.00005552215,0.00014419609,0.0000013484563],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011165367,0.0003359869,0.13924377,0.0000140565635,0.00010298723,3.8939558e-7,0.00026444328,0.06896194,0.012429316,0.77755016,0.000040584324,0.0009446913],"study_design_scores_gemma":[0.00088439294,0.0002042613,0.89131826,0.000014772976,0.0000061484775,0.0000026763498,0.000034584806,0.0065959655,0.009713369,0.091138676,0.000018041168,0.000068823036],"about_ca_topic_score_codex":0.0000063443817,"about_ca_topic_score_gemma":1.1828325e-7,"teacher_disagreement_score":0.75207454,"about_ca_system_score_codex":0.0001463576,"about_ca_system_score_gemma":0.000016061225,"threshold_uncertainty_score":0.22980644},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007992942,0.000031780542,0.9894461,0.0010327661,0.007886829,0.00034517102,0.000010168731,0.00013505352,0.00031281766],"genre_scores_gemma":[0.0793534,0.00008318036,0.9190154,0.00007203625,0.0012322643,0.000049699396,0.000045715333,0.000031697222,0.000116616364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983308,0.00011075227,0.00061146205,0.00022142533,0.00046177336,0.00026378655],"domain_scores_gemma":[0.9978317,0.00035293677,0.00062978925,0.00024898857,0.0008317832,0.00010481337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010049464,0.00016024325,0.0002864659,0.0005260358,0.00035038523,0.00026291062,0.00056806515,0.00008153617,0.000008878238],"category_scores_gemma":[0.00027362644,0.00015676327,0.00021204041,0.0014280807,0.00004030275,0.0013550376,0.000115163864,0.00021414945,0.000011296468],"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.00008163716,0.00014471926,0.000020091786,0.000027004324,0.00010087302,0.000007728849,0.0008840938,0.80506474,0.0001639768,0.17750204,0.0025848416,0.013418281],"study_design_scores_gemma":[0.0020457662,0.00035674768,0.000046693265,0.000041481908,0.000029676467,0.000024754534,0.00014938416,0.9122912,0.00054955174,0.08317757,0.0011226514,0.00016446528],"about_ca_topic_score_codex":0.0000043832756,"about_ca_topic_score_gemma":3.8421226e-7,"teacher_disagreement_score":0.10722655,"about_ca_system_score_codex":0.00011923742,"about_ca_system_score_gemma":0.00016942872,"threshold_uncertainty_score":0.6392621},"labels":[],"label_agreement":null},{"id":"W4360975061","doi":"10.1007/s10878-023-01012-x","title":"Fast searching on cactus graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Chordal graph; Combinatorics; Mathematics; Graph; Discrete mathematics","score_opus":0.018589754965846778,"score_gpt":0.2992848647634814,"score_spread":0.28069510979763457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360975061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0102008395,0.00002575736,0.9805447,0.0015320223,0.0059502143,0.00016011181,0.0000011861943,0.00013301433,0.0014521702],"genre_scores_gemma":[0.90399975,0.00023031705,0.09475285,0.0001693657,0.00057153025,0.0000057740413,0.000004992005,0.000043052787,0.00022237204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811214,0.00023966293,0.00035078145,0.00015746443,0.00085723377,0.00028271452],"domain_scores_gemma":[0.9984823,0.00035066358,0.00026771214,0.0002795239,0.00042031583,0.00019950235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001266272,0.00010745071,0.00018944993,0.00080353627,0.00017351333,0.00016746808,0.00080821745,0.000059229606,0.000012538219],"category_scores_gemma":[0.0006559665,0.00009394993,0.000113392685,0.0017084766,0.000040694442,0.0008538986,0.0001382467,0.00038041495,0.00003295286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076033,0.0000581988,0.000054244763,0.0000053526064,0.0000192758,0.00005445387,0.00025808156,0.61604977,0.00019424924,0.37763146,0.0010332351,0.0045656497],"study_design_scores_gemma":[0.0022204523,0.0011277464,0.00024600036,0.000085686544,0.000007755711,0.000047470425,0.00006479729,0.3606514,0.0017918708,0.63262767,0.00090466964,0.00022446609],"about_ca_topic_score_codex":0.0000010649592,"about_ca_topic_score_gemma":4.0130566e-8,"teacher_disagreement_score":0.8937989,"about_ca_system_score_codex":0.000074817064,"about_ca_system_score_gemma":0.00015427175,"threshold_uncertainty_score":0.3831167},"labels":[],"label_agreement":null},{"id":"W4360978592","doi":"10.1007/s10878-023-00998-8","title":"A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Uniqueness; Theory of computation; Minimum weight; Linear programming; Matching (statistics); Algorithm; Mathematics; Computer science; Enhanced Data Rates for GSM Evolution; Cover (algebra); Combinatorics; Mathematical optimization; Artificial intelligence","score_opus":0.008549360243585968,"score_gpt":0.2621156453445673,"score_spread":0.25356628510098134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360978592","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036102668,0.0000063276607,0.9841169,0.0048642433,0.006916231,0.00026695133,7.3235367e-7,0.00017844065,0.00003986568],"genre_scores_gemma":[0.07282251,0.000008034801,0.92173827,0.00019061175,0.0050778785,0.000018550758,0.000014562693,0.000036707912,0.00009284503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980714,0.00023641078,0.00048223944,0.00026804867,0.000667951,0.0002739929],"domain_scores_gemma":[0.9986088,0.00016386512,0.00038480546,0.0002693908,0.00040165495,0.0001714725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014564514,0.00016948555,0.00027479828,0.0006401404,0.00020475047,0.0002681797,0.00045753428,0.00008013816,0.000012385286],"category_scores_gemma":[0.0004971051,0.00015091072,0.00013127463,0.0015214031,0.000011793823,0.00043892144,0.00007253548,0.0003822388,0.000033760145],"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.00005465748,0.00011064345,0.00003377982,0.0000091483125,0.000014006119,0.000024420333,0.00037867718,0.9354677,0.00006311261,0.0004482551,0.0007832086,0.06261235],"study_design_scores_gemma":[0.0013214343,0.00095651584,0.00006868987,0.000064656364,0.000014609037,0.00002200757,0.000027964488,0.99241805,0.00025483157,0.00032258886,0.004367645,0.00016098155],"about_ca_topic_score_codex":0.000004134058,"about_ca_topic_score_gemma":1.2028381e-7,"teacher_disagreement_score":0.06921224,"about_ca_system_score_codex":0.00011197077,"about_ca_system_score_gemma":0.00012618264,"threshold_uncertainty_score":0.6153961},"labels":[],"label_agreement":null},{"id":"W4360978753","doi":"10.1007/s10878-023-01002-z","title":"An augmented Lagrangian approach with general constraints to solve nonlinear models of the large-scale reliable inventory systems","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Mathematical Programming","field":"Engineering","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":"Augmented Lagrangian method; Theory of computation; Mathematical optimization; Nonlinear system; Computer science; Nonlinear programming; Lagrange multiplier; Minification; Scale (ratio); Lagrangian relaxation; Mathematics; Algorithm","score_opus":0.011695456112597062,"score_gpt":0.2239217104963334,"score_spread":0.21222625438373632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360978753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017208096,0.000028842986,0.9792688,0.000040024053,0.0016696284,0.0004105006,0.000008799998,0.00010032165,0.0012650103],"genre_scores_gemma":[0.62025577,0.000042109048,0.3790375,0.000034195702,0.00040477212,0.000018363005,0.00004067719,0.000086892505,0.00007972879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881107,0.000038723734,0.00047764202,0.00008702275,0.0003950749,0.0001904849],"domain_scores_gemma":[0.9991452,0.000017832715,0.00019046935,0.000172626,0.00033911623,0.00013474925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048046676,0.00012029076,0.00026336842,0.00015559004,0.000065371874,0.0000584756,0.00020300745,0.000085734486,0.000008605412],"category_scores_gemma":[0.000028985813,0.000086139575,0.000068026486,0.0006272228,0.00003710173,0.0002983044,0.000022244729,0.00014645368,0.000001376013],"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.00002954948,0.00012404559,0.000026167287,0.00008704686,0.00004320819,0.0000010770046,0.0005364257,0.9930788,0.00012327507,0.0055394294,0.0003763477,0.00003458007],"study_design_scores_gemma":[0.001111207,0.00013569037,0.0000040731557,0.00010763341,0.000042216812,0.000008439668,0.0004267468,0.99741405,0.00023005198,0.00026300628,0.00015696809,0.000099911966],"about_ca_topic_score_codex":0.0000023243358,"about_ca_topic_score_gemma":2.70324e-7,"teacher_disagreement_score":0.60304767,"about_ca_system_score_codex":0.00006110763,"about_ca_system_score_gemma":0.000055214077,"threshold_uncertainty_score":0.351267},"labels":[],"label_agreement":null},{"id":"W4381333094","doi":"10.1007/s10878-023-01058-x","title":"Balanced connected partitions of graphs: approximation, parameterization and lower bounds","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Combinatorics; Mathematics; Approximation algorithm; Partition (number theory); Vertex (graph theory); Time complexity; Discrete mathematics; Graph","score_opus":0.0146910651880712,"score_gpt":0.27154278237925394,"score_spread":0.2568517171911827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381333094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08540274,0.000045160217,0.9122623,0.00034794444,0.0015900531,0.00017333718,0.0000032298128,0.000063395404,0.00011179012],"genre_scores_gemma":[0.93245,0.0002064762,0.06722351,0.00001751085,0.000058021586,0.000006860061,0.00001281108,0.000011185587,0.000013599774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986022,0.00017363092,0.0005096551,0.00013467997,0.00042204987,0.00015779218],"domain_scores_gemma":[0.9980814,0.00025063896,0.00050573633,0.00020338397,0.00087467843,0.00008414727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006794013,0.00009194513,0.00022375511,0.0004848515,0.000110552326,0.000097740885,0.00029604268,0.00006761223,0.000008935194],"category_scores_gemma":[0.000612049,0.00008694488,0.000062364306,0.0017868076,0.000093418035,0.0010435275,0.00007273046,0.000118879616,0.0000014412631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017382693,0.00020127589,0.00084982545,0.0000520645,0.000069148395,0.00001033393,0.00054465205,0.35696113,0.004506804,0.6349825,0.00041087068,0.0012375482],"study_design_scores_gemma":[0.0021211174,0.00066325953,0.0012047095,0.00008117332,0.000020099187,0.000022186601,0.00004992014,0.4910819,0.0033972776,0.5010599,0.00013927212,0.00015918055],"about_ca_topic_score_codex":7.5164735e-7,"about_ca_topic_score_gemma":7.08676e-8,"teacher_disagreement_score":0.84704727,"about_ca_system_score_codex":0.000026528605,"about_ca_system_score_gemma":0.00008238983,"threshold_uncertainty_score":0.3545509},"labels":[],"label_agreement":null},{"id":"W4393951975","doi":"10.1007/s10878-024-01144-8","title":"The average size of maximal matchings in graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Graph theory and applications","field":"Mathematics","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":"Theory of computation; Combinatorics; Mathematics; Discrete mathematics; Algorithm","score_opus":0.011279871558782639,"score_gpt":0.2755982248044911,"score_spread":0.26431835324570846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393951975","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83696187,0.0013533735,0.13911778,0.005302318,0.0104739275,0.0008880004,0.000014667301,0.00010020108,0.005787837],"genre_scores_gemma":[0.9887902,0.0001342329,0.010890513,0.0000119460765,0.000098933975,0.0000038822286,5.476153e-7,0.000014239819,0.000055480836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898183,0.00009619742,0.000545789,0.0000603675,0.00022522468,0.000090611065],"domain_scores_gemma":[0.99827117,0.0011522239,0.00027736966,0.00011428995,0.00014737448,0.000037581038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010716821,0.0000734396,0.00016678027,0.00010951704,0.00006787456,0.00005974301,0.0001828833,0.000056547084,0.000027465914],"category_scores_gemma":[0.0006316162,0.00005074,0.000118562675,0.0004104148,0.000046089855,0.00018575393,0.000018869816,0.00021150542,0.0000010021012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007048028,0.00009179167,0.000037965456,0.000035870416,0.000029129451,0.0000047569984,0.00039143403,0.006413165,0.00022952475,0.99177295,0.0006794979,0.00024341808],"study_design_scores_gemma":[0.00044629417,0.000072529896,0.000039118404,0.00010696986,0.000030055297,0.00001685882,0.0000683473,0.00421948,0.00048080285,0.9938119,0.00065751764,0.000050103285],"about_ca_topic_score_codex":0.0000016323978,"about_ca_topic_score_gemma":2.830728e-7,"teacher_disagreement_score":0.15182833,"about_ca_system_score_codex":0.000028141103,"about_ca_system_score_gemma":0.00007326975,"threshold_uncertainty_score":0.20691171},"labels":[],"label_agreement":null},{"id":"W4394951493","doi":"10.1007/s10878-024-01158-2","title":"Differentially private submodular maximization with a cardinality constraint over the integer lattice","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Cryptography and Data Security","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; Theory of computation; Combinatorics; Integer lattice; Cardinality (data modeling); Mathematics; Integer programming; Discrete mathematics; Integer (computer science); Constraint (computer-aided design); Subadditivity; Radical of an integer; Computer science; Mathematical optimization; Prime factor; Algorithm; Physics; Half-integer; Prime (order theory)","score_opus":0.0077886032852589136,"score_gpt":0.2270130398989737,"score_spread":0.2192244366137148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394951493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01743608,0.00029695686,0.97792554,0.0006207884,0.0033720701,0.00015550962,0.0000053327335,0.000054021166,0.0001336959],"genre_scores_gemma":[0.94168967,0.00010166469,0.05774602,0.00006816178,0.0003681574,0.0000029241353,0.000009102286,0.000012111564,0.0000021947794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848366,0.00020188546,0.00041331578,0.00019003822,0.000555451,0.00015567936],"domain_scores_gemma":[0.9988235,0.00014595856,0.00026541742,0.00032072657,0.00036572525,0.00007866939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007466972,0.00014433761,0.000208397,0.00015907057,0.00012521967,0.00069375074,0.0005527163,0.00007368373,0.00002661885],"category_scores_gemma":[0.00008407785,0.0000877933,0.00013846725,0.00072016363,0.00009193451,0.0012105344,0.00009741753,0.00032355855,0.0000013330015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011084277,0.00012754448,0.0005112256,0.000042635656,0.00018826663,0.000053940625,0.0006650531,0.047217537,0.000052103675,0.94901687,0.0004495315,0.0015644606],"study_design_scores_gemma":[0.0029291278,0.0009048897,0.004672005,0.00044088915,0.00035566525,0.00041330527,0.00007424503,0.83381283,0.00067391666,0.14430694,0.010891687,0.00052448537],"about_ca_topic_score_codex":0.000007981364,"about_ca_topic_score_gemma":6.8374686e-7,"teacher_disagreement_score":0.9242536,"about_ca_system_score_codex":0.000061125465,"about_ca_system_score_gemma":0.0001648819,"threshold_uncertainty_score":0.6689854},"labels":[],"label_agreement":null},{"id":"W4395695587","doi":"10.1007/s10878-024-01165-3","title":"Planar graphs are acyclically edge $$(\\Delta + 5)$$-colorable","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Ministry of Science and Technology of the People's Republic of China; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Combinatorics; Planar graph; Theory of computation; Mathematics; Enhanced Data Rates for GSM Evolution; Planar; Outerplanar graph; Chordal graph; Delta; Computer science; Pathwidth; Discrete mathematics; Graph; Physics; Algorithm; Telecommunications; Line graph; Computer graphics (images)","score_opus":0.014175916864579724,"score_gpt":0.2796604955159583,"score_spread":0.26548457865137853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395695587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019208328,0.0008535536,0.9871768,0.0015849187,0.007297837,0.00016116581,0.0000031153536,0.0001202488,0.0008815777],"genre_scores_gemma":[0.7277237,0.0006417713,0.26992527,0.00022312322,0.0011042446,0.000012995884,0.000007722595,0.00006769287,0.00029348533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980139,0.00019427731,0.00053603156,0.00024176892,0.00072421134,0.0002897874],"domain_scores_gemma":[0.9983152,0.00030865034,0.0002906119,0.0003186657,0.0005760258,0.00019082802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010310645,0.0001546599,0.00028357745,0.0005627073,0.00013617765,0.00046762088,0.0010310515,0.00011689415,0.000027247115],"category_scores_gemma":[0.00031649397,0.00013241378,0.00017237032,0.0013829293,0.000063026106,0.0018380203,0.000106909196,0.00047648355,0.000016934162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012609959,0.00015701295,0.0001148062,0.00004359272,0.00008416993,0.00023973822,0.000223059,0.097370096,0.0003857447,0.8931469,0.005596418,0.0025124077],"study_design_scores_gemma":[0.0012987735,0.0006908207,0.00010006546,0.00024072385,0.000029600318,0.00016998632,0.000033569893,0.21782453,0.0010534184,0.7693736,0.00890747,0.00027743742],"about_ca_topic_score_codex":0.0000014569382,"about_ca_topic_score_gemma":1.9218088e-7,"teacher_disagreement_score":0.72580284,"about_ca_system_score_codex":0.00011615778,"about_ca_system_score_gemma":0.00023930256,"threshold_uncertainty_score":0.5399677},"labels":[],"label_agreement":null},{"id":"W4397028703","doi":"10.1007/s10878-024-01173-3","title":"The critical node game","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","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; Ericsson (Canada)","funders":"","keywords":"Theory of computation; Node (physics); Computer science; Mathematical economics; Game theory; Mathematical optimization; Mathematics; Physics; Algorithm","score_opus":0.003957131673184909,"score_gpt":0.24072031586973427,"score_spread":0.23676318419654938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4397028703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004393406,0.0028615962,0.9740376,0.0012366163,0.015592754,0.00005313245,0.0000014755939,0.000087572225,0.0017358853],"genre_scores_gemma":[0.995729,0.00037515213,0.0030334925,0.000011473204,0.0008263338,8.3508854e-7,6.7068396e-7,0.000011971274,0.000011039538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992764,0.00003777046,0.000299387,0.00004518347,0.00023088526,0.00011035343],"domain_scores_gemma":[0.9994009,0.00028531492,0.000024666188,0.000081177706,0.00016197152,0.000045962806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036063674,0.00006623079,0.00011255804,0.00007550803,0.00007029703,0.00020239681,0.00012321945,0.00005757857,0.000049197086],"category_scores_gemma":[0.00028334087,0.00004292286,0.000104655315,0.00025464833,0.00004726171,0.00028751654,0.0000073099654,0.00024073124,0.00000483112],"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.000009039208,0.0000053816893,0.000010348171,0.000021003885,0.000039407136,0.000007031907,0.00006511486,0.9789113,0.00009254591,0.018053565,0.0012182109,0.0015670806],"study_design_scores_gemma":[0.00012798181,0.000045266523,0.000022706476,0.000041236108,0.00006641142,0.00002953936,0.0000330659,0.9720162,0.0005321951,0.016300227,0.010717894,0.00006724873],"about_ca_topic_score_codex":5.2046056e-7,"about_ca_topic_score_gemma":9.0031776e-8,"teacher_disagreement_score":0.99133563,"about_ca_system_score_codex":0.000070712544,"about_ca_system_score_gemma":0.00004232704,"threshold_uncertainty_score":0.19517171},"labels":[],"label_agreement":null},{"id":"W4398143310","doi":"10.1007/s10878-024-01178-y","title":"The frustum network model based on clique extension","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Frustum; Extension (predicate logic); Theory of computation; Clique; Computer science; Mathematics; Combinatorics; Algorithm; Programming language; Geometry","score_opus":0.007567530312318666,"score_gpt":0.23355045132413746,"score_spread":0.2259829210118188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398143310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000204366,0.0002796527,0.98574036,0.0016983976,0.011377385,0.00007679174,2.749013e-7,0.000049561204,0.00057320856],"genre_scores_gemma":[0.84247583,0.00016929435,0.15535541,0.00045786175,0.0014086942,0.0000036212325,0.0000012775935,0.000021934877,0.00010609579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877214,0.00018089425,0.00035107168,0.0001373011,0.00039144928,0.00016715021],"domain_scores_gemma":[0.9988557,0.00038398325,0.00017935659,0.0002448674,0.00026338256,0.000072682196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014842545,0.00010522349,0.00013356723,0.00010305771,0.0002573708,0.00039952673,0.00049530104,0.000071179544,0.0000032950857],"category_scores_gemma":[0.00011022932,0.0000669639,0.00013541832,0.00047800184,0.00002895296,0.00045538862,0.000043248852,0.00029858164,0.0000037221043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037149566,0.000025870651,0.0000013318485,0.0000023852838,0.0000072921057,0.0000122695665,0.000030094472,0.6661031,0.000005834298,0.33043993,0.0014774789,0.0018572636],"study_design_scores_gemma":[0.00027721224,0.00022269804,0.000004766294,0.00008733899,0.0000095197265,0.000008273943,0.0000024465342,0.7914069,0.00006562478,0.20707554,0.00077747606,0.000062207146],"about_ca_topic_score_codex":2.248213e-7,"about_ca_topic_score_gemma":2.085673e-8,"teacher_disagreement_score":0.84227145,"about_ca_system_score_codex":0.00004622339,"about_ca_system_score_gemma":0.00018475455,"threshold_uncertainty_score":0.38526455},"labels":[],"label_agreement":null},{"id":"W4398143410","doi":"10.1007/s10878-024-01177-z","title":"On the oriented diameter of planar triangulations","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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 Saskatchewan","funders":"","keywords":"Combinatorics; Planar graph; Mathematics; Treewidth; Pathwidth; Outerplanar graph; Bounded function; 1-planar graph; Discrete mathematics; Upper and lower bounds; Book embedding; Graph; Chordal graph; Line graph","score_opus":0.015825023237351098,"score_gpt":0.2827445070449693,"score_spread":0.2669194838076182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398143410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015482712,0.0001565556,0.9930569,0.0018373369,0.0027902555,0.000112363545,0.0000016916412,0.000019580284,0.0004770736],"genre_scores_gemma":[0.8796516,0.00005394755,0.119750485,0.00007589914,0.00032675752,0.000004924047,0.0000018989934,0.000018760924,0.000115715484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988159,0.00018872444,0.00034717636,0.000090908106,0.00045924686,0.000098032804],"domain_scores_gemma":[0.9981892,0.0010359872,0.00018644179,0.00022002196,0.0003233203,0.000045012657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079327,0.000067713,0.0001326086,0.00028399559,0.00006772807,0.00008057469,0.00043092418,0.0000380476,0.00003484202],"category_scores_gemma":[0.0005954561,0.00004254268,0.000103999766,0.00082016294,0.000047019108,0.0004522191,0.000031992397,0.00020292017,0.0000037668735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006129822,0.000050846596,0.000009470383,0.0000055179903,0.00003551747,0.000007493894,0.00023370821,0.07870265,0.0001245595,0.91905963,0.0009531539,0.00075616885],"study_design_scores_gemma":[0.0011588163,0.0009451662,0.000056015444,0.00017875653,0.00002770417,0.00002745574,0.000037550657,0.3748191,0.002694581,0.617075,0.002855462,0.00012438779],"about_ca_topic_score_codex":0.0000024474025,"about_ca_topic_score_gemma":1.5539774e-7,"teacher_disagreement_score":0.8781033,"about_ca_system_score_codex":0.00005661299,"about_ca_system_score_gemma":0.00016942556,"threshold_uncertainty_score":0.17348401},"labels":[],"label_agreement":null},{"id":"W4400274608","doi":"10.1007/s10878-024-01186-y","title":"Improved kernelization and fixed-parameter algorithms for bicluster editing","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Web Data Mining and Analysis","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kernelization; Theory of computation; Algorithm; Computer science; Graph algorithms; Mathematics; Parameterized complexity; Theoretical computer science; Graph","score_opus":0.013719061549456483,"score_gpt":0.2644857166018327,"score_spread":0.2507666550523762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400274608","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007425812,0.00026903348,0.9933786,0.0007115416,0.0047545526,0.00007581521,0.0000037596194,0.00003688938,0.000027270251],"genre_scores_gemma":[0.2093246,0.000107416345,0.7881026,0.000100023135,0.0022245054,0.000006057342,0.000021198155,0.000022354858,0.000091201866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999099,0.000043512464,0.000379703,0.00016664057,0.00019189465,0.000119225115],"domain_scores_gemma":[0.9990621,0.00022214334,0.00021627492,0.00011891578,0.00031661516,0.000063922664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006060014,0.00009226861,0.00017266443,0.00022859655,0.00008054505,0.0006051419,0.00022090325,0.000067266395,0.0000038598373],"category_scores_gemma":[0.0003180439,0.00007720864,0.00008607917,0.00034228357,0.000015700218,0.0012421919,0.0000615882,0.000102023354,5.8513564e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023080745,0.00049877353,0.00052232604,0.0006529207,0.0012081658,0.000079923346,0.005103766,0.4588156,0.0040579583,0.11724441,0.029857446,0.3817279],"study_design_scores_gemma":[0.00055777596,0.000202319,0.00000659933,0.00007485724,0.000058586957,0.000025392917,0.000019593357,0.99400765,0.0005125028,0.002739403,0.0017107376,0.00008460879],"about_ca_topic_score_codex":0.000002365709,"about_ca_topic_score_gemma":7.927599e-8,"teacher_disagreement_score":0.535192,"about_ca_system_score_codex":0.00003675399,"about_ca_system_score_gemma":0.00006847428,"threshold_uncertainty_score":0.5835397},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021210972,0.00046404597,0.98294216,0.0007127104,0.013449557,0.000093578994,0.000006138883,0.00010457326,0.00010613835],"genre_scores_gemma":[0.7711929,0.00002848928,0.2277796,0.00009404944,0.0008668158,0.0000022501551,0.000016031923,0.000014246639,0.0000056243975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985935,0.00010975009,0.0004980493,0.00020112717,0.00043859426,0.0001589552],"domain_scores_gemma":[0.9989827,0.0002365143,0.00024417992,0.00017390058,0.00026547437,0.00009721858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004015783,0.00014192761,0.00021543601,0.00031252106,0.00012989774,0.00057347317,0.0003434198,0.000074328076,0.000059690738],"category_scores_gemma":[0.000038411006,0.00013432106,0.00015662187,0.0004855088,0.000043456286,0.0011520075,0.000073973926,0.00029852093,0.000009714295],"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.000064024294,0.00007427727,0.0000031802354,0.000012837061,0.00011015377,0.00002820718,0.0002780703,0.72625774,0.00038100893,0.26677877,0.00045395494,0.005557796],"study_design_scores_gemma":[0.00067498256,0.0002264641,0.000041682863,0.00016430466,0.000056535533,0.00010305773,0.000048691378,0.73920375,0.0001259028,0.2590365,0.00018693757,0.0001312015],"about_ca_topic_score_codex":0.000009887186,"about_ca_topic_score_gemma":3.0634632e-7,"teacher_disagreement_score":0.7690718,"about_ca_system_score_codex":0.00014091934,"about_ca_system_score_gemma":0.00016771411,"threshold_uncertainty_score":0.55300146},"labels":[],"label_agreement":null},{"id":"W4401632632","doi":"10.1007/s10878-024-01203-0","title":"The prize-collecting single machine scheduling with bounds and penalties","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Job shop scheduling; Theory of computation; Scheduling (production processes); Single-machine scheduling; Computer science; Mathematical optimization; Upper and lower bounds; Due date; Schedule; Time complexity; Polynomial-time approximation scheme; Mathematics; Algorithm","score_opus":0.007748863312687487,"score_gpt":0.21411124802457632,"score_spread":0.20636238471188884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401632632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022628086,0.011465458,0.9549404,0.0005815507,0.008722746,0.00016631818,0.0000016250668,0.0002524597,0.0012413651],"genre_scores_gemma":[0.71871865,0.0010354347,0.27922478,0.0000147383325,0.0008293933,0.000003564067,0.0000033415977,0.00006563699,0.000104451436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999157,0.00003475485,0.00033881568,0.00007802744,0.0002531372,0.00013822976],"domain_scores_gemma":[0.9993373,0.00022518799,0.00009392702,0.000070033966,0.0002094544,0.00006406458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004554691,0.00012103865,0.00015337592,0.00013881933,0.00023402859,0.0005991283,0.0000914039,0.000059809037,0.000008783563],"category_scores_gemma":[0.00013662303,0.000080348465,0.00004003747,0.00038643938,0.000042640506,0.00034366027,0.000013431829,0.0002715624,7.156029e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042683332,0.000012237678,0.000036252517,0.000033114364,0.00007993102,0.000007898267,0.00031853205,0.9964574,0.00006414352,0.0012425474,0.000058269394,0.0016469988],"study_design_scores_gemma":[0.00062309,0.00018351164,0.000006298268,0.00016189147,0.0000513753,0.00011573992,0.00015768586,0.9967698,0.00050005154,0.00051083905,0.0008089401,0.000110802386],"about_ca_topic_score_codex":0.0000013584058,"about_ca_topic_score_gemma":5.1804176e-7,"teacher_disagreement_score":0.6960906,"about_ca_system_score_codex":0.000084284744,"about_ca_system_score_gemma":0.000066813765,"threshold_uncertainty_score":0.5777408},"labels":[],"label_agreement":null},{"id":"W4403560623","doi":"10.1007/s10878-024-01207-w","title":"The hamiltonian path graph is connected for simple s, t paths in rectangular grid graphs","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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 Victoria; Brock University","funders":"","keywords":"Theory of computation; Hamiltonian path; Combinatorics; Grid; Mathematics; Hamiltonian (control theory); Hamiltonian path problem; Simple (philosophy); Path (computing); Lattice graph; Discrete mathematics; Simple graph; Graph; Longest path problem; Computer science; Chordal graph; Line graph; Algorithm; Voltage graph; Mathematical optimization; Geometry","score_opus":0.010735848812645252,"score_gpt":0.2803335710840392,"score_spread":0.26959772227139395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403560623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004631953,0.0020882091,0.98214537,0.0021037261,0.008327377,0.00052320206,0.000011927036,0.00007263138,0.000095630014],"genre_scores_gemma":[0.8269367,0.0034234808,0.16766547,0.00038189063,0.0012645907,0.0000957031,0.000022339602,0.00011446321,0.00009537257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804825,0.00025250798,0.00059961487,0.00023581987,0.0005287282,0.00033506873],"domain_scores_gemma":[0.9977935,0.0009212336,0.00024015777,0.00032487666,0.00058927096,0.00013098038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018244463,0.0001500519,0.00024042395,0.00046639284,0.00023415731,0.0004435136,0.0008570652,0.00009623176,0.0000061282603],"category_scores_gemma":[0.0007919106,0.0001092899,0.00020490139,0.001687988,0.0000724672,0.00087098137,0.00008510429,0.00035148513,0.000001321666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002722581,0.00011634924,0.00014412156,0.000042221633,0.00009000633,0.00007489929,0.00092163775,0.038902123,0.0004034714,0.9443879,0.0064614597,0.008183513],"study_design_scores_gemma":[0.0012064781,0.0004967092,0.00004576907,0.00008592472,0.000012232458,0.000028628687,0.000049367558,0.20177478,0.00066344946,0.78775984,0.007732298,0.00014454003],"about_ca_topic_score_codex":0.000004700282,"about_ca_topic_score_gemma":0.0000016465877,"teacher_disagreement_score":0.8223047,"about_ca_system_score_codex":0.000110544766,"about_ca_system_score_gemma":0.00028743863,"threshold_uncertainty_score":0.44567126},"labels":[],"label_agreement":null},{"id":"W4405026148","doi":"10.1007/s10878-024-01237-4","title":"Approximation algorithms for the airport and railway problem","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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 Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Computer science; Approximation algorithm; Algorithm; Mathematical optimization; Mathematics","score_opus":0.015325515364176581,"score_gpt":0.26801951362225956,"score_spread":0.252693998258083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405026148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021613998,0.0013059801,0.993133,0.00037041018,0.0042515513,0.00030960687,0.000002560666,0.00010470456,0.00030606447],"genre_scores_gemma":[0.06514512,0.0006845385,0.9328098,0.000019802994,0.0011684571,0.000024718902,0.000008630486,0.00006586311,0.00007304744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991302,0.000043415734,0.00043109735,0.0000806162,0.0002020578,0.00011259464],"domain_scores_gemma":[0.9991747,0.0003427036,0.000112882226,0.000079671605,0.00024388659,0.000046159745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011751396,0.00010617819,0.00015899043,0.00012974741,0.000086170934,0.00019254393,0.00010065659,0.000083876505,0.000013296063],"category_scores_gemma":[0.00014335083,0.00007830736,0.00006842007,0.00026753003,0.000023847004,0.00040203927,0.000012259051,0.0001668901,5.614325e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013988034,0.000009320858,0.000009869741,0.00010059601,0.00006386087,0.0000011081875,0.00023838297,0.9715592,0.00007641578,0.0060690986,0.0009024359,0.020955686],"study_design_scores_gemma":[0.0005602824,0.00007867414,0.000014304984,0.00007850715,0.00008085548,0.00003839247,0.000032796204,0.9906297,0.0003987182,0.00364047,0.0043592323,0.000088078334],"about_ca_topic_score_codex":4.6468668e-7,"about_ca_topic_score_gemma":2.6894678e-8,"teacher_disagreement_score":0.064928986,"about_ca_system_score_codex":0.000066825414,"about_ca_system_score_gemma":0.000049118025,"threshold_uncertainty_score":0.31932816},"labels":[],"label_agreement":null},{"id":"W4409350685","doi":"10.1007/s10878-025-01279-2","title":"An improved approximation algorithm for covering vertices by $$4^+$$-paths","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Algorithms and Data Compression","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; National Natural Science Foundation of China","keywords":"Theory of computation; Approximation algorithm; Combinatorics; Mathematics; Algorithm; Discrete mathematics; Computer science","score_opus":0.00530167464961042,"score_gpt":0.2531190343717903,"score_spread":0.24781735972217986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409350685","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028199787,0.0001721579,0.9943567,0.00016259054,0.0046978947,0.00021532095,0.000008229757,0.000037050395,0.00006807202],"genre_scores_gemma":[0.01885777,0.000060353726,0.98060393,0.00009553284,0.00030080855,0.000010812142,0.000034622048,0.000010125599,0.00002606995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988939,0.00006609914,0.00047119462,0.00017687725,0.000242386,0.00014952211],"domain_scores_gemma":[0.9985905,0.000098287965,0.00044798266,0.00025069402,0.00053684897,0.00007562981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005053507,0.000115810384,0.00021276483,0.00015369907,0.00016002491,0.00033543492,0.0006214704,0.00009202527,0.0000027164238],"category_scores_gemma":[0.00009529393,0.00010346652,0.0000707893,0.0002966058,0.000014360418,0.0023732425,0.00007481955,0.00010983471,2.8679042e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031542117,0.0014345442,0.00005383405,0.00011313596,0.00017038835,0.0000048884876,0.00057137146,0.225487,0.013568643,0.05729539,0.011785174,0.6892002],"study_design_scores_gemma":[0.0018683422,0.0003978321,0.00000962682,0.00004696386,0.000021897227,0.0000031097436,0.000016815848,0.9833885,0.0051487973,0.0064012352,0.002592137,0.00010478639],"about_ca_topic_score_codex":0.0000054804264,"about_ca_topic_score_gemma":4.3030767e-8,"teacher_disagreement_score":0.7579015,"about_ca_system_score_codex":0.00008443047,"about_ca_system_score_gemma":0.00015539174,"threshold_uncertainty_score":0.4219242},"labels":[],"label_agreement":null},{"id":"W4409889535","doi":"10.1007/s10878-025-01294-3","title":"A 3-space dynamic programming heuristic for the cubic knapsack problem","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Packing Problems","field":"Engineering","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é Laval; Group for Research in Decision Analysis; Center for Interuniversity Research and Analysis on Organizations; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Theory of computation; Heuristic; Continuous knapsack problem; Dynamic programming; Change-making problem; Mathematical optimization; Mathematics; Space (punctuation); Cubic graph; Combinatorics; Cutting stock problem; Computer science; Discrete mathematics; Algorithm; Optimization problem; Graph","score_opus":0.005512764533784442,"score_gpt":0.23783736993849006,"score_spread":0.23232460540470562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409889535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013947609,0.00085712265,0.9915471,0.00070766127,0.005247565,0.0005625236,0.0000021214375,0.000085875225,0.00085057097],"genre_scores_gemma":[0.63541454,0.0011546056,0.36181077,0.00010265031,0.00049434503,0.000089086614,0.000024906441,0.000099751625,0.00080932985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904096,0.00003641528,0.0004809869,0.000082453385,0.00017892726,0.00018026016],"domain_scores_gemma":[0.99894863,0.00024861464,0.0002049719,0.00013215747,0.00042042154,0.000045180892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044116558,0.00013786467,0.00021594384,0.00017351651,0.00014376502,0.00015448786,0.00021408942,0.00009587664,0.000014286506],"category_scores_gemma":[0.00016585765,0.00010710763,0.00011570853,0.00047585226,0.000028566372,0.00019180558,0.00001613778,0.00020114522,0.0000011731066],"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.000046176236,0.000038786406,0.000021743186,0.0001110626,0.00009734828,6.27947e-7,0.00015236663,0.9865311,0.000029457928,0.00792816,0.0020340977,0.0030090879],"study_design_scores_gemma":[0.0016705756,0.00012132226,0.0000136713015,0.00016185688,0.00013107492,0.000007732474,0.000056974583,0.9702745,0.00012928943,0.0033422299,0.02396582,0.00012493886],"about_ca_topic_score_codex":0.000001061482,"about_ca_topic_score_gemma":5.0877844e-7,"teacher_disagreement_score":0.63527507,"about_ca_system_score_codex":0.00012031887,"about_ca_system_score_gemma":0.000089649424,"threshold_uncertainty_score":0.43677223},"labels":[],"label_agreement":null},{"id":"W4410403751","doi":"10.1007/s10878-025-01308-0","title":"Better approximating SONET k-edge partition for small capacity k","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Synchronous optical networking; Partition (number theory); Theory of computation; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Mathematics; Discrete mathematics; Parallel computing; Computer network; Algorithm; Telecommunications","score_opus":0.015262999486374024,"score_gpt":0.2321040588423008,"score_spread":0.21684105935592676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410403751","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006985934,0.000030723586,0.9868953,0.0007099036,0.00480189,0.00016173135,0.0000013305109,0.00002706071,0.0003860937],"genre_scores_gemma":[0.19581012,0.000007457507,0.80343497,0.00026973605,0.0004154961,0.00001137778,0.0000038512508,0.0000074430463,0.00003952504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901676,0.000107365566,0.00046282692,0.00011914452,0.00014769848,0.00014621203],"domain_scores_gemma":[0.99879783,0.00016280371,0.00041501512,0.00014541287,0.00043179077,0.000047117825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093458657,0.00009674616,0.0002019565,0.00017737331,0.0001528751,0.00015474591,0.0003607741,0.000076062075,0.000004340888],"category_scores_gemma":[0.00022162289,0.00008561727,0.00012334471,0.00033770094,0.000024512661,0.00056408317,0.000043097145,0.00013561374,7.783811e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009397461,0.000286864,0.0001646564,0.00008237474,0.00008472179,0.0000030290419,0.0005353944,0.097037904,0.0005411875,0.8896942,0.0013047751,0.010170915],"study_design_scores_gemma":[0.0019308726,0.00022690352,0.000059713853,0.00009604953,0.000036920697,0.000008739859,0.000018996327,0.4996078,0.0049702497,0.49205875,0.0008585597,0.0001264616],"about_ca_topic_score_codex":7.127188e-7,"about_ca_topic_score_gemma":6.387486e-8,"teacher_disagreement_score":0.4025699,"about_ca_system_score_codex":0.000044617493,"about_ca_system_score_gemma":0.00006705195,"threshold_uncertainty_score":0.3491371},"labels":[],"label_agreement":null},{"id":"W4410574230","doi":"10.1007/s10878-025-01302-6","title":"The independent quadratic assignment problem: complexity and polynomially solvable special cases","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Optimization and Packing Problems","field":"Engineering","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":"Northwestern Polytechnical University; National Natural Science Foundation of China","keywords":"Theory of computation; Mathematics; Quadratic equation; Quadratic assignment problem; Combinatorics; Computational complexity theory; Discrete mathematics; Mathematical optimization; Computer science; Optimization problem; Algorithm","score_opus":0.011701139617068293,"score_gpt":0.23002364731210137,"score_spread":0.21832250769503309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410574230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008857261,0.002176957,0.9047599,0.0029552358,0.034133613,0.0013077455,0.000010768144,0.00020232706,0.045596223],"genre_scores_gemma":[0.9619526,0.0015089145,0.034183037,0.000100206664,0.0016759189,0.000011685791,0.000009604757,0.000043147284,0.0005148746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889576,0.000077936995,0.0005371276,0.000077853365,0.0002547237,0.0001565691],"domain_scores_gemma":[0.99926203,0.00016361568,0.00019752888,0.00010330975,0.00020819072,0.00006529694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048334696,0.00012799156,0.00021080782,0.00011779709,0.00023912873,0.00026113185,0.00014590967,0.000083308325,0.000041819527],"category_scores_gemma":[0.00009451081,0.00009978904,0.000051702376,0.0002102774,0.000060920902,0.00022758223,0.00003214568,0.00020782625,0.0000012195057],"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.00007802567,0.000046769324,0.00018323601,0.00003494868,0.00007801043,0.0000044783546,0.0001485596,0.9662116,0.00004219294,0.02628486,0.006016388,0.0008709175],"study_design_scores_gemma":[0.008937747,0.00080233644,0.00074896996,0.00049649057,0.00030826277,0.00014808743,0.00044748606,0.8867061,0.0015060077,0.050126433,0.04906883,0.0007032401],"about_ca_topic_score_codex":0.000005561874,"about_ca_topic_score_gemma":0.0000053271506,"teacher_disagreement_score":0.9530954,"about_ca_system_score_codex":0.00014161239,"about_ca_system_score_gemma":0.0001148906,"threshold_uncertainty_score":0.40692788},"labels":[],"label_agreement":null},{"id":"W4410720775","doi":"10.1007/s10878-025-01325-z","title":"Improved approximation algorithms for multiprocessor indivisible coflow scheduling","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Distributed and Parallel Computing Systems","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":"Theory of computation; Multiprocessing; Computer science; Parallel computing; Multiprocessor scheduling; Scheduling (production processes); Approximation algorithm; Algorithm; Job shop scheduling; Mathematics; Mathematical optimization; Flow shop scheduling","score_opus":0.01377865010263728,"score_gpt":0.2715178212744539,"score_spread":0.2577391711718166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410720775","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090817246,0.00014987728,0.99076104,0.00036489769,0.0072618886,0.00032599238,0.0000027818403,0.000054543652,0.00017080031],"genre_scores_gemma":[0.3928092,0.000009652757,0.60670036,0.000049052618,0.00035780494,0.000009744731,0.000012887286,0.000007581862,0.000043703603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998646,0.00007181501,0.00066521054,0.00017578421,0.0002546533,0.00018654055],"domain_scores_gemma":[0.99774164,0.0001873752,0.0007119664,0.0001825505,0.0011150474,0.00006142443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009784438,0.00012934241,0.0002882614,0.00027039758,0.0001709757,0.00034387037,0.0006241499,0.0001169774,0.0000010497001],"category_scores_gemma":[0.00040236601,0.00012008499,0.000121702156,0.0006537189,0.000014159464,0.0007186515,0.00006573111,0.00014611952,5.7491775e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007217603,0.00017836377,0.00008550534,0.00011147283,0.00007467463,0.0000010803234,0.0002413461,0.9546409,0.00025057374,0.03752459,0.00041488835,0.0064044176],"study_design_scores_gemma":[0.0027972187,0.00019777956,0.000020316349,0.00013700374,0.00002281494,0.000005974637,0.000020763035,0.987092,0.0011759475,0.007560695,0.0008557679,0.0001136768],"about_ca_topic_score_codex":0.0000023346086,"about_ca_topic_score_gemma":4.0272518e-8,"teacher_disagreement_score":0.39190105,"about_ca_system_score_codex":0.0000911196,"about_ca_system_score_gemma":0.0003302056,"threshold_uncertainty_score":0.48969236},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013874227,0.00015536875,0.99133986,0.0019837136,0.005615396,0.00036421372,0.0000017313173,0.000028039067,0.00037294466],"genre_scores_gemma":[0.043953907,0.00003495935,0.95525473,0.0000899024,0.0005218227,0.000025504152,0.0000038188164,0.0000081767375,0.000107175176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880445,0.0000813569,0.0005189755,0.00013229814,0.00030976208,0.00015312988],"domain_scores_gemma":[0.9980379,0.000548305,0.0004844961,0.00020456857,0.000689861,0.000034883677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00114526,0.00010756326,0.00019178988,0.0001902416,0.00032856624,0.00029558348,0.0006381689,0.00006655326,0.0000034091343],"category_scores_gemma":[0.00026091415,0.00007921931,0.00014752432,0.0006385398,0.00003814685,0.0007086944,0.000109331064,0.00017609168,3.476659e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004982819,0.00011228604,0.000010409885,0.000037511894,0.000077493634,0.0000011719873,0.00047038106,0.42941287,0.000046819976,0.5172089,0.0014173092,0.051155046],"study_design_scores_gemma":[0.001412414,0.00015315623,0.00003837309,0.00005770871,0.000030241932,0.000016810847,0.000053522203,0.8790197,0.0004345117,0.117968105,0.0007371232,0.000078337114],"about_ca_topic_score_codex":0.0000026339185,"about_ca_topic_score_gemma":6.618588e-8,"teacher_disagreement_score":0.44960684,"about_ca_system_score_codex":0.00007164902,"about_ca_system_score_gemma":0.00015440652,"threshold_uncertainty_score":0.32304698},"labels":[],"label_agreement":null},{"id":"W4411973470","doi":"10.1007/s10878-025-01332-0","title":"Algorithms for 2-balanced connected k-partition problem in graphs","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","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":"National Natural Science Foundation of China","keywords":"Theory of computation; Partition (number theory); Combinatorics; Computer science; Mathematics; Partition problem; Discrete mathematics; Algorithm","score_opus":0.013535896212277767,"score_gpt":0.3004663665176037,"score_spread":0.286930470305326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411973470","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012817022,0.00008953414,0.9947805,0.0009810281,0.002092675,0.00040600082,0.000001313795,0.000029013738,0.00033822324],"genre_scores_gemma":[0.26693496,0.00008596399,0.732615,0.000120569115,0.00011417196,0.000046695943,0.0000070668434,0.000013052955,0.000062532774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986557,0.00015107876,0.0005377022,0.00016372136,0.00027740726,0.00021442777],"domain_scores_gemma":[0.9983056,0.00029176663,0.00031999074,0.00017878045,0.0008326981,0.00007112752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009274255,0.00010016249,0.00024621247,0.0006255501,0.00008125606,0.00009804025,0.00049732666,0.00008362045,0.000003498566],"category_scores_gemma":[0.0005621436,0.00009577785,0.000091113994,0.0013748395,0.00003481171,0.0008383534,0.0000549048,0.00018755713,4.5715512e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002408298,0.00017794338,0.00023371453,0.000026719004,0.000024690287,0.0000047341623,0.00009666218,0.22752312,0.00048364777,0.76775193,0.0004748047,0.0029611774],"study_design_scores_gemma":[0.0037428911,0.0003258642,0.000103375365,0.00009900418,0.0000071627123,0.000004659187,0.000014298528,0.27222678,0.0019992609,0.7210463,0.0003398624,0.00009050487],"about_ca_topic_score_codex":0.0000014053245,"about_ca_topic_score_gemma":3.0982318e-7,"teacher_disagreement_score":0.26565325,"about_ca_system_score_codex":0.000118979005,"about_ca_system_score_gemma":0.0002514615,"threshold_uncertainty_score":0.39057073},"labels":[],"label_agreement":null}]}