{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0216593,0.0059082634,0.8532277,0.0054826057,0.0013973813,0.0002839157,0.0011184105,0.0011467042,0.10977571],"genre_scores_gemma":[0.49563572,0.0132158855,0.41444007,0.004952924,0.0055200765,0.0021649145,0.0023229043,0.0025764208,0.059171125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99414116,0.0020287836,0.00025497767,0.00087590766,0.0018608315,0.0008382415],"domain_scores_gemma":[0.9250284,0.060512133,0.002669669,0.0044701635,0.00448168,0.002837918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011910784,0.0064501916,0.0039705723,0.007991211,0.0030343828,0.008078653,0.008029032,0.0046047964,0.030757802],"category_scores_gemma":[0.06133685,0.0026164104,0.0033468157,0.008062765,0.010130148,0.014327889,0.012331715,0.013030207,0.0063029877],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026910432,0.00023738907,0.00043476673,0.0007067771,0.000082082195,0.0001444325,0.00032580728,0.04592532,0.0020817898,0.89766026,0.017611936,0.03452035],"study_design_scores_gemma":[0.000034805067,0.00007235952,0.0001839056,0.00028016727,0.000057325775,0.00014481756,0.00008917111,0.12809244,0.0009939255,0.8644246,0.005551453,0.000075106575],"about_ca_topic_score_codex":0.0011433456,"about_ca_topic_score_gemma":0.0022194942,"teacher_disagreement_score":0.030757802,"about_ca_system_score_codex":0.0045580515,"about_ca_system_score_gemma":0.003117857,"threshold_uncertainty_score":0.10289514},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36744234,0.00017061004,0.61410904,0.0016640363,0.00015272209,0.00034554087,0.0011749892,0.002800641,0.012140095],"genre_scores_gemma":[0.92682797,0.00007520261,0.068875834,0.00010953044,0.000025966308,0.000050345647,0.0006825799,0.0002425892,0.0031099517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983718,0.00043451425,0.0000800374,0.00035959567,0.00044319755,0.00031096349],"domain_scores_gemma":[0.9885437,0.007957978,0.0008412213,0.0012273941,0.0010520492,0.00037766848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012976322,0.0007157933,0.0013065739,0.001197429,0.0014215492,0.0026762127,0.002264155,0.002174541,0.007855428],"category_scores_gemma":[0.01547231,0.0006806458,0.0015900809,0.0008677102,0.0022508842,0.005525802,0.0036934703,0.0016277954,0.00083847943],"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.0019002286,0.00041087624,0.007741033,0.00062555977,0.00027875506,0.0024857721,0.0008124325,0.6981817,0.015364215,0.17092797,0.008676792,0.09259469],"study_design_scores_gemma":[0.000079219295,0.00010092435,0.0006750209,0.00003075513,0.00003861908,0.00011561338,0.00017629053,0.8821378,0.006376453,0.109328814,0.0009113222,0.00002924207],"about_ca_topic_score_codex":0.013587389,"about_ca_topic_score_gemma":0.01030153,"teacher_disagreement_score":0.013587389,"about_ca_system_score_codex":0.0010651706,"about_ca_system_score_gemma":0.0024608662,"threshold_uncertainty_score":0.02701658},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0855244,0.001767292,0.87583864,0.0031266205,0.00045510218,0.0004915692,0.0018382765,0.0040229345,0.026935123],"genre_scores_gemma":[0.35168776,0.0010294749,0.6262089,0.0007722141,0.00054691324,0.0005912846,0.0026647411,0.0010970656,0.015401598],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718577,0.00074904057,0.00013816496,0.0006734685,0.00070478715,0.00054882205],"domain_scores_gemma":[0.9915901,0.00480478,0.0005500169,0.0018682505,0.0006422883,0.0005445637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027870794,0.00300004,0.0030877201,0.0026743081,0.0020799143,0.005720101,0.0076281847,0.003673064,0.022295663],"category_scores_gemma":[0.015197668,0.001685338,0.0033930521,0.006370382,0.002318158,0.011773049,0.0052069766,0.0057420493,0.0026528488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018802782,0.0013148495,0.002709818,0.0011062464,0.00033348022,0.0001955839,0.0006457289,0.29068878,0.005143859,0.2434624,0.043671645,0.4088472],"study_design_scores_gemma":[0.00028483968,0.00010866893,0.0005076889,0.00005356552,0.00011277054,0.00012444775,0.0001520701,0.60640764,0.0020600795,0.38517666,0.004971311,0.00004017845],"about_ca_topic_score_codex":0.0065141586,"about_ca_topic_score_gemma":0.015262941,"teacher_disagreement_score":0.022295663,"about_ca_system_score_codex":0.005934219,"about_ca_system_score_gemma":0.004055464,"threshold_uncertainty_score":0.07458639},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051751453,0.0010702303,0.863869,0.004673223,0.00047570688,0.00021935951,0.0023682676,0.00046852112,0.07510413],"genre_scores_gemma":[0.6534854,0.0024113653,0.21351826,0.0023807618,0.0012568426,0.00051118876,0.004396478,0.00042834974,0.12161129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988714,0.0003912912,0.000044231947,0.00024766475,0.0003323717,0.00011315433],"domain_scores_gemma":[0.9963146,0.002058326,0.00033679273,0.0005093815,0.0005194892,0.0002614104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009932455,0.0017440318,0.0009600327,0.0011814366,0.00046068142,0.002071017,0.00097355584,0.0012117738,0.01925368],"category_scores_gemma":[0.009194589,0.0005774133,0.000505046,0.0010856419,0.0013468593,0.0026785654,0.0018202629,0.0020362863,0.0033330556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016519593,0.00015292324,0.0007112484,0.00025254991,0.000097241296,0.00022476052,0.00009734716,0.08445802,0.0036189028,0.7707159,0.03747265,0.10203336],"study_design_scores_gemma":[0.000035339464,0.00007749902,0.00064749987,0.000043899294,0.000021917256,0.00024238789,0.000055740707,0.24248376,0.0012426348,0.74359137,0.011530154,0.000027836448],"about_ca_topic_score_codex":0.00113691,"about_ca_topic_score_gemma":0.0012174572,"teacher_disagreement_score":0.01925368,"about_ca_system_score_codex":0.00076159905,"about_ca_system_score_gemma":0.0009002438,"threshold_uncertainty_score":0.06440997},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050638514,0.0002594376,0.99223495,0.000084187544,0.000066511,0.00012310862,0.000078262834,0.0012467562,0.000842995],"genre_scores_gemma":[0.022090066,0.00013874016,0.9757514,0.00007722052,0.000025162914,0.00025678755,0.00031888162,0.00018173798,0.0011599599],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887687,0.00040665103,0.00007965964,0.0002125015,0.00030076082,0.00012346437],"domain_scores_gemma":[0.9979254,0.0011922775,0.00014461519,0.00033475645,0.00030661523,0.00009630325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015087395,0.0012796334,0.0023169431,0.0021710538,0.0014961333,0.0013088195,0.002382797,0.0018855688,0.006091779],"category_scores_gemma":[0.004717684,0.0012043191,0.0012060468,0.0029543696,0.0008272388,0.0021468133,0.0018124034,0.0021427027,0.0032201875],"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.0007302079,0.00024560018,0.00058017665,0.00025367117,0.00014362365,0.00017730147,0.00020232827,0.19301276,0.019177202,0.026206022,0.010512773,0.7487584],"study_design_scores_gemma":[0.0001352085,0.00019242952,0.00020686771,0.000036513487,0.000058502,0.00019240218,0.00005011353,0.9642169,0.00721767,0.020498455,0.0071544396,0.000040525778],"about_ca_topic_score_codex":0.0045681926,"about_ca_topic_score_gemma":0.0061005102,"teacher_disagreement_score":0.006091779,"about_ca_system_score_codex":0.0010191421,"about_ca_system_score_gemma":0.0024449448,"threshold_uncertainty_score":0.020379007},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018368999,0.000093796225,0.9953992,0.00008604,0.00007067852,0.000022698883,0.000024846913,0.00025045243,0.0022155298],"genre_scores_gemma":[0.038458884,0.00034942597,0.952703,0.00013139164,0.00016722146,0.00011589533,0.00012732873,0.0003668951,0.0075799427],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941814,0.00016277184,0.000029211476,0.00008264679,0.000253943,0.000053341897],"domain_scores_gemma":[0.9992575,0.0003612708,0.000051700667,0.00010568088,0.0001702185,0.00005357297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006232119,0.001257392,0.00077325443,0.0011990886,0.00086056395,0.00075852184,0.001175771,0.00072322675,0.009142227],"category_scores_gemma":[0.0026366324,0.00056435534,0.00083420984,0.001859595,0.0006921867,0.0017181507,0.001559858,0.0016483951,0.0026964121],"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.0002061941,0.0002609699,0.0005598942,0.00035396565,0.00008492214,0.00025218417,0.00019804564,0.10674984,0.056957543,0.22710092,0.019634005,0.5876415],"study_design_scores_gemma":[0.00010060113,0.00019509124,0.00034318792,0.000044626922,0.00005149682,0.00045099977,0.00007698452,0.8166252,0.012743404,0.14247006,0.026849197,0.000049231578],"about_ca_topic_score_codex":0.0013844168,"about_ca_topic_score_gemma":0.0043506837,"teacher_disagreement_score":0.009142227,"about_ca_system_score_codex":0.00032513004,"about_ca_system_score_gemma":0.0008745831,"threshold_uncertainty_score":0.030583799},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36900118,0.010856423,0.3668405,0.016219305,0.0014859149,0.00031206527,0.0011726255,0.00031602455,0.233796],"genre_scores_gemma":[0.82545304,0.008875509,0.09783733,0.001943959,0.0023660858,0.00038929452,0.0019249849,0.0004910877,0.060718793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985002,0.0005575502,0.000057270285,0.00021724757,0.00040730156,0.00026036814],"domain_scores_gemma":[0.9926409,0.0057162256,0.00035256043,0.00033611731,0.00036781305,0.0005864134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001647744,0.001967623,0.0020870017,0.0023700397,0.0024582667,0.004055434,0.0020252445,0.0030184155,0.011783483],"category_scores_gemma":[0.012752017,0.0012562046,0.0022568011,0.004587747,0.0028190075,0.005969141,0.0029969208,0.0056307856,0.00071293605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018982,0.00019297258,0.0010285508,0.00028253283,0.00008802189,0.0002679872,0.0004546095,0.072588086,0.00082161033,0.87525606,0.019414801,0.029415078],"study_design_scores_gemma":[0.00004648807,0.000052799598,0.0006716676,0.000064345135,0.000034433193,0.00018944252,0.00015958532,0.14484389,0.00028006124,0.8457671,0.007868205,0.000021915368],"about_ca_topic_score_codex":0.0031664425,"about_ca_topic_score_gemma":0.0029271634,"teacher_disagreement_score":0.011783483,"about_ca_system_score_codex":0.0024221013,"about_ca_system_score_gemma":0.0010583083,"threshold_uncertainty_score":0.03941965},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07953011,0.0009620451,0.8948684,0.000805807,0.00013550263,0.0002652522,0.0005223951,0.00027157643,0.022639032],"genre_scores_gemma":[0.5970545,0.0011745794,0.38831192,0.0004333976,0.00016192794,0.00050414965,0.0008028198,0.00046188317,0.011094878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994825,0.00022482863,0.0000226908,0.00006670018,0.000102704595,0.00010054459],"domain_scores_gemma":[0.99915385,0.0006065551,0.00006106795,0.0000472637,0.00007505421,0.000056146735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010346151,0.0013688267,0.0013492698,0.0009726074,0.00082218536,0.0015375956,0.001391694,0.0019637276,0.008509533],"category_scores_gemma":[0.0031736104,0.00064591784,0.0010917016,0.0012344721,0.0005966298,0.0022868891,0.0014294996,0.001092892,0.00088171795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040431085,0.00018400913,0.00044040664,0.00031276033,0.00008035936,0.00015660784,0.0001812806,0.8315161,0.004418271,0.073151074,0.006341378,0.08281349],"study_design_scores_gemma":[0.00004895849,0.000077102035,0.00026853645,0.000032744905,0.000024243607,0.000093511255,0.000056135785,0.9153615,0.0016002468,0.079747714,0.0026715253,0.00001774597],"about_ca_topic_score_codex":0.0022008605,"about_ca_topic_score_gemma":0.0025066135,"teacher_disagreement_score":0.008509533,"about_ca_system_score_codex":0.0010375214,"about_ca_system_score_gemma":0.0007707832,"threshold_uncertainty_score":0.028467298},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60755014,0.0016569863,0.24410063,0.0016595831,0.00078727555,0.00034443478,0.0014378865,0.0021167079,0.14034629],"genre_scores_gemma":[0.9375559,0.0004992761,0.043354094,0.00025710705,0.00015283903,0.00009944089,0.0012044914,0.0002920231,0.016584912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991673,0.00017386973,0.00004870095,0.00025018267,0.0001357669,0.00022408526],"domain_scores_gemma":[0.997801,0.00074338994,0.00018617068,0.0006467837,0.00021451343,0.00040819455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048120023,0.00076440343,0.0010540643,0.0012892055,0.0012211063,0.0026022359,0.0012819201,0.0007821326,0.010976906],"category_scores_gemma":[0.0033725088,0.00069384044,0.0008667888,0.0012940044,0.0009191455,0.002588122,0.0017398776,0.0012391979,0.0012697327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016630728,0.00054549717,0.003006073,0.00074593385,0.0002300304,0.001332687,0.0010152897,0.17397027,0.068597086,0.4704082,0.032406636,0.2460792],"study_design_scores_gemma":[0.00017480161,0.00036791968,0.0036023983,0.00008531866,0.00012558336,0.0014761995,0.0007838272,0.28831515,0.021263028,0.64456725,0.039161433,0.00007700727],"about_ca_topic_score_codex":0.0007685939,"about_ca_topic_score_gemma":0.0009559473,"teacher_disagreement_score":0.010976906,"about_ca_system_score_codex":0.001166124,"about_ca_system_score_gemma":0.00047736353,"threshold_uncertainty_score":0.03672141},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65764666,0.00073070306,0.263505,0.005040442,0.00018122945,0.00037984445,0.0029462108,0.0009130871,0.0686568],"genre_scores_gemma":[0.96127725,0.0004347275,0.024136225,0.0005505093,0.0003350451,0.00018712398,0.004062824,0.00028660742,0.008729541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824023,0.00036432536,0.000101196514,0.0005044463,0.0004238088,0.00036613535],"domain_scores_gemma":[0.98852587,0.006815827,0.0019602464,0.00089964276,0.00095029466,0.00084811234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010752912,0.0011911052,0.0012590715,0.0015139283,0.0009782028,0.0042454638,0.0029502022,0.0020377114,0.014032751],"category_scores_gemma":[0.017355258,0.00073920656,0.000701295,0.0033105828,0.0012661604,0.0057677124,0.0019010765,0.0039705667,0.00086711184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001653946,0.0019721214,0.012087587,0.0011456555,0.00020463983,0.0015265424,0.0011670021,0.1786722,0.022374151,0.64181644,0.045286536,0.092093155],"study_design_scores_gemma":[0.0001944266,0.00028207115,0.0029729004,0.00007445564,0.00005993586,0.0011138963,0.0005405662,0.46566302,0.0031434125,0.51951265,0.0064013214,0.000041302792],"about_ca_topic_score_codex":0.0011565319,"about_ca_topic_score_gemma":0.0013607176,"teacher_disagreement_score":0.014032751,"about_ca_system_score_codex":0.0013217373,"about_ca_system_score_gemma":0.0009165193,"threshold_uncertainty_score":0.0469442},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022843903,0.00085768045,0.95953083,0.00074798625,0.00014856059,0.00016309843,0.00034851432,0.0008929316,0.014466446],"genre_scores_gemma":[0.15334448,0.0010558099,0.8363085,0.00025493497,0.00016001193,0.00030474705,0.0011642831,0.00035418296,0.0070530856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930215,0.00016773649,0.00004463362,0.0001530444,0.00021950464,0.00011285862],"domain_scores_gemma":[0.9979532,0.0013189717,0.00015000119,0.00024135763,0.0002309812,0.00010541951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010518964,0.0012071293,0.0012798029,0.0015282204,0.0009644483,0.0023923123,0.002549418,0.0019725077,0.009239484],"category_scores_gemma":[0.0054737427,0.0007383293,0.00123203,0.0024891153,0.0007309922,0.00400264,0.0020165297,0.0022434965,0.0017780251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055100035,0.0003820949,0.0009177789,0.00050821685,0.00010164769,0.00012470975,0.00022858409,0.49172515,0.0038752211,0.11141069,0.02164661,0.36852822],"study_design_scores_gemma":[0.00018858475,0.000093018076,0.00024095894,0.000054647102,0.000044065735,0.00011997286,0.00008490249,0.8859146,0.0013139211,0.106533095,0.0053961696,0.000015964059],"about_ca_topic_score_codex":0.0020356064,"about_ca_topic_score_gemma":0.0037039574,"teacher_disagreement_score":0.009239484,"about_ca_system_score_codex":0.0015459675,"about_ca_system_score_gemma":0.0016843796,"threshold_uncertainty_score":0.03090918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03216536,0.001943507,0.81174517,0.0023469666,0.0016629864,0.00010208651,0.0005378927,0.0013944765,0.1481016],"genre_scores_gemma":[0.5654153,0.0018678874,0.3064361,0.0017577108,0.0010401511,0.00044865353,0.00094634295,0.0016194235,0.120468415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933463,0.00020317016,0.00004267207,0.00009950815,0.00022122794,0.000098845034],"domain_scores_gemma":[0.9992323,0.00031904757,0.00004517627,0.00022639184,0.00012359656,0.00005352678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057907775,0.0005863749,0.0005797855,0.0010052903,0.0009631858,0.001546086,0.0010533128,0.00083012023,0.013202082],"category_scores_gemma":[0.003774264,0.000218986,0.0005880463,0.0009781375,0.0011293198,0.0018655253,0.002567719,0.0018752652,0.0031196657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006338455,0.000017357546,0.00011196527,0.000059610913,0.000006070932,0.000051234612,0.000059095764,0.003226752,0.00087532046,0.93472123,0.007003559,0.053804338],"study_design_scores_gemma":[0.000012624468,0.000021302763,0.00007222642,0.000036785346,0.0000062382096,0.00010521006,0.000017671193,0.02327645,0.0015019153,0.9451825,0.02975767,0.000009327316],"about_ca_topic_score_codex":0.0005329697,"about_ca_topic_score_gemma":0.00076094904,"teacher_disagreement_score":0.013202082,"about_ca_system_score_codex":0.0006877856,"about_ca_system_score_gemma":0.0005526999,"threshold_uncertainty_score":0.044165313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1908747,0.00046003214,0.7474937,0.000893649,0.00022015675,0.0002337407,0.00085500843,0.00036932205,0.05859977],"genre_scores_gemma":[0.6569282,0.00042410498,0.30828187,0.0003334034,0.00014756627,0.00031351345,0.0012139773,0.0004984936,0.03185894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936444,0.0002343366,0.000028127299,0.0001120478,0.00016178394,0.00009932784],"domain_scores_gemma":[0.9988242,0.00057908526,0.00012297864,0.00015315409,0.00015316228,0.00016748352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005893116,0.00081827305,0.0008424713,0.0016531054,0.0009623041,0.002833319,0.0014713822,0.0015737466,0.014388156],"category_scores_gemma":[0.003588419,0.0010367186,0.0007273642,0.0010506,0.0012439099,0.0023548745,0.0027775378,0.002263609,0.001450066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000570083,0.00027206333,0.00087298045,0.00023173545,0.000060114566,0.0003914465,0.00029594533,0.1324514,0.0057512466,0.78828394,0.010788546,0.060030382],"study_design_scores_gemma":[0.00009581619,0.00006617509,0.00048838835,0.00006198258,0.000030010517,0.00032794382,0.00022465074,0.3701289,0.0028931666,0.6172976,0.008356903,0.000028543285],"about_ca_topic_score_codex":0.00081965554,"about_ca_topic_score_gemma":0.0011411307,"teacher_disagreement_score":0.014388156,"about_ca_system_score_codex":0.0006682048,"about_ca_system_score_gemma":0.00040364757,"threshold_uncertainty_score":0.048133135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.082254365,0.00024905056,0.9067028,0.00024142102,0.00039980802,0.00020767163,0.00019317529,0.0013499211,0.00840175],"genre_scores_gemma":[0.655248,0.0001295567,0.33911175,0.00008267845,0.00011129624,0.00019630748,0.0002734345,0.00012690142,0.004720035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994161,0.00015074044,0.00002458122,0.00013466591,0.000138588,0.00013542821],"domain_scores_gemma":[0.9995334,0.00014536773,0.00003250017,0.00009758996,0.00012763028,0.000063528496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008475064,0.0010315031,0.0019487316,0.00087254005,0.0010951604,0.0011735002,0.0024713674,0.0010225635,0.00422682],"category_scores_gemma":[0.001095248,0.00047042198,0.0013126231,0.0012815027,0.00044555828,0.0010347817,0.0010590163,0.0012868065,0.00046129883],"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.00071242463,0.00043044146,0.000516994,0.00021837773,0.00006680322,0.00020368792,0.00009408195,0.8805221,0.013931688,0.010688766,0.0034334236,0.08918118],"study_design_scores_gemma":[0.000041667354,0.0000948364,0.00013405195,0.000002976964,0.00001763363,0.00001792193,0.0000074177474,0.9969177,0.00092574826,0.0012652526,0.0005645712,0.000010237282],"about_ca_topic_score_codex":0.0063913637,"about_ca_topic_score_gemma":0.0062618083,"teacher_disagreement_score":0.0063913637,"about_ca_system_score_codex":0.0010522471,"about_ca_system_score_gemma":0.002443032,"threshold_uncertainty_score":0.014140189},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11041679,0.00038393552,0.8824247,0.0005266821,0.00032973153,0.00012516737,0.000093018614,0.000571147,0.005128887],"genre_scores_gemma":[0.86052674,0.0003332995,0.13471836,0.00012991892,0.00027146304,0.00018195019,0.000139441,0.00025653365,0.003442328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827564,0.0007618301,0.00009108622,0.00024001341,0.00028930197,0.00034223768],"domain_scores_gemma":[0.9941598,0.0033268626,0.00050815,0.00089203217,0.0006622654,0.00045089112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00225728,0.0013387359,0.0021650244,0.0005545933,0.0009310822,0.0016706858,0.0025471637,0.0009553172,0.0027977084],"category_scores_gemma":[0.009062148,0.0011121373,0.000723909,0.001279313,0.0014117917,0.003081223,0.001577661,0.0016043055,0.00036453674],"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.0016020556,0.00022692175,0.00072016055,0.00033427877,0.00010853218,0.00037811292,0.00018933567,0.8249596,0.009251654,0.12726453,0.0030354266,0.031929348],"study_design_scores_gemma":[0.000094547024,0.00012775167,0.000119092525,0.000005132969,0.000021050793,0.000035950365,0.000013345168,0.93485737,0.0013708101,0.06270495,0.00063253375,0.000017513325],"about_ca_topic_score_codex":0.0012509187,"about_ca_topic_score_gemma":0.0016287131,"teacher_disagreement_score":0.0027977084,"about_ca_system_score_codex":0.0007686664,"about_ca_system_score_gemma":0.0014066403,"threshold_uncertainty_score":0.011937737},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36723462,0.0007082193,0.5924688,0.0017777391,0.00016846921,0.0010799946,0.0041949647,0.0053483145,0.027018953],"genre_scores_gemma":[0.3643394,0.00031053016,0.62104946,0.00027321195,0.00005205209,0.00039011848,0.005191972,0.00064554124,0.0077476706],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991196,0.00016130805,0.000051224863,0.00026057186,0.00019295354,0.00021436592],"domain_scores_gemma":[0.996585,0.0018970248,0.00027889042,0.0005919367,0.00028522874,0.0003617919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008023351,0.00094894716,0.0014458245,0.0010997049,0.0010483235,0.0018727722,0.0027569064,0.0015953804,0.014910257],"category_scores_gemma":[0.0047686775,0.00088518305,0.0013092783,0.0014341493,0.0010184281,0.0031401645,0.0035744607,0.001852279,0.002894428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024756119,0.0010368313,0.006685603,0.00262857,0.0002468338,0.0005884745,0.0018088118,0.16666867,0.08597558,0.16960475,0.039324082,0.5229563],"study_design_scores_gemma":[0.0009086793,0.000863198,0.004481699,0.00023626184,0.00029975726,0.0005327656,0.001391661,0.5417827,0.045881998,0.37860885,0.024880737,0.00013164381],"about_ca_topic_score_codex":0.0018548666,"about_ca_topic_score_gemma":0.00517662,"teacher_disagreement_score":0.014910257,"about_ca_system_score_codex":0.0018262063,"about_ca_system_score_gemma":0.001938872,"threshold_uncertainty_score":0.04987973},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062010355,0.0018104643,0.9033445,0.0021589852,0.00042268762,0.0002712964,0.0007265962,0.0016680114,0.027587138],"genre_scores_gemma":[0.25273505,0.00067999994,0.73567516,0.0005315056,0.0002470422,0.00053714786,0.0014136981,0.0007328331,0.0074476018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827206,0.00069736916,0.00007089401,0.00019107913,0.0005416803,0.00022689413],"domain_scores_gemma":[0.9915793,0.006286535,0.00032979177,0.0007306535,0.0008668545,0.00020688782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00280191,0.0015735076,0.0016596153,0.0026428467,0.0012914668,0.003546089,0.0027940553,0.0025725865,0.013838806],"category_scores_gemma":[0.021032564,0.0009458388,0.0010806785,0.0029692943,0.0015789106,0.0032856788,0.0019166954,0.003418273,0.0020120812],"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.0011553961,0.00053346384,0.0014196719,0.0003727566,0.000086704174,0.00008565343,0.00023071116,0.62725437,0.003268048,0.112612955,0.019940061,0.23304023],"study_design_scores_gemma":[0.00013154751,0.000086692904,0.00021470395,0.00005673176,0.00002137047,0.000044768058,0.000038357204,0.9256779,0.0006932708,0.070694745,0.0023222796,0.000017635793],"about_ca_topic_score_codex":0.003618048,"about_ca_topic_score_gemma":0.0042609572,"teacher_disagreement_score":0.013838806,"about_ca_system_score_codex":0.0021617757,"about_ca_system_score_gemma":0.0022511552,"threshold_uncertainty_score":0.046295404},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015826824,0.000046042147,0.9965442,0.000027375783,0.0000102681115,0.000026658916,0.000015379608,0.00010048879,0.0016470191],"genre_scores_gemma":[0.115889765,0.00024345829,0.87727785,0.000061719365,0.00003525572,0.00020951498,0.00009272228,0.0001708916,0.0060187127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972075,0.000078874786,0.000012403227,0.000034513192,0.00012820149,0.00002524182],"domain_scores_gemma":[0.9996413,0.00017695513,0.00004010611,0.000036225705,0.0000927003,0.000012619444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006658054,0.0007644216,0.00048644614,0.0005035664,0.00045238849,0.00050640566,0.0012080169,0.00048039065,0.0036325334],"category_scores_gemma":[0.0011978357,0.0005097533,0.000752961,0.00054230023,0.00052742136,0.00068606256,0.0007928416,0.0008593476,0.0006602259],"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.000019625357,0.00002802383,0.0001363736,0.0000811256,0.000020791884,0.00003221665,0.000028245668,0.900829,0.0050933375,0.019908039,0.00068154105,0.073141605],"study_design_scores_gemma":[0.0000031462612,0.000019032432,0.000039313174,0.0000045108704,0.000004269031,0.000014956846,0.0000033201902,0.99530435,0.00067245367,0.003245285,0.0006862066,0.0000032508742],"about_ca_topic_score_codex":0.0035326772,"about_ca_topic_score_gemma":0.006508135,"teacher_disagreement_score":0.0036325334,"about_ca_system_score_codex":0.0006737393,"about_ca_system_score_gemma":0.0011533585,"threshold_uncertainty_score":0.012152076},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19528082,0.00033349206,0.7953925,0.00049231265,0.000059042904,0.00016301367,0.00021738648,0.0006300574,0.007431367],"genre_scores_gemma":[0.5480293,0.00033505884,0.44439062,0.00015989762,0.00006319555,0.00032214043,0.0005439192,0.00020673255,0.005949122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995307,0.0002223699,0.000017160393,0.00009593644,0.00007485124,0.000059111208],"domain_scores_gemma":[0.997382,0.002153639,0.00014800538,0.00015275003,0.00008235124,0.0000811469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010387354,0.00048609878,0.0008049503,0.0008145191,0.0006313084,0.0011443518,0.0011917214,0.00093709445,0.0039884364],"category_scores_gemma":[0.004269236,0.0006657115,0.00083406555,0.0011306631,0.00085601694,0.0017853685,0.0011793582,0.0009927077,0.0003218996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030859266,0.000092284965,0.0009034389,0.00008836119,0.000036074747,0.00011698277,0.00013536723,0.8317138,0.0029437947,0.08883903,0.0014867493,0.07333552],"study_design_scores_gemma":[0.000071676965,0.00006424757,0.00017581797,0.000011596098,0.000017056087,0.000033111864,0.00004039034,0.92897755,0.0014103168,0.06806978,0.0011190847,0.000009301204],"about_ca_topic_score_codex":0.0018926437,"about_ca_topic_score_gemma":0.0027993307,"teacher_disagreement_score":0.0039884364,"about_ca_system_score_codex":0.00083945197,"about_ca_system_score_gemma":0.0007095957,"threshold_uncertainty_score":0.013342679},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007973875,0.0047168066,0.96428585,0.0003849209,0.00020618387,0.00008277064,0.00008715882,0.00027846254,0.02198393],"genre_scores_gemma":[0.3081075,0.012050001,0.6367476,0.0006870007,0.0004576391,0.00069419487,0.000359936,0.00047102603,0.040425055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879444,0.0004770819,0.00007413375,0.00016228427,0.00041525243,0.000076726996],"domain_scores_gemma":[0.9964252,0.0024767548,0.00015585929,0.00034351673,0.00048331948,0.000115306684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024387306,0.0013001789,0.0012211069,0.0023707964,0.0007423289,0.0020300883,0.0026418653,0.0021108405,0.0048416564],"category_scores_gemma":[0.011556918,0.0005793919,0.000811265,0.0038285572,0.0016877353,0.0028204126,0.0023013053,0.0018671127,0.0015330826],"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.00008001367,0.000121979516,0.00029024458,0.00022425284,0.000057568126,0.000066306144,0.00012681105,0.067246616,0.00069589354,0.727343,0.007002237,0.19674501],"study_design_scores_gemma":[0.000031810225,0.00004908789,0.00007216258,0.000055680866,0.000027061456,0.00007821185,0.000030425927,0.29613602,0.0006360777,0.6931871,0.009677772,0.00001864453],"about_ca_topic_score_codex":0.0014550741,"about_ca_topic_score_gemma":0.0014107474,"teacher_disagreement_score":0.0048416564,"about_ca_system_score_codex":0.0011864242,"about_ca_system_score_gemma":0.0011368884,"threshold_uncertainty_score":0.016196966},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000023582901,0.0030022254,0.00008294748,0.028143417,0.9677912,0.00001878691,0.00004969542,0.00002551148,0.00086252514],"genre_scores_gemma":[0.00048281383,0.0022666408,0.00012746322,0.016153574,0.9725696,0.000033719745,0.000039182753,0.00003099502,0.008296065],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949064,0.0009981565,0.0007451013,0.0007509048,0.0021945983,0.0004049236],"domain_scores_gemma":[0.97779924,0.007022424,0.002310388,0.00069034577,0.009585333,0.002592348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077469144,0.0053196205,0.0063129556,0.006042829,0.0044433395,0.009230112,0.0055095037,0.020185795,0.019941319],"category_scores_gemma":[0.035700656,0.001546357,0.0038159147,0.002467011,0.0034188593,0.0041183946,0.003013658,0.018277347,0.016399302],"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.000028989323,0.000008124029,0.000023974482,0.00012513294,0.000023679606,0.00014360607,0.000007052277,0.000022212602,0.00002980675,0.00012503285,0.99718946,0.0022729193],"study_design_scores_gemma":[0.00008253351,0.00003186162,0.00042283276,0.00041801043,0.00014251769,0.0004084832,0.000044197186,0.00025516085,0.00015394649,0.0008767872,0.9971378,0.000025973415],"about_ca_topic_score_codex":0.001946002,"about_ca_topic_score_gemma":0.0057140235,"teacher_disagreement_score":0.020185795,"about_ca_system_score_codex":0.003938876,"about_ca_system_score_gemma":0.0028049,"threshold_uncertainty_score":0.06671041},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4219412,0.017956115,0.35691229,0.014046254,0.0017501827,0.0002669661,0.0014430048,0.0007005624,0.18498343],"genre_scores_gemma":[0.8798357,0.019170646,0.034513988,0.0016632323,0.0024431578,0.00035129004,0.0011088088,0.00049898727,0.06041416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914014,0.00034719353,0.000030715786,0.00011232111,0.0001896009,0.00018001953],"domain_scores_gemma":[0.98174286,0.014631083,0.0011708931,0.0006536633,0.0010376313,0.0007638947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014380984,0.0011776373,0.0020478931,0.003009289,0.0018610725,0.0025362654,0.0025503412,0.0018833086,0.011902342],"category_scores_gemma":[0.01695005,0.00095370616,0.0008169338,0.0052676564,0.0029106599,0.0046729697,0.0024683,0.002217126,0.00090833864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004995351,0.00014657131,0.0015325464,0.0007242409,0.00008852935,0.00029129736,0.00081946485,0.12775227,0.0028001852,0.77981514,0.033595,0.051935166],"study_design_scores_gemma":[0.00010813012,0.0000768757,0.00070260395,0.00014438656,0.00008588103,0.0001873908,0.000267571,0.1854379,0.0006417789,0.80482507,0.0074839895,0.00003843611],"about_ca_topic_score_codex":0.006908836,"about_ca_topic_score_gemma":0.0067239953,"teacher_disagreement_score":0.011902342,"about_ca_system_score_codex":0.002905407,"about_ca_system_score_gemma":0.0013219306,"threshold_uncertainty_score":0.039817274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46879435,0.005145777,0.30493632,0.008725436,0.0010497159,0.00021698182,0.00160555,0.0009421396,0.20858367],"genre_scores_gemma":[0.84254223,0.001985347,0.080651306,0.0016603267,0.00096988294,0.0002319895,0.0022854458,0.0005043387,0.069169156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989479,0.00043682952,0.000027774135,0.00018283738,0.0002689079,0.00013580726],"domain_scores_gemma":[0.99532324,0.0027291547,0.0005221186,0.0003910357,0.00032774243,0.0007068247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089135685,0.001129438,0.0017139676,0.0032577189,0.0019730933,0.004170395,0.0021696698,0.0028176284,0.014261179],"category_scores_gemma":[0.007015435,0.0013806289,0.0011746114,0.0024007931,0.0029234262,0.0032881266,0.0024432614,0.004299382,0.0013458636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008523535,0.00003492335,0.0005892827,0.000077403805,0.000038490674,0.00007206425,0.00014724089,0.010927915,0.00042562577,0.9693414,0.008491468,0.009768951],"study_design_scores_gemma":[0.00002633132,0.000013990288,0.00033374035,0.00001915341,0.0000136503895,0.0000665311,0.000066116554,0.023061242,0.00012940449,0.9727333,0.0035284918,0.0000079215],"about_ca_topic_score_codex":0.0027293921,"about_ca_topic_score_gemma":0.0026516581,"teacher_disagreement_score":0.014261179,"about_ca_system_score_codex":0.0016456086,"about_ca_system_score_gemma":0.00061890564,"threshold_uncertainty_score":0.047708392},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111284265,0.00037565888,0.9760607,0.00032535382,0.00013938513,0.00010425783,0.00019077887,0.0006151532,0.011060199],"genre_scores_gemma":[0.2131635,0.00031092035,0.7779811,0.00034288928,0.00009634674,0.00035528457,0.00052790414,0.0003710945,0.0068509425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991135,0.0002545684,0.00003249578,0.00016359311,0.00024580566,0.00019002215],"domain_scores_gemma":[0.9986947,0.00085552083,0.00008806071,0.0001555879,0.00013638772,0.00006969139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013785758,0.0018510673,0.0020318427,0.0009260456,0.0008907044,0.0024219505,0.0019020902,0.0017368648,0.01396683],"category_scores_gemma":[0.004516654,0.0007699229,0.0009599536,0.0016136104,0.0008682565,0.0021151016,0.002182842,0.0021678878,0.0019886522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041293012,0.00024535772,0.0003624276,0.00025879598,0.000059869948,0.00013037847,0.00009266916,0.7651382,0.0022268614,0.06566601,0.014801354,0.1506052],"study_design_scores_gemma":[0.00004880316,0.000046080793,0.0000405675,0.000026367536,0.000007883885,0.000036381367,0.00002706905,0.9762659,0.0005210826,0.021548433,0.0014231254,0.0000083388995],"about_ca_topic_score_codex":0.0033215564,"about_ca_topic_score_gemma":0.0056576035,"teacher_disagreement_score":0.01396683,"about_ca_system_score_codex":0.001320511,"about_ca_system_score_gemma":0.0019142083,"threshold_uncertainty_score":0.046723723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08014039,0.0055722627,0.8329415,0.0034654178,0.00067471596,0.00012767827,0.00018028857,0.00022253643,0.07667523],"genre_scores_gemma":[0.7118748,0.0057774554,0.24047919,0.0010351785,0.0011506125,0.000490014,0.00041557688,0.00019073658,0.038586397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988439,0.000589796,0.000044012642,0.00013277923,0.00030184913,0.00008762314],"domain_scores_gemma":[0.99411595,0.0048995344,0.00031637977,0.00029627318,0.00025398325,0.00011787866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021074403,0.00094827655,0.0012824544,0.0017859312,0.00093921344,0.0025865273,0.0014959964,0.0019527883,0.0062958533],"category_scores_gemma":[0.012994166,0.0007807423,0.0008025722,0.0029000153,0.002793177,0.0033168208,0.0017421427,0.0026704548,0.00058728235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005124057,0.000045172837,0.0001712351,0.000066791894,0.000023693818,0.000026912188,0.000043061493,0.07065205,0.00022763826,0.8991262,0.0025333203,0.027032826],"study_design_scores_gemma":[0.000024347106,0.000018827715,0.00006247576,0.000020938236,0.000007683019,0.000032015905,0.00001388315,0.19106174,0.00015278757,0.806999,0.0015971067,0.000009038471],"about_ca_topic_score_codex":0.0009142508,"about_ca_topic_score_gemma":0.0009107149,"teacher_disagreement_score":0.0062958533,"about_ca_system_score_codex":0.0015829967,"about_ca_system_score_gemma":0.0013289207,"threshold_uncertainty_score":0.021061778},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21158814,0.006556508,0.4931699,0.0130217085,0.0037421167,0.001153007,0.007479816,0.015535321,0.24775353],"genre_scores_gemma":[0.4804068,0.0018001058,0.43287972,0.004198416,0.0009001383,0.0009745187,0.0091841165,0.002352558,0.067303695],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709976,0.00051411404,0.00012474506,0.00056463847,0.0008685464,0.0008283256],"domain_scores_gemma":[0.99695575,0.0014923026,0.00012588393,0.00079607463,0.00035836652,0.00027164986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020015836,0.002804708,0.0026626938,0.0017611429,0.001796167,0.003950847,0.0032090917,0.0037112723,0.05365356],"category_scores_gemma":[0.009624103,0.0007428055,0.0026620848,0.0021966887,0.0013343958,0.003993653,0.0038556876,0.0038970062,0.016369846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005879266,0.00288479,0.0039816233,0.0015962798,0.00039188864,0.0005302994,0.00061533874,0.10271859,0.023964975,0.11413372,0.20847185,0.5348314],"study_design_scores_gemma":[0.0014988512,0.001269312,0.0031882166,0.0006352766,0.00046664057,0.0009988359,0.0008367957,0.5601469,0.013269085,0.349604,0.06794044,0.0001455773],"about_ca_topic_score_codex":0.0041588834,"about_ca_topic_score_gemma":0.008509673,"teacher_disagreement_score":0.05365356,"about_ca_system_score_codex":0.0035565388,"about_ca_system_score_gemma":0.005565645,"threshold_uncertainty_score":0.17948908},"labels":[],"label_agreement":null},{"id":"W2012939571","doi":"10.1023/a:1009893108387","title":"Steiner k-Edge Connected Subgraph Polyhedra","year":2000,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Polytope; Polyhedron; Combinatorics; Mathematics; Theory of computation; Discrete mathematics; Graph; Enhanced Data Rates for GSM Evolution; Computer science; Algorithm","score_opus":0.008733764535961423,"score_gpt":0.2215240309997457,"score_spread":0.2127902664637843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012939571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45387128,0.0007632834,0.43002176,0.0021893675,0.00023061695,0.00037184634,0.0038589207,0.00079844013,0.10789451],"genre_scores_gemma":[0.7499719,0.0010071306,0.21252339,0.00043543574,0.00010202145,0.00025803733,0.00482841,0.00036077003,0.030512964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993395,0.00018500372,0.000048825845,0.00013293182,0.00017928747,0.00011440514],"domain_scores_gemma":[0.99877673,0.00052794884,0.0001741158,0.00024052948,0.00013249544,0.00014815679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003148282,0.00085523876,0.0012330689,0.00084138504,0.0009989272,0.0021015212,0.0020012883,0.0015036057,0.019680444],"category_scores_gemma":[0.0024158934,0.0008669403,0.0009903413,0.0020374428,0.0009084299,0.003167948,0.0019025891,0.0018562011,0.0026377651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010191964,0.00036129783,0.0025530318,0.0008990962,0.00019634611,0.0010418246,0.0004977406,0.29721743,0.015041635,0.51568633,0.03104883,0.13443725],"study_design_scores_gemma":[0.00015305646,0.00014484905,0.0017150939,0.00009203619,0.000073746385,0.00090288726,0.00038314454,0.38229007,0.005397953,0.595248,0.013555159,0.000044042525],"about_ca_topic_score_codex":0.0008531822,"about_ca_topic_score_gemma":0.0015099383,"teacher_disagreement_score":0.019680444,"about_ca_system_score_codex":0.0007190172,"about_ca_system_score_gemma":0.00048365773,"threshold_uncertainty_score":0.06583762},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08857974,0.008299173,0.8228117,0.011470922,0.0011868554,0.0006685224,0.0017468171,0.0006452249,0.064591035],"genre_scores_gemma":[0.6093247,0.008389079,0.33800793,0.0029708461,0.00493384,0.0012014355,0.003538021,0.0008766684,0.030757584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959604,0.0013650681,0.00015581942,0.00073546666,0.0012600453,0.00052317436],"domain_scores_gemma":[0.96401924,0.0303876,0.001324675,0.0018626478,0.0015606539,0.00084521604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005587839,0.0026594023,0.0028878257,0.005138592,0.002508128,0.0061858096,0.006903014,0.0026989202,0.0178081],"category_scores_gemma":[0.03837359,0.0014460945,0.0039039762,0.0071470276,0.00411703,0.017101685,0.00488955,0.009501214,0.001400629],"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.0004953234,0.0012194789,0.0039940206,0.001210088,0.00026222278,0.0003166243,0.0005158785,0.2679532,0.0021647604,0.59230244,0.034757055,0.094809],"study_design_scores_gemma":[0.000057512152,0.00007344757,0.00071285205,0.00008749798,0.00010599007,0.00014970933,0.00018085107,0.7153601,0.00045521528,0.27726054,0.00552064,0.00003554003],"about_ca_topic_score_codex":0.0049219127,"about_ca_topic_score_gemma":0.006939509,"teacher_disagreement_score":0.0178081,"about_ca_system_score_codex":0.0049158446,"about_ca_system_score_gemma":0.0034535269,"threshold_uncertainty_score":0.059574068},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008418364,0.0036778864,0.00014029864,0.031366345,0.9629822,0.000030809853,0.000091891096,0.000052637184,0.0015737597],"genre_scores_gemma":[0.0010381744,0.0027880105,0.00020355138,0.024560671,0.9586366,0.00004157799,0.00008988464,0.000060372397,0.012581135],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976301,0.00035696634,0.00036625547,0.00041757518,0.00096748443,0.0002615552],"domain_scores_gemma":[0.9870675,0.0044962666,0.0010887091,0.00042076714,0.0051627294,0.0017640332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005057596,0.003769915,0.0038643894,0.0036696035,0.0025971136,0.0069940123,0.0032368645,0.015347583,0.020707438],"category_scores_gemma":[0.02126453,0.0013562377,0.0030740455,0.0016916204,0.0016831446,0.0030468747,0.0015143487,0.013826175,0.009247073],"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.00010385744,0.00001753484,0.000058848815,0.00014640926,0.000026395986,0.00016210093,0.000004149629,0.000032603148,0.00008810914,0.00012751413,0.99519724,0.0040352037],"study_design_scores_gemma":[0.00024298627,0.00008466358,0.0014098203,0.00036140272,0.00015537365,0.00046624875,0.000037084123,0.00057341426,0.00031531454,0.0007512601,0.99557567,0.00002680925],"about_ca_topic_score_codex":0.0022229173,"about_ca_topic_score_gemma":0.0063269483,"teacher_disagreement_score":0.020707438,"about_ca_system_score_codex":0.0032891068,"about_ca_system_score_gemma":0.0020700968,"threshold_uncertainty_score":0.06927323},"labels":[],"label_agreement":null},{"id":"W2014708079","doi":"10.1007/s10878-014-9774-5","title":"Improved approximations for buy-at-bulk and shallow-light $$k$$ k -Steiner trees and $$(k,2)$$ ( k , 2 ) -subgraph","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Combinatorics; Steiner tree problem; Mathematics; Bounded function; Graph; Integer (computer science); Tree (set theory); Approximation algorithm; Function (biology); Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.008175121224844557,"score_gpt":0.21915758837031976,"score_spread":0.2109824671454752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014708079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12373678,0.005409786,0.80090666,0.006677188,0.0011072782,0.0006910619,0.004628246,0.00701619,0.049826786],"genre_scores_gemma":[0.4233326,0.0018289436,0.54063916,0.0017750311,0.0006446387,0.00059410214,0.0062986873,0.0030919118,0.021794887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99665546,0.0009148462,0.00013275885,0.00059530995,0.0008443396,0.00085731625],"domain_scores_gemma":[0.98486274,0.009631582,0.00061179564,0.002889698,0.001018215,0.000985957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042911307,0.0039326884,0.004636405,0.0024306076,0.0019912517,0.005278484,0.008272212,0.004523527,0.032533444],"category_scores_gemma":[0.029103069,0.002123458,0.0036158727,0.0046994872,0.0025129737,0.012648313,0.004955624,0.006277605,0.005997569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020373284,0.0008398965,0.0026494926,0.0009891181,0.00023750926,0.000275998,0.0004862663,0.67836845,0.002478867,0.11280472,0.0728059,0.12602647],"study_design_scores_gemma":[0.00010712432,0.00006672575,0.00025504493,0.00006891118,0.00007461969,0.000087025204,0.00012926516,0.91875935,0.0005205619,0.077413484,0.0024965974,0.000021313266],"about_ca_topic_score_codex":0.012801433,"about_ca_topic_score_gemma":0.03336058,"teacher_disagreement_score":0.032533444,"about_ca_system_score_codex":0.0077903047,"about_ca_system_score_gemma":0.006885245,"threshold_uncertainty_score":0.10883516},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015196265,0.00023143576,0.97280407,0.00060373597,0.00026117833,0.00025831873,0.00051546685,0.003786531,0.0063429847],"genre_scores_gemma":[0.059598166,0.00011140942,0.9305581,0.00029653727,0.000091422655,0.00025861434,0.0015495121,0.0005694881,0.006966836],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986626,0.00023217958,0.00006234058,0.00038250527,0.0004211018,0.00023927301],"domain_scores_gemma":[0.998147,0.00054115243,0.00009692341,0.00072654686,0.0003148064,0.00017347482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088352856,0.0020584762,0.0018709031,0.0018120384,0.00093413633,0.0022778877,0.0035338623,0.002099926,0.024658494],"category_scores_gemma":[0.004512328,0.00083635765,0.0019008758,0.0029675954,0.0007975712,0.0040845633,0.0029879257,0.004214315,0.0057211365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010790464,0.00083812524,0.0010549494,0.00038290065,0.00015903615,0.00020939406,0.00023280646,0.16640812,0.022726314,0.03968082,0.043151714,0.72407675],"study_design_scores_gemma":[0.000357334,0.0001788483,0.00045941683,0.000030367477,0.000088942885,0.00022199987,0.000090204754,0.92714536,0.0070663597,0.04734907,0.016975138,0.00003690124],"about_ca_topic_score_codex":0.00562571,"about_ca_topic_score_gemma":0.009707372,"teacher_disagreement_score":0.024658494,"about_ca_system_score_codex":0.0017616642,"about_ca_system_score_gemma":0.0022906326,"threshold_uncertainty_score":0.08249092},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47467095,0.010564827,0.18436192,0.0078035854,0.0010284664,0.00014331262,0.0018358786,0.00063969044,0.3189514],"genre_scores_gemma":[0.93265337,0.0064127953,0.028216597,0.0010559817,0.0017585099,0.00019574593,0.0013909758,0.0004171324,0.027898822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988527,0.00027067008,0.000054970304,0.00030032222,0.0002934702,0.00022775085],"domain_scores_gemma":[0.98283964,0.012883525,0.0011497391,0.0010307502,0.00082643924,0.0012699174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024491595,0.0019463291,0.0011173477,0.0066134124,0.0022828877,0.0047099995,0.0037621043,0.0016155981,0.016074892],"category_scores_gemma":[0.013810696,0.0011312993,0.0016003919,0.0059804237,0.0057632867,0.008120798,0.0030572338,0.0052403477,0.0009495015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036765356,0.00017282064,0.0043389243,0.00051931856,0.000095562405,0.00017350317,0.00072240195,0.02737867,0.00386702,0.92163736,0.01005924,0.03066757],"study_design_scores_gemma":[0.00006587299,0.000073801835,0.0034701095,0.0001117351,0.00010925643,0.00017917497,0.00027713974,0.03713176,0.0019604082,0.94960314,0.006953128,0.00006449241],"about_ca_topic_score_codex":0.003317111,"about_ca_topic_score_gemma":0.0043407846,"teacher_disagreement_score":0.016074892,"about_ca_system_score_codex":0.0035511758,"about_ca_system_score_gemma":0.0012487188,"threshold_uncertainty_score":0.053775907},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03256072,0.00061418035,0.9615547,0.00027603554,0.00008927986,0.00017589229,0.00024170204,0.0020973869,0.0023900531],"genre_scores_gemma":[0.2979442,0.00023791529,0.69503033,0.00029775754,0.00019092408,0.00040766998,0.0013575347,0.0008078107,0.003725922],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651885,0.00089095137,0.00020512508,0.0012722345,0.00081036985,0.00030235024],"domain_scores_gemma":[0.9879731,0.007869223,0.00066243863,0.0018725372,0.0011032913,0.00051927223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041568913,0.0011646448,0.0035543526,0.004878468,0.0018789932,0.0027809183,0.0062894486,0.003702717,0.009921503],"category_scores_gemma":[0.016917046,0.0014450421,0.0025659013,0.0044900957,0.0018306483,0.0077877846,0.0060927668,0.003741837,0.0019789406],"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.00069603574,0.00054415234,0.0031457115,0.00040443847,0.00035520768,0.00012365551,0.00030862287,0.3770512,0.0034390204,0.0676019,0.011563168,0.5347669],"study_design_scores_gemma":[0.000073047915,0.00006354986,0.00022539515,0.00001911608,0.00003635619,0.0000709895,0.000045633722,0.9174084,0.00088919996,0.080141835,0.0010117891,0.000014725206],"about_ca_topic_score_codex":0.002090173,"about_ca_topic_score_gemma":0.0034380942,"teacher_disagreement_score":0.009921503,"about_ca_system_score_codex":0.0019184201,"about_ca_system_score_gemma":0.0012685625,"threshold_uncertainty_score":0.033190668},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117602855,0.001001403,0.8606448,0.0017839698,0.0000826025,0.00008266341,0.00017002114,0.00041281723,0.018218875],"genre_scores_gemma":[0.76563734,0.0015054409,0.22286819,0.0003736697,0.00029165047,0.00043262693,0.00035303883,0.00045409097,0.008084073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939907,0.00028203122,0.000019354395,0.0000644708,0.00013407927,0.00010113927],"domain_scores_gemma":[0.9919699,0.007050587,0.0002760345,0.00025876323,0.00026838612,0.00017630056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002176752,0.0008844167,0.0015910025,0.0012193606,0.00125748,0.002084593,0.0021080622,0.0016004612,0.0058131656],"category_scores_gemma":[0.008666353,0.00087438355,0.0012694164,0.0020250317,0.002490534,0.003857197,0.0011562681,0.0025246788,0.00048762606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078395446,0.0002789171,0.00062401616,0.00012656637,0.00003358399,0.000033224715,0.00007062467,0.71609044,0.00040423137,0.26720497,0.0019798228,0.013075195],"study_design_scores_gemma":[0.00000771921,0.0000057859384,0.000028836454,0.0000025728918,0.0000025856632,0.0000037176424,0.0000061107667,0.9564585,0.00006523163,0.043329515,0.00008656849,0.0000028824259],"about_ca_topic_score_codex":0.0039211395,"about_ca_topic_score_gemma":0.0040571536,"teacher_disagreement_score":0.0058131656,"about_ca_system_score_codex":0.0015702298,"about_ca_system_score_gemma":0.0017111583,"threshold_uncertainty_score":0.01944691},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8999698,0.00070454174,0.05464219,0.001450527,0.0000982898,0.00007856205,0.00045490955,0.00023159721,0.042369697],"genre_scores_gemma":[0.9810364,0.00023118389,0.009337334,0.0002296155,0.00006129433,0.00004748471,0.00022029657,0.000070255264,0.0087660905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987795,0.0003883339,0.000058114776,0.00026862443,0.00019778547,0.00030769786],"domain_scores_gemma":[0.9930541,0.0044481084,0.0008844909,0.00049841346,0.00034481008,0.00077003846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011947533,0.0008204444,0.0011958213,0.0018202852,0.002338698,0.0040779463,0.0018589948,0.0016258917,0.009698358],"category_scores_gemma":[0.0067477184,0.00073982816,0.0006531604,0.0014823865,0.0024730454,0.005399643,0.0022445824,0.0013865584,0.0008348353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015091808,0.0004011176,0.007751084,0.0006215476,0.00017895944,0.0016225701,0.0016339906,0.049485385,0.011372074,0.8615755,0.010792656,0.05305593],"study_design_scores_gemma":[0.000243395,0.00018867105,0.0023880242,0.000108411026,0.00018395035,0.0011379536,0.000998196,0.08777566,0.0053130477,0.8968207,0.004780038,0.0000619307],"about_ca_topic_score_codex":0.0011336835,"about_ca_topic_score_gemma":0.0025136552,"teacher_disagreement_score":0.009698358,"about_ca_system_score_codex":0.0009440819,"about_ca_system_score_gemma":0.00073251384,"threshold_uncertainty_score":0.03244424},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5537844,0.0013172647,0.41441104,0.0021063245,0.00022380755,0.00074272277,0.0045732255,0.0029918042,0.01984947],"genre_scores_gemma":[0.53218913,0.00070423185,0.45074078,0.00038798395,0.00012383965,0.00033089131,0.006746495,0.0008414497,0.007935199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984157,0.0003520229,0.00008646518,0.0005334481,0.00032864223,0.00028376377],"domain_scores_gemma":[0.99284947,0.005440923,0.00035792188,0.0005560424,0.00037841816,0.00041726077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011564454,0.0021078235,0.002876995,0.002276751,0.0016986689,0.0033177368,0.002910534,0.0028243593,0.018652664],"category_scores_gemma":[0.009826774,0.0020073566,0.0024847882,0.0037610857,0.0017447959,0.008858945,0.00419208,0.0032829815,0.0014624685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016293973,0.0009972343,0.0065846783,0.0017769784,0.00039971736,0.00051917,0.00075175654,0.59251547,0.009283179,0.10642637,0.02053373,0.25858232],"study_design_scores_gemma":[0.00023007287,0.00027358986,0.00090693263,0.0001129231,0.000097270815,0.000157763,0.00048957247,0.7228134,0.0028042037,0.26803997,0.0040423376,0.00003199045],"about_ca_topic_score_codex":0.0052404967,"about_ca_topic_score_gemma":0.012700183,"teacher_disagreement_score":0.018652664,"about_ca_system_score_codex":0.001998792,"about_ca_system_score_gemma":0.0015508396,"threshold_uncertainty_score":0.062399447},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019788675,0.00012191165,0.97756654,0.0001532645,0.00012884793,0.000071522736,0.000092873845,0.00034500548,0.0017312466],"genre_scores_gemma":[0.5648515,0.0002916614,0.42822722,0.00035778678,0.00045865306,0.00032208196,0.000565389,0.00025832138,0.004667381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99675876,0.0015734446,0.00012814107,0.00037654908,0.0009859925,0.00017713646],"domain_scores_gemma":[0.9823632,0.013256345,0.00058393815,0.0014538864,0.0019152784,0.00042732785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039800066,0.0010960402,0.0014990045,0.0019452354,0.00051314634,0.0014829081,0.0020993373,0.0016863542,0.004466679],"category_scores_gemma":[0.028575405,0.00047562123,0.0007007201,0.0018445826,0.0016346454,0.0026656978,0.0019397025,0.001405662,0.0010489033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001611428,0.00037224175,0.0046405895,0.00045584855,0.00029256652,0.0007946823,0.00014309365,0.3718664,0.035778802,0.23142861,0.006671535,0.34594405],"study_design_scores_gemma":[0.00003727994,0.00010727028,0.00037260182,0.000012119762,0.00002262942,0.00015948783,0.000010447478,0.9692673,0.00292528,0.026238637,0.0008226754,0.000024230083],"about_ca_topic_score_codex":0.0014303011,"about_ca_topic_score_gemma":0.0010830954,"teacher_disagreement_score":0.004466679,"about_ca_system_score_codex":0.00061239704,"about_ca_system_score_gemma":0.0012781152,"threshold_uncertainty_score":0.021048546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30706415,0.0020684733,0.4268905,0.007892941,0.00056869775,0.00038916385,0.00240141,0.00097349385,0.2517512],"genre_scores_gemma":[0.80444443,0.0020246024,0.111572586,0.0035451306,0.0007543435,0.000717059,0.0026774295,0.0004927433,0.073771596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997624,0.00092185044,0.00009573882,0.00053605216,0.0005168615,0.00030556647],"domain_scores_gemma":[0.9866572,0.00812238,0.00076236,0.0012136603,0.0016217014,0.0016226637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027200747,0.001874339,0.0023198163,0.0024379082,0.002821644,0.0059825783,0.0026889225,0.003111797,0.01945089],"category_scores_gemma":[0.014876872,0.0017177067,0.0013164148,0.002126603,0.0026480085,0.00879354,0.003413986,0.005694233,0.0032063457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035477564,0.00022365351,0.0011544354,0.00023710699,0.0001087419,0.00022910953,0.00028161771,0.009961997,0.0027484193,0.94716406,0.01803073,0.019505396],"study_design_scores_gemma":[0.000059388276,0.000043361884,0.0002927149,0.00003069658,0.00004156076,0.00028940514,0.00010735884,0.019626236,0.0011490918,0.9741169,0.0042271796,0.000016176471],"about_ca_topic_score_codex":0.00042193633,"about_ca_topic_score_gemma":0.0008870237,"teacher_disagreement_score":0.01945089,"about_ca_system_score_codex":0.0015286927,"about_ca_system_score_gemma":0.0011191885,"threshold_uncertainty_score":0.065069735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018543689,0.00019835288,0.9775278,0.0006159615,0.000051387553,0.00016722623,0.00034712296,0.00054604013,0.002002365],"genre_scores_gemma":[0.17899942,0.00021821377,0.8130914,0.0003999634,0.00020071457,0.0005808754,0.0012033,0.00032493233,0.004981163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726033,0.0012796206,0.00014481529,0.00064449786,0.00033853998,0.00033215227],"domain_scores_gemma":[0.97646403,0.02132328,0.00074808166,0.0005492513,0.00069363497,0.00022163268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057474724,0.0016825374,0.003630118,0.0018383599,0.0011046113,0.0031374656,0.004104174,0.003004483,0.008920434],"category_scores_gemma":[0.016593987,0.0033671837,0.002336306,0.0028342002,0.0016540209,0.004027117,0.0021330086,0.004095654,0.0011401974],"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.00018532615,0.00020271589,0.0013143527,0.00018519504,0.00014186226,0.00018280772,0.000081967446,0.9351788,0.0006187396,0.008207243,0.0020741841,0.051626734],"study_design_scores_gemma":[0.00005161452,0.000027647293,0.00011373094,0.000010313458,0.00003075602,0.00002387609,0.000019512276,0.98778665,0.00028857897,0.011416465,0.00022304482,0.00000784593],"about_ca_topic_score_codex":0.009856276,"about_ca_topic_score_gemma":0.008922826,"teacher_disagreement_score":0.009856276,"about_ca_system_score_codex":0.0016599377,"about_ca_system_score_gemma":0.0031270909,"threshold_uncertainty_score":0.030395865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46331075,0.012549655,0.40529788,0.0071476237,0.0008704536,0.00027831428,0.0037276556,0.0020662835,0.10475131],"genre_scores_gemma":[0.90603435,0.005871113,0.067070834,0.0009587779,0.0007819752,0.00046319433,0.0026808258,0.00083154463,0.015307237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785644,0.00044707296,0.00007515596,0.00037620758,0.00055379124,0.0006912591],"domain_scores_gemma":[0.97312295,0.02049986,0.0011446079,0.0019501714,0.0011954049,0.0020869358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029737258,0.002757259,0.0028723697,0.0033093023,0.0015816174,0.0031839663,0.0046359673,0.0026073484,0.0115363365],"category_scores_gemma":[0.02297097,0.00086229347,0.0020511583,0.002283772,0.0032411523,0.0043939007,0.004220214,0.0046197046,0.0019059505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021337278,0.00042806193,0.0059023406,0.0019507366,0.0004922207,0.00077167474,0.0011568307,0.39968234,0.0428858,0.42272845,0.02969284,0.09217504],"study_design_scores_gemma":[0.00014279566,0.0005830629,0.0032967126,0.00035641526,0.0003434269,0.0013005468,0.00038048075,0.6640426,0.014000277,0.30239046,0.012956393,0.00020686725],"about_ca_topic_score_codex":0.0017692231,"about_ca_topic_score_gemma":0.0013627498,"teacher_disagreement_score":0.0115363365,"about_ca_system_score_codex":0.0020815707,"about_ca_system_score_gemma":0.0013745642,"threshold_uncertainty_score":0.038592875},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2195997,0.0017076491,0.66456056,0.007444151,0.0009075918,0.0038110996,0.0095393555,0.009468022,0.082961835],"genre_scores_gemma":[0.42812216,0.0005730549,0.53318435,0.0009258587,0.0002003498,0.0012659503,0.008317052,0.0010117119,0.026399577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773836,0.000441802,0.00008501046,0.0007772253,0.0003089671,0.0006485788],"domain_scores_gemma":[0.99558926,0.00251052,0.00026733725,0.00056886475,0.0003860119,0.0006780699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016116174,0.0030437834,0.004240959,0.0022414322,0.003483916,0.0040921816,0.008950352,0.0049842647,0.034197338],"category_scores_gemma":[0.0070639923,0.0015817975,0.0019635016,0.0037737836,0.0021894493,0.0062942547,0.0043836664,0.0038437853,0.004010078],"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.00246409,0.001652251,0.002139628,0.0010648351,0.00025588062,0.00036906594,0.0004647148,0.6432492,0.003365465,0.06828017,0.09744879,0.17924589],"study_design_scores_gemma":[0.00071456307,0.00019551365,0.0004937129,0.00005570056,0.00008055361,0.00013354367,0.0003332098,0.94320726,0.0009839021,0.048230562,0.0055055073,0.000065925386],"about_ca_topic_score_codex":0.07809363,"about_ca_topic_score_gemma":0.11369433,"teacher_disagreement_score":0.07809363,"about_ca_system_score_codex":0.007102969,"about_ca_system_score_gemma":0.015570918,"threshold_uncertainty_score":0.1552782},"labels":[],"label_agreement":null},{"id":"W2046371296","doi":"10.1023/a:1014895808844","title":"Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks","year":2002,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Relaxation (psychology); Polytope; Theory of computation; Rank (graph theory); Matrix (chemical analysis); Dimension (graph theory); Semidefinite programming; Projection (relational algebra); Discrete mathematics; Algorithm; Mathematical optimization","score_opus":0.015041707881023478,"score_gpt":0.2364874729956339,"score_spread":0.22144576511461045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046371296","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1762666,0.0011760913,0.69184166,0.0041228877,0.00028943198,0.00026375562,0.0014796668,0.00079123926,0.123768725],"genre_scores_gemma":[0.8172467,0.0016249773,0.119766586,0.0012957691,0.00080040883,0.00058221014,0.0018599494,0.0008057919,0.05601757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982444,0.0006452551,0.00006045967,0.00027369254,0.00051746465,0.00025878262],"domain_scores_gemma":[0.99543625,0.0024670842,0.0007574514,0.00033399244,0.00048229215,0.00052296754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021815877,0.0015216208,0.0016847478,0.0017729669,0.001562211,0.0056099645,0.0030233876,0.0019781308,0.015209977],"category_scores_gemma":[0.009349895,0.0012439478,0.0011347407,0.0016291947,0.0028349215,0.0058985404,0.0029556043,0.0057639894,0.0021047476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007392558,0.0000456391,0.000072095354,0.00006325114,0.000010964524,0.000039465493,0.00013090725,0.020301957,0.0005367806,0.9684844,0.0047859713,0.005454659],"study_design_scores_gemma":[0.00003585059,0.000034604822,0.00010176966,0.000016512633,0.000007873738,0.00006179121,0.00006534861,0.06889521,0.00032994983,0.92832005,0.0021133518,0.000017721519],"about_ca_topic_score_codex":0.0012428263,"about_ca_topic_score_gemma":0.0010908045,"teacher_disagreement_score":0.015209977,"about_ca_system_score_codex":0.0021976305,"about_ca_system_score_gemma":0.001121075,"threshold_uncertainty_score":0.0508824},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.296441,0.0007936565,0.67866766,0.0013076576,0.00013089272,0.000051560437,0.00013589236,0.00030009827,0.022171553],"genre_scores_gemma":[0.94004065,0.00047040675,0.04488834,0.00021005094,0.00008364944,0.00006860058,0.000090627924,0.00007122232,0.014076504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996582,0.00010439832,0.000013458072,0.00006401058,0.00009907876,0.000060890186],"domain_scores_gemma":[0.9968425,0.0019763263,0.00041763444,0.000244841,0.0003080163,0.00021069488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006718519,0.00047743952,0.00058308424,0.0009689014,0.00060638884,0.0012316416,0.00095324556,0.0017734811,0.0042573917],"category_scores_gemma":[0.006296939,0.0004979337,0.0005781402,0.000854989,0.0023444023,0.001989137,0.0013262453,0.0012787471,0.0005082568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022964772,0.000036774905,0.0009419673,0.00007399265,0.00003741863,0.00016871987,0.00011126526,0.21698101,0.004430865,0.75767577,0.0016654484,0.017647097],"study_design_scores_gemma":[0.000038938455,0.00007000426,0.00033721156,0.000022030315,0.000016562279,0.00017716303,0.00004696749,0.45966825,0.001280523,0.53706443,0.0012499337,0.00002802418],"about_ca_topic_score_codex":0.0010515131,"about_ca_topic_score_gemma":0.00097545644,"teacher_disagreement_score":0.0042573917,"about_ca_system_score_codex":0.00076313445,"about_ca_system_score_gemma":0.00059844943,"threshold_uncertainty_score":0.014242351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06787394,0.007024073,0.75133574,0.014738653,0.0014989112,0.0003677069,0.0034944618,0.0029052082,0.1507613],"genre_scores_gemma":[0.6261546,0.005248858,0.28657588,0.0050627906,0.0022040755,0.00086815836,0.0029418643,0.0031844892,0.067759305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942287,0.0009053723,0.00019442374,0.0010447603,0.0023822512,0.0012445262],"domain_scores_gemma":[0.9721309,0.019744145,0.00077021506,0.003996067,0.0016000473,0.0017586997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005129926,0.0031877598,0.0034665207,0.0032957443,0.0025664894,0.0073589394,0.010487552,0.004941534,0.04504799],"category_scores_gemma":[0.031671714,0.002009835,0.0028590518,0.004595532,0.0057691834,0.020213146,0.01192767,0.01279962,0.0065416535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010845382,0.00047630657,0.0023199143,0.0012772781,0.00016908094,0.00023816964,0.00054252334,0.09498472,0.009975777,0.7169397,0.048420705,0.123571225],"study_design_scores_gemma":[0.00011222313,0.00012994147,0.00068269373,0.00013132016,0.00011226638,0.00023368461,0.000083693376,0.22569883,0.0027177676,0.7601238,0.0099069355,0.00006696582],"about_ca_topic_score_codex":0.0037875404,"about_ca_topic_score_gemma":0.006249409,"teacher_disagreement_score":0.04504799,"about_ca_system_score_codex":0.0060712406,"about_ca_system_score_gemma":0.003179044,"threshold_uncertainty_score":0.15070057},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058343634,0.0002799386,0.990137,0.00028541582,0.00007460535,0.000089626286,0.00011938991,0.0005203291,0.0026594347],"genre_scores_gemma":[0.115362875,0.0003074765,0.87707645,0.00032221232,0.00013546388,0.00037497064,0.000761122,0.0003131045,0.005346357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984756,0.00050465984,0.000065238644,0.0002837729,0.00041184737,0.00025893663],"domain_scores_gemma":[0.9979874,0.0010643806,0.0001339959,0.0002670286,0.00036904635,0.00017819843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025190567,0.0017963415,0.0032164047,0.0014947,0.00088954845,0.0026938731,0.0043771635,0.0030367118,0.009637156],"category_scores_gemma":[0.00714559,0.0013056134,0.0017416626,0.0034058755,0.0009079631,0.0030294978,0.003038781,0.004286551,0.0022134485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003153711,0.0005196234,0.00077999505,0.0001911595,0.00008706516,0.00009857904,0.000097692835,0.7195208,0.0014313083,0.03731737,0.013934301,0.22570677],"study_design_scores_gemma":[0.00003604127,0.000027691152,0.0000545339,0.000009066674,0.000009152149,0.000023995843,0.000014122164,0.9904525,0.00018082904,0.008244864,0.00094047433,0.00000679584],"about_ca_topic_score_codex":0.008374583,"about_ca_topic_score_gemma":0.009595326,"teacher_disagreement_score":0.009637156,"about_ca_system_score_codex":0.0023306212,"about_ca_system_score_gemma":0.0040881126,"threshold_uncertainty_score":0.032239497},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003158223,0.00011013361,0.9921631,0.000031944604,0.00007269418,0.00006934384,0.00017460926,0.0037490895,0.0004708874],"genre_scores_gemma":[0.017985538,0.000049412654,0.9796107,0.000034554894,0.000032920383,0.00012641461,0.0005318596,0.00048300961,0.0011456008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973115,0.00048397412,0.00023252622,0.00075397076,0.0010550431,0.00016301751],"domain_scores_gemma":[0.9967056,0.0012563708,0.0001405864,0.000721609,0.0010303223,0.0001455238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018236066,0.0015637163,0.0024398782,0.0030737517,0.0012949347,0.0019665482,0.0039758994,0.0020205257,0.009850456],"category_scores_gemma":[0.006941964,0.00077558646,0.0014536814,0.0037152872,0.0005970252,0.0025279748,0.0025760268,0.002308347,0.0040670484],"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.00037568226,0.00033600134,0.00093933055,0.00031523235,0.00023638029,0.00020635633,0.00017909563,0.05812596,0.02363641,0.01296296,0.011420837,0.8912657],"study_design_scores_gemma":[0.00015761289,0.00020512982,0.0007652853,0.00002150916,0.00008364972,0.00047365576,0.00006148557,0.94679785,0.016316231,0.020463416,0.014582413,0.00007180279],"about_ca_topic_score_codex":0.0037667234,"about_ca_topic_score_gemma":0.0070469324,"teacher_disagreement_score":0.009850456,"about_ca_system_score_codex":0.0008859358,"about_ca_system_score_gemma":0.0016785924,"threshold_uncertainty_score":0.032953024},"labels":[],"label_agreement":null},{"id":"W2063687001","doi":"10.1007/s10878-012-9526-3","title":"Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Approximation algorithm; Disjoint sets; Mathematics; Convexity; Theory of computation; Combinatorics; Function (biology); Range (aeronautics); Relaxation (psychology); Algorithm; Discrete mathematics","score_opus":0.02017153551588397,"score_gpt":0.25076873655230497,"score_spread":0.230597201036421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063687001","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03737251,0.0016983316,0.94417524,0.0015176714,0.00023552826,0.00033035834,0.0010284862,0.002103504,0.011538278],"genre_scores_gemma":[0.18065464,0.0009278738,0.80350715,0.00049897,0.00032549747,0.00053650746,0.0031154903,0.00094650214,0.009487339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99654406,0.0011515719,0.0002049748,0.00074948644,0.0007845709,0.00056535314],"domain_scores_gemma":[0.9887455,0.0072465483,0.00076785,0.0018635326,0.0007832446,0.0005932749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050554005,0.0033136304,0.0049960753,0.004048035,0.0022631139,0.005944123,0.009418166,0.004816376,0.020902496],"category_scores_gemma":[0.020736394,0.002387791,0.0033990475,0.008623237,0.0021027874,0.01426122,0.0057462896,0.0064238007,0.003122985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012128972,0.00088528346,0.0019222732,0.0006496259,0.00021645866,0.00012376944,0.0004455543,0.5756463,0.001672986,0.14328933,0.026060283,0.2478752],"study_design_scores_gemma":[0.00011382801,0.00006193362,0.0002639772,0.000031203686,0.000048040318,0.000057430472,0.00006800891,0.9013087,0.00055018,0.095145285,0.0023271171,0.000024203136],"about_ca_topic_score_codex":0.009274373,"about_ca_topic_score_gemma":0.015849577,"teacher_disagreement_score":0.020902496,"about_ca_system_score_codex":0.0054351185,"about_ca_system_score_gemma":0.005617274,"threshold_uncertainty_score":0.069925785},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03408374,0.0021972302,0.950464,0.0018203538,0.00018737843,0.00011778171,0.0005487745,0.00015276182,0.010428057],"genre_scores_gemma":[0.858314,0.00347733,0.12750968,0.00038985585,0.00034845452,0.0003264642,0.00041449748,0.00013460434,0.009085075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986594,0.0006452383,0.00006634713,0.00017595848,0.00031279595,0.0001404175],"domain_scores_gemma":[0.990986,0.007360081,0.0005722102,0.000318826,0.00052161975,0.00024134811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029182755,0.00096648256,0.0017472644,0.00078402914,0.0006195617,0.002067063,0.002021398,0.0013399535,0.003127776],"category_scores_gemma":[0.013426929,0.0008884451,0.0004251192,0.002726739,0.0012311935,0.0033203175,0.0013268826,0.0015883439,0.00034571413],"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.0001146202,0.000053777952,0.00037427378,0.00029476278,0.000044655357,0.00023247024,0.00008474244,0.8063372,0.0008703575,0.16397534,0.004118899,0.023498936],"study_design_scores_gemma":[0.000033167737,0.000030346317,0.00013652371,0.000023391629,0.000014815546,0.00004743756,0.000027318183,0.8844006,0.0002713732,0.11374022,0.0012616637,0.000013085176],"about_ca_topic_score_codex":0.0038029584,"about_ca_topic_score_gemma":0.004082959,"teacher_disagreement_score":0.0038029584,"about_ca_system_score_codex":0.0017976133,"about_ca_system_score_gemma":0.0012555496,"threshold_uncertainty_score":0.01543349},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063070534,0.00032292833,0.9833725,0.00029782765,0.00021122408,0.000085045926,0.00009219587,0.00036228137,0.008949038],"genre_scores_gemma":[0.08107869,0.0005467604,0.91136044,0.00023210295,0.00027567954,0.00019109662,0.00032003305,0.00029104738,0.005704096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990758,0.0003356509,0.00004740002,0.00014951744,0.0002567563,0.00013490884],"domain_scores_gemma":[0.9983241,0.00089619553,0.000106145024,0.00024841726,0.00033620457,0.000088955494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016062526,0.0010611664,0.0014428879,0.0009851238,0.0007154295,0.0010734607,0.0022523915,0.0014901892,0.007663967],"category_scores_gemma":[0.005623534,0.00086865487,0.0016252224,0.001873043,0.0005869125,0.001927993,0.0014068742,0.0033681153,0.0017003898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032804278,0.0004779289,0.0007177861,0.00043176496,0.00015693664,0.00023576342,0.00017755358,0.57127804,0.0052165273,0.06315898,0.02113537,0.3366853],"study_design_scores_gemma":[0.00003551965,0.000046739686,0.00008975402,0.000020957976,0.00001850528,0.00008802835,0.000012713738,0.98152643,0.0005964848,0.0123350015,0.00521798,0.000011818297],"about_ca_topic_score_codex":0.0034363968,"about_ca_topic_score_gemma":0.0034366974,"teacher_disagreement_score":0.007663967,"about_ca_system_score_codex":0.0005141701,"about_ca_system_score_gemma":0.0015159141,"threshold_uncertainty_score":0.02563852},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29308897,0.0023267402,0.445978,0.0074480795,0.0006987464,0.00035218892,0.002964152,0.0008495548,0.24629351],"genre_scores_gemma":[0.89616376,0.00068980764,0.06653365,0.0004737415,0.000614258,0.00019104031,0.0013581655,0.0003082536,0.033667378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981925,0.0005574254,0.00006791854,0.00032466836,0.00038382414,0.0004735746],"domain_scores_gemma":[0.994521,0.004180003,0.00048964936,0.00026802454,0.00029708692,0.00024421886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014031249,0.0013909665,0.0014961852,0.0008847522,0.0010559361,0.004066969,0.0018871417,0.002780897,0.0190943],"category_scores_gemma":[0.011146195,0.0006151332,0.00080532045,0.0014574892,0.0019911134,0.002892352,0.0018368887,0.003348424,0.0012219615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010151708,0.0005030878,0.0011255643,0.0009448744,0.00010543002,0.0013903888,0.0003051257,0.21057855,0.0022996399,0.6872329,0.036660116,0.057839137],"study_design_scores_gemma":[0.00021716462,0.00011663649,0.0005246623,0.000051684132,0.000029812802,0.00038876978,0.0002110365,0.3706619,0.0013519049,0.621667,0.0047263894,0.000052978954],"about_ca_topic_score_codex":0.0030743596,"about_ca_topic_score_gemma":0.0042933966,"teacher_disagreement_score":0.0190943,"about_ca_system_score_codex":0.0012879721,"about_ca_system_score_gemma":0.0015713134,"threshold_uncertainty_score":0.06387675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34687942,0.0005321301,0.58951044,0.00075940276,0.0002048104,0.00018799173,0.0010595821,0.0004976923,0.060368504],"genre_scores_gemma":[0.83771765,0.0006558614,0.13804537,0.00024328139,0.00015377448,0.00027280283,0.0023530761,0.0004402943,0.020117985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953365,0.00006746124,0.000023229335,0.00009188642,0.00020896115,0.00007478852],"domain_scores_gemma":[0.99935657,0.00018177213,0.00008734282,0.00012549663,0.00014246166,0.00010637576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024306387,0.0005668957,0.0009997693,0.0010738382,0.0010001813,0.0017245035,0.001457118,0.000822614,0.009060204],"category_scores_gemma":[0.0018087487,0.0006147704,0.0008361791,0.00097087334,0.00096309633,0.0011956624,0.0014079195,0.002106989,0.00083206204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021465046,0.00015876644,0.0011766687,0.00019390682,0.00004670071,0.00016392734,0.00033533966,0.07898093,0.012638267,0.81888723,0.010474639,0.076728955],"study_design_scores_gemma":[0.00008694711,0.00013453834,0.001031105,0.0000730132,0.000030129437,0.00030231717,0.0003089303,0.2831583,0.002812059,0.69491065,0.017122785,0.00002926624],"about_ca_topic_score_codex":0.00091659575,"about_ca_topic_score_gemma":0.0013669957,"teacher_disagreement_score":0.009060204,"about_ca_system_score_codex":0.0005912489,"about_ca_system_score_gemma":0.00046172997,"threshold_uncertainty_score":0.03030938},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052891217,0.0009737351,0.9285538,0.0020770926,0.00019035993,0.00025938277,0.00076933013,0.0015512066,0.012733948],"genre_scores_gemma":[0.29582554,0.00063129544,0.69203156,0.00048776867,0.00024405828,0.00046245707,0.0019313237,0.00056212017,0.007823842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771655,0.000691413,0.00009474464,0.0005132567,0.0005245703,0.00045949343],"domain_scores_gemma":[0.99038434,0.0069827284,0.0005141954,0.0012328698,0.00049950543,0.00038630018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031415143,0.0019317745,0.0027066977,0.001709093,0.0014634827,0.0038204216,0.005300638,0.003166569,0.012828264],"category_scores_gemma":[0.012909476,0.0011787674,0.0017161294,0.0036256472,0.0022324454,0.00657764,0.0037910324,0.004439416,0.0016262572],"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.0011186429,0.00082876935,0.0012803379,0.00047559734,0.00014223222,0.00012126835,0.00029009106,0.6786722,0.00241862,0.10257067,0.025009328,0.18707219],"study_design_scores_gemma":[0.00013919614,0.000055675984,0.00019123744,0.000019211842,0.000030622654,0.000049019778,0.000088690074,0.91316247,0.0005756244,0.08443495,0.0012378072,0.000015566135],"about_ca_topic_score_codex":0.0068141217,"about_ca_topic_score_gemma":0.009485793,"teacher_disagreement_score":0.012828264,"about_ca_system_score_codex":0.003113337,"about_ca_system_score_gemma":0.0045514726,"threshold_uncertainty_score":0.042914808},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40399933,0.0012755714,0.5194935,0.0044944435,0.0003746586,0.00038711043,0.000675253,0.0008923929,0.06840781],"genre_scores_gemma":[0.87433696,0.00070288347,0.09511961,0.00041624333,0.00015229927,0.00029576712,0.00050167943,0.00023830034,0.02823632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990256,0.00040635432,0.000042578158,0.0001332559,0.00022875008,0.00016336559],"domain_scores_gemma":[0.989965,0.0077592977,0.00045370535,0.00060703914,0.00048385613,0.0007310655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013602484,0.0010365488,0.0018824287,0.0015509792,0.0012936039,0.0027572133,0.002029933,0.0023616068,0.010171895],"category_scores_gemma":[0.012845801,0.00081669725,0.00097482133,0.0014242892,0.001626045,0.0057099503,0.0023264196,0.0031003703,0.00061362976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004851912,0.00018193708,0.0005635393,0.0002085187,0.00006725987,0.00010664068,0.0002263585,0.17652436,0.0025997562,0.78165376,0.010666408,0.026716242],"study_design_scores_gemma":[0.00010825695,0.00006577974,0.0001599867,0.000015598405,0.000017881954,0.00004854736,0.00004952178,0.42731935,0.000385451,0.57039636,0.0014190611,0.000014103225],"about_ca_topic_score_codex":0.002494112,"about_ca_topic_score_gemma":0.002472194,"teacher_disagreement_score":0.010171895,"about_ca_system_score_codex":0.0017387484,"about_ca_system_score_gemma":0.001286961,"threshold_uncertainty_score":0.03402835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4122244,0.0018757562,0.51149094,0.003051235,0.00017628427,0.00021031187,0.0009979754,0.0005532457,0.06941984],"genre_scores_gemma":[0.90535885,0.0016242987,0.07801694,0.0005310351,0.00023231664,0.0002613222,0.0005415863,0.00021459279,0.01321904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977494,0.0008774137,0.00014874844,0.00042603342,0.00047068886,0.0003276964],"domain_scores_gemma":[0.95464706,0.035713118,0.00221462,0.002597006,0.0026408618,0.002187306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003203665,0.0009137017,0.0021516208,0.0024398456,0.0016036219,0.0038892785,0.002326795,0.0015837166,0.008897034],"category_scores_gemma":[0.028761413,0.0014664857,0.0013540585,0.002463914,0.0031843327,0.010355292,0.0029215019,0.0033442494,0.00077052036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022128443,0.00012952847,0.0019479152,0.0003278838,0.000047773396,0.00021018431,0.00040305598,0.01560452,0.0028338227,0.94946265,0.0025475135,0.026263848],"study_design_scores_gemma":[0.000052967724,0.00010556014,0.0008133988,0.000059757796,0.000033784127,0.00035502904,0.00013864825,0.0681653,0.0011057951,0.9268579,0.002287283,0.000024648258],"about_ca_topic_score_codex":0.0013192515,"about_ca_topic_score_gemma":0.0018140017,"teacher_disagreement_score":0.008897034,"about_ca_system_score_codex":0.0014347279,"about_ca_system_score_gemma":0.0013883474,"threshold_uncertainty_score":0.02976358},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011321582,0.18407243,0.0108259665,0.10798944,0.5849995,0.00029975045,0.005923131,0.0005457104,0.104211904],"genre_scores_gemma":[0.012752154,0.14161895,0.012638305,0.026119042,0.24859756,0.00032103944,0.010893238,0.0019712364,0.5450886],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855846,0.00015036868,0.00007287531,0.00024687088,0.00081343524,0.00015801137],"domain_scores_gemma":[0.99363756,0.001187026,0.00018613528,0.0002116574,0.00378742,0.0009901832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020243959,0.0025122843,0.002766726,0.0052358033,0.002573781,0.005687436,0.0023506058,0.0028279219,0.10797585],"category_scores_gemma":[0.005911666,0.00055094156,0.0015542745,0.008531309,0.00073140964,0.0039060423,0.0015560004,0.0035179532,0.049601696],"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.0000240644,0.00001313913,0.00003372309,0.00015528235,0.0000059131216,0.000011848058,0.0000055825008,0.00015009286,0.00007882343,0.00085264386,0.97985166,0.018817285],"study_design_scores_gemma":[0.000024833093,0.000018393943,0.00069346593,0.0003308169,0.00002539151,0.000057018286,0.000039245053,0.0005220696,0.00024838935,0.0034760605,0.99454004,0.000024226114],"about_ca_topic_score_codex":0.024214476,"about_ca_topic_score_gemma":0.051591862,"teacher_disagreement_score":0.10797585,"about_ca_system_score_codex":0.007985886,"about_ca_system_score_gemma":0.0040055574,"threshold_uncertainty_score":0.36121517},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2314587,0.003963054,0.37930104,0.010156232,0.00034705122,0.0009083451,0.0028018302,0.0008041481,0.3702596],"genre_scores_gemma":[0.89602125,0.0024972584,0.059910715,0.0009211478,0.00034622443,0.0005776406,0.0014584464,0.000262678,0.03800478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709713,0.0008695553,0.000061216604,0.00048633752,0.0007224403,0.0007633748],"domain_scores_gemma":[0.9932628,0.0041595083,0.00047742398,0.00040332275,0.0007647344,0.0009321522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020386134,0.0017700451,0.0017694118,0.0018793195,0.0031948374,0.004188172,0.005376137,0.0033304445,0.023184849],"category_scores_gemma":[0.013742438,0.0005178149,0.0010531347,0.0034376024,0.0026729591,0.005057308,0.0025840658,0.002989682,0.0015781206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065320666,0.0003577366,0.0024249454,0.00043331238,0.00013880793,0.00042724793,0.00049466523,0.21282591,0.0011463641,0.690898,0.039599158,0.050600745],"study_design_scores_gemma":[0.00020507489,0.00017581112,0.0010992619,0.00005724116,0.000072420495,0.00033831652,0.00036072484,0.66146845,0.0006877746,0.31214696,0.023310354,0.00007758397],"about_ca_topic_score_codex":0.09749472,"about_ca_topic_score_gemma":0.061604,"teacher_disagreement_score":0.09749472,"about_ca_system_score_codex":0.0079563325,"about_ca_system_score_gemma":0.0065819602,"threshold_uncertainty_score":0.19385445},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20405103,0.0009560402,0.7802666,0.0011592794,0.00016007523,0.0010488279,0.0009444029,0.0028999527,0.00851371],"genre_scores_gemma":[0.2979417,0.0003494256,0.6965139,0.0003909975,0.000045263187,0.00032848667,0.0020797877,0.0004165093,0.0019339755],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982474,0.0006960629,0.00014220545,0.00029973916,0.0003308117,0.00028382335],"domain_scores_gemma":[0.98829865,0.009834387,0.0004716779,0.0005603894,0.0006570657,0.00017775806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024605223,0.0016839925,0.0016451018,0.0033542183,0.0013385651,0.0021748398,0.0023591644,0.0014733621,0.005873346],"category_scores_gemma":[0.014962454,0.0015712939,0.0023388693,0.0023343218,0.0016851288,0.0030802183,0.0017471295,0.0027583044,0.00060448813],"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.0014408758,0.0012778637,0.008487594,0.0013535235,0.00043971647,0.0009597827,0.0009799325,0.43255168,0.015545148,0.06354022,0.013166587,0.46025705],"study_design_scores_gemma":[0.000312097,0.00022977292,0.0008544215,0.00017562197,0.00028466678,0.00017603178,0.00058211305,0.88921154,0.010904071,0.09442185,0.002798204,0.000049681603],"about_ca_topic_score_codex":0.007764929,"about_ca_topic_score_gemma":0.017007018,"teacher_disagreement_score":0.007764929,"about_ca_system_score_codex":0.001825659,"about_ca_system_score_gemma":0.0035184897,"threshold_uncertainty_score":0.019648314},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04837492,0.0007306237,0.93297595,0.0012598872,0.00018761019,0.0002566348,0.00076105195,0.0022903515,0.013162948],"genre_scores_gemma":[0.3161424,0.00037841176,0.6754144,0.00029294513,0.0001004481,0.00040906508,0.0014948965,0.00027566848,0.005491671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987342,0.00032571374,0.00006910867,0.0002721404,0.00025070697,0.00034823007],"domain_scores_gemma":[0.9976902,0.0013514388,0.00017053827,0.00028329482,0.00029408204,0.00021044012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011934879,0.001465558,0.0024579896,0.0012402601,0.0012325558,0.0030647498,0.00418685,0.0030453308,0.011299384],"category_scores_gemma":[0.0051634726,0.001052179,0.0013696463,0.0033623371,0.00085696275,0.003204606,0.0025792145,0.0023880566,0.0022268805],"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.0006597613,0.00038191886,0.0010617542,0.00024827674,0.00008632687,0.000116168834,0.00014621504,0.8240041,0.0014498542,0.017568847,0.011773014,0.1425037],"study_design_scores_gemma":[0.00009745853,0.00003684662,0.000101833764,0.000011001559,0.000014583083,0.000041099458,0.000031789743,0.9913122,0.00024132903,0.0072959173,0.0008059114,0.000009943755],"about_ca_topic_score_codex":0.012522541,"about_ca_topic_score_gemma":0.012986531,"teacher_disagreement_score":0.012522541,"about_ca_system_score_codex":0.0032845049,"about_ca_system_score_gemma":0.003992504,"threshold_uncertainty_score":0.037800193},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54007536,0.0011345894,0.44418088,0.000662527,0.00009353386,0.00006337212,0.00033769998,0.00024960123,0.013202332],"genre_scores_gemma":[0.9817062,0.0002969011,0.015462826,0.00004516909,0.000032709228,0.000026522384,0.000105942425,0.000022003687,0.0023017658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992157,0.00025096955,0.00003243628,0.000113809896,0.00014781918,0.00023922525],"domain_scores_gemma":[0.9951408,0.0036507458,0.00041187997,0.0002074605,0.00029970077,0.0002894093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086868054,0.0006375797,0.0013236683,0.0007743775,0.0007354649,0.0012698922,0.0014827062,0.0017675203,0.0012841938],"category_scores_gemma":[0.005995815,0.0006998919,0.00066944107,0.0010752053,0.0010190008,0.0013766629,0.0025442555,0.00064403017,0.0003052258],"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.00055690657,0.000038564554,0.0034701235,0.00011427336,0.00007587857,0.00088017207,0.00019466435,0.9763485,0.0035645473,0.006584318,0.0006202326,0.0075517944],"study_design_scores_gemma":[0.000025735677,0.00006110028,0.00065937446,0.000011977826,0.000031932675,0.00020156508,0.00011290075,0.9935354,0.0009694391,0.004138617,0.00023857388,0.000013384396],"about_ca_topic_score_codex":0.004209871,"about_ca_topic_score_gemma":0.0027961046,"teacher_disagreement_score":0.004209871,"about_ca_system_score_codex":0.0005362797,"about_ca_system_score_gemma":0.0004180992,"threshold_uncertainty_score":0.008370757},"labels":[],"label_agreement":null},{"id":"W2086871104","doi":"10.1007/s10878-013-9673-1","title":"An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Rounding; Combinatorics; Semidefinite programming; Approximation algorithm; Mathematics; Maximum cut; Theory of computation; Semidefinite embedding; Bisection; Vertex (graph theory); Discrete mathematics; Graph; Algorithm; Mathematical optimization; Computer science","score_opus":0.015056568378776166,"score_gpt":0.2445863574433526,"score_spread":0.22952978906457644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086871104","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02090414,0.00033795027,0.96256524,0.00056942215,0.00029126636,0.00020750026,0.00024170558,0.0018278065,0.013054979],"genre_scores_gemma":[0.15666771,0.00022675595,0.8340885,0.00039780687,0.00015181123,0.00035883512,0.00077027647,0.00040131732,0.0069370554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998355,0.000455816,0.000083315805,0.00031038228,0.0005635771,0.0002319328],"domain_scores_gemma":[0.997332,0.0013240257,0.00015688017,0.0005050192,0.00050855597,0.00017351544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016885536,0.0014180763,0.0020733539,0.001213578,0.0010675031,0.0027990912,0.0030048315,0.0017184345,0.010957283],"category_scores_gemma":[0.005809124,0.00084209046,0.0011939359,0.0022458052,0.0006825419,0.002373691,0.0023946534,0.0042417683,0.0024537467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007964123,0.000855046,0.0006285053,0.0003209145,0.000085957014,0.0001302787,0.00019386901,0.48009712,0.0049529397,0.058329877,0.026783219,0.42682594],"study_design_scores_gemma":[0.00006982725,0.000061048915,0.00006460491,0.000015588546,0.0000113717,0.000034269415,0.00002629588,0.98382586,0.0008532375,0.013347631,0.0016794131,0.000010851159],"about_ca_topic_score_codex":0.0036758888,"about_ca_topic_score_gemma":0.0058787162,"teacher_disagreement_score":0.010957283,"about_ca_system_score_codex":0.0015367138,"about_ca_system_score_gemma":0.0027170146,"threshold_uncertainty_score":0.036655724},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3409415,0.009277644,0.5326977,0.0066293417,0.0010680183,0.00018381281,0.00085731986,0.00070790877,0.10763674],"genre_scores_gemma":[0.870014,0.007276326,0.08249624,0.0009024416,0.0011798046,0.00020927828,0.00089785754,0.00035895483,0.036665104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909925,0.00033665646,0.00004074967,0.0001235866,0.00023837958,0.00016141143],"domain_scores_gemma":[0.9943178,0.0039797407,0.0005257152,0.00039374697,0.000370675,0.00041237302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000868017,0.00064486236,0.0016286519,0.0021489942,0.0019471991,0.004315784,0.0014231225,0.0028805921,0.009074492],"category_scores_gemma":[0.009427005,0.0013777451,0.0007175892,0.0048471666,0.0019657977,0.004925536,0.0016565693,0.0028582446,0.001156831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009738487,0.00008681537,0.00069674896,0.0001789256,0.000029057272,0.00015316832,0.00032697257,0.065323904,0.00091272464,0.8865372,0.012383631,0.03327355],"study_design_scores_gemma":[0.000014542673,0.00001907761,0.00027090186,0.000029564979,0.000015604599,0.00011151727,0.00008048544,0.111617185,0.00019052128,0.88401544,0.003626352,0.000008775285],"about_ca_topic_score_codex":0.001801864,"about_ca_topic_score_gemma":0.0022019686,"teacher_disagreement_score":0.009074492,"about_ca_system_score_codex":0.0013961901,"about_ca_system_score_gemma":0.0008164817,"threshold_uncertainty_score":0.030357182},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1483045,0.0038729673,0.2892544,0.008051698,0.00081095065,0.00033146946,0.0032780762,0.0004686771,0.5456273],"genre_scores_gemma":[0.6907567,0.002480868,0.05627492,0.0007248831,0.0003457197,0.00026873985,0.0022089868,0.00026076214,0.24667846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907076,0.0002391221,0.000031223633,0.00017786393,0.00025197674,0.00022903612],"domain_scores_gemma":[0.99840087,0.00061535084,0.000113180235,0.00015385744,0.00041745245,0.0002993105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084731623,0.0011941128,0.0013821556,0.0018414836,0.0026230672,0.0041195294,0.002762686,0.0028241796,0.028429776],"category_scores_gemma":[0.005635703,0.00055120315,0.0010198817,0.0026720746,0.0024042856,0.0032595186,0.0021856367,0.0032439095,0.0014350872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051262352,0.000022731267,0.00016430019,0.000046476973,0.000017924316,0.00005357217,0.000077236604,0.028350167,0.00013523514,0.941576,0.018644255,0.010860757],"study_design_scores_gemma":[0.000049280447,0.000021956166,0.0003319221,0.000032338634,0.00001967894,0.00009128672,0.00023512114,0.12231067,0.00022890657,0.84556645,0.03106506,0.000047207548],"about_ca_topic_score_codex":0.13550794,"about_ca_topic_score_gemma":0.14833404,"teacher_disagreement_score":0.13550794,"about_ca_system_score_codex":0.008791914,"about_ca_system_score_gemma":0.006373425,"threshold_uncertainty_score":0.2694384},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0452634,0.00029962702,0.95164406,0.00010777338,0.000023043403,0.00011447684,0.00074004097,0.0012531177,0.00055454],"genre_scores_gemma":[0.28492075,0.000302577,0.7077911,0.000093094786,0.000044938944,0.0005201138,0.0038301917,0.00018584622,0.002311436],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882656,0.00027454825,0.00010284198,0.00026116782,0.00041819242,0.00011661282],"domain_scores_gemma":[0.998085,0.0008798963,0.00020061996,0.00025621045,0.0005012154,0.00007706073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008166673,0.00071821595,0.0012213081,0.0034660413,0.00047757858,0.0010066034,0.0012271525,0.00082953426,0.002599538],"category_scores_gemma":[0.0038019938,0.00043873137,0.000770838,0.003756188,0.0005462908,0.00081800914,0.00080123486,0.0007544869,0.0010754536],"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.0004263018,0.00022968928,0.0037521895,0.00020755171,0.000067951725,0.00004635731,0.000076843506,0.06404952,0.049945258,0.004982234,0.003930611,0.87228554],"study_design_scores_gemma":[0.00003602029,0.00009194314,0.0022665665,0.000017388697,0.00003199772,0.00007517346,0.00006427082,0.9656074,0.019248715,0.010219764,0.0023153278,0.000025414984],"about_ca_topic_score_codex":0.0038177518,"about_ca_topic_score_gemma":0.0038827667,"teacher_disagreement_score":0.0038177518,"about_ca_system_score_codex":0.0008986579,"about_ca_system_score_gemma":0.00093165017,"threshold_uncertainty_score":0.008696318},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73288107,0.00040271677,0.22011253,0.0012880684,0.00018266862,0.00022479301,0.00094631466,0.0003490915,0.043612685],"genre_scores_gemma":[0.95329934,0.000195081,0.038426377,0.00010253668,0.00009396965,0.00007746676,0.000588197,0.00009247317,0.0071245297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989504,0.00028504623,0.00005961137,0.00021771273,0.000117465126,0.0003697426],"domain_scores_gemma":[0.9950067,0.003055759,0.0007378647,0.0005471195,0.0002748412,0.00037765157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010824931,0.0008608186,0.0014633838,0.00066906575,0.0013787453,0.0030434506,0.0015983408,0.002451781,0.008744835],"category_scores_gemma":[0.0068018795,0.0006529942,0.0011209672,0.0011574593,0.0012815825,0.0031884736,0.0011221926,0.0014361878,0.000699082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017022077,0.0007046948,0.0033575245,0.0006132847,0.00018267351,0.0030087284,0.0006366363,0.3833822,0.008396162,0.54752076,0.018190268,0.032304823],"study_design_scores_gemma":[0.00020992888,0.00011507181,0.0005749353,0.000016225797,0.000037236343,0.00067937706,0.00033978166,0.6446012,0.0023355146,0.34875166,0.002297696,0.000041420517],"about_ca_topic_score_codex":0.002323725,"about_ca_topic_score_gemma":0.0034849623,"teacher_disagreement_score":0.008744835,"about_ca_system_score_codex":0.00084275915,"about_ca_system_score_gemma":0.0012107291,"threshold_uncertainty_score":0.029254377},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5900702,0.0007727424,0.37976646,0.0018680901,0.00020524119,0.00085728645,0.003273414,0.0012895047,0.021897044],"genre_scores_gemma":[0.5507021,0.00041191094,0.43530974,0.00021678006,0.00006640264,0.00054052245,0.0030333574,0.00049710966,0.009222184],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988311,0.0003327129,0.000065800086,0.00037478708,0.00017798343,0.00021758895],"domain_scores_gemma":[0.9939507,0.0037241026,0.0005989534,0.0007356146,0.0005010341,0.0004894935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094263884,0.0016242224,0.0018793028,0.0023896545,0.0020272494,0.0018241501,0.0029707048,0.0029339471,0.015695103],"category_scores_gemma":[0.010552505,0.0014645752,0.0016211508,0.0027072227,0.0010891535,0.0052269245,0.0032501456,0.0020832869,0.0017765277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004305201,0.001975148,0.01093813,0.0031364826,0.0007570296,0.0013318716,0.0015332416,0.29829276,0.03552224,0.13764885,0.031642668,0.47291645],"study_design_scores_gemma":[0.0008399746,0.0013430695,0.0036743293,0.00037493222,0.0004342965,0.0010836383,0.0018219431,0.50564384,0.018951686,0.45315388,0.012593009,0.00008543588],"about_ca_topic_score_codex":0.0011108869,"about_ca_topic_score_gemma":0.0024381424,"teacher_disagreement_score":0.015695103,"about_ca_system_score_codex":0.0009910672,"about_ca_system_score_gemma":0.0020551444,"threshold_uncertainty_score":0.052505314},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10604828,0.002607345,0.82039356,0.007905305,0.0010680078,0.00066685333,0.0011547658,0.0062358216,0.05392008],"genre_scores_gemma":[0.48107487,0.0013971956,0.48428318,0.001388658,0.00088333903,0.0011834188,0.0014382091,0.002412762,0.025938425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745864,0.001015464,0.00012047881,0.00042843036,0.00058386696,0.00039318018],"domain_scores_gemma":[0.98147327,0.011744908,0.0007591968,0.0045127682,0.00084669015,0.00066304643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019084194,0.00222587,0.0019918696,0.0019979598,0.0018638595,0.0031803816,0.0039876713,0.003022133,0.022923011],"category_scores_gemma":[0.021303864,0.0011019626,0.0014457626,0.0032816804,0.0018264959,0.008650342,0.003779634,0.0041747005,0.0054601007],"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.0028352155,0.001116501,0.0015892145,0.0010541695,0.00024570708,0.00023583719,0.0003131836,0.39668965,0.0132551165,0.15133518,0.062905334,0.36842495],"study_design_scores_gemma":[0.00070320856,0.00026227187,0.00058394496,0.000070583425,0.00014479394,0.00015870642,0.00013141563,0.6220697,0.0064393445,0.36013243,0.0092655495,0.000038014674],"about_ca_topic_score_codex":0.0012878015,"about_ca_topic_score_gemma":0.0028183104,"teacher_disagreement_score":0.022923011,"about_ca_system_score_codex":0.0017909604,"about_ca_system_score_gemma":0.00279023,"threshold_uncertainty_score":0.07668513},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.715075,0.0012956492,0.16929796,0.0011662283,0.0002775666,0.00006723018,0.0010473413,0.00049441674,0.11127862],"genre_scores_gemma":[0.97683185,0.0005390311,0.012259688,0.0000962637,0.00028737634,0.00005434051,0.00035463998,0.00013446265,0.009442403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979144,0.000059716604,0.000006527427,0.000051229552,0.00006235822,0.000028733692],"domain_scores_gemma":[0.9991374,0.00034714918,0.00012805132,0.000056753273,0.00021726392,0.00011338434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023430331,0.00040156543,0.00047207464,0.0014243299,0.00042611422,0.0011553273,0.00074576674,0.0006957975,0.008956203],"category_scores_gemma":[0.0017033531,0.00020642563,0.00019768387,0.00078856305,0.00076149305,0.0014267816,0.0006196092,0.00046850066,0.0011812616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028088895,0.00009246936,0.0040295646,0.00021323,0.000057637782,0.0002723217,0.00028020938,0.053279,0.024907002,0.8092096,0.01028351,0.09709449],"study_design_scores_gemma":[0.000035756762,0.00015809698,0.009379622,0.00004668954,0.000036784408,0.0008146891,0.00026562682,0.2667296,0.005199937,0.7034097,0.013867146,0.000056353154],"about_ca_topic_score_codex":0.00033142994,"about_ca_topic_score_gemma":0.00032421044,"teacher_disagreement_score":0.008956203,"about_ca_system_score_codex":0.000282235,"about_ca_system_score_gemma":0.0002028405,"threshold_uncertainty_score":0.029961467},"labels":[],"label_agreement":null},{"id":"W2125240990","doi":"10.1023/b:joco.0000038911.67280.3f","title":"On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function","year":2004,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Technische Universiteit Delft; Universiteit Utrecht; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics; Semidefinite programming; Approximation algorithm; Bounded function; Graph; Relaxation (psychology); Discrete mathematics; Maximum cut; Algorithm; Mathematical optimization","score_opus":0.012230006133804268,"score_gpt":0.21800448995978605,"score_spread":0.2057744838259818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125240990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0391659,0.0015598104,0.94976443,0.00113183,0.00017389303,0.00013339391,0.00020010862,0.0009994453,0.006871257],"genre_scores_gemma":[0.34886423,0.0014679612,0.63945353,0.0007520328,0.000320805,0.00042266582,0.00089885504,0.0007315564,0.0070883012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964935,0.0017455668,0.00016228607,0.000506858,0.0007369123,0.00035486688],"domain_scores_gemma":[0.9790069,0.015360117,0.00089585414,0.0029628472,0.0011626198,0.0006116511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047129015,0.0020844808,0.0034258591,0.0019943765,0.0016201216,0.003695635,0.00573985,0.003328848,0.008145647],"category_scores_gemma":[0.028583085,0.0012425102,0.0017719446,0.0046947324,0.0028658216,0.01050966,0.004007641,0.004301536,0.0014661715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001499125,0.00038285588,0.002183439,0.00037957772,0.00016312928,0.00007483061,0.0002837303,0.6374008,0.0026677023,0.16109292,0.009311582,0.18456027],"study_design_scores_gemma":[0.000054813245,0.000056388024,0.00030062706,0.000027956083,0.000035940342,0.000050129787,0.000049368933,0.8777672,0.00061370595,0.11996263,0.0010644222,0.00001667606],"about_ca_topic_score_codex":0.005003412,"about_ca_topic_score_gemma":0.0063650087,"teacher_disagreement_score":0.008145647,"about_ca_system_score_codex":0.0038740933,"about_ca_system_score_gemma":0.00308674,"threshold_uncertainty_score":0.028108656},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003555619,0.0006537732,0.98848104,0.00019319988,0.00013850367,0.00004021441,0.00005701933,0.00026518994,0.0066154567],"genre_scores_gemma":[0.07170103,0.002019744,0.91389877,0.0004247902,0.0003486094,0.00024042888,0.00034260037,0.00083888805,0.010185222],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999114,0.00044377602,0.000034122146,0.00012291958,0.00020375253,0.00008147703],"domain_scores_gemma":[0.9964228,0.0025497875,0.00012549272,0.00045254867,0.00031693044,0.00013242292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019135526,0.0015197876,0.0010426169,0.0018029622,0.00083187764,0.0013382407,0.0019462697,0.0010488174,0.009212442],"category_scores_gemma":[0.0077649103,0.00067302206,0.0012666078,0.0025897904,0.0012774185,0.0033373511,0.0021664773,0.0032338134,0.0015976181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019095026,0.00023559114,0.0007154253,0.00033785417,0.00006967409,0.00006217246,0.00023715751,0.16804446,0.003947408,0.35709524,0.014387828,0.45467618],"study_design_scores_gemma":[0.000051229672,0.000050694674,0.00025335932,0.00008011564,0.000038287955,0.00004688424,0.0000646016,0.6100012,0.001215287,0.37270793,0.015469885,0.000020461259],"about_ca_topic_score_codex":0.0035999068,"about_ca_topic_score_gemma":0.0046940665,"teacher_disagreement_score":0.009212442,"about_ca_system_score_codex":0.00088576524,"about_ca_system_score_gemma":0.000860589,"threshold_uncertainty_score":0.030818641},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7234905,0.004219768,0.21925296,0.005356306,0.00026437614,0.00011098846,0.0010830493,0.0003821228,0.045839936],"genre_scores_gemma":[0.9523639,0.0023462265,0.034672577,0.0004638952,0.00037860652,0.0001404247,0.000549625,0.00022356198,0.008861207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985454,0.00051214965,0.000061386956,0.00030455226,0.00027924243,0.00029718742],"domain_scores_gemma":[0.978228,0.016426224,0.0023324997,0.0009097608,0.00073405687,0.0013694129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020023372,0.0011891592,0.0019795143,0.0031309293,0.0018430752,0.003816914,0.003818613,0.002372701,0.010280439],"category_scores_gemma":[0.02088752,0.0016267512,0.0010832141,0.0026815326,0.0044498155,0.010975141,0.0027923803,0.0029561426,0.00067971105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004811454,0.00020719378,0.0042644707,0.0003903177,0.00015046596,0.0003668887,0.00087651884,0.07313732,0.0027890147,0.88340414,0.008680193,0.025252365],"study_design_scores_gemma":[0.0000627383,0.00006122333,0.0013990412,0.00009172305,0.000053706935,0.00031618105,0.0003418173,0.10763963,0.00072523556,0.8864123,0.0028603259,0.000036078873],"about_ca_topic_score_codex":0.0026995903,"about_ca_topic_score_gemma":0.0022739072,"teacher_disagreement_score":0.010280439,"about_ca_system_score_codex":0.0014059787,"about_ca_system_score_gemma":0.0010538012,"threshold_uncertainty_score":0.034391463},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1294422,0.0037865818,0.4425961,0.031517062,0.0012966064,0.00014410206,0.000418396,0.00051062607,0.39028832],"genre_scores_gemma":[0.9083461,0.0012889764,0.0405599,0.0010589098,0.00087128556,0.00007869653,0.00011926473,0.0002771111,0.047399785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771035,0.000995782,0.00006813175,0.00027853012,0.0007235568,0.00022354095],"domain_scores_gemma":[0.98801184,0.00883919,0.00056310644,0.00095598,0.0011349219,0.0004949223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032359445,0.0006716554,0.0015336842,0.0012808692,0.0015646637,0.008378579,0.0027420437,0.0055369916,0.028529994],"category_scores_gemma":[0.033686616,0.0010434501,0.0006803948,0.0017024535,0.0031009363,0.017318336,0.00238316,0.006656217,0.0024737301],"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.00020639817,0.00013652445,0.00096936576,0.000114609116,0.000025226032,0.0001368866,0.00012987386,0.018766785,0.0006723924,0.93330073,0.01081001,0.034731247],"study_design_scores_gemma":[0.00003025756,0.000037688624,0.00030053162,0.000045638128,0.000017793644,0.00012165677,0.0001543126,0.10837405,0.00042606104,0.8839855,0.0064843525,0.000022172993],"about_ca_topic_score_codex":0.0017040953,"about_ca_topic_score_gemma":0.0021421167,"teacher_disagreement_score":0.028529994,"about_ca_system_score_codex":0.0030604154,"about_ca_system_score_gemma":0.001608916,"threshold_uncertainty_score":0.095442355},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016317876,0.0006615723,0.9779417,0.00044714025,0.00014295366,0.000086816326,0.000096550524,0.00043617433,0.0038693114],"genre_scores_gemma":[0.47575524,0.00076889247,0.51535076,0.0004358807,0.00024260159,0.00034609615,0.0006014797,0.0003671145,0.0061317743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977296,0.0011263144,0.00010733535,0.00025570655,0.00040700004,0.00037414423],"domain_scores_gemma":[0.9914016,0.006421087,0.0005768789,0.0006856927,0.0005349751,0.00037971025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041626845,0.0015722197,0.0026544265,0.0011336602,0.0010946748,0.002496242,0.004199764,0.0023092248,0.0055010454],"category_scores_gemma":[0.016353952,0.0012212115,0.0012732435,0.0026154995,0.0012889452,0.003076579,0.0022018913,0.0032405127,0.0009378171],"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.00044177915,0.00018818566,0.0003911827,0.000112786714,0.0000522798,0.00004390828,0.00007434398,0.932842,0.00043807793,0.022027912,0.0032577363,0.040129747],"study_design_scores_gemma":[0.000036929443,0.000026138217,0.000031426163,0.00000684252,0.000008003638,0.000010643643,0.000011513265,0.98839927,0.00009213279,0.01110107,0.00027196054,0.000003947462],"about_ca_topic_score_codex":0.008353317,"about_ca_topic_score_gemma":0.0074999994,"teacher_disagreement_score":0.008353317,"about_ca_system_score_codex":0.0024247435,"about_ca_system_score_gemma":0.0032501656,"threshold_uncertainty_score":0.022014618},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1351054,0.00022898661,0.83308256,0.00026968942,0.000041485495,0.00008524172,0.00023123066,0.00010656921,0.030848827],"genre_scores_gemma":[0.77201694,0.00042280508,0.21502581,0.00009227256,0.00003967182,0.00017845127,0.00034925106,0.0002079351,0.011666866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994318,0.00020753781,0.000016012895,0.000098667406,0.00015832233,0.00008766526],"domain_scores_gemma":[0.9987477,0.0007321474,0.00019953636,0.0001094311,0.00011882168,0.000092376446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006847584,0.0007475901,0.0007704716,0.00081892713,0.0005363482,0.001322756,0.0008500885,0.0008956621,0.006094272],"category_scores_gemma":[0.0057028295,0.0008095592,0.00068048784,0.00075676624,0.0012272923,0.002288808,0.0015599494,0.0011817417,0.0004493463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027972113,0.000111447196,0.0012926066,0.00011895576,0.000032893622,0.00019874697,0.00017726148,0.59674335,0.004206613,0.36127427,0.0025918477,0.032972313],"study_design_scores_gemma":[0.00004591681,0.000104132254,0.0006184438,0.000038261816,0.000021758138,0.00020970416,0.000106728825,0.6928335,0.0021183349,0.30016187,0.003720097,0.00002132615],"about_ca_topic_score_codex":0.0010474505,"about_ca_topic_score_gemma":0.0014119147,"teacher_disagreement_score":0.006094272,"about_ca_system_score_codex":0.0005227211,"about_ca_system_score_gemma":0.00075485226,"threshold_uncertainty_score":0.020387411},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39163995,0.0042994833,0.47079757,0.011214316,0.00082423567,0.0013402074,0.005276953,0.00089970144,0.1137076],"genre_scores_gemma":[0.88440025,0.0014009966,0.07497565,0.0007949595,0.00022682264,0.00037802692,0.0020296506,0.00026493205,0.035528883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984591,0.0005384626,0.000056128138,0.00034111374,0.00014471626,0.00046037755],"domain_scores_gemma":[0.99579054,0.0026129647,0.00030903786,0.00024413843,0.00029633022,0.00074712845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020952306,0.0023520486,0.004352696,0.0014655859,0.0031127215,0.0035788605,0.005378807,0.0064008813,0.016768059],"category_scores_gemma":[0.008202987,0.0010570855,0.0014544999,0.0031701035,0.0025799002,0.0047106678,0.0036908782,0.0027839206,0.0010229201],"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.0010999016,0.00033953474,0.0014554774,0.00042712066,0.0001875722,0.00048089586,0.00024237492,0.86529905,0.00043433785,0.08614002,0.023494529,0.020399073],"study_design_scores_gemma":[0.00016961194,0.00011850221,0.00036411308,0.00004078769,0.0000545936,0.00007999387,0.00026073633,0.9544687,0.00016400439,0.040297497,0.003939384,0.00004203001],"about_ca_topic_score_codex":0.1330462,"about_ca_topic_score_gemma":0.09470004,"teacher_disagreement_score":0.1330462,"about_ca_system_score_codex":0.0055462467,"about_ca_system_score_gemma":0.006119312,"threshold_uncertainty_score":0.2645436},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026629388,0.00039929702,0.96726257,0.0003981498,0.00008734155,0.00014980366,0.00015641424,0.00085636036,0.00406057],"genre_scores_gemma":[0.3442145,0.0002478627,0.6488337,0.00021630652,0.00006299269,0.00044901684,0.00049546687,0.00016797362,0.0053121457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902356,0.0003358338,0.000047303885,0.00017372324,0.00021772594,0.00020193745],"domain_scores_gemma":[0.9981875,0.0010739545,0.00014108577,0.00020147253,0.00023953718,0.00015643153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013911705,0.00093826756,0.0025265191,0.0009255233,0.00094438187,0.0014361817,0.00372528,0.0020747434,0.0070946817],"category_scores_gemma":[0.004151827,0.0007878953,0.0010592504,0.002062444,0.00076842547,0.0022137675,0.0019350428,0.0020242706,0.0011292067],"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.00042068612,0.00034672715,0.000614614,0.00019126644,0.00005069526,0.00007509456,0.000092607275,0.8939023,0.0016667236,0.015715778,0.0057933726,0.0811302],"study_design_scores_gemma":[0.000036120997,0.000029629527,0.00004754037,0.000005201203,0.00000621743,0.000016688431,0.00001098987,0.9974718,0.00015659079,0.0019751175,0.00023920844,0.00000485218],"about_ca_topic_score_codex":0.010764477,"about_ca_topic_score_gemma":0.0095162,"teacher_disagreement_score":0.010764477,"about_ca_system_score_codex":0.0020310131,"about_ca_system_score_gemma":0.0031555553,"threshold_uncertainty_score":0.023734093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1185261,0.016154159,0.69175375,0.061073657,0.0020818836,0.0002331996,0.0045422586,0.005062846,0.10057214],"genre_scores_gemma":[0.69978356,0.013107445,0.24085553,0.011284809,0.0047415826,0.00064187235,0.004096116,0.002798732,0.022690428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947255,0.0011629744,0.0001738172,0.0012680298,0.0009198157,0.0017498236],"domain_scores_gemma":[0.9460411,0.041484937,0.0016656911,0.007260624,0.0013340036,0.0022135524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051170513,0.0025298586,0.0037196141,0.0018411358,0.0029606575,0.008963524,0.0076397145,0.0048973938,0.019117454],"category_scores_gemma":[0.040357865,0.0018003543,0.003246593,0.0047261706,0.0059011052,0.028377246,0.006354104,0.013955487,0.0049557416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026335176,0.0010814286,0.0050778603,0.002151923,0.00027789094,0.00020409536,0.0008617428,0.06056743,0.00973471,0.63250715,0.0871591,0.19774324],"study_design_scores_gemma":[0.00011867555,0.00010455785,0.0008877565,0.00019160999,0.00013679013,0.00017982711,0.00022763819,0.07781995,0.0026247115,0.90468484,0.012969037,0.00005453374],"about_ca_topic_score_codex":0.002984192,"about_ca_topic_score_gemma":0.0044037364,"teacher_disagreement_score":0.019117454,"about_ca_system_score_codex":0.005496623,"about_ca_system_score_gemma":0.0037995223,"threshold_uncertainty_score":0.063954234},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41685745,0.0017351198,0.5114479,0.0011543249,0.00023841203,0.00014133894,0.0004990047,0.00021256578,0.06771391],"genre_scores_gemma":[0.9174817,0.0012436584,0.047435813,0.00019571053,0.00019787496,0.00016061706,0.0007967513,0.00016118573,0.032326598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995266,0.00014955082,0.00002186933,0.00010215972,0.00012723019,0.00007250381],"domain_scores_gemma":[0.99731416,0.0016949252,0.00024888793,0.0001430881,0.00032250813,0.00027643418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010298839,0.00045967472,0.0008628137,0.00090199144,0.0011294935,0.00162222,0.0013523141,0.0010852531,0.0069909897],"category_scores_gemma":[0.007475439,0.0004357151,0.0009788334,0.0007199946,0.0012069155,0.0021814632,0.0019957845,0.0018144258,0.00053389504],"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.00020660709,0.000102516395,0.0015415474,0.00014205613,0.0000369291,0.0002499784,0.00025352393,0.07760127,0.0013787508,0.8940413,0.004638408,0.019807106],"study_design_scores_gemma":[0.000060566756,0.00008865212,0.0008894755,0.000036541114,0.000013822606,0.00026669103,0.00015027002,0.48423663,0.0003879048,0.5075894,0.006252527,0.000027462307],"about_ca_topic_score_codex":0.001806005,"about_ca_topic_score_gemma":0.0013873634,"teacher_disagreement_score":0.0069909897,"about_ca_system_score_codex":0.00081541965,"about_ca_system_score_gemma":0.00046008546,"threshold_uncertainty_score":0.023387194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014305412,0.0018251631,0.9500133,0.0007585409,0.0004425106,0.000119522534,0.00029847128,0.00018806117,0.03204904],"genre_scores_gemma":[0.26395798,0.003310427,0.6814181,0.00084231724,0.0009964352,0.00043892558,0.0011456612,0.0007367133,0.047153383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902153,0.00034487524,0.000044623637,0.00024633823,0.0002800243,0.000062634725],"domain_scores_gemma":[0.9987143,0.000717708,0.00009732428,0.00018156593,0.00019613019,0.00009303998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010965243,0.0012489995,0.0013555973,0.0012759629,0.0007670091,0.0013608147,0.0026577206,0.0021557421,0.012104336],"category_scores_gemma":[0.00490152,0.00052109186,0.0013622345,0.0024044137,0.0010258905,0.0026340755,0.0020696819,0.0025292833,0.0012584782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023277047,0.00015042772,0.0005514089,0.00058151095,0.00008765514,0.00025275876,0.00022491401,0.23866938,0.0052519934,0.56404865,0.02550174,0.16444674],"study_design_scores_gemma":[0.000037427406,0.00010961956,0.0003806718,0.000047658566,0.00003498016,0.00021927166,0.000043070755,0.7604403,0.0017451633,0.20554318,0.03135573,0.0000428666],"about_ca_topic_score_codex":0.0021188557,"about_ca_topic_score_gemma":0.0018422508,"teacher_disagreement_score":0.012104336,"about_ca_system_score_codex":0.00081571063,"about_ca_system_score_gemma":0.0005512686,"threshold_uncertainty_score":0.04049301},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031957693,0.00056962494,0.95842564,0.00053813605,0.000101449674,0.00012603673,0.00023168242,0.0011427357,0.006906954],"genre_scores_gemma":[0.37947434,0.0003155096,0.6115346,0.00026459552,0.000091978334,0.00041726042,0.0007205541,0.00025426364,0.006926997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999228,0.00028511535,0.000033818706,0.00014918724,0.00015855143,0.00014532772],"domain_scores_gemma":[0.99782604,0.001461818,0.00014570823,0.00015013664,0.00026727535,0.00014900664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012785371,0.00088075566,0.002101906,0.0010412189,0.00078959315,0.0014251079,0.0031146575,0.0021033068,0.00831022],"category_scores_gemma":[0.0049754614,0.00075212156,0.000923028,0.0021723546,0.0007884402,0.0019624552,0.0018548727,0.0018718124,0.0015006069],"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.00039470862,0.0002485884,0.0005709618,0.00013883293,0.000048140344,0.00007088594,0.00007628042,0.89501905,0.00090031495,0.011136608,0.006115463,0.085280105],"study_design_scores_gemma":[0.00004399695,0.000028637554,0.0000398166,0.0000059022527,0.000006330816,0.000013852707,0.000012311444,0.9975074,0.00010717797,0.0019362934,0.00029399563,0.000004336971],"about_ca_topic_score_codex":0.009569373,"about_ca_topic_score_gemma":0.009430279,"teacher_disagreement_score":0.009569373,"about_ca_system_score_codex":0.0018194737,"about_ca_system_score_gemma":0.0023349037,"threshold_uncertainty_score":0.0278005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0550042,0.0008757561,0.92091465,0.0013172126,0.00026156066,0.0005090356,0.0010537719,0.0027600469,0.017303769],"genre_scores_gemma":[0.2760615,0.00031046753,0.7137282,0.0003794547,0.00014573582,0.00047344237,0.0015761445,0.00042602926,0.0068990053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873716,0.0002614452,0.000063007574,0.0003863593,0.0002382664,0.00031378513],"domain_scores_gemma":[0.996799,0.0022632221,0.00020062953,0.00025094172,0.00026537987,0.00022086558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013139285,0.0015301292,0.0025962356,0.0012791089,0.0013055034,0.0030853036,0.0040271995,0.0029959069,0.01693077],"category_scores_gemma":[0.004846086,0.0011373963,0.0014153833,0.0030436881,0.0011144759,0.0038048665,0.0026444711,0.0025571464,0.0020162966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005437106,0.0005319079,0.0008633593,0.00046424745,0.00008131673,0.00013619197,0.0001843484,0.82223827,0.0019313735,0.019257378,0.014504586,0.13926332],"study_design_scores_gemma":[0.0001301138,0.00005807435,0.00014736473,0.000013934693,0.000015544414,0.0000341605,0.00005139315,0.98613864,0.00026402037,0.012168628,0.0009685056,0.000009687692],"about_ca_topic_score_codex":0.017029313,"about_ca_topic_score_gemma":0.019457208,"teacher_disagreement_score":0.017029313,"about_ca_system_score_codex":0.002726311,"about_ca_system_score_gemma":0.0035912998,"threshold_uncertainty_score":0.056639016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06211203,0.0006977701,0.92215836,0.0014885277,0.00036943023,0.00056559814,0.00068720867,0.0005647783,0.011356291],"genre_scores_gemma":[0.87860763,0.00045376518,0.11080196,0.00026248416,0.0002936136,0.00042386455,0.00033677559,0.000117753916,0.008702139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99463344,0.0028859095,0.00021137508,0.00067679415,0.00070362404,0.0008889087],"domain_scores_gemma":[0.9885649,0.00736467,0.0011159921,0.000965457,0.0008982903,0.001090552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009119219,0.0020555395,0.005184204,0.0021545987,0.0012331735,0.0048581944,0.007589701,0.0043218597,0.009572063],"category_scores_gemma":[0.013691956,0.0018328662,0.002106104,0.0032634824,0.0020701145,0.005031686,0.0025825803,0.0031269493,0.0010673703],"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.0012208212,0.0006100279,0.00070793775,0.00043592614,0.00025862126,0.00041826745,0.00014010906,0.8760999,0.0022314936,0.07755377,0.0075635193,0.03275963],"study_design_scores_gemma":[0.00018409811,0.00017576064,0.00017147773,0.000022197059,0.00005444463,0.00013857664,0.000032703607,0.9733002,0.0001613561,0.0249069,0.0008122127,0.000039997594],"about_ca_topic_score_codex":0.0022597914,"about_ca_topic_score_gemma":0.0018743433,"teacher_disagreement_score":0.009572063,"about_ca_system_score_codex":0.0029725868,"about_ca_system_score_gemma":0.0043260865,"threshold_uncertainty_score":0.04822761},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12704457,0.0020419639,0.5440989,0.02148742,0.0044741244,0.00031701053,0.0005658242,0.0068083806,0.29316175],"genre_scores_gemma":[0.64835113,0.0013235237,0.09605359,0.0032327126,0.00048566124,0.00017560287,0.0004791657,0.00088084914,0.24901773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995584,0.0000657984,0.000009946908,0.00013280935,0.0001477636,0.000085358566],"domain_scores_gemma":[0.9995919,0.0000908186,0.000034355362,0.0001229677,0.00007136909,0.000088601155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031456,0.0007250644,0.00083411846,0.0006047004,0.0018891081,0.0020549851,0.0009914171,0.0020257132,0.026316984],"category_scores_gemma":[0.0017091248,0.00048091542,0.0010531192,0.00030308723,0.0019810947,0.0027170544,0.0027800472,0.0024383317,0.009360651],"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.0011926567,0.00045618575,0.0028199079,0.000504785,0.0002631558,0.0031907074,0.001585591,0.052136842,0.11320769,0.40114865,0.08831032,0.33518356],"study_design_scores_gemma":[0.00017179508,0.0016711969,0.0039731083,0.00020832018,0.00020713503,0.0026451345,0.0030953756,0.19410394,0.061584774,0.30887744,0.42312974,0.00033209214],"about_ca_topic_score_codex":0.0022165214,"about_ca_topic_score_gemma":0.0016004309,"teacher_disagreement_score":0.026316984,"about_ca_system_score_codex":0.00038760784,"about_ca_system_score_gemma":0.0011165539,"threshold_uncertainty_score":0.08803904},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06946066,0.00022570357,0.9214944,0.00027959747,0.000116173826,0.0001958898,0.00024666294,0.0012237043,0.0067572347],"genre_scores_gemma":[0.6451721,0.00016894346,0.34824526,0.00012405371,0.00006057409,0.0002122575,0.0003909136,0.00018721998,0.0054385983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881375,0.00023788254,0.000057685957,0.00021575463,0.00031338423,0.0003616792],"domain_scores_gemma":[0.99827754,0.00077312614,0.00012900251,0.0004594156,0.00022288422,0.00013805543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015163978,0.00096256874,0.0017152881,0.0005748799,0.0012564857,0.001702635,0.0032270225,0.0011283843,0.0060007535],"category_scores_gemma":[0.0042351233,0.00061496906,0.000892801,0.0014060383,0.00080537074,0.002055167,0.002140026,0.0014866373,0.0006908255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005779322,0.00020233198,0.0003848983,0.00018446217,0.000043665234,0.00010147758,0.0001380877,0.887933,0.0054774014,0.029739488,0.00442061,0.070796624],"study_design_scores_gemma":[0.000024743085,0.0000445294,0.00004936435,0.0000047663198,0.000008412239,0.000015587777,0.000016961845,0.9910705,0.00053817156,0.0077644438,0.00045696858,0.000005454324],"about_ca_topic_score_codex":0.00730254,"about_ca_topic_score_gemma":0.011388257,"teacher_disagreement_score":0.00730254,"about_ca_system_score_codex":0.0021473537,"about_ca_system_score_gemma":0.0031267055,"threshold_uncertainty_score":0.020074546},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6882424,0.0004704935,0.20801382,0.000796356,0.00012895647,0.00012937443,0.0003975019,0.00029978633,0.101521306],"genre_scores_gemma":[0.96969116,0.00015671458,0.016746596,0.00010468963,0.00003486841,0.000056605768,0.00015126879,0.00007476587,0.012983283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995478,0.00013780726,0.000013331354,0.00006372997,0.00009829124,0.00013900628],"domain_scores_gemma":[0.9972451,0.0016808371,0.00024015445,0.00023045395,0.00029631113,0.00030713732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042033553,0.0003175451,0.0006425434,0.0008673088,0.0010449473,0.0015286098,0.0010471521,0.0005957556,0.009670098],"category_scores_gemma":[0.0041993633,0.00032816446,0.00044941227,0.00090371456,0.0009594191,0.0010700995,0.0012190987,0.00058187364,0.00050001784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068592234,0.000115322,0.0029306835,0.00023825606,0.000064777254,0.00089176197,0.000551469,0.23664519,0.010114393,0.70368993,0.008662515,0.03540969],"study_design_scores_gemma":[0.00012261693,0.000060569026,0.00092259166,0.000026854796,0.000023580196,0.00037542608,0.00028995506,0.6351045,0.0018456514,0.3577686,0.0034374879,0.00002215564],"about_ca_topic_score_codex":0.0046025915,"about_ca_topic_score_gemma":0.003342092,"teacher_disagreement_score":0.009670098,"about_ca_system_score_codex":0.00078619656,"about_ca_system_score_gemma":0.0004934046,"threshold_uncertainty_score":0.032349765},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36504036,0.003450897,0.5348891,0.006134454,0.0004508779,0.001358356,0.0019123855,0.00087859004,0.085884996],"genre_scores_gemma":[0.9390463,0.0010766654,0.035267837,0.00060760044,0.00024031349,0.00052648014,0.00088324276,0.0002888441,0.022062678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611306,0.0016466936,0.00011230615,0.00045118327,0.0005709679,0.0011057783],"domain_scores_gemma":[0.97480243,0.019567486,0.0014609412,0.0007185003,0.0015401035,0.0019105077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060886187,0.0029591531,0.0052935197,0.0027068253,0.0023912499,0.00451467,0.00789987,0.005112553,0.020312825],"category_scores_gemma":[0.028564706,0.0015160209,0.0019517925,0.0028682235,0.003354931,0.005467335,0.0033438588,0.004488035,0.0009940545],"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.0009363414,0.00054066256,0.0013352016,0.00038426014,0.00020145153,0.00017923332,0.00024553118,0.8115847,0.00059318694,0.16021013,0.010968384,0.0128208455],"study_design_scores_gemma":[0.000104508246,0.00009980486,0.00022486699,0.00001962448,0.000038515063,0.000023466158,0.00008673669,0.9700702,0.000095353695,0.028433815,0.0007778276,0.000025369047],"about_ca_topic_score_codex":0.07467113,"about_ca_topic_score_gemma":0.056572627,"teacher_disagreement_score":0.07467113,"about_ca_system_score_codex":0.008796894,"about_ca_system_score_gemma":0.010774841,"threshold_uncertainty_score":0.14847296},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033488348,0.0015661417,0.9336876,0.0023325197,0.00034152344,0.0004202351,0.0011077207,0.000781878,0.02627409],"genre_scores_gemma":[0.5005039,0.003607969,0.41418943,0.0007502658,0.0009886787,0.0013804093,0.0018202385,0.0015257365,0.07523347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832696,0.0006351348,0.000067624744,0.00026359485,0.00032054307,0.00038618236],"domain_scores_gemma":[0.99624383,0.0025325015,0.00022204506,0.00028498427,0.00035879808,0.00035781905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002067251,0.0021954973,0.0023417561,0.0013616385,0.0012414403,0.0033254926,0.003866984,0.0027292804,0.02724522],"category_scores_gemma":[0.009532088,0.0010131656,0.001060462,0.0038728425,0.0010699686,0.0048497203,0.0020273207,0.0036385872,0.0026433028],"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.00043702623,0.0005235924,0.0008406341,0.00068620243,0.000120522986,0.00015629546,0.0002276036,0.6636581,0.0025989416,0.17726684,0.03704154,0.116442814],"study_design_scores_gemma":[0.000059888243,0.00010535943,0.00032865175,0.000052005165,0.00004978038,0.00009277388,0.0001245106,0.850799,0.0009897467,0.14147021,0.005905788,0.000022229535],"about_ca_topic_score_codex":0.0044107353,"about_ca_topic_score_gemma":0.0044174073,"teacher_disagreement_score":0.02724522,"about_ca_system_score_codex":0.0027147736,"about_ca_system_score_gemma":0.0030008128,"threshold_uncertainty_score":0.09114432},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049377803,0.0019766258,0.9334743,0.0023079328,0.00035722772,0.00020877217,0.00043142398,0.0014154768,0.010450408],"genre_scores_gemma":[0.4491746,0.0011754025,0.53868467,0.0007870783,0.00049173494,0.00052064867,0.0011889884,0.00059372315,0.0073831957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977169,0.0008295646,0.000096279735,0.00037800084,0.00045147166,0.00052774936],"domain_scores_gemma":[0.99016273,0.0071825124,0.0006779037,0.00090839074,0.0005172005,0.00055125327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00434999,0.0024872748,0.002712794,0.0018066415,0.0015870527,0.0033798572,0.0056811157,0.003945362,0.0075534903],"category_scores_gemma":[0.016653791,0.0013181041,0.0015254435,0.00365189,0.0017936792,0.0062969425,0.0026690287,0.004497577,0.0012877978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009618699,0.00048402353,0.0010183855,0.00026912618,0.00010919717,0.0000648507,0.00020408366,0.8688956,0.0008893747,0.043062948,0.009661555,0.074379],"study_design_scores_gemma":[0.00012229175,0.000038710852,0.00009492281,0.000016421622,0.000023509367,0.000023451168,0.00003792,0.96683294,0.00013403098,0.03208072,0.0005856238,0.0000094337065],"about_ca_topic_score_codex":0.009489343,"about_ca_topic_score_gemma":0.010685926,"teacher_disagreement_score":0.009489343,"about_ca_system_score_codex":0.0048058876,"about_ca_system_score_gemma":0.0045570633,"threshold_uncertainty_score":0.034869373},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06620978,0.00051108253,0.9175353,0.0009991091,0.0002303155,0.00037029778,0.00071590784,0.0035593854,0.009868822],"genre_scores_gemma":[0.19019198,0.0002753331,0.79882663,0.0003765572,0.00009144312,0.00039903252,0.001776912,0.00047068126,0.0075912983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906164,0.00018595278,0.000051572064,0.0002518505,0.00022874503,0.00022021326],"domain_scores_gemma":[0.99769956,0.0011999763,0.00014188988,0.0005760724,0.00022679754,0.00015564039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013170016,0.0016962973,0.0021619154,0.0016250389,0.0012691172,0.0020146,0.003921678,0.0022959865,0.010951026],"category_scores_gemma":[0.005273939,0.0008182505,0.0018240918,0.0028635196,0.0012231271,0.003069542,0.0023855611,0.0030684683,0.00206342],"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.0011741827,0.000740889,0.0016568092,0.00042823603,0.0001358733,0.00015386424,0.00028505537,0.37535527,0.009467131,0.06223328,0.02626468,0.52210474],"study_design_scores_gemma":[0.00032673238,0.00020552662,0.0004299041,0.00003778633,0.00007337593,0.00015600341,0.00013328467,0.91850966,0.0038516365,0.07133289,0.004908884,0.00003431872],"about_ca_topic_score_codex":0.007377039,"about_ca_topic_score_gemma":0.008987012,"teacher_disagreement_score":0.010951026,"about_ca_system_score_codex":0.002216245,"about_ca_system_score_gemma":0.0047548567,"threshold_uncertainty_score":0.036634803},"labels":[],"label_agreement":null},{"id":"W2908273849","doi":"10.1007/s10878-018-00372-z","title":"An improved approximation algorithm for the minimum 3-path partition problem","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Approximation algorithm; Disjoint sets; Partition (number theory); Partition problem; Vertex cover; Theory of computation; Vertex (graph theory); Set cover problem; Discrete mathematics; Graph; Algorithm; Set (abstract data type); Computer science","score_opus":0.013819542233862584,"score_gpt":0.25850726343418323,"score_spread":0.24468772120032065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908273849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06413227,0.0011403451,0.91223747,0.0012701865,0.0003893454,0.00051406585,0.0010687326,0.0036063963,0.015641153],"genre_scores_gemma":[0.17577207,0.0004183947,0.8145596,0.00037880367,0.00017169263,0.0004991542,0.0023406146,0.0004185284,0.0054412726],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986351,0.0002642126,0.00006988783,0.00031703003,0.00042028102,0.00029346754],"domain_scores_gemma":[0.99787176,0.0010667345,0.00013789434,0.00047644894,0.0002746227,0.0001725169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010951562,0.0019043211,0.002415342,0.0019513987,0.0012926382,0.0025630093,0.004551685,0.0025145642,0.013609539],"category_scores_gemma":[0.0054475563,0.0009171753,0.001657647,0.00350954,0.0007966308,0.0042015873,0.0029436368,0.0032448033,0.0026090764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016258325,0.0010223035,0.0019106468,0.0006051971,0.00019529919,0.00024083606,0.00035189476,0.3959942,0.008471934,0.039355025,0.035209432,0.51501745],"study_design_scores_gemma":[0.00027197614,0.00013547785,0.00041106076,0.000030765998,0.000057394096,0.00015106543,0.00008032042,0.9662437,0.0013335056,0.027144836,0.0041172756,0.000022644788],"about_ca_topic_score_codex":0.0074129365,"about_ca_topic_score_gemma":0.010913326,"teacher_disagreement_score":0.013609539,"about_ca_system_score_codex":0.0025836194,"about_ca_system_score_gemma":0.003854671,"threshold_uncertainty_score":0.045528412},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31995273,0.0050914646,0.5131422,0.012678383,0.00081161765,0.0022200237,0.00409735,0.0016921229,0.14031412],"genre_scores_gemma":[0.85389036,0.0020873249,0.105281,0.0014537391,0.00038248964,0.00092001155,0.0019745755,0.00051254866,0.033497833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996999,0.0013237237,0.000095376476,0.00041332666,0.00035806606,0.0008104801],"domain_scores_gemma":[0.98636407,0.010894162,0.00050715223,0.00062591094,0.000583224,0.001025552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037924214,0.0024850552,0.0048816307,0.0020774116,0.0026239455,0.0041982313,0.0059401374,0.005042648,0.020044299],"category_scores_gemma":[0.019644365,0.0012876838,0.0014982875,0.0038879025,0.003385181,0.0065738186,0.0034272254,0.0045611686,0.0013429392],"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.0021739446,0.0008663314,0.0013782018,0.0006180443,0.00024035323,0.00022178475,0.00041032865,0.6752768,0.0008659407,0.23471741,0.038754154,0.044476688],"study_design_scores_gemma":[0.00042769944,0.00017633908,0.00037811158,0.00006691589,0.00006515592,0.00005460713,0.00020275782,0.87593985,0.00025813546,0.119112134,0.003258385,0.00005994098],"about_ca_topic_score_codex":0.089285366,"about_ca_topic_score_gemma":0.086610585,"teacher_disagreement_score":0.089285366,"about_ca_system_score_codex":0.007975682,"about_ca_system_score_gemma":0.014356484,"threshold_uncertainty_score":0.17753136},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01835753,0.001485539,0.96711206,0.0009497856,0.0003600905,0.00013755423,0.00014930061,0.0005002397,0.010947851],"genre_scores_gemma":[0.35288605,0.0030198793,0.6201304,0.00075938046,0.0011136152,0.00039886005,0.0007453265,0.00070050574,0.020246062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799865,0.0007626549,0.00010379957,0.00027163076,0.00054997543,0.0003133525],"domain_scores_gemma":[0.99142224,0.0059450953,0.00036596155,0.0009075438,0.0008042172,0.0005549117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040310053,0.0013404231,0.0027041656,0.0013506493,0.0015592596,0.00364882,0.003401636,0.0015257209,0.01012761],"category_scores_gemma":[0.014024104,0.0007977589,0.0011794217,0.0024816499,0.0010868172,0.005751266,0.002551081,0.0039725206,0.0020690153],"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.0011332829,0.00064343686,0.0007879776,0.0006582321,0.00015104156,0.000085436935,0.00037779287,0.14978568,0.0027299945,0.5032178,0.029065242,0.31136402],"study_design_scores_gemma":[0.00025785345,0.00026856762,0.00019718999,0.000045088203,0.000069494294,0.000118431104,0.000097061275,0.44472024,0.0012557578,0.54536563,0.007575161,0.000029509396],"about_ca_topic_score_codex":0.0017723588,"about_ca_topic_score_gemma":0.0025559003,"teacher_disagreement_score":0.01012761,"about_ca_system_score_codex":0.0017044832,"about_ca_system_score_gemma":0.0024098344,"threshold_uncertainty_score":0.033880234},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43625274,0.00047760666,0.5317162,0.0010922167,0.0001335665,0.0006718397,0.0019626508,0.004337995,0.023355173],"genre_scores_gemma":[0.61081403,0.0002178402,0.3782787,0.00023430459,0.00009740052,0.00028281714,0.003974466,0.0004273106,0.0056731002],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926287,0.00015551333,0.000041103547,0.00024416708,0.0001385456,0.00015786411],"domain_scores_gemma":[0.9954788,0.0029691441,0.00036291167,0.0005780803,0.00038033526,0.0002307786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005993067,0.0009294088,0.0010736351,0.0018329691,0.0012553511,0.0020048602,0.0026587103,0.0014314314,0.010363148],"category_scores_gemma":[0.005441241,0.00066570455,0.00097221695,0.0024993455,0.0009324454,0.0023841213,0.001755952,0.0012638806,0.0014566401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020091902,0.0009323899,0.007902224,0.0007891695,0.00023720488,0.00052521966,0.00072395476,0.3183107,0.03238898,0.057339806,0.030791795,0.5480494],"study_design_scores_gemma":[0.0003340098,0.0002620513,0.00146321,0.00003984049,0.00007813888,0.00016153244,0.00027238994,0.91626203,0.007666007,0.069534145,0.003887899,0.00003869129],"about_ca_topic_score_codex":0.008002302,"about_ca_topic_score_gemma":0.012868797,"teacher_disagreement_score":0.010363148,"about_ca_system_score_codex":0.0017555034,"about_ca_system_score_gemma":0.0032590677,"threshold_uncertainty_score":0.034668207},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008099476,0.00020758071,0.98749393,0.00019202325,0.00004598776,0.000024944664,0.0000150162305,0.0000337141,0.0038871993],"genre_scores_gemma":[0.34954143,0.0007787381,0.6397359,0.00024779676,0.00012832187,0.0002787279,0.00010177966,0.000101199235,0.009086095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971193,0.000079405196,0.000013153771,0.000042852887,0.00011705974,0.0000356117],"domain_scores_gemma":[0.9994917,0.0003109972,0.000032268304,0.000019916226,0.00011410447,0.000030954183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006651091,0.0006023087,0.00083487545,0.001086923,0.0005606819,0.00075284764,0.0015284219,0.0017142368,0.0025821049],"category_scores_gemma":[0.0024423967,0.0005383372,0.0009114627,0.0012657112,0.00075685466,0.0010702386,0.0012077638,0.0011514127,0.00023761713],"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.000020323176,0.00004095216,0.0002815574,0.000058364334,0.000043704575,0.00011203885,0.00006872273,0.9102756,0.0012349599,0.04623257,0.0007296005,0.040901743],"study_design_scores_gemma":[0.000006825294,0.00001629233,0.000060666847,0.0000073784313,0.0000072498447,0.000031826694,0.000008259134,0.9914021,0.00010722135,0.007803347,0.0005447092,0.0000041013222],"about_ca_topic_score_codex":0.003437452,"about_ca_topic_score_gemma":0.0028484357,"teacher_disagreement_score":0.003437452,"about_ca_system_score_codex":0.0006572524,"about_ca_system_score_gemma":0.000731934,"threshold_uncertainty_score":0.008638024},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7179537,0.0003255368,0.26253945,0.0004944572,0.00003884032,0.00015887988,0.00032538443,0.0006174894,0.017546207],"genre_scores_gemma":[0.96217805,0.00011818557,0.034741018,0.00007400725,0.00001876706,0.000043108557,0.00031839553,0.00007415794,0.0024343377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867165,0.00030912843,0.00008170173,0.0003402442,0.00035121533,0.00024617588],"domain_scores_gemma":[0.9964619,0.0020005775,0.00029295794,0.000666106,0.00037248427,0.00020598076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013506712,0.00040211764,0.0008248994,0.0016885961,0.0011170992,0.0018823112,0.00095150707,0.0005777761,0.0018049929],"category_scores_gemma":[0.004708169,0.0003059183,0.0006223209,0.00083035993,0.002311513,0.00249156,0.0020809795,0.001276305,0.00028684453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041530753,0.00014042892,0.0041086893,0.00021835291,0.000041226187,0.0005403763,0.0011479148,0.03534988,0.022594161,0.88532984,0.0014638447,0.04864997],"study_design_scores_gemma":[0.000049009483,0.00015026134,0.00104238,0.000037203677,0.000037699952,0.00036008886,0.00035596467,0.08321978,0.024502289,0.88405234,0.006163955,0.000028924118],"about_ca_topic_score_codex":0.0016132902,"about_ca_topic_score_gemma":0.001324553,"teacher_disagreement_score":0.0018823112,"about_ca_system_score_codex":0.0013399835,"about_ca_system_score_gemma":0.0007755672,"threshold_uncertainty_score":0.009722352},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01785991,0.0005658889,0.9730945,0.0005575241,0.00018851606,0.00012570675,0.00023835847,0.00145216,0.0059173354],"genre_scores_gemma":[0.1817167,0.00034723524,0.810029,0.00030782385,0.00015639585,0.00043346512,0.000850997,0.00032500416,0.005833445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986897,0.0003792317,0.00006861392,0.00029439465,0.0003001664,0.000267919],"domain_scores_gemma":[0.9974746,0.0016211366,0.00013154413,0.00024604218,0.0003810674,0.00014559484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013174295,0.0015335747,0.0024283344,0.0013312332,0.0014242621,0.0021863116,0.004112862,0.0029427805,0.009494785],"category_scores_gemma":[0.006612956,0.0011359379,0.0015566152,0.0030445606,0.00095100765,0.0027257109,0.002380393,0.0029365597,0.001992631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004957559,0.0002873476,0.0007551305,0.00016744621,0.00009745185,0.00005851705,0.00013362814,0.7813113,0.0012196403,0.01889341,0.012071112,0.18450932],"study_design_scores_gemma":[0.00005271678,0.000027681017,0.00006796168,0.000008970646,0.000009618447,0.00002458195,0.000021881911,0.9905697,0.00024005631,0.008275035,0.000692956,0.000008820964],"about_ca_topic_score_codex":0.016264113,"about_ca_topic_score_gemma":0.018495312,"teacher_disagreement_score":0.016264113,"about_ca_system_score_codex":0.0027522643,"about_ca_system_score_gemma":0.0044951844,"threshold_uncertainty_score":0.032338858},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13618295,0.0003102952,0.839466,0.00040076315,0.00008718922,0.0001445934,0.00054790446,0.0006454039,0.022214958],"genre_scores_gemma":[0.76281524,0.00043047065,0.21755822,0.00007984275,0.00003157175,0.00026465653,0.0011460994,0.0002580789,0.017415913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978584,0.00003756232,0.000011355984,0.0000588548,0.00005677028,0.00004974434],"domain_scores_gemma":[0.9991571,0.00047545636,0.000104189574,0.00007215308,0.00010761414,0.00008350641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003116659,0.00055390096,0.0005727037,0.00081630895,0.0008104163,0.0012621062,0.0010570312,0.0009118767,0.006840058],"category_scores_gemma":[0.0027795804,0.0005581859,0.00053845526,0.0010067855,0.00063181436,0.0014274565,0.001513953,0.0010422568,0.00079316355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030634442,0.00011482297,0.00097556296,0.0002062779,0.00005256608,0.00021425851,0.00018416926,0.8096686,0.0060067596,0.08658054,0.006204762,0.08948533],"study_design_scores_gemma":[0.000026013953,0.000079824145,0.00034804823,0.00003102786,0.000019880092,0.000083501305,0.000112976515,0.9290467,0.0029780394,0.06365539,0.0036069143,0.0000117072395],"about_ca_topic_score_codex":0.0027881465,"about_ca_topic_score_gemma":0.0034465527,"teacher_disagreement_score":0.006840058,"about_ca_system_score_codex":0.0009215319,"about_ca_system_score_gemma":0.0011517961,"threshold_uncertainty_score":0.022882223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062244672,0.0004871802,0.9082784,0.00063076505,0.00013281855,0.00014278993,0.00036329156,0.000633103,0.027087007],"genre_scores_gemma":[0.7278373,0.0006923285,0.25594813,0.00025957887,0.00023826408,0.00035484013,0.0008676906,0.00046690716,0.01333496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931526,0.00025782274,0.000018179693,0.00012144863,0.00015193563,0.00013537273],"domain_scores_gemma":[0.9981609,0.0012455822,0.00011118458,0.00020539177,0.00014538076,0.00013161717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011182635,0.0012942897,0.0015860549,0.00088168465,0.00051084044,0.001466184,0.0025053835,0.0012074204,0.008269575],"category_scores_gemma":[0.0043100584,0.00065721694,0.0011680824,0.0014410492,0.0008564134,0.002313204,0.001706265,0.002045177,0.000841151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020768629,0.00017252692,0.00035218525,0.00019946345,0.00007607532,0.00015491075,0.000056478057,0.7798539,0.002192566,0.12891097,0.0072947377,0.08052855],"study_design_scores_gemma":[0.00002664307,0.00005514069,0.0001559886,0.000011924817,0.000021792006,0.000037856098,0.000018325105,0.91087383,0.00064787443,0.08689417,0.0012464643,0.000009965059],"about_ca_topic_score_codex":0.0016072937,"about_ca_topic_score_gemma":0.0019782647,"teacher_disagreement_score":0.008269575,"about_ca_system_score_codex":0.0010659025,"about_ca_system_score_gemma":0.0012074675,"threshold_uncertainty_score":0.027664483},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024904482,0.00018779286,0.9706935,0.00016708171,0.00003397706,0.00007717065,0.000039636023,0.00016564492,0.0037306773],"genre_scores_gemma":[0.74867177,0.00027932427,0.2481128,0.000095816664,0.000056342702,0.00022567406,0.00013620697,0.00011794848,0.0023041903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994814,0.00019814976,0.000033737393,0.000100251775,0.00010958326,0.00007694367],"domain_scores_gemma":[0.9984988,0.0010411661,0.00020237779,0.00005900571,0.00014744094,0.00005116512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014025671,0.001159635,0.0014703191,0.0012958877,0.00042155603,0.0012921755,0.00105138,0.0013198867,0.0020798796],"category_scores_gemma":[0.004406267,0.0010477997,0.001290807,0.0005808887,0.00090078264,0.0012552686,0.0012622145,0.00095165614,0.00021919947],"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.00001546984,0.000015246584,0.000101342535,0.000019282625,0.000019046458,0.000013454999,0.000008950235,0.99332386,0.0003040736,0.001713865,0.000096338495,0.00436911],"study_design_scores_gemma":[0.0000028826169,0.000015995221,0.000030124624,0.0000029873477,0.0000037495936,0.0000027709775,0.000005642114,0.9988135,0.00011180153,0.0009321025,0.000076079756,0.0000023292462],"about_ca_topic_score_codex":0.003681301,"about_ca_topic_score_gemma":0.002469888,"teacher_disagreement_score":0.003681301,"about_ca_system_score_codex":0.0007573568,"about_ca_system_score_gemma":0.0011854401,"threshold_uncertainty_score":0.007417619},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026577914,0.00030797228,0.9851633,0.0003156845,0.00019469672,0.00018758063,0.00013102798,0.00034843825,0.010693447],"genre_scores_gemma":[0.21578056,0.0017809607,0.75200325,0.0013426447,0.0009983075,0.0019519516,0.0009725599,0.00090073183,0.024269033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948886,0.001171622,0.00024141818,0.0009791139,0.0021391585,0.0005800861],"domain_scores_gemma":[0.98306817,0.012596664,0.00053702696,0.0017289214,0.0014526863,0.00061663584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056705754,0.005927514,0.0050278916,0.0059115537,0.0023353423,0.005207905,0.0071743373,0.004012669,0.01441093],"category_scores_gemma":[0.027524523,0.0024537772,0.00591906,0.004104737,0.0050939885,0.008355178,0.009235595,0.013173141,0.0035094833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030470247,0.0007148319,0.0010984715,0.0014786004,0.0005718519,0.0006454619,0.0005685601,0.12969376,0.016155777,0.68843436,0.020619415,0.13971418],"study_design_scores_gemma":[0.00010283757,0.00016578198,0.00041248635,0.00011893255,0.00019946649,0.00022193465,0.00006546267,0.33978647,0.0039223325,0.64670163,0.008190033,0.00011259878],"about_ca_topic_score_codex":0.0033396962,"about_ca_topic_score_gemma":0.004578478,"teacher_disagreement_score":0.01441093,"about_ca_system_score_codex":0.002546706,"about_ca_system_score_gemma":0.0028785644,"threshold_uncertainty_score":0.04820943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11640301,0.0015712066,0.86114293,0.0008087613,0.00008134713,0.00024348639,0.0011858485,0.0007084962,0.01785491],"genre_scores_gemma":[0.59900534,0.0017623306,0.39003408,0.0002130236,0.00015665757,0.0002669411,0.002487039,0.00021686598,0.0058576777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988411,0.00025963466,0.00007224743,0.00027442715,0.00034886485,0.00020371574],"domain_scores_gemma":[0.99805933,0.0013103617,0.00019368503,0.00023327718,0.000120869554,0.00008248673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000640234,0.0005603098,0.00077476504,0.0008420789,0.00053443504,0.0012965847,0.0011232198,0.0009284772,0.005524217],"category_scores_gemma":[0.0039728945,0.00043065706,0.00079201855,0.0022027013,0.00068474404,0.0030294103,0.0011819302,0.0010752139,0.00051990146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006638421,0.00023222384,0.0019940243,0.00089175656,0.00010615508,0.0007036569,0.0004371639,0.38328838,0.011793657,0.27556807,0.017583251,0.30673787],"study_design_scores_gemma":[0.00010986578,0.00020421953,0.0010923732,0.0000680897,0.000053880955,0.0009611156,0.00027086044,0.66016465,0.0066549233,0.3166791,0.013696883,0.000044067667],"about_ca_topic_score_codex":0.0021661918,"about_ca_topic_score_gemma":0.0016540415,"teacher_disagreement_score":0.005524217,"about_ca_system_score_codex":0.00097189925,"about_ca_system_score_gemma":0.00081658945,"threshold_uncertainty_score":0.01848036},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37641504,0.0012532466,0.59916323,0.0027063582,0.0006135571,0.00063682214,0.0008104887,0.00039426412,0.018006962],"genre_scores_gemma":[0.9250566,0.00026583846,0.06184416,0.00020233703,0.0001614988,0.00023750492,0.00022748497,0.000060188428,0.011944321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997926,0.0008090915,0.00009189711,0.00047856555,0.00025674858,0.00043776946],"domain_scores_gemma":[0.99692553,0.0018659739,0.0002847757,0.00013552792,0.00018360726,0.00060465105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024179814,0.0013909393,0.0033111433,0.0007067365,0.0014496662,0.0030222537,0.0032673841,0.0050399546,0.006909045],"category_scores_gemma":[0.003533651,0.0015652461,0.0011361019,0.001101661,0.0015303451,0.0026221466,0.0019863641,0.0016481597,0.0006022367],"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.0022809224,0.00062259054,0.0014018364,0.00061779615,0.00021073016,0.0019170876,0.00020709856,0.9357894,0.0077411626,0.029533915,0.0028046635,0.016872905],"study_design_scores_gemma":[0.00030338325,0.0003475095,0.00049573375,0.000016643278,0.000053838925,0.00018441513,0.00009278087,0.9849104,0.0008827647,0.011710775,0.0009635084,0.000038172493],"about_ca_topic_score_codex":0.0031168852,"about_ca_topic_score_gemma":0.002591063,"teacher_disagreement_score":0.006909045,"about_ca_system_score_codex":0.0011745341,"about_ca_system_score_gemma":0.0015479524,"threshold_uncertainty_score":0.023113072},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13981453,0.00012336679,0.84052193,0.00031070213,0.00008603467,0.00023146963,0.00070536614,0.00057345093,0.017633226],"genre_scores_gemma":[0.4134172,0.00024210873,0.57679904,0.00011945797,0.000025656735,0.00014946863,0.0016399607,0.00016630108,0.00744078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959344,0.00006570013,0.000015261967,0.000112646965,0.00017838855,0.0000346181],"domain_scores_gemma":[0.99935955,0.0001442166,0.000062988904,0.00012850422,0.00019178854,0.00011289266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021553165,0.00042838525,0.0006035831,0.0018209751,0.00097265095,0.0008360369,0.0015165702,0.0009377238,0.0050742947],"category_scores_gemma":[0.0016152913,0.00041269875,0.00065283146,0.0012664124,0.00064006314,0.00093805214,0.0015778976,0.0009898933,0.0009035479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002958038,0.00039869506,0.008225432,0.0005134802,0.000106781124,0.0018279845,0.0011846249,0.13137883,0.081290506,0.46127915,0.011134752,0.30236396],"study_design_scores_gemma":[0.00006898764,0.0002623472,0.0043686004,0.00007598953,0.00007209063,0.0013860805,0.0008628345,0.679146,0.020847946,0.26102236,0.03180221,0.00008452235],"about_ca_topic_score_codex":0.0033342137,"about_ca_topic_score_gemma":0.0038704409,"teacher_disagreement_score":0.0050742947,"about_ca_system_score_codex":0.00036384183,"about_ca_system_score_gemma":0.00064915046,"threshold_uncertainty_score":0.016975224},"labels":[],"label_agreement":null},{"id":"W3185873601","doi":"10.1007/s10878-021-00753-x","title":"Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Qinglan Project of Jiangsu Province of China; Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Set cover problem; Mathematical optimization; Cover (algebra); Computer science; Stochastic programming; Approximation algorithm; Set (abstract data type); Covering problems; Stochastic optimization; Theory of computation; Optimization problem; Combinatorial optimization; Knapsack problem; Vertex cover; Mathematics; Algorithm","score_opus":0.031047118973509858,"score_gpt":0.2593955644821698,"score_spread":0.22834844550865996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185873601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062955864,0.0033819524,0.9088555,0.0044847624,0.0004824292,0.00075483875,0.0022953374,0.0019469905,0.0148423165],"genre_scores_gemma":[0.53819275,0.001908642,0.4325301,0.0015647743,0.0007512481,0.0014282232,0.003745724,0.0012006434,0.018677846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99599326,0.0015358271,0.00016157993,0.0007791867,0.0006758119,0.0008543255],"domain_scores_gemma":[0.98552877,0.0109638395,0.000795516,0.001213422,0.0006100576,0.0008884137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005937868,0.0043906015,0.008719405,0.0027899197,0.001863769,0.005391447,0.008923289,0.006236762,0.018778432],"category_scores_gemma":[0.020874936,0.0030838123,0.0038770463,0.006264162,0.002770544,0.010751908,0.0045254254,0.0069717905,0.0024148053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006347246,0.0006062259,0.0011859563,0.00047547568,0.00021347366,0.00012705404,0.00015346427,0.8762539,0.0005343057,0.05504263,0.017855002,0.046917833],"study_design_scores_gemma":[0.0000705672,0.00005045091,0.00007275706,0.000023563274,0.000027937816,0.000031291373,0.000031467098,0.96595985,0.000106544554,0.033058316,0.00055725384,0.000009899948],"about_ca_topic_score_codex":0.008933728,"about_ca_topic_score_gemma":0.013104123,"teacher_disagreement_score":0.018778432,"about_ca_system_score_codex":0.0065616937,"about_ca_system_score_gemma":0.00570588,"threshold_uncertainty_score":0.06282014},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08208166,0.0013361381,0.9110938,0.0003982312,0.00023253945,0.0003651722,0.00065054547,0.0009789327,0.0028630362],"genre_scores_gemma":[0.49540234,0.00069225713,0.4989322,0.0001757532,0.00017898467,0.00053650665,0.0020647715,0.0004242031,0.0015930139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99031925,0.0041830917,0.0006612748,0.0013022012,0.003159815,0.0003743414],"domain_scores_gemma":[0.96874183,0.019125024,0.0022757042,0.003665494,0.0049484316,0.0012434744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00909245,0.0019148681,0.002432559,0.010155047,0.0019173,0.0036133085,0.0034984115,0.0029538572,0.0019964695],"category_scores_gemma":[0.05317372,0.00052213774,0.0013808847,0.0066821417,0.0020907123,0.0077127,0.00458148,0.002088666,0.0006163703],"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.0013367267,0.0007576977,0.02228611,0.0010527925,0.0014264428,0.00020872157,0.000726484,0.5028898,0.0090190815,0.08640941,0.010535796,0.3633509],"study_design_scores_gemma":[0.000083698214,0.0005415899,0.0024813677,0.000055834367,0.00012295839,0.00020306834,0.00023264387,0.9505768,0.003603809,0.03916024,0.0028730726,0.00006498364],"about_ca_topic_score_codex":0.0039704004,"about_ca_topic_score_gemma":0.0037481866,"teacher_disagreement_score":0.010155047,"about_ca_system_score_codex":0.0022230654,"about_ca_system_score_gemma":0.0018383703,"threshold_uncertainty_score":0.048086047},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025671365,0.00087178353,0.96438825,0.0005420202,0.00016860709,0.00017134623,0.00021759034,0.0010161716,0.0069528846],"genre_scores_gemma":[0.36546522,0.00061758107,0.6215017,0.00055103144,0.00031795684,0.00050698104,0.00060294295,0.00052891125,0.0099076135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981635,0.0006948064,0.00010577652,0.0002929035,0.00048099775,0.00026208194],"domain_scores_gemma":[0.99310875,0.0042216494,0.00030387033,0.0012229215,0.0008543086,0.00028842446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030416385,0.0012043582,0.002345174,0.0013826749,0.00094225944,0.0017398256,0.003791162,0.0016262471,0.008028052],"category_scores_gemma":[0.013617153,0.00091623556,0.0006853617,0.003136675,0.0011153346,0.0037477005,0.002777378,0.002431868,0.0017762977],"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.0014211683,0.0006086562,0.0009830893,0.00028299086,0.00014278188,0.00010696613,0.00026179737,0.47417215,0.006286452,0.11357186,0.02482317,0.3773389],"study_design_scores_gemma":[0.00011377208,0.00010017378,0.00008084616,0.000020592966,0.000018865729,0.000063364714,0.000029803508,0.947864,0.0010651425,0.04888308,0.0017478815,0.000012502874],"about_ca_topic_score_codex":0.0024632742,"about_ca_topic_score_gemma":0.0057484126,"teacher_disagreement_score":0.008028052,"about_ca_system_score_codex":0.0013262521,"about_ca_system_score_gemma":0.002353253,"threshold_uncertainty_score":0.026856542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13902313,0.006972745,0.60142547,0.015838519,0.0011105916,0.0013364556,0.008198463,0.0011555227,0.2249392],"genre_scores_gemma":[0.7044997,0.006831481,0.21858755,0.0017905617,0.0008138451,0.0010045741,0.004500021,0.0010886978,0.060883496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962501,0.0010090143,0.00008688758,0.0005257145,0.00092101906,0.0012072255],"domain_scores_gemma":[0.98659235,0.009085083,0.0005147997,0.00090227247,0.0013434106,0.0015621562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033230598,0.0030460677,0.0035729462,0.002805399,0.0031995592,0.0063057058,0.006468719,0.0034174563,0.02932077],"category_scores_gemma":[0.02289609,0.0013339613,0.00179802,0.007998151,0.0038584797,0.010505674,0.0047223233,0.007362281,0.0014394438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073725934,0.00042445323,0.00093186536,0.0006035287,0.000106138206,0.00020308857,0.0003047328,0.5205485,0.0011866398,0.3782037,0.050652906,0.04609724],"study_design_scores_gemma":[0.00009594771,0.00010649573,0.00045619908,0.00013348935,0.00006889481,0.00011026193,0.00024881377,0.7255249,0.0005254506,0.261945,0.010730075,0.000054575077],"about_ca_topic_score_codex":0.13080469,"about_ca_topic_score_gemma":0.16988872,"teacher_disagreement_score":0.13080469,"about_ca_system_score_codex":0.011698879,"about_ca_system_score_gemma":0.01578891,"threshold_uncertainty_score":0.26008666},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023320189,0.0005725557,0.9710931,0.0004410768,0.00012881907,0.00009735409,0.00012865529,0.0011478967,0.0030704564],"genre_scores_gemma":[0.4372666,0.0003488479,0.557554,0.00028927982,0.00015948729,0.00032255068,0.0006081672,0.0003461665,0.0031048844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971712,0.0013374371,0.00014726358,0.00028745443,0.00066106924,0.00039553043],"domain_scores_gemma":[0.98090464,0.014619379,0.00084829546,0.0019413438,0.0012323908,0.0004539581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004972566,0.0016488235,0.0021905182,0.0015225101,0.00083293783,0.0018614616,0.0046903715,0.0015979261,0.0046942374],"category_scores_gemma":[0.022814913,0.0009104624,0.001353508,0.0023118816,0.0013001313,0.0034988902,0.0018392754,0.0032214443,0.0006382181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065128674,0.00030291645,0.0010667384,0.00014743701,0.00007405458,0.000067938876,0.00007246422,0.85676897,0.0011159352,0.024371354,0.003453613,0.11190723],"study_design_scores_gemma":[0.000025565929,0.000024977791,0.000054395303,0.0000052933306,0.000007972607,0.000009571145,0.0000049220926,0.9909416,0.00019326898,0.008585424,0.00014393478,0.0000029404503],"about_ca_topic_score_codex":0.0074148597,"about_ca_topic_score_gemma":0.007924855,"teacher_disagreement_score":0.0074148597,"about_ca_system_score_codex":0.0029020635,"about_ca_system_score_gemma":0.0036332703,"threshold_uncertainty_score":0.026297748},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22908948,0.0013251202,0.70670897,0.0045956746,0.00030937206,0.0005772026,0.0012110991,0.0044784974,0.05170448],"genre_scores_gemma":[0.59652495,0.00067709904,0.37204146,0.001044725,0.00025863072,0.0005643635,0.0015024884,0.00090483547,0.026481489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812025,0.00060962356,0.00012240156,0.00037415317,0.00042064543,0.00035294215],"domain_scores_gemma":[0.99230874,0.0050145113,0.0004629101,0.0014292288,0.00046388677,0.0003206937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001567903,0.0008761287,0.0016883694,0.0010036358,0.0014750318,0.0033789994,0.0033046692,0.0016266993,0.015051498],"category_scores_gemma":[0.012539074,0.0010841943,0.0012042279,0.0020306662,0.0013471922,0.0089621395,0.0034056604,0.0026019376,0.0022602698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020338607,0.0009867181,0.0023826975,0.000590174,0.00015256443,0.00022084538,0.00056707027,0.10925492,0.010142871,0.5668984,0.03985877,0.2669111],"study_design_scores_gemma":[0.00032502197,0.00014953905,0.00041929065,0.00003719422,0.00006292417,0.00012630083,0.00011937174,0.4202559,0.0030253085,0.5707977,0.004659505,0.000021911426],"about_ca_topic_score_codex":0.0027962085,"about_ca_topic_score_gemma":0.0052771596,"teacher_disagreement_score":0.015051498,"about_ca_system_score_codex":0.0024335543,"about_ca_system_score_gemma":0.0022955167,"threshold_uncertainty_score":0.050352216},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014189407,0.00090387306,0.9781569,0.0012659587,0.000112760405,0.00011567876,0.00026072288,0.00073644496,0.004258241],"genre_scores_gemma":[0.31671247,0.001400269,0.66617656,0.0010005363,0.0004674929,0.0007777955,0.0025493826,0.0007728364,0.010142654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965366,0.001429938,0.00013271201,0.0006064762,0.000839755,0.00045450768],"domain_scores_gemma":[0.9843709,0.010942487,0.0009065754,0.001783879,0.0013428634,0.00065316615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048007523,0.0021004565,0.003468012,0.0025711067,0.0017432766,0.003888403,0.0071840105,0.0040278975,0.007332577],"category_scores_gemma":[0.027746944,0.0015327572,0.0018952723,0.0064537013,0.0020176817,0.005133334,0.004578902,0.006237108,0.002199325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005081952,0.00046812894,0.001240833,0.00028046727,0.00014881043,0.00008574453,0.00019594464,0.77589726,0.00094730814,0.09314338,0.017373944,0.10970996],"study_design_scores_gemma":[0.00004494335,0.000019165424,0.00009162306,0.000013802796,0.000013532006,0.000022578963,0.000018513123,0.9652532,0.00015510462,0.03371687,0.0006436465,0.0000070066076],"about_ca_topic_score_codex":0.011175838,"about_ca_topic_score_gemma":0.011806715,"teacher_disagreement_score":0.011175838,"about_ca_system_score_codex":0.0050963066,"about_ca_system_score_gemma":0.0049331705,"threshold_uncertainty_score":0.036976457},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01041642,0.003159299,0.008558072,0.5056974,0.45257926,0.000071862436,0.0032636297,0.0005430369,0.015710954],"genre_scores_gemma":[0.29772043,0.0075026364,0.0115208365,0.17375673,0.34184358,0.0002792642,0.0035360076,0.0010643307,0.16277623],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.99632275,0.0008816459,0.00038221697,0.0007368784,0.0013493409,0.0003272288],"domain_scores_gemma":[0.9438806,0.03110508,0.0017517374,0.0032573084,0.018031925,0.0019733347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058073895,0.00087704405,0.0017161341,0.0016380971,0.002112603,0.004300893,0.0040414697,0.009406661,0.026830066],"category_scores_gemma":[0.05749156,0.00047995514,0.0013950518,0.0017245067,0.002609913,0.002414631,0.0016475478,0.007835648,0.0073155863],"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.000275535,0.00012352574,0.0012297623,0.00022969682,0.00012032356,0.0006505923,0.00012601011,0.000833296,0.0004410025,0.022296997,0.95758384,0.016089352],"study_design_scores_gemma":[0.0005198991,0.00048107884,0.020232614,0.0007464398,0.0007337045,0.0015758352,0.0006978649,0.020592526,0.005005673,0.14315668,0.8059529,0.00030472432],"about_ca_topic_score_codex":0.00870305,"about_ca_topic_score_gemma":0.0073195416,"teacher_disagreement_score":0.026830066,"about_ca_system_score_codex":0.003564988,"about_ca_system_score_gemma":0.003498124,"threshold_uncertainty_score":0.089755535},"labels":[],"label_agreement":null},{"id":"W4315641735","doi":"10.1007/s10878-022-00978-4","title":"Two approximation algorithms for maximizing nonnegative weakly monotonic set functions","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Submodular set function; Mathematics; Monotone polygon; Approximation algorithm; Monotonic function; Combinatorics; Greedy algorithm; Theory of computation; Maximization; Set function; Set (abstract data type); Discrete mathematics; Function (biology); Mathematical optimization; Algorithm; Computer science; Mathematical analysis","score_opus":0.03909375940252006,"score_gpt":0.2958453431144178,"score_spread":0.2567515837118977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315641735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019239368,0.00076835876,0.9730179,0.0011025999,0.00017434543,0.00017701296,0.00013969744,0.00042923936,0.004951491],"genre_scores_gemma":[0.22984791,0.0008140805,0.7582572,0.00058624835,0.00033346866,0.0005934726,0.0005495253,0.00036088415,0.008657227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956285,0.0020488894,0.00022367031,0.0006709441,0.00088956207,0.00053843745],"domain_scores_gemma":[0.98877525,0.0074796556,0.0005627464,0.0014275009,0.0010821798,0.0006727043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007313938,0.0030145424,0.003567094,0.0024018784,0.0013281027,0.004847298,0.007390582,0.0051543075,0.0051678973],"category_scores_gemma":[0.02894962,0.0016290142,0.0030232454,0.003882228,0.0026008477,0.0071060914,0.005832007,0.00602922,0.0010731494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013063452,0.00062024506,0.0021184713,0.000519129,0.00020280431,0.00013079583,0.0005745549,0.2968599,0.0032567626,0.36916405,0.014538828,0.3107081],"study_design_scores_gemma":[0.0001225201,0.00012033943,0.00027780238,0.00005578783,0.00006834511,0.000104262166,0.00006904346,0.8749598,0.0012165426,0.121077105,0.0018943364,0.000034067663],"about_ca_topic_score_codex":0.0026019996,"about_ca_topic_score_gemma":0.0031070344,"teacher_disagreement_score":0.007390582,"about_ca_system_score_codex":0.0048704697,"about_ca_system_score_gemma":0.0036241726,"threshold_uncertainty_score":0.038680255},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5922357,0.0018073969,0.32082877,0.0024498045,0.00044148503,0.000372806,0.0013156355,0.007119872,0.07342861],"genre_scores_gemma":[0.7000201,0.00046389375,0.27781695,0.0003628417,0.00012248168,0.0001876927,0.0014291353,0.00062602316,0.018970845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993561,0.00016361629,0.00002648868,0.00012817662,0.00017308803,0.00015261395],"domain_scores_gemma":[0.9956593,0.0031080197,0.00020832654,0.00048576386,0.00032960583,0.0002089264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062216795,0.0008689653,0.0012367882,0.002062935,0.0012841106,0.0013186642,0.0019319648,0.0014589598,0.015542072],"category_scores_gemma":[0.007185381,0.000603157,0.0007086063,0.0026792916,0.0008881193,0.003094163,0.0015359969,0.001090833,0.0012326955],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018445574,0.00043187273,0.00361891,0.0008768393,0.00011738369,0.00047274824,0.00046018272,0.40113235,0.011343038,0.1380642,0.053613365,0.38802466],"study_design_scores_gemma":[0.00016000544,0.000119356315,0.0005564817,0.000047554237,0.000029869141,0.00013277878,0.0001205521,0.9058234,0.0025770825,0.08651935,0.0038962502,0.00001731903],"about_ca_topic_score_codex":0.008628178,"about_ca_topic_score_gemma":0.012539558,"teacher_disagreement_score":0.015542072,"about_ca_system_score_codex":0.0016357524,"about_ca_system_score_gemma":0.0012755285,"threshold_uncertainty_score":0.05199337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047243736,0.0014426633,0.9810823,0.00046176344,0.00030534645,0.00011475986,0.00025074513,0.00051562925,0.015354335],"genre_scores_gemma":[0.024360575,0.004396735,0.9542433,0.00064136006,0.0005871542,0.00042007846,0.0006118719,0.0005682664,0.014170552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987941,0.00031902507,0.00009005143,0.00023800154,0.00046030345,0.00009852408],"domain_scores_gemma":[0.99937624,0.00030346366,0.000041972922,0.00012982366,0.00012103642,0.00002749094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010298422,0.0012579155,0.0014708128,0.0015421214,0.0007937454,0.0025015573,0.0033713693,0.001999886,0.02742235],"category_scores_gemma":[0.004093517,0.0011664862,0.0017017841,0.003466557,0.0008937739,0.0038042143,0.0025251363,0.0047751092,0.012610067],"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.00006885862,0.00025204787,0.00023382487,0.00068543805,0.000078412704,0.00012490548,0.00007838153,0.097900495,0.005081267,0.4561733,0.037464023,0.40185907],"study_design_scores_gemma":[0.00003549569,0.000104628634,0.00027125535,0.00016380889,0.000031292377,0.00041402862,0.000032336917,0.34963116,0.0032958016,0.5247615,0.12117792,0.00008074711],"about_ca_topic_score_codex":0.0013666905,"about_ca_topic_score_gemma":0.0016763046,"teacher_disagreement_score":0.02742235,"about_ca_system_score_codex":0.0013008738,"about_ca_system_score_gemma":0.0016086189,"threshold_uncertainty_score":0.09173685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013866339,0.00052322133,0.9787586,0.00032452992,0.00011886948,0.00007789156,0.00014587503,0.00014009349,0.006044583],"genre_scores_gemma":[0.6330602,0.0008060489,0.3535166,0.0002596066,0.000216908,0.00067175576,0.0004911901,0.00020898644,0.010768699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996228,0.00017656077,0.000017385553,0.00004040898,0.00009545163,0.000047314843],"domain_scores_gemma":[0.9988294,0.00074390095,0.0000967613,0.000059509017,0.00020452548,0.00006575091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014157575,0.0012772182,0.0017398322,0.0008380609,0.0006394553,0.0015233555,0.001680905,0.0016234593,0.003547951],"category_scores_gemma":[0.0029910125,0.0011075421,0.0012802065,0.0011078238,0.00088551163,0.0014688008,0.0017347472,0.002025688,0.00044419826],"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.000008241872,0.000015800124,0.000064594446,0.000026602604,0.000015254942,0.000029450948,0.000010499557,0.99161506,0.00010569718,0.005089036,0.00033369893,0.0026860929],"study_design_scores_gemma":[0.0000022987,0.0000036063923,0.000010803974,0.0000020311413,0.0000015892108,0.0000015509538,0.0000022017866,0.9988086,0.000014019166,0.0010510772,0.000100881705,0.0000013310797],"about_ca_topic_score_codex":0.012978381,"about_ca_topic_score_gemma":0.014341343,"teacher_disagreement_score":0.012978381,"about_ca_system_score_codex":0.0008072551,"about_ca_system_score_gemma":0.0020225854,"threshold_uncertainty_score":0.025805652},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18835345,0.0066039325,0.76826245,0.004861009,0.00039198247,0.00061856216,0.0025601722,0.0021312034,0.026217226],"genre_scores_gemma":[0.75248384,0.0040850737,0.22579725,0.0010773287,0.0007251041,0.0010827042,0.004988506,0.0015840768,0.008176044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928774,0.0030057835,0.00028376302,0.0014128011,0.0014035684,0.0010167275],"domain_scores_gemma":[0.9460522,0.039368477,0.0031229605,0.0073058503,0.0022549403,0.0018956714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065970453,0.00441556,0.0039346,0.0051756944,0.0024988663,0.008650592,0.008056277,0.005047835,0.011596574],"category_scores_gemma":[0.07198911,0.0025435064,0.0022475135,0.009185735,0.0034752488,0.01620021,0.0072378297,0.007332664,0.0023097862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021401139,0.00110883,0.00806631,0.0008594636,0.00028139207,0.0002064724,0.00093729404,0.6133539,0.0071101314,0.20392206,0.024144394,0.13786955],"study_design_scores_gemma":[0.00010087352,0.00012958447,0.0007394814,0.0001473714,0.00011539845,0.00019966619,0.00021451963,0.7734081,0.0017106187,0.2201913,0.0029991185,0.000043893644],"about_ca_topic_score_codex":0.0033384298,"about_ca_topic_score_gemma":0.0047890362,"teacher_disagreement_score":0.011596574,"about_ca_system_score_codex":0.005820735,"about_ca_system_score_gemma":0.0032231442,"threshold_uncertainty_score":0.042232573},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8710176,0.0024225647,0.10259057,0.004619711,0.00026121343,0.000104963896,0.0032866963,0.00077425945,0.01492252],"genre_scores_gemma":[0.97936696,0.0009892524,0.014311165,0.00030070398,0.00046125002,0.00009558544,0.0012797371,0.00030914677,0.0028861123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742484,0.0007745622,0.00014563756,0.0007039655,0.0004963522,0.00045474057],"domain_scores_gemma":[0.9211084,0.063153155,0.005477068,0.0035511516,0.0028653468,0.0038448551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043084384,0.0010696917,0.0028739134,0.0034516433,0.0014723501,0.004543525,0.0050095688,0.0030164304,0.007325597],"category_scores_gemma":[0.052035686,0.0020595882,0.00130674,0.0033539203,0.0028946097,0.011230457,0.0024003054,0.0020564604,0.0005438202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004056852,0.0005437393,0.03044046,0.0016688767,0.000820598,0.00054953736,0.0010485223,0.31169313,0.02533519,0.5419761,0.025662553,0.056204483],"study_design_scores_gemma":[0.00015985378,0.00019075203,0.006121373,0.000102535945,0.00017962922,0.0003926341,0.00032198112,0.44673997,0.0046247565,0.53916276,0.0019468104,0.000056870507],"about_ca_topic_score_codex":0.001724212,"about_ca_topic_score_gemma":0.0018310961,"teacher_disagreement_score":0.007325597,"about_ca_system_score_codex":0.0026238058,"about_ca_system_score_gemma":0.0015846255,"threshold_uncertainty_score":0.02450651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08612706,0.00083220965,0.88753384,0.005048582,0.00021517609,0.00014347903,0.0015530281,0.000499033,0.01804753],"genre_scores_gemma":[0.8245882,0.0007679913,0.16426855,0.0006259053,0.00036602232,0.00021300737,0.00067892997,0.00015566277,0.0083357645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99587005,0.0022507978,0.00012715535,0.000551787,0.00066585856,0.0005343259],"domain_scores_gemma":[0.9919051,0.0056532375,0.00050394033,0.0012551841,0.00029440311,0.00038813762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052060876,0.0009400007,0.0021520364,0.00064217765,0.0007519159,0.0039262217,0.0021052915,0.0016143917,0.0034105221],"category_scores_gemma":[0.015031399,0.0007555427,0.0008008914,0.0020062919,0.0021796643,0.0053569837,0.0029147507,0.0034743373,0.000692062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010520159,0.00029435952,0.0007036985,0.0002956609,0.0000985493,0.00029407165,0.00016478189,0.3411817,0.0034016797,0.60531205,0.011435199,0.035766255],"study_design_scores_gemma":[0.00012553293,0.00006601948,0.00010198895,0.000029595172,0.000016989261,0.000116189134,0.000047634792,0.5782884,0.0012114525,0.41815272,0.0018216711,0.000021908798],"about_ca_topic_score_codex":0.0009663063,"about_ca_topic_score_gemma":0.0013628263,"teacher_disagreement_score":0.0052060876,"about_ca_system_score_codex":0.0029889443,"about_ca_system_score_gemma":0.003135727,"threshold_uncertainty_score":0.027532756},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62711656,0.0005021481,0.14369796,0.0020134551,0.0003316699,0.000403974,0.0045643123,0.0021419337,0.21922807],"genre_scores_gemma":[0.8862743,0.00045653665,0.050089777,0.00068580656,0.00009246393,0.0002694147,0.0032476876,0.00045494162,0.05842922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950445,0.00006435167,0.000020271875,0.00013277672,0.00011906921,0.00015910158],"domain_scores_gemma":[0.9983942,0.0005219948,0.00033164315,0.00019147119,0.0003077168,0.00025311514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002740175,0.00076909654,0.0006211184,0.0011185793,0.001030006,0.0026676229,0.0014302139,0.0008775807,0.022139976],"category_scores_gemma":[0.0020739331,0.00094698404,0.00058124063,0.0015547778,0.0012380406,0.0018613375,0.0013560563,0.0016815163,0.0018426452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067293865,0.0002598914,0.0031841088,0.0004694577,0.000080347374,0.000606253,0.00038937508,0.017859705,0.017190704,0.85636604,0.024190636,0.078730434],"study_design_scores_gemma":[0.00020226896,0.00013700227,0.0059432858,0.00011320547,0.00015557828,0.00094854855,0.000513236,0.038228825,0.014078897,0.8930967,0.04648677,0.00009575973],"about_ca_topic_score_codex":0.0031398928,"about_ca_topic_score_gemma":0.0062337425,"teacher_disagreement_score":0.022139976,"about_ca_system_score_codex":0.0011736149,"about_ca_system_score_gemma":0.00091067323,"threshold_uncertainty_score":0.074065566},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16916592,0.0023590922,0.37815687,0.011660927,0.0004693799,0.00020088586,0.0005477877,0.0001463551,0.43729275],"genre_scores_gemma":[0.93554944,0.0011913712,0.011482798,0.00058281043,0.00021334886,0.00013644784,0.00014224504,0.000045973586,0.050655566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995839,0.00018725972,0.000009733338,0.00006734732,0.00007600597,0.000075648444],"domain_scores_gemma":[0.9986523,0.00088023726,0.000078401245,0.00006965315,0.00011311064,0.00020634221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007007378,0.000768573,0.00071085594,0.0006364754,0.0008034379,0.0021371513,0.0010087908,0.0015925082,0.010727033],"category_scores_gemma":[0.0045558824,0.00030753072,0.00037176037,0.0004971931,0.0020863812,0.0028391532,0.0012505787,0.0018532234,0.00053337426],"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.000025264393,0.000018163744,0.0001016719,0.000024945371,0.000009908191,0.000062401115,0.000039601895,0.01981321,0.0002977982,0.9716983,0.0049008313,0.0030078432],"study_design_scores_gemma":[0.000026060607,0.000017534065,0.00008132039,0.000014518585,0.0000071567433,0.00006000789,0.000058887876,0.08844297,0.000116447765,0.9063766,0.004791371,0.000007211554],"about_ca_topic_score_codex":0.0023678986,"about_ca_topic_score_gemma":0.0017625374,"teacher_disagreement_score":0.010727033,"about_ca_system_score_codex":0.0016004903,"about_ca_system_score_gemma":0.0014093213,"threshold_uncertainty_score":0.035885453},"labels":[],"label_agreement":null},{"id":"W4398143310","doi":"10.1007/s10878-024-01178-y","title":"The frustum network model based on clique extension","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Frustum; Extension (predicate logic); Theory of computation; Clique; Computer science; Mathematics; Combinatorics; Algorithm; Programming language; Geometry","score_opus":0.007567530312318666,"score_gpt":0.23355045132413746,"score_spread":0.2259829210118188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398143310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18130277,0.0014127599,0.73919,0.003901778,0.00030341948,0.00019759439,0.0014185801,0.00044632622,0.07182674],"genre_scores_gemma":[0.9095294,0.0012031902,0.049888976,0.00044735157,0.00030491297,0.00021071133,0.00067005504,0.0001619799,0.037583422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935466,0.0002566732,0.000010172875,0.00014582822,0.000087344146,0.00014544585],"domain_scores_gemma":[0.9982432,0.000844066,0.00024362524,0.00018663921,0.00020745335,0.00027511557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094783393,0.0010352549,0.0014670045,0.001510356,0.0015266074,0.0021213263,0.0035481348,0.002724314,0.009985469],"category_scores_gemma":[0.004052852,0.00066391024,0.0012597704,0.0017291658,0.0016841871,0.0044315136,0.0017146864,0.0025322277,0.0009259815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014382943,0.00008043301,0.00040556557,0.000083094405,0.000037624635,0.00019854159,0.00011770225,0.27751204,0.0008519228,0.7060342,0.006681454,0.007853622],"study_design_scores_gemma":[0.000022097205,0.000028440068,0.00015252162,0.000020356665,0.000020891866,0.00007576023,0.00004046241,0.791407,0.00016189751,0.20545924,0.002590922,0.000020373487],"about_ca_topic_score_codex":0.0118717775,"about_ca_topic_score_gemma":0.011560693,"teacher_disagreement_score":0.0118717775,"about_ca_system_score_codex":0.0023701254,"about_ca_system_score_gemma":0.001245553,"threshold_uncertainty_score":0.033404768},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61877966,0.0139606595,0.23072691,0.0053882482,0.0010833774,0.00011173523,0.0014813775,0.00041438593,0.12805355],"genre_scores_gemma":[0.9348143,0.008014876,0.0422003,0.0006750255,0.0015972374,0.00017627473,0.0008829847,0.00048484636,0.011154179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890924,0.0003835984,0.00004538727,0.0002037271,0.00027233557,0.00018574382],"domain_scores_gemma":[0.98118114,0.014162766,0.0016912811,0.00053687167,0.0009947745,0.0014330818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001726686,0.0013433524,0.001587457,0.0042657848,0.001385732,0.0029259,0.0025548427,0.0014915279,0.0073866686],"category_scores_gemma":[0.01954756,0.0012067511,0.0007139304,0.0027479462,0.0034453524,0.0053775315,0.0033030047,0.0024507293,0.00094811304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050633406,0.00012214013,0.0082222475,0.00048929075,0.000085898384,0.00030384547,0.0008313058,0.079725094,0.0064529344,0.8456998,0.014345878,0.043215208],"study_design_scores_gemma":[0.00010253254,0.00014353504,0.006848987,0.00026459392,0.000094056486,0.0005211498,0.0007081823,0.2077907,0.0016929774,0.7684169,0.013336576,0.00007994675],"about_ca_topic_score_codex":0.0021067515,"about_ca_topic_score_gemma":0.0019724024,"teacher_disagreement_score":0.0073866686,"about_ca_system_score_codex":0.002068789,"about_ca_system_score_gemma":0.0005227931,"threshold_uncertainty_score":0.024710834},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030459529,0.00009794417,0.9947643,0.00007682852,0.000038875063,0.00005357861,0.0000697955,0.0015032878,0.00034944055],"genre_scores_gemma":[0.0801073,0.00012290661,0.9142884,0.00015604713,0.000107045154,0.00033425353,0.00072471803,0.0012032295,0.0029560882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573356,0.0016481208,0.0003555854,0.0010071825,0.00091220567,0.0003433197],"domain_scores_gemma":[0.98102194,0.011155307,0.0006148097,0.004208219,0.002495459,0.00050425023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004236746,0.0017647982,0.0031397452,0.0027589628,0.0014484387,0.002623031,0.0063721933,0.0022915788,0.0119056385],"category_scores_gemma":[0.030380862,0.0011776546,0.0023879963,0.0034141513,0.0016487859,0.0043527763,0.004232329,0.0046548583,0.0044289185],"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.00089077867,0.00058884453,0.0016057536,0.00039492946,0.00026263727,0.00021265364,0.00044196562,0.27574235,0.011555147,0.051972315,0.012457415,0.64387524],"study_design_scores_gemma":[0.00005706773,0.00004580215,0.00016695942,0.000011496394,0.000025038218,0.00006493887,0.000034173056,0.9704939,0.002531758,0.025121557,0.001418854,0.000028419247],"about_ca_topic_score_codex":0.005745181,"about_ca_topic_score_gemma":0.008954684,"teacher_disagreement_score":0.0119056385,"about_ca_system_score_codex":0.0013203601,"about_ca_system_score_gemma":0.0026927614,"threshold_uncertainty_score":0.03982836},"labels":[],"label_agreement":null},{"id":"W4401103106","doi":"10.1007/s10878-024-01193-z","title":"Maximizing stochastic set function under a matroid constraint from decomposition","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Matroid; Combinatorics; Pi; Lattice (music); Physics; Mathematics; Discrete mathematics","score_opus":0.016183519577256323,"score_gpt":0.26374662749282485,"score_spread":0.24756310791556851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401103106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036330484,0.00021509246,0.9556914,0.0005258006,0.00004936339,0.000049034064,0.00024131614,0.00020097867,0.006696469],"genre_scores_gemma":[0.69017226,0.0005217436,0.2965086,0.00035744638,0.00023530086,0.000273209,0.000778669,0.0003880621,0.010764777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986326,0.00057201757,0.00004926171,0.00026486182,0.00032375846,0.00015742428],"domain_scores_gemma":[0.99736905,0.0014795851,0.00024468522,0.00029087145,0.00033266496,0.00028308752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019981205,0.0010363286,0.0020661622,0.0009415146,0.0005027621,0.0020446,0.001677669,0.001594067,0.003755062],"category_scores_gemma":[0.0062771114,0.00073132664,0.0011577394,0.0013794295,0.0010201479,0.0023503776,0.0023205702,0.0019072018,0.0005030682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019019116,0.00018077112,0.0009129568,0.0002495924,0.0001151111,0.00020896264,0.00011944221,0.5358267,0.00765696,0.40709698,0.0074789836,0.03996338],"study_design_scores_gemma":[0.000012007649,0.000033336357,0.00018129496,0.000012783393,0.000014672313,0.000075178395,0.000011043455,0.8930246,0.00082236796,0.105033815,0.00076890405,0.000010020947],"about_ca_topic_score_codex":0.0012869291,"about_ca_topic_score_gemma":0.0011098814,"teacher_disagreement_score":0.003755062,"about_ca_system_score_codex":0.0015993827,"about_ca_system_score_gemma":0.0015209182,"threshold_uncertainty_score":0.012561917},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042967033,0.0012164532,0.9315467,0.0022787463,0.00062585465,0.00019935347,0.00041844323,0.000574691,0.020172697],"genre_scores_gemma":[0.6992865,0.0010957932,0.27331513,0.00049874827,0.0008302631,0.0003140445,0.000328411,0.0005292345,0.023801886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960055,0.002300344,0.000119127806,0.000543894,0.00057558477,0.00045562998],"domain_scores_gemma":[0.9902334,0.005786913,0.00054581335,0.00150969,0.0009247394,0.0009993993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063782977,0.0016587693,0.0033010289,0.0016031777,0.0019412985,0.0033380874,0.0049076686,0.0020855395,0.0070041274],"category_scores_gemma":[0.018688487,0.0012603446,0.0012904013,0.0031975491,0.0028360416,0.0044844956,0.0029552153,0.0039873365,0.00087904447],"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.001013043,0.00026876124,0.0005560181,0.00041753822,0.000109601366,0.000099513105,0.00016661336,0.56817573,0.0016745827,0.33520868,0.018751698,0.07355818],"study_design_scores_gemma":[0.00004175398,0.00011491837,0.00016909266,0.000029774757,0.000024049614,0.000040859788,0.00001756498,0.7950158,0.0005874407,0.20202427,0.0019100321,0.000024418743],"about_ca_topic_score_codex":0.0016859149,"about_ca_topic_score_gemma":0.0019634923,"teacher_disagreement_score":0.0070041274,"about_ca_system_score_codex":0.0019275802,"about_ca_system_score_gemma":0.0038169082,"threshold_uncertainty_score":0.033732057},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9001177,0.00038995314,0.0601895,0.00068123086,0.000089132074,0.00012302914,0.0009871025,0.00028790356,0.037134383],"genre_scores_gemma":[0.97565186,0.00028744913,0.018390723,0.00015725532,0.000027541757,0.000091287264,0.0007032873,0.00007033892,0.0046203006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99978,0.000049044582,0.0000094087145,0.00006800334,0.00003815926,0.000055466196],"domain_scores_gemma":[0.99803644,0.001085576,0.00034474634,0.00012968424,0.00014513684,0.00025841902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025840645,0.00041663964,0.0005592787,0.001228796,0.0012685867,0.0018816654,0.0009251627,0.0011836648,0.011977338],"category_scores_gemma":[0.0030680103,0.0006188184,0.00048005898,0.0013779504,0.0015534983,0.001976628,0.001022754,0.00085688476,0.0006028024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008530541,0.00024985638,0.0075457077,0.00090707693,0.00015280946,0.0011469141,0.0010217435,0.088164054,0.013049562,0.8247213,0.015017993,0.047169987],"study_design_scores_gemma":[0.00017112505,0.0001404177,0.005397195,0.00008364263,0.00008755538,0.0005394087,0.00081659795,0.1454431,0.0023292245,0.84014153,0.0048087635,0.00004151013],"about_ca_topic_score_codex":0.0030266764,"about_ca_topic_score_gemma":0.0041376757,"teacher_disagreement_score":0.011977338,"about_ca_system_score_codex":0.0006844925,"about_ca_system_score_gemma":0.00073552097,"threshold_uncertainty_score":0.04006821},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024749864,0.0038392488,0.9496282,0.002519926,0.00034555214,0.00012660927,0.00036814684,0.00043427595,0.017988222],"genre_scores_gemma":[0.4436969,0.0043492555,0.52919215,0.0009490588,0.0007431473,0.00052007457,0.0014780561,0.00047215653,0.01859916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832517,0.0008759898,0.00005565064,0.00022103483,0.00027450366,0.0002475652],"domain_scores_gemma":[0.99205375,0.006560893,0.00032653034,0.0003762103,0.00040443352,0.00027819644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032994463,0.0016872301,0.0022856274,0.001577558,0.0009540133,0.0028155528,0.00330433,0.0031514436,0.007363305],"category_scores_gemma":[0.014893087,0.0010155544,0.0016118676,0.003077951,0.0015371273,0.0038543125,0.0019458993,0.0044189845,0.00092044874],"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.00027786056,0.00024196884,0.00071570644,0.00018382842,0.000093160874,0.000053605345,0.000086968575,0.832495,0.00024091425,0.09185269,0.011713442,0.0620449],"study_design_scores_gemma":[0.00004350757,0.00002045803,0.000081683276,0.000020014731,0.000015973,0.000017907261,0.000022970913,0.9510164,0.000063463085,0.047508504,0.0011834251,0.0000055862456],"about_ca_topic_score_codex":0.012428267,"about_ca_topic_score_gemma":0.011791432,"teacher_disagreement_score":0.012428267,"about_ca_system_score_codex":0.003256855,"about_ca_system_score_gemma":0.0029908605,"threshold_uncertainty_score":0.024711847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09863346,0.0010560881,0.8697698,0.0012340823,0.0004854807,0.00082206074,0.0020656427,0.005774952,0.02015842],"genre_scores_gemma":[0.14599954,0.0003201012,0.8417723,0.00031475432,0.00010235123,0.00045867136,0.0029178462,0.00039608238,0.0077182543],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870634,0.00020962876,0.00007634348,0.0002891528,0.0004066776,0.00031181052],"domain_scores_gemma":[0.9982153,0.0007840611,0.00010114122,0.00051437813,0.00024833975,0.00013673578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007167431,0.0018709849,0.0021455348,0.0019925514,0.0011979418,0.0020929608,0.0038808417,0.0019697945,0.016946904],"category_scores_gemma":[0.00376878,0.0008626518,0.0017901761,0.004334701,0.0007691984,0.0028964148,0.0028552643,0.0020172545,0.003052797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012014491,0.00073433056,0.0019436395,0.00052596483,0.00016876255,0.00025628466,0.0002486262,0.25982976,0.011557205,0.030107353,0.037803426,0.6556232],"study_design_scores_gemma":[0.00020789292,0.00017308045,0.00048662355,0.00003841963,0.00006712168,0.00024572658,0.00010972356,0.9655574,0.0037483447,0.022694098,0.00664691,0.000024708397],"about_ca_topic_score_codex":0.009040045,"about_ca_topic_score_gemma":0.013221896,"teacher_disagreement_score":0.016946904,"about_ca_system_score_codex":0.0020887195,"about_ca_system_score_gemma":0.003295325,"threshold_uncertainty_score":0.056693077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087315045,0.00095586467,0.8732251,0.00068631326,0.00048250813,0.0004352397,0.0004306875,0.002106424,0.034362823],"genre_scores_gemma":[0.35561037,0.00038863564,0.63452566,0.0003175267,0.00009208734,0.00039733105,0.00054108544,0.00042375815,0.007703558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995932,0.00008165009,0.000013962797,0.00005770202,0.00010051853,0.00015289478],"domain_scores_gemma":[0.9995011,0.00024276607,0.00003673194,0.000052973046,0.00009575152,0.000070647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003985114,0.0009932758,0.0012806412,0.0011644147,0.0010091504,0.0012180279,0.0016894676,0.0017730859,0.011714812],"category_scores_gemma":[0.0013597861,0.0007254791,0.0011263877,0.0016843693,0.0005226785,0.0010817904,0.0012683088,0.0014941016,0.0012318058],"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.00026394997,0.00031785775,0.00025283362,0.00010882123,0.00003238243,0.00011485671,0.00006255249,0.84911317,0.002633611,0.011074595,0.0072074872,0.12881784],"study_design_scores_gemma":[0.00004916107,0.000057731824,0.00007393463,0.000010833831,0.00001110851,0.00002719223,0.000024823023,0.9941273,0.00047138965,0.003350685,0.0017831946,0.000012729534],"about_ca_topic_score_codex":0.015570485,"about_ca_topic_score_gemma":0.019513253,"teacher_disagreement_score":0.015570485,"about_ca_system_score_codex":0.0015013295,"about_ca_system_score_gemma":0.003008366,"threshold_uncertainty_score":0.039189935},"labels":[],"label_agreement":null},{"id":"W4410403751","doi":"10.1007/s10878-025-01308-0","title":"Better approximating SONET k-edge partition for small capacity k","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Synchronous optical networking; Partition (number theory); Theory of computation; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Mathematics; Discrete mathematics; Parallel computing; Computer network; Algorithm; Telecommunications","score_opus":0.015262999486374024,"score_gpt":0.2321040588423008,"score_spread":0.21684105935592676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410403751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41245568,0.001299059,0.54481006,0.0017830372,0.00053347176,0.00031782742,0.0020915985,0.003005503,0.033703763],"genre_scores_gemma":[0.69198173,0.00043977622,0.29003203,0.000597364,0.00012147493,0.00028266563,0.0025755994,0.0008971607,0.013072188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905103,0.00030335883,0.00003903752,0.00017080901,0.00020712208,0.00022860302],"domain_scores_gemma":[0.9966298,0.0015842061,0.00015353413,0.00090204977,0.00037039875,0.00036001025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010675401,0.0014719532,0.0022745088,0.00135545,0.0013042948,0.002344563,0.0029610065,0.0016929545,0.017789727],"category_scores_gemma":[0.007941127,0.00073648954,0.0008862422,0.0021148971,0.001084419,0.003980277,0.0024286509,0.0020271142,0.0026319982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034160973,0.0007040043,0.0027177047,0.00053251017,0.00016766119,0.00039437728,0.00050451583,0.72071826,0.014485702,0.06560266,0.038697764,0.1520587],"study_design_scores_gemma":[0.0001211803,0.00015908993,0.00033810656,0.000035495934,0.000027178845,0.00013849179,0.00019676071,0.9492885,0.0023670748,0.044905644,0.0024041445,0.000018423794],"about_ca_topic_score_codex":0.0042824093,"about_ca_topic_score_gemma":0.0073303767,"teacher_disagreement_score":0.017789727,"about_ca_system_score_codex":0.0016306232,"about_ca_system_score_gemma":0.0017991276,"threshold_uncertainty_score":0.059512556},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37830037,0.0048979735,0.42581028,0.0135402335,0.0007488037,0.0005284096,0.005009931,0.00079642795,0.17036758],"genre_scores_gemma":[0.8900778,0.002223038,0.080665976,0.0010430494,0.0018494364,0.0003685865,0.0034534875,0.00043930902,0.019879328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955765,0.0011859802,0.00021944923,0.0009420014,0.0010168793,0.0010591828],"domain_scores_gemma":[0.97226614,0.022753164,0.0017234567,0.0015361257,0.0010211249,0.00069997937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025264241,0.0017144335,0.002589751,0.0016333815,0.00227124,0.007302909,0.0037484306,0.0037475277,0.013400658],"category_scores_gemma":[0.025610315,0.0013698407,0.002207394,0.0037464206,0.002690121,0.009735819,0.0030066534,0.006572109,0.0014967367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001698432,0.001985015,0.004714471,0.0016516051,0.0003516465,0.0017382749,0.0008289631,0.18058296,0.0039206585,0.64963114,0.07927466,0.07362222],"study_design_scores_gemma":[0.00023978368,0.00007690113,0.00088867184,0.00005357966,0.0000801081,0.00067877024,0.00025852493,0.2984818,0.0010804641,0.69376475,0.0043406296,0.000055991597],"about_ca_topic_score_codex":0.003584672,"about_ca_topic_score_gemma":0.004592863,"teacher_disagreement_score":0.013400658,"about_ca_system_score_codex":0.002558532,"about_ca_system_score_gemma":0.0025659099,"threshold_uncertainty_score":0.044829607},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038348176,0.00076490385,0.9533171,0.00055469596,0.00027384647,0.000100146375,0.00011731277,0.0009140882,0.0056097982],"genre_scores_gemma":[0.48488235,0.00038705213,0.50906706,0.00026761767,0.00020459597,0.0002401038,0.00038283734,0.00027533312,0.004293029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984068,0.00053885044,0.00006249996,0.00023142959,0.00040680464,0.00035360825],"domain_scores_gemma":[0.99477166,0.0033553103,0.0003002423,0.000729208,0.00054493616,0.00029865224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030611109,0.0014361549,0.0017532327,0.0012830623,0.0011845146,0.0022257522,0.0038142584,0.0017429598,0.004552002],"category_scores_gemma":[0.009627281,0.0008590929,0.001072246,0.002308803,0.0008622237,0.0027078423,0.0018728026,0.0032912083,0.0006510002],"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.0004986811,0.00029719307,0.00076348026,0.00009327172,0.00006536177,0.000051598232,0.00008828701,0.8861787,0.0013283085,0.019773873,0.004223524,0.08663781],"study_design_scores_gemma":[0.00001746487,0.000016984392,0.00003779189,0.0000035987566,0.0000065562763,0.0000072258517,0.0000063319358,0.99439055,0.00016235631,0.005126783,0.00022197318,0.0000024119606],"about_ca_topic_score_codex":0.0076420065,"about_ca_topic_score_gemma":0.011008455,"teacher_disagreement_score":0.0076420065,"about_ca_system_score_codex":0.0031041927,"about_ca_system_score_gemma":0.0035440186,"threshold_uncertainty_score":0.022522628},"labels":[],"label_agreement":null},{"id":"W4410951340","doi":"10.1007/s10878-025-01311-5","title":"Approximation algorithms for the total dominating set problem","year":2025,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Dominating set; Theory of computation; Approximation algorithm; Algorithm; Set (abstract data type); Set cover problem; Mathematics; Computer science; Mathematical optimization; Combinatorics; Graph; Vertex (graph theory)","score_opus":0.018128412770283365,"score_gpt":0.27632276594259153,"score_spread":0.25819435317230816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410951340","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038682938,0.0038475476,0.9355152,0.0030700476,0.00059833453,0.00025106163,0.0007474095,0.0011367116,0.016150722],"genre_scores_gemma":[0.4425764,0.003319315,0.53646266,0.0011686769,0.00083222537,0.0005825668,0.0022336403,0.0006361252,0.012188321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715865,0.0010015935,0.00013189406,0.00055063877,0.0006986131,0.0004586233],"domain_scores_gemma":[0.9890542,0.008201197,0.0005005649,0.0010832142,0.00065051886,0.0005103111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00379405,0.0022314896,0.0032134538,0.0022489736,0.0014189071,0.004420963,0.0048235557,0.002561056,0.006005918],"category_scores_gemma":[0.016443964,0.0010943589,0.002113735,0.004288648,0.0014507815,0.006596043,0.0030401205,0.004542878,0.0011050127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010121778,0.0007240938,0.00149396,0.00065750536,0.0002850798,0.00010347075,0.00030935262,0.62508696,0.0015344584,0.13043843,0.026899166,0.21145529],"study_design_scores_gemma":[0.00015167843,0.000090163514,0.00018962425,0.000042089297,0.0000748409,0.00008398227,0.00006464439,0.87850916,0.0004330313,0.117658496,0.0026876272,0.000014678473],"about_ca_topic_score_codex":0.004353843,"about_ca_topic_score_gemma":0.0057807043,"teacher_disagreement_score":0.006005918,"about_ca_system_score_codex":0.004157118,"about_ca_system_score_gemma":0.0032778007,"threshold_uncertainty_score":0.030162096},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16684118,0.0012825582,0.7992106,0.0034852624,0.00032585138,0.00090086786,0.0020371657,0.0029872546,0.022929313],"genre_scores_gemma":[0.43549433,0.0006562789,0.545841,0.000843351,0.0002583789,0.00089974597,0.0042893505,0.0010112314,0.010706388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835664,0.00050851615,0.00008143376,0.00043908082,0.00025553876,0.00035875713],"domain_scores_gemma":[0.9948592,0.0033064405,0.00042788213,0.0006356059,0.00035362423,0.00041725853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019645146,0.0023422027,0.002350238,0.0020622362,0.0020064742,0.0048832432,0.0052752877,0.0036369872,0.018890474],"category_scores_gemma":[0.009758943,0.0013345064,0.0014310115,0.003127614,0.0014490831,0.009201216,0.0046385447,0.0029991714,0.0029254563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025997504,0.001344459,0.0034247758,0.0013635788,0.00026708515,0.00022939141,0.0009916236,0.48509982,0.0060697757,0.106094286,0.04627808,0.3462374],"study_design_scores_gemma":[0.00043514336,0.00013036124,0.00047329644,0.000081715414,0.00007309849,0.00011216887,0.00033604432,0.82922506,0.0016828404,0.16414165,0.0032799907,0.000028654404],"about_ca_topic_score_codex":0.0050695785,"about_ca_topic_score_gemma":0.0074490495,"teacher_disagreement_score":0.018890474,"about_ca_system_score_codex":0.002291751,"about_ca_system_score_gemma":0.0027286173,"threshold_uncertainty_score":0.06319493},"labels":[],"label_agreement":null}]}